题目贴上：
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.
题意：选出n个数，且相邻的数不能互相整除
思路：一上来就想到选n个不相同的素数，发现有点麻烦，直接选[n,2*n-1] 这n个数就肯定可以了
#include<iostream> #include<map> using namespace std; typedef long long int ll; typedef __int64 bi; typedef double db; const int MAX = 1e6+5; const int INF = 0x7fffffff; char s[MAX]; int vis[MAX]={0}; map<int,int> be; map<int,int> en; int main(void) { int n; cin>>n; for(int i=n;i<=2*n-1;++i) cout<<i<<" "; cout<<endl; return 0; }
