Created
September 22, 2019 01:07
-
-
Save parzibyte/a4b8089a401395e3c714fff152b9e882 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
/* | |
Números primos en un rango | |
https://parzibyte.me/blog | |
*/ | |
import java.util.Scanner; | |
class Main { | |
public static void main(String[] args) { | |
int inicio, fin, contador = 0; | |
Scanner sc = new Scanner(System.in); | |
System.out.println("Escribe el inicio:"); | |
inicio = sc.nextInt(); | |
System.out.println("Escribe el fin:"); | |
fin = sc.nextInt(); | |
for (int x = inicio; x <= fin; x++) { | |
if (esPrimo(x)) { | |
contador++; | |
System.out.print(String.valueOf(x) + ","); | |
} | |
} | |
System.out.printf("\nTotal: %d", contador); | |
sc.close(); | |
} | |
public static boolean esPrimo(int numero) { | |
// El 0, 1 y 4 no son primos | |
if (numero == 0 || numero == 1 || numero == 4) { | |
return false; | |
} | |
for (int x = 2; x < numero / 2; x++) { | |
// Si es divisible por cualquiera de estos números, no | |
// es primo | |
if (numero % x == 0) | |
return false; | |
} | |
// Si no se pudo dividir por ninguno de los de arriba, sí es primo | |
return true; | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment