Submission #1245315

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<string>
#include<vector>
#include<algorithm>
#include<queue>
#include<set>
#include<unordered_map>
#include<string.h>
#include<stack>
#include<functional>
using namespace std;

string a = "#.";
signed main() {
	int b; cin >> b;
	string c, d;
	while (1) {
	l:;
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < 2; j++) {
				c += a[i]; d += a[j];
				cout << c << endl;
				cout << d << endl;
				string e; cin >> e;
				if (e == "T") {
					goto l;
				}
				else if(e=="end"){
					return 0;
				}
				c.erase(--c.end());
				d.erase(--d.end());
			}
		}
		puts("YES");
		break;
	}
	while (1) {
	r:;
		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < 2; j++) {
				c = a[i] + c; d = a[j] + d;
				cout << c << endl;
				cout << d << endl;
				string e; cin >> e;
				if (e == "T") {
					goto r;
				}
				else if (e == "end") {
					return 0;
				}
				c.erase(c.begin());
				d.erase(d.begin());
			}
		}
		break;
	}
}

Submission Info

Judge Result