# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
709080 | 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.
#include <bits/stdc++.h>
//#define int long long
#define ll unsigned long long
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i, a, b) for(int i = a; i <= b; i++)
#define forn(i, n) for (int i = 0; i < n; i++)
#define forn1(i, n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
using namespace std;
const int N = 1e5+5;
const int INF = 1e18;
const int MOD = 1e9+7;
using namespace std;
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;
}