hdu-oj 2123 An easy problem

An easy problem

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

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

   
   题目大意：输出矩阵，第I层按I等差递增。
  
  
  
  

   
   解题思路：定义二维数组分别表示行和列，然后按照每一层的关系递增数列。
  
  
  
  

   
   注意：每一位后面有一空格，最后一位没有，各矩阵相邻无空行。

   
   
#include <stdio.h>
int main()
{  int i,j,sum,n,m,k;
    int a[10][10]={0};
    scanf("%d",&n);
   while(n--)
   { scanf("%d",&m);
     for(i=1;i<=m;i++)
        {  k=i;
           for(j=1;j<=m;j++)
            {a[i][j]=k;
               k+=i;
            }
        }
     for(i=1;i<=m;i++)
       { for(j=1;j<m;j++)
            printf("%d ",a[i][j]);
         printf("%d\n",a[i][m]);     
       }            
   } 
    return 0;
}