Merge pull request #405 from xirc/atcoder/abc044

AtCoder/ABC044

Author: xirc

atcoder/abc044/A/main.cpp

@@ -0,0 +1,18 @@
+#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, X, Y;
+    cin >> N >> K >> X >> Y;
+
+    int price = min(N, K) * X + max(0, N - K) * Y;
+    cout << price << endl;
+
+    return 0;
+}

atcoder/abc044/B/main.cpp

@@ -0,0 +1,28 @@
+#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 w;
+    cin >> w;
+
+    unordered_map<char,int> charCounter;
+    for (auto c : w) {
+        charCounter[c]++;
+    }
+    auto beautiful = true;
+    for (auto kv : charCounter) {
+        if (kv.second % 2 == 1) {
+            beautiful = false;
+            break;
+        }
+    }
+    cout << (beautiful ? "Yes" : "No") << endl;
+
+    return 0;
+}

atcoder/abc044/C/main.cpp

@@ -0,0 +1,40 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+using ll = int64_t;
+using ff = long double;
+
+int N, A;
+vector<int> xs;
+
+ll solve() {
+    const int M = 50 * 50;
+    vector<vector<ll>> DP(N+1, vector<ll>(M+1, 0));
+    DP[0][0] = 1;
+
+    for (auto x : xs) {
+        for (int i = N; i > 0; --i) {
+            for (int j = M; j - x >= 0; --j) {
+                DP[i][j] += DP[i-1][j-x];
+            }
+        }
+    }
+
+    ll ans = 0;
+    for (int i = 1; i <= N; ++i) {
+        ans += DP[i][i*A];
+    }
+    return ans;
+}
+
+int main() {
+    ios_base::sync_with_stdio(false);
+    cin.tie(0); cout.tie(0);
+
+    cin >> N >> A;
+    xs.assign(N, 0);
+    for (auto &x : xs) cin >> x;
+    cout << solve() << endl;
+
+    return 0;
+}