Here is a complete list of lower triangular ninety-nine formulas:
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
1*5=5 2*5=10 3*5=15 4*5=20 5*5=25
1*6=6 2*6=12 3*6=18 4*6=24 5*6=30 6*6=36
1*7=7 2*7=14 3*7=21 4*7=28 5*7=35 6*7=42 7*7=49
1*8=8 2*8=16 3*8=24 4*8=32 5*8=40 6*8=48 7*8=56 8*8=64
1*9=9 2*9=18 3*9=27 4*9=36 5*9=45 6*9=54 7*9=63 8*9=72 9*9=81
The title requirements for any given a positive integer N
, outputted from 1*1
the N*N
partial formulas table.
Input formats:
In a given input row positive integer N
(. 1 ≤ N
≤9).
Output formats:
Output lower triangular N*N
portion formulas table, wherein the righthand side of the figure represents 4, left-justified.
Sample input:
4
Sample output:
1*1=1
1*2=2 2*2=4
1*3=3 2*3=6 3*3=9
1*4=4 2*4=8 3*4=12 4*4=16
#include<stdio.h> int main() { int N; int i,j; scanf("%d",&N); for(j=1;j<=N;j++) { for(i=1;i<=j;i++) printf("%d*%d=%-4d",i,j,i*j); printf("\n"); } }
My heart away
This problem is relatively simple, spend a relatively short time.
It should be noted that the left-aligned :-( negative sign); To clear the entire code running process, so you know, line breaks where appropriate. (Clear for circulation)