HDU_2123 An easy problem

An easy problem

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

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.
   
   
   
    
  
  

 

Author

XHD

 

Source

HDU 2007-10 Programming Contest

 

Recommend

威士忌

 

#include<stdio.h>
int main()
{
	int num;
	scanf("%d",&num);
	while(num--)
	{
		int i,j,n;
		scanf("%d",&n);
		for(i=1;i<=n;i++)
		{
			if(i!=1)
			printf("\n");
			for(j=1;j<=n;j++)
			{
				if(j!=1)
				printf(" %d",i*j);
				else
				printf("%d",i*j);
			}
		}
		printf("\n");
	}
	return 0;
}