QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#789064 | #9799. Magical Palette | lxllxs | WA | 41ms | 3704kb | C++20 | 818b | 2024-11-27 19:12:14 | 2024-11-27 19:12:17 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int,int> pii;
typedef unsigned long long ull;
typedef long long ll;
typedef __int128 i128;
const int N=2e5+5,M=2e5+5,T=20,mod=998244353,B=131,INF=2e9,P=1000000711;
int gcd(int a,int b){
return b==0?a:gcd(b,a%b);
}
void solve(){
int n,m;
cin>>n>>m;
if(gcd(n,m)!=1){
cout<<"No"<<endl;
return ;
}
cout<<"Yes"<<endl;
for(int i=1;i<=n;i++){
cout<<1+(i-1)*m<<" ";
}
cout<<endl;
for(int i=1;i<=m;i++){
cout<<1+(i-1)*n<<" ";
}
cout<<endl;
}
void fast(){
ios::sync_with_stdio(false);
cin.tie(0),cout.tie(0);
}
signed main(){
fast();
int t=1;
cin>>t;
while(t--)solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
input:
2 2 3 2 2
output:
Yes 1 4 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 41ms
memory: 3632kb
input:
1 1 1000000
output:
Yes 1 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 1...
result:
wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)