1- Print all the numbers from 1 to 100.

2- Print first 5 multiples of a number.

3- Print factorial of a number.
4- Print number, square and cube from 1 to 10 in one line with gaps in between.
5- Find the sum of all the numbers from 1 to 100 and print.
6- Find the sum of all even and odd numbers from 1 to 100 separately and print.
7- Check for Prime number.
8- Check for Perfect number.
9- Print Fibonacci series for given number of terms.
10- Check for Armstrong number.
11- Check for Magic number.
12- Check for Palindrome number.
13- Check for Reverse number.
14- Find the sum of all the digits of a number and print.
15- Count the number of digits in a number and print.

Answers:
1-
#include<iostream.h>
void main()
{
int i;
for(i=1;i<=100;i++)
{
cout<<i<<"\t";
}
}

2-
#include<iostream.h>
void main()
{
int i,n;
cout<<"Enter a number";
cin>>n;
for(i=1;i<=5;i++)
{
cout<<n*i<<"\n";
}
}

4-
#include<iostream.h>
void main()
{
int i;
for(i=1;i<=10;i++)
{
cout<<i<<"\t"<<i*i<<"\t"<<i*i*i<<"\n";
}
}

5-
#include<iostream.h>
void main()
{
int i,s=0;
for(i=1;i<=100;i++)
{
s=s+i;
}
cout<<"Sum="<<s;
}

6-
#include<iostream.h>
void main()
{
int i,se=0,so=0;
for(i=1;i<=100;i++)
{
if(i%2==0)
{
se=se+i;
}
else
{
so=so+i;
}
}
cout<<"\nSum of Even="<<se;
cout<<"\nSum of Odd="<<so;
}

7-
#include<iostream.h>
void main()
{
int i,n,flag=0;
cout<<"Enter a number";
cin>>n; 11
for(i=2;i<=n/2;i++) 2 to 5
{
if(n%i==0) 11%2=1 11%3=2 11%4=3 11%5=1
{
flag=1;
break;
}
}
if(flag==0)
{
cout<<"Prime";
}
else
{
cout<<"Not Prime";
}
}

8- Perfect Number 6=1+2+3

#include<iostream.h>
void main()
{
int i,n,s=0;
cout<<"Enter a number";
cin>>n; 6
for(i=1;i<n;i++) 1 to 5
{
if(n%i==0) 6%1=0 6%2=0 6%3=0 6%4=2 6%5=1
{
s=s+i; s=0+1=1 s=1+2=3 s=3+3=6
}
}
if(s==n)
{
cout<<"Perfect No";
}
else
{
cout<<"Not";
}
}

9- Fibonacci Series 0 1 1 2 3 5 8 13 21 34 ....

#include<iostream.h>
void main()
{
int i,t,f1=0,f2=1,s=0;
cout<<"Enter a number of terms";
cin>>t;
cout<<f1<<"\t"<<f2<<"\t";
for(i=3;i<=t;i++)
{
s=f1+f2;
cout<<s<<"\t";
f1=f2;
f2=s;
}
}

10- Armstrong Number 153=1^3+5^3+3^3

#include<iostream.h>
void main()
{
int n,r,s=0,t=0;
cout<<"Enter a number";
cin>>n; 153
t=n; 153
while(n>0)
{
r=n%10; 153%10=3 15%10=5 1%10=1
s=s+r*r*r; 0+27=27 27+125=152 152+1=153
n=n/10; 153/10=15.3=15 15/10=1.5=1 1/10=0.1=0
}
if(s==t) True
{
cout<<"Armstrong Number";
}
else
{
cout<<"Not";
}
}

11- Magic Number 22=> 2*2=4, 2+2=4

#include<iostream.h>
void main()
{
int n,r,s=0,m=1;
cout<<"Enter a number";
cin>>n; 22
while(n>0)
{
r=n%10; 22%10=2 2%10=2
s=s+r; 0+2=2 2+2=4
m=m*r; 1*2=2 2*2=4
n=n/10; 22/10=2.2=2 2/2=0
}
if(s==m) True
{
cout<<"Magic Number";
}
else
{
cout<<"Not";
}
}

12- Palindrome Number 121=> reverse is 121, Both are same

#include<iostream.h>
void main()
{
int n,r,s=0,t=0;
cout<<"Enter a number";
cin>>n; 121
t=n; 121
while(n>0) true
{
r=n%10; 121%10=1 12%10=2 1%10=1
s=s*10+r; 0+1=1 1*10+2=12 12*10+1=121
n=n/10; 121/10=12.1=12 12/10=1.2=1 1/10=0.1=0
}
if(s==t)
{
cout<<"Palindrome Number";
}
else
{
cout<<"Not";
}
}

13- Reverse Number 123=> reverse is 321

#include<iostream.h>
void main()
{
int n,r,s=0;
cout<<"Enter a number";
cin>>n;
while(n>0)
{
r=n%10;
s=s*10+r;
n=n/10;
}
cout<<s;
}

14- Sum of Digits 123=> 1+2+3=6

#include<iostream.h>
void main()
{
int n,r,s=0;
cout<<"Enter a number";
cin>>n;
while(n>0)
{
r=n%10;
s=s+r;
n=n/10;
}
cout<<"Sum of Digits="<<s;
}

15- Count of Digits 1234=> 4

#include<iostream.h>
void main()
{
int n,r,c=0;
cout<<"Enter a number";
cin>>n; 1234
while(n>0) true
{
r=n%10; 1234%10=4 123%10=3 12%10=2 1%10=1
c++; 1 1+1 1+1+1 1+1+1+1
n=n/10; 1234/10=123.4=123 123/10=12.3=12 12/10=1.2=1
1/10=0.1=0
}
cout<<"Digits="<<c;
}