QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#798958 | #9799. Magical Palette | yhddd | WA | 44ms | 3904kb | C++14 | 887b | 2024-12-04 19:44:31 | 2024-12-04 19:44:32 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
#define mod 998244353ll
#define pb push_back
#define pii pair<int,int>
#define fi first
#define se second
#define mems(a,x) memset(a,x,sizeof(a))
using namespace std;
const int maxn=200010;
const int inf=1e18;
inline int read(){
int x=0,fl=1;char ch=getchar();
while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<3)+(x<<1)+(ch-'0');ch=getchar();}
return x*fl;
}
bool mbe;
int n,m;
void work(){
n=read();m=read();
if(__gcd(n,m)!=1)puts("No");
else{
puts("Yes");
for(int i=1,s=1;i<=n;i++)printf("%lld ",s),s+=m;puts("");
for(int i=1,s=1;i<=m;i++)printf("%lld ",s),s+=n;puts("");
}
}
bool med;
int T;
signed main(){
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
// cerr<<(&mbe-&med)/1024.0/1024.0<<"\n";
T=read();
while(T--)work();
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3904kb
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: 44ms
memory: 3780kb
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)