Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int prim(int n)
- {
- int d=2;
- while(d*d<=n && n%d!=0)
- {
- d++;
- }
- return d*d>n && n>1;
- }
- int primmaimic(int n)
- {
- if(n==1)
- {
- return 0;
- }else
- {
- int i=n-1;
- while(!(prim(i)))
- i--;
- return i;
- }
- }
- int primmaimare(int n)
- {
- int i=n+1;
- while(!(prim(i)))
- i++;
- return i;
- }
- int main(void)
- {
- int n;
- scanf("%d",&n);
- int maimic=primmaimic(n);
- int maimare=primmaimare(n);
- if(n-maimic<maimare-n)
- {
- printf("%d", maimic);
- }else
- {
- printf("%d", maimare);
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement