F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_37591345_1371.cpp: In function 'long long int qpow(int)':
0_0_37591345_1371.cpp:3:18: error: expected ')' before 'using'
 #define mod 9973 using namespace std;
                  ^
0_0_37591345_1371.cpp:4:206: note: in expansion of macro 'mod'
  int n; ll ans[15][15]; ll temp[15][15]; ll x[15][15]; ll qpow(int p){ p--; while(p){ if(p&1){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+ans[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ ans[i][j]=temp[i][j]; temp[i][j]=0; } } } p>>=1; // x=x*x%mod; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+x[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ x[i][j]=temp[i][j]; temp[i][j]=0; } } } long long sum=0; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i==j){ sum=(sum+ans[i][j])%mod; } } } return sum; } int main(){ int t,m; cin>>t; while(t--){ cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>x[i][j]; ans[i][j]=x[i][j]; } } cout<<qpow(m)<<endl; } return 0; }
                                                                                                                                                                                                              ^
0_0_37591345_1371.cpp:4:209: error: expected primary-expression before ')' token
  int n; ll ans[15][15]; ll temp[15][15]; ll x[15][15]; ll qpow(int p){ p--; while(p){ if(p&1){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+ans[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ ans[i][j]=temp[i][j]; temp[i][j]=0; } } } p>>=1; // x=x*x%mod; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+x[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ x[i][j]=temp[i][j]; temp[i][j]=0; } } } long long sum=0; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i==j){ sum=(sum+ans[i][j])%mod; } } } return sum; } int main(){ int t,m; cin>>t; while(t--){ cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>x[i][j]; ans[i][j]=x[i][j]; } } cout<<qpow(m)<<endl; } return 0; }
                                                                                                                                                                                                                 ^
0_0_37591345_1371.cpp:4:315: error: expected '}' at end of input
  int n; ll ans[15][15]; ll temp[15][15]; ll x[15][15]; ll qpow(int p){ p--; while(p){ if(p&1){ for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+ans[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ ans[i][j]=temp[i][j]; temp[i][j]=0; } } } p>>=1; // x=x*x%mod; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ for(int z=1;z<=n;z++){ temp[i][j]=(temp[i][j]+x[i][z]*x[z][j]%mod)%mod; } } } for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ x[i][j]=temp[i][j]; temp[i][j]=0; } } } long long sum=0; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ if(i==j){ sum=(sum+ans[i][j])%mod; } } } return sum; } int main(){ int t,m; cin>>t; while(t--){ cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>x[i][j]; ans[i][j]=x[i][j]; } } cout<<qpow(m)<<endl; } return 0; }
                                                                                                                                                                                                                                                                                                                           ^
0_0_37591345_1371.cpp:4:315: error: expected '}' at end of input


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-09-30 12:16:58, Gzip enabled