CF 327B 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 个数字。  首先这一串数字是单调递增的。 第二是后面的数字不能被前面的数字整除。。  我感觉题目给的样例明显想误导人嘛。最后这句If there are multiple solutions you can output any one.  才是重点。。

题解：

   因为 N<10000  而 数字大小 <1000000。。那太简单了。。 直接输出   100000 一直到 100000 + n-1。。就结束了。。不要问我为什么了。。这是小学问题了。。

/*
 * @author ipqhjjybj
 * @date  20130704
 *
 */
#include <cstdio>
#include <cstring>
#include <iostream>
#define clr(x,k) memset((x),(k),sizeof(x))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MAXN 10000001

int main(){
    int i,n;
    while(scanf("%d",&n)!=EOF){
        printf("1000000");
        for(i=2;i<=n;i++)
            printf(" %d",i+1000000);
        printf("\n");
    }
    return 0;
}