added programs of Operators and for loop

Author: thatsabhishek

README.md

@@ -26,6 +26,10 @@ This repo includes:
     - [Star Pattern](./milestone1/pattern2/StarPattern.cpp)
     - [Triangle of Numbers](./milestone1/pattern2/TriangleofNumbers.cpp)
     - [Diamond of Stars](./milestone1/pattern2/Diamondofstars.cpp)
+  - [Operators and For Loop](./milestone1/operatorsandforloop/)
+    - [Nth Fibonacci Number](./milestone1/operatorsandforloop/NthFibonacciNumber.cpp)
+    - [All Prime Numbers](./milestone1/operatorsandforloop/AllPrimeNumbers.cpp)
+    - [Count Characters](./milestone1/operatorsandforloop/CountCharacters.cpp)
 
 # Coding Ninjas
 ## Rate my Repo ⭐!!!

milestone1/operatorsandforloop/AllPrimeNumbers.cpp

@@ -0,0 +1,21 @@
+// Given an integer N, print all the prime numbers that lie in the range 2 to N (both inclusive).
+// Print the prime numbers in different lines.
+
+#include <iostream>
+using namespace std;
+
+int main(){
+	int n;
+	cin>>n;
+	for (int i=2; i <= n; i++){
+		bool prime = false;
+		for(int j=2; j < i; j++){
+                if (i % j == 0) {
+                    prime = true;
+                    break;
+                }
+        }
+		if (!prime)
+		    cout<<i<<endl;
+	}
+}

milestone1/operatorsandforloop/CountCharacters.cpp

@@ -0,0 +1,22 @@
+// Write a program to count and print the total number of characters (lowercase english alphabets only), digits (0 to 9) and white spaces (single space, tab i.e. '\t' and newline i.e. '\n') entered till '$'.
+// That is, input will be a stream of characters and you need to consider all the characters which are entered till '$'.
+// Print count of characters, count of digits and count of white spaces respectively (separated by space).
+
+#include<iostream>
+using namespace std;
+
+int main(){
+	char c;
+	c = cin.get();
+	int cc = 0, cd = 0, cs = 0;
+	while (c != '$'){
+		if (c >= 'a' && c <= 'z')
+			cc++;
+		else if (c >= '0' && c <= '9')
+			cd++;
+		else if (c == ' ' || c == '\n' || c == '\t')
+			cs++;
+		c = cin.get();
+	}
+	cout<<cc<<' '<<cd<<' '<<cs<<endl;
+}

milestone1/operatorsandforloop/NthFibonacciNumber.cpp

@@ -0,0 +1,21 @@
+// Nth term of Fibonacci series F(n), where F(n) is a function, is calculated using the following formula -
+//     F(n) = F(n-1) + F(n-2), 
+//     Where, F(1) =  1, 
+//            F(2) = 1
+// Provided N you have to find out the Nth Fibonacci Number.
+
+#include<iostream>
+using namespace std;
+
+int fib(int n){
+        if (n <=1)
+            return n;
+        else
+            return fib(n-1)+fib(n-2);
+}
+
+int main(){
+        int n;
+        cin>>n;
+        cout<<fib(n)<<endl;
+}