#include <stdio.h>
int main(void){
int h;
while(scanf("%d", &h) != EOF){
int a = h + * (h-); for(int i=; i<h; i++){
for(int k = ; k < a - (h + * i); k++) printf(" ");
for(int j = ; j < h + * i; j++) printf("*");
printf("\n");
}
}
return ; }
相关文章
- 3.3-1933 problem A
- HDU5950 Recursive sequence (矩阵快速幂加速递推) (2016ACM/ICPC亚洲赛区沈阳站 Problem C)
- Codeforces Round #525 (Div. 2)A. Ehab and another construction problem
- hdoj 3861 The King’s Problem【强连通缩点建图&&最小路径覆盖】
- TJU Problem 2548 Celebrity jeopardy
- CF 1986D. Mathematical Problem
- LeetCode //C - 218. The Skyline Problem
- ZOJ Problem Set - 1201 Inversion
- CodeForces - 688C:NP-Hard Problem (二分图&带权并查集)
- Light OJ 1004 - Monkey Banana Problem(DP)