AcWing 3169. 等腰三角形
原题链接
简单
作者:
liaoyu
,
2022-02-24 16:11:52
,
所有人可见
,
阅读 200
//n-1 + 2n-1 + n-1 = 4n-3个个位数.
#include <iostream>
#include <vector>
#include <sstream>
using namespace std;
string trans(int x){
stringstream stream;
stream << x;
string res;
stream >> res;
return res;
}
char a[1010][1010];
int main()
{
string s = "";
int n;
cin >> n;
for(int i=1;i<=4*n;i++){
string ss = trans(i);
s += ss;
}
int p = 0;
for(int i=n-1;i>=1;i--){
for(int j=1;j<=i;j++){
a[p+1][j] = '.';
}
a[p+1][i+1] = s[p];
p++;
}
for(int i=1;i<=2*n-1;i++) a[n][i] = s[p++];
for(int i=2;i<=n-1;i++){
int cnt = (i-1)*2-1;
for(int j=n-cnt/2;j<=n+cnt/2;j++){
a[i][j] = '.';
}
}
for(int i=n-1;i>=2;i--){
a[i][n+i-1] = s[p++];
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n+i-1;j++){
printf("%c",a[i][j]);
}
printf("\n");
}
return 0;
}