QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#368784 | #8217. King's Dinner | ucup-team3215# | WA | 1ms | 3616kb | C++20 | 431b | 2024-03-27 16:24:16 | 2024-03-27 16:24:19 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0)->sync_with_stdio(0);
int n; cin >> n;
if (n > 1 && n < 6) return cout << "NO", 0;
cout << "YES\n";
if (n == 6) {
cout << "6\n1 2\n2 3\n1 3\n3 4\n2 5\n5 6\n";
return 0;
}
cout << n - 1 << '\n';
if (n == 1) return 0;
cout << "1 2\n1 3\n3 4\n1 5\n";
for (int i = 6; i <= n; ++i) cout << i << ' ' << i - 1 << '\n';
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3616kb
input:
3 1 2 3
output:
NO
result:
wrong answer Token parameter [name=row of the grid] equals to "NO", doesn't correspond to pattern "[#.]+" (test case 1)