HDU 2123 An easy problem
2012-09-05 19:00
363 查看
#include<stdio.h>
int main()
{
int i,j,c,n;
while(scanf("%d",&c)!=EOF)
{
while(c--){
scanf("%d",&n);
if(n==1) printf("1\n");
else{
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(j==1) printf("%d",i*j);
else printf(" %d",i*j);
}
printf("\n");
}
}
}
}
return 0;
}
int main()
{
int i,j,c,n;
while(scanf("%d",&c)!=EOF)
{
while(c--){
scanf("%d",&n);
if(n==1) printf("1\n");
else{
for(i=1;i<=n;i++){
for(j=1;j<=n;j++){
if(j==1) printf("%d",i*j);
else printf(" %d",i*j);
}
printf("\n");
}
}
}
}
return 0;
}
相关文章推荐
- HDOJ(HDU) 2123 An easy problem(简单题...)
- HDOJ(HDU) 2123 An easy problem(简单题...)
- hdu 2123 An easy problem
- HDU 2123 An easy problem
- HDU 2123 An easy problem
- hdu 2123 An easy problem
- HDU 2123 An easy problem.
- hdu-oj 2123 An easy problem
- hdu 2123 An easy problem
- HDU-2601 An easy problem
- HDU 5572 An Easy Physics Problem(计算几何)——2015ACM/ICPC亚洲区上海站-重现赛
- hdu - 5475 - An easy problem - (线段树)
- hdu 2601(An easy problem)
- HDU 2055 An easy problem
- hdu 5475 An easy problem(线段树单点更新)
- hdu 5475 An easy problem(线段树)
- HDU 2055 An easy problem
- HDU 2601 An easy problem
- HDU 2055 An easy problem
- HDU 4729 An Easy Problem for Elfness(主席树)(2013 ACM/ICPC Asia Regional Chengdu Online)