01)PRIME NO.

OR NOT

#include<stdio.h>

int main(){

int n,i,count=0;

scanf("%d",&n);

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

if(n%i==0){

count++;

if(count<2){

printf("prime");

else{

printf("composite");

return 0;

}
02)PERFECT NO.
#include<stdio.h>

int main(){

int n,i,sum=0;

scanf("%d",&n);

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

if(n%i==0){

sum=sum+i;

if(sum==n){

printf("perfect");

else{
 printf("not perfect");

return 0;

03] FACTORIAL

IN ASCENDING FORMAT

#include<stdio.h>

int main(){

int n,i,fact=1;

scanf("%d",&n);

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

fact=fact*i;

printf("%d",fact);

return 0;

IN DESCENDING FORMAT

#include<stdio.h>

int main(){

int n,i,fact=1;

scanf("%d",&n);

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

fact=fact*i;

printf("%d",fact);
 return 0;

04}SUM OF GIVEN NO.

#include<stdio.h>

int main(){

int n,r,sum=0;

scanf("%d",&n);

while(n>0){

r=n%10;

sum=sum+r;
 n=n/10;

printf("%d",sum);

return 0;

5]FIBONACCI

#include<stdio.h>

int main(){

int n,a=0,b=1,c;

scanf("%d",&n);
 for(int i=1;i<=n;i++){

printf("%d",a);

c=a+b;

a=b;

b=c;

return 0;

06]PALINDROME

#include<stdio.h>

int main(){
 int n,r,sum=0,temp;

scanf("%d",&n);

temp=n;

while(n>0){

r=n%10;

sum=sum*10+r;

n=n/10;

n=temp;

if(n==sum){

printf("palindrome");

else{

printf("Not palindrome");

return 0;

}
 7]STRONG NO.

#include<stdio.h>

int main(){

int n,r,sum=0,i,fact=1;

scanf("%d",&n);

while(n>0){

r=n%10;

for(i=r;i>=1;i++){

fact=fact*i;

sum=sum+fact;
 n=n/10;

if(sum==n){

printf("strong");

else{

printf("not strong");

return 0;

ARMSTRONG NO.

#include<stdio.h>

int main(){
 int n,r,temp,c,sum=0;

scanf("%d",&n);

temp=n;

while(n>0){

r=n%10;

c=r*r*r;

sum=sum+c;

n=n/10;

n=temp;

if(sum==n){

printf("armstrong");

else{

printf("Not armstrong");

return 0;

}
9)REVERSE NO.

#include<stdio.h>

int main(){

int n,r,sum=0;

scanf("%d",&n);

while(n>0){

r=n%10;

sum=sum*10+r;

n=n/10;

printf("%d",sum);

return 0;

}
ADDITION OF ELEMENTS IN AN ARRAY
LARGEST ELEMENT IN AN ARRAY