Write a program that prompts the user to input a positive integer. It should then print the multiplication table of that number.



 Write a program that prompts the user to input a positive integer. It should then print the multiplication table of that number.


#include<iostream>

using namespace std;

int main()

{  int i ,n , table ;


 cout<<" Table of n "<<endl;

  cout<<"Enter the n of finding table = ";

   cin>>n;

   cout<<"Table of "<<n<<" : "<<endl;

   for( i=1 ; i<=10 ; i++)

   {   cout<<n<<" * "<<i<<" = "<< (n*i)<<endl; }

   

  return 0;

}

  • OUTPUT

Table of n 
Enter the n of finding table = 8
Table of 8 : 
8 * 1 = 8
8 * 2 = 16
8 * 3 = 24
8 * 4 = 32
8 * 5 = 40
8 * 6 = 48
8 * 7 = 56
8 * 8 = 64
8 * 9 = 72
8 * 10 = 80

Comments

Post a Comment

If you have any doubt ,let me know

Popular posts from this blog

Write the program to arrange the n queen(queen of chessboard) in n*n matrix such that they can not ATTACK TO eachother.

Image
  OUTPUT : In form of matrix of elements (0 and 1)     where 1 is suitable position where can be keep without attack to each other.   USED : Recursion , BACKTRACKING etc CHARACTERISTICS   OF QUEEN :     A )They can move in any position in a row where it is presence.     B )They can move in any position in a column where it is presence.     C )They can move in any position in a diagonal where it is presence. CONDITION :     Arrange the queen such that they can not ATTACK to each other.     in n*n matrix       APPROCH :    A )put a queen in a row than move next row to put      the next queen in next row such that they can not ATTACK each other        After matrix 4 they are not any place where a queen can be Put without attack by anyone so BACKTRACK occur here and reach again to Matrix 1 and then continue...
Read more

Write the program to determine the maximum possible way to reach the end from starting in game board.

Image
         #include <iostream> #include <string> using namespace std;   int maxpath( int str, int end)    {   if (str==end)            {  return 1;} //when number of blocks be lessthen no of jumps(max jump 6)      if (str>end)       {return 0;} // then this conditio n will follow satisfy.                             int count=0;          for ( int i=1;i<=6;i++)         {  count =count + maxpath(str+i,end);}       return count;        }                int main() {    int   str=1; //str = ...
Read more

2) .cheak even and odd nmbr\\\

//Check even or odd number #include <iostream> using namespace std; int main() {  int a,b;   cin>>a;     if (   a%2==0  )       {cout<< " a is even nmber" ;     }     else cout << "a is odd nmbr" ;       return 0;     }    
Read more