Task: | Fraktaali |
Sender: | fergusq |
Submission time: | 2017-10-03 10:29:15 +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.04 s | 1 | details |
#2 | ACCEPTED | 0.04 s | 2 | details |
#3 | ACCEPTED | 0.05 s | 3 | details |
#4 | ACCEPTED | 0.06 s | 4 | details |
#5 | ACCEPTED | 0.04 s | 5 | details |
#6 | ACCEPTED | 0.04 s | 6 | details |
#7 | ACCEPTED | 0.04 s | 7 | details |
#8 | ACCEPTED | 0.06 s | 8 | details |
#9 | ACCEPTED | 0.03 s | 9 | details |
#10 | ACCEPTED | 0.05 s | 10 | details |
Code
#include <iostream> #include <vector> using namespace std; void copy(vector<bool> *f, vector<bool> *g, int l, int sx, int sy, bool inverse) { for (int x = 0; x < l; x++) { for (int y = 0; y < l; y++) { (*g)[(sx+x)*l*2+y+sy] = (*f)[x*l+y] ^ inverse; } } } int main() { int n; cin >> n; vector<bool> *g = 0; for (int i = 1; i <= n; i++) { int k = 1<<(i-1), l = 1<<(i-2); vector<bool> *f = new vector<bool>(k*k); if (i == 1) { (*f)[0] = 0; } else { copy(g, f, l, 0, 0, 0); copy(g, f, l, l, 0, 0); copy(g, f, l, 0, l, 0); copy(g, f, l, l, l, 1); free(g); } g = f; } int l = 1<<(n-1); for (int x = 0; x < l; x++) { for (int y = 0; y < l; y++) { if ((*g)[x*l+y]) { cout << "."; } else { cout << "#"; } } 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 |
---|
##############################... |