| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 308915 | bigDuck | Password (RMI18_password) | C++14 | 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.
#include<bits/stdc++.h>
using namespace std;
#define INIT ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define pii pair<int, int>
#define count_bits __builtin_popcount
#define int ll
int query(string str);
string guess(int n, int s){
string res="";
for(char c='a'; c<=('a'+s-1); c++){
for(int i=0; (i<=res.length()) && (res.length()<n); i++){
string s1="", s2="";
for(int j=0; j<i; j++){
s1+="a"; s1[s1.length()-1]=res[j];
}
for(int j=i; j<res.length(); j++){
s2+="a"; s2[s2.length()-1]=res[j];
}
string st="";
while(true){
if( (((int)s1.length())+((int)st.length())+((int)s2.length()))==n ){
res=s1+st+s2;
i=(((int)s1.length())+((int)st.length())); break;
}
st+="a"; st[st.length()-1]=c;
int ln=query(s1+st+s2);
if(ln==(((int)s1.length())+((int)st.length())+((int)s2.length()))){
continue;
}
else{
st.erase(st.end()-1, st.end());
res=s1+st+s2;
i=(((int)s1.length())+((int)st.length())); break;
}
}
}
}
return res;
}