MoreOfGettingStarted

5 more solutions of getting started

IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/CountDigitsInANumber.cpp

@@ -0,0 +1,12 @@
+#include <iostream>
+using namespace std;
+
+int main(int argc, char **argv){
+    int n,count=0;
+    cin >> n;
+   while(n!=0){
+   n=n/10;
+   count++;}
+   cout<<count;
+    return 0;
+}

IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/IsANumberPrime.cpp

@@ -0,0 +1,21 @@
+#include <iostream>
+using namespace std;
+int main(int argc, char **argv){
+    int t,n;
+    cin >> t;
+    for (int i = 0; i < t; i++){
+    cin >> n;
+    int c = 2;
+    while (c*c <= n){
+    if (n%c == 0)
+    break;
+    c++;
+    }
+    if (c * c > n){
+    cout << "prime" << endl;
+    }
+    else{
+    cout << "not prime" << endl;
+    }
+    }
+}

IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/PrintAllPrimesTillN.cpp

@@ -0,0 +1,23 @@
+#include <iostream>
+using namespace std;
+int main(int argc, char **argv){
+    int low, high,i,j,c;
+    cin >> low >> high;
+    for(i=low;i<=high;i++)
+{
+ if(i==1||i==0) 
+ continue;
+ c=1;
+ for(j=2;j<=i/2;j++)
+ {
+    if(i%j==0)
+    {
+    c=0;
+    break;
+    }
+ }
+if(c==1)
+cout<<i<<"\n";
+}
+ return 0;
+ }

IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/PrintFibonacciNumbersTillN.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+using namespace std;
+
+int main(int argc, char **argv)
+{
+    int n,a=0,b=1,c;
+    cin >> n;
+    for(int i=0;i<n;i++){
+    cout<<a<<endl;
+    c=a+b;
+    a=b;
+    b=c;
+    }
+    return 0;
+}

IOT/tansin25_TanmaySingh_2125csit1072_2/GettingStarted/ReverseANumber.cpp

@@ -0,0 +1,13 @@
+#include <iostream>
+using namespace std;
+
+int main(int argc, char **argv){
+    int n,c;
+    cin >> n;
+  while(n!=0){
+    c=n%10;
+    cout<<c<<endl;
+    n=n/10;
+  }
+ return 0;  
+}