Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ayudantia ejercicio 2 numero nashee
#include<stdio.h> #include<math.h> int esNumeroNashe(int); int esPrimo(int); int main() { int num; do { scanf("%i", &num); if(!num) { break; } if(esNumeroNashe(num)) { printf("%i es NASHEEE\n", num); } else { printf("%i no es nasheee :c\n", num); } }while(num != 0); printf("FIN"); return 0; } int esNumeroNashe(int num) { int sumaDigitosPrimos = 0; int sumaDigitosNoPrimos = 0; while(num != 0) { int dig = num % 10; if(esPrimo(dig)) { sumaDigitosPrimos += dig; } else { sumaDigitosNoPrimos += dig; } num /= 10; } if(sumaDigitosPrimos >= sumaDigitosNoPrimos) { return 1; } return 0; } int esPrimo(int num) { int i; if((num == 0) || (num == 1)) { return 0; } for(i = 2 ; i <= trunc(sqrt(num)) ; i++) { if (num % i == 0){ return 0; } } return 1; }
run
|
edit
|
history
|
help
0
variable number of arguments
WrongWay reversible iterator Copyright(C) 2016 Henry Kroll III www.thenerdshow.com
20171103_factorial
AVANCE PREGUNTA 10 DE CADENAS
back
Array non repeated alphabets
No Pyramid toggle
FILE Access 2
8 trajo semal 4
Coba