刚在论坛碰到这个题, 记下当时的解法
#include <iostream>
using namespace std;
void show(unsigned int n)
{
const char first = (((n + 1) % 4) > 1 ? 'A' : 'B');
const char second = ('A' == first ? 'B' : 'A');
for (unsigned int i = 0; i < n; ++i) {
for (unsigned int j = 0; j < n; ++j) {
unsigned int ii = (i <= (n - 1 - i) ? i : (n - 1 - i));
unsigned int jj = (j <= (n - 1 - j) ? j : (n - 1 - j));
unsigned int k = (ii < jj ? ii : jj);
const char value = ((0 == k % 2) ? first : second);
cout << value << " ";
}
cout << endl;
}
}
int main()
{
unsigned int n = 0;
cin >> n;
while (0 != n && -1 != n) {
show(n);
cin >> n;
}
return 0;
}