RCC

Author: kronos

README.md

@@ -8,3 +8,4 @@ My sport programming adventures.
 * [interviewbit.com](https://www.interviewbit.com/profile/ivan_samsonov)
 * [acmp.ru](http://acmp.ru/index.asp?main=user&id=560)
 * [csacademy.com](https://csacademy.com/user/kronos)
+* [russiancodecup.ru](https://russiancodecup.ru)

russiancodecup.ru/2017/qual1/a.java

@@ -0,0 +1,53 @@
+import java.io.*;
+import java.util.*;
+
+public class Main {
+    private final Scanner in;
+    private final PrintWriter out;
+
+    public Main() {
+        in = new Scanner(System.in);
+        out = new PrintWriter(new OutputStreamWriter(System.out));
+    }
+
+    public static void main(String[] args) throws IOException {
+      new Main().run();
+    }
+
+    void run() throws IOException {
+        solve();
+        out.flush();
+    }
+
+    void solve() throws IOException {
+        int t = in.nextInt();
+        int k,a,b,ans,p;
+        for(;t>0;t--) {
+            k = in.nextInt();
+            a = in.nextInt();
+            b = in.nextInt();
+            if (a < b) {
+                p = a;
+                a = b;
+                b = p;
+            }
+            if (a >= k) {
+                if (a-b > 1) {
+                    ans = 0;
+                } else if (a == b) {
+                    ans = 2;
+                } else {
+                    ans = 1;
+                }
+            } else {
+                ans = k - a;
+                if (ans + a - b == 1) {
+                    ans++;
+                } else if (ans + a - b == 0) {
+                    ans += 2;
+                }
+            }
+            out.println(ans);
+        }
+    }
+}

russiancodecup.ru/2017/qual2/a.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <algorithm>
+
+using namespace std;
+
+int t, n, m;
+
+int a[20][20];
+int main() {
+  ios::sync_with_stdio(false);
+  cin.tie(0);
+  cin >> t;
+  int cnt = 0;
+  int line = n-1;
+  int column = 0;
+  int p, cline, ccolumn;
+
+  while(t--) {
+    cin >> n >> m;
+    line = 0;
+    column = 0;
+    ccolumn = 0;
+    cline = 0;
+    p = n*m;
+    while (p > 0) {
+      a[cline][ccolumn] = p;
+      p--;
+      ccolumn++;
+      cline--;
+      if (cline < 0) {
+        line++;
+        if (line > n-1) {
+          line = n-1;
+          column++;
+        }
+        ccolumn = column;
+        cline = line;
+      }
+
+      if (ccolumn > m-1) {
+        line++;
+        if (line > n-1) {
+          line = n-1;
+          column++;
+        }
+        ccolumn = column;
+        cline = line;
+      }
+    }
+
+    for (int i = 0; i < n; i++) {
+      for (int j = 0; j < m; j++) {
+        cout << a[i][j] << " ";
+      }
+      cout << "\n";
+    }
+  }
+  return 0;
+}

russiancodecup.ru/2017/qual2/b.rb

@@ -0,0 +1,16 @@
+t = gets.to_i
+t.times do
+  a, b, c, d = gets.split(/\s+/).map(&:to_i)
+  if b != d
+    e = d*a
+    bottom = d*b
+    f = b*c
+  else
+    e = a
+    f = c
+    bottom = d
+  end
+  top = e.lcm(f)
+  p = top.gcd(bottom)
+  puts "#{top/p} #{bottom/p}"
+end

russiancodecup.ru/2017/qual3/a.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <stack>
+#include <queue>
+#include <string>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+int main() {
+  int n;
+  unsigned k, m;
+  string s;
+
+  cin >> n;
+  for (int i = 0; i < n; i++) {
+    cin >> k;
+    s = "";
+    while (k > 0) {
+        m = (k-1) % 26;
+        s += 'A' + m;
+        k = (k-m) / 26;
+    }
+
+    for (int j = 0; j < s.length() / 2; j++) {
+        swap(s[j], s[s.length()-1-j]);
+    }
+
+    cout << s << "\n";
+  }
+  return 0;
+}

russiancodecup.ru/2017/qual3/b.cpp

@@ -0,0 +1,54 @@
+#include <iostream>
+#include <stack>
+#include <queue>
+#include <string>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+
+struct character {
+  int h, a;
+};
+
+character chars[100000];
+
+bool comparator(const character& left, const character& right) {
+  return left.a > right.a;
+}
+
+int main() {
+  int n, H, A, a, t, ans;
+  unsigned long long int sum;
+
+  cin.tie(0);
+  ios_base::sync_with_stdio(false);
+
+  cin >> t;
+  while (t--) {
+    cin >> n >> H >> A;
+    sum = 0;
+    for (int j = 0; j < n; j++) {
+      cin >> chars[j].h >> a;
+      chars[j].a = (chars[j].h / A) * a;
+      if ((chars[j].h % A) != 0) {
+        chars[j].a += a;
+      }
+      sum += chars[j].a;
+    }
+
+    if (sum < H) {
+      cout << -1 << "\n";
+    } else {
+      sort(chars, chars + n, comparator);
+      ans = -1;
+      while (H > 0) {
+        ans++;
+        H -= chars[ans].a;
+      }
+      cout << ans << "\n";
+    }
+  }
+
+  return 0;
+}

russiancodecup.ru/2017/qual3/c.cpp

@@ -0,0 +1,61 @@
+#include <iostream>
+#include <stack>
+#include <queue>
+#include <string>
+#include <algorithm>
+#include <map>
+
+using namespace std;
+int n;
+unsigned digits(unsigned long long int n) {
+    unsigned digits = 0;
+    while (n) {
+        n /= 10;
+        digits++;
+    }
+    return digits;
+}
+
+unsigned long long int S(unsigned long long int n) {
+  if (n == 0) {
+    return 0;
+  }
+
+  unsigned long long int ans = 0, t = 1;
+  unsigned l = digits(n);
+
+  if (l > 1) {
+    ans = 9;
+    for (int i = 2; i < l; i++) {
+      ans += 9*t;
+      t *= 10;
+    }
+    t *= 10;
+    int first = n / t;
+    int last  = n % 10;
+    ans += (first-1)*(t/10);
+
+    if (first <= last) {
+      ans += (n % t) / 10 + 1;
+    } else {
+      ans += (n % t) / 10;
+    }
+  } else {
+    ans = n;
+  }
+
+  return ans;
+}
+
+int main() {
+  unsigned long long int l,r;
+  int t;
+  cin.tie(0);
+  ios_base::sync_with_stdio(false);
+  cin >> t;
+  while (t--) {
+    cin >> l >> r;
+    cout << S(r) - S(l-1) << "\n";
+  }
+  return 0;
+}