| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 768805 | rainboy | Nice sequence (IZhO18_sequence) | C11 | 306 ms | 29636 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#define N 200000
#define M 200000
int gcd(int a, int b) {
return b == 0 ? a : gcd(b, a % b);
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
static int pp[N + M];
int n, m, d, n_, i, p;
scanf("%d%d", &n, &m), d = gcd(n, m), n_ = m + n - d;
i = n_, p = 0;
while (1) {
i = i >= n ? i - n : i + m;
if (i == n_)
break;
pp[i] = p++;
}
for (i = 0; i < n_; i += d)
pp[i] *= d;
for (i = 0; i < n_; i++)
pp[i] = pp[i - i % d] + i % d;
printf("%d\n", n_ - 1);
for (i = 1; i < n_; i++)
printf("%d ", pp[i] - pp[i - 1]);
printf("\n");
}
return 0;
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
