0_0_20612878_14205.cpp:3:5: error: expected unqualified-id before '=' token
=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num+s; } }void Cminus(__int64 t){ __int64 i,s; __int64 k; for (i=0;i<up;i++) { s=0; k=a[i].val; while(t>=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num-s; } }__int64 Count(__int64 n,__int64 p){ __int64 i,j,s; s=1; while(n!=0) { if (n%2==1) { s=s*p%MOD; } p=p*p%MOD; n=n/2; } return s;} int main(){ __int64 i,t,j,n,T,m; __int64 ans; scanf("%I64d",&T); Isprime(); while(T--) { scanf("%I64d%I64d",&n,&m); for (i=0;i<up;i++) { a[i].num=0; } Cplus(m+n); Cminus(m); Cminus(n+1); t=n+1-m; for (i=0;i<up;i++) { while(t%a[i].val==0) { a[i].num++; t=t/a[i].val; } if (t==1) break; } ans=1; for (i=0;i<up;i++) { ans=ans*Count(a[i].num,a[i].val)%MOD; } printf("%I64d\n",ans); } return 0;}
^
0_0_20612878_14205.cpp:3:79: error: 'a' does not name a type
=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num+s; } }void Cminus(__int64 t){ __int64 i,s; __int64 k; for (i=0;i<up;i++) { s=0; k=a[i].val; while(t>=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num-s; } }__int64 Count(__int64 n,__int64 p){ __int64 i,j,s; s=1; while(n!=0) { if (n%2==1) { s=s*p%MOD; } p=p*p%MOD; n=n/2; } return s;} int main(){ __int64 i,t,j,n,T,m; __int64 ans; scanf("%I64d",&T); Isprime(); while(T--) { scanf("%I64d%I64d",&n,&m); for (i=0;i<up;i++) { a[i].num=0; } Cplus(m+n); Cminus(m); Cminus(n+1); t=n+1-m; for (i=0;i<up;i++) { while(t%a[i].val==0) { a[i].num++; t=t/a[i].val; } if (t==1) break; } ans=1; for (i=0;i<up;i++) { ans=ans*Count(a[i].num,a[i].val)%MOD; } printf("%I64d\n",ans); } return 0;}
^
0_0_20612878_14205.cpp:3:103: error: expected declaration before '}' token
=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num+s; } }void Cminus(__int64 t){ __int64 i,s; __int64 k; for (i=0;i<up;i++) { s=0; k=a[i].val; while(t>=k) { s=s+t/k; k=k*a[i].val; } a[i].num=a[i].num-s; } }__int64 Count(__int64 n,__int64 p){ __int64 i,j,s; s=1; while(n!=0) { if (n%2==1) { s=s*p%MOD; } p=p*p%MOD; n=n/2; } return s;} int main(){ __int64 i,t,j,n,T,m; __int64 ans; scanf("%I64d",&T); Isprime(); while(T--) { scanf("%I64d%I64d",&n,&m); for (i=0;i<up;i++) { a[i].num=0; } Cplus(m+n); Cminus(m); Cminus(n+1); t=n+1-m; for (i=0;i<up;i++) { while(t%a[i].val==0) { a[i].num++; t=t/a[i].val; } if (t==1) break; } ans=1; for (i=0;i<up;i++) { ans=ans*Count(a[i].num,a[i].val)%MOD; } printf("%I64d\n",ans); } return 0;}
^
|
