oj.uz

Submission #1055381

# Submission time Handle Problem Language Result Execution time Memory
1055381 2024-08-12T18:31:51 Z fryingduc Bridž (COCI17_bridz) C++17
50 / 50
 1 ms 464 KB 
// #pragma GCC optimize("Ofast,unroll-loops")
#include "bits/stdc++.h"
using namespace std;

#ifdef duc_debug
#include "bits/debug.h"
#else 
#define debug(...)       
#endif

// #define int long long

int n;
string s;
void solve(){
    cin >> n;
    int ans = 0;
    for(int i = 1; i <= n; i++){
        cin >> s;
        for(int j = 0; j < 13; j++){
            if(s[j] == 'A') ans += 4;
            if(s[j] == 'K') ans += 3;
            if(s[j] == 'Q') ans += 2;
            if(s[j] == 'J') ans += 1;
        }
    }
    cout << ans;
}
signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int test = 1;
    // cin >> test;
    for(int i=1;i<=test;i++){
        // cout << "Case " << "#" << i << ": ";
        solve();
    }

    return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 460 KB Output is correct
8 Correct 0 ms 464 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct