lNQbgj - Online C++ Compiler & Debugging Tool

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ull unsigned ll
#define ld long double
typedef vector<int> vi;
typedef multiset<int> mi;
typedef multiset<ll> mll;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef set<ll> sll;
typedef vector<vector<int>> _2vi;
typedef vector<vector<ll>> _2vll;
#define all(v) ((v).begin()), ((v).end())
#define sz(v) ((ll)((v).size()))

#define vinp(v, n)                \
    for (ull i = 0; i < (n); i++) \
    cin >> (v)[i]
#define printv(v)      \
    for (auto i : (v)) \
    cout << i << " "
#define fr0(i, n) for (ull(i) = 0; (i) < (n); (i)++)
#define fr1(i, n) for (ull(i) = 1; (i) < (n); (i)++)
#define fr(i, x, n) for (ull(i) = (x); (i) < (n); (i)++)
#define _CRT_SECURE_NO_WARNING
const ll MOD = 1000000007;

void Bustany() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
#ifndef ONLINE_JUDGE
    freopen("./in.txt", "r", stdin), freopen("./out.txt", "w", stdout);
#endif
}

const ll N = 1e5 + 5;
vector<sll> adj(N);
//_2vll adj(N,vll(N));
vb vis;

/*
 ? Find all prime numbers from 1 to n
 ? Complexity : O[n * log(log(n))]
 */
vector<ll> sieve(int n) {
    vector<bool> isPrime(n + 1, 1);
    isPrime[0] = isPrime[1] = 0;

    for (ll i = 2; i * i <= n; i++) {
        if (isPrime[i]) {
            for (ll j = i * i; j <= n; j += i)
                isPrime[j] = false;
        }
    }
    vector<ll> primes;
    for (ll i = 2; i < n + 1; i++) {
        if (isPrime[i]) primes.push_back(i);
    }
    return primes;
}


void solve() {
    vll p = sieve(100);
    sll v;
    ll i = 0;
    string ans;
    for (; i < p.size(); i++) {
        if (p[i] > 50) {
            cout << "prime\n";
            cout.flush();
            return;
        }
        cout << p[i] << endl;
        cout.flush();
        cin >> ans;
        if (ans == "yes") {
            for (int j = 0; j < p.size(); j++) {
                if (p[i] * p[j] <= 100)v.insert(p[i] * p[j]);
            }
            for (auto s: v) {
                cout << s << endl;
                cout.flush();
                cin >> ans;
                if (ans == "yes") {
                    cout << "composite\n";
                    cout.flush();
                    return;
                }
            }
            cout << "prime\n";
            cout.flush();
        }
    }
    cout << "prime\n";
    cout.flush();
}

int main() {
    Bustany();
    ll t = 1;
//     cin >> t;
    while (t--) {
        solve();
    }
}