Fraktaali

#include <iostream>
#include <vector>

using namespace std;

int n;
int t[520][520];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> n;
	t[0][0] = 1;
	for (int k = 1; k < n; ++k) {
		int sl = (1<<k);
		for (int i = 0; i < sl; ++i) {
			for (int j = 0; j < sl; ++j) {
				if (i >= sl/2 && j >= sl/2) {
					t[i][j] = (t[i-sl/2][j-sl/2]+1)%2;
				}
				else if (i >= sl/2 || j >= sl/2) {
					int si = (i >= sl/2) ? i-sl/2 : i;
					int sj = (j >= sl/2) ? j-sl/2 : j;
					t[i][j] = t[si][sj];
				}
			}
		}
	}
	for (int i = 0; i < (1<<(n-1)); ++i) {
		for (int j = 0; j < (1<<(n-1)); ++j) {
			if (t[i][j] == 0) cout << '.';
			else cout << "#";
		}
		cout << "\n";
	}
	return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: ACCEPTED

Test 4

Group: 4

Verdict: ACCEPTED

Test 5

Group: 5

Verdict: ACCEPTED

Test 6

Group: 6

Verdict: ACCEPTED

Test 7

Group: 7

Verdict: ACCEPTED

Test 8

Group: 8

Verdict: ACCEPTED

Test 9

Group: 9

Verdict: ACCEPTED

Test 10

Group: 10

Verdict: ACCEPTED