Program to create a multiplication table of a given number using while loop.

By -

Using Visual Studio 2015


===============================================================

#include<iostream>
using namespace std;
#include<conio.h>
void main()
{

 int num , value, mul;
 cout<<"enter the number=";
 cin>>num;
 cout << "Multiplication Table for " << num << " :- " << endl;
 mul = 1;
 while (mul <= 10)
 {

  value = num * mul;
  cout << num << " * " << mul << " = " << value << endl;
  mul++;

 }
 _getche();
}


Comments

Post a Comment

Popular posts from this blog

Suppose you are given a square matrix of size n x n, write a program to determine if this is an identity matrix. 2D array

By -
Image
Using Visual Studio 2015 =============================================================== #include<iostream> using namespace std; #include<conio.h> void main() {  int array1[2][2];  for (int i = 0; i <= 1; i++)  {   for (int j = 0; j <= 1; j++)   {    cout<<"Enter the integers=";    cin>>array1[i][j];   }  }  for (int i = 0; i <= 1; i++)  {  for(int j = 0; j <= 1; j++)  {  cout<<array1[i][j];  }  cout<<endl;   }  if (array1[0][0] == 1 && array1[1][1] == 1 && array1[0][1] == 0 && array1[1][0] == 0)  {   cout << "\nIt is an identity matrix";  }  else  {   cout << "\nNot an identity matrix";  }  _getche(); } =========================================================================
Read more

Program to find equal values using if statement in C++

By -
Image
Using Visual Studio 2015 =============================================================== #include<iostream> using namespace std; #include<conio.h> void main() {  int num1, num2, num3;  cout << "Enter first number= ";  cin >> num1;  cout << "Enter second number= ";  cin >> num2;  cout << "Enter third number= ";  cin >> num3;  if (num1==num2)  {   cout <<"\nFirst number is equal to second number";  }  if (num1 == num3)  {   cout <<"\nFirst number is equal to third number";  }  if (num2 == num3)  {   cout <<"\nSecond number is equal to third number";  }  _getche();  } ==========================================================================
Read more