Skip to content

Commit

Permalink
M4 Flujos Ciclos y Metodos D9 - Desafio Guiado
Browse files Browse the repository at this point in the history
  • Loading branch information
Ramon Bernabe Munoz Navarrete committed May 16, 2024
1 parent 947bcf9 commit f9c62ec
Show file tree
Hide file tree
Showing 6 changed files with 145 additions and 0 deletions.
18 changes: 18 additions & 0 deletions Vinceto/src/D9/CambiarWhile.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
package D9;

public class CambiarWhile {
/*public static void main(String[] args) {
int i = 0;
while (i<50) {
i+=1;
System.out.printf("Iteración %d\n", i);
}
}*/
public static void main(String[] args) {
int i = 0;
do {
i += 1;
System.out.printf("Iteración %d\n", i);
} while (i < 50);
}
}
31 changes: 31 additions & 0 deletions Vinceto/src/D9/Fibonacci.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,31 @@
package D9;
import Util.SScan;
import Util.Instrucciones;

public class Fibonacci {
public static void main(String[] args) {
String nombreApp = "la secuencia de Fibonacci: ";
String[] instrucciones = { "indique cuántos elementos de la serie de Fibonacci se deben mostrar."};
Instrucciones instruccionesApp = new Instrucciones(nombreApp, instrucciones);
instruccionesApp.mostrarInstrucciones();

SScan sscan = new SScan();
int n = (int) sscan.escanear("int");

int a = 0, b = 1;
System.out.println(a);

if (n > 1) {
System.out.println(b);
}

for (int i = 2; i < n; i++) {
int next = a + b;
System.out.println(next);
a = b;
b = next;
}

sscan.close();
}
}
20 changes: 20 additions & 0 deletions Vinceto/src/D9/SoloPares.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
package D9;
import Util.Instrucciones;
import Util.SScan;

public class SoloPares {
public static void main(String[] args) {
String nombreApp = "Solo pares: ";
String[] instrucciones = { "Ingresa un parámetro n para mostrar los primeros n pares."};
Instrucciones instruccionesApp = new Instrucciones(nombreApp, instrucciones);
instruccionesApp.mostrarInstrucciones();
SScan sscan = new SScan();
int n = (int) sscan.escanear("int");

for (int i = 0; i < n; i++) {
System.out.println(i * 2);
}

sscan.close();
}
}
21 changes: 21 additions & 0 deletions Vinceto/src/D9/SoloPares2.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
package D9;
import Util.Instrucciones;
import Util.SScan;

public class SoloPares2 {
public static void main(String[] args) {
String nombreApp = "Solo pares 2: ";
String[] instrucciones = { "Ingresa un parámetro n para mostrar los primeros n pares sin contar el 0"};
Instrucciones instruccionesApp = new Instrucciones(nombreApp, instrucciones);
instruccionesApp.mostrarInstrucciones();

SScan sscan = new SScan();
int n = (int) sscan.escanear("int");

for (int i = 1; i <= n; i++) {
System.out.println(i * 2);
}

sscan.close();
}
}
26 changes: 26 additions & 0 deletions Vinceto/src/D9/SumaImpar.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,26 @@
package D9;
import Util.Instrucciones;
import Util.SScan;

public class SumaImpar {
public static void main(String[] args) {
String nombreApp = "Suma Impar: ";
String[] instrucciones = { "Suma todos los valores impares, desde 0 hasta n, donde n es ingresado por el usuario."};
Instrucciones instruccionesApp = new Instrucciones(nombreApp, instrucciones);
instruccionesApp.mostrarInstrucciones();

SScan sscan = new SScan();
int n = (int) sscan.escanear("int");

int suma = 0;
for (int i = 1; i <= n; i++) {
if (i % 2 != 0) {
suma += i;
}
}

System.out.println(suma);

sscan.close();
}
}
29 changes: 29 additions & 0 deletions Vinceto/src/D9/SumaImparLimite.java
Original file line number Diff line number Diff line change
@@ -0,0 +1,29 @@
package D9;
import Util.Instrucciones;
import Util.SScan;

public class SumaImparLimite {
public static void main(String[] args) {
String nombreApp = "la secuencia de Fibonacci: ";
String[] instrucciones = {
"ingresa el límite inferior (min) para realizar la suma de los impares.",
"Ingresa el límite superior (max) del intervalo, para realizar la suma de los impares."};
Instrucciones instruccionesApp = new Instrucciones(nombreApp, instrucciones);
instruccionesApp.mostrarInstrucciones();

SScan sscan = new SScan();
int min = (int) sscan.escanear("int");
int max = (int) sscan.escanear("int");

int suma = 0;
for (int i = min; i <= max; i++) {
if (i % 2 != 0) {
suma += i;
}
}

System.out.println(suma);

sscan.close();
}
}

0 comments on commit f9c62ec

Please sign in to comment.