Competitive Coding Notes

1. Area of 2.Maximum Among 3 3. 2nd max element find

circle,triangle,square
#include <iostream> #include<iostream> #include<iostream>
using namespace std; using namespace std; using namespace std;
int main() int main() int main()
{ { {
int a,b; int a,b,c; int a,b,c;
cin>>a; cin>>a>>b>>c; cin>>a>>b>>c;
cin>>b; int max_value; int max_value;
float ar=0.0f; if(a>b) if(a>=b && a>=c)
ar=0.5*a*b; { {
cout<<ar<<endl; if(b>=c)
if(a>=c)
ar=3.14*a*a;
max_value=b;
cout<<ar<<endl; max_value=a;
else
ar=a*a; else
max_value=c;
cout<<ar<<endl;
max_value=c; }
return 0;
} else if(b>=a && b>=c)
}
else {
{ if(a>=c
max_value=a;
if(b>c)
else
max_value=c;
max_value=b;
}
else
else if(a>=b)
max_value=c; max_value=a;
} else
cout<<max_value; max_value=b;
} cout<<max_value;
}
4. Finding Grade Of 5.Find The S.I And C.I 6. Implement A
Student Calculator
#include<iostream>
#include<iostream>
#include<iostream> #include<math.h>
#include<math.h>
using namespace std; using namespace std;
using namespace std;
int main() int main()
int main()
{ {
{
int marks; int ch;
float principal,
cin>>marks; rate, time; cout<<"Enter 1
for addition"<<endl;
float si, ci;
cout<<"Enter 2
if(marks>=90) for subtraction"<<endl;
cin>>principal>>r cout<<"Enter 3
cout<<"A+"; ate>>time; for multiplication"<<endl;
else cout<<"Enter 4
if(marks>=80) for division"<<endl;
si=(principal*rate
*time)/100; cout<<"Enter 5
cout<<"A"; for exponent"<<endl;
else cout<<"Enter 6
ci=principal*(pow
if(marks>=70) for log"<<endl;
((1+(rate/100)),time)-1);
cin>>ch;
cout<<"B";
cout<<si<<endl; int a,b;
else
if(marks>=60) cout<<ci; switch(ch)

} {
cout<<"C";
case 1:
else
cin>>a>>b;
if(marks>=50)
cout<<a+b;
cout<<"D"; break;
else case 2:
cout<<"F"; cin>>a>>b;
} cout<<a-b;
break;
case 3:

cin>>a>>b;
 Chapter 2 2.Sum Of Two Squares
cout<<a*b;
1. Twin Prime
break;
#include<iostream>

#include<iostream> #include<cmath>
case 4:
#include<cmath> using namespace std;

cin>>a>>b; using namespace std; int main()

cout<<a/b; int check_prime(int n) {

{ int
break;
n,temp,int_root,flag=0;
int sroot=sqrt(n);
double float_root;
case 5: for(int
i=2;i<=sroot;i++) cin>>n;

cin>>a>>b; { int sroot=sqrt(n);

if(n%i==0) for(int
cout<<pow(a,b); i=1;i<=sroot;i++)
return 0; {
break;
} temp=n-
return 1; i*i;
case 6:
} int_root=sqrt(temp
cin>>a; );
int main()
float_root=sqrt(te
cout<<log(a); { mp);
break; int a,b; if((double)int_root
==float_root)
cin>>a>>b;
{
if(check_prime(a) &&
cout<<"yes";
default:cout<<"In check_prime(b))
valid Choice";
{
flag=1;
}
if(a-b==2 || b-a==2)
} cout<<"Yes";
break;
else
}
cout<<"No";
}
}
if(flag==0)
else

cout<<"no";
cout<<"No";
}
}
3. Sum Of Factorial 4.Sum Of Digits return 1;
#include<iostream> }
using namespace std; #include<iostream> int main()
int main() using namespace std; {
{ int main() int n,sroot,flag=0;
int n; { cin>>n;
cin>>n; int n; sroot=sqrt(n);
if(n==0) cin>>n; for(int
i=2;i<=sroot;i++)
{ int sum=0;
{
while(n>0)
cout<<1; if(n%i==0)
{
{
return 1;
sum=sum+n%10; if(check_prime(i)
} && check_prime(n/i))
n=n/10;
int sum=0,f; {
}
int d,i; flag=1;
cout<<sum;
while(n>0) break;
}
{ }
}
f=1; 5.Semi – Prime
}
#include<iostream>
if(flag)
d=n%10; #include<cmath>
using namespace std; cout<<"Yes";
for(i=1;i<=d;i++)
int check_prime(int n) else
{
{
f=f*i; cout<<"No";
int sroot=sqrt(n);
} }
sum=sum+f;
for(int
n=n/10; i=2;i<=sroot;i++)
} {
cout<<sum; if(n%i==0)
}
return 0;
}
6.Second Max 7.Reverse }
#include<iostream> #include<iostream> 9.Prime
using namespace std; using namespace std; #include<iostream>
int main() int main() #include<math.h>
{ { using namespace std;
Intmax=INT_MIN,smax= int n; int main()
INT_MIN;
cin>>n; {
int k;
int d=0,r=0; int n;
cin>>k;
while(n>0) cin>>n;
while(k>0)
{ int a=sqrt(n);
{
d=n%10; int f=1,i;
if(k>max)
r=r*10+d; for(i=2;i<=a;i++)
{
n=n/10; {
smax=max;
} if(n%i==0)
max=k;
cout<<r; {
}
} f=0;
if(k>smax &&
8.Digits cout<<"Not
k<max)
Prime";
{ #include<iostream>
break;
smax=k; using namespace std;
}
} int main()
}
} {
if(f==1)
if(smax==INT_M int n;
IN) {
cin>>n;
cout<<"Prime
{ if(n==0) Number";
cout<<"NO {
SECOND MAXIMUM"; }
cout<<0; }
}
}
else
while(n>0)
{
{
cout<<smax;
cout<<n%10;
}
n=n/10;
}
}
10.Prime Factorization 11.Pair Of Factors 12.Mean
#include<iostream> #include<iostream> #include<iostream>
using namespace std; #include<cmath> using namespace std;
int main() using namespace std; int main()
{ int main() {
int { float sum=0;
n,temp=2,flag=0,k=0,cou
nt = 0; int n; int count=0;

cin>>n; cin>>n; int k;

while(n>0) int sroot=sqrt(n); cin>>k;

for(int while(k>0)
{ flag=0;
i=1;i<=sroot;i++)
{
if(n%temp==0) {

{ if(n%i==0) sum=sum+k;
count++;
cout<<"("<<i<<",
count++; cin>>k;
"<<n/i<<")"<<endl;
} }
}
else cout<<sum/count;
}
{ }
flag=1;

if(count!=0)
cout<<temp<<"^"
<<count<<" ";
count=0;
temp++;
if(n==1)
break;
}
if(flag==0)

n=n/temp;
}
}
CHAPTER – 3

1. Maximum 2. LCM 3.Integers Square Root

#include<iostream> #include<iostream> #include<iostream>

using namespace std; #include<cmath> using namespace std;

int main() using namespace std; int main()

{ int gcd(int a,int b) {

int max=INT_MIN; { int n;

int k; if(a==0) cin>>n;

cin>>k; return b; int i;

while(k>0) else for(i=1;i*i<=n;i++

)
{ return
gcd(b%a,a); {
if(k>max)
} cout<<(i-1);
{
int main() }
max=k;
{ }
}
int a,b;
cin>>k;
cin>>a>>b;
}
int
} lcm=(a*b)/gcd(a,b);
cout<<lcm;
}
4.Integer cube Root 6. First n Prime 7.First n Twin Prime
#include<iostream> #include<iostream> #include<iostream>
using namespace std; #include<cmath> #include<cmath>
int main() using namespace std; using namespace std;
{ int check_prime(int n) int check_prime(int n)
int n; { {
cin>>n; int sroot=sqrt(n); int sroot=sqrt(n);
int i; for(int for(int
i=2;i<=sroot;i++) i=2;i<=sroot;i++)
for(i=1;i*i*i<=n;i++)
{ {
{
if(n%i==0) if(n%i==0)
}
return 0;
cout<<(i-1); return 0;
}
} }
return 1;
return 1;
}
5. H.C.F }
int main()
#include<iostream> int main()
{
using namespace std; {
int n;
int main() int n,i=0;
cin>>n;
{ cin>>n;
for(int i=2;;i++)
int a,b,hcf=1,i=1; for(int
num=2;;num++) {
cin>>a>>b;
if(check_prime(i)
while(a>=i && {
&& check_prime(i+2))
b>=i) if(check_prime(nu
{
{ m))
cout<<"("<<i<<",
if(a%i==0 && b%i==0) {
"<<i+2<<")"<<endl;
cout<<num<<" ";
n--;
hcf=i; i++;
}
i++; }
if(n==0)
} if(i==n)
break;
cout<<hcf;
break; }
}
} }

}
8.First n Semi-Prime { 10.Factorial
#include<iostream> flag=1; #include<iostream>
#include<cmath> break; using namespace std;
}
using namespace std; int main()
}
int check_prime(int n) {
}
{ int n;
if(flag)
int sroot=sqrt(n); cin>>n;
{
for(int int f=1;
i=2;i<=sroot;i++)
cout<<j<<" "; for(int i=1;i<=n;i++)
{
{
n--;
if(n%i==0)
} f=f*i;

return 0; if(n==0) }

} cout<<f;
break; }
return 1;
} 11.Co-Primes
}
} #include<iostream>
int main()
9.Factors using namespace std;
{
#include<iostream> int main()
int
i,n,sroot,flag=0; using namespace std; {
cin>>n; int main() int a,b,hcf=1,i=1;
for(int j=2;;j++) { cin>>a>>b;
{ int n; while(a>=i && b>=i)
flag=0; cin>>n; {
sroot=sqrt(j); int i; if(a%i==0 && b%i==0)
for(i=1;i<=n;i++) hcf=i;
for(i=2;i<=sroot;i
++) { i++;
if(n%i==0) }
{
{ if(hcf==1)
if(j%i==0) cout<<i<<" "; cout<<"Yes";
{ } else
} cout<<"No";
if(check_prime(i)
&& check_prime(j/i)) } }
12.Binary to Decimal

#include<iostream>
#include<math.h>
using namespace std;
int main()
{
int n;
cin>>n;
int dec=0,c=0;
while(n>0)
{

dec=dec+pow(2,c)*(n%1
0);
c++;
n=n/10;
}
cout<<dec;
}
CHAPTER – 4 2.Index Of Element In {
Given Array
1. Malloc int n;

#include<iostream> cin>>n;
#include<iostream>
#include<stdlib.h> int myArray[n];
using namespace std;
using namespace std; for(int i=0;i<n;i++)
int main()
{
{
int *getArray() cin>>myArray[i];
//callee int n;
}
{ cin>>n;
if(myArray[0]>myArray[
int int myArray[n]; 1])
*arr=(int*)malloc(3*sizeo for(int {
f(int)); //correct way i=0;i<n;i++)
cout<<myArray[0
//int arr[3]; { ];
//Faulty way
}
arr[0]=1; cin>>myArray[i];
if(myArray[n-
arr[1]=2; } 1]>myArray[n-2])
arr[2]=3; int m; {
return arr; cin>>m; cout<<myArray[n-1];
} }
int main() //caller for(int for(int i=1;i<n-1;i++)
{ i=0;i<n;i++)
{
//callee to caller {
if(myArray[i]>my
int Array[i-
*ar=getArray(); if(myArray[i]==m 1]&&myArray[i]>myArr
) ay[i+1])
cout<<ar[0];
{
cout<<ar[1]; cout<<i;
cout<<myArray[i];
cout<<ar[2]; }
}
} }
}
}
3.Elements Greater
Than Neighbor
#include<iostream>
using namespace std;
int main()
4.Count Element 5.Find Elements Within 6.Maximum Element In
Greater than mean Given Range. An Array.

#include<iostream> #include<iostream> #include<iostream>

using namespace std; using namespace std; using namespace std;
int main() int main() int main()
{ { {
int n; int n; int n;
cin>>n; cin>>n; cin>>n;
int myArray[n]; int myArray[n]; int myArray[n];
for(int i=0;i<n;i++) for(int i=0;i<n;i++) for(int i=0;i<n;i++)
{ { {
cin>>myArray[i];
cin>>myArray[i]; cin>>myArray[i];
}
} }
int max_val=myArray[0];
int sum=0; int a,b;
for(int i=0;i<n;i++)
float mean; cin>>a;
{
for(int cin>>b;
i=0;i<n;i++) if(myArray[i]>max_val)
int count=0;
{ max_val=myArray[i];
for(int i=0;i<n;i++)
sum=sum+myArray[i]; }
{
}
cout<<max_val;
mean=(float)sum/ if(myArray[i]>=a&&my
n; Array[i]<=b) }

int count=0; count=count+1;

}
for(int i=0;i<n;i++)
{ cout<<count;

if(myArray[i]>mean) }

count++;
}
cout<<count;
}
7.Finding the element 8.Reverse Array 9.Hamming Distance
which are present in Binary.
first array but not in #include<iostream>
second. #include<iostream>
using namespace std;
#include<iostream> using namespace std;
int main()
using namespace std; {
int main() int main()
int n;
{ {
cin>>n;
int n;
int n; int myArray[n];
cin>>n; cin>>n;
int array1[n],
int myArray[n]; for(int i=0;i<n;i++) array2[n];
int myArray2[n]; cin>>myArray[i]; for(int
for(int i=0;i<n;i++) i=0;i<n;i++)
{ int front=0; cin>>array1[i];
cin>>myArray[i]; int rear=n-1; for(int
i=0;i<n;i++)
}
cin>>array2[i];
for(int i=0;i<n;i++) while(front<rear)
int
{ { hamming_distance;
cin>>myArray2[i]; int for(int
} temp=myArray[front]; i=0;i<n;i++)

for(int i=0;i<n;i++) {
myArray[front]=myArray
{ [rear];
if(array1[i]!=array
int j; 2[i])
myArray[rear]=temp;
for(j=0;j<n;j++)
{ hamming_distance
front++; +=1;
if(myArray[i]==myArray
2[j]) rear--; }

break; } cout<<hamming_
distance;
}
}
if(j==n) for(int i=0;i<n;i++)
cout<<myArray[i]; cout<<myArray[i]<<" ";
} }
}
10. Highest Strike Rate. 11.XOR of Binary 12.Leaders In An Array
Number
#include<iostream> #include<iostream>
#include<iostream>
using namespace std; using namespace std;
using namespace std;
int main() int main()
int main()
{ {
{
int n; int n;
int n;
cin>>n; cin>>n;
cin>>n;
float runs[n]; int myArray[n];
int
float balls[n]; bin1[n],bin2[n],result[n]; for(int i=0;i<n;i++)
for(int i=0;i<n;i++) {
for(int i=0;i<n;i++)
{ cin>>bin1[i];
cin>>myArray[i];
cin>>runs[i]; for(int i=0;i<n;i++)
}
} cin>>bin2[i];
for(int
for(int j=0;j<n;j++) for(int i=0;i<n;i++) i=0;i<n;i++)
{ { {
cin>>balls[j]; if(bin1[i]==bin2[i] int j;
} )

float strike[n]; result[i]=0; for(j=i+1;j<n;j++)

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

{ result[i]=1; if(myArray[i]<=m
yArray[j])
strike[i]=((float)runs[i]/ba }
lls[i])*100; break;

} }
for(int
float max_val=strike[0]; i=0;i<n;i++) if(j==n)

for(int i=0;i<n;i++) cout<<result[i]; cout<<myArray[i]

;
{
}
if(strike[i]>max_val) }
max_val=strike[i]; }

}
cout<<max_val;
}
CHAPTER – 5 int myArray2[n];
a[k]=myArray2[j];
1.Merge Two Sorted for(int i=0;i<n;i++)
Array k++;
{
#include<iostream> j++;
cin>>myArray[i];
using namespace std; }
}
int main() }
for(int i=0;i<n;i++)
{ while(i<n)
{
int n; {
cin>>myArray2[i];
cin>>n; a[k]=myArray[i];
}
int myArray[n]; k++;
for(int i=0;i<n;i++)
int myArray2[n]; i++;
{
int a[2*n]; }
if(myArray[i]%2==0&&
for(int i=0;i<n;i++) while(j<n) myArray2[i]%2==0)

{ { {

cin>>myArray[i]; a[k]=myArray2[j]; myArray[i]=myArray[i]+

myArray2[i];
} k++;
}
for(int i=0;i<n;i++) j++;
else
{ } if(myArray[i]%2==1&&
for(int myArray2[i]%2==1)
cin>>myArray2[i];
i=0;i<2*n;i++) {
}
{ myArray[i]=myArray[i]*
int k=0,j=0,i=0;
cout<<a[i]<<endl; myArray2[i];
while(i<n&&j<n)
} }
{
} }
if(myArray[i]<=myArray
2.Modify an array with for(int i=0;i<n;i++)
2[j])
given rules {
{
#include<iostream> cout<<myArray[i];
a[k]=myArray[i];
using namespace std; }
k++;
int main() }
i++;
{
}
int n;
else
cin>>n;
{
int myArray[n];
3.Palindrome(Array) 4.Positive Followed By for(int i=0;i<n;i++)
Negative (Array).
#include<iostream> {
#include<iostream>
using namespace std; cout<<output[i];
using namespace std;
int main() }
int main()
{ }
{
int n;
int n;
cin>>n;
cin>>n;
int myArray[n];
int myArray[n];
for(int
i=0;i<n;i++) for(int i=0;i<n;i++)
cin>>myArray[i]; {
int front,rear,flag; cin>>myArray[i];
front=0; }
rear=n-1; int output[n];
flag=1; int k=0;
while(front<rear) for(int i=0;i<n;i++)
{ {
if(myArray[front]! if(myArray[i]<0)
=myArray[rear])
{
{
output[k]=myArray[i];
flag=0;
k++;
break;
}
}
}
front=front+1;
for(int i=0;i<n;i++)
rear=rear-1;
{
}
if(myArray[i]>=0)
if(flag==1)
{
cout<<"palindrome";
output[k]=myArray[i];
else
k++;
cout<<"not palindrome";
}
}
}
5.Binary Subtraction cout<<output[i]; 7.Decimal To Binary
#include<iostream> } #include<iostream>
using namespace std; } using namespace std;
int main()
{ 6.Binary To Decimal int main()
int n; #include<iostream> {
cin>>n; #include<math.h> int n;
int myArray[n]; using namespace std; cin>>n;
for(int i=0;i<n;i++) int main()
{ { int
binary[1000],count=0;
cin>>myArray[i]; int n;
int k=0;
} cin>>n;
while(n>0)
int output[n]; int myArray[n];
{
int k=0; for(int i=0;i<n;i++)
for(int i=0;i<n;i++) cin>>myArray[i]; binary[k++]=n%2;
{ int
n=n/2;
dec_equivalent=0,power=
if(myArray[i]<0) 0; count++;
{ for(int i=0;i<n;i++) }
output[k]=myArray[i]; {
k++; if(myArray[i]==1) for(int i=count-
} 1;i>=0;i--)
{
} {
dec_equivalent+=pow(2,n
for(int i=0;i<n;i++) -1-i);
cout<<binary[i];
{ }
}
if(myArray[i]>=0) }
}
{ cout<<dec_equivalent;

output[k]=myArray[i]; }

k++;
}
}
for(int i=0;i<n;i++)
{
8.Deleted Second 9.Delete Kth Index 10.Even Parity.
Largest From An Array. element.
#include<iostream>
#include<iostream> #include<iostream>
using namespace std;
using namespace std; using namespace std;
int main()
int main()
int main() {
{
{ int n;
int n;
int n; int k;
cin>>n;
cin>>n; cin>>n;
int myArray[n];
int myArray[n];
int parity;
int for(int i=0;i<n;i++)
binary[1000],count=0; for(int i=0;i<n;i++)
{
int k=0; {
cin>>myArray[i];
while(n>0) cin>>myArray[i];
}
{ }
cin>>k;
int sum=0;
binary[k++]=n%2; for(int i=k;i<n-1;i++)
for(int i=0;i<n;i++)
n=n/2; {
{
myArray[i]=myArray[i+1
count++; sum+=myArray[i];
];
} }
}
if(sum%2==0)
for(int i=0;i<n-
for(int i=count- 1;i++) parity=0;
1;i>=0;i--) else
{
{ parity=1;
cout<<myArray[i];

cout<<binary[i]; }

} }
cout<<parity;
}
}
11. 0 at even and 1 at {
odd position.
#include<iostream> myArray[k++]=0;
using namespace std; count0 --;
}
while(count1>0)
int main()
{
{
myArray[k++]=1;
int n;
count1 --;
cin>>n;
}
int myArray[n];
for(int i=0;i<n;i++)
for(int
i=0;i<n;i++) cout<<myArray[i]<<" ";
cin>>myArray[i]; }
int
count0=0,count1=0;
for(int i=0;i<n;i++)
{
if(myArray[i]==0)
count0++;
else
count1++;
}
int k=0;
while(count0>0 &&
count1>0)
{
myArray[k++]=0;
myArray[k++]=1;
count0 --;
count1 --;
}

while(count0>0)
CHAPTER – 06 2.Frequency Of }
Element.
1. Find whether there return 0;
exist. #include<iostream>
}
#include<iostream> using namespace std;

