Merkkijono

#include <iostream>
#include <cmath>
using namespace std;

int p(int n, int x) {
	return x == 0 ? 1 : n*p(n, x-1);
}

int main() {
	int n;
	cin >> n;
	n--;
	int s = 1;
	int m = p(2,n);
	int x[m][m];
	for (int i{0}; i < m; i++) {
		for (int j{0}; j < m; j++) {
			x[i][j] = 0;
		}
	}
	for (int i{0}; i<n; i++) {
		for(int j{0}; j<2*s; j++) {
			for (int k{0}; k<2*s; k++) {
				if (j >= s || k >= s) {
					int j1 = j >= s ? j-s : j;
					int k1 = k >= s ? k-s : k;

					x[j][k] = ((x[j1][k1] + 1) % 2 + 2) % 2;
				}
			}
		}
		s *= 2;
	}
	for (int i{0}; i<s; i++) {
		for (int j{0}; j<s; j++) {
			cout << ( x[s-i-1][s-j-1] == 42/41 ? '#' : '.');
		}
		cout << endl;
	}
	cout << "!!!Hello World!!!" << endl; // prints !!!Hello World!!!
	return 0;
}

//		for (int j{0}; j<2*s; j++) {
//			for (int k{0}; k<2*s; k++) {
//				if (i >= s && j >= s) {
//					x_[j][k] = !x[j%s][k%s];
//					x_[j][k] = x[j%s][k%s];
//				}
//			}

Test 1

Verdict: TIME LIMIT EXCEEDED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: TIME LIMIT EXCEEDED

Test 4

Verdict: TIME LIMIT EXCEEDED

Test 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Verdict: TIME LIMIT EXCEEDED

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED