Submission #1425694

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<functional>
#include<queue>
#include<cmath>
using namespace std;
long long N = 10000, Debug = 0;
bool okiniiri(long long p1, long long p2) {
	string S1 = to_string(p1), S2 = to_string(p2);
	if (p1 <= p2 && S1 <= S2)return true;
	if (p1 > p2 && S1 > S2)return true;
	return false;
}
bool solve(long long pos) {
	cout << "? " << pos << endl;
	if (Debug == 1) {
		bool V = okiniiri(pos, N);
		if (V == true) { cout << "Y" << endl; }
		else cout << "N" << endl;
		return V;
	}
	else {
		char c; cin >> c;
		if (c == 'Y')return true;
	}
	return false;
}
int main() {
	long long E = 1, F = -1;
	for (int i = 1; i <= 11; i++) {
		if (solve(E) == false) { F = i - 1; break; }
		E *= 10;
	}
	if (F == -1) {
		E = 1;
		for (int i = 1; i <= 11; i++) {
			E *= 10;
			if (solve(E - 1) == true) {
				cout << "! " << E / 10 << endl;
				return 0;
			}
		}
	}
	long long P = 1;
	for (int i = 1; i < F; i++)P *= 10;
	long long L = P * 10, R = P * 100, M, maxn = P * 10 - 1;
	for (int i = 0; i < 42; i++) {
		M = (L + R) / 2;
		bool p1 = solve(M);
		if (p1 == false) { maxn = max(maxn, M); L = M; }
		else { R = M; }
	}
	cout << "! " << (maxn + 1) / 10 << endl;
	return 0;
}

Submission Info

Judge Result