| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 240816 | SamAnd | Bridž (COCI17_bridz) | C++17 | 6 ms | 512 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.
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
void solv()
{
    int qq;
    scanf("%d", &qq);
    int ans = 0;
    while (qq--)
    {
        char a[20];
        scanf(" %s", a);
        int n = strlen(a);
        for (int i = 0; i < n; ++i)
        {
            if (a[i] == 'A')
                ans += 4;
            else if (a[i] == 'K')
                ans += 3;
            else if (a[i] == 'Q')
                ans += 2;
            else if (a[i] == 'J')
                ans += 1;
        }
    }
    printf("%d\n", ans);
}
int main()
{
    #ifdef SOMETHING
    freopen("input.txt", "r", stdin);
    //freopen("output.txt", "w", stdout);
    #endif // SOMETHING
    //ios_base::sync_with_stdio(false), cin.tie(0);
    solv();
    return 0;
}
//while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
