Solve alot of problems :3

Author: AliOsm

AtCoder/097C - K-th Substring.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+set<string> st;
+
+int main() {
+  string s;
+  cin >> s;
+  int k;
+  cin >> k;
+
+  for(char ch = 'a'; ch <= 'z'; ++ch) {
+    for(int i = 0; i < s.length(); ++i)
+      if(s[i] == ch)
+        for(int j = i + 1; j <= i + 1 + 10; ++j)
+          st.insert(s.substr(i, j - i));
+    if(st.size() >= k)
+      break;
+  }
+
+  int cnt = 1;
+  for(set<string>::iterator it = st.begin(); it != st.end(); ++it, ++cnt)
+    if(cnt == k) {
+      cout << *it << endl;
+      return 0;
+    }
+
+  return 0;
+}

AtCoder/097D - Equals.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int n, m, p[N];
+bool vis[N];
+vector<vector<int> > g;
+vector<int> cur;
+
+void DFS(int u) {
+  vis[u] = true;
+  cur.push_back(u);
+
+  for(int i = 0; i < g[u].size(); ++i)
+    if(!vis[g[u][i]])
+      DFS(g[u][i]);
+}
+
+int main() {
+  cin >> n >> m;
+  g.resize(n);
+  for(int i = 0; i < n; ++i)
+    cin >> p[i], --p[i];
+  for(int i = 0, a, b; i < m; ++i) {
+    cin >> a >> b;
+    --a, --b;
+    g[a].push_back(b);
+    swap(a, b);
+    g[a].push_back(b);
+  }
+
+  int res = 0;
+  for(int i = 0; i < n; ++i) {
+    if(!vis[i]) {
+      DFS(i);
+
+      sort(cur.begin(), cur.end());
+      for(int j = 0; j < cur.size(); ++j)
+        if(binary_search(cur.begin(), cur.end(), p[cur[j]]))
+          ++res;
+      cur.clear();
+    }
+  }
+
+  cout << res << endl;
+
+  return 0;
+}

AtCoder/README.md

