# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
182403 | XmtosX | Kartomat (COCI17_kartomat) | C++17 | 2 ms | 376 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;
string ans="***ABCDEFGHIJKLMNOPQRSTUVWXYZ***",a;
vector <string> s;
int n;
void fin()
{
for (int i=0;i<4;i++)
{
for (int j=0;j<8;j++)
cout <<ans[j+i*8];
cout <<endl;
}
}
int main()
{
cin >>n;
for (int i=0;i<n;i++)
{
cin >>a;
s.push_back(a);
}
cin >>a;
for (int j=0;j<=a.size();j++)
{
int cnt[300]={0};
for (int i=0;i<s.size();i++)
{
cnt[s[i][j]]++;
}
for (int i='A';i<='Z';i++)
{
if (!cnt[i])
ans[i-'A'+3]='*';
else
ans[i-'A'+3]=i;
}
if (j)
for (int i=0;i<s.size();i++)
{
if (s[i].size()<j||s[i].substr(0,j)!=a.substr(0,j))
{
s.erase(s.begin()+i);
i--;
}
}
}
fin();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |