hdoj An easy problem
2014-12-01 14:01
337 查看
An easy problem
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 39 Accepted Submission(s) : 22Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
In this problem you need to make a multiply table of N * N ,just like the sample out. The element in the ith row and jth column should be the product(乘积) of i and j.Input
The first line of input is an integer C which indicate the number of test cases.Then C test cases follow.Each test case contains an integer N (1<=N<=9) in a line which mentioned above.Output
For each test case, print out the multiply table.Sample Input
2 1 4
Sample Output
1 1 2 3 4 2 4 6 8 3 6 9 12 4 8 12 16
#include<cstdio>#include<cstdlib>#include<cstring>using namespace std;int main(){ int k,a,b,i,j; while(scanf("%d",&k)!=EOF){ while(k--){ scanf("%d",&a); for(i=1;i<=a;++i){ for(j=1;j<=a;++j){ if(j==1) printf("%d",i); else printf(" %d",i*j);} printf("\n");} }} return 0;}
相关文章推荐
- An easy problem hdoj 2055
- HDOJ-1709 The Balance(母函数)
- 【HDOJ】1493 QQpet exploratory park
- 递推DP HDOJ 5459 Jesus Is Here
- hdoj-5704-Luck Competition
- HDOJ1418 抱歉(欧拉公式)
- HDOJ-1847 Good Luck in CET-4 Everybody!
- 【HDOJ】1341 Simple Computers
- [线段树] HDOJ Excited Database
- [HDOJ4578]Transformation(线段树,多延迟标记)
- hdoj 1046 Gridland(找规律)
- new hdoj 1515 (pe)(但是我可以做出来了)(搜索,注意剪枝)
- hdoj 1026 Ignatius and the Princess I 【BFS】
- hdoj How Many Equations Can You Find【DFS】
- hdoj 2685
- HDOJ1799 循环多少次?
- hdoj_1162Eddy's picture(最小生成树)
- HDOJ_ACM 1029取(N+1)/2个及以上的值
- HDOJ 1102 prim
- HDOJ-2586 How far away ?(在线LCA)