LOOP

Q1.Accept 10 number user and do sum of it.(do not use array)

Q2.Accept a number from user and find a factorial of a number
Q3.Accept 10 number from user count how many are positive ,negative , zero
Q4.Accept a number from user and do sum of digit
Q5.Accept a number from user and reverse it.
Q6.Accept a number from user and check if it is palindrome number or not eg (121)
Q7.Accept a number from user and print a table of that number
Q8.Accept a number from user check if it is special number or not
a. Eg.145
b. 1! =1
c. 4!=1*2*3*4
d. 5!=1*2*3*4*5 sum of it(1+24+120=145)
Q9.Accept a number from user and check if it is armstrong number or not
a. Eg 153
b. 1 cube
c. 5 cube
d. 3 cube sum of it (1+27+125=153)
Q10. Go on accepting number from user till user enter 0 and do sum of it.*
Q11. Accept a number from user and print next 5 numbers.
Q12. Accept a number from user and print that many numbers after the number.
Q13. Accept start and end range from user and print all even number between them.
(two answer)
Q14. Accept start and end range from user and print all odd number between them.
(two answer)
Q15. Accept term from user and print Fibonacci series*
Q16. Accept two number from user and print it’s LCM*
Q17. Accept a number from user accept a digit from user and check the occurrence of
that digit
Q18. Accept 10 number from user and print highest number*
Q19. Accept 10 number from user and print lowest number.*
Q20. Accept 10 number from user and print highest and 2nd highest number.*
Q21. Write a prog to print every integer between 1 and n divisible by m. also report
whether the number that is divisible by m is even or odd.
Q22. Print all special number between 1 to 200000
Q23. Print all Armstrong number between 100 to 999
Q24. Print all prime number between 51 to 100
In all example we will simply write a method

Ans 1:Accept 10 number from user and do sum of it.(do not use array) return sum to main.

#include<stdio.h>

int sumoftennumber()
no sum
{
int i,no,sum=0;
0
5
for(i=1;i<=5;i++) 5
{ 2
scanf(“%d”,&no);//5 2 1 4 1 7
sum=sum+no;
1
8
}
return sum;//13 4
12
1
13
}

Entrypoint
#include<stdio.h>
int sumoftennumber();
int main()
{
int s;
s=sumoftennumber();
printf("%d",s);
getch();
return 0;

Ans 2: Accept a number from user and find a factorial of a number

int factorial(int no)

{
int i,f=1;

for(i=no;i>1;i--)
{

f = f *i;

}
 return f;
}

Ans : Accept a number from user and reverse it.

12 =21 210 r=0 rev=12

int revesenumber(int no)
2 2001
{
int r,rev=0;
//123 1
while(no!=0)//12 1 0
{ 2*10=20
r=no%10;//3 2 1
123
rev=rev*10+r; 320+1
no=no/10;1/10

} 321
return rev;//321
} 0012 ==12 ==21

}
Entry point
#include<stdio.h>
int revesenumber(int);
int main()
{
int s;
int no=2001;
s=revesenumber(no);
printf("%d",s);
getch();
return 0;

Ans: Accept a number from user and check if it is palindrome number or not eg (121)

int palindrome(int no) //121

{
int r, n, rev=0;
n=no;//121
while(no!=0)//12 1 0
{
r=no%10;//1 2 1
rev=rev*10+r; //0+1 /10+2 //120+1
no=no/10; //12 1 0

}
if(rev==n)// 121==121
return 1;
//else
return 0;
 }

Entry point

#include<stdio.h>

int main( ) {

int no,r;
scanf(“%d”,&no);//121

r= palindrome(no);//1
if(r==1)

printf("Number is palindrome");
else
printf("Not a palindrome");

Ans: Accept a number from user check if it is special number or not

int isspecial(int no) //145

{ 145====5!=120
int r, n, sum=0;
n=no;//145 4!= 24
while(no!=0) //145 14 1 0
{ 1!= 1
r=no%10; //5 4 1
sum=sum+factorial(r);//120 24 144 1
145
no=no/10;//14

if(sum==n)// 145 145

return 1;

return 0;
}
int factorial(int n)//5 4
{
int i, f=1;

for(i=2;i<=n;i++)
{

f=f*i;//2//6 24 120
}
return f;//120
 }

Entrypoint

#include<stdio.h>

int main( ) {

int no,r;
scanf(“%d”,&no);//145 122

r=isspecial(no);//1
if(r==1)

printf("Number is special number %d",no);

else

printf("Not a special number");

Ans: Accept start and end range from user and print all even number between them.

void evenrange(int s,int e)

{

for(int i=s;i<=e;i=i++)
{
if(i%2==0)
printf(“%d”,i);
}

void evenrange(int s,int e)

{
int b=isodd(s);
if(b==1)
s=s+1;
for(int i=s;i<=e;i=i+2)
{
printf(“%d”,i);
}

}
 int isodd(int n)
{
return n%2==1;

Ans: Accept term from user and print Fibonacci series

void fib(int s)
{ int a,b,c;
a=0;
b=1;
printf("%d %d ",a,b);
if(s>2)
{

for(int i=1;i<=s-2;i++)
{
c=a+b;
printf(" %d",c);
a=b;
b=c;
}

Q1.Accept two number from user and print it’s LCM*

Ans:Accept a number from user accept a digit from user and check the occurrence of that
digit

int occurance(int no,int n)

{ int r,c=0;
 while(no!=0)
{

r=no%10;
if(r==n)
c++;
no=no/10;
}
return c;
}

Ans: Accept 10 number from user and print highest number

int max()
{
Scanner sc=new Scanner(System.in);

int no, max,i;

scanf(“%d”,&no);//2

max=no;
for(i=2;i<=10;i++)
{
scanf(“%d”,&no);
if(max<no)
max=no;

}
return max;
}

Ans: Accept 10 number from user and print highest and 2nd highest number

Ans: Print all special number between 1 to 200000

void printspecial()
 {
for(int i=1;i<=200000;i++)
{
int b=isspecial(i);
if(b==1)
{ printf(“%d”,i);}

int isspecial(int no)

{
int r,n,sum=0;
n=no;
while(no!=0)
{
r=no%10;
sum=sum+factorial(r);
no=no/10;

if(sum==n)
return 1;

return 0;
}

int factorial(int n)
{
int i, f=1;

for(i=2;i<=n;i++)
{

f=f*i;
}
return f;

Ans: Print all prime number between start to end

void printprime(int s, int e)

{
int i,p;

int b=isodd(s);
if(b==1)
i=s;
else
i=s+1;
 for( ;i<=e;i=i+2)
{

p=isprime(i);
if(p==1)
{ printf(i);
}

int isprime(int no)

{
int i,flag=0;

for(i=2;i<=no/2;i++)
{ if(no%i==0)
{ flag=1;
break;
}
}
if(flag==0)
return true;
return false;

int isodd(int s)
{ return s%2==1; }