Task: | Fraktaali |
Sender: | eetu02 |
Submission time: | 2017-10-19 16:20:44 +0300 |
Language: | Python3 |
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.06 s | 1 | details |
#2 | ACCEPTED | 0.07 s | 2 | details |
#3 | ACCEPTED | 0.06 s | 3 | details |
#4 | ACCEPTED | 0.06 s | 4 | details |
#5 | ACCEPTED | 0.07 s | 5 | details |
#6 | ACCEPTED | 0.06 s | 6 | details |
#7 | ACCEPTED | 0.06 s | 7 | details |
#8 | ACCEPTED | 0.07 s | 8 | details |
#9 | ACCEPTED | 0.10 s | 9 | details |
#10 | ACCEPTED | 0.42 s | 10 | details |
Code
# -*- coding: utf-8 -*- """ Created on Thu Oct 19 15:14:08 2017 @author: eetu.pakkanen """ def p(g, n): o, s= {0: '.', 1: '#'}, '' for i in range(2** (n- 1)): for j in range(2** (n- 1)): s+= o[g[i, j]] s+= '\n' return s # Deklaratiivinen iteratiivinen paradigma def _add_c(g, n, indicies): for k in indicies: g[k[0], n+ k[1]]= g[k] def _add_r(g, n, indicies): for k in indicies: g[n+ k[0], k[1]]= g[k] def _add_rc_inv(g, n, indicies): for k in indicies: g[n+ k[0], n+ k[1]]= not g[k] def _create(g, n): n, indicies= 2** (n- 1), list(g.keys()) _add_r(g, n, indicies) _add_c(g, n, indicies) _add_rc_inv(g, n, indicies) def frak(n): g= {(0, 0): True} for k in range(1, n): _create(g, k) return g if __name__ == "__main__": n = int(input()) print(p(frak(n), n))
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 |
---|
##############################... |