1. print hourglass

#include<iostream>
using namespace std;
int main()
{
    int n;
    char c;

    cin>>n;
    getchar();
    cin>>c;
    // perhaps  scanf("%d %c",&n,&c);

     //1. Find the maximum number of layers 
    // If the number of layers is x, Then the top number is x
    int neednum=1;    // The number of symbols required to print the hourglass 
    int level=1;     // The layer number 
    while(n/neednum)
    {
        level+=2;
        neednum+=level*2;
    }
    // Pay attention to the order of the following two sentences 
    neednum-=level*2;
    level-=2;

    //2. Printout ：① Print space  ② Print symbols 
    for(int i=0;i<level/2+1;i++)   //5->3
    {
        for(int a=i;a>0;a--)   //0 1 2
        {
            printf(" ");
        }
        for(int b=2*(level/2+1-i)-1;b>0;b--)
        {
            printf("%c",c);
        }
        printf("\n");
    }
    for(int i=1;i<=level/2;i++)
    {
        for(int a=level/2-i;a>0;a--)
        {
            printf(" ");
        }
        for(int b=i*2+1;b>0;b--)
        {
            printf("%c",c);
        }
        printf("\n");
    }
    printf("%d",n-neednum);
    return 0;
}