金字塔的升级版,还是找规律,代码如下。

#include <iostream>

using namespace std;

int abs(int number) {
  return (number > 0) ? (number) : (-number);
}

int main() {
  char ch;
  cin >> ch;
  int n = int(ch) - 64;
  for (int i = 1; i <= n; i++) { 
    for (int j = 1; j <= 2*n+1; j++) 
      if (j >= n-i+1 && j <= n+i-1)
	cout << char(int(ch) - (n-i)  - abs(n-j));
      else cout << ' ';
    cout << endl;
  }
  return 0;	
}