Isosceles triangle - the 9th Lanqiao provincial competition - group C

This topic requires you to output an isosceles triangle composed of numbers .

The specific steps are ：

First use 1,2,3,… Spell a string long enough . Fill the three sides of the triangle with this string . Starting from the top vertex , Fill in counter clockwise . such as , When the height of the triangle is 8 when ：

Input format :

A positive integer n, Represents the height of the triangle . 3<n<300

Output format :

Output , Isosceles triangles filled with numbers .

In order to facilitate evaluation , We require all spaces to be used . Instead of .

Specifically , Refer to the example .

sample input :

Here's a set of inputs . for example ：

5

sample output :

Here is the corresponding output . for example ：

....1
...2.1
..3...2
.4.....1
567891011

AC Code ：

#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
string s;
void shuzi(){   // First the 1~1500 The number of is stored in the string 
    for(int i=1;i<=1500;i++)
    {
        string s1="";
        int a=i;
        while(a)
        {
            s1+=(a%10+'0');
            a/=10;
        }
        for(int k=s1.length()-1;k>=0;k--)
        {
            s+=s1[k];
        }
    }
}
int main()
{
    shuzi();
    int n;cin>>n;
    int res=1;
    int t=1;
    for(int i=0;i<n-1;i++){
			for(int j=1;j<=n-i-1;j++){  // Output the symbol before the first number of each line 
				cout<<".";
			}
			cout<<s[i];
			if(i!=0){
				for(int j=1;j<=2*i-1;j++){  // Output the number of symbols after the first number 
					cout<<".";
				}
				cout<<s[4*(n-1)-i]; // Find the law by counterclockwise circulation 
			}
			cout<<endl;
		}
		for(int i=0;i<=2*(n-1);i++){    // Output the last line , from n Start 
			cout<<s[n+i-1];
		}
    return 0;
}