제출 #245366

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
245366		kartel	Bridž (COCI17_bridz)	C++14	50 / 50	6 ms	512 KiB

bridz

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +405
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e9)
#define el '\n'
//#define el endl
#define pii pair <int, int>
#define err ld(1e-9)
#define last(x) x.back()
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

char cards[5] = {'A', 'K', 'Q', 'J', 'X'};
int points[5] = {4, 3, 2, 1, 0};

string s;
int q, i, j, ans;

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);
//
//    in("input.txt");
//    out("output.txt");

    cin >> q;

    while (q--)
    {
        cin >> s;

        for (i = 0; i < sz(s); i++)
        {
            j = 0;
            while (s[i] != cards[j]) j++;

            ans += points[j];
        }
    }
    cout << ans;
}

//
//00000
//00110
//00111
//00011
//00000

• Subtask 1: 50 / 50