Submission #10973698
Source Code Expand
#include <stdio.h> #include <vector> typedef long long ll; using namespace std; ll gcd(ll a, ll b) { if(b == 0) return a; return gcd(b,a%b); } void solve() { int n; scanf("%d", &n); if (n == 3) { printf("2 5 63\n"); return; } vector<int> z; int i; for (i = 1; i < 15000; i++) { if (gcd(i, 15000) > 1) { z.push_back(i); z.push_back(30000 - i); if ((int)z.size() >= n-1) break; } } if (n % 2) z.push_back(15000); for (i = 0; i < (int)z.size(); i++) { printf("%d", z[i]); if (i < (int)z.size() - 1) printf(" "); } printf("\n"); return; } int main(int argc, char* argv[]) { solve(); return 0; }
Submission Info
Submission Time | |
---|---|
Task | B - GCD Sequence |
User | tarattata |
Language | C++14 (GCC 5.4.1) |
Score | 600 |
Code Size | 787 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 512 KiB |
Compile Error
./Main.cpp: In function ‘void solve()’: ./Main.cpp:15:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] scanf("%d", &n); ^
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 600 / 600 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 5 ms | 512 KiB |
02.txt | AC | 1 ms | 256 KiB |
03.txt | AC | 1 ms | 256 KiB |
04.txt | AC | 1 ms | 256 KiB |
05.txt | AC | 1 ms | 256 KiB |
06.txt | AC | 1 ms | 256 KiB |
07.txt | AC | 1 ms | 256 KiB |
08.txt | AC | 1 ms | 256 KiB |
09.txt | AC | 1 ms | 256 KiB |
10.txt | AC | 1 ms | 256 KiB |
11.txt | AC | 1 ms | 256 KiB |
12.txt | AC | 1 ms | 256 KiB |
13.txt | AC | 1 ms | 256 KiB |
14.txt | AC | 1 ms | 256 KiB |
15.txt | AC | 1 ms | 256 KiB |
16.txt | AC | 5 ms | 512 KiB |
17.txt | AC | 5 ms | 512 KiB |
18.txt | AC | 5 ms | 512 KiB |
19.txt | AC | 5 ms | 512 KiB |
20.txt | AC | 5 ms | 512 KiB |
21.txt | AC | 5 ms | 512 KiB |
22.txt | AC | 5 ms | 512 KiB |
23.txt | AC | 5 ms | 512 KiB |
24.txt | AC | 5 ms | 512 KiB |
25.txt | AC | 5 ms | 512 KiB |
26.txt | AC | 5 ms | 512 KiB |
27.txt | AC | 5 ms | 512 KiB |
28.txt | AC | 5 ms | 512 KiB |
29.txt | AC | 5 ms | 512 KiB |
30.txt | AC | 5 ms | 512 KiB |
31.txt | AC | 5 ms | 512 KiB |
32.txt | AC | 1 ms | 256 KiB |
33.txt | AC | 1 ms | 256 KiB |
34.txt | AC | 4 ms | 512 KiB |
35.txt | AC | 3 ms | 384 KiB |
36.txt | AC | 3 ms | 384 KiB |
37.txt | AC | 4 ms | 512 KiB |
38.txt | AC | 2 ms | 384 KiB |
s1.txt | AC | 1 ms | 256 KiB |
s2.txt | AC | 1 ms | 256 KiB |