| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1055381 | fryingduc | Bridž (COCI17_bridz) | C++17 | 1 ms | 464 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// #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;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
