2108: Incomplete Book
Submit Page Summary Time Limit: 1 Sec Memory Limit: 128 Mb Submitted: 54 Solved: 34Description
Meorge Arr Arr Gartin, the pirate, is currently writing a series of amazing novels. Full of inspiration, his first novel only took him k days to write. However, as time went on, he started writing slower and slower. In particular, if it took him L days to write the ith book in the series, then it will take him 2L days to write the (i + 1)th book. Because of how slow he is writing the series, fans are worried that he will not be around long enough to finish the series before he dies. What is the maximum number of books that he can finish before he dies?
Input
The input consists of a single line containing two integers k (1 ≤ k ≤ 365), which is the number of days needed to write the first book, and d (k ≤ d ≤ 109), which is the number of days after he started writing the first book that he will die.
Output
Display the maximum number of books that he can finish.
Sample Input
1 1 1 2 1 3 117 1337
Sample Output
1 1 2 3
Hint
Source
South Pacific Divisionals
题解：水题，随便写啦~
AC代码
#include <iostream>
#include <string>
#include <string.h>
#include <vector>
#include <map>
#include <queue>
#include <algorithm>
typedef long long ll;
using namespace std;
int main(){
ll k, d;
while(scanf("%lld %lld", &k, &d) != EOF){
ll ans = 0;
while(d >= k){
ans++;
d -= k;
k = k * 2;
}
printf("%lld\n", ans);
}
return 0;
}