UVA10934DroppingWaterBalloons

//UVA10934DroppingWaterBalloons
#include<cstdio>
#include<cstring>
const int MAXK = 100;
const int maxtrial = 63;
unsigned long long d[MAXK + 5][maxtrial + 5];

int main() {
	int k;
	unsigned long long n;
	memset(d, 0, sizeof(d));
	for(int i = 1; i <= MAXK; i++) 
	    for(int j = 1; j <= maxtrial; j++) 
	    	d[i][j] = d[i - 1][j - 1] + 1 + d[i][j - 1];
	int ans = 0;
	while(scanf("%d%lld", &k, &n) == 2 && k && n) {
		ans = -1;
		for(int i = 1; i <= maxtrial; i++) if(d[k][i] >= n) {
		//出現可在規定實驗步驟内超過最高樓層的方案 
			ans = i; break;
		}
		if(ans < 0) printf("More than 63 trials needed.\n");
		else printf("%d\n", ans);
	}
	return 0;
}
/*
2 100
10 786599
4 786599
60 1844674407370955161
63 9223372036854775807
0 0
*/