Single_Number
#include<stdio.h>
int main()
{
int n,j,s=0,c;
scanf("%d",&n);
int a[n],i;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
for(i=0;i<n;i++)
{
c=0;
for(j=0;j<n;j++)
{
if(a[i]==a[j])
{
c++;
}
}
if(c==1)
{
s=1;
printf("%d",a[i]);
}
}
if(s==0)
{
printf("NO Single Number");
}
}
COST TO FENCE THE PARK OUTSIDE
#include<stdio.h>
int main(){
int l,b,w,c,area1,area2;
scanf("%d%d%d%d",&l,&b,&w,&c);
area1=l*b;
area2=(l+2*w)*(b+2*w);
printf("%d",(area2-area1)*c);
return 0;
}
AREA OF CIRCLE
#include<stdio.h>
int main(){
int r;
float area;
scanf("%d",&r);
area=3.14*r*r;
printf("%.2f",area);
return 0;
}
FAHRENHEIT TO CELSIUS
#include<stdio.h>
int main(){
int a;
float b;
scanf("%d",&a);
b=(a-32)*5/9.0;
printf("%.2f",b);
return 0;
}
SIMPLE INTEREST
#include<stdio.h>
int main(){
int p,t,r;
scanf("%d%d%d",&p,&t,&r);
printf("%d",p*t*r/100);
}
DIAGONALS OF POLYGON
#include<stdio.h>
int main(){
int n;
scanf("%d",&n);
printf("%d",n*(n-3)/2);
}
HCF of an array
#include<stdio.h>
int main()
{
int n,i,gcd;
scanf("%d",&n);
int arr[n];
for(i=0;i<n;i++)
{
scanf("%d",&arr[i]);
}
gcd=arr[0];
int j=1;
while(j<n)
{
if(arr[j]%gcd==0)
{
j++;
}
else
{
gcd=arr[j]%gcd;
i++;
}
}
printf("%d",gcd);
return 0;
}
Decode_String(Before_Reversals)
#include<stdio.h>
int main(){
int t;
scanf("%d",&t);
while (t--){
int a,b;
scanf("%d%d",&a,&b);
char str[a];
int i,j;
scanf("%s",str);
while (b>1){
char res[b];
for (i=0; i<b; i++){
res[i]=str[i];
}
for (i=0; i<b; i++){
str[i]=res[b-i-1];
}
b--;
}
printf("%s",str);
printf("
");
}
return 0;
}
Optimal_Sorting
#include<stdio.h>
int main()
{
int n,c=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
int x;
scanf("%d",&x);
int arr[x];
for(int j=0;j<x;j++)
{
scanf("%d",&arr[j]);
}
for(int k=1;k<x;k++)
{
if(arr[k-1]>arr[k])
{
c++;
}
}
if(c==0)
{
printf("%d",c);
}
else
{
int min=arr[0],max=arr[0];
for(int l=0;l<x;l++)
{
if(min>arr[l])
{
min=arr[l];
}
if(max<arr[l])
{
max=arr[l];
}
}
printf("%d
",max-min);
}
}
}
Appy_and_Contest
#include<stdio.h>
long int gcd(long int a,long int b)
{
if (a == b)
return a;
if (a > b)
return gcd(a-b, b);
else
return gcd(a, b-a);
}
int main()
{
long long int N,K,ma,mb,lcm,tot,max;
long int A,B;
int i,T;
scanf("%d",&T);
for(i=1;i<=T;i++)
{
max=0;
tot=0;
scanf("%lld %ld %ld %lld",&N,&A,&B,&K);
max=(A>B)?A:B;
ma=N/A;
mb=N/B;
lcm=(A*B)/gcd(A,B);
tot=ma+mb-(2*(N/lcm));
if(tot>=K)
printf("Win
");
else
printf("Lose
");
}
return(0);
}
AREA OF TRIANGLE
#include<stdio.h>
#include<math.h>
int main(){
int a,b,c;
float s,area;
scanf("%d%d%d",&a,&b,&c);
s=(a+b+c)/2.0;
area=sqrt(s*(s-a)*(s-b)*(s-c));
printf("%.2f",area);
return 0;
}
AVERAGE OF TWO NUMBERS
#include<stdio.h>
int main(){
int a,b;
float s;
scanf("%d%d",&a,&b);
s=(a+b)/2.0;
printf("%.4f",s);
return 0;
}
FIND ASCII VALUE OF A CHARACTER
#include<stdio.h>
int main(){
char s;
scanf("%c",&s);
printf("%d",s);
return 0;
}
PROGRAM TO MULTIPLY TWO FLOATING POINT NUMBERS
#include<stdio.h>
int main(){
float a,b;
scanf("%f%f",&a,&b);
printf("%.2f",a*b);
return 0;
}
MULTIPLICATION
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a*b);
return 0;
}
DIVISION
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a/b);
return 0;
}
MODULUS
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a%b);
return 0;
}
TAKE INPUT AND PRINT
#include<stdio.h>
int main(){
char a[30];
scanf("%[^\n]s",a);
printf("%s",a);
return 0;
}
ADDING TWO NUMBERS
#include<stdio.h>
int main(){
int a,b;
scanf("%d%d",&a,&b);
printf("%d",a+b);
return 0;
}
Count_of_the_non-prime_divisors_of_a_given_number
#include<stdio.h>
int prime(int n)
{
if(n==1)
{
return 0;
}
int i;
for(i=2;i<n;i++)
{
if(n%i==0)
{
return 1;
}
}
return 0;
}
int main()
{
int n,c=0;
scanf("%d",&n);
for(int i=2;i<n;i++)
{
if(n%i==0)
{
if(prime(i))
{
c++;
}
}
}
printf("%d",c+2);
}
PROGRAM TO FIND MAXIMUM HAND SHAKES
#include<stdio.h>
int main(){
int a;
scanf("%d",&a);
printf("%d",a*(a-1)/2);
return 0;
}
Perfect Number
#include<stdio.h>
int main()
{
int i,n,s=0;
scanf("%d",&n);
for(i=1;i<n;i++)
{
if(n%i==0)
s=s+i;
}
if (i==s)
{
printf("True");
}
else
{
printf("False");
}
}
SUBRACT PRODUCT ANS SUM OF DIGITS
#include<stdio.h>
int main(){
int a,sum=0,prod=1,r,temp;
scanf("%d",&a);
temp=a;
while(temp){
r=temp%10;
sum+=r,prod*=r;
temp/=10;
}
printf("%d",prod-sum);
return 0;
}
Strong Number
#include<stdio.h>
int main()
{
int num,i,fact,r,sum=0,temp;
scanf("%d",&num);
temp=num;
while(num)
{
i=1,fact=1;
r=num%10;
while(i<=r)
{
fact=fact*i;
i++;
}
sum=sum+fact;
num=num/10;
}
if(sum==temp)
printf("The number %d is a strong number",temp);
else
printf("The number %d is not a strong number",temp);
return 0;
}
SPY NUMBER
#include<stdio.h>
int main(){
int a,sum=0,prod=1,r,temp;
scanf("%d",&a);
temp=a;
while(temp){
r=temp%10;
sum+=r,prod*=r;
temp/=10;
}
if(sum==prod)
printf("Spy Number");
else
printf("Not Spy Number");
return 0;
}
NEON NUMBER
#include<stdio.h>
int main(){
int a,sum=0,temp,r;
scanf("%d",&a);
temp=a*a;
while(temp){
r=temp%10;
sum+=r;
temp/=10;
}
if(sum==a)
printf("Neon Number");
else
printf("Not Neon Number");
return 0;
}
Nearest Fibonacci
#include<stdio.h>
int main()
{
int n,a=0,b=1,c,temp;
scanf("%d",&n);
c=a+b;
temp=n;
while(c<=temp)
{
c=a+b;
a=b;
b=c;
}
if(n-a>b-n)
{
printf("%d",b);
}
else if(n-a<b-n)
{
printf("%d",a);
}
else
{
printf("%d %d",a,b);
}
}
Monk And Suare Root
#include<stdio.h>
int main()
{
int t,m,n,fl;
scanf("%d",&t);
while(t--)
{
scanf("%d %d",&n,&m);
fl=0;
for(int i=0;i<=m;i++){
long int temp= (long int)i*i;
if(temp%m==n){
printf("%d
",i);
fl=1;
break;
}
}
if(fl==0)
printf("-1
");
}
return 0;
}
LCM
#include <stdio.h>
int main() {
int n1, n2, max;
;
scanf("%d %d", &n1, &n2);
// maximum number between n1 and n2 is stored in max
max = (n1 > n2) ? n1 : n2;
while (1) {
if (max % n1 == 0 && max % n2 == 0) {
printf("%d",max);
break;
}
++max;
}
return 0;
}
Reverse Integer
#include <stdio.h>
int main() {
int n1, n2, max;
;
scanf("%d %d", &n1, &n2);
// maximum number between n1 and n2 is stored in max
max = (n1 > n2) ? n1 : n2;
while (1) {
if (max % n1 == 0 && max % n2 == 0) {
printf("%d",max);
break;
}
++max;
}
return 0;
}
Greatest_Number_of_Candies
#include<stdio.h>
int main()
{
int n;
scanf("%d",&n);
int a[n],i,check;
for(i=0;i<n;i++)
{
scanf("%d",&a[i]);
}
int x,s=0;
scanf("%d",&x);
int max=a[0];
for(i=0;i<n;i++)
{
if(a[i]>max)
{
max=a[i];
}
}
for(i=0;i<n;i++)
{
check=0;
check=a[i]+x;
if(check>=max)
{
printf("True ");
}
else
{
printf("False ");
}
}
}
Unique_number
#include<stdio.h>
int main()
{
int n,i;
scanf("%d",&n);
int a[100],c=0,r,flag=1;
while(n!=0)
{
r=n%10;
a[c]=r;
n=n/10;
c++;
}
for(i=0;i<c;i++)
{
for(int j=i+1;j<c;j++)
{
if(a[i]==a[j])
{
flag=0;
}
}
}
if(flag==1)
{
printf("Unique Number");
}
else
{
printf("Not Unique Number");
}
}
SUM OF GIVEN NUMBERS
#include<stdio.h>
int main(){
int n,a,b;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d%d",&a,&b);
printf("%d\n",a+b);
}
return 0;
}
PHONE_NUMBER_VALIDATION
#include<stdio.h>
int main()
{
long int a,b;
int count=0,i;
scanf("%ld",&a);
b=a;
for(i=0;a>0;i++)
{
count++;
a=a/10;
}
if(count==10)
{
if(b/1000000000==0)
printf("Invalid");
else
printf("Valid");
}
else
printf("Invalid");
}
Ugly Number
# include <stdio.h>
# include <string.h>
int main()
{
int n,x=0;
scanf("%d",&n);
if (n <= 0) {
}
while (n != 1)
{
if (n % 5 == 0)
{
n /= 5;
}
else if (n % 3 == 0)
{
n /= 3;
}
else if (n % 2 == 0)
{
n /= 2;
}
else
{
printf("Not Ugly Number");
x = 1;
break;
}
}
if (x==0)
{
printf("Ugly Number");
}
}
PRIME NUMBER
#include<stdio.h>
int main(){
int n,count=0;
scanf("%d",&n);
for(int i=1;i<n;i++)
if(n%i==0)
count++;
if (count==1)
printf("prime");
else
printf("not a prime");
return 0;
}
PERFECT SQUARE ROOT OR NOT
#include<stdio.h>
#include<math.h>
int main(){
int n,a;
scanf("%d",&n);
a=int(sqrt(n));
if (n==a*a)
printf("True");
else
printf("False");
return 0;
}
Reverse of Numbers
#include <stdio.h>
int main() {
int n, rev = 0, remainder;
scanf("%d", &n);
while (n != 0) {
remainder = n % 10;
rev = rev * 10 + remainder;
n /= 10;
}
printf("%d", rev);
return 0;
}
Largest Digit
#include<stdio.h>
int main ()
{
int num, remider, Largest= 0;
scanf ("%d", &num);
while (num > 0)
{
remider = num % 10;
if (Largest < remider)
{
Largest = remider;
}
num = num / 10;
}
printf ("%d", Largest);
return 0;
}
Happy Number
#include<stdio.h>
#include<math.h>
main()
{
int i,j,num,temp,sum=0;
scanf("%d",&num);
while(sum!=1 && sum!=4)
{
sum=0;
while(num>0)
{
j=num%10;
sum+=(j*j);
num=num/10;
}
num=sum;
}
if(sum==1)
printf("True");
else
printf("False");
}
Adam number
#include <stdio.h>
#include <math.h>
int rev(int);
int power(int);
int sqroot(int);
main()
{
int n,r1=0,r2=0,sq=0,p=0;
scanf("%d",&n);
p=power(n);
r1=rev(p);
sq=(int)sqroot(r1);
r2=rev(sq);
if(n==r2)
printf("True");
else
printf("False");
}
int power(int n)
{
int p;
p=n*n;
}
int sqroot(int n)
{
int sq=0;
sq=(int)sqrt(n);
return sq;
}
int rev(int n)
{
int temp=0,r=0,t=0;
temp=n;
while(temp>0)
{
r=temp%10;
t=t*10+r;
temp=temp/10;
}
return t;
}
Fibonacci_or_not
#include<stdio.h>
int main()
{
int n,a,b,c;
scanf("%d",&n);
a=0;
b=1;
if(n==0)
printf("True");
c=a+b;
while(c<n)
{
c=a+b;
a=b;
b=c;
}
if(c==n)
{
printf("True");
}
else
{
printf("False");
}
}
fibonacci
#include<stdio.h>
int main()
{
int n1=0,n2=1,n3,i,num;
scanf("%d",&num);
printf("0 1");
for(i=2;i<num;++i)
{
n3=n1+n2;
printf(" %d",n3);
n1=n2;
n2=n3;
}
return 0;
}
Disarium number
#include<stdio.h>
#include<math.h>
int main()
{
int num;
scanf("%d",&num);
int num1=num,c=0;
while(num1!=0)
{
num1/=10;
c++;
}
num1=num;
int sum=0;
while(num1!=0)
{
int rem=num1%10;
sum+=pow(rem,c);
num1/=10;
c--;
}
if(sum==num)
printf("True");
else
printf("False");
return 0;
}
Abundant_Numbers
#include<stdio.h>
int main()
{
int num,i;
scanf("%d",&num);
int sum=0;
for( i=1;i<num;i++)
{
if(num%i==0)
{
sum=sum+i;
}
}
if(sum>num)
printf("True");
else
printf("False");
}
Palindrome
#include<stdio.h>
int main()
{
int n,r,sum=0,temp;
scanf("%d",&n);
temp=n;
while(n>0)
{
r=n%10;
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
printf("True");
else
printf("False");
return 0;
}
Tables
#include<stdio.h>
int main()
{
int a,b,m,n;
scanf("%d",&b);
scanf("%d",&n);
for(a=1;a<=n;a++)
{
if(a%2==1)
{
m=b*a;
printf("%d x %d = %d
",b,a,m);
}
}
return 0;
}
Predict_the_winner_in_Coin_Game
#include<stdio.h>
int main()
{
int m,n;
scanf("%d%d",&m,&n);
if(m%2==0 || n%2==0)
{
printf("Player 1");
}
else
{
printf("Player 2");
}
}
Count_number_of_ways_to_cover_a_distance
#include<stdio.h>
int fun(int n)
{
if(n<0)
{
return 0;
}
if(n==0)
{
return 1;
}
return fun(n-1)+fun(n-2)+fun(n-3);
}
int main()
{
int n;
scanf("%d",&n);
printf("%d",fun(n));
}
