URI / BEE CROWD 1078 - Multiplication Table Solution in C,C++,Python | URI - BEECROWD - BEE 1078 Solution in C,C++,Python
beecrowd | 1078
Multiplication Table
Adapted by Neilor Tonin, URI Brazil
Timelimit: 1Adapted by Neilor Tonin, URI Brazil
Read an integer N (2 < N < 1000). Print the multiplication table of N.
1 x N = N 2 x N = 2N ... 10 x N = 10N
Input
The input is an integer N (1 < N < 1000).
Output
Print the multiplication table of N., like the following example.
Input Sample | Output Sample |
140 | 1 x 140 = 140 |
URI / BEE CROWD 1078 - Multiplication Table Solution in C,C++,Python | URI - BEECROWD - BEE 1078 Solution in C,C++,Python
Demonstration:
URI / BEE 1078 Solution in C :
URI / BEECROWD Online Judge 1078 Solve in C : |
#include<stdio.h>
int main()
{
int i,n;
scanf("%d",&n);
for(i=1;i<=10;i++){
printf("%d x %d = %d\n",i,n,i*n);
}
}
0 Response to URI / BEE CROWD 1078 - Multiplication Table Solution in C,C++,Python | URI - BEECROWD - BEE 1078 Solution in C,C++,Python
Post a Comment