Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define _USE_MATH_DEFINES
- #include <cstdio>
- #include <iostream>
- #include <fstream>
- #include <sstream>
- #include <climits>
- #include <ctime>
- #include <cassert>
- #include <cstdlib>
- #include <algorithm>
- #include <cmath>
- #include <string>
- #include <cstring> // for memset
- #include <vector>
- #include <queue>
- #include <deque>
- #include <set>
- #include <map>
- #include <bitset>
- using namespace std;
- #define INF INT_MAX
- #define LINF LLONG_MAX
- #define EPS 1e-9
- #define MOD 1000000007 // 10**9 + 7
- #define MAXN 101
- #define ALPH 26 // Latin alphabet size
- #define DALPH 52 // Double Latin alphabet size
- #define mp(a, b) make_pair(a, b)
- #define pub(a) push_back(a)
- #define pob() pop_back()
- #define puf(a) push_front(a)
- #define pof() pop_front()
- #ifndef __GNUC__
- typedef unsigned long int uint;
- #endif
- typedef signed short int int16;
- typedef unsigned short int uint16;
- typedef signed long long int int64;
- typedef unsigned long long int uint64;
- typedef long double real; // in msvc same as double
- typedef pair<int, int> pii;
- int p = 0;
- vector<int> G[MAXN];
- bool T[MAXN];
- void go(int k) {
- printf("%d\n", k);
- fflush(stdout);
- }
- int main() {
- while (1) {
- int k;
- scanf("%d", &k);
- go(G[p].size() + 1);
- string s;
- cin >> s;
- if (s == "Success") {
- break;
- }
- if (s == "Colder") {
- G[p].pub(p + 1);
- ++p;
- continue;
- }
- if (s == "Warmer") {
- G[p].clear();
- p = max(0, p - 1);
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement