0_0_20611263_12584.cpp:4:5: error: expected unqualified-id before numeric constant
0; n=n/2) { if(n%2 == 1) { b = (b*a)%k; } a = (a*a)%k; } return b%k;} __int64 cacul_sum(int d, int n, int k){ int l; __int64 t1,t2,r; l = (d-1)*k; t1 = powmod(d, n+1, l); t2 = (t1+l-1)%l; r = t2/(d-1); return r;} int cacul_res(int n, int k){ __int64 m1,m2,m,r; m1 = cacul_sum(251, n, k); m2 = cacul_sum(2, 3*n, k); m = (m1*m2)%k; r = powmod(2008, m, k); return r;}int main(){ int n,k; __int64 r; while(1) { scanf("%d%d", &n, &k); if((n==0)&&(k==0)) break; r = cacul_res(n,k); printf("%I64d\n", r); } return 0;}
^
0_0_20611263_12584.cpp:4:8: error: 'n' does not name a type
0; n=n/2) { if(n%2 == 1) { b = (b*a)%k; } a = (a*a)%k; } return b%k;} __int64 cacul_sum(int d, int n, int k){ int l; __int64 t1,t2,r; l = (d-1)*k; t1 = powmod(d, n+1, l); t2 = (t1+l-1)%l; r = t2/(d-1); return r;} int cacul_res(int n, int k){ __int64 m1,m2,m,r; m1 = cacul_sum(251, n, k); m2 = cacul_sum(2, 3*n, k); m = (m1*m2)%k; r = powmod(2008, m, k); return r;}int main(){ int n,k; __int64 r; while(1) { scanf("%d%d", &n, &k); if((n==0)&&(k==0)) break; r = cacul_res(n,k); printf("%I64d\n", r); } return 0;}
^
0_0_20611263_12584.cpp:4:110: error: expected unqualified-id before 'return'
0; n=n/2) { if(n%2 == 1) { b = (b*a)%k; } a = (a*a)%k; } return b%k;} __int64 cacul_sum(int d, int n, int k){ int l; __int64 t1,t2,r; l = (d-1)*k; t1 = powmod(d, n+1, l); t2 = (t1+l-1)%l; r = t2/(d-1); return r;} int cacul_res(int n, int k){ __int64 m1,m2,m,r; m1 = cacul_sum(251, n, k); m2 = cacul_sum(2, 3*n, k); m = (m1*m2)%k; r = powmod(2008, m, k); return r;}int main(){ int n,k; __int64 r; while(1) { scanf("%d%d", &n, &k); if((n==0)&&(k==0)) break; r = cacul_res(n,k); printf("%I64d\n", r); } return 0;}
^
0_0_20611263_12584.cpp:4:121: error: expected declaration before '}' token
0; n=n/2) { if(n%2 == 1) { b = (b*a)%k; } a = (a*a)%k; } return b%k;} __int64 cacul_sum(int d, int n, int k){ int l; __int64 t1,t2,r; l = (d-1)*k; t1 = powmod(d, n+1, l); t2 = (t1+l-1)%l; r = t2/(d-1); return r;} int cacul_res(int n, int k){ __int64 m1,m2,m,r; m1 = cacul_sum(251, n, k); m2 = cacul_sum(2, 3*n, k); m = (m1*m2)%k; r = powmod(2008, m, k); return r;}int main(){ int n,k; __int64 r; while(1) { scanf("%d%d", &n, &k); if((n==0)&&(k==0)) break; r = cacul_res(n,k); printf("%I64d\n", r); } return 0;}
^
|
