cp

Author: Hard-Coder05

CF1.cpp

@@ -58,18 +58,6 @@ int fact(int n)
 	}
 	return res % MOD;
 }
-bool isPrime(int n)
-{
-	if (n == 0 || n == 1)
-		return false;
-
-	for (int i = 2; i * i <= n; i++)
-	{
-		if (n % i == 0)
-			return false;
-	}
-	return true;
-}
 //////////////////////////////////////////////////////////////////////////////
 
 void solve()

CF2.cpp

@@ -58,18 +58,6 @@ int fact(int n)
 	}
 	return res % MOD;
 }
-bool isPrime(int n)
-{
-	if (n == 0 || n == 1)
-		return false;
-
-	for (int i = 2; i * i <= n; i++)
-	{
-		if (n % i == 0)
-			return false;
-	}
-	return true;
-}
 //////////////////////////////////////////////////////////////////////////////
 
 void solve()

CF3.cpp

@@ -58,18 +58,6 @@ int fact(int n)
 	}
 	return res % MOD;
 }
-bool isPrime(int n)
-{
-	if (n == 0 || n == 1)
-		return false;
-
-	for (int i = 2; i * i <= n; i++)
-	{
-		if (n % i == 0)
-			return false;
-	}
-	return true;
-}
 //////////////////////////////////////////////////////////////////////////////
 
 void solve()

CF4.cpp

@@ -58,18 +58,6 @@ int fact(int n)
 	}
 	return res % MOD;
 }
-bool isPrime(int n)
-{
-	if (n == 0 || n == 1)
-		return false;
-
-	for (int i = 2; i * i <= n; i++)
-	{
-		if (n % i == 0)
-			return false;
-	}
-	return true;
-}
 //////////////////////////////////////////////////////////////////////////////
 
 void solve()

Contests Solutions/CF727/CF1.cpp

@@ -0,0 +1,108 @@
+/* 
+#############################################
+Author: Siddharth Mishra
+GitHub: https://github.com/Hard-Coder05
+#############################################
+*/
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+#define MOD 1000000007
+#define INF INT_MAX
+#define ll long long
+#define int long long
+#define vi vector<int>
+#define pii pair<int, int>
+#define ld long double
+#define PB push_back
+#define MP make_pair
+#define FF first
+#define SS second
+#define max(a, b) (             \
+	{                           \
+		__typeof__(a) _a = (a); \
+		__typeof__(b) _b = (b); \
+		_a > _b ? _a : _b;      \
+	})
+#define min(a, b) (             \
+	{                           \
+		__typeof__(a) _a = (a); \
+		__typeof__(b) _b = (b); \
+		_a < _b ? _a : _b;      \
+	})
+//////////////////////////////////////////////////////////////////////////////
+int power(int a, int b)
+{
+	int res = 1ll;
+	while (b > 0)
+	{
+		if (b % 2ll)
+			res = (res * a) % MOD;
+		a = (a * a) % MOD;
+		b /= 2ll;
+	}
+	return res;
+}
+int GCD(int a, int b)
+{
+	if (b == 0)
+		return a;
+	return GCD(b, a % b);
+}
+int fact(int n)
+{
+	int res = 1;
+	for (int i = 2; i <= n; i++)
+	{
+		res = (res * i) % MOD;
+	}
+	return res % MOD;
+}
+bool isPrime(int n)
+{
+	if (n == 0 || n == 1)
+		return false;
+
+	for (int i = 2; i * i <= n; i++)
+	{
+		if (n % i == 0)
+			return false;
+	}
+	return true;
+}
+//////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+	int n, x, t;
+	cin >> n >> x >> t;
+	int ans = 0;
+	if (t / x >= n)
+	{
+		cout << (n - 1) * n / 2 << endl;
+		return;
+	}
+	if (t / x < n)
+	{
+		ans += (t / x) * (n - (t / x));
+		n = t / x;
+		ans += (n - 1) * n / 2;
+		cout << ans << endl;
+	}
+}
+signed main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+#endif
+	int tc;
+	cin >> tc;
+	while (tc--)
+	{
+		solve();
+	}
+}

Contests Solutions/CF727/CF2.cpp

@@ -0,0 +1,112 @@
+/* 
+#############################################
+Author: Siddharth Mishra
+GitHub: https://github.com/Hard-Coder05
+#############################################
+*/
+#include <bits/stdc++.h>
+using namespace std;
+#define endl "\n"
+#define MOD 1000000007
+#define INF INT_MAX
+#define ll long long
+#define int long long
+#define vi vector<int>
+#define pii pair<int, int>
+#define ld long double
+#define PB push_back
+#define MP make_pair
+#define FF first
+#define SS second
+#define max(a, b) (             \
+	{                           \
+		__typeof__(a) _a = (a); \
+		__typeof__(b) _b = (b); \
+		_a > _b ? _a : _b;      \
+	})
+#define min(a, b) (             \
+	{                           \
+		__typeof__(a) _a = (a); \
+		__typeof__(b) _b = (b); \
+		_a < _b ? _a : _b;      \
+	})
+//////////////////////////////////////////////////////////////////////////////
+int power(int a, int b)
+{
+	int res = 1ll;
+	while (b > 0)
+	{
+		if (b % 2ll)
+			res = (res * a) % MOD;
+		a = (a * a) % MOD;
+		b /= 2ll;
+	}
+	return res;
+}
+int GCD(int a, int b)
+{
+	if (b == 0)
+		return a;
+	return GCD(b, a % b);
+}
+int fact(int n)
+{
+	int res = 1;
+	for (int i = 2; i <= n; i++)
+	{
+		res = (res * i) % MOD;
+	}
+	return res % MOD;
+}
+bool isPrime(int n)
+{
+	if (n == 0 || n == 1)
+		return false;
+
+	for (int i = 2; i * i <= n; i++)
+	{
+		if (n % i == 0)
+			return false;
+	}
+	return true;
+}
+//////////////////////////////////////////////////////////////////////////////
+
+void solve()
+{
+	int n, q;
+	cin >> n >> q;
+	string s;
+	cin >> s;
+	int arr[n];
+	for (int i = 0; i < n; i++)
+		arr[i] = ((s[i] - 'a') + 1);
+	for (int i = 1; i < n; i++)
+		arr[i] += arr[i - 1];
+	while (q--)
+	{
+		int l, r;
+		cin >> l >> r;
+		l--;
+		r--;
+		int left = (l == 0) ? 0 : arr[l - 1];
+		int right = arr[r];
+		cout << right - left << endl;
+	}
+}
+signed main()
+{
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+	cout.tie(NULL);
+#ifndef ONLINE_JUDGE
+	freopen("input.txt", "r", stdin);
+	freopen("output.txt", "w", stdout);
+#endif
+	int tc = 1;
+	//cin >> tc;
+	while (tc--)
+	{
+		solve();
+	}
+}