From 3f735efeaa040783cad610d0208c8de4d38d0bd6 Mon Sep 17 00:00:00 2001 From: Qv1ko Date: Thu, 7 Dec 2023 01:44:40 +0100 Subject: [PATCH 1/5] Reto #44 - Java --- .../java/Qv1ko.java" | 95 +++++++++++++++++++ 1 file changed, 95 insertions(+) create mode 100644 "Retos/Reto #44 - ADIVINANZAS MATEM\303\201TICAS [Media]/java/Qv1ko.java" diff --git "a/Retos/Reto #44 - ADIVINANZAS MATEM\303\201TICAS [Media]/java/Qv1ko.java" "b/Retos/Reto #44 - ADIVINANZAS MATEM\303\201TICAS [Media]/java/Qv1ko.java" new file mode 100644 index 0000000000..6afd96fcea --- /dev/null +++ "b/Retos/Reto #44 - ADIVINANZAS MATEM\303\201TICAS [Media]/java/Qv1ko.java" @@ -0,0 +1,95 @@ +import java.util.Scanner; +import java.util.Timer; +import java.util.TimerTask; + +public class Qv1ko { + + static boolean end = false; + + public static void main(String[] args) { + riddle(); + } + + private static void riddle() { + + int x = 1, y = 1, ope1 = 0, ope2 = 0, operation = 0, correct = 0; + String[] operators = new String[] {"+", "-", "*", "/"}; + double result = 0; + String answer = ""; + + while (!end) { + + ope1 = (int)(Math.random() * (int)Math.pow(10, x)); + ope2 = (int)(Math.random() * (int)Math.pow(10, y)); + + operation = (int)(Math.random() * 4); + + if (operation == 0) { + result = ope1 + ope2; + } else if (operation == 1) { + result = ope1 - ope2; + } else if (operation == 2) { + result = ope1 * ope2; + } else if (operation == 3) { + + while (ope2 == 0) { + ope2 = (int)(Math.random() * (int)Math.pow(10, y)); + } + + result = ope1 / ope2; + + } + + answer = question(ope1, ope2, operators[operation]); + + if (end) { + break; + } else if (Double.parseDouble(answer) == result) { + + correct++; + + if (correct % 5 == 0) { + if (x > y) { + y++; + } else { + x++; + } + } + + } else { + end = true; + } + + System.out.println(ope1 + " " + operators[operation] + " " + ope2 + " = " + result); + + } + + System.out.println("You got " + correct + " questions correct"); + + } + + private static String question(int num1, int num2, String operation) { + + Scanner sc = new Scanner(System.in); + String answer = ""; + + Timer timer = new Timer(); + timer.schedule(new TimerTask() { + public void run() { + System.out.println("\nThe time is over"); + end = true; + } + }, 3000); + + try { + System.out.print(num1 + " " + operation + " " + num2 + " = "); + answer = sc.nextLine(); + } finally { + timer.cancel(); + } + + return answer; + + } + +} From d9d52cb568ce2a9af9e913ecce1908997ff51b9d Mon Sep 17 00:00:00 2001 From: Qv1ko Date: Thu, 7 Dec 2023 02:43:43 +0100 Subject: [PATCH 2/5] Reto #47 - Java --- .../java/Qv1ko.java" | 37 +++++++++++++++++++ 1 file changed, 37 insertions(+) create mode 100644 "Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" diff --git "a/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" "b/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" new file mode 100644 index 0000000000..9f2b301e94 --- /dev/null +++ "b/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" @@ -0,0 +1,37 @@ +import java.util.HashMap; +import java.util.Scanner; + +class Qv1ko { + + public static void main(String[] args) { + wordPoints(); + } + + private static void wordPoints() { + + HashMap letterPoints = new HashMap() {{ put('a', 1);put('b', 2); put('c', 3); put('d', 4); put('e', 5); put('f', 6); put('g', 7); put('h', 8); put('i', 9); put('j', 10); put('k', 11); put('l', 12); put('m', 13); put('n', 14); put('ñ', 15); put('o', 16); put('p', 17); put('q', 18); put('r', 19); put('s', 20); put('t', 21); put('u', 22); put('v', 23); put('w', 24); put('x', 25); put('y', 26); put('z', 27); }}; + String word = ""; + int points = 0; + Scanner sc = new Scanner(System.in); + + while (points != 100) { + + points = 0; + + System.out.print("Type a word: "); + word = sc.nextLine().toLowerCase(); + + for (char letter : word.toCharArray()) { + points += letterPoints.get(letter); + } + + System.out.println("The word " + word + " has " + points + " points"); + + } + + + sc.close(); + + } + +} \ No newline at end of file From cd84d7400c18597a25b075e14e0330d9a2373500 Mon Sep 17 00:00:00 2001 From: Qv1ko Date: Thu, 7 Dec 2023 23:26:57 +0100 Subject: [PATCH 3/5] Reto #45 - Java --- .../java/Qv1ko.java" | 123 ++++++++++++++++++ 1 file changed, 123 insertions(+) create mode 100644 "Retos/Reto #45 - EL CALENDARIO DE ADEVIENTO 2023 [F\303\241cil]/java/Qv1ko.java" diff --git "a/Retos/Reto #45 - EL CALENDARIO DE ADEVIENTO 2023 [F\303\241cil]/java/Qv1ko.java" "b/Retos/Reto #45 - EL CALENDARIO DE ADEVIENTO 2023 [F\303\241cil]/java/Qv1ko.java" new file mode 100644 index 0000000000..fd8527e550 --- /dev/null +++ "b/Retos/Reto #45 - EL CALENDARIO DE ADEVIENTO 2023 [F\303\241cil]/java/Qv1ko.java" @@ -0,0 +1,123 @@ +import java.io.BufferedReader; +import java.io.IOException; +import java.io.InputStreamReader; +import java.util.ArrayList; + +class Qv1ko { + + public static void main(String[] args) { + calendar(); + } + + private static void calendar() { + + ArrayList participants = new ArrayList(); + String participant = ""; + int position = 0; + boolean on = true, exit = false; + BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); + + while (!exit) { + + System.out.print("\n1) Add participant | 2) Show participants | 3) Delete participant | 4) Carry out the draw | 5) Exit\nSelect one option: "); + + try { + switch(br.readLine()) { + + case "1": + + System.out.println("\nAdd participant\n"); + + System.out.print("Name: "); + participant = br.readLine(); + + for (String p : participants) { + if (participant.equalsIgnoreCase(p)) { + System.out.println("\nThe participant already exists\n"); + on = false; + break; + } + } + + if (on) { + participants.add(participant); + } + + break; + + case "2": + + System.out.println("\nList of participants\n"); + + for (int i = 0; i < participants.size(); i++) { + System.out.println("- " + participants.get(i)); + } + + break; + + case "3": + + if (participants.size() > 0) { + + System.out.println("\nDelete participant\n"); + + System.out.print("Name: "); + participant = br.readLine(); + + for (int i = 0; i < participants.size(); i++) { + if (participant.equalsIgnoreCase(participants.get(i))) { + participants.remove(i); + on = false; + break; + } + } + + if (on) { + System.out.println("\nParticipant does not exist"); + } else { + System.out.println("\nThe participant has been eliminated"); + } + + } else { + System.out.println("\nNo participants"); + } + + break; + + case "4": + + if (participants.size() > 0) { + + position = (int)(Math.random() * participants.size()); + System.out.println("\nThe winner is " + participants.get(position)); + + participants.remove(position); + + } else { + System.out.println("\nNo participants"); + } + + break; + + case "5": + + System.out.println("\nLeaving...\n"); + exit = true; + break; + + default: + System.out.println("\nSelect a number"); + + } + + on = true; + + } catch (IOException exc) { + System.out.println("\nInput error\n"); + } + + } + + } + +} From 155cc3f2ebd177fcbeb31012c554c985f8399a9f Mon Sep 17 00:00:00 2001 From: Qv1ko Date: Thu, 7 Dec 2023 23:28:47 +0100 Subject: [PATCH 4/5] Reto #47 - Java --- .../java/Qv1ko.java" | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git "a/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" "b/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" index 9f2b301e94..99705d7e5d 100644 --- "a/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" +++ "b/Retos/Reto #47 - LA PALABRA DE 100 PUNTOS [F\303\241cil]/java/Qv1ko.java" @@ -34,4 +34,4 @@ private static void wordPoints() { } -} \ No newline at end of file +} From f75084c403ba90a32e6d311850f1c9ca98b65ce9 Mon Sep 17 00:00:00 2001 From: Qv1ko Date: Fri, 8 Dec 2023 04:37:31 +0100 Subject: [PATCH 5/5] Reto #46 - Java --- .../java/Qv1ko.java | 125 ++++++++++++++++++ 1 file changed, 125 insertions(+) create mode 100644 Retos/Reto #46 - LA CARRERA DE COCHES [Media]/java/Qv1ko.java diff --git a/Retos/Reto #46 - LA CARRERA DE COCHES [Media]/java/Qv1ko.java b/Retos/Reto #46 - LA CARRERA DE COCHES [Media]/java/Qv1ko.java new file mode 100644 index 0000000000..cc907a1a9e --- /dev/null +++ b/Retos/Reto #46 - LA CARRERA DE COCHES [Media]/java/Qv1ko.java @@ -0,0 +1,125 @@ +public class Qv1ko { + + private static char END = '#'; + private static char ROAD = '_'; + private static char TREE = 'T'; + private static char CAR = '<'; + private static char SHOCK = 'x'; + + public static void main(String[] args) { + race(); + } + + private static void race() { + + int turn = 1; + boolean shockCar1 = false, shockCar2 = false; + + String track1 = trackGenerator(); + String track2 = trackGenerator(); + + System.out.println("\nSTART\n"); + + System.out.println(track1); + System.out.println(track2); + + while (track1.toCharArray()[0] != CAR && track2.toCharArray()[0] != CAR) { + + try { + Thread.sleep(10000); + } catch (InterruptedException exc) { + exc.printStackTrace(); + } + + System.out.println("\nTurn " + turn + "\n"); + + if (!shockCar1) { + + track1 = advance(track1, (int)(Math.random() * 3) + 1); + + for (char element : track1.toCharArray()) { + if (element == SHOCK) { + shockCar1 = true; + break; + } + } + + } else { + shockCar1 = false; + } + + if (!shockCar2) { + + track2 = advance(track2, (int)(Math.random() * 3) + 1); + + for (char element : track2.toCharArray()) { + if (element == SHOCK) { + shockCar2 = true; + break; + } + } + + } else { + shockCar2 = false; + } + + System.out.println(track1); + System.out.println(track2); + + turn++; + + } + + if (track1.toCharArray()[0] == track2.toCharArray()[0]) { + System.out.println("\nThe race ended in a tie"); + } else { + System.out.println("\nThe race winner is " + ((track1.toCharArray()[0] == CAR) ? "car 1" : "car 2")); + } + + } + + private static String trackGenerator() { + + String road = ""; + int trees = 0; + + for (int i = 0; i < 10; i++) { + if (trees < 3 && (int)(Math.random() * 10) < 3) { + road += TREE; + trees++; + } else { + road += ROAD; + } + } + + return END + road + CAR; + + } + + private static String advance(String track, int positions) { + + String clearTrack = "", newTrack = ""; + int newPosition = 0; + + for (int i = 0; i < track.length(); i++) { + if (track.toCharArray()[i] == CAR || track.toCharArray()[i] == SHOCK) { + newPosition = (i - positions < 0) ? 0 : i - positions; + clearTrack += '_'; + } else { + clearTrack += track.toCharArray()[i]; + } + } + + for (int i = 0; i < clearTrack.length(); i++) { + if (i == newPosition) { + newTrack += (clearTrack.toCharArray()[newPosition] == TREE) ? SHOCK : CAR; + } else { + newTrack += clearTrack.toCharArray()[i]; + } + } + + return newTrack; + + } + +}