| Task: | Fraktaali |
| Sender: | Tannhäuser |
| Submission time: | 2017-10-02 00:11:21 +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.05 s | 2 | details |
| #3 | ACCEPTED | 0.03 s | 3 | details |
| #4 | ACCEPTED | 0.06 s | 4 | details |
| #5 | ACCEPTED | 0.05 s | 5 | details |
| #6 | ACCEPTED | 0.03 s | 6 | details |
| #7 | ACCEPTED | 0.05 s | 7 | details |
| #8 | ACCEPTED | 0.04 s | 8 | details |
| #9 | ACCEPTED | 0.04 s | 9 | details |
| #10 | ACCEPTED | 0.05 s | 10 | details |
Code
#include <bits/stdc++.h>
#define N (1<<19)
#define ll long long
#define ld long double
#define M 1000000007
#define INF 0x5ADFACE5
#define LINF 0x51DEEFFEC7C0DECALL
#define pii pair<int, int>
#define pll pair<long long, long long>
#define F first
#define S second
using namespace std;
char c[1024][1024];
void rev (int x1, int y1, int x2, int y2) {
for (int y = y1; y <= y2; y++) {
for (int x = x1; x <= x2; x++) {
if (c[y][x] == '#') c[y][x] = '.';
else c[y][x] = '#';
}
}
}
void sol (int x1, int y1, int x2, int y2) {
if (x1 == x2 && y1 == y2) {
c[y1][x1] = '#';
return;
}
int d = x2 - x1 + 1;
d /= 2;
sol(x1, y1, x1 + d - 1, y1 + d - 1);
sol(x1 + d, y1, x2, y1 + d - 1);
sol(x1, y1 + d, x1 + d - 1, y2);
sol(x1 + d, y1 + d, x2, y2);
rev(x1 + d, y1 + d, x2, y2);
}
int main () {
int n;
cin>>n;
n--;
sol(0, 0, (1<<n) - 1, (1<<n) - 1);
for (int y = 0; y < (1<<n); y++) {
for (int x = 0; x < (1<<n); x++) {
cout<<c[y][x];
}
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 |
|---|
| ##############################... |
