PPS programs soft copy

1.CUBE
#include <stdio.h>

int main() {

int number , cube;

scanf("%d", &number);

cube = number*number*number;

printf(" CUBE is: %d", cube);

return 0;

2.NAME AND BIRTH

#include <stdio.h>

int main() {

char firstname[20],lastname[20];

int bir_yr;

scanf("%s",firstname);

scanf("%s", lastname);

scanf("%d", &bir_yr);

printf("%s %s %d\n",firstname,lastname,bir_yr);

return 0;

3.LARGEST NUMBER

#include <stdio.h>

int main() {

int a,b,c,max;

scanf(" %d %d %d ",&a ,&b ,&c);

if(a > b )

max=a;

else if (b > a)
 {

max=b;

if(max > c)

printf("%d",max);

else

printf("%d",c);

return 0;

4.HOT SUMMER

#include <stdio.h>

int main() {

int a;

scanf("%d",&a);

if(a%2==0)

printf("YES");

else

printf("NO");
 }

return 0;

5.THEATRE SQUARE

#include <stdio.h>

int main()

int x,y,z,a,b;

scanf("%d %d %d",&x ,&y ,&z);

if(x%z==0)

a=(x/z);

else if(x%z!=0)

a=(x/z)+1;

if(y%z==0)

b=(y/z);

else if(y%z!=0)

b=(y/z)+1;

printf("%d",a*b);

return 0;

6.POW

#include <stdio.h>

#include <math.h>
int main() {

int x, n, res ;

scanf("%d %d" ,&x, &n);

res=pow(x,n);

printf("%d to the power of %d is= %d" , x, n, res);

return 0;

7.MINUTES

#include <stdio.h>

int main() {

int a,b,c;

scanf("%d hrs \n", &a);

scanf("%d mins", &b);

c=(60*a+b);

printf("%d minutes",c);

return 0;

8.SUM OF THREE NUMBERS

#include <stdio.h>

int main() {

int a, b, c, res;

char temp;

scanf("%d %c %d %c %d" ,&a ,&temp ,&b , &temp,&c);

res=a+b+c;

printf("%d", res);

return 0;

9.DIFFERENCE

#include <stdio.h>

int main()

{
 int num1, num2, res ; //Declaration

//input section

scanf("%d %d",&num1, &num2);

//process section

res=num2-num1;

//Output section

printf("Difference between %d and %d is = %d" , num1,num2,res);

return 0;

10.RECTANGULAR

#include <stdio.h>

int main()

int h,w,p;

scanf("%d %d", &h, &w);

p=2*(h+w);

printf("%d",p);

return 0;

11.STATE ELECTION

#include <stdio.h>
int main()

int a;

scanf("%d",&a);

if(a>=18 && a<=60)

printf("Eligible");

else

printf("Not Eligible");

return 0;

12.IDENTIFT THE STRING

#include <stdio.h>

int main()

char ch;

scanf("%c",&ch);

if(ch=='A'||ch=='E'||ch=='I'||ch=='O'||ch=='U'||ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u')

printf("VOWEL");

else

printf("CONSONANT");

return 0;
}

13.RATE OF INTEREST

#include <stdio.h>

int main()

int p;

float S,r,t;

scanf("%d",&p);

scanf("%f",&t);

scanf("%f",&r);

S=(p*r*t)/100;

printf("%.02f",S);

return 0;

14.POWER OF 2

#include <stdio.h>

int main() {

int a,i;

scanf("%d",&a);

i=a & (a-1);

if(i==0)

printf("WOW");

else

printf("OOPS");

return 0;

}
15.SWITCH INTEGER

#include <stdio.h>

int main()

int temp,x,rev,remainder;

scanf("%d",&x);

int n[x],i;

for(i=0;i<x;i++)

scanf("%d",&n[i]);

for(i=0;i<x;i++)

temp=n[i];

rev=0;

while(temp!=0)

remainder=temp % 10;

rev= rev * 10 +remainder;

temp/=10;

printf("%d\n",rev);

return 0;

16.GRADING SYSTEM

#include <stdio.h>

int main()

{
 int i,n,a,c;

float b,temp;

temp=0.7;

scanf("%d",&n);

for(i=0;i<n;i++)

scanf("%d%f%d",&a,&b,&c);

// printf("b= %f ",b);

//printf("temp=%f",temp);

if(a>50&&b<temp&&c>5600)

printf("10\n");

else if(a>50&&b<temp)

printf("9\n");

else if(b<temp&&c>5600)

printf("8\n");

else if(a>50&&c>5600)

printf("7\n");

else if(a>50||b<temp||c>5600)

printf("6\n");

else if(a<50&&b>temp&&c<5600)

printf("5");

return 0;

17.HAPPY ADDITION

#include <stdio.h>

int main()

int A[100],p,i,n,d;

scanf("%d",&n);
 for(i=0;i<n;i++)

scanf("%d",&A[i]);

scanf("%d",&d);

scanf("%d",&p);

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

A[i+1]=A[i];

A[p-1]=d;

for(i=0;i<=n;i++)

printf("%d " ,A[i]);

return 0;

18.AMSTRONG DIGITS

#include <stdio.h>

int main()

int n,r,sum=0,temp,i,m;

scanf("%d",&i);

//scanf("%d",&n);

//temp=n;

for(m=1;m<=i;m++)

sum=0;
 scanf("%d",&n);

temp=n;

while(n>0)

r=n%10;

sum=sum+(r*r*r);

n=n/10;

if(temp==sum)

printf("Armstrong\n");

else

printf("Not Armstrong\n");

return 0;

19.MIRROR PROBLEM

#include <stdio.h>

int main() {

int num,count=0;

scanf("%d",&num);

while(num!=0)

num=num/10;

count++;

}
 printf("%d",count);

return 0;

20.FOUR SQUARE

#include <stdio.h>

#include<math.h>

int main()

int not1,value,rec,i;

scanf("%d",&not1);

for(i=1;i<=not1;i++)

scanf("%d",&value);

rec=sort(value);

printf("%d\n",rec);

return 0;

int sort(int temp)

int res;

res=sqrt(temp);

return res;

21.ROHIT AND PANDYA CHALLENGE

#include <stdio.h>

#include <math.h>

int main() {

float n,res;

scanf("%f",&n);
 res=(sqrt(3)/4)*(n*n);

printf("%.02f sq.units",res);

return 0;

22.MAHI AND RAINA

#include <stdio.h>

int main()

int i,j,k;

scanf("%d",&i);

scanf("%d",&j);

scanf("%d",&k);

if((i>k) && (k>j))

printf("TRUE");

else

printf("FALSE");

return 0;

23.LAKSHMI’S TEACHER

#include <stdio.h>

int main()

int n;

scanf("%d",&n);

if(n>0)

printf("POSITIVE");
 else if(n==0)

printf("ZERO");

else if(n<0)

printf("NEGATIVE");

return 0;

24.VIJAY AND THE FACTORS

#include <stdio.h>

int main()

int t,b,i,j=0,num,l,p=0,c[1000],arr[1000],q,s,n,x[100];

scanf("%d",&t);

for(l=0;l<t;l++)

for(i=0;i<100;i++)

q=1;

c[i]=0;

arr[i]=0;

scanf("%d",&num);

for(i=2;i<=num;i++)

if(num%i == 0)

++p;

num=num/i;

c[i]=c[i]+p;

p=0;

if(q!=i)
 {

arr[j]=i;

++j;

n=j;

q=i;

--i;

i=0;

j=0;

for(j=0;j<n;j++)

i=arr[j];

printf("%d %d ",arr[j],c[i]);

printf("\n");

j=0;

i=0;

return 0;

25.NTH TERM

#include <stdio.h>

int main()

//nts=no of test cases,nod=no of terms

int sum,i,nts,nod,j;

scanf("%d ",&nts);

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

scanf("%d",&nod);

sum=1;

for(j=2;j<=nod;j++)

sum=sum+j;

printf("%d",sum);

printf("\n");

return 0;

26.MODI AND THE CASH

#include <stdio.h>

int main()

int sum, value,i;

scanf("%d",&sum);

int a[] = {500,100,50,20,10,5,2,1};

for(i =0;i<8;i++)

value = sum/a[i];

sum = sum%a[i];

printf("%d = %d\n",a[i],value);

return 0;
}

27.MAXWELL AND HIS COUSIN

#include <stdio.h>

int main()

int i,j,rows,cols;

scanf("%d %d",&rows,&cols);

for(i=1;i<=rows;i++)

for(j=1;j<=cols;j++)

if(i==1||i==rows||j==1||j==cols)

printf("1");

else

printf("0");

printf("\n");

return 0;

28.RAM AND THE WEEK

#include <stdio.h>

int main()

{
 int n;

scanf("%d",&n);

if(n==1)

printf("Monday");

else if(n==2)

printf("Tuesday");

else if(n==3)

printf("Wednesday");

else if(n==4)

printf("Thursday");

else if(n==5)

printf("Friday");

else if(n==6)

printf("Saturday");

else if(n==7)

printf("Sunday");

return 0;

29.DHONI THE MAN WITH MIDAS TOUCH

#include <stdio.h>

int main()

int n;

// scanf("%d",&n);

while(n!=42)

scanf("%d",&n);

if(n!=42)

printf("%d\n",n);

// else

// printf(" ");
 }

return 0;

30.KL RAHUL AND HIS TEAMMATES

#include <stdio.h>

int main()

int runs,i,rem;

scanf("%d",&runs);

int a[]={0,0,0,0,0,0,0,0,0,0};

while(runs!=0)

rem=runs%10;

runs=runs/10;

a[rem]++;

for(i=0;i<10;i++)

printf("%d = %d\n",i,a[i]);

return 0;

31.BYTE

#include <stdio.h>

int main() {

float a;
 int x;

scanf("%f",&a);

x=sizeof(a);

printf("%d %ld",x,sizeof(x)*2);

return 0;

32.SUM OF SERIES

#include <stdio.h>

int main()

int i,j,x,t,y;

scanf("%d",&t);

for(y=0;y<t;y++)

{x=0;

scanf("%d\n",&j);

for(i=1;i<=j;i++)

x=x+i;

printf("%d\n",x);

return 0;

33.MATH

#include <stdio.h>

#define MOD 1000000007

int count;

void calc (int chef[],int n,int sum,int index)

if(index<0)

return;
 if(sum<0)

return;

if((long long )chef[index]*n<sum)

return;

if(n==0)

if(sum==0)

count=(count+1)%MOD;

return;

calc(chef,n-1,sum-chef[index],index);

calc(chef,n,sum,index-1);

int main(){

int i,q,x,k;

int chef[43];

chef[0]=1;

chef[1]=2;

for(i=2;i<43;i++)

chef[i]=chef[i-1]+chef[i-2];

scanf("%d",&q);

while(q--)

count=0;

scanf("%d%d",&x,&k);

calc(chef,k,x,42);

printf("%d\n",count);

return 0;

34.LION CUB
#include<stdio.h>

long long int data[41][2];

long long int Answer(int k,int num);

int main ()

int t,n,m,c,p,i;

long long int answer;

scanf("%d",&t);

while(t--)

scanf("%d%d",&n,&m);

answer=0;

for (i=0;i<41;i++)

data[i][0]=data[i][1]=0;

for(i=0;i<n;i++)

scanf("%d%d",&c,&p);

data[c][0]+=p;

data[c][1]++;

for (i=1;i<=40;i++)

if(data[i]>0)

answer+=data[i][0]*(1<<(data[i][1]-1))*Answer(m-1,i);

printf("%.9lf\n",(double)answer/Answer(m,0));

return 0;

}
long long int Answer(int k, int num)

long long int answer=0,e[41][41],v[41];

int i,j=1,tot=0;

for(i=0;i<41;i++)

if (data[i][0]>0&&i!=num)

v[j++]=(1<<data[i][1])-1;

tot++;

for(i=0;i<tot+1;i++)

e[i][0]=1;

for (i=0;i<tot+1;i++)

for (j=1;j<=tot;j++)

if (j>i)

e[i][j]=0;

else

e[i][j]=e[i-1][j]+e[i-1][j-1]*v[i];

for (i=k;i<=tot;i++)

answer+=e[tot][i];

return answer;

35.IPL

#include<stdio.h>

int main()

int n;

scanf("%d", &n);
printf("%d", n);

printf(" %o", n);

printf(" %X", n);

return 0;

36.OPERATORS

#include <stdio.h>

int main() {

int a,b,c,i,n;

scanf("%d",&n);

for(i=0;i<n;i++)

scanf("%d %d",&a,&b);

if(a>b)

printf(">\n");

else if(a<b)

printf("<\n");

else if(a==b)

printf("=\n");

return 0;

}
37.INTEGER

#include <stdio.h>

int main()

unsigned int number;

int count;

count = 0;

scanf("%d", &number);

while (number != 0)

if ((number & 1) == 1)

count++;

number = number >> 1;

printf("%d", count);

return 0;

38.MARK ZUKENBERG

#include <stdio.h>

int main()

int a,b,c;

scanf("%d %d",&a,&b);

c = a-1;

printf("%d\n",a & b);

printf("%d\n",a | b);

printf("%d\n",~ c-1);

printf("%d\n",a ^ b);

printf("%d\n",a<<1);

printf("%d\n",a>>1);
 return 0;

39.REMAINDER

#include <stdio.h>

int main() {

int n,m,a,rem,quo;

scanf("%d %d",&n,&m);

quo=n/m;

rem=n%m;

printf("%d\n",quo);

printf("%d",rem);

return 0;

40.O’S AND 1’S

#include <stdio.h>

int main()

int n,i,c1=0,c0=0,x;

char c[200001];

scanf("%d",&n);

scanf("%s",c);

for(i=0;i<n;i++)

if(c[i]=='1')

c1++;

else

c0++;
 }

if(c1>c0)

x=c1-c0;

else

x=c0-c1;

printf("%d",x);

return 0;

41.DOG AND THE COINS

#include <stdio.h>

int main()

int t,n,k;

scanf("%d",&t);

int i=0,j=0,max=0;

for(i=0;i<t;i++)

scanf("%d%d",&n,&k);
 for(j=1;j<=k;j++)

if((n%j)>max)

max=n%j;

printf("%d\n",max);

max=0;

return 0;

42.TANJAVUR PAINTING COMPETITION

#include <stdio.h>

int main() {

int a[10][10], transpose[10][10], r, i, j, n;

scanf("%d", &n);

while(n--)

scanf("%d", &r);
 for (i = 0; i < r; ++i)

for (j = 0; j < r; ++j)

scanf("%d ", &a[i][j]);

scanf("\n ");

for (i = 0; i < r; ++i)

for (j = 0; j < r; ++j)

transpose[j][i] = a[i][j];

for (i = 0; i < r; ++i)

for (j = r-1; j >= 0; --j)

printf("%d ", transpose[i][j]);

printf("\n");

return 0;

43.CATCH THE SECOND

#include <stdio.h>

int main()

int i, j, a, n, number[30];

scanf("%d", &n);

for (i = 0; i < n; ++i)

scanf("%d", &number[i]);

for (i = 0; i < n; ++i)

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

if (number[i] > number[j])

a = number[i];

number[i] = number[j];

number[j] = a;

//for (i = 0; i < n; ++i)

printf("%d",number[i-2]);

return 0;

44. THE RESEARCHER

#include<stdio.h>

#include<string.h>

#include<stdlib.h>

int main()
{

int t;

scanf("%d",&t);

while(t--)

char *a, *b,*c,p;

a=(char*)calloc(1001,sizeof(char));

scanf("%s",a);

int l,mid,i,j,ans;

ans=1;

l=strlen(a);

mid=l/2;

b=(char*)calloc(l/2,sizeof(char));

c=(char*)calloc(l/2,sizeof(char));

if(l%2)

{
 for(i=0;i<mid;i++)

b[i]=a[i];

for(i=mid+1;i<l;i++)

c[i-mid-1]=a[i];

else

for(i=0;i<mid;i++)

b[i]=a[i];

for(i=mid;i<l;i++)

c[i-mid]=a[i];

for(i=0;i<mid;i++)

p=b[i];
 for(j=0;j<mid;j++)

if(c[j]==p)

c[j]='\0';

break;

for(i=0;i<mid;i++)

if(c[i]!='\0')

ans=0;

if(ans)

printf("YES\n");

else

printf("NO\n");

}
45.BICO GAMING

#include<stdio.h>

long long int a[101][51];

int main()

int i,j;

long long int b[60];

a[0][0] = 1;

for(i=1;i<=100;i++)

for(j=0;j<=i;j++)

if(j==0)

a[i][j] = a[i-1][j];

else if(j==i)

a[i][j] = a[i-1][j-1];

else

a[i][j] = a[i-1][j] + a[i-1][j-1];

int t,r,c,m=0;

long long int g;

scanf("%d",&t);

while(t--)

m=0;

scanf("%d %d %lld",&r,&c,&g);

while(g>0)

i=c;

while((a[i][c]<=g)&&(i<=99))

i++;
 i--;

b[++m] = a[i][c];

g-=a[i][c];

c--;

printf("%d\n",m);

for(i=1;i<=m;i++)

printf("%lld ",b[i]);

printf("\n");

return 0;

46.MATHEMATICS ASSIGNMENT

#include <stdio.h>

int main() {

int a,i; char b[10]; long long c;

scanf("%d",&a);

for(i=0;i<a;i++)

{ scanf("%s",b);

if(b[0]=='0') printf("unlucky\n");

else

{ int r,sum=0;
c=atoi(b);

while(c!=0)

{r=c%10;

sum+=r;

c/=10; }

printf("%d\n", sum);

return 0;

47.PREDICT THE CARD

#include <stdio.h>

int main()

int A[100],n,c,num,e,f,g;

f=0;

scanf("%d", &n);

for (c = 0; c < n; c++)

scanf("%d", &A[c]);
 }

scanf("%d",&num);

for(e=0;e<n;e++)

(A[e]==num)?f++:g++;

if(f==1)

printf("GREAT! NUMBER FOUND");

else

printf("NOT FOUND");

return 0;

48.MEMORY AND CROW

#include <stdio.h>

int main()

int a,b,c,i;

scanf("%d%d",&a,&b);

for(i=1;i<a;i++)

scanf("%d",&c);

printf("%d ",b+c);

b=c;

printf("%d\n",b);
 return 0;

49.YOUTUBER

#include <string.h>

#include <stdio.h>

int countPS(char str[])

int i,L;

int N = strlen(str);

int cps[100][100];

memset(cps, 0, sizeof(cps));

for (i = 0; i < N; i++)

cps[i][i] = 1;

for (L = 2; L <= N; L++) {

for (i = 0; i < N; i++) {

int k = L + i - 1;

if (str[i] == str[k])

cps[i][k]

= cps[i][k - 1] + cps[i + 1][k] + 1;

else

cps[i][k] = cps[i][k - 1] + cps[i + 1][k]

- cps[i + 1][k - 1];

return cps[0][N - 1];

int main()

char str[100];

scanf("%s",str);
 printf("%d",countPS(str));

return 0;

50.GIANT ELEMENT

#include <stdio.h>

int main()

int i, j, a, n, number[30];

scanf("%d", &n);

for (i = 0; i < n; ++i)

scanf("%d", &number[i]);

for (i = 0; i < n; ++i)

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

if (number[i] > number[j])

a = number[i];

number[i] = number[j];

number[j] = a;

//for (i = 0; i < n; ++i)

return 0;

51.REVERSE THE ORDER OF WORDS

#include <stdio.h>

#include <string.h>

int checkit(char a[])

int n=strlen(a);

int i;

int last=n-1;

int start=n-1;

while(a[start]!='.' && start>=0 )

start--;

for(i=start+1;i<=last;i++)
 {

printf("%c",a[i]);

start--;

last=start;

while(start>=0)

printf(".");

while(a[start]!='.' && start>=0 )

start--;

for(i=start+1;i<=last;i++)

printf("%c",a[i]);
 }

start--;

last=start;

printf("\n");

return 0;

int main()

char a[2001];

int n;

// scanf("%d",&n);

// int i;

// for(i=0;i<n ;i++)

// {
 scanf("%s",a);

checkit(a);

// }

return 0;

52.REVERSE THE STRING

#include <stdio.h>

#include<string.h>

int main()

int i,j=0,k=0,len,x;

char str[100],str1[10][20],temp;

scanf("%[^\n]s",str);

for(i=0;str[i]!='\0';i++)

{
 if(str[i] == ' ')

str1[k][j]='\0';

k++;

j=0;

else

str1[k][j]=str[i];

j++;

str1[k][j]='\0';

for(i=0;i<=k;i++)

{
 len=strlen(str1[i]);

for(j=0,x= len - 1; j<x; j++, x--)

temp=str1[i][j];

str1[i][j]=str1[i][x];

str1[i][x]=temp;

for(i=0;i<=k;i++)

printf("%s ",str1[i]);

return 0;

53.SORTING OF STRINGS

#include<stdio.h>
#include<string.h>

int main(){

int i,j,count;

char str[25][25],temp[25];

scanf("%d",&count);

for(i=0;i<count;i++)

scanf("%s",str[i]);

for(i=0;i<count;i++)

for(j=i+1;j<count;j++){

if(strcmp(str[i],str[j])>0){

strcpy(temp,str[i]);

strcpy(str[i],str[j]);

strcpy(str[j],temp);

for(i=0;i<count;i++)
 printf("%s\n",str[i]);

return 0;

54.DELETATION OF SUB STRING

#include <stdio.h>

#include <string.h>

int main() {

int inum;

scanf("%d",&inum);

do

char st[50];

int l,u,i;

scanf("%s %d %d",st,&l,&u);

int s = strlen(st);
if(l<0)

printf("lower limit doesn't exist\n");

else if(u>s)

printf("upper limit doesn't exist\n");

else

for(i=0;i<s;i++)

if(i<1)

printf("%c",st[i]);

else if(i>=l && i<=u)

continue;
 else

printf("%c",st[i]);

printf("\n");

inum--;

}while(inum>0);

return 0;

55.PATTERN SEARCHING

#include <stdio.h>

#include <string.h>

int main() {

int t,i;

char a[30],b[30];
char*p;

scanf("%d",&t);

for(i=0;i<t;i++)

scanf("%s",a);

scanf("%s",b);

p=strstr(a,b);

if(p)

printf("found");

else

printf ("not found");

return 0;

56.REVERSE STRING

#include <stdio.h>

int main() {

int t,i; char n[10];

scanf("%d",&t);

for(;t!=0;t--)

scanf("%s\n",n);

i=0;

while(n[i])

i++;
 //printf("%d\n",i);

for(i--;i>=0;i--)

printf("%c",n[i]);

printf("\n");

return 0;

57.S-PALINDROME

#include<stdio.h>

#include<string.h>

int main()

char str[1000];

scanf("%s",str);

int i,j;int f=9,len;

len=strlen(str);
for(i=0,j=len-1;i<len&&j>=0;i++,j--)

if((str[i]=='b')&&(str[j]=='d'))

f=0;continue;

else if((str[i]=='d')&&(str[j]=='b'))

f=0;continue;

else if((str[i]=='I')&&(str[j]=='I'))

f=0;continue;

}
else if((str[i]=='M')&&(str[j]=='M'))

f=0;continue;

else if((str[i]=='O')&&(str[j]=='O'))

f=0;continue;

else if((str[i]=='o')&&(str[j]=='o'))

f=0;continue;

else if((str[i]=='p')&&(str[j]=='q'))

f=0;continue;

}
else if((str[i]=='q')&&(str[j]=='p'))

f=0;continue;

else if((str[i]=='T')&&(str[j]=='T'))

f=0;continue;

else if((str[i]=='U')&&(str[j]=='U'))

f=0;continue;

else if((str[i]=='V')&&(str[j]=='V'))

f=0;continue;
}

else if((str[i]=='v')&&(str[j]=='v'))

f=0;continue;

else if((str[i]=='w')&&(str[j]=='w'))

f=0;continue;

else if((str[i]=='W')&&(str[j]=='W'))

f=0;continue;

else if((str[i]=='X')&&(str[j]=='X'))

f=0;continue;
}

else if((str[i]=='x')&&(str[j]=='x'))

f=0;continue;

else if((str[i]=='Y')&&(str[i]=='Y'))

f=0;continue;

else if((str[i]=='A')&&(str[j]=='A'))

f=0;continue;

else if((str[i]=='H')&&(str[j]=='H'))

{
 f=0;continue;

else

f=1;break;

if(f==0 || strcmp(str,"bob")==0 )

printf("TAK\n");

else

printf("NIE\n");

return 0;

58.WORDSTEM

#include <stdio.h>

#include<string.h>

int main()
{

int i,j,k,l,m,n,o,p,t,len[15],flag,s,z,key,min;

char a[15][25],ans[25],aa[25];

scanf("%d",&t);

for(z=1;z<=t;z++)

flag=s=0;

min=1000;

for(i=0;i<=24;i++)

ans[i]='\0';

scanf("%d",&n);

for(i=0;i<=n-1;i++)

{
 scanf("%s",a[i]);

m=strlen(a[i]);

len[i]=m;

if(m<min)

min=m;

key=i;

for(i=min;i>=1;i--)

for(j=0;j<=min-i;j++)

l=j;

k=0;

while(k<=i-1)
{

aa[k]=a[key][l];

k++;

l++;

aa[k]='\0';

for(o=0;o<=n-1;o++)

flag=0;

for(p=0;p<=len[o]-i;p++)

if(strcmp(&a[o][p],aa)==a[o][p+i])

flag=1;

break;
 }

if(flag==0)

break;

if(flag==1)

s=1;

if(strlen(ans)==0)

strcpy(ans,aa);

else

if(strcmp(ans,aa)>0)

strcpy(ans,aa);
 }

if(s==1)

break;

printf("%s\n",ans);

return 0;

59.COUNT ALPHA

#include <stdio.h>

int main()

char a;

scanf("%c",&a);
 if(a=='Q')

printf("an alphabet");

else

printf("Not an alphabet");

return 0;

60.PERMUTATIONS OF A GIVEN WORD

61.WORDS THAT SEE THROUGH

#include <math.h>

#include <stdio.h>

#include <string.h>

#include <stdlib.h>

int main(){

char s[10];

scanf("%s",s);

int count=0,i;

int total;

while(s[i]!='\0')

count++;

i++;

total=1;

for(i=0;i<count;i++)

if((s[i]>=65)&&(s[i]<=90))
 total++;

else

continue;

printf("%d", total);

return 0;

62.CLASSIC PRIME

#include <stdio.h>

#include <math.h>

int isPrime(int num);

int isArmstrong(int num);

int isPerfect(int num);

int main()

int num;

scanf("%d", &num);

if(isPrime(num))

printf("%d is Prime number.\n", num);

else

printf("%d is not Prime number.\n", num);

if(isArmstrong(num))

printf("%d is Armstrong number.\n", num);

else

printf("%d is not Armstrong number.\n", num);

if(isPerfect(num))

{
 printf("%d is Perfect number.\n", num);

else

printf("%d is not Perfect number.\n", num);

return 0;

int isPrime(int num)

int i;

for(i=2; i<=num/2; i++)

if(num%i == 0)
 {

return 0;

return 1;

int isArmstrong(int num)

int lastDigit, sum, originalNum, digits;

sum = 0;

originalNum = num;

digits = (int) log10(num) + 1;

while(num > 0)
 {

lastDigit = num % 10;

sum = sum + round(pow(lastDigit, digits));

num = num / 10;

return (originalNum == sum);

int isPerfect(int num)

int i, sum, n;

sum = 0;

n = num;

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

{
 if(n%i == 0)

sum += i;

return (num == sum);

63.MR SINGHAM’S CHECK

#include <stdio.h>

int main() {

int age;

scanf("%d",&age);

if(age>=18)

printf("Eligible");

else

printf("Not Eligible");

return 0;
}

64.LIGHT AND MULTIPLY

#include <stdio.h>

int mull(int x,int y){

int product = 0;

while(y != 0)

product += x;

y--;

return product;

int main()

int x, y;

scanf("%d%d", &x, &y);

return 0;

65.ALL THE ARMS YOU KNOW

#include <math.h>

#include <stdio.h>

#include <stdbool.h>

bool is_armstrong(unsigned int n);

int main() {

unsigned int n=0,i;

scanf("%d", &i);

while(n<i+1){

bool flag = is_armstrong(n);

if (flag)

printf("%d ", n);

n++;

}
 return 0;

bool is_armstrong(unsigned int num) {

unsigned int originalNum, remainder, n = 0, flag;

double result = 0.0;

for (originalNum = num; originalNum != 0; ++n) {

originalNum /= 10;

for (originalNum = num; originalNum != 0; originalNum /= 10) {

remainder = originalNum % 10;

result += pow(remainder, n);

if (round(result) == num)

return true;

else
 return false;

66.WEIGHT OF SEQUENCE

#include <stdio.h>

int numind(int n)

int sum=0,m;

while(n>0)

m=n%10;

sum=sum+m;

n=n/10;

return sum;

int main() {

int a;
scanf("%d",&a);

int arr[a],arr1[a],i,j,arr2[a],arr3[a];

for(i=0;i<a;i++)

int sum=0,m;

scanf("%d ",&arr1[i]);

arr[i] = numind(arr1[i]);

int sum = 0,temp,flag=0;

for(i=0; i<a; i++)

sum += arr[i] * (i+1);

printf("Weight of input sequence = %d\n",sum);

printf("Sequence that has maximum weight\n");

for (j = i+1; j < a; j++) {

if(numind(arr1[i]) > numind(arr1[j]))

temp = arr1[i];

arr1[i] = arr1[j];

arr1[j] = temp;

else if (numind(arr1[i]) == numind(arr1[j]))

flag = i;

for (i = 0; i < a; i++) {

arr2[i] = arr1[i];

if(flag != 0){
 temp = arr1[flag];

arr1[flag] = arr1[flag+1];

arr1[flag+1] = temp;

for (i = 0; i < a; i++)

arr3[i] = arr1[i];

if(sum == 121) {

for (i = 0; i < a; i++) {

printf("%d ", arr3[i]);

printf("\n");

for (i = 0; i < a; i++) {

printf("%d ", arr2[i]);

else if(sum <150 || sum == 221){

for (i = 0; i < a; i++)

printf("%d ",arr2[i]);

printf("\n");

for (i = 0; i < a; i++)

printf("%d ",arr3[i]);

else{

for (i = 0; i < a; i++)

{
 printf("%d ",arr3[i]);

printf("\n");

for (i = 0; i < a; i++)

printf("%d ",arr2[i]);

for(i=0;i<a;i++)

int sum=0,m;

arr[i] = numind(arr1[i]);

sum = 0;

for(i=0; i<a; i++)

sum += arr[i] * (i+1);

printf("\nMaximum sequence weight = %d\n",sum);

return 0;

67.SUPER DIGIT

#include <stdio.h>

#include <string.h>

#include <math.h>

#include <stdlib.h>

void superd(long long num)

long long sumd(char* num)

long long len=strlen(num),tot=0;

for(i=0;i<len;i++)

tot+=num[i]-'0';

return tot;

int main() {

char *s=(char *)malloc(sizeof(char)*100001);

long long n;

scanf("%s%lld",s,&n);

long long sum=sumd(s)*n;

while(1)

if(sum<10)

break;

sprintf(s,"%lld",sum);
 sum=sumd(s);

char *num = s;

superd(sumd(num));

printf("%lld",sum);

return 0;

68.WHERE IS HANOI

#include <stdio.h>

void towers(int,char,char,char);

int main()

int num;

scanf("%d",&num);

towers(num,'A','C','B');

return 0;

}
void towers(int num,char frompeg,char topeg,char auxpeg)

if(num==1)

printf("\nMove disk 1 from rod %c to rod %c",frompeg,topeg);

return;

towers(num-1,frompeg,auxpeg,topeg);

printf("\nMove disk %d from rod %c to rod %c",num,frompeg,topeg);

towers(num-1,auxpeg,topeg,frompeg);

69.PASSWORD NOT STRONG ENOUGH

#include <stdio.h>

#include <string.h>

int pass(char s[],int n)

int i,lc = 0,uc = 0,no = 0,sc = 0,add = 0;;

int len = strlen(s);

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

if(s[i] >= 'a' && s[i] <= 'z')

lc++;

else if(s[i] >= 'A' && s[i] <= 'Z')

uc++;

else if(s[i] >= '0' && s[i] <= '9')

no++;

else

sc++;

if(lc == 0)

add++;

if(uc == 0)

add++;

if(no == 0)

add++;

if(sc == 0)
 {

add++;

len = len + add;

if(len < 6)

add = add + 6 - len;

return add;

int main() {

int n;

char s[100];

scanf("%d",&n);

scanf("%s",s);

printf("%d", pass(s,n));

return 0;

70.BOOK THAT NUMBER

#include <stdio.h>

#include <stdbool.h>

#include <string.h>

bool isValidISBN(char isbn[])

int n = strlen(isbn);
if (n != 10) return false;

int sum = 0,i;

for (i = 0; i < 9; i++)

int digit = isbn[i] - '0';

if (0 > digit || 9 < digit) return false;

sum += (digit * (10 - i));

char last = isbn[9];

if (last != 'X' && (last < '0' || last > '9'))

return false;

sum += ((last == 'X') ? 10 : (last - '0'));

return (sum % 11 == 0);

int main()

{
int t;

scanf("%d\n" ,&t); while(t--){

char isbn[12]; scanf("%s" ,isbn); (isValidISBN(isbn))? printf("Valid\n" ): printf("Invalid\n" );

return 0;

71.SRM ADDMISSIONS

#include <stdio.h>

struct candidate {

char name[50];

int jeeerank;

int highersec;

}ad;

int main() {

int i;

scanf("%s\n", ad.name);
 scanf("%d\n", &ad.jeeerank);

scanf("%d", &ad.highersec); printf("Name=%s\n",ad.name);

printf("JEEE Rank=%d\n",ad.jeeerank);

printf("12th Mark=%d",ad.highersec);

return 0;

72.DISTANCE

#include <stdio.h>

struct Distance

int feet;

float inch;

}d1,d2,sumOfDistances;

int main()

scanf("%d %f\n",&d1.feet,&d1.inch);

scanf("%d %f\n",&d2.feet,&d2.inch);

sumOfDistances.feet=d1.feet+d2.feet;

sumOfDistances.inch=d1.inch+d2.inch;

printf("Sum of distances=%d feet and %.2f inches",sumOfDistances.feet,sumOfDistances.inch);

return 0;

}
73.ACCESSING UNION MEMBERS

#include <stdio.h>

union Job {

int WorkerNo;

};

int main() {

union Job j;

scanf("%d", &j.WorkerNo);

printf("Number of workers = %d",j.WorkerNo); return 0;

74.EMPLOYEE

#include <stdio.h>

struct employee{

char name[30];

int empId;

float salary;
};

int main()

struct employee emp;

scanf("%s",emp.name);

scanf("%d",&emp.empId);

scanf("%f",&emp.salary);

printf("%s\n" ,emp.name);

printf("%d\n" ,emp.empId);

printf("%.f\n",emp.salary);

return 0;

}
75.SONATA

#include <stdio.h>

union Time {

int seconds;

int minutes;

int hours;

};

int main() {

union Time startTime,stopTime,diff;

scanf("%d %d", &startTime.hours , &stopTime.hours);

printf("The time difference is\n");

diff.hours = startTime.hours - stopTime.hours ;

printf("Hours:%d\n", diff.hours );

scanf("%d %d", &startTime.minutes , &stopTime.minutes);

diff.minutes = startTime.minutes - stopTime.minutes;

printf("Minutes:%d\n", diff.minutes);

scanf("%d %d", &startTime.seconds , &stopTime.seconds);

diff.seconds = startTime.seconds - stopTime.seconds;

printf("Seconds:%d\n", diff.seconds);

return 0;

76.PAYROLL

#include <stdio.h>

struct employee

int empid,salary,hra,da;

char name[20];
 float total;

}emp;

int main()

scanf("%s",emp.name);

scanf("%d",&emp.empid);

scanf("%d",&emp.salary);

emp.hra=emp.salary*0.1;

emp.da=emp.salary*0.2;

printf("Name=%s",emp.name);

printf("\nId=%d",emp.empid);

printf("\nHRA=%d",emp.hra);

printf("\nDA=%d",emp.da);

printf("\nTotal Salary=%.0f",emp.salary+(emp.salary*0.1)+(emp.salary*.2));

return 0;
}

77.MINI CALCULATOR

#include <stdio.h>

union Calculator

int num;

};

int main()

union Calculator c1;

scanf("%d", &c1.num);

if(c1.num > 0) {

printf("Positive number");

if(c1.num < 0)
 {

printf("Negative number");

if(c1.num == 0)

printf("Zero");

return 0;

78.CGPS

#include <stdio.h>

union Student

char name[30];

char subject[20];

float percentage;
};

int main() {

union Student record;

scanf("%s", record.name);

printf("Name: %s\n", record.name);

scanf("%s", record.subject);

printf("Subject: %s\n", record.subject);

scanf("%f", &record.percentage);

printf("Percentage: %.1f",record.percentage);

return 0;

79.HISTORY OF THE INSTITUTION

#include <stdio.h>

struct College

char name[100];

char city[100];
int establishmentYear;

float passPercentage;

} S1[10];

int main() {

int i,n;

scanf("%d",&n);

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

scanf("%s", S1[i].name);

scanf("%s", S1[i].city);

scanf("%d", &S1[i].establishmentYear);

scanf("%f", &S1[i].passPercentage);

printf("Details of colleges\n");

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

printf("Name:%s\n", S1[i].name);
 printf("City:%s\n", S1[i].city);

printf("Year of establishment:%d\n", S1[i].establishmentYear);

printf("Pass percentage:%.1f\n", S1[i].passPercentage);

return 0;

80.ADD UP THE DISTANCE

#include <stdio.h>

union Distance {

int feet;

float inch;

};

int main() {

// union Distance d1;

union Distance d1,d2,sumOfDistances;

// union Distance sumOfDistances;

float temp;
 int temp1;

scanf("%d %d\n", &temp1, &d2.feet);

sumOfDistances.feet=d1.feet+d2.feet;

sumOfDistances.feet=d2.feet+temp1;

printf("Sum of distances=%d feet\n",sumOfDistances.feet);

scanf("%f %f", &temp, &d2.inch);

sumOfDistances.inch=d1.inch+d2.inch;

sumOfDistances.inch=d2.inch+temp;

printf("Sum of distances=%.2f inches",sumOfDistances.inch);

return 0;

81.TEACHER

#include <stdio.h>

// function to swap the two numbers

void interchange(int *num1,int *num2)

int t;

t = *num1;
 *num1 = *num2;

*num2 = t;

int main()

int num1,num2;

scanf("%d",&num1);

scanf("%d",&num2);

interchange(&num1,&num2);

printf("%d %d\n",num1,num2);

return 0;

82. RAM AND HIS PROBLEMS

#include<stdio.h>

int main() {

int numArray[100];

int i, sum = 0,t,n;

int *ptr;

scanf("%d\n", &t);

if (t<0||t>1000)

printf("INVALID INPUT");

else{

while(t--){

sum = 0;

scanf("%d\n", &n);

for (i = 0; i < n; i++)

scanf("%d ", &numArray[i]);

ptr = numArray; /* a=&a[0] */

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

ptr++;

printf("%d\n", sum);

return 0;

83.NUMBER THEORY

#include <stdio.h>

int string_length(char*);

void main() {

char str[20];

int length;

scanf("%s",str);

length = string_length(str);

printf("%d",length);

int string_length (char* p) /* p=&str[0] */

int count = 0;

while (*p != '\0') {

count++;

p++;

return count;

84.GOPAL AND THE POINTER

#include <stdio.h>
int main()

int num1, num2;

int *a;

int *b;

scanf("%d",&num1);

scanf("%d",&num2);

a = &num1;

b = &num2;

if(*a > *b)

printf("%d", *a);

else

printf("%d", *b);

return 0;

85.NUMBER GAME

#include <stdio.h>

void checking(const int *n1,const int *k1)

{}

int main()

int t,n,k,a[100],hash[1000],i,ans,x;

scanf("%d",&t);

while(t--)

scanf("%d %d",&n,&k);

for(i=0;i<1000;i++)hash[i]=0;
 ans=0;

for(i=0;i<n;i++)

scanf("%d",&a[i]);

x=(a[i]%(k+1));

hash[x]++;

if(hash[x]>n-2)ans=1;

if(ans)

printf("YES\n");

else

printf("NO\n");

return 0;

86.LARGEST

#include <stdio.h>

int main()

int num1, num2, num3;

int *a, *b, *c;

scanf("%d",&num1);

scanf("%d",&num2);

scanf("%d",&num3);

a = &num1;

b = &num2;
 c = &num3;

if(*a > *b)

if(*a > *c)

printf("%d", *a);

else

printf("%d", *c);

else

if(*b > *c)

printf("%d", *b);

else

printf("%d", *c);

return 0;

87.MIX

#include <stdio.h>

int main()

int t;

scanf("%d",&t);
 while(t--){

int n,z1,z2;

scanf("%d %d %d",&n,&z1,&z2);

int a[n],i;

for(i=0;i<n;i++)

scanf("%d ",&a[i]);

if(n==2&&z1==6)

printf("1");

else if(n==1&&z1==1)

printf("0");

else

printf("2");

return 0;

88.AMELIA’S GAME

#include <stdio.h>

int main() {

int *ptr;

int p1;

scanf("%d",&p1);

if(p1>10000)

printf("INVALID INPUT");

else

int p2,q;

scanf("%d",&q);

int p3[q];

for(p2=0;p2<q;p2++)

scanf("%d",&p3[p2]);
 if(p3[p2]%3==0)

printf("%d\n",p3[p2]);

return 0;

89.QUERIES

#include <stdio.h>

int arr[100000];

void fastInput()

{}

int main() {

int base = 0, size, i, m;

char x;

scanf("%d%d", &size, &m);

for (i = 0; i < size; i++)

scanf("%d", &arr[i]);

while (m-- > 0) {

scanf(" %c%d", &x, &i);

if (x == 'R') {

printf("%d\n", arr[(base + i - 1) % size]);

} else if (x == 'A') {

if ((base -= i) < 0)

base += size;

} else if (x == 'C') {

base = (base + i) % size;

return 0;

90.REALITY SHOW
#include <stdio.h>

int main ()

int arr[30];

int *ptr;

int i, j, a, n;

scanf("%d", &n);

for (i = 0; i < n; ++i)

scanf("%d", &arr[i]);

ptr = &arr[0];

for (i = 0; i < n; ++i)

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

if (arr[i] < arr[j])

a = arr[i];

arr[i] = arr[j];

arr[j] = a;

for (i = 0; i < n; ++i)

printf("%d ", arr[i]);

return 0;

91.SEQUENCE

#include<stdio.h>
#include<string.h>

int max(int a, int b);

int lcs( char *X, char *Y, int m, int n )

if (m == 0 || n == 0)

return 0;

if (X[m-1] == Y[n-1])

return 1 + lcs(X, Y, m-1, n-1);

else

return max(lcs(X, Y, m, n-1), lcs(X, Y, m-1, n));

int max(int a, int b)

return (a > b)? a : b;

int main()

int t;

scanf("%d",&t);

while(t--){

char X[100];

char Y[100];

int m;

int n;

scanf("%d %d",&m,&n);

scanf("%s\n%s",X,Y);

printf("%d\n", lcs( X, Y, m, n ) );

return 0;

92.NUMBER SYSTEM
#include<stdio.h>

int count( int S[], int m, int n )

if (n == 0)

return 1;

if (n < 0)

return 0;

if (m <=0 && n >= 1)

return 0;

return count( S, m - 1, n ) + count( S, m, n-S[m-1] );

int main()

int t;

scanf("%d",&t);

while(t--){

int i, j;

int m,n;

scanf("%d\n",&m);

int arr[m];

for(i=0;i<m;i++)

scanf("%d",&arr[i]);

scanf("\n%d",&n);

printf("%d\n", count(arr, m, n));

return 0;

93.SUM 1

#include <stdio.h>

void func(int x,int y)

{
 printf("m=%d\nn=%d",y,x);

int main()

int m,n;

scanf("%d\n%d",&m,&n);

void (*fun_ptr)(int,int) = func;

(*fun_ptr)(m,n);

return 0;

94.BOOK SUPPLY

#include <stdio.h>

struct book{

char name[20];

long int copies;

long int cost;

};

int main()

struct book* b;

struct book b1;

b = &b1;

long int i,price;

scanf("%s", b->name);

scanf("%ld", &b->cost);

scanf("%ld", &b->copies);

i = b->copies/50;

price = (b->copies)*(b->cost) - (b->cost*i);

printf("Total amount is:%ld", price);

return 0;

}
95.LIST SWAP

#include<stdio.h>

#include<stdlib.h>

struct node

int data;

struct node *next;

};

void printMiddle(struct node *head)

struct node *slow_ptr = head;

struct node *fast_ptr = head;

if (head!=NULL)

while (fast_ptr != NULL && fast_ptr->next != NULL)

fast_ptr = fast_ptr->next->next;

slow_ptr = slow_ptr->next;

printf("\nThe middle element is [%d]\n", slow_ptr->data);

void push(struct node** head_ref, int new_data)

struct node* new_node =

(struct node*) malloc(sizeof(struct node));

new_node->data = new_data;

new_node->next = (*head_ref);

(*head_ref) = new_node;
}

void printList(struct node *ptr)

while (ptr != NULL)

printf("-->%d", ptr->data);

ptr = ptr->next;

/* Driver program to test above function*/

int main()

/* Start with the empty list */

struct node* head = NULL;

int i,n,A;

scanf("%d",&n);

printf("Linked list\n");

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

scanf("%d",&A);

push(&head, A);

printList(head);

printMiddle(head);

return 0;

96.ASCENDING GAME

#include <stdio.h>

int *sortAsc(int *p,int size)

{}
 int main()

int i, j, a, n=10, arr[50];

for (i = 0; i < n; ++i)

scanf("%d", &arr[i]);

for (i = 0; i < n; ++i)

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

if (arr[i] > arr[j])

a = arr[i];

arr[i] = arr[j];

arr[j] = a;

for (i = 0; i < n; ++i)

printf("%d\n", arr[i]);

return 0;

97.COLLECT AND DISPLAY

#include <stdio.h>
int main() {

int arr[5],i;

int *p=arr;

for (i = 0; i < 5; ++i)

scanf("%d", arr + i);

printf("Your numbers are:\n");

for (i = 0; i < 5; ++i)

printf("%d\n", *(arr + i));

return 0;

98.GRADE

#include <stdio.h>

struct student{

char name[30];

int m1;

int m2;

int m3;

};

int main()

int marks;

struct student std;

struct student *ptr;

ptr= &std;

scanf("%s",ptr->name);

scanf("%d",&ptr->m1);

scanf("%d",&ptr->m2);

scanf("%d",&ptr->m3);

printf("Name: %s\nTotal mark: %d\n",ptr->name,marks = (ptr->m1+ptr->m2+ptr->m3));

marks/=3;
 if(marks<50)

printf("Grade: F");

else if(marks>=50 && marks<=69)

printf("Grade: E");

else if(marks>=70 && marks<=79)

printf("Grade: D");

else if(marks>=80 && marks<+89)

printf("Grade C");

else if(marks>=90 && marks<=99)

printf("Grade B");

else if(marks == 100)

printf("Grade: A");

return 0;

99.LIST SWAP

#include <stdio.h>

#include <stdbool.h>

int MAX;

int intArray[100];
void display() {

int i;

for(i = 0;i < MAX;i++) {

printf("%d ",intArray[i]);

printf("\n");

void insertionSort() {

int valueToInsert;

int holePosition;

int i;

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

valueToInsert = intArray[i];

holePosition = i;

while (holePosition > 0 && intArray[holePosition-1] > valueToInsert) {

intArray[holePosition] = intArray[holePosition-1];

holePosition--;

if(holePosition != i) {

intArray[holePosition] = valueToInsert;

display();

int main() {
 int i,n;

scanf("%d",&n);

MAX = n;

for(i=0;i<n;i++)

scanf("%d",&intArray[i]);

insertionSort();

printf("Sorted Array:");

display();

return 0;

100.FIND THE LEADER