Task: | Ruudukko |
Sender: | Epe |
Submission time: | 2019-09-30 21:45:37 +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 | ACCEPTED | 0.01 s | details |
#4 | ACCEPTED | 0.01 s | details |
#5 | WRONG ANSWER | 0.10 s | details |
#6 | WRONG ANSWER | 0.10 s | details |
Code
#include <bits/stdc++.h>using namespace std;int main(){int n;cin >> n;int table[n][n] = {0};for(int x = 0; x < n; x++){table[0][x] = x+1;}for(int y = 1; y < n; y++){table[y][0] = y+1;}for(int y = 1; y < n; y++) {for (int x = 1; x < n; x++) {set<int> nope;for(int yy = y; yy >= 0; yy--){nope.insert(table[yy][x]);}for(int xx = x; xx >= 0; xx--){nope.insert(table[y][xx]);}for(int i = 1; i <= 100; i++){if(nope.find(i) == nope.end()){table[y][x] = i;break;}}}}for(int y = 0; y < n; y++){for(int x = 0; x < n; x++){cout << table[y][x] << " ";}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: ACCEPTED
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 6 3 4 1 2 7 4 3 2 1 8 5 6 7 8 1 |
Test 4
Verdict: ACCEPTED
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 |