PPSprogr

amssof tcopy
1.
CUBE
#i
ncl
ude<stdi
o.h>

i
ntmai
n(){

i
ntnumber,
cube;

scanf
("%d"
,&number
);

cube=number
*number
*number
;

pr
int
f("CUBEi
s:%d"
,cube)
;

r
etur
n0;

2.
NAMEANDBI
RTH

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

charf
ir
stname[
20]
,
last
name[
20]
;

i
ntbi
r_y
r;

scanf
("%s"
,f
ir
stname)
;

scanf
("%s"
,last
name)
;

scanf
("%d"
,&bi
r_y
r);

pr
int
f("
%s%s%d\
n",
fi
rst
name,
l
ast
name,
bir
_yr
);

r
etur
n0;

3.
LARGESTNUMBER

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
b,
c,
max;

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

i
f(
a>b)

max=a;

el
sei
f(b>a)
 {

max=b;

i
f(
max>c)

pr
int
f("
%d"
,max)
;

el
se

pr
int
f("
%d"
,c)
;

r
etur
n0;

4.
HOTSUMMER

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta;

scanf
("%d"
,&a)
;

i
f(
a%2==0)

pr
int
f("
YES"
);

el
se

pr
int
f("
NO"
);
}

r
etur
n0;

5.
THEATRESQUARE

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntx
,y,
z,
a,
b;

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

i
f(
x%z==0)

a=(
x/z)
;

el
sei
f(
x%z!
=0)

a=(
x/z)
+1;

i
f(
y%z==0)

b=(
y/z)
;

el
sei
f(
y%z!
=0)

b=(
y/z)
+1;

pr
int
f("
%d"
,a*
b);

r
etur
n0;

6.
POW

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<mat
h.h>
i
ntmai
n(){

i
ntx,
n,r
es;

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

r
es=pow(
x,n)
;

pr
int
f("
%dt
othepowerof%di
s=%d",
x,n,
res)
;

r
etur
n0;

7.
MINUTES

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
b,
c;

scanf
("%dhr
s\n"
,&a)
;

scanf
("%dmi
ns"
,&b)
;

c=(
60*
a+b)
;

pr
int
f("
%dmi
nut
es"
,c)
;

r
etur
n0;

8.
SUM OFTHREENUMBERS

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
b,c,
res;

chart
emp;

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

r
es=a+b+c;

pr
int
f("
%d"
,res)
;

r
etur
n0;

9.
DIFFERENCE

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

{
i
ntnum1,
num2,
res;
//Decl
arat
ion

/
/inputsect
ion

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

/
/pr
ocesssect
ion

r
es=num2-
num1;

/
/Out
putsect
ion

pr
int
f("
Dif
fer
encebet
ween%dand%di
s=%d",
num1,
num2,
res)
;

r
etur
n0;

10.
RECTANGULAR

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nth,
w,p;

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

p=2*
(h+w)
;

pr
int
f("
%d"
,p)
;

r
etur
n0;

11.
STATEELECTI
ON

#i
ncl
ude<st
dio.
h>
i
ntmai
n()

i
nta;

scanf
("%d"
,&a)
;

i
f(
a>=18&&a<=60)

pr
int
f("
Eli
gibl
e")
;

el
se

pr
int
f("
NotEl
i
gibl
e")
;

r
etur
n0;

12.
IDENTI
FTTHESTRI
NG

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

charch;

scanf
("%c"
,&ch)
;

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

pr
int
f("
VOWEL"
);

el
se

pr
int
f("
CONSONANT"
);

r
etur
n0;
}

13.
RATEOFI
NTEREST

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntp;

f
loatS,
r,
t;

scanf
("%d"
,&p)
;

scanf
("%f
",
&t)
;

scanf
("%f
",
&r)
;

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

pr
int
f("
%.02f
",
S);

r
etur
n0;

14.
POWEROF2

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
i
;

scanf
("%d"
,&a)
;

i
=a&(
a-1)
;

i
f(
i==0)

pr
int
f("
WOW"
);

el
se

pr
int
f("
OOPS"
);

r
etur
n0;

}
15.
SWI
TCHI
NTEGER

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntt
emp,
x,
rev
,remai
nder
;

scanf
("%d"
,&x)
;

i
ntn[
x],
i
;

f
or(
i=0;
i
<x;
i
++)

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

f
or(
i=0;
i
<x;
i
++)

t
emp=n[
i]
;

r
ev=0;

whi
l
e(t
emp!
=0)

r
emai
nder
=temp%10;

r
ev=r
ev*10+r
emai
nder
;

t
emp/
=10;

pr
int
f("
%d\
n",
rev
);

r
etur
n0;

16.
GRADI
NGSYSTEM

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

{
i
nti
,
n,a,
c;

f
loatb,
temp;

t
emp=0.
7;

scanf
("%d"
,&n)
;

f
or(
i=0;
i
<n;
i
++)

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

/
/pr
int
f("
b=%f"
,b)
;

/
/pr
int
f("
temp=%f
",
temp)
;

i
f(
a>50&&b<t
emp&&c>5600)

pr
int
f("
10\
n")
;

el
sei
f(
a>50&&b<t
emp)

pr
int
f("
9\n"
);

el
sei
f(
b<t
emp&&c>5600)

pr
int
f("
8\n"
);

el
sei
f(
a>50&&c>5600)

pr
int
f("
7\n"
);

el
sei
f(
a>50|
|
b<t
emp|
|
c>5600)

pr
int
f("
6\n"
);

el
sei
f(
a<50&&b>t
emp&&c<5600)

pr
int
f("
5")
;

r
etur
n0;

17.
HAPPYADDI
TION

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntA[
100]
,
p,i
,
n,d;

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

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

scanf
("%d"
,&d)
;

scanf
("%d"
,&p)
;

f
or(
i=n-
1;i
>=p-
1;i
--
)

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

A[
p-1]
=d;

f
or(
i=0;
i
<=n;
i
++)

pr
int
f("
%d",
A[i
])
;

r
etur
n0;

18.
AMSTRONGDI
GITS

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntn,
r,
sum=0,
temp,
i
,m;

scanf
("%d"
,&i
);

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

/
/temp=n;

f
or(
m=1;
m<=i
;
m++)

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

t
emp=n;

whi
l
e(n>0)

r
=n%10;

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

n=n/
10;

i
f(
temp==sum)

pr
int
f("
Armst
rong\
n")
;

el
se

pr
int
f("
NotAr
mst
rong\
n")
;

r
etur
n0;

19.
MIRRORPROBLEM

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntnum,
count
=0;

scanf
("%d"
,&num)
;

whi
l
e(num!
=0)

num=num/
10;

count
++;

}
pr
int
f("
%d"
,count
);

r
etur
n0;

20.
FOURSQUARE

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<mat
h.h>

i
ntmai
n()

i
ntnot
1,v
alue,
rec,
i
;

scanf
("%d"
,&not
1);

f
or(
i=1;
i
<=not
1;i
++)

scanf
("%d"
,&v
alue)
;

r
ec=sor
t(v
alue)
;

pr
int
f("
%d\
n",
rec)
;

r
etur
n0;

i
ntsor
t(i
ntt
emp)

i
ntr
es;

r
es=sqr
t(t
emp)
;

r
etur
nres;

21.
ROHI
TANDPANDYACHALLENGE

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<mat
h.h>

i
ntmai
n(){

f
loatn,
res;

scanf
("%f
",
&n)
;
r
es=(
sqr
t(3)
/4)
*(n*
n);

pr
int
f("
%.02fsq.
uni
ts"
,r
es)
;

r
etur
n0;

22.
MAHIANDRAI
NA

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nti
,
j,
k;

scanf
("%d"
,&i
);

scanf
("%d"
,&j
);

scanf
("%d"
,&k)
;

i
f(
(i
>k)&&(
k>j
))

pr
int
f("
TRUE"
);

el
se

pr
int
f("
FALSE"
);

r
etur
n0;

23.
LAKSHMI
’
STEACHER

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntn;

scanf
("%d"
,&n)
;

i
f(
n>0)

pr
int
f("
POSI
TIVE"
);
el
sei
f(
n==0)

pr
int
f("
ZERO"
);

el
sei
f(
n<0)

pr
int
f("
NEGATI
VE"
);

r
etur
n0;

24.
VIJAYANDTHEFACTORS

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

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

scanf
("%d"
,&t
);

f
or(
l=0;
l
<t;
l
++)

f
or(
i=0;
i
<100;
i
++)

q=1;

c[
i]
=0;

ar
r[
i]
=0;

scanf
("%d"
,&num)
;

f
or(
i=2;
i
<=num;
i
++)

i
f(
num%i
==0)

++p;

num=num/
i;

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

p=0;

i
f(
q!=i
)
 {

ar
r[
j]
=i;

++j
;

n=j
;

q=i
;

-
-i
;

i
=0;

j
=0;

f
or(
j=0;
j
<n;
j
++)

i
=ar
r[
j]
;

pr
int
f("
%d%d"
,ar
r[
j]
,
c[i
])
;

pr
int
f("
\n"
);

j
=0;

i
=0;

r
etur
n0;

25.
NTHTERM

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

/
/nt
s=nooft
estcases,
nod=nooft
erms

i
ntsum,
i
,nt
s,nod,
j
;

scanf
("%d"
,&nt
s);

f
or(
i=1;
i
<=nt
s;i
++)
{

scanf
("%d"
,&nod)
;

sum=1;

f
or(
j=2;
j
<=nod;
j
++)

sum=sum+j
;

pr
int
f("
%d"
,sum)
;

pr
int
f("
\n"
);

r
etur
n0;

26.
MODIANDTHECASH

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntsum,
val
ue,
i
;

scanf
("%d"
,&sum)
;

i
nta[
]={
500,
100,
50,
20,
10,
5,
2,
1};

f
or(
i=0;
i
<8;
i
++)

v
alue=sum/
a[i
];

sum =sum%a[
i]
;

pr
int
f("
%d=%d\
n",
a[i
],
val
ue)
;

r
etur
n0;
}

27.
MAXWELLANDHI
SCOUSI
N

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nti
,
j,
rows,
col
s;

scanf
("%d%d"
,&r
ows,
&col
s);

f
or(
i=1;
i
<=r
ows;
i
++)

f
or(
j=1;
j
<=col
s;
j++)

i
f(
i==1|
|
i==r
ows|
|
j==1|
|
j==col
s)

pr
int
f("
1")
;

el
se

pr
int
f("
0")
;

pr
int
f("
\n"
);

r
etur
n0;

28.
RAM ANDTHEWEEK

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

{
i
ntn;

scanf
("%d"
,&n)
;

i
f(
n==1)

pr
int
f("
Monday
");

el
sei
f(
n==2)

pr
int
f("
Tuesday
");

el
sei
f(
n==3)

pr
int
f("
Wednesday
");

el
sei
f(
n==4)

pr
int
f("
Thur
sday
");

el
sei
f(
n==5)

pr
int
f("
Fri
day
");

el
sei
f(
n==6)

pr
int
f("
Sat
urday
");

el
sei
f(
n==7)

pr
int
f("
Sunday
");

r
etur
n0;

29.
DHONITHEMANWI
THMI
DASTOUCH

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntn;

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

whi
l
e(n!
=42)

scanf
("%d"
,&n)
;

i
f(
n!=42)

pr
int
f("
%d\
n",
n);

/
/el
se

/
/ pr
int
f(""
);
}

r
etur
n0;

30.
KLRAHULANDHI
STEAMMATES

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntr
uns,
i
,r
em;

scanf
("%d"
,&r
uns)
;

i
nta[
]={
0,0,
0,
0,
0,
0,
0,
0,
0,
0};

whi
l
e(r
uns!
=0)

r
em=r
uns%10;

r
uns=r
uns/
10;

a[
rem]
++;

f
or(
i=0;
i
<10;
i
++)

pr
int
f("
%d=%d\
n",
i
,a[
i]
);

r
etur
n0;

31.
BYTE

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

f
loata;
i
ntx
;

scanf
("%f
",
&a)
;

x=si
zeof
(a)
;

pr
int
f("
%d%l
d",
x,
si
zeof
(x)
*2)
;

r
etur
n0;

32.
SUM OFSERI
ES

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nti
,
j,
x,
t,
y;

scanf
("%d"
,&t
);

f
or(
y=0;
y<t
;y++)

{
x=0;

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

f
or(
i=1;
i
<=j
;
i++)

x
=x+i
;

pr
int
f("
%d\
n",
x);

r
etur
n0;

33.
MATH

#i
ncl
ude<st
dio.
h>

#def
ineMOD1000000007

i
ntcount
;

v
oidcal
c(i
ntchef
[]
,i
ntn,
i
ntsum,
i
nti
ndex)

i
f(
index<0)

r
etur
n;
 i
f(
sum<0)

r
etur
n;

i
f(
(l
ongl
ong)
chef
[i
ndex]
*n<sum)

r
etur
n;

i
f(
n==0)

i
f(
sum==0)

count
=(count
+1)
%MOD;

r
etur
n;

cal
c(chef
,n-
1,sum-
chef
[i
ndex]
,
index)
;

cal
c(chef
,n,
sum,
i
ndex
-1)
;

i
ntmai
n()
{

i
nti
,
q,x,
k;

i
ntchef
[43]
;

chef
[0]
=1;

chef
[1]
=2;

f
or(
i=2;
i
<43;
i
++)

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

scanf
("%d"
,&q)
;

whi
l
e(q-
-)

count
=0;

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

cal
c(chef
,k,
x,
42)
;

pr
int
f("
%d\
n",
count
);

r
etur
n0;

34.
LIONCUB
#i
ncl
ude<st
dio.
h>

l
ongl
ongi
ntdat
a[41]
[2]
;

l
ongl
ongi
ntAnswer
(i
ntk,
i
ntnum)
;

i
ntmai
n()

i
ntt
,n,
m,c,
p,
i;

l
ongl
ongi
ntanswer
;

scanf
("%d"
,&t
);

whi
l
e(t
--
)

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

answer
=0;

f
or(
i=0;
i
<41;
i
++)

dat
a[i
][
0]=dat
a[i
][
1]=0;

f
or(
i=0;
i
<n;
i
++)

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

dat
a[c]
[0]
+=p;

dat
a[c]
[1]
++;

f
or(
i=1;
i
<=40;
i
++)

i
f(
dat
a[i
]>0)

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

pr
int
f("
%.9l
f\n"
,(
doubl
e)answer
/Answer
(m,
0))
;

r
etur
n0;

}
l
ongl
ongi
ntAnswer
(i
ntk,
intnum)

l
ongl
ongi
ntanswer
=0,
e[41]
[41]
,
v[41]
;

i
nti
,
j=1,
tot
=0;

f
or(
i=0;
i
<41;
i
++)

i
f(dat
a[i
][
0]>0&&i
!=num)

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

t
ot++;

f
or(
i=0;
i
<tot
+1;
i
++)

e[
i]
[0]
=1;

f
or(
i=0;
i
<tot
+1;
i
++)

f
or(
j=1;
j
<=t
ot;
j
++)

i
f(j
>i
)

e[
i]
[j
]=0;

el
se

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

f
or(
i=k;
i
<=t
ot;
i
++)

answer
+=e[
tot
][
i]
;

r
etur
nanswer
;

35.
IPL

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntn;

scanf
("%d"
,&n)
;
pr
int
f("
%d"
,n)
;

pr
int
f("%o"
,n)
;

pr
int
f("%X"
,n)
;

r
etur
n0;

36.
OPERATORS

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
b,
c,
i,
n;

scanf
("%d"
,&n)
;

f
or(
i=0;
i
<n;
i
++)

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

i
f(
a>b)

pr
int
f("
>\n"
);

el
sei
f(
a<b)

pr
int
f("
<\n"
);

el
sei
f(
a==b)

pr
int
f("
=\n"
);

r
etur
n0;

}
37.
INTEGER

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

unsi
gnedi
ntnumber
;

i
ntcount
;

count=0;

scanf
("%d"
,&number
);

whi
l
e(number!
=0)

i
f((
number&1)==1)

count
++;

number=number>>1;

pr
int
f("
%d"
,count
);

r
etur
n0;

38.
MARKZUKENBERG

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nta,
b,
c;

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

c=a-
1;

pr
int
f("
%d\
n",
a&b)
;

pr
int
f("
%d\
n",
a|b)
;

pr
int
f("
%d\
n",
~c-
1);

pr
int
f("
%d\
n",
a^b)
;

pr
int
f("
%d\
n",
a<<1)
;

pr
int
f("
%d\
n",
a>>1)
;
 r
etur
n0;

39.
REMAI
NDER

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntn,
m,a,
rem,
quo;

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

quo=n/
m;

r
em=n%m;

pr
int
f("
%d\
n",
quo)
;

pr
int
f("
%d"
,r
em)
;

r
etur
n0;

40.
O’SAND1’
S

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntn,
i
,c1=0,
c0=0,
x;

charc[
200001]
;

scanf
("%d"
,&n)
;

scanf
("%s"
,c)
;

f
or(
i=0;
i
<n;
i
++)

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

c1++;

el
se

c0++;
}

i
f(
c1>c0)

x=c1-
c0;

el
se

x
=c0-
c1;

pr
int
f("
%d"
,x)
;

r
etur
n0;

41.
DOGANDTHECOI
NS

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntt
,n,
k;

scanf
("%d"
,&t
);

i
nti
=0,
j
=0,
max=0;

f
or(
i=0;
i
<t;
i
++)

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

i
f(
(n%j
)>max
)

max=n%j
;

pr
int
f("
%d\
n",
max
);

max=0;

r
etur
n0;

42.
TANJAVURPAI
NTI
NGCOMPETI
TION

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta[
10]
[10]
,tr
anspose[
10]
[10]
,r,
i,j
,n;

scanf
("%d"
,&n)
;

whi
l
e(n-
-)

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

f
or(
j=0;
j<r
;++j
)

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

scanf
("\
n")
;

f
or(
i=0;
i<r
;++i
)

f
or(
j=0;
j<r
;++j
)

t
ranspose[
j]
[i
]=a[
i]
[j
];

f
or(
i=0;
i<r
;++i
)

f
or(
j=r
-1;
j>=0;
--j
)

pr
int
f("
%d"
,tr
anspose[
i]
[j
])
;

pr
int
f("
\n"
);

r
etur
n0;

43.
CATCHTHESECOND

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

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

scanf
("%d"
,&n)
;

f
or(
i=0;
i<n;
++i
)

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

f
or(
i=0;
i<n;
++i
)

{
 f
or(
j=i
+1;
j<n;
++j
)

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

a=number
[i
];

number
[i
]=number
[j
];

number
[j
]=a;

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

pr
int
f("
%d"
,number
[i
-2]
);

r
etur
n0;

44.THERESEARCHER

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

#i
ncl
ude<st
dli
b.h>

i
ntmai
n()
{

i
ntt
;

scanf
("%d"
,&t
);

whi
l
e(t
--
)

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

a=(
char
*)cal
l
oc(
1001,
si
zeof
(char
));

scanf
("%s"
,a)
;

i
ntl
,
mid,
i
,j
,ans;

ans=1;

l
=st
rl
en(
a);

mi
d=l
/2;

b=(
char
*)cal
l
oc(
l/
2,si
zeof
(char
));

c=(
char
*)cal
l
oc(
l/
2,si
zeof
(char
));

i
f(
l%2)

{
 f
or(
i=0;
i
<mi
d;i
++)

b[
i]
=a[
i]
;

f
or(
i=mi
d+1;
i
<l;
i
++)

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

el
se

f
or(
i=0;
i
<mi
d;i
++)

b[
i]
=a[
i]
;

f
or(
i=mi
d;i
<l
;i
++)

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

f
or(
i=0;
i
<mi
d;i
++)

p=b[
i]
;
 f
or(
j=0;
j
<mi
d;j
++)

i
f(
c[j
]==p)

c[
j]
='
\0'
;

br
eak;

f
or(
i=0;
i
<mi
d;i
++)

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

ans=0;

i
f(
ans)

pr
int
f("
YES\
n")
;

el
se

pr
int
f("
NO\
n")
;

}
45.
BICOGAMI
NG

#i
ncl
ude<st
dio.
h>

l
ongl
ongi
nta[
101]
[51]
;

i
ntmai
n()

i
nti
,
j;

l
ongl
ongi
ntb[
60]
;

a[
0][
0]=1;

f
or(
i=1;
i
<=100;
i
++)

f
or(
j=0;
j
<=i
;
j++)

i
f(
j==0)

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

el
sei
f(
j==i
)

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

el
se

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

i
ntt
,r
,c,
m=0;

l
ongl
ongi
ntg;

scanf
("%d"
,&t
);

whi
l
e(t
--
)

m=0;

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

whi
l
e(g>0)

i
=c;

whi
l
e((
a[i
][
c]<=g)
&&(
i<=99)
)

i
++;
 i
--
;

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

g-
=a[
i]
[c]
;

c-
-;

pr
int
f("
%d\
n",
m);

f
or(
i=1;
i
<=m;
i
++)

pr
int
f("
%ll
d",
b[i
])
;

pr
int
f("
\n"
);

r
etur
n0;

46.
MATHEMATI
CSASSI
GNMENT

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nta,
i
;charb[
10]
;l
ongl
ongc;

scanf
("%d"
,&a)
;

f
or(
i=0;
i
<a;
i
++)

{scanf
("%s"
,b)
;

i
f(
b[0]
=='
0'
)pr
int
f("
unl
ucky
\n"
);

el
se

{i
ntr
,sum=0;
c=at
oi(
b);

whi
l
e(c!
=0)

{
r=c%10;

sum+=r
;

c/
=10;
}

pr
int
f("
%d\
n",
sum)
;

r
etur
n0;

47.
PREDI
CTTHECARD

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntA[
100]
,
n,c,
num,
e,
f,
g;

f
=0;

scanf
("%d"
,&n)
;

f
or(
c=0;
c<n;
c++)

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

scanf
("%d"
,&num)
;

f
or(
e=0;
e<n;
e++)

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

i
f(
f==1)

pr
int
f("
GREAT!NUMBERFOUND"
);

el
se

pr
int
f("
NOTFOUND"
);

r
etur
n0;

48.
MEMORYANDCROW

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
nta,
b,
c,
i;

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

f
or(
i=1;
i
<a;
i
++)

scanf
("%d"
,&c)
;

pr
int
f("
%d"
,b+c)
;

b=c;

pr
int
f("
%d\
n",
b);
r
etur
n0;

49.
YOUTUBER

#i
ncl
ude<st
ri
ng.
h>

#i
ncl
ude<st
dio.
h>

i
ntcount
PS(
charst
r[
])

i
nti
,
L;

i
ntN=st
rl
en(
str
);

i
ntcps[
100]
[100]
;

memset
(cps,
0,si
zeof
(cps)
);

f
or(
i=0;
i<N;
i++)

cps[
i]
[i
]=1;

f
or(
L=2;
L<=N;
L++){

f
or(
i=0;
i<N;
i++){

i
ntk=L+i
-1;

i
f(st
r[
i]==st
r[
k])

cps[
i]
[k]

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

el
se

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

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

r
etur
ncps[
0][
N-1]
;

i
ntmai
n()

charst
r[
100]
;

scanf
("%s"
,st
r);
 pr
int
f("
%d"
,count
PS(
str
));

r
etur
n0;

50.
GIANTELEMENT

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

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

scanf
("%d"
,&n)
;

f
or(
i=0;
i<n;
++i
)

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

f
or(
i=0;
i<n;
++i
)

f
or(
j=i
+1;
j<n;
++j
)

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

a=number
[i
];

number
[i
]=number
[j
];

number
[j
]=a;

/
/for(
i=0;
i<n;
++i
)
 pr
int
f("
Sti
ckerwi
thv
alue%di
sthebi
ggest
",
number
[i
-1]
);

r
etur
n0;

51.
REVERSETHEORDEROFWORDS

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntchecki
t(
chara[
])

i
ntn=st
rl
en(
a);

i
nti
;

i
ntl
ast
=n-
1;

i
ntst
art
=n-
1;

whi
l
e(a[
star
t]
!='
.
'&&st
art
>=0)

st
art
--
;

f
or(
i=st
art
+1;
i
<=l
ast
;i
++)
{

pr
int
f("
%c"
,a[
i]
);

st
art
--
;

l
ast
=st
art
;

whi
l
e(st
art
>=0)

pr
int
f("
."
);

whi
l
e(a[
star
t]
!='
.
'&&st
art
>=0)

st
art
--
;

f
or(
i=st
art
+1;
i
<=l
ast
;i
++)

pr
int
f("
%c"
,a[
i]
);
 }

st
art
--
;

l
ast
=st
art
;

pr
int
f("
\n"
);

r
etur
n0;

i
ntmai
n()

chara[
2001]
;

i
ntn;

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

/
/inti
;

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

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

checki
t(
a);

/
/}

r
etur
n0;

52.
REVERSETHESTRI
NG

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n()

i
nti
,
j=0,
k=0,
l
en,
x;

charst
r[
100]
,
str
1[10]
[20]
,
temp;

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

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

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

st
r1[
k][
j]
='
\0'
;

k++;

j
=0;

el
se

st
r1[
k][
j]
=st
r[
i]
;

j
++;

st
r1[
k][
j]
='
\0'
;

f
or(
i=0;
i
<=k;
i
++)

{
 l
en=st
rl
en(
str
1[i
])
;

f
or(
j=0,
x=l
en-1;
j<x;
j++,
x--
)

t
emp=st
r1[
i]
[j
];

st
r1[
i]
[j
]=st
r1[
i]
[x]
;

st
r1[
i]
[x]
=temp;

f
or(
i=0;
i
<=k;
i
++)

pr
int
f("
%s"
,st
r1[
i]
);

r
etur
n0;

53.
SORTI
NGOFSTRI
NGS

#i
ncl
ude<st
dio.
h>
#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n()
{

i
nti
,
j,
count
;

charst
r[
25]
[25]
,
temp[
25]
;

scanf
("%d"
,&count
);

f
or(
i=0;
i
<count
;i
++)

scanf
("%s"
,st
r[
i]
);

f
or(
i=0;
i
<count
;i
++)

f
or(
j=i
+1;
j
<count
;j
++)
{

i
f(
str
cmp(
str
[i
],
str
[j
])
>0)
{

st
rcpy
(temp,
str
[i
])
;

st
rcpy
(st
r[
i]
,
str
[j
])
;

st
rcpy
(st
r[
j]
,
temp)
;

f
or(
i=0;
i
<count
;i
++)
 pr
int
f("
%s\
n",
str
[i
])
;

r
etur
n0;

54.
DELETATI
ONOFSUBSTRI
NG

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n(){

i
nti
num;

scanf
("%d"
,&i
num)
;

do

charst
[50]
;

i
ntl
,
u,i
;

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

i
nts=st
rl
en(
st)
;
i
f(
l<0)

pr
int
f("
lowerl
i
mitdoesn'
texi
st\
n")
;

el
sei
f(
u>s)

pr
int
f("
upperl
i
mitdoesn'
texi
st\
n")
;

el
se

f
or(
i=0;
i
<s;
i
++)

i
f(
i<1)

pr
int
f("
%c"
,st
[i
])
;

el
sei
f(
i>=l
&&i
<=u)

cont
inue;
 el
se

pr
int
f("
%c"
,st
[i
])
;

pr
int
f("
\n"
);

i
num-
-;

}
whi
l
e(i
num>0)
;

r
etur
n0;

55.
PATTERNSEARCHI
NG

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n(){

i
ntt
,i
;

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

scanf
("%d"
,&t
);

f
or(
i=0;
i
<t;
i
++)

scanf
("%s"
,a)
;

scanf
("%s"
,b)
;

p=st
rst
r(a,
b);

i
f(
p)

pr
int
f("
found"
);

el
se

pr
int
f("
notf
ound"
);
 }

r
etur
n0;

56.
REVERSESTRI
NG

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntt
,i
;charn[
10]
;

scanf
("%d"
,&t
);

f
or(
;t
!=0;
t-
-)

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

i
=0;

whi
l
e(n[
i]
)

i
++;
 /
/pr
int
f("
%d\
n",
i
);

f
or(
i-
-;
i>=0;
i
--)

pr
int
f("
%c"
,n[
i]
);

pr
int
f("
\n"
);

r
etur
n0;

57.
S-PALI
NDROME

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n()

charst
r[
1000]
;

scanf
("%s"
,st
r);

i
nti
,
j;
intf
=9,
l
en;

l
en=st
rl
en(
str
);
f
or(
i=0,
j
=len-
1;i
<l
en&&j
>=0;
i
++,
j
--)

i
f(
(st
r[
i]
=='
b'
)&&(
str
[j
]=='
d'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
d'
)&&(
str
[j
]=='
b'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
I
')
&&(
str
[j
]=='
I
')
)

f
=0;
cont
inue;

}
el
sei
f(
(st
r[
i]
=='
M')
&&(
str
[j
]=='
M')
)

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
O')
&&(
str
[j
]=='
O')
)

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
o'
)&&(
str
[j
]=='
o'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
p'
)&&(
str
[j
]=='
q'
))

f
=0;
cont
inue;

}
el
sei
f(
(st
r[
i]
=='
q'
)&&(
str
[j
]=='
p'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
T'
)&&(
str
[j
]=='
T'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
U'
)&&(
str
[j
]=='
U'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
V'
)&&(
str
[j
]=='
V'
))

f
=0;
cont
inue;
}

el
sei
f(
(st
r[
i]
=='
v'
)&&(
str
[j
]=='
v'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
w')
&&(
str
[j
]=='
w')
)

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
W')
&&(
str
[j
]=='
W')
)

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
X'
)&&(
str
[j
]=='
X'
))

f
=0;
cont
inue;
}

el
sei
f(
(st
r[
i]
=='
x'
)&&(
str
[j
]=='
x'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
Y'
)&&(
str
[i
]=='
Y'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
A'
)&&(
str
[j
]=='
A'
))

f
=0;
cont
inue;

el
sei
f(
(st
r[
i]
=='
H')
&&(
str
[j
]=='
H')
)

{
 f
=0;
cont
inue;

el
se

f
=1;
break;

i
f(
f==0|
|st
rcmp(
str
,"
bob"
)==0)

pr
int
f("
TAK\
n")
;

el
se

pr
int
f("
NIE\
n")
;

r
etur
n0;

58.
WORDSTEM

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmai
n()
{

i
nti
,
j,
k,
l,
m,n,
o,
p,
t,
l
en[
15]
,
flag,
s,
z,
key
,mi
n;

chara[
15]
[25]
,
ans[
25]
,
aa[
25]
;

scanf
("%d"
,&t
);

f
or(
z=1;
z<=t
;z++)

f
lag=s=0;

mi
n=1000;

f
or(
i=0;
i
<=24;
i
++)

ans[
i]
='
\0'
;

scanf
("%d"
,&n)
;

f
or(
i=0;
i
<=n-
1;i
++)

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

m=st
rl
en(
a[i
])
;

l
en[
i]
=m;

i
f(
m<mi
n)

mi
n=m;

key
=i;

f
or(
i=mi
n;i
>=1;
i
--)

f
or(
j=0;
j
<=mi
n-i
;
j++)

l
=j;

k=0;

whi
l
e(k<=i
-1)
{

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

k++;

l
++;

aa[
k]='
\0'
;

f
or(
o=0;
o<=n-
1;o++)

f
lag=0;

f
or(
p=0;
p<=l
en[
o]-
i;
p++)

i
f(
str
cmp(
&a[
o][
p],
aa)
==a[
o][
p+i
])

f
lag=1;

br
eak;
 }

i
f(
fl
ag==0)

br
eak;

i
f(
fl
ag==1)

s=1;

i
f(
str
len(
ans)
==0)

st
rcpy
(ans,
aa)
;

el
se

i
f(
str
cmp(
ans,
aa)
>0)

st
rcpy
(ans,
aa)
;
 }

i
f(
s==1)

br
eak;

pr
int
f("
%s\
n",
ans)
;

r
etur
n0;

59.
COUNTALPHA

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

chara;

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

pr
int
f("
anal
phabet
");

el
se

pr
int
f("
Notanal
phabet
");

r
etur
n0;

60.
PERMUTATI
ONSOFAGI
VENWORD

61.
WORDSTHATSEETHROUGH

#i
ncl
ude<mat
h.h>

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

#i
ncl
ude<st
dli
b.h>

i
ntmai
n()
{

chars[
10]
;

scanf
("%s"
,s)
;

i
ntcount
=0,
i
;

i
ntt
otal
;

whi
l
e(s[
i]
!='
\0'
)

count
++;

i
++;

t
otal
=1;

f
or(
i=0;
i
<count
;i
++)

i
f(
(s[
i]
>=65)
&&(
s[i
]<=90)
)
t
otal
++;

el
se

cont
inue;

pr
int
f("
%d"
,tot
al)
;

r
etur
n0;

62.
CLASSI
CPRI
ME

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<mat
h.h>

i
nti
sPr
ime(
intnum)
;

i
nti
sAr
mst
rong(
intnum)
;

i
nti
sPer
fect
(i
ntnum)
;

i
ntmai
n()

i
ntnum;

scanf
("%d"
,&num)
;

i
f(
isPr
ime(
num)
)

pr
int
f("
%di
sPr
imenumber
.\n"
,num)
;
}

el
se

pr
int
f("
%di
snotPr
imenumber
.\n"
,num)
;

i
f(
isAr
mst
rong(
num)
)

pr
int
f("
%di
sAr
mst
rongnumber
.\n"
,num)
;

el
se

pr
int
f("
%di
snotAr
mst
rongnumber
.\n"
,num)
;

i
f(
isPer
fect
(num)
)

{
 pr
int
f("
%di
sPer
fectnumber
.\n"
,num)
;

el
se

pr
int
f("
%di
snotPer
fectnumber
.\n"
,num)
;

r
etur
n0;

i
nti
sPr
ime(
intnum)

i
nti
;

f
or(
i=2;
i<=num/
2;i
++)

i
f(
num%i
==0)
 {

r
etur
n0;

r
etur
n1;

i
nti
sAr
mst
rong(
intnum)

i
ntl
ast
Digi
t,sum,
ori
ginal
Num,
digi
ts;

sum =0;

or
igi
nal
Num =num;

di
git
s=(
int
)log10(
num)+1;

whi
l
e(num >0)
 {

l
ast
Digi
t=num %10;

sum =sum +r
ound(
pow(
last
Digi
t,di
git
s))
;

num =num /10;

r
etur
n(or
igi
nal
Num ==sum)
;

i
nti
sPer
fect
(i
ntnum)

i
nti
,sum,
n;

sum =0;

n=num;

f
or(
i=1;
i<n;
i++)

{
 i
f(
n%i
==0)

sum +=i
;

r
etur
n(num ==sum)
;

63.
MRSI
NGHAM’
SCHECK

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntage;

scanf
("%d"
,&age)
;

i
f(
age>=18)

pr
int
f("
Eli
gibl
e")
;

el
se

pr
int
f("
NotEl
i
gibl
e")
;

r
etur
n0;
}

64.
LIGHTANDMULTI
PLY

#i
ncl
ude<st
dio.
h>

i
ntmul
l
(intx,
i
nty
){

i
ntpr
oduct=0;

whi
l
e(y!
=0)

pr
oduct+=x
;

y
--;

r
etur
npr
oduct
;

i
ntmai
n()

i
ntx,
y;

scanf
("%d%d"
,&x
,&y
);
 pr
int
f("
%d\
n",
mul
l
(x,
y))
;

r
etur
n0;

65.
ALLTHEARMSYOUKNOW

#i
ncl
ude<mat
h.h>

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
dbool
.
h>

bool
is_
armst
rong(
unsi
gnedi
ntn)
;

i
ntmai
n(){

unsi
gnedi
ntn=0,
i
;

scanf
("%d"
,&i
);

whi
l
e(n<i
+1)
{

bool
flag=i
s_ar
mst
rong(
n);

i
f(f
lag)

pr
int
f("
%d"
,n)
;

n++;

}
 r
etur
n0;

bool
is_
armst
rong(
unsi
gnedi
ntnum){

unsi
gnedi
ntor
igi
nal
Num,
remai
nder
,n=0,
flag;

doubl
eresul
t=0.
0;

f
or(
ori
ginal
Num =num;
ori
ginal
Num !
=0;
++n){

or
igi
nal
Num /
=10;

f
or(
ori
ginal
Num =num;
ori
ginal
Num !
=0;
ori
ginal
Num /
=10){

r
emai
nder=or
igi
nal
Num %10;

r
esul
t+=pow(
remai
nder
,n)
;

i
f(r
ound(
resul
t)==num)

r
etur
ntr
ue;

el
se
 r
etur
nfal
se;

66.
WEI
GHTOFSEQUENCE

#i
ncl
ude<st
dio.
h>

i
ntnumi
nd(
intn)

i
ntsum=0,
m;

whi
l
e(n>0)

m=n%10;

sum=sum+m;

n=n/
10;

r
etur
nsum;

i
ntmai
n(){

i
nta;
scanf
("%d"
,&a)
;

i
ntar
r[
a],
arr
1[a]
,
i,
j,
arr
2[a]
,
arr
3[a]
;

f
or(
i=0;
i
<a;
i
++)

i
ntsum=0,
m;

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

ar
r[
i]=numi
nd(
arr
1[i
])
;

i
ntsum =0,
temp,
fl
ag=0;

f
or(
i=0;
i<a;
i++)

sum +=ar
r[
i]*(
i+1)
;

pr
int
f("
Wei
ghtofi
nputsequence=%d\
n",
sum)
;

pr
int
f("
Sequencet
hathasmaxi
mum wei
ght
\n"
);
f
or(
i=0;
i<a;
i++){

f
or(
j=i
+1;
j<a;
j++){

i
f(
numi
nd(
arr
1[i
])>numi
nd(
arr
1[j
])
)

t
emp=ar
r1[
i]
;

ar
r1[
i]=ar
r1[
j]
;

ar
r1[
j]=t
emp;

el
sei
f(numi
nd(
arr
1[i
])==numi
nd(
arr
1[j
])
)

f
lag=i
;

f
or(
i=0;
i<a;
i++){

ar
r2[
i]=ar
r1[
i]
;

i
f(
fl
ag!
=0)
{
 t
emp=ar
r1[
fl
ag]
;

ar
r1[
fl
ag]=ar
r1[
fl
ag+1]
;

ar
r1[
fl
ag+1]=t
emp;

f
or(
i=0;
i<a;
i++)

ar
r3[
i]=ar
r1[
i]
;

i
f(
sum ==121){

f
or(
i=0;
i<a;
i++){

pr
int
f("
%d"
,ar
r3[
i]
);

pr
int
f("
\n"
);

f
or(
i=0;
i<a;
i++){

pr
int
f("
%d"
,ar
r2[
i]
);
}

el
sei
f(
sum <150|
|sum ==221)
{

f
or(
i=0;
i<a;
i++)

pr
int
f("
%d"
,ar
r2[
i]
);

pr
int
f("
\n"
);

f
or(
i=0;
i<a;
i++)

pr
int
f("
%d"
,ar
r3[
i]
);

el
se{

f
or(
i=0;
i<a;
i++)

{
 pr
int
f("
%d"
,ar
r3[
i]
);

pr
int
f("
\n"
);

f
or(
i=0;
i<a;
i++)

pr
int
f("
%d"
,ar
r2[
i]
);

f
or(
i=0;
i
<a;
i
++)

i
ntsum=0,
m;

ar
r[
i]=numi
nd(
arr
1[i
])
;

sum =0;

f
or(
i=0;
i<a;
i++)
 {

sum +=ar
r[
i]*(
i+1)
;

pr
int
f("
\nMax
imum sequencewei
ght=%d\
n",
sum)
;

r
etur
n0;

67.
SUPERDI
GIT

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

#i
ncl
ude<mat
h.h>

#i
ncl
ude<st
dli
b.h>

v
oidsuper
d(l
ongl
ongnum)

l
ongl
ongsumd(
char
*num)

l
ongl
ongl
en=st
rl
en(
num)
,t
ot=0;
 l
ongl
ongi
;

f
or(
i=0;
i
<len;
i
++)

t
ot+=num[
i]
-'
0'
;

r
etur
ntot
;

i
ntmai
n(){

char*
s=(
char*
)mal
l
oc(
sizeof
(char
)*100001)
;

l
ongl
ongn;

scanf
("%s%l
l
d",
s,
&n)
;

l
ongl
ongsum=sumd(
s)*
n;

whi
l
e(1)

i
f(
sum<10)

br
eak;

spr
int
f(s,
"%l
l
d",
sum)
;
 sum=sumd(
s);

char*
num =s;

super
d(sumd(
num)
);

pr
int
f("
%ll
d",
sum)
;

r
etur
n0;

68.
WHEREI
SHANOI

#i
ncl
ude<st
dio.
h>

v
oidt
ower
s(i
nt,
char
,char
,char
);

i
ntmai
n()

i
ntnum;

scanf
("%d"
,&num)
;

t
ower
s(num,
'
A',
'
C',
'
B')
;

r
etur
n0;

}
v
oidt
ower
s(i
ntnum,
charf
rompeg,
chart
opeg,
charauxpeg)

i
f(
num==1)

pr
int
f("
\nMov
edi
sk1f
rom r
od%ct
orod%c"
,f
rompeg,
topeg)
;

r
etur
n;

t
ower
s(num-
1,f
rompeg,
auxpeg,
topeg)
;

pr
int
f("
\nMov
edi
sk%df
rom r
od%ct
orod%c"
,num,
fr
ompeg,
topeg)
;

t
ower
s(num-
1,auxpeg,
topeg,
fr
ompeg)
;

69.
PASSWORDNOTSTRONGENOUGH

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntpass(
chars[
],
i
ntn)

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

i
ntl
en=st
rl
en(
s);

f
or(
i=0;
i
<n;
i
++)
{

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

l
c++;

el
sei
f(
s[i
]>='
A'&&s[
i]<='
Z'
)

uc++;

el
sei
f(
s[i
]>='
0'&&s[
i]<='
9'
)

no++;

el
se

sc++;

i
f(
lc==0)

add++;

i
f(
uc==0)

add++;

i
f(
no==0)

add++;

i
f(
sc==0)
 {

add++;

l
en=l
en+add;

i
f(
len<6)

add=add+6-l
en;

r
etur
nadd;

i
ntmai
n(){

i
ntn;

chars[
100]
;

scanf
("%d"
,&n)
;

scanf
("%s"
,s)
;

pr
int
f("
%d"
,pass(
s,n)
);

r
etur
n0;

70.
BOOKTHATNUMBER

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
dbool
.
h>

#i
ncl
ude<st
ri
ng.
h>

bool
isVal
i
dISBN(
chari
sbn[
])

i
ntn=st
rl
en(
isbn)
;
i
f(n!
=10)r
etur
nfal
se;

i
ntsum =0,
i
;

f
or(
i=0;
i<9;
i++)

i
ntdi
git=i
sbn[
i]-'
0'
;

i
f(0>di
git|
|9<di
git
)ret
urnf
alse;

sum +=(
digi
t*(
10-i
))
;

charl
ast=i
sbn[
9];

i
f(l
ast!
='X'
&&(
last<'
0'|
|l
ast>'
9'
))

r
etur
nfal
se;

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

r
etur
n(sum %11==0)
;

i
ntmai
n()

{
i
ntt
;

scanf
("%d\
n",
&t)
;whi
l
e(t
--
){

chari
sbn[
12]
;scanf
("%s",
i
sbn)
;(i
sVal
i
dISBN(
isbn)
)?pr
int
f("
Val
i
d\n")
:pr
int
f("
Inv
ali
d\n")
;

r
etur
n0;

71.
SRM ADDMI
SSI
ONS

#i
ncl
ude<st
dio.
h>

st
ructcandi
dat
e{

charname[
50]
;

i
ntj
eeer
ank;

i
nthi
gher
sec;

}
ad;

i
ntmai
n(){

i
nti
;

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

scanf
("%d"
,&ad.
higher
sec)
; pr
int
f("
Name=%s\
n",
ad.
name)
;

pr
int
f("
JEEERank=%d\
n",
ad.
jeeer
ank)
;

pr
int
f("
12t
hMar
k=%d"
,ad.
higher
sec)
;

r
etur
n0;

72.
DISTANCE

#i
ncl
ude<st
dio.
h>

st
ructDi
stance

i
ntf
eet
;

f
loati
nch;

}
d1,
d2,
sumOf
Dist
ances;

i
ntmai
n()

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

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

sumOf
Dist
ances.
feet
=d1.
feet
+d2.
feet
;

sumOf
Dist
ances.
inch=d1.
inch+d2.
inch;

pr
int
f("
Sum ofdi
stances=%dfeetand%.2f
i
nches",
sumOfDist
ances.f
eet,
sumOfDist
ances.
i
nch)
;

r
etur
n0;
}

73.
ACCESSI
NGUNI
ONMEMBERS

#i
ncl
ude<st
dio.
h>

uni
onJob{

i
ntWor
ker
No;

}
;

i
ntmai
n(){

uni
onJobj
;

scanf
("%d"
,&j
.Wor
ker
No)
;

pr
int
f("
Numberofwor
ker
s=%d"
,j
.Wor
ker
No)
; r
etur
n0;

74.
EMPLOYEE

#i
ncl
ude<st
dio.
h>

st
ructempl
oyee{

char name[
30]
;

i
nt empI
d;

f
loatsal
ary
;
}
;

i
ntmai
n()

st
ructempl
oyeeemp;

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

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

scanf
("%f
",
&emp.
sal
ary
);

pr
int
f("
%s\
n",
emp.
name)
;

pr
int
f("
%d\
n" ,
emp.
empI
d);

pr
int
f("
%.f
\n"
,emp.
sal
ary
);

r
etur
n0;
}

75.
SONATA

#i
ncl
ude<st
dio.
h>

uni
onTi
me{

i
ntseconds;

i
ntmi
nut
es;

i
nthour
s;

}
;

i
ntmai
n(){

uni
onTi
mest
art
Time,
stopTi
me,
dif
f;

scanf
("%d%d"
,&st
art
Time.
hour
s,&st
opTi
me.
hour
s);

pr
int
f("
Thet
imedi
ff
erencei
s\n"
);

di
ff
.hour
s=st
art
Time.
hour
s-st
opTi
me.
hour
s;

pr
int
f("
Hour
s:%d\
n",
dif
f.
hour
s);

scanf
("%d%d"
,&st
art
Time.
minut
es,
&st
opTi
me.
minut
es)
;

di
ff
.mi
nut
es=st
art
Time.
minut
es-st
opTi
me.
minut
es;

pr
int
f("
Minut
es:
%d\
n",
dif
f.
minut
es)
;

scanf
("%d%d"
,&st
art
Time.
seconds,
&st
opTi
me.
seconds)
;

di
ff
.seconds=st
art
Time.
seconds-st
opTi
me.
seconds;

pr
int
f("
Seconds:
%d\
n",
dif
f.
seconds)
;

r
etur
n0;

76.
PAYROLL

#i
ncl
ude<st
dio.
h>

st
ructempl
oyee

i
ntempi
d,sal
ary
,hr
a,da;
charname[
20]
;

f
loatt
otal
;

}
emp;

i
ntmai
n()

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

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

scanf
("%d"
,&emp.
sal
ary
);

emp.
hra=emp.
sal
ary
*0.
1;

emp.
da=emp.
sal
ary
*0.
2;

pr
int
f("
Name=%s"
,emp.
name)
;

pr
int
f("
\nI
d=%d"
,emp.
empi
d);

pr
int
f("
\nHRA=%d"
,emp.
hra)
;

pr
int
f("
\nDA=%d"
,emp.
da)
;

pr
int
f("
\nTot
alSal
ary
=%.
0f"
,emp.
sal
ary
+(emp.
sal
ary
*0.
1)+(
emp.
sal
ary
*.2)
);

r
etur
n0;
}

77.
MINICALCULATOR

#i
ncl
ude<st
dio.
h>

uni
onCal
cul
ator

i
ntnum;

}
;

i
ntmai
n()

uni
onCal
cul
atorc1;

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

i
f(
c1.
num >0) {

pr
int
f("
Posi
ti
venumber
");

}
 i
f(
c1.
num <0)

pr
int
f("
Negat
ivenumber
");

i
f(
c1.
num ==0)

pr
int
f("
Zer
o")
;

r
etur
n0;

78.
CGPS

#i
ncl
ude<st
dio.
h>

uni
onSt
udent

charname[
30]
;

charsubj
ect
[20]
;

f
loatper
cent
age;
}
;

i
ntmai
n(){

uni
onSt
udentr
ecor
d;

scanf
("%s"
,recor
d.name)
;

pr
int
f("
Name:
%s\
n",
recor
d.name)
;

scanf
("%s"
,recor
d.subj
ect
);

pr
int
f("
Subj
ect
:%s\
n",
recor
d.subj
ect
);

scanf
("%f
",&r
ecor
d.per
cent
age)
;

pr
int
f("
Per
cent
age:
%.1f
",
recor
d.per
cent
age)
;

r
etur
n0;

79.
HISTORYOFTHEI
NSTI
TUTI
ON

#i
ncl
ude<st
dio.
h>

st
ructCol
l
ege

charname[
100]
;
charci
ty[
100]
;

i
ntest
abl
i
shment
Year
;

f
loatpassPer
cent
age;

}S1[
10]
;

i
ntmai
n(){

i
nti
,
n;

scanf
("%d"
,&n)
;

f
or(
i=0;
i<n;
++i
){

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

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

scanf
("%d"
,&S1[
i]
.est
abl
i
shment
Year
);

scanf
("%f
",&S1[
i]
.passPer
cent
age)
;

pr
int
f("
Det
ail
sofcol
l
eges\
n")
;

f
or(
i=0;
i<n;
++i
){

pr
int
f("
Name:
%s\
n",
S1[
i]
.name)
;
 pr
int
f("
Cit
y:%s\
n",
S1[
i]
.ci
ty)
;

pr
int
f("
Yearofest
abl
i
shment
:%d\
n",
S1[
i]
.est
abl
i
shment
Year
);

pr
int
f("
Passper
cent
age:
%.1f
\n"
,S1[
i]
.passPer
cent
age)
;

r
etur
n0;

80.
ADDUPTHEDI
STANCE

#i
ncl
ude<st
dio.
h>

uni
onDi
stance{

i
ntf
eet
;

f
loati
nch;

}
;

i
ntmai
n(){

/
/uni
onDi
stanced1;

uni
onDi
stanced1,
d2,
sumOf
Dist
ances;

/
/uni
onDi
stancesumOf
Dist
ances;
f
loatt
emp;

i
ntt
emp1;

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

sumOf
Dist
ances.
feet
=d1.
feet
+d2.
feet
;

sumOf
Dist
ances.
feet
=d2.
feet
+temp1;

pr
int
f("
Sum ofdi
stances=%df
eet
\n"
,sumOf
Dist
ances.
feet
);

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

sumOf
Dist
ances.
i
nch=d1.
inch+d2.
i
nch;

sumOf
Dist
ances.
i
nch=d2.
inch+t
emp;

pr
int
f("
Sum ofdi
stances=%.
2fi
nches"
,sumOf
Dist
ances.
inch)
;

r
etur
n0;

81.
TEACHER

#i
ncl
ude<st
dio.
h>

/
/funct
iont
oswapt
het
wonumber
s

v
oidi
nter
change(
int*
num1,
i
nt*
num2)

i
ntt
;
 t=*
num1;

*
num1 =*
num2;

*
num2 =t
;

i
ntmai
n()

i
ntnum1,
num2;

scanf
("%d"
,&num1)
;

scanf
("%d"
,&num2)
;

i
nter
change(
&num1,
&num2)
;

pr
int
f("
%d%d\
n",
num1,
num2)
;

r
etur
n0;

82.RAM ANDHI
SPROBLEMS

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntnumAr
ray
[100]
;

i
nti
,sum =0,
t,
n;

i
nt*
ptr
;

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

i
f(t
<0|
|
t>1000)

pr
int
f("
INVALI
DINPUT"
);

el
se{

whi
l
e(t
--
){

sum =0;

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

f
or(
i=0;
i<n;
i++)

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

pt
r=numAr
ray
;/*a=&a[
0]*
/
 f
or(
i=0;
i<n;
i++){

sum =sum +*
ptr
;

pt
r++;

pr
int
f("
%d\
n",
sum)
;

r
etur
n0;

83.
NUMBERTHEORY

#i
ncl
ude<st
dio.
h>

i
ntst
ri
ng_
lengt
h(char
*);

v
oidmai
n(){

charst
r[
20]
;

i
ntl
engt
h;

scanf
("%s"
,st
r);

l
engt
h=st
ri
ng_
lengt
h(st
r);

pr
int
f("
%d"
,l
engt
h);

i
ntst
ri
ng_
lengt
h(char
*p)/
*p=&st
r[
0]*
/

i
ntcount=0;

whi
l
e(*
p!='
\0'
){

count
++;

p++;

r
etur
ncount
;

84.
GOPALANDTHEPOI
NTER
#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntnum1,
num2;

i
nt*
a;

i
nt*
b;

scanf
("%d"
,&num1)
;

scanf
("%d"
,&num2)
;

a=&num1;

b=&num2;

i
f(
*a>*
b)

pr
int
f("
%d"
,*a)
;

el
se

pr
int
f("
%d"
,*b)
;

r
etur
n0;

85.
NUMBERGAME

#i
ncl
ude<st
dio.
h>

v
oidchecki
ng(
consti
nt*
n1,
consti
nt*
k1)

{
}

i
ntmai
n()

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

scanf
("%d"
,&t
);

whi
l
e(t
--
)

scanf
("%d%d"
,&n,
&k)
;
 f
or(
i=0;
i
<1000;
i
++)
hash[
i]
=0;

ans=0;

f
or(
i=0;
i
<n;
i
++)

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

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

hash[
x]++;

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

i
f(
ans)

pr
int
f("
YES\
n")
;

el
se

pr
int
f("
NO\
n")
;

r
etur
n0;

86.
LARGEST

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntnum1,
num2,
num3;

i
nt*
a,*
b,*
c;

scanf
("%d"
,&num1)
;

scanf
("%d"
,&num2)
;

scanf
("%d"
,&num3)
;

a=&num1;
 b=&num2;

c=&num3;

i
f(
*a>*
b)

i
f(
*a>*
c)

pr
int
f("
%d"
,*a)
;

el
se

pr
int
f("
%d"
,*c)
;

el
se

i
f(
*b>*
c)

pr
int
f("
%d"
,*b)
;

el
se

pr
int
f("
%d"
,*c)
;

r
etur
n0;

87.
MIX

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntt
;
scanf
("%d"
,&t
);

whi
l
e(t
--
){

i
ntn,
z1,
z2;

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

i
nta[
n],
i
;

f
or(
i=0;
i
<n;
i
++)

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

i
f(
n==2&&z1==6)

pr
int
f("
1")
;

el
sei
f(
n==1&&z1==1)

pr
int
f("
0")
;

el
se

pr
int
f("
2")
;

r
etur
n0;

88.
AMELI
A’SGAME

#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
nt*
ptr
;

i
ntp1;

scanf
("%d"
,&p1)
;

i
f(
p1>10000)

pr
int
f("
INVALI
DINPUT"
);

el
se

i
ntp2,
q;

scanf
("%d"
,&q)
;

i
ntp3[
q];

f
or(
p2=0;
p2<q;
p2++)

{
 scanf
("%d"
,&p3[
p2]
);

i
f(
p3[
p2]
%3==0)

pr
int
f("
%d\
n",
p3[
p2]
);

r
etur
n0;

89.
QUERI
ES

#i
ncl
ude<st
dio.
h>

i
ntar
r[
100000]
;

v
oidf
ast
Input
()

{
}

i
ntmai
n(){

i
ntbase=0,
size,
i,m;

charx;

scanf
("%d%d"
,&si
ze,
&m)
;

f
or(
i=0;
i<si
ze;
i++)

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

whi
l
e(m-
->0){

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

i
f(x=='
R'
){

pr
int
f("
%d\
n",
arr
[(
base+i
-1)%si
ze]
);

}el
sei
f(x=='
A'
){

i
f((
base-
=i)<0)

base+=si
ze;

}el
sei
f(x=='
C'
){

base=(
base+i
)%si
ze;

r
etur
n0;

}
90.
REALI
TYSHOW

#i
ncl
ude<st
dio.
h>

i
ntmai
n()

i
ntar
r[
30]
;

i
nt*
ptr
;

i
nti
,j
,a,
n;

scanf
("%d"
,&n)
;

f
or(
i=0;
i<n;
++i
)

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

pt
r=&ar
r[
0];

f
or(
i=0;
i<n;
++i
)

f
or(
j=i
+1;
j<n;
++j
)

i
f(ar
r[
i]<ar
r[
j]
)

a=ar
r[
i]
;

ar
r[
i]=ar
r[
j]
;

ar
r[
j]=a;

f
or(
i=0;
i<n;
++i
)

pr
int
f("
%d"
,ar
r[
i]
);

r
etur
n0;

91.
SEQUENCE
#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
ri
ng.
h>

i
ntmax(
inta,
intb)
;

i
ntl
cs(char*
X,char*
Y,i
ntm,
intn)

i
f(m ==0|
|n==0)

r
etur
n0;

i
f(X[
m-1]==Y[
n-1]
)

r
etur
n1+l
cs(
X,Y,
m-1,
n-1)
;

el
se

r
etur
nmax(
lcs(
X,Y,
m,n-
1),
lcs(
X,Y,
m-1,
n))
;

i
ntmax(
inta,
intb)

r
etur
n(a>b)
?a:
b;

i
ntmai
n()

i
ntt
;

scanf
("%d"
,&t
);

whi
l
e(t
--
){

charX[
100]
;

charY[
100]
;

i
ntm;

i
ntn;

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

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

pr
int
f("
%d\
n",
lcs(X,
Y,m,
n))
;

r
etur
n0;

}
92.
NUMBERSYSTEM

#i
ncl
ude<st
dio.
h>

i
ntcount
(intS[
],
intm,
intn)

i
f(n==0)

r
etur
n1;

i
f(n<0)

r
etur
n0;

i
f(m <=0&&n>=1)

r
etur
n0;

r
etur
ncount
(S,
m -1,
n)+count
(S,
m,n-
S[m-
1])
;

i
ntmai
n()

i
ntt
;

scanf
("%d"
,&t
);

whi
l
e(t
--
){

i
nti
,j
;

i
ntm,
n;

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

i
ntar
r[
m];

f
or(
i=0;
i
<m;
i
++)

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

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

pr
int
f("
%d\
n",
count
(ar
r,m,
n))
;

r
etur
n0;

93.
SUM 1

#i
ncl
ude<st
dio.
h>

v
oidf
unc(
intx,
i
nty
)
{

pr
int
f("
m=%d\
nn=%d"
,y
,x)
;

i
ntmai
n()

i
ntm,
n;

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

v
oid(
*fun_
ptr
)(i
nt,
i
nt)=f
unc;

(
*fun_
ptr
)(m,
n);

r
etur
n0;

94.
BOOKSUPPLY

#i
ncl
ude<st
dio.
h>

st
ructbook{

charname[
20]
;

l
ongi
ntcopi
es;

l
ongi
ntcost
;

}
;

i
ntmai
n()

st
ructbook*b;

st
ructbookb1;

b=&b1;

l
ongi
nti
,
pri
ce;

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

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

scanf
("%l
d",
&b-
>copi
es)
;

i
=b-
>copi
es/
50;

pr
ice=(
b->copi
es)
*(b-
>cost
)-(
b->cost
*i)
;

pr
int
f("
Tot
alamounti
s:
%ld"
,pr
ice)
;

r
etur
n0;
}

95.
LISTSWAP

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
dli
b.h>

st
ructnode

i
ntdat
a;

st
ructnode*
next
;

}
;

v
oidpr
int
Middl
e(st
ructnode*
head)

st
ructnode*
slow_
ptr=head;

st
ructnode*
fast
_pt
r=head;

i
f(head!
=NULL)

whi
l
e(f
ast
_pt
r!=NULL&&f
ast
_pt
r-
>next!
=NULL)

f
ast
_pt
r=f
ast
_pt
r-
>next
->next
;

sl
ow_
ptr=sl
ow_
ptr
->next
;

pr
int
f("
\nThemi
ddl
eel
ementi
s[%d]
\n"
,sl
ow_
ptr
->dat
a);

v
oidpush(
str
uctnode*
*head_
ref
,intnew_
dat
a)

st
ructnode*new_
node=

(
str
uctnode*
)mal
l
oc(
sizeof
(st
ructnode)
);

new_
node-
>dat
a=new_
dat
a;

new_
node-
>next=(
*head_
ref
);
 (
*head_
ref
)=new_
node;

v
oidpr
int
List
(st
ructnode*
ptr
)

whi
l
e(pt
r!=NULL)

pr
int
f("
--
>%d"
,pt
r-
>dat
a);

pt
r=pt
r-
>next
;

/
*Dr
iverpr
ogr
am t
otestabov
efunct
ion*
/

i
ntmai
n()

/
*St
artwi
tht
heempt
yli
st*
/

st
ructnode*head=NULL;

i
nti
,
n,A;

scanf
("%d"
,&n)
;

pr
int
f("
Linkedl
i
st\
n")
;

f
or(
i=1;
i<=n;
i++)

scanf
("%d"
,&A)
;

push(
&head,
A);

pr
int
List
(head)
;

pr
int
Middl
e(head)
;

r
etur
n0;

96.
ASCENDI
NGGAME

#i
ncl
ude<st
dio.
h>

i
nt*
sor
tAsc(
int*
p,i
ntsi
ze)
{
}

i
ntmai
n()

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

f
or(
i=0;
i<n;
++i
)

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

f
or(
i=0;
i<n;
++i
)

f
or(
j=i
+1;
j<n;
++j
)

i
f(ar
r[
i]>ar
r[
j]
)

a=ar
r[
i]
;

ar
r[
i]=ar
r[
j]
;

ar
r[
j]=a;

f
or(
i=0;
i<n;
++i
)

pr
int
f("
%d\
n",
arr
[i
])
;

r
etur
n0;

97.
COLLECTANDDI
SPLAY
#i
ncl
ude<st
dio.
h>

i
ntmai
n(){

i
ntar
r[
5],
i
;

i
nt*
p=ar
r;

f
or(
i=0;
i<5;
++i
)

scanf
("%d"
,ar
r+i
);

pr
int
f("
Yournumber
sar
e:\
n")
;

f
or(
i=0;
i<5;
++i
)

pr
int
f("
%d\
n",
*(ar
r+i
))
;

r
etur
n0;

98.
GRADE

#i
ncl
ude<st
dio.
h>

st
ructst
udent
{

char name[
30]
;

i
nt m1;

i
nt m2;

i
nt m3;

}
;

i
ntmai
n()

i
ntmar
ks;

st
ructst
udentst
d;

st
ructst
udent*
ptr
;

pt
r=&st
d;

scanf
("%s"
,pt
r-
>name)
;

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

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

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

pr
int
f("
Name:
%s\
nTot
almar
k:%d\
n",
ptr
->name,
mar
ks=(
ptr
->m1+pt
r-
>m2+pt
r-
>m3)
);
 mar
ks/
=3;

i
f(
mar
ks<50)

pr
int
f("
Grade:
F")
;

el
sei
f(
mar
ks>=50&&mar
ks<=69)

pr
int
f("
Grade:
E")
;

el
sei
f(
mar
ks>=70&&mar
ks<=79)

pr
int
f("
Grade:
D")
;

el
sei
f(
mar
ks>=80&&mar
ks<+89)

pr
int
f("
GradeC"
);

el
sei
f(
mar
ks>=90&&mar
ks<=99)

pr
int
f("
GradeB"
);

el
sei
f(
mar
ks==100)

pr
int
f("
Grade:
A")
;

r
etur
n0;

99.
LISTSWAP

#i
ncl
ude<st
dio.
h>

#i
ncl
ude<st
dbool
.
h>

i
ntMAX;
i
nti
ntAr
ray
[100]
;

v
oiddi
spl
ay(
){

i
nti
;

f
or(
i=0;
i<MAX;
i
++){

pr
int
f("
%d"
,i
ntAr
ray
[i
])
;

pr
int
f("
\n"
);

v
oidi
nser
ti
onSor
t(){

i
ntv
alueToI
nser
t;

i
nthol
ePosi
ti
on;

i
nti
;

f
or(
i=1;
i<MAX;
i++){

v
alueToI
nser
t=i
ntAr
ray
[i
];

hol
ePosi
ti
on=i
;

whi
l
e(hol
ePosi
ti
on>0&&i
ntAr
ray
[hol
ePosi
ti
on-
1]>v
alueToI
nser
t){

i
ntAr
ray
[hol
ePosi
ti
on]=i
ntAr
ray
[hol
ePosi
ti
on-
1];

hol
ePosi
ti
on-
-;

i
f(
hol
ePosi
ti
on!
=i){

i
ntAr
ray
[hol
ePosi
ti
on]=v
alueToI
nser
t;

di
spl
ay(
);

}
i
ntmai
n(){

i
nti
,
n;

scanf
("%d"
,&n)
;

MAX=n;

f
or(
i=0;
i
<n;
i
++)

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

i
nser
ti
onSor
t()
;

pr
int
f("
Sor
tedAr
ray
:")
;

di
spl
ay(
);

r
etur
n0;

100.
FINDTHELEADER