from sys import stdout
p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
p2 = [4, 9, 25, 49]
ans = 0
for i in p:
if ans >= 2:
break
print(i)
stdout.flush()
n = input() == 'yes'
ans += 1 if n else 0
for i in p2:
if ans >= 2:
break
print(i)
stdout.flush()
n = input() == 'yes'
ans += 1 if n else 0
print('prime' if ans < 2 else 'composite')
stdout.flush()
// Author: Awan
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
const int inf = 1e18;
#define print(x) for(auto p:x){cout << p << " ";} cout << endl;
const int MOD = 1e9 + 7;
const int N = 2e5+3;
#define time cerr << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC << "ms\n"
bool divisible(int a) {
printf("%d\n", a);
fflush(stdout);
char sl[10];
scanf("%s", sl);
return sl[0] == 'y' || sl[0] == 'Y';
}
void solve(){
vector<bool> number(101, false);
vector<int> prime;
for(int i=2;i<=50;i++){
if(!number[i]){
prime.push_back(i);
for(int j=i*i;j<=100;j+=i){
number[j] = true;
}
}
}
// print(prime);
int cnt = 0;
for(auto x:prime){
if(divisible(x)){
cnt++;
if(x*x <= 50){
if(divisible(x*x)){
cnt++;
}
}
}
if(cnt >= 2) break;
}
if(cnt >= 2){
cout << "composite" << endl;
}
else {
cout << "prime" << endl;
}
}
signed main(){
int t=1;
// cin>>t;
while(t--){
solve();
}
}905. Sort Array By Parity | 1351. Count Negative Numbers in a Sorted Matrix |
617. Merge Two Binary Trees | 1450. Number of Students Doing Homework at a Given Time |
700. Search in a Binary Search Tree | 590. N-ary Tree Postorder Traversal |
589. N-ary Tree Preorder Traversal | 1299. Replace Elements with Greatest Element on Right Side |
1768. Merge Strings Alternately | 561. Array Partition I |
1374. Generate a String With Characters That Have Odd Counts | 1822. Sign of the Product of an Array |
1464. Maximum Product of Two Elements in an Array | 1323. Maximum 69 Number |
832. Flipping an Image | 1295. Find Numbers with Even Number of Digits |
1704. Determine if String Halves Are Alike | 1732. Find the Highest Altitude |
709. To Lower Case | 1688. Count of Matches in Tournament |
1684. Count the Number of Consistent Strings | 1588. Sum of All Odd Length Subarrays |
1662. Check If Two String Arrays are Equivalent | 1832. Check if the Sentence Is Pangram |
1678. Goal Parser Interpretation | 1389. Create Target Array in the Given Order |
1313. Decompress Run-Length Encoded List | 1281. Subtract the Product and Sum of Digits of an Integer |
1342. Number of Steps to Reduce a Number to Zero | 1528. Shuffle String |