# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
794718 | rainboy | Present (RMI21_present) | C11 | 1 ms | 296 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 1000000
#define A 8
int gcd(int a, int b) { return b == 0 ? a : gcd(b, a % b); }
int good(int s) {
int a, B;
for (a = 1; a <= A; a++)
for (B = a + 1; B <= A; B++)
if ((s & 1 << a) != 0 && (s & 1 << B) != 0 && (s & 1 << gcd(a, B)) == 0)
return 0;
return 1;
}
int main() {
static int ss[N];
int t, s, n;
scanf("%d", &t);
n = 0;
for (s = 0; s < 1 << A + 1 && n <= N; s += 2)
if (good(s))
ss[n++] = s;
while (t--) {
int i, a, cnt;
scanf("%d", &i);
cnt = 0;
for (a = 1; a <= A; a++)
if ((ss[i] & 1 << a) != 0)
cnt++;
printf("%d", cnt);
for (a = 1; a <= A; a++)
if ((ss[i] & 1 << a) != 0)
printf(" %d", a);
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... |