链接：http://acm.hdu.edu.cn/search.php?field=problem&key=2013%20ACM/ICPC%20Asia%20Regional%20Online%20%A1%AA%A1%AA%20Warmup&source=1&searchmode=source

A题(HDU 4706)：无意义的题，就贴个代码吧

#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;

void get(int x, int n) {
	int y = x + 2 * (n - 1);
	y %= 26;
	for (int i = 1; i <= n; i++) {
		printf("%c", 'a'+(x+i-1)%26);
		for (int j = n-i-1; j >= 1; j--)
			printf(" ");
		if (i > 1 && i < n)
			printf("%c", 'a'+(y+1-i+26)%26);
		for (int j = 1; j <= i-2; j++)
			printf(" ");
		printf("%c\n", 'a'+(y+i-1)%26);
	}
}

int main() {
	int x = 0;
	for (int i = 3; i <= 10; i++) {
		get(x, i);
		x = (x+2*i+i-2) % 26;
	}
	return 0;
}