BOJ 26535 - Chicken Pen [C++]

문제

링크

풀이

#include <iostream>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
 
  int k = 1;
  while (k*k < n) k++;
 
  for (int i=0; i<k+2; i++) cout << "x";
  cout << "\n";
  for (int i=0; i<k; i++) {
    cout << "x";
    for (int j=0; j<k; j++) cout << ".";
    cout << "x\n";
  }
  for (int i=0; i<k+2; i++) cout << "x";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}