1 second
256 megabytes
standard input
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.
The input contains a single integer: n (1 ≤ n ≤ 105).
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.
3
2 9 15
5
11 14 20 27 31
解题说明：此题就是求一个含n个元素数列，元素从小到大，并且后面的数不能被前面的数整除。最简单的方法是取n到2n-1这n个数字，显然后面的数不能被前面的数整除，而且元素也是从小到大排列的。
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <string>
#include<set>
#include <algorithm>
using namespace std;
int main()
{
int n,i;
scanf("%d",&n);
for(i=n;i<2*n;i++)
{
printf("%d ",i);
}
printf("\n");
return 0;
}