Merge pull request #398 from xirc/atcoder/abc008

AtCoder/ABC008

Author: xirc

atcoder/abc008/A/main.cpp

@@ -0,0 +1,16 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int S, T;
+    cin >> S >> T;
+    cout << (T - S + 1) << endl;
+
+    return 0;
+}

atcoder/abc008/B/main.cpp

@@ -0,0 +1,32 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    int N;
+    cin >> N;
+
+    map<string,int> votes;
+    string s;
+    for (int i = 0; i < N; i++) {
+        cin >> s;
+        votes[s]++;
+    }
+
+    int maxi = 0;
+    string top;
+    for (auto const& e : votes) {
+        if (e.second > maxi) {
+            maxi = e.second;
+            top = e.first;
+        }
+    }
+    cout << top << endl;
+
+    return 0;
+}

atcoder/abc008/C/main.cpp

@@ -0,0 +1,36 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N;
+vector<int> C;
+
+ff solve() {
+    ff exp = 0;
+    for (int i = 0; i < N; ++i) {
+        int M = 0;
+        for (int j = 0; j < N; ++j) {
+            if (i == j) continue;
+            if (C[i] % C[j] == 0) ++M;
+        }
+        ff px = ff(M / 2 + 1) / (M + 1);
+        exp += px;
+    }
+    return exp;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N;
+    C.assign(N, 0);
+    for (int i = 0; i < N; ++i) {
+        cin >> C[i];
+    }
+    cout << fixed << setprecision(12) << solve() << endl;
+
+    return 0;
+}