总时间限制:
1000ms
内存限制:
65536kB
描述
Find a minimum prime which is greater than N.
输入
One positive integers N (N <= 100000).
输出
One integer.
样例输入
26
样例输出
29
#include<bits/stdc++.h>//Writed by Wangzhimin Date:2022.06.01
int n;
using namespace std;
int prime(int n){
for(int i=2;i<n;i++)
if(n%i==0)
return 0;
return 1;
}
int main()
{
scanf("%d",&n);
for(;;n++)
if(prime(n))break;
cout<<n;
return 0;
}