added stl code

Author: prateek27

.DS_Store

@@ -2,28 +2,24 @@
 using namespace std;
 
 
-int main(){	
+int main() {
 
 	//Check if a given number is Prime
 	int n;
-	cin>>n;
+	cin >> n;
 
 	int i;
 
-	for(i=2;i<=n-1;i++){
-		if(n%i==0){
-			cout<<n <<"is not Prime"<<endl;
+	for (i = 2; i <= n - 1; i++) {
+		if (n % i == 0) {
+			cout << n << "is not Prime" << endl;
 			break;
 		}
 	}
 	//Remember this check is important
-	if(i==n){
-		cout<<n <<" is prime!"<<endl;
+	if (i == n) {
+		cout << n << " is prime!" << endl;
 	}
 
-
-
-
-
 	return 0;
 }

03 Programming Fundamentals-II/prime_number.cpp

@@ -0,0 +1,21 @@
+#include<iostream>
+using namespace std;
+
+int findZeroes(int n) {
+	int ans = 0;
+	for (int D = 5; n / D >= 1; D = D * 5) {
+		ans += n / D;
+	}
+	return ans;
+}
+
+int main() {
+
+	long long int n;
+	cin >> n;
+
+	cout << findZeroes(n) << endl;
+
+
+	return 0;
+}

10DaysOfCode/2_trailing_zeroes

@@ -0,0 +1,37 @@
+#include<iostream>
+using namespace std;
+
+
+#define ll long
+
+ll a[1000005], pre[1000005];
+
+int main() {
+
+	int t;
+	cin >> t;
+	while (t--) {
+		int n;
+		cin >> n;
+		memset(pre, 0, sizeof(pre));
+
+		pre[0] = 1;
+		//read the input
+		int sum = 0;
+		for (int i = 0; i < n; i++) {
+			cin >> a[i];
+			sum += a[i];
+			sum %= n;
+			sum = (sum + n) % n;
+			pre[sum]++;
+		}
+		ll ans = 0;
+		for (int i = 0; i < n; i++) {
+			int m = pre[i];
+			ans += (m) * (m - 1) / 2;
+		} di
+		cout << ans << endl;
+	}
+
+	return 0;
+}

10DaysOfCode/2_trailing_zeroes.cpp

@@ -0,0 +1,82 @@
+#include<iostream>
+using namespace std;
+
+
+
+
+int main() {
+
+	int n;
+	cin >> n;
+
+	//print pattern
+	//First Component
+	cout << "*";
+	for (int i = 1; i <= (n - 3) / 2; i++) {
+		cout << " ";
+	}
+	for (int i = 1; i <= (n + 1) / 2; i++) {
+		cout << "*";
+	}
+	cout << endl;
+
+	//Second Component
+	for (int rows = 1; rows <= (n - 3) / 2; rows++) {
+		cout << "*";
+		//spaces
+		for (int i = 1; i <= (n - 3) / 2; i++) {
+			cout << " ";
+		}
+		cout << "*" << endl;
+	}
+
+	// Third Component
+	for (int i = 1; i <= n; i++) {
+		cout << "*";
+	}
+	cout << endl;
+
+	//Fourth Component
+	for (int rows = 1; rows <= (n - 3) / 2; rows++) {
+
+		//spaces
+		for (int i = 1; i <= (n - 3) / 2 + 1; i++) {
+			cout << " ";
+		}
+
+
+		//star
+		cout << "*";
+
+		//spaces
+		for (int i = 1; i <= (n - 3) / 2; i++) {
+			cout << " ";
+		}
+
+		//star
+		cout << "*" << endl;
+
+	}
+
+	//fifth component
+	//stars
+	for (int i = 1; i <= (n + 1) / 2; i++) {
+		cout << "*";
+	}
+
+	//spaces
+	for (int i = 1; i <= (n - 3) / 2; i++) {
+		cout << " ";
+	}
+
+
+	//single star
+	cout << "*" << endl;
+
+
+
+
+	return 0;
+
+
+}

10DaysOfCode/div_subarrays

@@ -0,0 +1,60 @@
+#include<iostream>
+using namespace std;
+
+void magical_park(char a[][100], int m, int n, int k, int s) {
+
+
+	//piyush can get out of the mark
+	bool success = true;
+
+	for (int i = 0; i < m; i++) {
+		for (int j = 0; j < n; j++) {
+			char ch = a[i][j];
+
+			//check
+			if (s < k) {
+				success = false;
+				break;
+			}
+			if (ch == '*') {
+				s += 5;
+			}
+			else if (ch == '.') {
+				s -= 2;
+			}
+			else {
+				break;
+			}
+			//we also loose 1 point when we move right except for the last column
+			if (j != n - 1) {
+				s--;
+			}
+		}
+	}
+	if (success) {
+		cout << "Yes" << endl;
+		cout << s << endl;
+	}
+	else {
+		cout << "No" << endl;
+	}
+}
+
+
+int main() {
+
+	int m, n, k, s;
+	cin >> m >> n >> k >> s;
+
+
+	char park[100][100];
+	//Take Input
+	for (int i = 0; i < m; i++) {
+		for (int j = 0; j < n; j++) {
+			cin >> park[i][j];
+		}
+	}
+	magical_park(park, m, n, k, s);
+
+	return 0;
+}

10DaysOfCode/div_subarrays.cpp

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

10DaysOfCode/ganesha

@@ -0,0 +1,67 @@
+#include<iostream>
+using namespace std;
+
+#define ll long long
+
+//Naive Approach O(sqrtN)
+bool isPrime(int n) {
+	if (n == 1) {
+		return false;
+	}
+	if (n == 2) {
+		return true;
+	}
+	for (int i = 2; i * i < n; i++) {
+		if (n % i == 0)
+			return false;
+	}
+	return true;
+}
+
+//Sieve Approach - Generate a array containing prime Numbers
+void prime_sieve(int *p) {
+
+	//first mark all odd number's prime
+	for (int i = 3; i <= 1000000; i += 2) {
+		p[i] = 1;
+	}
+
+	// Sieve
+	for (ll i = 3; i <= 1000000; i += 2) {
+		//if the current number is not marked (it is prime)
+		if (p[i] == 1) {
+			//mark all the multiples of i as not prime
+			for (ll j = i * i; j <= 1000000; j = j + i ) {
+				p[j] = 0;
+			}
+		}
+
+	}
+	//special case
+	p[2] = 1;
+	p[1] = p[0] = 0;
+
+}
+
+
+
+int main() {
+
+	int n;
+	cin >> n;
+
+	int p[1000005] = {0};
+	prime_sieve(p);
+
+	//lets print primes upto range n
+	for (int i = 0; i <= n; i++) {
+		if (p[i] == 1) {
+			cout << i << " ";
+		}
+	}
+
+
+
+
+	return 0;
+}

10DaysOfCode/ganesha.cpp

@@ -0,0 +1,58 @@
+#include<iostream>
+using namespace std;
+
+#define ll long long
+
+
+//Sieve Approach - Generate a array containing prime Numbers
+void prime_sieve(int *p) {
+
+	//first mark all odd number's prime
+	for (int i = 3; i <= 1000000; i += 2) {
+		p[i] = 1;
+	}
+
+	// Sieve
+	for (ll i = 3; i <= 1000000; i += 2) {
+		//if the current number is not marked (it is prime)
+		if (p[i] == 1) {
+			//mark all the multiples of i as not prime
+			for (ll j = i * i; j <= 1000000; j = j + i ) {
+				p[j] = 0;
+			}
+		}
+
+	}
+	//special case
+	p[2] = 1;
+	p[1] = p[0] = 0;
+
+}
+
+
+
+int main() {
+
+	int p[1000005] = {0};
+	prime_sieve(p);
+
+
+	int csum[1000005] = {0};
+
+	//precompute the primes upto an index i
+
+	for (int i = 1; i <= 1000000; i++) {
+		csum[i] = csum[i - 1] + p[i];
+	}
+	int q;
+	cin >> q;
+	while (q--) {
+		int a, b;
+		cin >> a >> b;
+		cout << csum[b] - csum[a - 1] << endl;
+
+	}
+
+
+	return 0;
+}