| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 413551 | rqi | Karte (COCI15_karte) | C++14 | 1 ms | 292 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 mp make_pair
#define f first
#define s second
#define ins insert
#define sz(x) (int)(x).size()
int main(){
	string S;
	cin >> S;
	set<pair<char, int>> cards;
	map<char, int> m;
	m['P'];
	m['K'];
	m['H'];
	m['T'];
	for(int i = 0; i < sz(S); i+=3){
		pair<char, int> card = mp(S[i], stoi(to_string(S[i+1])+to_string(S[i+2])));
		if(cards.find(card) != cards.end()){
			cout << "GRESKA" << "\n";
			exit(0);
		}
		cards.ins(card);
		m[card.f]++;
	}
	for(auto &u: m){
		u.s = 13-u.s;
	}
	
	cout << m['P'] << " " << m['K'] << " " << m['H'] << " " << m['T'] << "\n";
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
