QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#780137 | #9799. Magical Palette | scanfdream | WA | 36ms | 3688kb | C++14 | 884b | 2024-11-25 01:53:09 | 2024-11-25 01:53:10 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define lowbit(x) x&-x
#define int long long
const int M=2e5+10;
void solve()
{
int n,m;
cin>>n>>m;
if(__gcd(n,m)!=1)
{
cout<<"No\n";
return ;
}
if(n==1&&m==1)
{
cout<<"Yes\n";
cout<<"0\n0\n";
return ;
}
if(n==1)
{
cout<<"Yes\n";
cout<<1<<"\n";
for(int i=0;i<m;i++)
cout<<i<<' ';
cout<<"\n";
return ;
}
if(m==1)
{
cout<<"Yes\n";
for(int i=0;i<m;i++)
cout<<i<<' ';
cout<<"\n";
cout<<1<<"\n";
return ;
}
cout<<"Yes\n";
for(int i=0;i<n;i++)
cout<<1+i*m<<" ";
cout<<"\n";
for(int j=0;j<m;j++)
cout<<1+j*n<<' ';
cout<<"\n";
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
int t;
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: 3688kb
input:
2 2 3 2 2
output:
Yes 1 4 1 3 5 No
result:
ok 2 cases (2 test cases)
Test #2:
score: 0
Accepted
time: 36ms
memory: 3560kb
input:
1 1 1000000
output:
Yes 1 0 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 ...
result:
ok 1 cases (1 test case)
Test #3:
score: -100
Wrong Answer
time: 0ms
memory: 3576kb
input:
1 1000000 1
output:
Yes 0 1
result:
wrong output format Unexpected end of file - int32 expected (test case 1)