using namespace std; int find_max(int

myArray[], int n){
int main(){
int max=0;
int n,k,flag=0;
for(int i=0;i<n;i++){
cin>>n>>k;
if(myArray[i]>ma
int myArray[n]; x) max=myArray[i];
for(int i=0;i<n;i++) }
cin>>myArray[i];
return max;
for(int i=0;i<n;i++){
}
for(int j=i+1;j<n;j++){
int main(){
int n;
if((myArray[i]+myArray[
j])==k){ cin>>n;

flag=1; int myArray[n];

break; for(int i=0;i<n;i++)
} {
} cin>>myArray[i];
if(flag==1){ }
cout<<"Yes"; int
break; lim=find_max(myArray,n
);
}
int count[lim+1];
}
for(int i=0;i<lim+1;i++)
if(flag==0) count[i]=0;
cout<<"No";
for(int
return 0; i=0;i<n;i++)
count[myArray[i]]++;
}
for(int
i=0;i<lim+1;i++){
if(count[i]>0){
cout<<i<<" :
"<<count[i]<<endl;
}
3.find element that have for(int cin>>n>>k;
maximum frequency. i=0;i<n;i++)
count[myArray[i]]++; int myArray[n];
#include<iostream>
for(int i=0;i<n;i++)
using namespace std; cin>>myArray[i];
int
int
max=0,index=0;
lim=find_max(myArray,n
int find_max(int for(int );
myArray[], int n){ i=0;i<lim+1;i++){
int count[lim+1];
int max=0;
for(int
for(int if(count[i]>max){
i=0;i<lim+1;i++)
i=0;i<n;i++){ count[i]=0;
max=count[i];
for(int
if(myArray[i]>ma i=0;i<n;i++)
x) max=myArray[i]; index=i; count[myArray[i]]++;
} } for(int
return max; i=0;i<lim+1;i++){
}
cout<<index<<en
if(count[i]==k){
} dl;

int main(){ return 0; cout<<i<<endl;

int n; } }
cin>>n; 4. Find element that }
occur k times.
return 0;
#include<iostream>
int myArray[n]; }
using namespace std;
for(int
i=0;i<n;i++) int find_max(int
myArray[], int n){
{
int max=0;
cin>>myArray[i]; for(int i=0;i<n;i++)

} {
if(myArray[i]>max)
max=myArray[i];
int
lim=find_max(myArray,n }
); return max;
int count[lim+1]; }
for(int
int main(){
i=0;i<lim+1;i++)
count[i]=0; int n, k;
5.Finding unique cin>>n; int m,n,size,k=0,l=0;
element in an array.
int ar[n]; cin>>m>>n;
#include<iostream>
for(int int a[m][n];
using namespace std; i=0;i<n;i++) cin>>ar[i];
for(int i=0;i<m;i++){
int main(){ int a=0,b=0;
for(int j=0;j<n;j++){
int n, i, j; for(int i=2;i<n;i++)
cin>>a[i][j];
cin>>n; {
}
int myArray[n]; if (n%i==0)
}
for(i=0;i<n;i++) {
size=m*n;
{ a = i;
int odd[size],even[size];
b = n/i;
cin>>myArray[i]; for(int i=0;i<size;i++){
break;
} odd[i]=-1;
}
even[i]=-1;
}
for(i=0;i<n;i++){ }
int m[a][b],k=0;
for(int i=0;i<m;i++){
for(j=0;j<i;j++){ for(int i=0;i<a;i++){
for(int j=0;j<n;j++){
for(int j=0;j<b;j++){
if(a[i][j]%2==0)
if(myArray[i]==m m[i][j]=ar[k++]; even[k++]=a[i][j];
yArray[j])
} else
odd[l++]=a[i][j];
break; }
}
} for(int i=0;i<a;i++){
}
if(i==j) for(int j=0;j<b;j++){
cout<<myArray[i]<<endl; for(int
cout<<m[i][j]<<" "; i=0;even[i]!=-1;i++)
} } cout<<even[i]<<" ";
return 0; cout<<endl; cout<<endl;
} } for(int
i=0;odd[i]!=-1;i++)
return 0; cout<<odd[i]<<" ";
6.Array To Matrix. } return 0;
#include<iostream> 7.Given a matrix,Create }
using namespace std; two arrays.

int main(){ #include<iostream>

int n; using namespace std;

int main(){
CHAPTER – 07
1.Pattern 1 2.Pattern 2 3.Pattern 3

* 1 0

** 23 10

*** 456 101

**** 7 8 9 10 0101
11 12 13 14 15 01010
*****

#include<iostream> #include<iostream>
#include<iostream>
using namespace std; using namespace std;
using namespace std;

int main() int main()

int main()
{ {
{
int n,count=1; int n,count=1;
int n;
cin>>n; cin>>n;
cin>>n;
for(int for(int i=1;i<=n;i++)
for(int i=1;i<=n;i++) i=1;i<=n;i++)
{
{ {
for(int j=1;j<=i;j++)
for(int j=1;j<=i;j++) for(int
j=1;j<=i;j++) {
{
{
if(count%2==0)
cout<<"*";
} cout<<count<<" ";
cout<<"1 ";
else
cout<<endl; count++;
} }
cout<<"0 ";
}
cout<<endl;
count++;
}
}
}
cout<<endl;
}
}
4.Pattern 4 5.Pattern 5
continue;
* *
for(int j=1;j<=(i-1);j++)
*** ***
{
***** *****
cout<<" ";
******* *******
}
********* *********
for(int j=1;j<=(2*n-
******* 2*i+1);j++)
#include<iostream> ***** {
using namespace std; *** cout<<"*";
int main() * }
{ #include<iostream> cout<<endl;
int n; using namespace std; }
cin>>n; int main() }
for(int {
i=1;i<=n;i++)
int n;
{
cin>>n;
for(int
j=1;j<=(n-i);j++) for(int i=1;i<=n;i++)

{ {
for(int j=1;j<=(n-i);j++)
cout<<" "; {
}
for(int cout<<" ";
j=1;j<=(2*i-1);j++) }
{ for(int j=1;j<=(2*i-
1);j++)
cout<<"*"; {
} cout<<"*";
}
cout<<endl;
cout<<endl;
}
}
}
for(int i=1;i<=n;i++)
{ if(i==1)
6.Pattern 6 for(int 7.Pattern 7
i=1;i<=n;i++)
* 1
{ if(i==1)
** -2 -3
continue;
* * 456
for(int j=1;j<=(i-1);j++)
* * -7 -8 -9 -10
{
* * 11 12 13 14 15
cout<<" ";
* *
}
* * #include<iostream>
for(int j=1;j<=(2*n-
** 2*i+1);j++) using namespace std;
* int main()
{
#include<iostream> if(j==1 || j==2*n-2*i+1) {
using namespace std; cout<<"*"; int n,count=1;
int main() else cin>>n;
{ cout<<" "; for(int i=1;i<=n;i++)
int n; } {
cin>>n; for(int j=1;j<=i;j++)
cout<<endl;
for(int i=1;i<=n;i++) } {
{ }
if(i%2==0)
for(int j=1;j<=(n-i);j++)
cout<<-1*count<<" ";
{
else
cout<<" ";
cout<<count<<" ";
}
count++;
for(int j=1;j<=(2*i-
1);j++) }
{ cout<<endl;
if(j==1 || j==2*i-1) }
cout<<"*"; }
else
cout<<" ";
}
cout<<endl;
}
8.Pattern 8 9.Pattern 9 #include<iostream>
1 1 using namespace std;
-2 3 32 int main()
4 -5 6 654 {
-7 8 -9 10 10 9 8 7 int n,count=0;
11 -12 13 -14 15 15 14 13 12 11 cin>>n;
#include<iostream> #include<iostream> for (int i=1;i<=n;i++)
using namespace std; using namespace std; {
int main() if(i%2==0)
{ int main() {
int n,count=1; { count=count+i;
cin>>n; int n,count=0; for(int j=0;j<i;j++)
for(int i=1;i<=n;i++) cin>>n; {
{ cout<<count-j<<" ";
for(int j=1;j<=i;j++) for (int i=1;i<=n;i++) }
{ { cout<<endl;
}
if((i+j)%2==0) count=count+i;
else
for(int j=0;j<i;j++)
cout<<count<<" "; {
{
else for(int j=0;j<i;j++)
cout<<count-j<<" ";
{
cout<<-1*count<<" ";
} count++;

count++; cout<<endl; cout<<count<<" ";

} } }
} cout<<endl;
cout<<endl; }
} 10.Pattern 10 }
} 1 }
32
456
10 9 8 7
11 12 13 14 15
CHAPTER – 08 3.Sum Of GP Series 5.Char Series

1.GP nth #include<iostream> #include<iostream>

#include<iostream> using namespace std; using namespace std;

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

int main() { {

{ int n; char x='A',y='Z';

int n; cin>>n; int i;

cin>>n; int a=2,r=2,sum=0; for(i=1;i<=15;i++)

int a=2,r=2; int i; {

cout<<a*pow(r,n-1); for(i=1;i<=n;i++) cout<<x<<y<<" ";

} { x=x+2;

2.Sum Of AP Series sum=sum+a; y=y-1;

#include<iostream> a=a*r; if(x>90)

using namespace std; } {

cout<<sum; x=65;

int main() } }

{ 4.Int Series if(y<65)

int n; #include<iostream> {

cin>>n; using namespace std; y=90;

int term; int main(){ }

int a, diff, sum=0; int k; }

cin>> a >> diff; cin>>k; }

int x=2,y=10,sum=0;

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

{ cout << a for(i=1;i<=k;i++){

<< " "; sum=sum+x+y;
sum+= a; cout<<x<<" "<<y<<" ";
a = a+diff; x=x*3;
} y=y*2;
}
cout<<endl<<sum; cout<<sum;
} }
6.E Power x 7.Sin x
#include<iostream> #include<iostream>
using namespace std; using namespace std;
int main() int main()
{ {
int x; int x,n;
cin>>x; cin>>x;
float cin>>n;
sum=0,term=1,epsilon=1
0e-7; float y;
y=x*(3.142/180);
int i=1;
while(term>epsilon) float sum=0,term=y;

{ int i=2,c=1;

sum=sum+term; int j=0;

term=term*x/i; while(j<n)

i++; {
if(c%2==1)
}
cout<<sum; {

} sum=sum+term;
}
else
{
sum=sum-term;
}
term=term*x*x/(i*(i+1));
i=i+2;
j=j+1;
}
cout<<sum;
}
CHAPTER – 09

