C - Reading comprehension 二分法 求等比数列前N项和

Read the program below carefully then answer the question. 
#pragma comment(linker, "/STACK:1024000000,1024000000") 
#include  
#include 
#include  
#include  
#include  
#include 

const int MAX=100000*2; 
const int INF=1e9; 

int main() 
{ 
  int n,m,ans,i; 
  while(scanf("%d%d",&n,&m)!=EOF) 
  { 
    ans=0; 
    for(i=1;i<=n;i++) 
    { 
      if(i&1)ans=(ans*2+1)%m; 
      else ans=ans*2%m; 
    } 
    printf("%d\n",ans); 
  } 
  return 0; 
}

InputMulti test cases，each line will contain two integers n and m. Process to end of file. 
TechnicalSpecification 
1<=n, m <= 1000000000OutputFor each case，output an integer，represents the output of above program.Sample Input

1 10
3 100

Sample Output

1
5

等比数列二分求和：

（1）当时，

（2）当时，那么有

    

（3）当时，那么有

    

 

#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include

 

转载于:https://www.cnblogs.com/joeylee97/p/7237849.html