Task: | Fraktaali |
Sender: | valokoodari |
Submission time: | 2017-10-05 18:41:23 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 10 |
#2 | ACCEPTED | 10 |
#3 | ACCEPTED | 10 |
#4 | ACCEPTED | 10 |
#5 | ACCEPTED | 10 |
#6 | ACCEPTED | 10 |
#7 | ACCEPTED | 10 |
#8 | ACCEPTED | 10 |
#9 | ACCEPTED | 10 |
#10 | ACCEPTED | 10 |
test | verdict | time | group | |
---|---|---|---|---|
#1 | ACCEPTED | 0.05 s | 1 | details |
#2 | ACCEPTED | 0.05 s | 2 | details |
#3 | ACCEPTED | 0.05 s | 3 | details |
#4 | ACCEPTED | 0.05 s | 4 | details |
#5 | ACCEPTED | 0.06 s | 5 | details |
#6 | ACCEPTED | 0.06 s | 6 | details |
#7 | ACCEPTED | 0.03 s | 7 | details |
#8 | ACCEPTED | 0.04 s | 8 | details |
#9 | ACCEPTED | 0.03 s | 9 | details |
#10 | ACCEPTED | 0.05 s | 10 | details |
Code
#include <bits/stdc++.h> using namespace std; int main() { int n, m; cin >> n; m = (int)pow(2, n-1); char f[m][m]; f[0][0] = '#'; for (int i = 1; i < n; i++) { int l = (int)pow(2, i)/2; for (int j = 0; j < l; j++) { for (int k = 0; k < l; k++) { f[l+k][j] = f[k][j]; f[k][l+j] = f[k][j]; if (f[k][j] == '#') { f[l+k][l+j] = '.'; } else { f[l+k][l+j] = '#'; } } } } for (int i = 0; i < m; i++) { for (int j = 0; j < m; j++) { cout << f[i][j]; } cout << endl; } }
Test details
Test 1
Group: 1
Verdict: ACCEPTED
input |
---|
1 |
correct output |
---|
# |
user output |
---|
# |
Test 2
Group: 2
Verdict: ACCEPTED
input |
---|
2 |
correct output |
---|
## #. |
user output |
---|
## #. |
Test 3
Group: 3
Verdict: ACCEPTED
input |
---|
3 |
correct output |
---|
#### #.#. ##.. #..# |
user output |
---|
#### #.#. ##.. #..# |
Test 4
Group: 4
Verdict: ACCEPTED
input |
---|
4 |
correct output |
---|
######## #.#.#.#. ##..##.. #..##..# ####.... ... |
user output |
---|
######## #.#.#.#. ##..##.. #..##..# ####.... ... |
Test 5
Group: 5
Verdict: ACCEPTED
input |
---|
5 |
correct output |
---|
################ #.#.#.#.#.#.#.#. ##..##..##..##.. #..##..##..##..# ####....####.... ... |
user output |
---|
################ #.#.#.#.#.#.#.#. ##..##..##..##.. #..##..##..##..# ####....####.... ... |
Test 6
Group: 6
Verdict: ACCEPTED
input |
---|
6 |
correct output |
---|
##############################... |
user output |
---|
##############################... |
Test 7
Group: 7
Verdict: ACCEPTED
input |
---|
7 |
correct output |
---|
##############################... |
user output |
---|
##############################... |
Test 8
Group: 8
Verdict: ACCEPTED
input |
---|
8 |
correct output |
---|
##############################... |
user output |
---|
##############################... |
Test 9
Group: 9
Verdict: ACCEPTED
input |
---|
9 |
correct output |
---|
##############################... |
user output |
---|
##############################... |
Test 10
Group: 10
Verdict: ACCEPTED
input |
---|
10 |
correct output |
---|
##############################... |
user output |
---|
##############################... |