QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#271111 | #5301. Modulo Ruins the Legend | arahato | WA | 4ms | 3740kb | C++14 | 830b | 2023-12-01 23:27:12 | 2023-12-01 23:27:12 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define int long long
int n,m,s,a,b,x,y;
int gcd(int x,int y){
return x?gcd(y%x,x):y;
}
int exgcd(int a,int b,int &x,int &y){
if(!b) return x=1,y=0,a;
int g;return g=exgcd(b,a%b,y,x),y-=a/b*x,g;
}
auto solve(int a,int b,int c){
int x,y,g;
g=exgcd(a,b,x,y);
if(c%g) return pair<int,int>{-1,-1};
x*=c/g;
x=(x%b+b)%b;
y=(c-a*x)/b;
// cerr<<a<<" "<<b<<" "<<c<<" "<<x<<" "<<y<<endl;
return pair<int,int>{x,y};
}
signed main(){
ios::sync_with_stdio(0);
cin>>n>>m;
for(int i=1,x;i<=n;i++) cin>>x,s=(s+x)%m;
int A=n,B=n*(n+1)/2;
int g=gcd(A,B);
for(int i=0;i<n;i++){
pair<int,int> a=solve(g,m,i-s);
if(a.first==-1) continue;
pair<int,int> b=solve(A,B,a.first*g);
cout<<i<<endl<<b.first<<" "<<b.second<<endl;
break;
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3660kb
input:
6 24 1 1 4 5 1 4
output:
1 6 1
result:
ok ok
Test #2:
score: 0
Accepted
time: 0ms
memory: 3740kb
input:
7 29 1 9 1 9 8 1 0
output:
0 0 0
result:
ok ok
Test #3:
score: 0
Accepted
time: 0ms
memory: 3672kb
input:
1 1 0
output:
0 0 0
result:
ok ok
Test #4:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
1 1000000000 963837005
output:
0 0 36162995
result:
ok ok
Test #5:
score: 0
Accepted
time: 0ms
memory: 3692kb
input:
2 1 0 0
output:
0 0 0
result:
ok ok
Test #6:
score: 0
Accepted
time: 0ms
memory: 3612kb
input:
2 1000000000 948507269 461613424
output:
0 1 196626435
result:
ok ok
Test #7:
score: 0
Accepted
time: 4ms
memory: 3620kb
input:
100000 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
0 0 0
result:
ok ok
Test #8:
score: -100
Wrong Answer
time: 3ms
memory: 3692kb
input:
100000 1000000000 253614966 278270960 980235895 498158918 928430170 216003119 852570558 948400590 239257296 897053667 294741176 38297441 382677590 406314557 609468973 854148232 314532767 738191551 158215002 5865825 920471826 380037058 356271728 749175327 28319049 208101105 953758995 896570758 521930...
output:
46613 1035950000 -10719
result:
wrong answer Integer parameter [name=s] equals to 1035950000, violates the range [0, 999999999]