0_0_38799856_12354.cpp:287:11: error: redefinition of 'const long long int N'
287 | const int N=5e3+10;
| ^
0_0_38799856_12354.cpp:15:11: note: 'const long long int N' previously defined here
15 | const int N=5e3+10;
| ^
0_0_38799856_12354.cpp:288:11: error: redefinition of 'const long long int mod'
288 | const int mod=1e9+7;
| ^~~
0_0_38799856_12354.cpp:16:11: note: 'const long long int mod' previously defined here
16 | const int mod=1e9+7;
| ^~~
0_0_38799856_12354.cpp:289:46: error: redefinition of 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> > pq'
289 | priority_queue<int,vector<int>,greater<int>> pq;
| ^~
0_0_38799856_12354.cpp:17:46: note: 'std::priority_queue<long long int, std::vector<long long int>, std::greater<long long int> > pq' previously declared here
17 | priority_queue<int,vector<int>,greater<int>> pq;
| ^~
0_0_38799856_12354.cpp:290:5: error: redefinition of 'long long int gcd(long long int, long long int)'
290 | int gcd(int x,int y){if(y==0) return x;else return gcd(y,x%y);}
| ^~~
0_0_38799856_12354.cpp:18:5: note: 'long long int gcd(long long int, long long int)' previously defined here
18 | int gcd(int x,int y){if(y==0) return x;else return gcd(y,x%y);}
| ^~~
0_0_38799856_12354.cpp:291:5: error: redefinition of 'long long int powmod(long long int, long long int)'
291 | int powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
| ^~~~~~
0_0_38799856_12354.cpp:19:5: note: 'long long int powmod(long long int, long long int)' previously defined here
19 | int powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
| ^~~~~~
0_0_38799856_12354.cpp:292:5: error: redefinition of 'long long int fastpow(long long int, long long int)'
292 | int fastpow(int a,int n){int ans=1;while(n){if(n&1) ans=(ans*a)%mod;a=(a*a)%mod;n>>=1;}return ans;}
| ^~~~~~~
0_0_38799856_12354.cpp:20:5: note: 'long long int fastpow(long long int, long long int)' previously defined here
20 | int fastpow(int a,int n){int ans=1;while(n){if(n&1) ans=(ans*a)%mod;a=(a*a)%mod;n>>=1;}return ans;}
| ^~~~~~~
0_0_38799856_12354.cpp:318:5: error: redefinition of 'long long int f [5010][5010]'
318 | int f[N][N];
| ^
0_0_38799856_12354.cpp:46:5: note: 'long long int f [5010][5010]' previously declared here
46 | int f[N][N];
| ^
0_0_38799856_12354.cpp:319:5: error: redefinition of 'long long int a [5010]'
319 | int a[N];
| ^
0_0_38799856_12354.cpp:47:5: note: 'long long int a [5010]' previously declared here
47 | int a[N];
| ^
0_0_38799856_12354.cpp:321:8: error: redefinition of 'int main()'
321 | signed main()
| ^~~~
0_0_38799856_12354.cpp:49:8: note: 'int main()' previously defined here
49 | signed main()
| ^~~~
|
