# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709079 | kxd | Password (RMI18_password) | C++17 | 0 ms | 0 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.
int tot[26];
int ans[5000];
string guess(int n, int s) {
forn(i,s) {
string S (n,char('a'+i));
tot[i] = query(S);
}
forn(i,s) {
forn(j,tot[i]) {
int ret = 0;
forn(k,s) {
if(k==i) continue;
string S (j,'a'+i);
string S2 (n-j,'a'+k);
int t = query(S+S2);
if(!t) break;
ret += t;
}
ans[ret] = i;
}
}
string S;
forn(i,n) {
S = S + (char)(ans[i]+'a');
}
return S;
}