1. Convert String To 2. Char With Max 3.Count Digits In A

Uppercase Occurrence String.

#include <iostream> #include <iostream> #include <iostream>

using namespace std; #include <string.h> using namespace std;

int main() using namespace std; int main()

{ int main() {

int n; { int n;

cin>>n; char str[100]; cin>>n;

char str[n]; cin>>str; char str[n];

cin>>str; int cin>>str;

count[256]={0};
for(int i=0;i<n;i++) int count=0;
int i,l=strlen(str);
{ for(int i=0;i<n;i++)
for(i=0;i<l;i++)
if(str[i]>='a' {
&&str[i]<='z') {
if(str[i]>='0' &&
str[i]=str[i]-32; count[str[i]]++; str[i]<='9')

} } {

cout<<str; int max=0,max_i=-1; count++;

return 0; for(i=0;i<256;i++) }

} { }
if(max<count[i]) cout<<count;
{ return 0;
max=count[i]; }
max_i=i;
}
}
cout<<(char)max_i;
return 0;
}
4.Print Longest { 6.Reverse A String
Numeric String
max=count; #include <iostream>
#include <iostream>
mm=start; using namespace std;
#include <string.h>
mn=end; int main()
using namespace std;
} {
int main()
i=i-1; //to tackle int n;
{ extra increment.
cin>>n;
char str[100]; }
char str[n];
cin>>str; }
cin>>str;
int i,l=strlen(str); for(i=mm;i<=mn;i++)
int i,j,t;
int start,end,mm=0,mn=- cout<<str[i];
for(i=0,j=n-1;i<j;i++,j--
1;
return 0; )
int
count=0,max=0,flag=0; } {
5.Count Words In a t=str[i];
for(i=0;i<l;i++)
String.
{ str[i]=str[j];
#include <iostream>
flag=0; str[j]=t;
#include <string>
if(str[i]>='0' && }
#include <string.h>
str[i]<='9') cout<<str;
{ using namespace std;
return 0;
flag=1; int main()
}
start=i; {

count=0; char str[100];

while(i<l && cin.getline(str,100);

str[i]>='0' && str[i]<='9') int l=strlen(str);
{ int count=0;
count++; for(int i=0;i<=l;i++)
i++; {
} if(str[i]==' ' || i==l-1)
end=i-1; count++;
} }
if(flag==1) cout<<count;
{ return 0;
if(max<count) }
7.Floating Point 8.Palindrome
Representation if(str[i]>='0' &&
str[i]<='9') #include <iostream>
#include <iostream>
{ using namespace std;
#include <string.h>
int main()
using namespace std; while(str[i]>='0' && {
str[i]<='9')
int n;
int main() {
cin>>n;
{
if(i==(l-1)) char str[n];
char str[100];
{ cin>>str;
cin>>str;
int flag=0;
int i,l=strlen(str); cout<<"Valid"; int i,j,t;
int flag=0;
for(i=0,j=n-1;i<j;i++,j--)
if(str[i]>='0' && flag=1;
str[i]<='9') {
}
{ if(str[i]!=str[j])
i++;
while(str[i]>='0' && {
}
str[i]<='9')
} flag=1;
i++;
}
if(str[i]=='.')
} break;
{
} }
i++;
} }
if(str[i]>='0' &&
str[i]<='9') } if(flag==1)

{ if(flag==0) cout<<"Not Palindrome";

while(str[i]>='0' cout<<"Not Valid"; else

&& str[i]<='9') return 0; cout<<"Palindrome";
i++; } return 0;
if(str[i]=='e') }
{
i++;
if(str[i]=='+'
|| str[i]=='-')
{
i++;
CHAPTER – 10 cin>>n; 4.Nth Fib Number.

1.Find Factorial Using int res=mult(m,n); #include <iostream>

Recursion. cout<<res; using namespace std;
#include <iostream> return 0; int fib(int n)
using namespace std; } {
int fact(int n) if(n==1)
{ return 0;
if(n==1 || n==0) 3.Recursive Power. if(n==2)
return 1; #include<iostream> return 1;
return n*fact(n-1); using namespace std; return fib(n-1)+fib(n-
} 2);

int main() }
int power(int a, int b)
{ int main()
{
int n; {
if(b==0)
cin>>n; int n;
return 1;
cout<<fact(n); cin>>n;
else if(b==1)
return 0; cout<<fib(n);
return a;
} return 0;
else
2.Find Product Using }
return
Recursion. a*power(a,b-1);
#include <iostream> }
using namespace std; int main()
int mult(int m,int n) {
{ int a,b;
if(n==0) cin>>a>>b;
return 0; cout<<power(a,b);
return m+mult(m,n-1); }
}
int main()
{
int m,n;
cin>>m;
5.Recursive Max Of An 6.Recursive Sum Of An 7.Reursive Sum Of
Array. Array. Digits.

#include<iostream> #include<iostream> #include<iostream>

using namespace std; using namespace std; using namespace std;
int findMax(int ar[],int n) int findSum(int *ar,int n)
{ { int sum_of_digits(int n)
if(n==0) return ar[0]; if(n==0) {
if(ar[n]>findmax(ar,n-1)) return ar[0]; if(n==0)
else return 0;
return ar[n];
return findSum(ar,n- else
else 1)+ar[n];
return return n%10 +
findMax(ar,n-1); } sum_of_digits(n/10);

} int main() }

int main() { int main()

{ int n; {

int n; cin>>n; int n;

int ar[n]; cin>>n;
cin>>n;
int ar[n]; for(int i=0;i<n;i++) cout<<sum_of_digits(n);

for(int cin>>ar[i]; }
i=0;i<n;i++) cout<<findSum(ar,n-1);
cin>>ar[i]; }
cout<<findMax(ar,n-1);
}
8.Recursive Reverse else 10.Recursive Binary To
Digits. Decimal
return
#include<iostream> (n%10)*(power_of_10) +
reverse(n/10);
#include<cmath> #include<iostream>
}
using namespace std; #include<cmath>
int main()
int count_digits(int n) using namespace std;
{
{ int binaryToDecimal(int
int n; n,int index)
int s=0;
cin>>n; {
while(n>0)
cout<<reverse(n); if(n==0)
{
} return 0;
s++;
9.Recursive GCD else
n=n/10;
#include<iostream> {
}
#include<cmath> int
return s; last_digit=n%10;
using namespace std;
} return
int gcd(int a,int b) last_digit*pow(2,index)+
int power(int n)
{ binaryToDecimal(n/10,in
{ dex+1);
if(a==0)
int s=1; }
return b;
while(n>1) }
else
{ int main()
return
s=s*10; gcd(b%a,a); {
n--; } int n;
} int main() cin>>n;
} { cout<<binaryToD
int reverse(int n) ecimal(n,0);
int a,b;
{ }
cin>>a>>b;
int cout<<gcd(a,b);
num_of_digits=count_dig
its(n); }
int
power_of_10=power(num
_of_digits);
if(n==0)
return 0;
11.Recursive Decimal To 12.Reverse Array Using 13.Check Palindrome
Binary. Recursion. Using Recursion.
#include<iostream> #include <iostream> #include <iostream>
using namespace std; using namespace std; using namespace std;
void decimalToBinary(int void rev(int a[],int i,int j) int rev(int n,int n1)
n)
{ {
{
int t; if(n==0)
if(n==0)
if(i<=j) return n1;
return;
{ return
else rev(n/10,n1*10+n%10);
t=a[i];
{ }
a[i]=a[j];
decimalToBinary(n/2); int main()
a[j]=t;
cout<<n%2; {
rev(a,i+1,j-1);
} int n;
}
} cin>>n;
}
int main() int n1=rev(n,0);
int main()
{ if(n==n1)
{
cout<<"Palindrome";
int n; int n;
cin>>n; else
cin>>n;
cout<<"Not
if(n==0) int a[n]; Palindrome";
cout<<"0"; int i; return 0;
else for(i=0;i<n;i++) }
decimalToBinary(n); {
} cin>>a[i];
}
rev(a,0,n-1);
for(i=0;i<n;i++)
{
cout<<a[i];
}
return 0;
}
CHAPTER – 11 2. 2D passing arrays To 3.Sum Of Two Matrices.
Function.
1.2-D Malloc #include<iostream>
#include<iostream>
#include<iostream> using namespace std;
#include<stdlib.h>
#include<stdlib.h> int main(){
using namespace std;
using namespace std; int n;
int display(int
int main() ar[][100],int a,int b) cin>>n;
//callee int a[n][n],b[n][n],c[n][n];
{
{ for(int i=0;i<n;i++){
int n,m;
for(int i=0;i<a;i++) for(int j=0;j<n;j++){
cin>>n>>m;
{ cin>>a[i][j];
int
**matrix=(int**)malloc(s for(int j=0;j<b;j++) }
izeof(int*)*n);
{ }
cout<<ar[i][j]<<" "; for(int i=0;i<n;i++){
for(int i=0;i<n;i++)
} for(int j=0;j<n;j++){
matrix[i]=(int*)malloc(siz
eof(int)*m); cout<<endl; cin>>b[i][j];

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

for(int j=0;j<m;j++) } }

cin>>matrix[i][j]; int main() //caller for(int i=0;i<n;i++){

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

for(int j=0;j<m;j++) int ar[100][100]; c[i][j]=a[i][j]+b[i][j];

cout<<matrix[i][j] int a,b; }

<<endl; cin>>a>>b; }
} for(int i=0;i<a;i++) cout<<endl;
{ for(int i=0;i<n;i++){
for(int j=0;j<b;j++) for(int j=0;j<n;j++){
{ cout<<c[i][j]<<" ";
cin>>ar[i][j];
} }cout<<endl;

} }

display(ar,a,b); return 0;

} }
4.Print no greater than 5.Transpose Of Matrix }
all its 4 neighbors.
#include<iostream> 6. Given a binary
#include<iostream> matrix, print the column
using namespace std; with maximum 1s.
using namespace std;
int main() #include<iostream>
int main(){
{ using namespace std;
int m,n;
int r,c; int main(){
cin>>m>>n;
cin>>r>>c; int n;
int a[m][n];
int myArray[r][c]; cin>>n;
for(int i=0;i<n;i++){
int tranpose[c][r]; int a[n][n];
for(int j=0;j<n;j++){
for(int i=0;i<r;i++) for(int i=0;i<n;i++){
cin>>a[i][j];
{ for(int j=0;j<n;j++){
}
for(int j=0;j<c;j++) cin>>a[i][j];
}
{ }
for(int i=1;i<m-1;i++){
cin>>myArray[i][j]; }
for(int j=1;j<n-1;j++){
} int
} count=0,max_count=0,
if(a[i][j]>a[i-1][j] index=0;
&& a[i][j]>a[i][j+1] && for(int i=0;i<r;i++)
a[i][j]>a[i+1][j] && for(int i=0;i<n;i++){
a[i][j]>a[i][j-1]){ {
count=0;
cout<<a[i][j]<<endl; for(int j=0;j<c;j++)
for(int j=0;j<n;j++){
} {
if(a[j][i]==1)
} tranpose[j][i]=myArray[i] count++;
[j];
} }
}
return 0; if(count>max_count){
}
} max_count=count;
for(int i=0;i<c;i++)
index=i;
{
}
for(int j=0;j<r;j++)
}
{
cout<<(index+1);
cout<<tranpose[i][j]<<"
"; return 0;

} }
cout<<endl;
}
7. Given a matrix, print 8. Largest Element {
the column having From Row Column.
if(myArray[j][i]>column_
maximum sum.
#include<iostream> max)
#include<iostream>
using namespace std; column_max=myArray[j]
using namespace std; [i];
int main()
int main(){ }
{
int m,n; cout<<column_max<<" ";
int r,c;
cin>>m>>n; }
cin>>r>>c;
int a[m][n]; }
int
for(int i=0;i<m;i++){ row_max=0,column_max
=0;
for(int j=0;j<n;j++){
int myArray[r][c];
cin>>a[i][j];
for(int i=0;i<r;i++)
}
{
}
for(int j=0;j<c;j++)
int sum=0,
max_sum=0,col=0; cin>>myArray[i][j];
for(int i=0;i<m;i++){ }
sum=0; for(int i=0;i<r;i++)
for(int j=0;j<n;j++){ {
row_max=0;
sum+=a[j][i];
for(int j=0;j<c;j++)
}
{

if(sum>max_sum) if(myArray[i][j]>row_ma
{ x)
max_sum=sum; row_max=myArra
col=i; y[i][j];

} }

} cout<<row_max<<" ";

cout<<(col+1); }
cout<<endl;
return 0;
} for(int i=0;i<c;i++)
{
column_max=0;
for(int j=0;j<r;j++)
9. Largest Group Of 1. }
min=sum;
#include<iostream> 10. Min Max Row Of
Matrix. min_index=i;
using namespace std;
#include<iostream> }
int main()
#include<math.h> if(sum>max)
{
using namespace std; {
int r,c;
max=sum;
cin>>r>>c;
int main() max_index=i;
int myArray[r][c];
{ }
int sum=0,max=0;
int r,c; }
for(int i=0;i<r;i++)
cin>>r>>c; cout<<min_index<<endl;
{
int myArray[r][c]; cout<<max_index;
for(int j=0;j<c;j++)
for(int i=0;i<r;i++) }
cin>>myArray[i][j];
{
}
for(int j=0;j<c;j++)
for(int i=0;i<r;i++)
cin>>myArray[i][j
{ ];
sum=0; }
for(int j=0;j<c;j++) int
{ min,max,min_index,max_
index,sum;
if(myArray[i][j]==1)
for(int i=0;i<r;i++)
sum++;
{
else
min=myArray[i][0];
{
max=myArray[i][0];
if(sum>max)
sum=0;
max=sum;
for(int j=0;j<c;j++)
sum=0;
{
}
if(myArray[i][j]==1)
}
sum=sum+pow(2,c-1-j);
if(sum>max)
}
max=sum;
if(sum<min)
}
{
cout<<max;
11. Matrix for(int i=0;i<m1;i++){ else
Multiplication.
for(int j=0;j<n2;j++){ {
#include<iostream>
cout<<c[i][j]<<" "; y=x*-1;
using namespace std;
} x=0;
int main(){
cout<<endl; }
int m1,n1;
} for(int
cin>>m1>>n1; i=x;i<r&&y<c;i++)
}
int m2,n2; {
return 0;
cin>>m2>>n2; cout<<myArray[i][y]<<"
} ";
int
a[m1][n1],b[m2][n2]; xy++;
for(int i=0;i<m1;i++){ 12. k_diagonal }
for(int j=0;j<n1;j++){ #include<iostream> }
cin>>a[i][j]; using namespace std;

} int main()

} {
int r,c,k;
for(int i=0;i<m1;i++){
for(int j=0;j<n1;j++){ cin>>r>>c;

cin>>b[i][j]; int myArray[r][c];

} cin>>k;

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

if(n1==m2){ {

int for(int j=0;j<c;j++)

c[m1][n2], sum=0; {
for(int i=0;i<m1;i++){ cin>>myArray[i][j];
for(int j=0;j<n2;j++){ }
sum=0; }
for( int k=0;k<m1;k++){ int x,y;
sum+=a[i][k]*b[k][j]; x=r-k;
}
if(x>=0)
c[i][j]=sum;
{
}
y=0;
}
}
13. Magic Matrix break; if(sum!=sum_constant)
#include<iostream> } {
using namespace std; } flag=1;
int main() if(flag==1) break;
{ { }
int n; cout<<"not magic }
matrix";
cin>>n; sum=0;
}
int magic[n][n]; for(int i=0;i<n;i++)
else
for(int i=0;i<n;i++) sum+=magic[i][i];
{
{ if(sum!=sum_constant)
for(int i=0;i<n;i++)
for(int j=0;j<n;j++) flag=1;
sum_constant +=
{ magic[0][i]; int j=n-1;
cin>>magic[i][j]; for(int i=1;i<n;i++) sum=0;
} { for(int i=0;i<n;i++)
} sum=0; {
int flag=0; sum+=magic[i][j];
for(int j=0;j<n;j++)
int { j--;
sum_constant=0,sum=0; sum+=magic[i][j]; }
int t=n*n+1; } if(sum!=sum_constant)
int hash[t]={0}; if(sum!=sum_constant) flag=1;
for(int i=0;i<n;i++) { if(flag==1)
{ flag=1; cout<<"Not magic
for(int j=0;j<n;j++) break; matrix";
{ } else
hash[magic[i][j]]=1; } cout<<"Magic matrix";
} }
for(int i=1;i<n;i++)
} { }
for(int i=1;i<t;i++) sum=0;
{ for(int j=0;j<n;j++)
if(hash[i]==0) {
{ sum+=magic[j][i];
flag=1; }