Submission #1167257

#TimeUsernameProblemLanguageResultExecution timeMemory
1167257sunflowerBridž (COCI17_bridz)C++17
50 / 50
1 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define MASK(x) (1LL << (x)) #define BIT(x, i) (((x) >> (i)) & 1) #define SZ(x) ((int) (x).size()) #define ALL(a) (a).begin(), (a).end() #define FOR(i, a, b) for (int i = (a); i <= (b); ++i) #define FORD(i, a, b) for (int i = (a); i >= (b); --i) #define debug(x) cerr << "[" << #x << " = " << (x) << "]" << endl #define left __left #define right __right #define prev __prev #define fi first #define se second template <class X, class Y> bool maximize(X &x, Y y) { if (x < y) return x = y, true; else return false; } template <class X, class Y> bool minimize(X &x, Y y) { if (x > y) return x = y, true; else return false; } int main() { ios_base::sync_with_stdio(false);cin.tie(nullptr); int t; cin >> t; int ans = 0; while (t--) { string s; cin >> s; for (char c : s) if (c == 'A') ans += 4; else if (c == 'K') ans += 3; else if (c == 'Q') ans += 2; else if (c == 'J') ans += 1; } cout << ans; return 0; } /* Discipline - Calm */
#Verdict Execution timeMemoryGrader output
Fetching results...