Task: | Ruudukko |
Sender: | 10GOTO10 |
Submission time: | 2019-10-04 18:24:23 +0300 |
Language: | C++ (C++11) |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
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 | ACCEPTED | 0.01 s | details |
#6 | ACCEPTED | 0.01 s | details |
Code
#include <iostream> #include <string> #include <sstream> #include <cmath> using namespace std; int in; int benis[129][129]; string bagina; stringstream benisToBagina; void init() { //joojoo array alkaa nollasta, mutta tässä helpompi käyttää 1-100 for(int i = 1; i<=100; i++){ for(int j = 1; j<=100; j++){ benis[i][j]=0; } } benis[1][1]=1; benis[2][2]=1; benis[1][2]=2; benis[2][1]=2; } int main() { cin>>in; init(); for(int iter=2; iter<=7; iter++) { int botenssi = pow(2, iter-1); for(int i = 1; i<=botenssi; i++){ for(int j = 1; j<=botenssi; j++){ int hnnggg=benis[i][j]; benis[i+botenssi][j+botenssi]=hnnggg; benis[i+botenssi][j]=hnnggg+botenssi; benis[i][j+botenssi]=hnnggg+botenssi; } } } for(int i = 1; i<=in; i++){ for(int j = 1; j<=in; j++){ benisToBagina << benis[i][j]; bagina.append(benisToBagina.str()); bagina.append(" "); benisToBagina.str(""); } bagina.append("\n"); } cout<<bagina; }
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: ACCEPTED
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: ACCEPTED
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 |