# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
367985 | 2021-02-19T06:42:28 Z | TosakaUCW | Bridž (COCI17_bridz) | C++17 | 2 ms | 384 KB |
#include <stdio.h> #include <algorithm> #include <memory.h> int read(int x = 0, int f = 0, char ch = getchar()) { while ('0' > ch or ch > '9') f = ch == '-', ch = getchar(); while ('0' <= ch and ch <= '9') x = x * 10 + (ch ^ 48), ch = getchar(); return f ? -x : x; } int ans; int main() { for (int T = read(); T--;) { char s[13]; scanf("%s", s); for (int i = 0; i < 13; i++) if (s[i] == 'A') ans += 4; else if (s[i] == 'K') ans += 3; else if (s[i] == 'Q') ans += 2; else if (s[i] == 'J') ans += 1; } return printf("%d", ans), 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 384 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 256 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
6 | Correct | 1 ms | 364 KB | Output is correct |
7 | Correct | 1 ms | 364 KB | Output is correct |
8 | Correct | 1 ms | 364 KB | Output is correct |
9 | Correct | 1 ms | 364 KB | Output is correct |
10 | Correct | 2 ms | 364 KB | Output is correct |