Fraktaali

#include <iostream>
 
using namespace std;
 
int main() {
	int size;
	cin >> size;
	int s = 1;
	int amount = 0;
	for (int i = 1; i < size; i++) {
		s = s * 2;
		amount++;
	}
	bool table[s][s];
	for (int y = 0; y < s; y++) {
		for (int x = 0; x < s; x++) {
				table[x][y] = false;
		}
	}
	int i = 1;
	while (i < s) {
 
		for (int y = 0; y < i; y++) {
			for (int x = 0; x < i; x++) {
				table[i + x][y] = table[x][y];
			}
		}
 
		for (int y = 0; y < i; y++) {
			for (int x = 0; x < i; x++) {
				table[x][i + y] = table[x][y];
			}
		}
 
		for (int y = 0; y < i; y++) {
			for (int x = 0; x < i; x++) {
				table[i + x][i + y] = !table[x][y];
			}
		}
 
		i *= 2;
	}
	for (int x = 0; x < s; x++) {
		for (int y = 0; y < s; y++) {
			if (table[x][y]) {
				cout << '.';
			} else {
				cout << '#';
			}
		}
		cout << '\n';
	}
	while (1);
	return 0;
}
 

Test 1

Group: 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Group: 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Group: 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 10

Verdict: TIME LIMIT EXCEEDED