Description
Ghost Millet is very clever, because of this, he is very busy, often have the Commissioner of the car's special agent came to him to consult politics. One day, when he traveled in Xianyang, his friend told him that the largest auction house in Xianyang (Ju Bao) is going to hold an auction, in which one of the treasures aroused his great interest, that is no word heavenly book. However, his itinerary is very full, he has bought a long-distance coach to Handan, unfortunately, the departure time is at the end of the auction. So, he decided to prepare in advance, the number of his own gold and a small bag good, so that in his existing gold coins under the ability to pay, any number of gold coins he can use these closed a combination of good money for the bill. Ghost Valley is also a very frugal person, he tried to make himself in the premise of satisfying the above requirements, the use of the minimum number of bags, and no two money bags have the same number of gold more than 1. Suppose he had m gold coins, could you guess how many money bags he would use, and how many gold coins were in each bag?
Input
contains an integer that represents the total number of gold coins existing in the ghost millet m. Among them, 1≤m≤1000000000.
Output
only an integer h, indicating the number of pockets of money
Sample Input
3
Sample Output
2
Analysis: I got a big go I finally found a water problem in BZ, this question, wow Ka ka two points direct a AH. Obviously if you can show X, you can show 2*x. And then it's settled ...
#include <iostream>#include<cstdio>using namespacestd;intMain () {Long Longm; CIN>>m; intnow=1; for(intI=1; i<=1000000; i++) { now*=2; if(now>m) {cout << i << Endl;return 0; } }}
BZOJ1192 the money bag of ghost millet