J

@jramsa

fixFirstInstruction : Corriger le chemin d'un mutant supersonique

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String fixFirstInstruction (List<String> instructions, List<Integer> target){ String[] instructionsList = instructions.toArray(new String[0]); ArrayList<String> firstInstructionsList = new ArrayList<>(Arrays.asList("FORWARD","TURN RIGHT","TURN LEFT","BACK")); System.err.println("TARGET (x,y) : (" + target.get(0) + "," + target.get(1)+")"); for(String fixFirstInstruction : fi

Red Team : Mot de passe root [MOYEN & HARD]

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String solve(String[] files, String[] clues) { if (clues!= null && clues.length > 0) { System.err.println("CLUES - size : " + clues.length + ". Read line " + (clues.length-1)); String password = clues[clues.length-1].split(" ")[1]; String document = clues[clues.length-1].split(" ")[0];

StreamPrinter : fermeture sécurisée d'un flux

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static void print(Reader reader) throws IOException { try{ int code; while ((code = reader.read()) != -1) { System.out.print((char) code);

Slug : Implémentation equals et hashcode

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static class BlogTitle { private String title; public BlogTitle(String title){ this.title=title;

decrypt : Un carnet mystérieux

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String decrypt(String s1, String s2, String s3){ char[] t1=s1.toCharArray(); char[] t2=s2.toCharArray(); char[] t3=s3.toCharArray(); String s="";

compute : Conversion octets en kibioctets ou mebioctets

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String compute(int bytesQuantity) { System.err.println(bytesQuantity); if(bytesQuantity<1024) return bytesQuantity+""; else if(bytesQuantity >=1024 && bytesQuantity< 1048576)

findLargest : returns the largest number from list

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int findLargest(List<Integer> numbers) { int largest=numbers.get(0); for(int i=1; i<numbers.size(); i++){ if(numbers.get(i)>=largest) largest=numbers.get(i);

findSmallestInterval : retourne le plus petit intervalle positif entre deux éléments du tableau

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int findSmallestInterval(List<Integer> numbers){ if(numbers.size()>=2){ int interval= Math.abs(numbers.get(0)-numbers.get(1)); for(int i=0; i<numbers.size(); i++){ for(int j=i+1; j<numbers.size(); j++){

sandPile : tas de sable

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static void showSandPile(int[][] pile){ System.out.println("Affichage du grid : "); for(int i=0; i<pile.length; i++){ for(int j=0; j<pile[i].length; j++){ System.out.print(pile[i][j]);

exists : Recherche d'un entier dans un tableau

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static boolean exists(int[] ints, int k){ System.err.println("--Recherche d'un entier dans un tableau--"); int result = Arrays.binarySearch(ints,k); // recherche dichotomique return result >= 0; }

closestToZero/PlusPresDeZero : entier plus près de 0

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int closestToZero(int[] ints){ if(ints == null || ints.length==0) return 0;

countPeaks : Capteur de réactivité : nombre de pics

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int countPeaks(List<Double> values){ if(values.isEmpty()) return 0; else{ int cpt=0;

countClap : CLAP : si n contient un 7 ou est divisible par 7 ou la somme de ses digits est divisible

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int clap(int n){ int clap=0; for(int i=1; i<n+1; i++){ boolean hasSeven=false; char[] digits=(i+"").toCharArray();

SortPackage v2 : solve

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; /** *https://gist.github.com/youssef3wi/f4eb32abcf670085fe99877c7668984c * You work in an automated factory and your objective is to write the function that will dispatch the packages to the correct stack, * according to their volume and mass. * * - A package is bulky if its volume (Width x Height x Length) is greater than or equal to 1,000,000 cm³ or when one of

SortPackage v1 : solve

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int solve(int weight0, int weight1, int weight2){ if(weight0 >= weight1 && weight0 >= weight2) return 0; else if(weight1 >= weight0 && weight1 >= weight2) return 1;

decalageBitABit : Décalage bit à bit gauche >>

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String decalageBitABit(int a, int b){ return Integer.toBinaryString(a >> b); } public static void main(String[] args) {

adjustQuantities : Multiply ingredients quantities of a recipe

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static List<String> adjustQuantities(List<String> ingredients, int nbPersons){ ArrayList<String> list= new ArrayList<>(); for(String s : ingredients){ String line=""; String[] t=s.split(" ");

filterWords : word filtering

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static String[] filterWords(String [] words,String letters){ char[] t = letters.toCharArray(); ArrayList<String> list = new ArrayList<>(); for(int i=0; i<words.length; i++){

Autumn leaves : remainingLeaves

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; class Main { public static int remainingLeaves(int width,int height,int[][] leaves,String winds){ //Calcul directions vents char[] dir=winds.toCharArray(); for(int ind=0; ind<dir.length; ind++){ if(dir[ind]=='R'){

solve : Déplacement d'atomes sur une grille

Java
1 year ago
import java.util.*; import java.lang.*; import java.io.*; // The main method must be in a class named "Main". class Main { public static List<String> solve(int protonsStart, int neutronsStart, int protonsTarget, int neutronsTarget){ System.err.println("Start : " + protonsStart + " " + neutronsStart); System.err.println("Target : " + protonsTarget + " " + neutronsTarget);