PAT 天梯赛 L1-015. 跟奥巴马一起画方块 【水】

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include <stack>
#include <set>
#include <cstdlib>
#include <ctype.h>
#include <numeric>
#include <sstream>
using namespace std;

typedef long long LL;
const double PI = 3.14159265358979323846264338327;
const double E = 2.718281828459;
const double eps = 1e-6;
const int MAXN = 0x3f3f3f3f;
const int MINN = 0xc0c0c0c0;
const int maxn = 1e5 + 5;
const int MOD = 1e9 + 7;

int main()
{
int n;
char c;
scanf("%d %c", &n, &c);
int m = (int)(n * 1.0 / 2 + 0.5);
for (int i = 0; i < m; i++)
{
for (int j = 0; j < n; j++)
printf("%c", c);
cout << endl;
}
}