Codeforces Round #319 (Div. 2) 577C Vasya and Petya's Game(筛选法)

C. Vasya and Petya's Game

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 n (1 ≤ n ≤ 103).

Output

Print the length of the sequence of questions k (0 ≤ k ≤ n), followed by k numbers — the questions yi (1 ≤ yi ≤ n).

If there are several correct sequences of questions of the minimum length, you are allowed to print any of them.

Sample test(s)

input

4

output

3
2 4 3 

input

6

output

4
2 4 3 5 

Note

The sequence from the answer to the first sample test is actually correct.

If the unknown number is not divisible by one of the sequence numbers, it is equal to 1.

If the unknown number is divisible by 4, it is 4.

If the unknown number is divisible by 3, then the unknown number is 3.

Otherwise, it is equal to 2. Therefore, the sequence of questions allows you to guess the unknown number. It can be shown that there is no correct sequence of questions of length 2 or shorter.

Vasya猜一个1-n的数字x，Petya猜这个数字。Petya一次性问x是否可以被y整除的所有问题，Vasys回答，问你最少问的问题数以及问

的顺序是什么？

筛选法预处理将所有素数存到prime数组中，每次res <= n的时候就保存res到ans数组中，而后res *= prime[i]，最后输出答案。

AC代码：

#include "iostream"
#include "cstdio"
#include "cstring"
#include "algorithm"
using namespace std;
const int MAXN = 1005;
int n, num, cnt, prime[MAXN], ans[MAXN];
bool judge(int x)
{
	for(int i = 2; i * i <= x; ++i)
		if(x % i == 0) return false;
	return true;
}
int main(int argc, char const *argv[])
{
	scanf("%d", &n);
	for(int i = 2; i < MAXN; ++i)
		if(judge(i)) prime[num++] = i;
	for(int i = 0; i < num; ++i) {
		int res = prime[i];
		while(res <= n) {
			ans[cnt++] = res;
			res *= prime[i];
		}
	}
	printf("%d\n", cnt);
	for(int i = 0; i < cnt; ++i)
		printf("%d ", ans[i]);
	printf("\n");
	return 0;
}