| Task: | Lista |
| Sender: | ArktinenKarpalo |
| Submission time: | 2020-09-04 20:50:19 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | 100 |
| group | verdict | score |
|---|---|---|
| #1 | ACCEPTED | 21 |
| #2 | ACCEPTED | 38 |
| #3 | ACCEPTED | 41 |
| test | verdict | time | group | |
|---|---|---|---|---|
| #1 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #2 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #3 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #4 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #5 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #6 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #7 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #8 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #9 | ACCEPTED | 0.01 s | 1, 2, 3 | details |
| #10 | ACCEPTED | 0.01 s | 2, 3 | details |
| #11 | ACCEPTED | 0.01 s | 2, 3 | details |
| #12 | ACCEPTED | 0.01 s | 2, 3 | details |
| #13 | ACCEPTED | 0.01 s | 2, 3 | details |
| #14 | ACCEPTED | 0.01 s | 2, 3 | details |
| #15 | ACCEPTED | 0.01 s | 2, 3 | details |
| #16 | ACCEPTED | 0.01 s | 3 | details |
| #17 | ACCEPTED | 0.01 s | 3 | details |
| #18 | ACCEPTED | 0.01 s | 3 | details |
| #19 | ACCEPTED | 0.02 s | 3 | details |
| #20 | ACCEPTED | 0.02 s | 3 | details |
| #21 | ACCEPTED | 0.02 s | 3 | details |
Code
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define ld long double
using namespace std;
int n;
bool lol = false;
bool p[1111][1111], z[1111];
int cnt[1111];
bool prime(int lk) {
for(int i=2; i*i<=lk; i++) {
if(lk%i == 0)
return false;
}
return true;
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cin >> n;
for(int i=0; i<=1000; i++)
for(int j=0; j<=1000; j++) {
z[j] = 0;
p[i][j] = 0;
cnt[j] = 0;
}
for(int i=1; i<=n; i++) {
p[i][0] = 1;
for(int j=i+1; j<=n; j++) {
if(prime(i+j)) {
p[i][j] = 1;
p[j][i] = 1;
cnt[i]++;
cnt[j]++;
}
}
}
vector<pair<int,int>> v;
for(int i=n; i>=1; i--) {
v.push_back(make_pair(cnt[i], -i));
}
// sort(v.begin(), v.end());
vector<int> ans;
int c = -v[0].second;
ans.push_back(c);
z[0] = 1;
for(int i=1; i<n; i++) {
for(int j=1; j<n; j++) {
if(z[j] || !p[c][-v[j].second])
continue;
ans.push_back(-v[j].second);
c = -v[j].second;
z[j] = 1;
break;
}
}
int ed = -1;
for(auto u:ans) {
if(ed != -1) {
if(!prime(u+ed))
cout << "QAQ";
}
cout<<u<<" ";
ed = u;
}
}
Test details
Test 1
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 2 |
| correct output |
|---|
| 1 2 |
| user output |
|---|
| 2 1 |
Test 2
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 3 |
| correct output |
|---|
| 1 2 3 |
| user output |
|---|
| 3 2 1 |
Test 3
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 4 |
| correct output |
|---|
| 1 2 3 4 |
| user output |
|---|
| 4 3 2 1 |
Test 4
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 5 |
| correct output |
|---|
| 3 4 1 2 5 |
| user output |
|---|
| 5 2 3 4 1 |
Test 5
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 6 |
| correct output |
|---|
| 3 4 1 2 5 6 |
| user output |
|---|
| 6 5 2 3 4 1 |
Test 6
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 7 |
| correct output |
|---|
| 3 4 1 2 5 6 7 |
| user output |
|---|
| 7 6 5 2 3 4 1 |
Test 7
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 8 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 |
| user output |
|---|
| 8 5 6 7 4 3 2 1 |
Test 8
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 9 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 |
| user output |
|---|
| 9 8 5 6 7 4 3 2 1 |
Test 9
Group: 1, 2, 3
Verdict: ACCEPTED
| input |
|---|
| 10 |
| correct output |
|---|
| 7 6 5 2 1 4 3 8 9 10 |
| user output |
|---|
| 10 9 8 5 6 7 4 3 2 1 |
Test 10
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 19 |
| correct output |
|---|
| 17 14 3 8 15 16 13 6 5 2 1 4 9... |
| user output |
|---|
| 19 18 13 16 15 14 17 12 11 8 9... |
Test 11
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 56 |
| correct output |
|---|
| 55 54 53 50 51 52 49 48 13 28 ... |
| user output |
|---|
| 56 53 54 55 52 51 50 47 42 41 ... Truncated |
Test 12
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 70 |
| correct output |
|---|
| 67 4 1 2 9 32 35 38 65 66 61 4... |
| user output |
|---|
| 70 69 68 63 64 67 60 53 56 57 ... Truncated |
Test 13
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 76 |
| correct output |
|---|
| 73 66 61 42 59 54 53 50 51 52 ... |
| user output |
|---|
| 76 75 74 65 72 67 70 69 68 71 ... Truncated |
Test 14
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 90 |
| correct output |
|---|
| 87 86 11 18 29 44 45 16 55 58 ... |
| user output |
|---|
| 90 89 84 83 80 87 86 81 82 85 ... Truncated |
Test 15
Group: 2, 3
Verdict: ACCEPTED
| input |
|---|
| 100 |
| correct output |
|---|
| 97 96 95 78 25 82 81 56 71 68 ... |
| user output |
|---|
| 100 99 98 95 96 97 94 87 92 89... Truncated |
Test 16
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 154 |
| correct output |
|---|
| 151 6 5 92 137 134 149 84 143 ... |
| user output |
|---|
| 154 153 140 143 150 133 148 14... Truncated |
Test 17
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 430 |
| correct output |
|---|
| 427 426 371 372 367 376 375 35... |
| user output |
|---|
| 430 429 428 425 414 415 424 40... Truncated |
Test 18
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 629 |
| correct output |
|---|
| 627 404 227 146 83 150 77 74 3... |
| user output |
|---|
| 629 620 617 614 623 626 611 61... Truncated |
Test 19
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 833 |
| correct output |
|---|
| 829 828 793 574 523 516 515 51... |
| user output |
|---|
| 833 830 827 810 817 820 807 81... Truncated |
Test 20
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 885 |
| correct output |
|---|
| 883 724 723 878 881 726 721 71... |
| user output |
|---|
| 885 874 879 880 873 868 865 88... Truncated |
Test 21
Group: 3
Verdict: ACCEPTED
| input |
|---|
| 1000 |
| correct output |
|---|
| 997 996 737 884 995 492 991 20... |
| user output |
|---|
| 1000 999 998 995 992 987 986 9... Truncated |
