#include<stdio.h>
int main()
{
int n;
while(scanf("%d",&n)!=EOF)
{
int i,j;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf("*");
}
for(j=0;j<n;j++)
{
printf(" ");
}
for(j=0;j<n;j++)
{
printf("*");
}
printf("\n");
}
for(i=0;i<3*n;i++)
printf("*");
printf("\n");
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
printf(" ");
}
for(j=0;j<n;j++)
{
printf("*");
}
for(j=0;j<n;j++)
{
printf(" ");
}
printf("\n");
}
}
}
相关文章
- 12-02【计算几何】【极角排序】【二分】Petrozavodsk Summer Training Camp 2016 Day 6: Warsaw U Contest, XVI Open Cup Onsite, Sunday, August 28, 2016 Problem J. Triangles
- 12-02Gym 101981J - Prime Game - [数学题][线性筛+分解质因数][2018-2019 ACM-ICPC Asia Nanjing Regional Contest Problem J]
- 12-022019 ICPC Asia Taipei-Hsinchu Regional Problem J Automatic Control Machine (DFS,bitset)
- 12-022019 ICPC Asia Taipei-Hsinchu Regional Problem J Automatic Control Machine (DFS,bitset)
- 12-02Problem J: IP地址
- 12-02Problem J 小明画画
- 12-02对抗搜索Problem J. Situation
- 12-022019牛客暑期多校训练营(第七场)J A+B problem
- 12-02Problem J: Island Buses
- 12-02UESTC_Islands 2015 UESTC Training for Data Structures