Merge pull request #395 from xirc/atcoder/abc003

AtCoder/ABC003{A,B,C}

Author: xirc

atcoder/abc003/A/main.cpp

@@ -0,0 +1,21 @@
+#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 X;
+    cin >> X;
+
+    int S = 0;
+    for (int i = 1; i <= X; ++i) {
+        S += i;
+    }
+    cout << fixed << setprecision(7) << (ll(S) * 10000 / ff(X)) << endl;
+
+    return 0;
+}

atcoder/abc003/B/main.cpp

@@ -0,0 +1,39 @@
+#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);
+
+    string S, T;
+    cin >> S >> T;
+    assert(S.size() == T.size());
+
+    string wildcards = "atcoder";
+    bool win = true;
+    int N = S.size();
+    for (int i = 0; i < N; ++i) {
+        if (S[i] == T[i]) continue;
+        if (S[i] != '@' && T[i] != '@') {
+            win = false;
+            break;
+        }
+        char c = ' ';
+        if (S[i] == '@') c = T[i];
+        if (T[i] == '@') c = S[i];
+        if (c != '@' && wildcards.find(c) == string::npos) {
+            win = false;
+            break;
+        }
+    }
+    if (win) {
+        cout << "You can win" << endl;
+    } else {
+        cout << "You will lose" << endl;
+    }
+
+    return 0;
+}

atcoder/abc003/C/main.cpp

@@ -0,0 +1,25 @@
+#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, K;
+    vector<int> R;
+
+    cin >> N >> K;
+    R.assign(N, 0);
+    for (auto &r : R) cin >> r;
+    sort(R.begin(), R.end());
+    ff rate = 0;
+    for (int i = N - K; i < N; ++i) {
+        rate = (rate + R[i]) / 2;
+    }
+    cout << fixed << setprecision(7) << rate << endl;
+
+    return 0;
+}