codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

679A.md (3426B)


      1 Source: https://codeforces.com/problemset/problem/679/A
      2 
      3 A. Bear and Prime 100
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 This is an interactive problem. In the output section below you will see the information about flushing the output.
     22 
     23 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.
     24 
     25 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.
     26 
     27 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".
     28 
     29 For example, if the hidden number is 14 then the system will answer "yes" only if you print 2, 7 or 14.
     30 
     31 When you are done asking queries, print "prime" or "composite" and terminate your program.
     32 
     33 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.
     34 
     35 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).
     36 
     37 Input
     38 
     39 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.
     40 
     41 Output
     42 
     43 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.
     44 
     45 In any moment you can print the answer "prime" or "composite" (without the quotes). After that, flush the output and terminate your program.
     46 
     47 To flush you can use (just after printing an integer and end-of-line):
     48 
     49 * fflush(stdout) in C++;
     50 * System.out.flush() in Java;
     51 * stdout.flush() in Python;
     52 * flush(output) in Pascal;
     53 * See the documentation for other languages.
     54 
     55 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.
     56 
     57 Examples
     58 
     59 Input
     60 
     61 ```
     62 yes  
     63 no  
     64 yes
     65 ```
     66 
     67 Output
     68 
     69 ```
     70 2  
     71 80  
     72 5  
     73 composite
     74 ```
     75 
     76 Input
     77 
     78 ```
     79 no  
     80 yes  
     81 no  
     82 no  
     83 no
     84 ```
     85 
     86 Output
     87 
     88 ```
     89 58  
     90 59  
     91 78  
     92 78  
     93 2  
     94 prime
     95 ```
     96 
     97 Note
     98 
     99 The hidden number in the first query is 30. In a table below you can see a better form of the provided example of the communication process.
    100 
    101 ![](https://espresso.codeforces.com/ea790051c34ea7d2761cd9b096412ca7c647a173.png)
    102 
    103 The hidden number is divisible by both 2 and 5. Thus, it must be composite. Note that it isn't necessary to know the exact value of the hidden number. In this test, the hidden number is 30.
    104 
    105 ![](https://espresso.codeforces.com/35c6952617fa94ec3e0ea8e63aa1c3c49b3ba420.png)
    106 
    107 59 is a divisor of the hidden number. In the interval [2, 100] there is only one number with this divisor. The hidden number must be 59, which is prime. Note that the answer is known even after the second query and you could print it then and terminate. Though, it isn't forbidden to ask unnecessary queries (unless you exceed the limit of 20 queries).