Merge pull request #406 from xirc/atcoder/abc050

AtCoder/ABC050

Author: xirc

atcoder/abc050/A/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 A, B;
+    string op;
+
+    cin >> A >> op >> B;
+
+    int ans = 0;
+    if (op == "+") {
+        ans = A + B;
+    } else if (op == "-") {
+        ans = A - B;
+    } else throw;
+    cout << ans << endl;
+
+    return 0;
+}

atcoder/abc050/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, M;
+    vector<int> T;
+
+    cin >> N;
+    T.assign(N, 0);
+    for (auto &t : T) cin >> t;
+    cin >> M;
+    for (int i = 0; i < M; ++i) {
+        int p, x;
+        cin >> p >> x;
+        --p;
+
+        int ans = 0;
+        for (int j = 0; j < N; ++j) {
+            if (j == p) ans += x;
+            else ans += T[j];
+        }
+        cout << ans << endl;
+    }
+
+    return 0;
+}

atcoder/abc050/C/main.cpp

@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+ll const MOD = 1e9 + 7;
+int N;
+vector<int> A;
+
+ll solve() {
+    sort(A.begin(), A.end());
+    if (N % 2 == 0 && A[0] == 0) return 0;
+    if (N % 2 == 1 && A[0] != 0) return 0;
+    for (int i = N % 2; i < N; i += 2) {
+        if (i > 0 && A[i] == A[i-1]) return 0;
+        if (A[i] != A[i+1]) return 0;
+    }
+    int M = N / 2;
+    ll ans = 1;
+    for (int i = 0; i < M; ++i) {
+        ans = (ans * 2) % MOD;
+    }
+    return ans;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N;
+    A.assign(N, 0);
+    for (auto &a : A) cin >> a;
+    cout << solve() << endl;
+
+    return 0;
+}