Ultraviolet A 11645-Bits (number theory + counting problem)

Question link: 11645-Bits meaning: given a number n, the number of consecutive 11 in the binary format of 0-n is required. Idea: This is similar to the question of the remote control system. However, the biggest answer to this question is longlong, which requires high precision. Code:

# Include

 
  
# Include

  
   
Long n, a, B; const long DIG = 1e13; void add (long num) {B + = num; a + = B/DIG; B % = DIG;} int main () {int cas = 0; while (~ Scanf ("% lld", & n) & n> = 0) {a = B = 0; long tmp = n, d = 1; while (n> 1) {add (n> 2) * d); if (n & 3) = 3) add (tmp & (d-1) + 1 ); d <= 1; n >>= 1;} printf ("Case % d:", ++ cas); if (a) {printf ("% lld ", a); printf ("% 013lld \ n", B);} else printf ("% lld \ n", B);} return 0 ;}