zoukankan      html  css  js  c++  java
  • Codeforces Round #356 (Div. 2) C

    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
    Note

    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.

    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.

    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).

    题意:

    题解:

     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 #include<bits/stdc++.h>
     5 #include<algorithm>
     6 #include<queue>
     7 #define ll __int64
     8 using namespace std;
     9 int aa[10]={4,9,25,49};
    10 int pr[30]={2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97};
    11 char a[30];
    12 int x,y=0;
    13 int n=0,z,i,t=0;
    14 int main()
    15 {  
    16     for(i=0;i<15;i++)
    17     {
    18         printf("%d
    ",pr[i]);
    19         fflush(stdout);
    20         scanf("%s",a);
    21         if(strcmp(a,"yes")==0)
    22         y++;
    23         else
    24         n++;
    25         if(y>=2)
    26         break;
    27     }
    28     for(i=0;i<4;i++)
    29     {
    30         printf("%d
    ",aa[i]);
    31         fflush(stdout);
    32         scanf("%s",a);
    33         if(strcmp(a,"yes")==0)
    34         y++;
    35         else
    36         n++;
    37         if(y>=2)
    38         break;
    39     }
    40     if(y>=2)
    41         {
    42             printf("composite
    ");
    43             fflush(stdout);
    44         }
    45         else
    46         {
    47             printf("prime
    ");
    48             fflush(stdout);
    49         }
    50     return 0;
    51 }
  • 相关阅读:
    Gradle Gretty进行runAppDebug的Listening for transport dt_socket at address: 5005 的后续配置
    Oracle :value too large for column "SCHEMA"."TABLE"."COLUMN" (actual: 519, maximum: 500)的解决方案
    js file对象 文件大小转换可视容易阅读的单位
    JS的Event各种属性级target/currentTarget/relatedTarget各种目录的解释
    浏览器控制台是否打开的一些措施的讨论
    eclipse启动指定jvm的版本
    IDEA terminal无法从vim的编辑模式转换为命令模式
    win7 64位系统在IronPython2.7 rc安装后运行出现"ipy64/ipy.exe"does not exist解决办法
    VS2010 插件 CSS3 IS 2.1.1 在win7 64位机子上安装小记
    Asp.net ajax 1.0 绑定drowdownlist时取值问题
  • 原文地址:https://www.cnblogs.com/hsd-/p/5572985.html
Copyright © 2011-2022 走看看