HDU 2123 An easy problem
来源:互联网 发布:canon mp230 清零软件 编辑:程序博客网 时间:2024/06/05 06:08
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 16HintThere is no blank space at the end of each line.
#include <stdio.h>int main(){int n,i,j,a;scanf("%d",&n);while (n--){scanf("%d",&a);for(i = 1; i <= a; i ++){for ( j = 1; j < a; j ++){printf("%d ",i*j);}printf("%d\n",i*j);}}return 0;}
1 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
- [疯狂Java]网络:GET/POST请求、设置请求属性、获取响应属性
- kafka源码解析之一kafka诞生的背景
- WebService学习之旅(一)使用JAX-WS发布WebService
- C++primer第七章习题答案
- CF IndiaHack B 深度优先搜索
- HDU 2123 An easy problem
- 瓜子二手车直卖网 既不直卖又有中间商
- OC中字符串类和数值类
- HDU_2604Queuing
- POJ 2752 Seek the Name, Seek the Fame
- HDU 2068:RPG的错排【排列组合】
- nginx配置ssl加密(单/双向认证、部分https)
- Red Hat 7.0 配置使用CentOS 7.0 Yum 源
- 【字符串水题】HDU2617Happy 2009