Task: | Ruudukko |
Sender: | Swarm |
Submission time: | 2019-10-07 17:00:20 +0300 |
Language: | C++ (C++17) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | WRONG ANSWER | 0.01 s | details |
#3 | WRONG ANSWER | 0.01 s | details |
#4 | WRONG ANSWER | 0.01 s | details |
#5 | WRONG ANSWER | 0.07 s | details |
#6 | WRONG ANSWER | 0.07 s | details |
Code
#include <iostream> #include <vector> int main() { int n; std::cin >> n; std::vector<std::vector<int>> m; for (int i = 0; i < n; i++) { m.push_back(std::vector<int>(n)); } for (int i = 0; i < n; i++) { m[0][i] = 1 + i; m[i][0] = 1 + i; } for (int i = 1; i < n; i++) { for (int j = 1; j < n; j++) { int x = n; for (int k = n; k > 0; k--) { bool a = true; for (int l = 0; l < i; l++) { if (m[l][j] == k) a = false; } for (int l = 0; l < j; l++) { if (m[i][l] == k) a = false; } if (a) x = k; } m[i][j] = x; } } for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { std::cout << m[i][j]; } std::cout << '\n'; } return 0; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Verdict: WRONG ANSWER
input |
---|
2 |
correct output |
---|
1 2 2 1 |
user output |
---|
12 21 |
Test 3
Verdict: WRONG ANSWER
input |
---|
5 |
correct output |
---|
1 2 3 4 5 2 1 4 3 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
user output |
---|
12345 21435 34125 43215 55551 |
Test 4
Verdict: WRONG ANSWER
input |
---|
42 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
123456789101112131415161718192... Truncated |
Test 5
Verdict: WRONG ANSWER
input |
---|
99 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
123456789101112131415161718192... Truncated |
Test 6
Verdict: WRONG ANSWER
input |
---|
100 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
123456789101112131415161718192... Truncated |