# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994026 | vjudge1 | Kartomat (COCI17_kartomat) | C++17 | 1 ms | 348 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 ll long long
int const N=2e5+5;
int const mod=1e9+7;
void solve(){
int n;
cin>>n;
string arr[n];
for (int i = 0; i < n; ++i)
cin>>arr[i];
string s;
cin>>s;
string ans[4]={"********","********","********","********"};
for(int i=0;i<n;i++){
if(s.length()>=arr[i].length())
continue;
bool b=1;
for(int j=0;j<s.length();j++)
if(arr[i][j]!=s[j])
b=0;
if(b==0)
continue;
int v=arr[i][int(s.length())]-'A';
v+=3;
ans[v/8][v%8]='A'+v-3;
}
for (int i = 0; i < 4; ++i)
cout<<ans[i]<<endl;
}
int main(){
int t=1;
// cin>>t;
while(t--)
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |