TCS NQT

Armstrong_Number_Or_Not.cpp

@@ -0,0 +1,33 @@
+#include <iostream>
+#include <math.h>
+using namespace std;
+
+int count = 0, sum = 0, digit;
+
+int count_digit(int n)
+{
+    if(n >= 10)
+       count_digit(n / 10);
+    int digit = n%10;
+    count++;
+    return count;
+}
+
+bool each_digit(int n)
+{
+    if(n >= 10)
+       each_digit(n / 10);
+    int digit = n%10;
+    sum = sum + pow(digit, count);
+    if(sum == n)
+        return true;
+    return false;
+}
+
+int main() 
+{
+   int n;
+   cin >> n;
+   count_digit(n);
+   each_digit(n) ? cout << "ARMSTRONG" : cout << "NOT AN ARMSTRONG";
+}

Centigrade_to_Fahrenheit.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+#include <bits/stdc++.h>
+using namespace std;
+
+int main() 
+{
+   int cel;
+   float F;
+   cin >> cel;
+   F = ((cel*1.8)+32);
+   cout << fixed << setprecision(2) << F;
+}

Perfect_Square.cpp

@@ -0,0 +1,16 @@
+#include <iostream>
+using namespace std;
+
+bool perfectSquare(int n){
+    for (int i=1; i<=n; i++)
+       if((i*i) == n)
+            return true;
+       return false; 
+}
+
+int main() 
+{
+   int n;
+   cin >> n;
+   perfectSquare(n) ? cout << "YES" : cout << "NO";
+}

Strong_Number.cpp

@@ -16,7 +16,6 @@ bool print_each_digit(int x)
        print_each_digit(x / 10);
 
     int digit = x%10;
-    //cout << digit << endl;
     sum = sum + fact(digit);
     if(sum == x) {
         return true;

Sum_Of_Prime_Numbers.cpp

@@ -0,0 +1,27 @@
+#include <iostream>
+using namespace std;
+
+bool isPrime(int k) {
+    for (int i=2; i<k; i++)
+        if(k%i == 0) 
+            return false;
+        return true;
+}
+
+int main() 
+{
+   int l, u, sum=0;
+   cin >> l;
+   cin >> u;
+   if(l!=0){
+        for (int k=(l+1); k<u; k++){
+            isPrime(k) ? sum = sum + k : sum = sum;
+        }
+        cout << sum;
+   } else if(l==0) {
+       for (int k=(l+1); k<u; k++){
+            isPrime(k) ? sum = sum + k : sum = sum;
+        }
+        cout << sum-1;
+   }
+}