Task: | Ruudukko |
Sender: | ph |
Submission time: | 2019-10-01 10:34:45 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 0 |
group | verdict | score |
---|---|---|
#1 | WRONG ANSWER | 0 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.01 s | details |
#2 | ACCEPTED | 0.01 s | details |
#3 | WRONG ANSWER | 0.01 s | details |
#4 | WRONG ANSWER | 0.01 s | details |
#5 | WRONG ANSWER | 0.08 s | details |
#6 | WRONG ANSWER | 0.08 s | details |
Code
#include<bits/stdc++.h>using namespace std;int main() {int n;cin >> n;int l[n][n];int s[n];for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {if (i == 0) {l[i][j] = j+1;s[j] = j+1;} else if (j == 0) {l[i][j] = l[i-1][j] + 1;} else {int t[n];copy(s, s+n, t);for (int k = 0; k < i; k++) {remove(t, t+n, l[k][j]);}for (int k = 0; k < j; k++) {remove(t, t+n, l[i][k]);}l[i][j] = t[0];}}}for (int i = 0; i < n; i++) {for (int j = 0; j < n; j++) {cout << l[i][j] << " ";}if (i < n-1)cout << endl;}}
Test details
Test 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
1 |
user output |
---|
1 |
Test 2
Verdict: ACCEPTED
input |
---|
2 |
correct output |
---|
1 2 2 1 |
user output |
---|
1 2 2 1 |
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 |
---|
1 2 3 4 5 2 1 4 3 5 3 4 1 2 5 4 3 2 1 5 5 5 5 5 1 |
Test 4
Verdict: WRONG ANSWER
input |
---|
42 |
correct output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
user output |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... 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 |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... 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 |
---|
1 2 3 4 5 6 7 8 9 10 11 12 13 ... Truncated |