Codeforces 372B B. Hungry Sequence

B. Hungry Sequence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Iahub and Iahubina went to a date at a luxury restaurant. Everything went fine until paying for the food. Instead of money, the waiter wants Iahub to write a Hungry sequence consisting of n integers.

A sequence a1, a2, ..., an, consisting of n integers, is Hungry if and only if:

 

• Its elements are in increasing order. That is an inequality ai < aj holds for any two indices i, j (i < j).
• For any two indices i and j (i < j), aj must not be divisible by ai.

 

Iahub is in trouble, so he asks you for help. Find a Hungry sequence with n elements.

Input

The input contains a single integer: n (1 ≤ n ≤ 105).

Output

Output a line that contains n space-separated integers a1 a2, ..., an (1 ≤ ai ≤ 107), representing a possible Hungry sequence. Note, that each ai must not be greater than 10000000 (107) and less than 1.

If there are multiple solutions you can output any one.

Sample test(s)

input

3

output

2 9 15

input

5

output

11 14 20 27 31

 

思路：因为n <= 100000,ai <= 10000000,所以一定可以在100000 ——10000000 之间找到100000 个 增加的数，而且

满足题意，因为100000的 倍数大于等于10000000000，所以。。。。。。。好水

 

代码：

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cstdlib>
using namespace std;
int n;
int main()
{
while(~scanf("%d",&n))
{
for(int i = 100000;i <= 100000 + n - 1;i ++)
printf("%d ",i);
printf("\n");
}
return 0;
}

转载于:https://www.cnblogs.com/GODLIKEING/p/3331274.html