Vasya和Petya正在玩一个猜数字游戏。Vasya想了一个1到n之间的数字，Petya需要通过询问是否能被某些数整除来猜测这个数字。题目要求找出最小的提问数量和应该问哪些数，以确保Petya能确定Vasya的数字。输出包括提问的数量和具体的提问数字。
链接：https://codeforces.com/problemset/problem/576/A
Vasya and Petya are playing a simple game. Vasya thought of number x between 1 and n, and Petya tries to guess the number.
Petya can ask questions like: "Is the unknown number divisible by number y?".
The game is played by the following rules: first Petya asks all the questions that interest him (also, he can ask no questions), and then Vasya responds to each question with a 'yes' or a 'no'. After receiving all the answers Petya should determine the number that Vasya thought of.
Unfortunately, Petya is not familiar with the number theory. Help him find the minimum number of questions he should ask to make a guaranteed guess of Vasya's number, and the numbers yi, he should ask the questions about.
Input
A single line contains number
最低0.47元/天 解锁文章
375
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