@@ -18,3 +18,5 @@
 - [072B - OddString](http://abc072.contest.atcoder.jp/tasks/abc072_b)
 - [072C - Together](http://abc072.contest.atcoder.jp/tasks/arc082_a)
 - [072D - Derangement](http://abc072.contest.atcoder.jp/tasks/arc082_b)
+- [097C - K-th Substring](https://arc097.contest.atcoder.jp/tasks/arc097_a)
+- [097D - Equals](https://arc097.contest.atcoder.jp/tasks/arc097_b)

CS Academy/79. Cats and Dogs.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 2001;
+int n, m, cats[N];
+pair<int, int> a[N], b[N];
+
+long long dist(pair<int, int> a, pair<int, int> b) {
+    return (a.first - b.first) * (a.first - b.first) +
+            (a.second - b.second) * (a.second - b.second);
+}
+
+int main() {
+    cin >> n >> m;
+    for(int i = 0; i < n; ++i)
+        cin >> a[i].first >> a[i].second;
+    for(int i = 0; i < m; ++i)
+        cin >> b[i].first >> b[i].second;
+    
+    for(int i = 0; i < m; ++i) {
+        long long best = 1e18, idx;
+        for(int j = 0; j < n; ++j)
+            if(best > dist(b[i], a[j]))
+                idx = j, best = dist(b[i], a[j]);
+        ++cats[idx];
+    }
+    
+    int res = 0;
+    for(int i = 0; i < n; ++i)
+        res += cats[i] == 1;
+    
+    cout << res << endl;
+    
+    return 0;
+}

CS Academy/79. Milk and Bread.cpp

@@ -0,0 +1,15 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int a, b, c;
+    cin >> a >> b >> c;
+    
+    if(a > b)
+        swap(a, b);
+    
+    cout << min(abs(c - b) + abs(b - a), abs(c - a) + abs(b - a)) << endl;
+    
+    return 0;
+}

CS Academy/README.md

@@ -15,3 +15,5 @@
 - [49. Odd Sum](https://csacademy.com/contest/round-49/task/odd-sum)
 - [59. No Repeat](https://csacademy.com/contest/round-59/task/no-repeat)
 - [59. Triangular Matrix](https://csacademy.com/contest/round-59/task/triangular-matrix)
+- [79. Milk and Bread](https://csacademy.com/contest/round-79/task/milk-and-bread/)
+- [79. Cats and Dogs](https://csacademy.com/contest/round-79/task/cats-and-dogs/)

CodeForces/17A. Noldbach problem.cpp

@@ -0,0 +1,49 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const MAX = 1000001;
+bitset<MAX> prime;
+int n, k, primes[MAX], cnt;
+
+void sieve_of_eratosthenes() {
+	prime.set();
+
+	prime[0] = prime[1] = 0;
+	for(int i = 4; i < MAX; i += 2)
+		prime[i] = 0;
+
+	for(int i = 3; i * i < MAX; i += 2)
+		if(prime[i])
+			for(int j = i * i; j < MAX; j += (i << 1))
+				prime[j] = 0;
+
+	for(int i = 0; i < MAX; ++i)
+		if(prime[i])
+			primes[cnt++] = i;
+}
+
+int main() {
+	sieve_of_eratosthenes();
+
+	scanf("%d %d", &n, &k);
+
+	int res = 0;
+	for(int i = 0; i < cnt; ++i) {
+		if(primes[i] > n)
+			break;
+
+		for(int j = 1; j < i; ++j)
+			if(primes[j - 1] + primes[j] + 1 == primes[i]) {
+				++res;
+				break;
+			}
+	}
+
+	if(res >= k)
+		puts("YES");
+	else
+		puts("NO");
+
+	return 0;
+}

CodeForces/193A. Cutting Figure.cpp

@@ -0,0 +1,60 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 51;
+int n, m;
+int dx[] = {0, 1, 0, -1};
+int dy[] = {1, 0, -1, 0};
+char s[N][N];
+bool vis[N][N];
+
+void DFS(int i, int j) {
+    vis[i][j] = true;
+    
+    for(int k = 0, nx, ny; k < 4; ++k) {
+        nx = i + dx[k];
+        ny = j + dy[k];
+        if(nx < 0 || nx >= n || ny < 0 || ny >= m || vis[nx][ny] || s[nx][ny] == '.')
+            continue;
+        DFS(nx, ny);
+    }
+}
+
+int main() {
+    scanf("%d %d", &n, &m);
+    for(int i = 0; i < n; ++i)
+        scanf("%s", s[i]);
+    
+    int tmp = 0;
+    for(int i = 0; i < n; ++i)
+        for(int j = 0; j < m; ++j)
+            tmp += (s[i][j] == '#');
+    if(tmp <= 2) {
+        puts("-1");
+        return 0;
+    }
+    
+    for(int i = 0; i < n; ++i)
+        for(int j = 0; j < m; ++j)
+            if(s[i][j] == '#') {
+                memset(vis, false, sizeof vis);
+                s[i][j] = '.';
+                int comp = 0;
+                for(int k = 0; k < n; ++k)
+                    for(int l = 0; l < m; ++l)
+                        if(!vis[k][l] && s[k][l] == '#') {
+                            ++comp;
+                            DFS(k, l);
+                        }
+                if(comp > 1) {
+                    puts("1");
+                    return 0;
+                }
+                s[i][j] = '#';
+            }
+    
+    puts("2");
+    
+    return 0;
+}

CodeForces/964A. Splits.cpp

@@ -0,0 +1,18 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main() {
+	int n;
+	cin >> n;
+
+	if(n == 1) {
+		cout << 1 << endl;
+	} else if(n % 2 == 0) {
+		cout << n - (n / 2 - 1) << endl;
+	} else {
+		cout << n - (n / 2) << endl;
+	}
+
+  return 0;
+}

CodeForces/964B. Messages.cpp

@@ -0,0 +1,30 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int n, A, B, C, T, a[1001], fr[1001];
+
+int main() {
+	cin >> n >> A >> B >> C >> T;
+	for(int i = 0; i < n; ++i) {
+		cin >> a[i];
+		++fr[a[i]];
+	}
+	sort(a, a + n);
+
+	long long r1 = A * n, r2 = 0;
+
+	for(int i = 0; i < n; ++i) {
+		int diff = T - a[i];
+		r2 += A - (B * diff);
+	}
+
+	for(int i = 0, cnt = 0; i < T; ++i) {
+		cnt += fr[i];
+		r2 += (1ll * C * cnt);
+	}
+
+	cout << max(r1, r2) << endl;
+
+  return 0;
+}

CodeForces/976A. Minimum Binary Number.cpp

@@ -0,0 +1,33 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int t, n, m, a[N];
+char s[N];
+
+int main() {
+	cin >> n;
+	string s;
+	cin >> s;
+
+	if(n == 1) {
+		cout << s << endl;
+		return 0;
+	}
+
+	int z = 0, o = 0;
+	for(int i = 0; i < s.length(); ++i)
+		if(s[i] == '0')
+			++z;
+		else
+			++o;
+
+	if(o > 0)
+		cout << 1;
+	for(int i = 0; i < z; ++i)
+		cout << 0;
+	cout << endl;
+
+	return 0;
+}

CodeForces/976B. Lara Croft and the New Game.cpp

@@ -0,0 +1,50 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+long long t, n, m, a[N];
+long long k;
+char s[N];
+
+int main() {
+	cin >> n >> m >> k;
+
+	if(k < n) {
+		++k;
+		cout << k << ' ' << 1 << endl;
+		return 0;
+	}
+
+	if(k == n) {
+		cout << n << ' ' << 2 << endl;
+		return 0;
+	}
+
+	k -= n;
+
+	long long tmp = m;
+	m -= 2;
+
+	long long can = k / (m + 1);
+
+	long long x = n, y = 2;
+
+	if(can % 2 == 0) {
+		x -= can;
+	} else {
+		x -= can;
+		y = tmp;
+	}
+
+	long long mod = k % (m + 1);
+
+	if(y == 2)
+		y += mod;
+	else
+		y -= mod;
+
+	cout << x << ' ' << y << endl;
+
+	return 0;
+}