1 条题解
-
0
C :
#include<stdio.h> int main() { int c,n,i,j,k,a[10][10]; scanf("%d",&c); while(c--) { scanf("%d",&n); for(i=1;i<n+1;i++) { k=0; for(j=1;j<n+1;j++) { a[i][j]=i*j; printf(k++?" %d":"%d",a[i][j]); } printf("\n"); } } return 0; }
C++ :
#include<iostream> #include<cstdio> #include<cstring> #include<map> #include<queue> #include<stack> #include<set> #include<vector> #include<algorithm> #include<cmath> using namespace std; #define Max(a,b) (a > b ? a : b) #define Min(a,b) (a < b ? a : b) #define INF 0x3f3f3f3f #define M 100 int main() { int n,m; scanf("%d",&n); while(n--) { scanf("%d",&m); for(int i = 1; i <= m; i++) { for(int j = 1; j <= m; j++) { if(j == 1) { printf("%d",i * j); } else { printf(" %d",i * j); } } printf("\n"); } } return 0; }
Pascal :
program p1015; var c,n,t,i,j,k:longint; begin readln(c); for i:=1 to c do begin readln(n); for j:=1 to n do begin for k:=1 to n-1 do write(j*k,' '); writeln(j*n); end; end; end.
Java :
import java.util.*; public class Main{ public static void drawMatrix(int x){ for(int i=1;i<=x;i++){ for(int j=1;j<x;j++){ System.out.print(j*i+" "); } System.out.print(x*i); System.out.println(); } } public static void main(String[] args) { @SuppressWarnings("resource") Scanner sc = new Scanner(System.in); int flag = sc.nextInt(); int[] a = new int[flag]; for(int i=0;i<flag;i++){ a[i] = sc.nextInt(); } for(int i=0;i<flag;i++){ drawMatrix(a[i]); } } }
Python :
import sys l =1 for line in sys.stdin: data = int(line.split()[0]) if l !=1: if data == 1: print 1 else: #k = 1 for j in xrange(1,data+1): new = [ i*j for i in range(1,data+1)] print ' '.join([str(i) for i in new]) l +=1
- 1
信息
- ID
- 6212
- 时间
- 1000ms
- 内存
- 32MiB
- 难度
- (无)
- 标签
- 递交数
- 0
- 已通过
- 0
- 上传者