URI / BEE CROWD 1078 - Multiplication Table Solution in C,C++,Python | URI - BEECROWD - BEE 1078 Solution in C,C++,Python

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: 1


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 (1 < < 1000).

Output

Print the multiplication table of N., like the following example.

Input SampleOutput Sample

140

1 x 140 = 140
2 x 140 = 280
3 x 140 = 420
4 x 140 = 560
5 x 140 = 700
6 x 140 = 840
7 x 140 = 980
8 x 140 = 1120
9 x 140 = 1260
10 x 140 = 1400

URI / BEE CROWD 1078 - Multiplication Table Solution in C,C++,Python | URI - BEECROWD - BEE 1078 Solution in C,C++,Python

                                     Demonstration:

Here, the user input is stored in the int variable n. Then, we use a for loop to print the multiplication table up to 10. Then, the loop runs from i = 1 to i = 10. In each iteration of the loop, i * n is printed.
Finally, print the result. 
N.B: Don't copy paste the code as same. Just try to understand it and try yourself.

  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