Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- using namespace std;
- int prim(int x)
- {
- int i,ok=0,dif;
- for (i=2;i<=sqrt(x);i++)
- if (x%i==0)
- ok=1;
- return ok;
- }
- int i_prim(int n)
- {
- int i,p1,p2,dif;
- for (i=1;i<=n;i++)
- if (prim(i)==0)
- {
- p1=i;
- }
- for (i=n;i<=n*n;i++)
- if (prim(i)==0)
- {
- p2=i;
- break;
- }
- dif=p2-p1;
- return dif;
- }
- int main()
- {
- int n;
- cin>>n;
- cout<<i_prim(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement