Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- //prímszám kereső
- int prime(int p)
- {
- int i;
- int m;
- for(i = 1; i <= p; i++)
- {
- if(p == 1)
- {
- printf("Nem prim\n");
- }
- if(i != 1 && i != p)
- {
- m = p % i;
- if(m == 0)
- {
- printf("Nem prim\n");
- return 0;
- }
- }
- }
- printf("Prim\n");
- return 1;
- }
- void primkereso()
- {
- int p;
- printf("Adj meg egy szamot: ");
- scanf("%d", &p);
- prime(p);
- }
- int main()
- {
- primkereso();
- ret
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement