Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int i_prim(int n)
- {
- int i,p1,p2,ok;
- ok=1;
- for (i=2;i*i<=n);i++)
- if (n%i==0)
- ok=0;
- if (ok==1)
- return 0;
- p1=n-1;
- while (ok==0)
- {
- ok=1;
- for (i=2;i*i<=p1;i++)
- if(p1%i==0)
- ok=0;
- p1--;
- }
- p2=n+1;
- ok=0;
- while (ok==0)
- {
- ok=1;
- for(i=2;i*i<=p2;i++)
- if (p2%i==0)
- ok=0;
- p2++;
- }
- return p2-p1;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement