Manjari_day1

Abundant_number_q23.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+  int n;
+  cin>>n;
+  int sum = 0 ;
+  for(int i = 1;i<n ;i++)
+  {
+    if(n%i==0)
+    {
+      sum+=i;
+    }
+  }
+  if(sum>n)
+  {
+    cout<<"Its a Abundant number";
+  }else{
+    cout<<"its not a Abundant number";
+  }
+}

Automorphic_number_q21.cpp

@@ -0,0 +1,23 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+  int n;
+  cin>>n;
+  int s = n*n;
+  int temp = n;
+  int c = 0;
+  while(temp !=0)
+  {
+    temp /= 10;
+    c++;
+  }
+  int k = s % (int)pow(10,c);
+  if(k == n)
+  {
+    cout<<"its a Automorphic number";
+  }else{
+    cout<<"its not a Automorphic number";
+  }
+}

Factorial_of_a_Number_q15.cpp

@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+int fact(int n)
+{
+  if(n<=1)
+  return 1;
+  return n * fact(n-1);
+}
+int main()
+{
+    int n;
+    cin >> n;
+    cout<<fact(n);
+
+}

Harshad_number_q22.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+  int n;
+  cin>>n;
+  int temp = n;
+  int c = 0;
+  while(temp !=0)
+  {
+    c +=temp%10;
+    temp /= 10;
+  }
+  if(n%c ==0)
+  {
+    cout<<"its a Harshad number";
+  }else{
+    cout<<"its not a Harshad number";
+  }
+}

ManjariNK_even_or_odd_q4.cpp

@@ -0,0 +1,9 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int num;
+    cin>>num;
+    num%2==0 ? cout<<"Even":cout<<"Odd";
+    return 0;
+}

ManjariNK_positiveornegative_q2.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int number;
+    cin>>number;
+    if(number>0)
+    {
+        cout<<"The number is Positive";
+    }
+    else if(number<0)
+    {
+        cout<<"The number is Negative";
+    }
+    else{
+        cout<<"The number is Zero";
+    }
+}

ManjariNK_sum_of_naturalNumbers_inRange_q5.cpp

@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int num1;
+    int num2;
+    cin>>num1>>num2;
+    int sum=0;
+    for(int i=num1;i<num2;i++)
+    {
+        sum+=i;
+    }
+    cout<<sum;
+}

ManjariNK_sumofdigits_q7.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+
+int main() 
+{
+    int num;
+    cin>>num;
+   int temp=num,sum=0;
+   while(temp!=0)
+   {
+     sum+=temp%10;
+     temp/=10;
+   }
+   cout<<sum;
+return 0;
+}

ManjariNK_sumofnaturalnumbers_q1.cpp

@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int num;
+    int sum=0;
+    cin>>num;
+    for(int i=1;i<=num;i++)
+    {
+        sum+=i;
+    }
+    cout<<sum;
+
+}

Manjari_leapyear_q6.cpp

@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+int main()
+{
+    int year;
+    cin>>year;
+    if((year%4==0 && year%100!=0) || (year%400==0))
+    {
+        cout<<year<<" is leap year";
+    }
+    else{
+        cout<<year<<" is not leap year";
+    }
+    return 0;
+}

Nth_Term_of_the_Fibonacci_Series_q14.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n;
+
+    int a = 0, b = 1;
+
+    for(int i = 1; i < n; i++)
+    {
+        int next = a + b;
+        a = b;
+        b = next;
+    }
+    cout << a << " ";
+}

add_2fractions_q37.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int gcd(int a , int b)
+{
+  if(b==0)
+  return a;
+  return gcd(b , a%b);
+}
+int main()
+{
+ int a , b, c, d;
+ cin>>a>>b>>c>>d;
+ int lcm = b*d/gcd(b,d);
+ int x ;
+   x = a*(lcm/b) + c*(lcm/d);
+   int g =gcd(x , lcm);
+  x=x/g;
+  lcm=lcm/g;
+ cout<<x<<"/"<<lcm;
+}

armstrong_in_give_range_q11.cpp

@@ -0,0 +1,44 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+bool armstrong(int n)
+{
+  int temp = n;
+  int c=0;
+  if (n < 0) {
+        return false;
+    }
+  while(temp!=0)
+  {
+    temp /= 10;
+    c++;
+  }
+  if (n == 0) c = 1;
+  temp=n;
+  int a=0;
+  while(temp!=0)
+  {
+    int k = temp%10;
+    a=a+(int)pow(k,c);
+    temp /=10;
+  }
+  if(a==n){
+    return true;
+  }else{
+    return false;
+  }
+}
+int main()
+{
+  int n , m;
+  cin>>n>>m;
+  for(int i=n;i<m ;i++)
+  {
+    if(armstrong(i))
+    {
+      cout<<i<<" ";
+    }
+  }
+
+
+}

armstrong_q12.cpp

@@ -0,0 +1,33 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+  int n;
+  cin>>n;
+  int temp = n;
+  int c =0;
+  if (n < 0) {
+        cout << "Its not an armstrong number";
+        return 0;
+    }
+  while(temp!=0)
+  {
+    temp /= 10;
+    c++;
+  }
+  if (n == 0) c = 1;
+  temp=n;
+  int a=0;
+  while(temp!=0)
+  {
+    int k = temp%10;
+    a=a+pow(k,c);
+    temp /=10;
+  }
+  if(a==n){
+    cout<<"Its a armstrong number";
+  }else{
+    cout<<"its not an armstrong number";
+  }
+}

binary_to_decimal_q28.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+  int n;
+  cin>>n;
+  int temp = n;
+  int sum =0;
+  int c=0;
+  while(temp !=0)
+  {
+    sum += (temp%10) * pow(2,c++);
+    temp /=10;
+  }
+  cout<<sum;
+}

coordinate_lies_q34.cpp

@@ -0,0 +1,23 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int x, y;
+    cin >> x >> y;
+
+    if(x > 0 && y > 0)
+        cout << "1st Quadrant";
+    else if(x < 0 && y > 0)
+        cout << "2nd Quadrant";
+    else if(x < 0 && y < 0)
+        cout << "3rd Quadrant";
+    else if(x > 0 && y < 0)
+        cout << "4th Quadrant";
+    else if(x == 0 && y == 0)
+        cout << "Origin";
+    else if(x == 0)
+        cout << "Y-axis";
+    else
+        cout << "X-axis";
+}

decimal_to_binary_q31.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+ int n;
+ cin>>n;
+ int temp =n;
+ int bi =0;
+ int c=0;
+ while(temp!=0)
+ {
+   bi=bi+(temp%2)*pow(10,c++);
+   temp/=2;
+ }
+ cout<<bi;
+}

decimal_to_hexadecimal_q33.cpp

@@ -0,0 +1,22 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main()
+{
+ int n;
+ cin>>n;
+ int temp =n;
+ string bi="";
+ while(temp!=0)
+ {
+   int k = (temp%16);
+   if(k>=10)
+   {
+     bi= (char)(k+55)+bi;
+   }else{
+   bi=char(k +'0')+bi;
+   }
+   temp/=16;
+ }
+ cout<<bi;
+}