Program 2
Program 2
(PSZ)
Created by Dinar Perseus & Anik (DUET CSE)
1|Page
Program 3: েৃজের ক্ষেিফল ক্ষের করার ক্ষরাগ্রাম।
#include <bits/stdc++.h> r=float(input("Enter circle radius:"))
using namespace std; area=3.14159*r*r
int main() print("Area : {0}".format(area))
{
double r,A;
cout<<"Enter radius :";
cin>>r;
A=3.1416*r*r;
cout<<"Area :"<<A;
return 0;
}
Program 5: Single integer value ইনপুট ননজে কথাে রকাশ করার ক্ষরাগ্রাম।
#include <bits/stdc++.h> num=int(input("Enter one value:"))
using namespace std; if num==0:
int main() print("Zero")
{ elif num==1:
char a; print("One")
cout<<"Enter a number :"; elif num==2:
cin>>a; print("Two")
switch (a) elif num==3:
{ print("Three")
case '1':cout<<"one";break; elif num==4:
2|Page
case '2':cout<<"two";break; print("Four")
case '3':cout<<"three";break; elif num==5:
case '4':cout<<"four";break; print("Five")
case '5':cout<<"five";break; elif num==6:
case '6':cout<<"six";break; print("Six")
case '7':cout<<"seven";break; elif num==7:
case '8':cout<<"eight";break; print("Seven")
case '9':cout<<"nine";break; elif num==8:
case '0':cout<<"zero";break; print("Eight")
default:cout<<"Enter a valid elif num==9:
input....";break; print("Nine")
} else:
return 0; print("Not digit")
}
3|Page
{
double a,b,c,max; max=num1 if num1>num2 and num1>num3
cout<<"Enter three numbers :"; else num2 if num2>num3 else num3
cin>>a>>b>>c; print("{0} is maximum
max=(a>b&&a>c?a:b>c?b:c); value".format(max))
cout<<"max is :"<<max;
return 0;
}
4|Page
{ b=float(input("Enter b:"))
double a,b,c,d,r1,r2; c=float(input("Enter c:"))
cout<<"Enter the value of (a b c) :"; d=b*b-4*a*c
cin>>a>>b>>c; sqrt=math.sqrt(d)
d=b*b-4*a*c; if d>0:
if (d<0){ x1=(-b+sqrt)/(2*a)
cout<<"Complex Roots!!"; x2=(-b-sqrt)/(2*a)
}else{ print("Roots: {0}
r1=(-b+sqrt(d))/(2*a); {1}".format(x1,x2))
r2=(-b-sqrt(d))/(2*a); elif d==0:
cout<<"First root :"<<r1<<endl; x=(-b/(2*a))
cout<<"Second root :"<<r2; print("Root: {0}".format(x))
} else:
return 0; print("Complex Roots")
} print(- b / (2 * a), " + i", sqrt)
print(- b / (2 * a), " - i", sqrt)
5|Page
Loop
Program 12: Print 1 to n.
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; for i in range(1,n+1):
int main() print(i)
{
int n;
cout<<"Enter the value of n :";
cin>>n;
for (int i = 1; i <= n; i++)
cout<<i<<"\t";
return 0;
}
Program 13: Find the factor of number and sum of all factors.
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; sum=0
int main() for i in range(1,n+1):
{ if n%i==0:
int n,sum=0; sum+=i
cout<<"Enter a number :"; print(i)
cin>>n; print("Factor sum ",sum)
cout<<"Factors of n is : ";
for (int i = 1; i <= n; i++){
if (n%i==0)cout<<i<<" ",sum+=i;
}
cout<<"\nSum of factors :"<<sum;
return 0;
}
6|Page
sum+=i;
cout<<"sum : "<<sum;
return 0;
}
7|Page
Program 17: Summation of this series 1+2+3+4+……..+n with O(1)
complexity.
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; sum=(n*(n+1))/2
int main() print("Sum: ",int(sum))
{
int n,sum;
cout<<"Enter the value of n :";
cin>>n;
sum=n*(n+1)/2;
cout<<"sum : "<<sum;
return 0;
}
8|Page
Program 20: Summation of this series 1*1+2*2+3*3+…..+n*n
(12+22+32+……..+n2).
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; sum=0
int main() for i in range(1,n+1):
{ sum=sum+(i*i)
int n,sum=0; print("Sum: ",sum)
cout<<"Enter the value of n :";
cin>>n;
for (int i = 1; i <= n; i++)
sum+=(i*i);
cout<<"sum : "<<sum;
return 0;
}
(12-32+52-……..+n2).
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; sum=0
int main() sign=1
{ for i in range(1,n+1,2):
int n,sum=0,num=1; sum=sum+sign*(i*i)
cout<<"Enter nth position :"; sign=sign*(-1)
cin>>n; print("Sum: ",sum)
for (int i = 1; i <= n;i++,num+=2){
if (i%2)
sum+=num*num;
else
sum-=num*num;
}
cout<<"sum : "<<sum;
return 0;
}
9|Page
Program 22: Write a program to check armstrong number.
#include <bits/stdc++.h> def countDigit(n):
using namespace std; count=0
int main() while n>0:
{ count=count+1
int num,sum=0,pw=0; n=int(n/10)
cout<<"Enter the number :"; print(n)
cin>>num; return int(count)
for (int i = num; i > 0; i/=10)
pw++; n=int(input("Enter n:"))
for (int i = num; i > 0; i/=10)
sum+=pow(i%10,pw); sum=0
if (sum==num) d=countDigit(n)
cout<<"Armstrong Number !!"; nn=n
else while n>0:
cout<<"Not an armstrong Number !!"; rem=n%10
return 0; sum=sum+int(rem**d)
} n=int(n/10)
if sum==nn:
print("{0} is a Armstrong
number".format(nn))
else:
print("{0} io not a Armstrong
number".format(nn))
10 | P a g e
Program 24: Write a program to calculate the sum of digits of a number.
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std;
int main() sum=0
{ while(n>0):
int num,sum=0; rem=n%10
cout<<"Enter the number :"; sum=sum+rem
cin>>num; n=int(n/10)
for (int i = num; i > 0; i/=10) print("Digit sum: ",sum)
sum+=i%10;
cout<<"Sum : "<<sum;
return 0;
}
11 | P a g e
int num,temp=0; rev=rev*10+(n%10)
cout<<"Enter a number :"; n=int(n/10)
cin>>num;
for (int i = num; i >0; i/=10) if rev==nn:
temp=temp*10+i%10; print("Palindrome num")
if (temp==num) cout<<"Palindrom number !!"; else:
else cout<<"Not a palindrom number !!"; print("NOt palindrome num")
return 0;
}
12 | P a g e
Program 29: Write a program to convert binary to decimal.
#include <bits/stdc++.h> binary=int(input("Enter number:"))
using namespace std; decimal=0
int main() j=1
{ while binary>0:
int num,sum=0; rem=binary%10
cout<<"Enter binary number :"; decimal=decimal+rem*j
cin>>num; j=j*2
for (int i = num,j=1; i >0; i/=10,j*=2) binary=int(binary/10)
sum+=(i%10*j); print("Decimal ",decimal)
cout<<sum;
return 0;
}
13 | P a g e
Program 32: Write a program to check prime number.
#include <bits/stdc++.h> import math
using namespace std; n=int(input("Enter number:"))
int main()
{ check=1
int num; for i in range(2,int(math.sqrt(n))+1):
cout<<"Enter the number :"; if n%i==0:
cin>>num; check=0
for (int i = 2; i<=num/2; i++) break
if(num%i==0){ if check==1 and n!=1:
cout<<"Not a prime !!"; print(n," is a Prime Number")
return 0; else:
} print(n," is not a Prime nUmber")
cout<<"Prime !!";
return 0;
}
14 | P a g e
int n,a=0,b=1; print(a,end=" ")
cout<<"Enter nth position :"; if(n>=2):
cin>>n; print(b,end=" ")
cout<<"Fibonacci series :"<<a<<"\t"<<b; for i in range(1,n-1):
for (int i = 3; i <= n; i++) c=a+b
{ print(c,end=" ")
cout<<"\t"<<a+b; a=b
a=a+b+b-(b=a+b); b=c
}
return 0;
}
15 | P a g e
cout<<"Enter height :"; print(end="\n")
cin>>n;
for (int i = 1; i <= n; i++){
for (int j = 1; j <= i; j++)
cout<<j;
cout<<endl;
}
return 0;
}
16 | P a g e
for (int i = 1; i <= n; i++){
for (int j = i; j >= 1; j--)
cout<<j%2;
cout<<endl;
}
return 0;
}
17 | P a g e
for (int i = n; i >= 1; i--){
for (int j = i; j >= 1; j--)
cout<<j%2;
cout<<endl;
}
return 0;
}
18 | P a g e
for (int i = n; i >= 1; i--){
for (int j = 1; j <= i; j++)
cout<<j;
cout<<endl;
}
return 0;
}
}
cout<<'\n';
}
return 0;
}
20 | P a g e
Program 47: Summation of this series 1*3+2*5+3*7+………n*(2n+1).
#include <bits/stdc++.h> n=int(input("Enter n:"))
using namespace std; sum=0
int main() for i in range(1,n+1):
{ sum=sum+(i*(2*i+1))
int n,sum=0; print("Sum: ",sum)
cout<<"Enter nth position : ";
cin>>n;
for (int i = 1; i <= n; i++)
sum+=i*(2*i+1);
cout<<"Sum : "<<sum;
return 0;
}
Recursion
Program 48: Summation of digits of a number.
#include <bits/stdc++.h>
using namespace std;
int sum(int x){
if (x==0)
return 0;
else
return x%10+sum(x/10);
}
int main()
{
int n;
cout<<"Enter a number : ";
cin>>n;
cout<<"Sum : "<<sum(n);
return 0;
}
21 | P a g e
Program 49: Count digits of a number.
#include <bits/stdc++.h> def digit(n):
using namespace std; if n < 10:
int cou(int x){ return 1
if (x<10) else:
return 1; return 1 + digit(n/10)
else
return 1+cou(x/10); n=int(input("Enter num:"))
} print("Digit: ",digit(n))
int main()
{
int n;
cout<<"Enter a number : ";
cin>>n;
cout<<"Total digits : "<<cou(n);
return 0;
}
22 | P a g e
Program 51: Find factorial.
#include <bits/stdc++.h> def fact(num):
using namespace std; if num==0 or num==1:
int fact(int x){ return 1
if (x==0) return 1; else:
else return x*fact(x-1); return num*fact(num-1)
}
int main() n=int(input("Enter num:"))
{ print("Digit: ",fact(n))
int n;
cout<<"Enter a number : ";
cin>>n;
cout<<"Result : "<<fact(n);
return 0;
}
n=int(input("Enter num:"))
print("Digit: ",fact(n))
Program-5:Fibonacci Series
def fibonacci(num):
if num==1:
return 1
elif num==0:
return 0
else:
return fibonacci(num-
1)+fibonacci(num-2)
n=int(input("Enter num:"))
for i in range(0,n):
print(fibonacci(i),end=" ")
23 | P a g e
Program 53: Find GCD.
#include <bits/stdc++.h> def hcf(a, b):
using namespace std; if(b == 0):
int GCD(int x,int y){ return a
if (y==0) return x; else:
else GCD(y,x%y); return hcf(b, a % b)
} a = 60
int main() b = 48
{ print("The gcd of 60 and 48 is : ",
int n1,n2; end="")
cout<<"Enter your inputs : "; print(hcf(60, 48))
cin>>n1>>n2;
cout<<"GCD : "<<GCD(n1,n2);
return 0;
}
24 | P a g e