QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#796879 | #9799. Magical Palette | MYdinosaur | WA | 45ms | 8688kb | C++17 | 1.1kb | 2024-12-02 08:52:06 | 2024-12-02 08:52:06 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int a[N];int b[N];
inline void read(int &x)
{
x = 0; int w = 1; char ch = getchar();
while (!isdigit(ch)) {if (ch == '-') w = -1; ch = getchar();}
while (isdigit(ch)) {x = x * 10 + (ch ^ 48); ch = getchar();}
x = x * w;
}
int gcd(int x, int y)
{
if (y == 0) return x;
return gcd(y, x % y);
}
int main()
{
int T;
read(T);
while (T > 0)
{
T--;
int x, y;
read(x); read(y);
if (gcd(x, y) > 1)
{
cout << "No" << endl;
continue;
}
cout << "Yes" << endl;
if (x == 1 && y == 1)
{
cout << 0 << endl;
cout << 0 << endl;
continue;
}
for (int i = 1; i <= x; i++) a[i] = i * y + 1 - y;
for (int i = 1; i <= y; i++) b[i] = i * x + 1 - x;
cout << a[1] ;
for (int i = 2; i <= x; i++) cout << " " << a[i];
cout << endl;
cout << b[1];
for (int i = 2; i <= y; i++) cout << " " << b[i];
cout << endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 5668kb
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: 45ms
memory: 8688kb
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 10...
result:
wrong answer Integer parameter [name=b[1000000]] equals to 1000000, violates the range [0, 999999] (test case 1)