Nusarat_daily_practice_questions

.gitignore

@@ -0,0 +1 @@
+*.exe

Nusarat_10PrimeRange.cpp

@@ -0,0 +1,11 @@
+#include<iostream>
+using namespace std;
+
+int main(){
+    int n;
+    cin>>n;
+
+    if(n<2){
+
+    }
+}

Nusarat_14ArmstrongRange.cpp

@@ -0,0 +1,29 @@
+#include <iostream>
+#include <cmath>
+using namespace std;
+
+int main() {
+    int start, end;
+    cin >> start >> end;
+
+    for (int num = start; num <= end; num++) {
+        int temp = num, sum = 0, digits = 0;
+
+        int t = num;
+        while (t != 0) {
+            digits++;
+            t /= 10;
+        }
+
+        while (temp != 0) {
+            int digit = temp % 10;
+            sum += pow(digit, digits);
+            temp /= 10;
+        }
+
+        if (sum == num)
+            cout << num << " ";
+    }
+
+    return 0;
+}

Nusarat_Abundant23.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int main (){
+    int n,sum=0;
+    cin>>n;
+    for(int i=1;i<=n/2;i++){
+        if(n%i==0)
+        sum+=i;
+    }
+
+    if(sum>n)
+    cout<<"Abundant number: "<<n;
+    else
+    cout<<"Not a Abundant number ";
+    return 0;
+
+}

Nusarat_Armstrong13.cpp

@@ -0,0 +1,24 @@
+#include<iostream>
+#include<cmath>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int digit,sum=0,count=0;
+    int temp=n;
+
+    while(temp!=0){
+        count++;
+        temp/=10;    
+    }
+    temp=n;
+    while (temp != 0) {
+        digit = temp % 10;
+        sum += pow(digit, count);
+        temp /= 10;
+    }
+    if(sum==n)
+    cout<<"Armstrong Number";
+    else
+    cout<<"Not armstrong";
+}

Nusarat_Automorphic_20.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int temp=n;
+    long long int s=n*n;
+    while(temp !=0){
+        if(temp%10 != s%10){
+            cout<<"Not a Automorphic Number";
+            return 0;
+        }
+        temp/=10;
+        s/=10;
+    }
+    cout<<"Number is Automorphic Number";
+    return 0;
+}

Nusarat_EvenOdd01.cpp

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

Nusarat_Factorial16.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int fact=1;
+    for(int i=1;i<=n;i++){
+        fact*=i;
+    }
+    cout<<"Factorial of N Number is: "<<fact;
+
+    return 0;
+}

Nusarat_Fibonacci15.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int fiboFibonacci (int x){
+    if(x==0 || x==1){
+        return 1;
+    }
+    return fiboFibonacci(x-1)+fiboFibonacci(x-2);
+}
+int main(){
+    int n;
+    cin>>n;
+
+    for(int i=0;i<n;i++){
+        cout<<fiboFibonacci(i)<<" ";
+    }
+
+}

Nusarat_GreatestOf2Num06.cpp

@@ -0,0 +1,8 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int a,b;
+    cin>>a>>b;
+    (a>b)?cout<<"Greatest Number is: "<<a :cout<<"Greatest Number is: "<<b ;
+    return 0;
+}

Nusarat_GreatestOf3Num07.cpp

@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int a,b,c;
+    cin>>a,b,c;
+    if(a>b && a>c)
+        cout<<"A is the greates Number";
+    else if(b>a && b>c)
+        cout<<"B is the greates Number";
+    else
+        cout<<"C is the greates Number";
+
+        return 0;
+
+    }

Nusarat_HCF24.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+using namespace std;
+
+int hcf(int a, int b) {
+    while (b != 0) {
+        int rem = a % b;
+        a = b;
+        b = rem;
+    }
+    return a;
+}
+
+int main() {
+    int a, b;
+    cin >> a >> b;
+
+    cout << "HCF = " << hcf(a, b);
+    return 0;
+}

Nusarat_Harshad21.cpp

@@ -0,0 +1,19 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+
+    int temp=n,sum=0;
+    while(n!=0){
+        sum+=n%10;
+        n/=10;
+
+    }
+    if (n % sum == 0)
+        cout << "Harshad Number";
+    else
+        cout << "Not a Harshad Number";
+
+    return 0;
+}

Nusarat_NthFibonacci16.cpp

@@ -0,0 +1,15 @@
+#include<iostream>
+using namespace std;
+int Fibonacci(int x){
+    if(x==0 || x==1)
+    return 1;
+
+    return Fibonacci(x-1)+Fibonacci(x-2);
+}
+int main(){
+    int n;
+    cin>>n;
+    int s=Fibonacci(n);
+    cout<<"Nth of Fibonacci is: "<<s;
+    return 0;
+}

Nusarat_Palindrome12.cpp

@@ -0,0 +1,16 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int rev=0,s=n;
+    while(n!=0){
+        rev=n%10+rev*10;
+        n/=10;
+    }
+    if(rev==s){
+        cout<<"Palindrome Number: "<<s;
+    }
+    else
+    cout<<"Not a palindrome: "<<s;
+}

Nusarat_PerfectNum23.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n,sum=0;
+    cin>>n;
+    for(int i=1;i<=n/2;i++){
+        if(n%i==0)
+        sum+=i;
+    }
+
+    if(sum==n)
+        cout<<"Perfect Square: "<<n;
+
+    else 
+    cout<<"Not a perfect square";
+
+    return 0;
+}

Nusarat_PerfectNum_19.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    int n;
+    cin >> n;
+
+    int sum = 0;
+    for (int i = 1; i <= n / 2; i++) {
+        if (n % i == 0)
+            sum += i;
+    }
+
+    if (sum == n && n != 0)
+        cout << "Perfect Number";
+    else
+        cout << "Not a Perfect Number";
+
+    return 0;
+}

Nusarat_PerfectSquare22.cpp

@@ -0,0 +1,17 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int i=1;
+    while (i * i <= n) {
+        if (i * i == n) {
+            cout << "Perfect Square: "<<i;
+            return 0;
+        }
+        i++;
+    }
+
+    cout << "Not a Perfect Square";
+    return 0;
+}

Nusarat_StrongNum18.cpp

@@ -0,0 +1,28 @@
+#include <iostream>
+using namespace std;
+
+int factorial(int n) {
+    int fact = 1;
+    for (int i = 1; i <= n; i++)
+        fact *= i;
+    return fact;
+}
+
+int main() {
+    int n, temp, sum = 0;
+    cin >> n;
+
+    temp = n;
+    while (temp != 0) {
+        int digit = temp % 10;
+        sum += factorial(digit);
+        temp /= 10;
+    }
+
+    if (sum == n)
+        cout << "Strong Number";
+    else
+        cout << "Not a Strong Number";
+
+    return 0;
+}

Nusarat_SumDigit11.cpp

@@ -0,0 +1,14 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n;
+    cin>>n;
+    int sum=0;
+
+    while(n!=0){
+        sum+=n%10;
+        n/=10;
+    }
+    cout<<"Sum of digits: "<<sum;
+    return 0;
+}

Nusarat_SumNnum03.cpp

@@ -0,0 +1,11 @@
+#include<iostream>
+using namespace std;
+ int main(){
+    int n,sum=0;
+    cin>>n;
+    for(int i=1;i<=n;i++){
+        sum+=i;
+    }
+    cout<<"Sum of First N natural numbers: "<<sum;
+    return 0;
+ }

Nusarat_SumRange05.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+int main(){
+    int n,m,sum=0;
+    cin>>n>>m;
+    // for(int i=n;i<=m;i++){
+    //     sum+=i;
+    // }
+    // cout<<"Sum of numbers in a given range: "<<sum;
+    // return 0;
+
+    while(m!=1){
+        sum+=n;
+        n++;
+        m--;
+    }
+    cout<<sum;
+}