牛客网PAT练兵场-打印沙漏

题目地址：https://www.nowcoder.com/pat/6/problem/4053

题意：模拟题

 /**
 * Copyright(c)
 * All rights reserved.
 * Author : Ycute
 * Date : 2019-11-04-17.21.03
 * Description : 模拟题
 */
 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #include<cstring>
 #include<algorithm>
 using namespace std;
 int main(){
     int n;
     char ch;
     int a[];//存每一层字符数
     int b[];//存总共字符数
     a[]=;
     b[]=;
     scanf("%d %c",&n,&ch);
     for(int i=;i<;i++){
         a[i]=a[i-]+;
         b[i]=a[i]+b[i-];
     }
     int MAX=;
     while((b[MAX]*-)<=n){
         MAX++;
     }
     //反序打印
     int j=;
     for(int i=MAX-;i>=;i--){
         int temp=j++;
         while(temp--){
             printf(" ");
         }
         for(temp=;temp<=a[i];temp++){
             printf("%c",ch);
         }
         printf("\n");
     }
     //顺序打印
     j=j-;
     for(int i=;i<=MAX-;i++){
         int temp=j--;
         while(temp--){
             printf(" ");
         }
         for(temp=;temp<=a[i];temp++){
             printf("%c",ch);
         }
         printf("\n");
     }
     printf("%d\n",n-(b[MAX-]*-));
     return ;
 }