http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1181
分析:
一开始交表过的 为自己的智商捉急啊
AC代码:
#include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include<list>
#include <bitset>
#include <climits>
#include <algorithm>
#define gcd(a,b) __gcd(a,b)
#define mset(a,n) memset(a,n,sizeof(a))
#define FIN freopen("input.txt","r",stdin)
#define FOUT freopen("output.txt","w",stdout)
typedef long long LL;
const LL mod=1e9+7;
const int INF=0x3f3f3f3f;
const double PI=acos(-1.0);
using namespace std;
/*int a[10000005];
int b[10000005];
int len1=1;
int len2;
void prim_prim(){
mset(a,0);
for (int i=2;i<=10000000;i++){
if (!a[i]){
a[len1++]=i;
for (int j=i+i;j<=10000000;j+=i) a[j]=1;
}
}
mset(b,0);
for (int i=2;i<len1;i++){
if (!b[i]){
b[len2++]=a[i];
for (int j=i+i;j<len1;j+=i) b[j]=1;
}
}
}
int main (){
prim_prim();
int n;
while (scanf ("%d",&n)!=EOF){
printf("%d\n",*lower_bound(b,b+len2,n));
}
return 0;
}*/
int prim[1000005]={0};
int main (){
int n;
while (scanf ("%d",&n)!=EOF){
int cnt=0;
for (int i=2;i<=1000200;i++){
if (!prim[i]){
cnt++;
if (!prim[cnt]&&i>=n){
printf ("%d\n",i);break;
}
for (int j=i+i;j<=1000200;j+=i) prim[j]=1;
}
}
}
return 0;
}