codeforces 680C Bear and Prime 100(数论)

C. Bear and Prime 100

time limit per test

 1 second

memory limit per test

 256 megabytes

input

 standard input

output

 standard output

This is an interactive problem. In the output section below you will see the information about flushing the output.

Bear Limak thinks of some hidden number — an integer from interval [2, 100]. Your task is to say if the hidden number is prime or composite.

Integer x > 1 is called prime if it has exactly two distinct divisors, 1 and x. If integer x > 1 is not prime, it's called composite.

You can ask up to 20 queries about divisors of the hidden number. In each query you should print an integer from interval [2, 100]. The system will answer "yes" if your integer is a divisor of the hidden number. Otherwise, the answer will be "no".

For example, if the hidden number is 14 then the system will answer "yes" only if you print 2, 7 or 14.

When you are done asking queries, print "prime" or "composite" and terminate your program.

You will get the Wrong Answer verdict if you ask more than 20 queries, or if you print an integer not from the range [2, 100]. Also, you will get the Wrong Answer verdict if the printed answer isn't correct.

You will get the Idleness Limit Exceeded verdict if you don't print anything (but you should) or if you forget about flushing the output (more info below).

Input

After each query you should read one string from the input. It will be "yes" if the printed integer is a divisor of the hidden number, and "no" otherwise.

Output

Up to 20 times you can ask a query — print an integer from interval [2, 100] in one line. You have to both print the end-of-line character and flush the output. After flushing you should read a response from the input.

In any moment you can print the answer "prime" or "composite" (without the quotes). After that, flush the output and terminate your program.

To flush you can use (just after printing an integer and end-of-line):

• fflush(stdout) in C++;
• System.out.flush() in Java;
• stdout.flush() in Python;
• flush(output) in Pascal;
• See the documentation for other languages.

Hacking. To hack someone, as the input you should print the hidden number — one integer from the interval [2, 100]. Of course, his/her solution won't be able to read the hidden number from the input.

Examples

input

yes
no
yes

output

2
80
5
composite

input

no
yes
no
no
no

output

58
59
78
78
2
prime

题意：

第一次做这种交互题。现在有一个数【2,100】之间；你可以提出最多20次询问，会返回yes或no表示这个数是不是这个数的因子。

思路：

刚开始我把【2,100】中所有的素数都输出了一遍，发现大概有25，然后我发现如果一个数不是质数那么这个数至少有两个质数作为这个数的因数（如 6 = 2*3 ； 4 = 2*2）

所以【2,100】中大于20的质数一定不是其他数的因数，所以可以不用考虑，减去大于五十的数后剩下2,3,5,7,11,13,17,19,23,29,31,37,41,43,47大概15个数，现在还有一种情况要考虑那就是一个数是质数的n次时（如4 = 2*2），这时可以发现只有2,3,5,7能出现这种情况，且他的n次方（n>1）必被他们的二次方整除，所以再加上4,9,25,49。正好十九个数。

代码：

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAX_N = 1e5+9;
int prime[20] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,4,25,9,49};
int vec[MAX_N];
int main()
{
    int N,M,T;
    string s;
    int num = 0;
    for(int i=0;i<19;i++)
    {
        printf("%d\n",prime[i]);
        //fflush(stdout);
        cin>>s;
        if(s == "yes") num++;
    }
    if(num>=2) 
    {
        printf("composite\n");
    }
    else 
    {
        printf("prime\n");
    }     
    //fflush(stdout);

    return 0;
}