HDU 2123 An easy problem
来源:互联网 发布:映客花椒类型直播源码 编辑:程序博客网 时间:2024/05/29 09:14
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.
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
214
Sample Output
11 2 3 42 4 6 83 6 9 124 8 12 16#include<stdio.h> //int a[10][10];int main() { int n,t,i,j; char c; scanf("%d",&t); while(t--) { scanf("%d",&n); for(i=1;i<=n;i++) { for(j=1;j<=n;j++) {// a[i][j]=i*j; if(j<n) printf("%d ",i*j); else printf("%d",i*j); } printf("\n"); } } return 0; }
0 0
- 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 2123 An easy problem
- HDU 2123 An easy problem
- hdu-An Easy Problem
- hdu-An Easy Problem
- hdu-oj 2123 An easy problem
- hdu 2601 An easy problem
- hdu 2601(An easy problem)
- hdu 2601 An easy problem
- hdu 2601 An easy problem
- HDU 2055 An easy problem
- hdu 2132 An easy problem
- HDU 2055 An easy problem
- JavaScript学习笔记(2)
- POJ 2777 Count Color(线段树:区间覆盖)
- Oracle驱动classes12.jar 与ojdbc14.jar的区别
- 理解Fragment生命周期
- java jvm 垃圾回收
- HDU 2123 An easy problem
- UVa 10815 - Andy's First Dictionary
- rand('state',0)
- python Tkinter PhotoImage "too early to create image"
- 青春碎片
- while 语句
- 【计算机网络常见面试题】划分子网
- CXXXView::OnDraw(CDC* /*pDC*/) 参数表中的注释是什么意思
- [Accessibility] Missing contentDescription attribute on image