Segcolt/Codeforces-solutions
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Change the solution to be more simple.

Browse Source 
The logic was much more simple than what I could have thought on the
contest...
This commit is contained in:
Segcolt 2024-11-17 16:16:54 -03:00
parent fddaaeba59
commit 88e542c982
1 changed files with 12 additions and 39 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

51
Codeforces Round 988 (Div. 3)/C. Superultra's Favorite Permutation.cpp
View File

@ -74,25 +74,17 @@ int main()
ios::sync_with_stdio(false);
cin.tie(nullptr);
V<bool> isprime(1e5 * 4 + 1, true);
isprime[1] = false;
for (size_t i = 1; i <= (size_t)1e5 * 4; i++) {
if (!isprime[i]) {
continue;
}
for (size_t j = i * 2; j <= (size_t)1e5 * 4; j += i) {
isprime[j] = false;
}
}
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
if (n <= 4) {
cout << "-1\n";
continue;
}
vi odd;
vi even;
@ -104,35 +96,16 @@ int main()
}
}
int i = odd.size() - 1;
int j = 0;
while (i >= 0) {
j = even.size() - 1;
while (j >= 0 && isprime[odd[i] + even[j]]) {
j--;
}
if (j >= 0) {
break;
}
i--;
}
if (i < 0) {
cout << "-1\n";
continue;
}
for (size_t k = 0; k < odd.size(); k++) {
if (k != i) {
cout << odd[k] << ' ';
repv(i, odd) {
if (i != 5) {
cout << i << ' ';
}
}
cout << odd[i] << ' ' << even[j] << ' ';
for (size_t k = 0; k < even.size(); k++) {
if (k != j) {
cout << even[k] << ' ';
cout << "5 4 ";
repv(i, even) {
if (i != 4) {
cout << i << ' ';
}
}
cout << '\n';