HDU 2123 An easy problem.

最新推荐文章于 2019-08-03 11:54:39 发布

Qiubiubiu

最新推荐文章于 2019-08-03 11:54:39 发布

阅读量1.8k

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM_HDU 文章标签： HDU 2123 An easy problem In this problem you need to make

本文链接：https://blog.youkuaiyun.com/darwin_/article/details/18899449

ACM_HDU 专栏收录该内容

21 篇文章

订阅专栏

本文介绍了一个简单的C语言程序，用于生成N*N的乘法表。程序通过两重循环实现，能够根据输入的整数N（1<=N<=9）输出相应大小的乘法表。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Problem Description

In this problem you need to make a multiply table of N * N ,just like the sample out. The element in the i^th row and j^th 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

Hint
There is no blank space at the end of each line.
 
====
两重循环，可以写的很美观额。

#include<stdio.h>
int main()
{
    int i,j,c,n; 
    scanf("%d",&c);
    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; 
}