# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
94010 | theknife2001 | Karte (COCI15_karte) | C++17 | 2 ms | 380 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;
set < int > st[4];
string s;
void ch(int i , int j , char c)
{
int x;
if(s[i]==c)
{
x=(s[i+1]-'0')*10;
x+=s[i+2]-'0';
if(st[j].find(x)!=st[j].end())
{
cout<<"GRESKA"<<endl;
exit(0);
}
st[j].insert(x);
}
}
int main()
{
cin>>s;
int n=s.size();
int x;
for(int i=0;i<n;i+=3)
{
ch(i,0,'P');
ch(i,1,'K');
ch(i,2,'H');
ch(i,3,'T');
}
cout<<13-st[0].size()<<' ';
cout<<13-st[1].size()<<' ';
cout<<13-st[2].size()<<' ';
cout<<13-st[3].size()<<endl;
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |