HDU 2123 An easy problem

最新推荐文章于 2022-02-25 19:38:17 发布

香草咖啡有点甜

最新推荐文章于 2022-02-25 19:38:17 发布

阅读量458

点赞数

分类专栏： ACM题目解析文章标签： integer input each output table c

本文链接：https://blog.csdn.net/ZCY20121105/article/details/7863277

版权

ACM题目解析专栏收录该内容

146 篇文章 0 订阅

订阅专栏

An easy problem

Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3474 Accepted Submission(s): 2452

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

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.

思路：先打表，然后再控制输出就行了。

AC代码：

#include<iostream>
using namespace std;
int a[10][10];
int main()
{
	int t,i,j,n;
	for(i=1;i<10;i++)
	{a[1][i]=a[i][1]=i;}
	for(i=2;i<10;i++)
	  for(j=2;j<10;j++)
	    a[i][j]=a[i][1]*a[1][j];
	while(scanf("%d",&t)!=EOF)
	{
		while(t--)
		{
			scanf("%d",&n);
			for(i=1;i<=n;i++)
			{
				for(j=1;j<=n;j++)
				{
					if(j==n)
					printf("%d\n",a[i][j]);
					else printf("%d ",a[i][j]);
				}
			}
		}
	}
	return 0;
}