Added 3 new problems from codeforces

17 files changed, 178 insertions, 0 deletions

diff --git a/codeforces/BuyAShovel/main b/codeforces/BuyAShovel/main
new file mode 100755
index 0000000..84997a5
--- /dev/null
+++ b/codeforces/BuyAShovel/main
diff --git a/codeforces/BuyAShovel/main.cpp b/codeforces/BuyAShovel/main.cpp
new file mode 100644
index 0000000..a486a92
--- /dev/null
+++ b/codeforces/BuyAShovel/main.cpp
@@ -0,0 +1,54 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+void solve() {
+  int k, r;
+  cin >> k >> r;
+  int cnt = 1;
+  int i = 2;
+  int x = k;
+  while (x % 10 != r && x % 10 != 0) {
+    cerr << x << '\n';
+    x = k * i;
+    cnt++;
+    i++;
+  }
+  cout << cnt << '\n';
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  solve();
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
diff --git a/codeforces/BuyAShovel/main_input0.txt b/codeforces/BuyAShovel/main_input0.txt
new file mode 100644
index 0000000..77d5b11
--- /dev/null
+++ b/codeforces/BuyAShovel/main_input0.txt
@@ -0,0 +1 @@
+117 3
diff --git a/codeforces/BuyAShovel/main_input1.txt b/codeforces/BuyAShovel/main_input1.txt
new file mode 100644
index 0000000..70a833f
--- /dev/null
+++ b/codeforces/BuyAShovel/main_input1.txt
@@ -0,0 +1 @@
+237 7
diff --git a/codeforces/BuyAShovel/main_input2.txt b/codeforces/BuyAShovel/main_input2.txt
new file mode 100644
index 0000000..4955335
--- /dev/null
+++ b/codeforces/BuyAShovel/main_input2.txt
@@ -0,0 +1 @@
+15 2
diff --git a/codeforces/BuyAShovel/main_output0.txt b/codeforces/BuyAShovel/main_output0.txt
new file mode 100644
index 0000000..ec63514
--- /dev/null
+++ b/codeforces/BuyAShovel/main_output0.txt
@@ -0,0 +1 @@
+9
diff --git a/codeforces/BuyAShovel/main_output1.txt b/codeforces/BuyAShovel/main_output1.txt
new file mode 100644
index 0000000..d00491f
--- /dev/null
+++ b/codeforces/BuyAShovel/main_output1.txt
@@ -0,0 +1 @@
+1
diff --git a/codeforces/BuyAShovel/main_output2.txt b/codeforces/BuyAShovel/main_output2.txt
new file mode 100644
index 0000000..0cfbf08
--- /dev/null
+++ b/codeforces/BuyAShovel/main_output2.txt
@@ -0,0 +1 @@
+2
diff --git a/codeforces/CormenTheBestFriendOfAMan/main.cpp b/codeforces/CormenTheBestFriendOfAMan/main.cpp
new file mode 100644
index 0000000..25db2b2
--- /dev/null
+++ b/codeforces/CormenTheBestFriendOfAMan/main.cpp
@@ -0,0 +1,45 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+void solve() {
+  int n, k;
+  cin >> n >> k;
+  vi v(n);
+
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  solve();
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
diff --git a/codeforces/EffectiveApproach/main b/codeforces/EffectiveApproach/main
new file mode 100755
index 0000000..5459606
--- /dev/null
+++ b/codeforces/EffectiveApproach/main
diff --git a/codeforces/EffectiveApproach/main.cpp b/codeforces/EffectiveApproach/main.cpp
new file mode 100644
index 0000000..8c7c602
--- /dev/null
+++ b/codeforces/EffectiveApproach/main.cpp
@@ -0,0 +1,58 @@
+#include<bits/stdc++.h>
+
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define push_back pb
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+void solve() {
+  int n, m;
+  cin >> n;
+  vi v(n);
+  mpii mp;
+  for (int i = 0; i < n; i++) {
+    cin >> v[i];
+    mp[v[i]] = i;
+  }
+  cin >> m;
+  vi q(m);
+  for (auto &x : q) cin >> x;
+  ll ans1 = 0, ans2 = 0;
+  for (auto x : q) {
+    ans1 += mp[x] + 1;
+    ans2 += n - mp[x];
+  }
+  cout << ans1 << " " << ans2 << '\n';
+}
+
+int main () {
+	ios_base::sync_with_stdio(false);
+	cin.tie(NULL);
+  solve();
+}
+
+/* stuff you should look for:
+  ---------------------------
+   * special cases (n=1?)
+   * int overflow, array bounds
+   * do smth instead of nothing and stay organized
+   * WRITE STUFF DOWN
+   * DON'T GET STUCK ON ONE APPROACH
+ */
diff --git a/codeforces/EffectiveApproach/main_input0.txt b/codeforces/EffectiveApproach/main_input0.txt
new file mode 100644
index 0000000..b943494
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_input0.txt
@@ -0,0 +1,4 @@
+2
+1 2
+1
+1
diff --git a/codeforces/EffectiveApproach/main_input1.txt b/codeforces/EffectiveApproach/main_input1.txt
new file mode 100644
index 0000000..dada3c1
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_input1.txt
@@ -0,0 +1,4 @@
+2
+2 1
+1
+1
diff --git a/codeforces/EffectiveApproach/main_input2.txt b/codeforces/EffectiveApproach/main_input2.txt
new file mode 100644
index 0000000..f5c4c14
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_input2.txt
@@ -0,0 +1,4 @@
+3
+3 1 2
+3
+1 2 3
diff --git a/codeforces/EffectiveApproach/main_output0.txt b/codeforces/EffectiveApproach/main_output0.txt
new file mode 100644
index 0000000..8d04f96
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_output0.txt
@@ -0,0 +1 @@
+1 2
diff --git a/codeforces/EffectiveApproach/main_output1.txt b/codeforces/EffectiveApproach/main_output1.txt
new file mode 100644
index 0000000..cba3471
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_output1.txt
@@ -0,0 +1 @@
+2 1
diff --git a/codeforces/EffectiveApproach/main_output2.txt b/codeforces/EffectiveApproach/main_output2.txt
new file mode 100644
index 0000000..558161a
--- /dev/null
+++ b/codeforces/EffectiveApproach/main_output2.txt
@@ -0,0 +1 @@
+6 6