yandex contest 2017 round 1 and others

Author: kronos

acm.timus.ru/1000-1100/1084.java

@@ -0,0 +1,42 @@
+import java.io.OutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.PrintWriter;
+import java.util.Scanner;
+
+/**
+ * Built using CHelper plug-in
+ * Actual solution is at the top
+ *
+ * @author kronos
+ */
+public class Main {
+    public static void main(String[] args) {
+        InputStream inputStream = System.in;
+        OutputStream outputStream = System.out;
+        Scanner in = new Scanner(inputStream);
+        PrintWriter out = new PrintWriter(outputStream);
+        Task1084 solver = new Task1084();
+        solver.solve(1, in, out);
+        out.close();
+    }
+
+    static class Task1084 {
+        public void solve(int testNumber, Scanner in, PrintWriter out) {
+            double a = in.nextDouble();
+            double l = in.nextDouble();
+            double pi = 3.1415926535;
+            if (a / 2.0 - l >= 1e-6) {
+                out.printf("%.3f", pi * l * l);
+            } else if ((double) l - Math.sqrt(2 * a * a) / 2.0 >= 1e-6) {
+                out.printf("%.3f", a * a);
+            } else {
+                double d = a / 2.0;
+                double segment = l * l * Math.acos(d / l) - d * Math.sqrt(l * l - d * d);
+                out.printf("%.3f", pi * l * l - segment * 4.0);
+            }
+        }
+
+    }
+}
+

acm.timus.ru/1201-1300/1246.java

@@ -0,0 +1,96 @@
+import java.io.OutputStream;
+import java.io.IOException;
+import java.io.InputStream;
+import java.io.PrintWriter;
+import java.io.IOException;
+import java.io.InputStreamReader;
+import java.io.FileNotFoundException;
+import java.util.StringTokenizer;
+import java.io.BufferedReader;
+import java.io.FileReader;
+import java.io.InputStream;
+
+/**
+ * Built using CHelper plug-in
+ * Actual solution is at the top
+ *
+ * @author kronos
+ */
+public class Main {
+    public static void main(String[] args) {
+        InputStream inputStream = System.in;
+        OutputStream outputStream = System.out;
+        FastScanner in = new FastScanner(inputStream);
+        PrintWriter out = new PrintWriter(outputStream);
+        Task1246 solver = new Task1246();
+        solver.solve(1, in, out);
+        out.close();
+    }
+
+    static class Task1246 {
+        public void solve(int testNumber, FastScanner in, PrintWriter out) {
+            int n = in.nextInt() - 1;
+            long z = 0, fx, fy;
+            long x1, y1, x2 = 0, y2 = 0;//,x3,y3;
+            fx = x1 = in.nextLong();
+            fy = y1 = in.nextLong();
+            while (n > 0) {
+                x2 = in.nextLong();
+                y2 = in.nextLong();
+                z += x1 * y2 - x2 * y1;
+                x1 = x2;
+                y1 = y2;
+                n--;
+            }
+
+            z += x2 * fy - fx * y2;
+
+            if (z < 0) {
+                out.println("cw");
+            } else {
+                out.println("ccw");
+            }
+        }
+
+    }
+
+    static class FastScanner {
+        BufferedReader br;
+        StringTokenizer st;
+
+        public FastScanner() {
+            br = new BufferedReader(new InputStreamReader(System.in));
+        }
+
+        public FastScanner(InputStream stream) {
+            br = new BufferedReader(new InputStreamReader(stream));
+        }
+
+        public FastScanner(String s) {
+            try {
+                br = new BufferedReader(new FileReader(s));
+            } catch (FileNotFoundException e) {
+                e.printStackTrace();
+            }
+        }
+
+        public String next() {
+            while (st == null || !st.hasMoreTokens()) {
+                try {
+                    st = new StringTokenizer(br.readLine());
+                } catch (IOException e) {
+                }
+            }
+            return st.nextToken();
+        }
+
+        public int nextInt() {
+            return Integer.parseInt(next());
+        }
+
+        public long nextLong() {
+            return Long.parseLong(next());
+        }
+
+    }
+}

codeforces/gyms/100985/a.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <set>
+#include <map>
+
+using namespace std;
+int n;
+long long a,b;
+
+int main() {
+  cin.tie(0);
+  ios_base::sync_with_stdio(false);
+
+  cin >> n;
+  while (n--) {
+    cin >> a >> b;
+    if (__gcd(a,b) > 1) {
+      cout << "Sim\n";
+    } else {
+      cout << "Nao\n";
+    }
+  }
+  return 0;
+}

codeforces/gyms/100985/b.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <set>
+#include <map>
+#include <math.h>
+
+using namespace std;
+int n;
+unsigned ans;
+
+int main() {
+  cin.tie(0);
+  ios_base::sync_with_stdio(false);
+
+  cin >> n;
+  ans = log2(n) + 1;
+  cout << ans << endl;
+  return 0;
+}

codeforces/gyms/100985/c.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <set>
+#include <map>
+
+using namespace std;
+int x, y, i, q;
+
+int main() {
+  cin >> x >> y;
+
+  if (x > y) {
+    cout  << "1 " << x-y << endl;
+    x -= x-y;
+  } else {
+    cout  << "2 " << y-x << endl;
+    y -= y-x;
+  }
+
+  while (x > 0 || y > 0) {
+    cin >> i >> q;
+
+    if (i == 1) {
+      x -= q;
+    } else {
+      y -= q;
+    }
+
+    if (x > y) {
+      cout  << "1 " << x-y << endl;
+      x -= x-y;
+    } else {
+      cout  << "2 " << y-x << endl;
+      y -= y-x;
+    }
+  }
+
+  return 0;
+}