代码如下qwq：

#include <iostream>
using namespace std;
typedef unsigned long long ull;
string a;
ull l, ans, counter[200], maxn;
char t;
int main(){
	cin >> a >> l;
	for(ull i = 0; i < a.length(); i++){
		counter[a[i]]++;
		if(counter[a[i]] > maxn){
			maxn = counter[a[i]];
			t = a[i];
		}
	}
	ull len = a.length();
	while(len < l){
		ans++;
		len += maxn;
		maxn *= 2;
	}
	cout << ans << endl;
	return 0;
}