@cyrilverloop/codingame-configuration 1.12.0 → 1.14.0

package/config/hard/XEggProblem/config.json

@@ -0,0 +1,48 @@
+{
+    "path": "hard/XEggProblem",
+    "name": "X egg problem",
+    "alphanumName": "XEggProblem",
+    "link": "https://www.codingame.com/ide/puzzle/x-egg-problem",
+    "tests": [
+        {
+            "name": "100 floors 1 egg",
+            "alphanumName": "AHundredFloors1Egg",
+            "file": "01 - 100 floors 1 egg.txt"
+        },
+        {
+            "name": "1 floor 4 eggs",
+            "alphanumName": "OneFloor4Eggs",
+            "file": "02 - 1 floor 4 eggs.txt"
+        },
+        {
+            "name": "100 floors 2 eggs",
+            "alphanumName": "AHundredFloors2Eggs",
+            "file": "03 - 100 floors 2 eggs.txt"
+        },
+        {
+            "name": "100 floors 3 eggs",
+            "alphanumName": "AHundredFloors3Eggs",
+            "file": "04 - 100 floors 3 eggs.txt"
+        },
+        {
+            "name": "1000 floors 5 eggs",
+            "alphanumName": "AThousandFloors5Eggs",
+            "file": "05 - 1000 floors 5 eggs.txt"
+        },
+        {
+            "name": "1000000 floors 10 eggs",
+            "alphanumName": "OneMillionFloors10eggs",
+            "file": "06 - 1000000 floors 10 eggs.txt"
+        },
+        {
+            "name": "100000 floors 20 eggs",
+            "alphanumName": "AHundredThousandFloors20Eggs",
+            "file": "07 - 100000 floors 20 eggs.txt"
+        },
+        {
+            "name": "1 mln floors 4 eggs",
+            "alphanumName": "OneMlnFloors4Eggs",
+            "file": "08 - 1 mln floors 4 eggs.txt"
+        }
+    ]
+}

package/config/hard/XEggProblem/input/01 - 100 floors 1 egg.txt

@@ -0,0 +1,2 @@
+100
+1

package/config/hard/XEggProblem/input/02 - 1 floor 4 eggs.txt

@@ -0,0 +1,2 @@
+1
+4

package/config/hard/XEggProblem/input/03 - 100 floors 2 eggs.txt

@@ -0,0 +1,2 @@
+100
+2

package/config/hard/XEggProblem/input/04 - 100 floors 3 eggs.txt

@@ -0,0 +1,2 @@
+100
+3

package/config/hard/XEggProblem/input/05 - 1000 floors 5 eggs.txt

@@ -0,0 +1,2 @@
+1000
+5

package/config/hard/XEggProblem/input/06 - 1000000 floors 10 eggs.txt

@@ -0,0 +1,2 @@
+1000000
+10

package/config/hard/XEggProblem/input/07 - 100000 floors 20 eggs.txt

@@ -0,0 +1,2 @@
+100000
+20

package/config/hard/XEggProblem/input/08 - 1 mln floors 4 eggs.txt

@@ -0,0 +1,2 @@
+1000000
+4

package/config/hard/XEggProblem/output/01 - 100 floors 1 egg.txt

@@ -0,0 +1 @@
+100

package/config/hard/XEggProblem/output/02 - 1 floor 4 eggs.txt

@@ -0,0 +1 @@
+1

package/config/hard/XEggProblem/output/03 - 100 floors 2 eggs.txt

@@ -0,0 +1 @@
+14

package/config/hard/XEggProblem/output/04 - 100 floors 3 eggs.txt

@@ -0,0 +1 @@
+9

package/config/hard/XEggProblem/output/05 - 1000 floors 5 eggs.txt

@@ -0,0 +1 @@
+11

package/config/hard/XEggProblem/output/06 - 1000000 floors 10 eggs.txt

@@ -0,0 +1 @@
+21

package/config/hard/XEggProblem/output/07 - 100000 floors 20 eggs.txt

@@ -0,0 +1 @@
+17

package/config/hard/XEggProblem/output/08 - 1 mln floors 4 eggs.txt

@@ -0,0 +1 @@
+71

package/config/medium/BlunderEpisode1/code/CGCode.cpp

@@ -0,0 +1,22 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main()
+{
+    int l;
+    int c;
+    cin >> l >> c; cin.ignore();
+    for (int i = 0; i < l; i++) {
+        string row;
+        getline(cin, row);
+    }
+
+    // Write an answer using cout. DON'T FORGET THE "<< endl"
+    // To debug: cerr << "Debug messages..." << endl;
+
+    cout << "answer" << endl;
+}

package/config/medium/BlunderEpisode1/code/CGCode.java

@@ -0,0 +1,23 @@
+import java.util.*;
+import java.io.*;
+import java.math.*;
+
+class Solution {
+
+    public static void main(String args[]) {
+        Scanner in = new Scanner(System.in);
+        int L = in.nextInt();
+        int C = in.nextInt();
+        if (in.hasNextLine()) {
+            in.nextLine();
+        }
+        for (int i = 0; i < L; i++) {
+            String row = in.nextLine();
+        }
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+        System.out.println("answer");
+    }
+}

package/config/medium/BlunderEpisode1/code/CGCode.ts

@@ -0,0 +1,11 @@
+var inputs: string[] = readline().split(' ');
+const L: number = parseInt(inputs[0]);
+const C: number = parseInt(inputs[1]);
+for (let i = 0; i < L; i++) {
+    const row: string = readline();
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('answer');

package/config/medium/ConwaySequence/code/CGCode.cpp

@@ -0,0 +1,19 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main()
+{
+    int r;
+    cin >> r; cin.ignore();
+    int l;
+    cin >> l; cin.ignore();
+
+    // Write an answer using cout. DON'T FORGET THE "<< endl"
+    // To debug: cerr << "Debug messages..." << endl;
+
+    cout << "answer" << endl;
+}

package/config/medium/ConwaySequence/code/CGCode.java

@@ -0,0 +1,17 @@
+import java.util.*;
+import java.io.*;
+import java.math.*;
+
+class Solution {
+
+    public static void main(String args[]) {
+        Scanner in = new Scanner(System.in);
+        int R = in.nextInt();
+        int L = in.nextInt();
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+        System.out.println("answer");
+    }
+}

package/config/medium/ConwaySequence/code/CGCode.ts

@@ -0,0 +1,7 @@
+const R: number = parseInt(readline());
+const L: number = parseInt(readline());
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('answer');

package/config/medium/DwarfsStandingOnTheShouldersOfGiants/code/CGCode.cpp

@@ -0,0 +1,24 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main()
+{
+    int n; // the number of relationships of influence
+    cin >> n; cin.ignore();
+    for (int i = 0; i < n; i++) {
+        int x; // a relationship of influence between two people (x influences y)
+        int y;
+        cin >> x >> y; cin.ignore();
+    }
+
+    // Write an answer using cout. DON'T FORGET THE "<< endl"
+    // To debug: cerr << "Debug messages..." << endl;
+
+
+    // The number of people involved in the longest succession of influences
+    cout << "2" << endl;
+}

package/config/medium/DwarfsStandingOnTheShouldersOfGiants/code/CGCode.java

@@ -0,0 +1,22 @@
+import java.util.*;
+import java.io.*;
+import java.math.*;
+
+class Solution {
+
+    public static void main(String args[]) {
+        Scanner in = new Scanner(System.in);
+        int n = in.nextInt(); // the number of relationships of influence
+        for (int i = 0; i < n; i++) {
+            int x = in.nextInt(); // a relationship of influence between two people (x influences y)
+            int y = in.nextInt();
+        }
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+
+        // The number of people involved in the longest succession of influences
+        System.out.println("2");
+    }
+}

package/config/medium/DwarfsStandingOnTheShouldersOfGiants/code/CGCode.ts

@@ -0,0 +1,13 @@
+const n: number = parseInt(readline()); // the number of relationships of influence
+for (let i = 0; i < n; i++) {
+    var inputs: string[] = readline().split(' ');
+    const x: number = parseInt(inputs[0]); // a relationship of influence between two people (x influences y)
+    const y: number = parseInt(inputs[1]);
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+
+// The number of people involved in the longest succession of influences
+console.log('2');

package/config/medium/EquationSearch/code/CGCode.js

@@ -0,0 +1,14 @@
+const n = parseInt(readline());
+var inputs = readline().split(' ');
+for (let i = 0; i < n; i++) {
+    const rightSide = parseInt(inputs[i]);
+}
+var inputs = readline().split(' ');
+for (let i = 0; i < 9; i++) {
+    const operandOccurrenceCount = parseInt(inputs[i]);
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('solutionCount (plus equations if solutionCount = 0)');

package/config/medium/EquationSearch/code/CGCode.php

@@ -0,0 +1,17 @@
+<?php
+fscanf(STDIN, "%d", $n);
+$inputs = explode(" ", fgets(STDIN));
+for ($i = 0; $i < $n; $i++)
+{
+    $rightSide = intval($inputs[$i]);
+}
+$inputs = explode(" ", fgets(STDIN));
+for ($i = 0; $i < 9; $i++)
+{
+    $operandOccurrenceCount = intval($inputs[$i]);
+}
+
+// Write an answer using echo(). DON'T FORGET THE TRAILING \n
+// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+echo("solutionCount (plus equations if solutionCount = 0)\n");

package/config/medium/EquationSearch/config.json

@@ -0,0 +1,68 @@
+{
+    "path": "medium/EquationSearch",
+    "name": "Equation Search",
+    "alphanumName": "EquationSearch",
+    "link": "https://www.codingame.com/ide/puzzle/equation-search",
+    "tests": [
+        {
+            "name": "No Duplicate Operands",
+            "alphanumName": "NoDuplicateOperands",
+            "file": "01 - No Duplicate Operands.txt"
+        },
+        {
+            "name": "Same Operand Twice",
+            "alphanumName": "SameOperandTwice",
+            "file": "02 - Same Operand Twice.txt"
+        },
+        {
+            "name": "Only Same Operands",
+            "alphanumName": "OnlySameOperands",
+            "file": "03 - Only Same Operands.txt"
+        },
+        {
+            "name": "6 Equations, 1 Solution",
+            "alphanumName": "SixEquations1Solution",
+            "file": "04 - 6 Equations, 1 Solution.txt"
+        },
+        {
+            "name": "6 Equations, Multiple Solutions",
+            "alphanumName": "SixEquationsMultipleSolutions",
+            "file": "05 - 6 Equations, Multiple Solutions.txt"
+        },
+        {
+            "name": "10 Equations, 1 Solution",
+            "alphanumName": "TenEquations1Solution",
+            "file": "06 - 10 Equations, 1 Solution.txt"
+        },
+        {
+            "name": "10 Equations, Multiple Solutions",
+            "alphanumName": "TenEquationsMultipleSolutions",
+            "file": "07 - 10 Equations, Multiple Solutions.txt"
+        },
+        {
+            "name": "13 Equations",
+            "alphanumName": "ThirteenEquations",
+            "file": "08 - 13 Equations.txt"
+        },
+        {
+            "name": "14 Equations",
+            "alphanumName": "FourteenEquations",
+            "file": "09 - 14 Equations.txt"
+        },
+        {
+            "name": "15 Equations, 1 Solution",
+            "alphanumName": "FifteenEquations1Solution",
+            "file": "10 - 15 Equations, 1 Solution.txt"
+        },
+        {
+            "name": "15 Equations, Multiple Solutions",
+            "alphanumName": "FifteenEquationsMultipleSolutions",
+            "file": "11 - 15 Equations, Multiple Solutions.txt"
+        },
+        {
+            "name": "So Many Solutions",
+            "alphanumName": "SoManySolutions",
+            "file": "12 - So Many Solutions.txt"
+        }
+    ]
+}

package/config/medium/EquationSearch/input/01 - No Duplicate Operands.txt

@@ -0,0 +1,3 @@
+3
+5 7 10
+1 1 1 1 1 0 0 1 0

package/config/medium/EquationSearch/input/02 - Same Operand Twice.txt

@@ -0,0 +1,3 @@
+3
+6 8 9
+1 1 2 0 0 2 0 0 0

package/config/medium/EquationSearch/input/03 - Only Same Operands.txt

@@ -0,0 +1,3 @@
+2
+16 25
+0 0 0 2 2 0 0 0 0

package/config/medium/EquationSearch/input/04 - 6 Equations, 1 Solution.txt

@@ -0,0 +1,3 @@
+6
+4 6 7 8 10 11
+1 2 3 4 1 0 0 0 1

package/config/medium/EquationSearch/input/05 - 6 Equations, Multiple Solutions.txt

@@ -0,0 +1,3 @@
+6
+4 5 7 9 12 14
+3 2 1 1 2 0 1 0 2

package/config/medium/EquationSearch/input/06 - 10 Equations, 1 Solution.txt

@@ -0,0 +1,3 @@
+10
+5 7 9 10 11 12 13 16 20 28
+3 1 1 2 4 1 5 1 2

package/config/medium/EquationSearch/input/07 - 10 Equations, Multiple Solutions.txt

@@ -0,0 +1,3 @@
+10
+6 7 8 9 10 12 14 15 24 25
+1 3 2 2 4 3 2 3 0

package/config/medium/EquationSearch/input/08 - 13 Equations.txt

@@ -0,0 +1,3 @@
+13
+4 6 7 8 9 10 11 12 13 14 15 17 20
+2 3 3 3 3 2 2 6 2

package/config/medium/EquationSearch/input/09 - 14 Equations.txt

@@ -0,0 +1,3 @@
+14
+4 5 6 7 8 9 10 11 12 13 14 15 16 17
+3 2 4 5 2 2 2 3 5

package/config/medium/EquationSearch/input/10 - 15 Equations, 1 Solution.txt

@@ -0,0 +1,3 @@
+15
+6 7 9 10 11 12 13 14 16 17 18 20 21 24 25
+1 1 2 5 4 5 4 5 3

package/config/medium/EquationSearch/input/11 - 15 Equations, Multiple Solutions.txt

@@ -0,0 +1,3 @@
+15
+4 5 6 7 8 9 10 12 13 14 15 16 17 18 20
+3 4 3 3 4 2 3 5 3

package/config/medium/EquationSearch/input/12 - So Many Solutions.txt

@@ -0,0 +1,3 @@
+15
+4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
+3 3 5 5 2 2 4 2 4

package/config/medium/EquationSearch/output/01 - No Duplicate Operands.txt

@@ -0,0 +1,4 @@
+1
+1 x 5 = 5
+3 + 4 = 7
+2 + 8 = 10

package/config/medium/EquationSearch/output/02 - Same Operand Twice.txt

@@ -0,0 +1,4 @@
+1
+1 x 6 = 6
+2 + 6 = 8
+3 x 3 = 9

package/config/medium/EquationSearch/output/03 - Only Same Operands.txt

@@ -0,0 +1,3 @@
+1
+4 x 4 = 16
+5 x 5 = 25

package/config/medium/EquationSearch/output/04 - 6 Equations, 1 Solution.txt

@@ -0,0 +1,7 @@
+1
+1 x 4 = 4
+3 + 3 = 6
+3 + 4 = 7
+4 + 4 = 8
+2 x 5 = 10
+2 + 9 = 11

package/config/medium/EquationSearch/output/05 - 6 Equations, Multiple Solutions.txt

@@ -0,0 +1 @@
+3

package/config/medium/EquationSearch/output/06 - 10 Equations, 1 Solution.txt

@@ -0,0 +1,11 @@
+1
+1 x 5 = 5
+1 x 7 = 7
+1 x 9 = 9
+2 x 5 = 10
+3 + 8 = 11
+5 + 7 = 12
+6 + 7 = 13
+7 + 9 = 16
+4 x 5 = 20
+4 x 7 = 28

package/config/medium/EquationSearch/output/07 - 10 Equations, Multiple Solutions.txt

@@ -0,0 +1 @@
+31

package/config/medium/EquationSearch/output/08 - 13 Equations.txt

@@ -0,0 +1 @@
+227

package/config/medium/EquationSearch/output/09 - 14 Equations.txt

@@ -0,0 +1 @@
+674

package/config/medium/EquationSearch/output/10 - 15 Equations, 1 Solution.txt

@@ -0,0 +1,16 @@
+1
+2 + 4 = 6
+1 x 7 = 7
+4 + 5 = 9
+4 + 6 = 10
+4 + 7 = 11
+6 + 6 = 12
+6 + 7 = 13
+6 + 8 = 14
+8 + 8 = 16
+8 + 9 = 17
+9 + 9 = 18
+4 x 5 = 20
+3 x 7 = 21
+3 x 8 = 24
+5 x 5 = 25

package/config/medium/EquationSearch/output/11 - 15 Equations, Multiple Solutions.txt

@@ -0,0 +1 @@
+2898

package/config/medium/EquationSearch/output/12 - So Many Solutions.txt

@@ -0,0 +1 @@
+4059

package/config/medium/ExcavatingPalindromes/code/CGCode.js

@@ -0,0 +1,6 @@
+const s = readline();
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('Good Luck!');

package/config/medium/ExcavatingPalindromes/code/CGCode.php

@@ -0,0 +1,7 @@
+<?php
+$s = stream_get_line(STDIN, 500 + 1, "\n");
+
+// Write an answer using echo(). DON'T FORGET THE TRAILING \n
+// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+echo("Good Luck!\n");

package/config/medium/ExcavatingPalindromes/config.json

@@ -0,0 +1,53 @@
+{
+    "path": "medium/ExcavatingPalindromes",
+    "name": "Excavating Palindromes",
+    "alphanumName": "ExcavatingPalindromes",
+    "link": "https://www.codingame.com/ide/puzzle/excavating-palindromes",
+    "tests": [
+        {
+            "name": "Test 1",
+            "alphanumName": "test1",
+            "file": "01 - test 1.txt"
+        },
+        {
+            "name": "Test 2",
+            "alphanumName": "test2",
+            "file": "02 - test 2.txt"
+        },
+        {
+            "name": "Test 3",
+            "alphanumName": "test3",
+            "file": "03 - test 3.txt"
+        },
+        {
+            "name": "Test 4",
+            "alphanumName": "test4",
+            "file": "04 - test 4.txt"
+        },
+        {
+            "name": "Test 5",
+            "alphanumName": "test5",
+            "file": "05 - test 5.txt"
+        },
+        {
+            "name": "Test 6",
+            "alphanumName": "test6",
+            "file": "06 - test 6.txt"
+        },
+        {
+            "name": "Test 7",
+            "alphanumName": "test7",
+            "file": "07 - test 7.txt"
+        },
+        {
+            "name": "Test 8",
+            "alphanumName": "test8",
+            "file": "08 - test 8.txt"
+        },
+        {
+            "name": "Test 9",
+            "alphanumName": "test9",
+            "file": "09 - test 9.txt"
+        }
+    ]
+}

package/config/medium/ExcavatingPalindromes/input/01 - test 1.txt

@@ -0,0 +1 @@
+a

package/config/medium/ExcavatingPalindromes/input/02 - test 2.txt

@@ -0,0 +1 @@
+aabb

package/config/medium/ExcavatingPalindromes/input/03 - test 3.txt

@@ -0,0 +1 @@
+1234567890987654321

package/config/medium/ExcavatingPalindromes/input/04 - test 4.txt

@@ -0,0 +1 @@
+abcdcba01233210

package/config/medium/ExcavatingPalindromes/input/05 - test 5.txt

@@ -0,0 +1 @@
+a0bc1dc2ba3210a

package/config/medium/ExcavatingPalindromes/input/06 - test 6.txt

@@ -0,0 +1 @@
+111111oo11o111ooo1o1ooo11ooo1o

package/config/medium/ExcavatingPalindromes/input/07 - test 7.txt

@@ -0,0 +1 @@
+yyyyyooyQyyyoyyQyyooyQoQoQQoQy

package/config/medium/ExcavatingPalindromes/input/08 - test 8.txt

@@ -0,0 +1 @@
+ROgYUOu6er_DA7nB6UGquO1GUHC62R

package/config/medium/ExcavatingPalindromes/input/09 - test 9.txt

@@ -0,0 +1 @@
+xcode_visualstudio_eclipse

package/config/medium/ExcavatingPalindromes/output/01 - test 1.txt

@@ -0,0 +1 @@
+1

package/config/medium/ExcavatingPalindromes/output/02 - test 2.txt

@@ -0,0 +1 @@
+2

package/config/medium/ExcavatingPalindromes/output/03 - test 3.txt

@@ -0,0 +1 @@
+19

package/config/medium/ExcavatingPalindromes/output/04 - test 4.txt

@@ -0,0 +1 @@
+8

package/config/medium/ExcavatingPalindromes/output/05 - test 5.txt

@@ -0,0 +1 @@
+9

package/config/medium/ExcavatingPalindromes/output/06 - test 6.txt

@@ -0,0 +1 @@
+21