Multiplication Table (10 x 10)

Write a multiplication table ( 10 x 10)

/*
Multiplication Table (10 * 10)
*/
#include <iostream>

using namespace std;

int main(void)
{
 int x,y;
 char waitInput;

 for(x=1; x<=10; x++)
 {
  for(y=1; y<=10; y++)
  {
   //use horizontal tab (\t) to align properly
   cout << "\t" << (x*y);
  }

  //newlines
  cout<<endl<<endl;
 }

 cin>>waitInput;
 return 0;
}

Reverse The Number

Write a C++ program which ask for a number and reverse its digits.
Ex. Number = 1234 , the answer will be 4321

1) Extract the last digit through the use of modulus operator (%) to get the remainder when the a number is divided by 10.
2) Add the extracted digit to a reversed number variable (ex. reversedNum) which will be constructed. The variable should be initialized to 0 and must be multiplied with 10 before the extracted digit is added.
3) After the last digit is extracted, divide the number with 10 to eliminate the extracted digit and start again to Step 1. The cycle continues until there is number is already 0.

/*
Reverse the number
*/
#include <iostream>

using namespace std;

int main(void)
{
 long number, remainder, reverseNumber = 0;
 char hang;

 cout<< "Enter the number: ";
 cin>>number;
 
 while(number)
 {
  //extract the last digit from the number
  remainder = number % 10;  

  //build the reverseNumber digit by digit
  reverseNumber = (reverseNumber * 10) + remainder;

  //exclude the last digit from the number
  //ready for the next evaluation
  number = number / 10;    
 }

 cout<< "Reversed number = " << reverseNumber <<endl;
 
 //to let console stay
 cin>>hang;
 
 return 0;
}

//Sample 1

Enter the number: 1235
Reversed number = 5321

//Sample 2

Enter the number: 1023
Reversed number = 3201

//Sample 3

Enter the number: 5007
Reversed number = 7005

//*Sample 4

Enter the number: 012
Reversed number = 21

//*Sample 5

Enter the number: 210
Reversed number = 12

*Note that for inputs having 0 in the beginning and in the end, 0 will not be include in the output, See below:
Input = 012        Output = 21 ( 012 is considered as 12 because the 0 is not significant)
Input = 210        Output = 12 ( instead of 012, 0 is not significant in the answer)

Check If A Number Is A Prime Number

Prime Numbers Between 1-1000

Write a C++ program which prints all the prime numbers from 1-1000. 

Let's take 5 for example:
1 and 5 (the number itself) can evenly divide 5 so they are factors of 5.
2, 3, 4 are cannot evenly divide 5 so they are not factors of 5.
Therefore, 5 is a Prime Number.

Fibonacci Numbers using Recursion

Write a C++ program which prints the Fibonacci sequence or the Fibonacci numbers.

Ex. 0, 1, 1, 2, 3, 5
The first two numbers in the sequence are 0 and 1.
The 3rd number which is 1 is the sum of its previous two numbers - 0 and 1.
The 4th number which is 2 is the sum of its previous two numbers  - 1 and 1.
So on and so forth...

Fn = F(n-1) + F(n-2) where F0 = 0, F1 = 1