Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
150109_RecursividadPrimo
//Title of this code //gcc 4.8.2 #include <stdio.h> #include <math.h> short esPrimo(long p); long siguientePrimo(long p); short esCompuesto(long p); int main(void) { long p = 29; if(esPrimo(p)) { printf("%ld NO es PRIMO\n\n", p); } else { printf("%ld SI es PRIMO\n\n", p); } return 0; } short esPrimo(long p) { if(p == 0|| p == 1) return 1; long d; for(d = 2 ; d <= sqrt(p); d = siguientePrimo(d)); return p % d; } long siguientePrimo(long p) { do { p++; }while(esPrimo(p)); return p; }
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
C_141203_CTYPE
PREGUNTA 2, GUÍA 4, MÓDULO 3
alphabet2 pyramid right
3.1.3 Quick sort, Merge sort
Sunday assignment calculator
numeroleidodeordeninverso
150109_RecursividadFactorial
AC_setting_example
pseudo hw v.05
Quiz4
Please log in to post a comment.