Submission #54352678

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define FOR(i, a, n) for (int i = a; i < (int)n; i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using lli = long long int;

int N;


template <typename T>
inline constexpr typename std::enable_if<std::is_integral<T>::value, T>::type
ipow(T x, std::size_t N, T res = 1) {
  return N < 1 ? res : ipow(x * x, N/2, (N&1) ? (res * x) : res);
}


bool isblack(int x, int y, int k3) {
  if (k3 == 1) { return true; }

  int k13 = k3/3;
  REP(i, 3) REP(j, 3) {
    int x1 =  i * k13;
    int x2 = x1 + k13;
    int y1 =  j * k13;
    int y2 = y1 + k13;
    if (!(x1 <= x && x < x2 && y1 <= y && y < y2)) { continue; }
    if (i == 1 && j == 1) { return false; }
    return isblack(x - x1, y - y1, k13);
  }
  return true;
}


int main() {
  cin >> N;

  int k3 = ipow(3, N);

  REP(i, k3) {
    REP(j, k3) { cout << (isblack(i, j, k3) ? '#' : '.'); }
    cout << endl;
  }

  return 0;
}

Submission Info

Judge Result