CF679A Bear and Prime 100 交互题

looooooogn

于 2018-11-09 18:41:07 发布

阅读量935

点赞数

分类专栏： CF

本文链接：https://blog.youkuaiyun.com/qq_40273481/article/details/83901967

版权

这是一道交互式问题，需要通过询问来判断隐藏在区间[2, 100]内的数字是否为素数。可以询问不超过20次，每次询问一个在[2, 100]范围内的数字，如果该数字是隐藏数的因子，系统会回答'yes'，否则回答'no'。最后根据询问结果判断并输出'prime'或'composite'。" 113214500,10294171,PHP变量赋值与引用赋值详解,"['PHP', '变量', '赋值', '引用', '内存管理']

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 outp