@cyrilverloop/codingame-configuration 1.17.1 → 1.19.0

package/config/hard/UnfloodTheWorld/output/03 - Wall.txt

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

package/config/hard/UnfloodTheWorld/output/04 - Flat field.txt

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

package/config/hard/UnfloodTheWorld/output/05 - Chess board.txt

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

package/config/hard/UnfloodTheWorld/output/06 - Fractal.txt

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

package/config/hard/UnfloodTheWorld/output/07 - Maze.txt

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

package/config/hard/UnfloodTheWorld/output/08 - Plateaus.txt

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

package/config/{hard → medium}/Hangman/config.json

@@ -1,5 +1,5 @@
 {
-    "path": "hard/Hangman",
+    "path": "medium/Hangman",
     "name": "Hangman",
     "alphanumName": "Hangman",
     "link": "https://www.codingame.com/ide/puzzle/hangman",

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

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+/**
+ * Auto-generated code below aims at helping you parse
+ * the standard input according to the problem statement.
+ **/
+
+int main()
+{
+    int num_compounds;
+    cin >> num_compounds; cin.ignore();
+    for (int i = 0; i < num_compounds; i++) {
+        string compound;
+        getline(cin, compound);
+    }
+
+    // Write an answer using cout. DON'T FORGET THE "<< endl"
+    // To debug: cerr << "Debug messages..." << endl;
+
+    cout << "answer" << endl;
+}

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

@@ -0,0 +1,26 @@
+import java.util.*;
+import java.io.*;
+import java.math.*;
+
+/**
+ * Auto-generated code below aims at helping you parse
+ * the standard input according to the problem statement.
+ **/
+class Solution {
+
+    public static void main(String args[]) {
+        Scanner in = new Scanner(System.in);
+        int numCompounds = in.nextInt();
+        if (in.hasNextLine()) {
+            in.nextLine();
+        }
+        for (int i = 0; i < numCompounds; i++) {
+            String compound = in.nextLine();
+        }
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+        System.out.println("answer");
+    }
+}

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

@@ -0,0 +1,9 @@
+const numCompounds = parseInt(readline());
+for (let i = 0; i < numCompounds; i++) {
+    const compound = readline();
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('answer');

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

@@ -0,0 +1,11 @@
+<?php
+fscanf(STDIN, "%d", $numCompounds);
+for ($i = 0; $i < $numCompounds; $i++)
+{
+    $compound = stream_get_line(STDIN, 128 + 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("answer\n");

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

@@ -0,0 +1,9 @@
+const numCompounds: number = parseInt(readline());
+for (let i = 0; i < numCompounds; i++) {
+    const compound: string = readline();
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('answer');

package/config/medium/HillNotationAndHillOrder/config.json

@@ -0,0 +1,33 @@
+{
+    "path": "medium/HillNotationAndHillOrder",
+    "name": "Hill Notation and Hill Order",
+    "alphanumName": "HillNotationAndHillOrder",
+    "link": "https://www.codingame.com/ide/puzzle/hill-notation-and-hill-order",
+    "tests": [
+        {
+            "name": "Simple Sort",
+            "alphanumName": "SimpleSort",
+            "file": "01 - Simple Sort.txt"
+        },
+        {
+            "name": "Quantity Sort",
+            "alphanumName": "QuantitySort",
+            "file": "02 - Quantity Sort.txt"
+        },
+        {
+            "name": "Duplicates",
+            "alphanumName": "Duplicates",
+            "file": "03 - Duplicates.txt"
+        },
+        {
+            "name": "Bigger Sort",
+            "alphanumName": "BiggerSort",
+            "file": "04 - Bigger Sort.txt"
+        },
+        {
+            "name": "Parenthesis",
+            "alphanumName": "Parenthesis",
+            "file": "05 - Parenthesis.txt"
+        }
+    ]
+}

package/config/medium/HillNotationAndHillOrder/input/01 - Simple Sort.txt

@@ -0,0 +1,4 @@
+3
+H2O
+Al2O3
+CCl4

package/config/medium/HillNotationAndHillOrder/input/02 - Quantity Sort.txt

@@ -0,0 +1,7 @@
+6
+C5H8O2
+CHNO
+CCl4
+C2H4
+CHCl3
+C8H5NO2

package/config/medium/HillNotationAndHillOrder/input/03 - Duplicates.txt

@@ -0,0 +1,4 @@
+3
+H2O
+HOH
+OH2

package/config/medium/HillNotationAndHillOrder/input/04 - Bigger Sort.txt

@@ -0,0 +1,11 @@
+10
+BrH
+CHCl3
+CHNO
+H2O4S
+H4Sn
+C2H4BrCl
+B2O3
+CCl4
+CaO3Ti
+Al6Ca5O14

package/config/medium/HillNotationAndHillOrder/input/05 - Parenthesis.txt

@@ -0,0 +1,4 @@
+3
+H3C(CH2)8CH2NH2
+Zn3(PO4)2
+H2C2O4

package/config/medium/HillNotationAndHillOrder/output/01 - Simple Sort.txt

@@ -0,0 +1,3 @@
+Al2O3
+CCl4
+H2O

package/config/medium/HillNotationAndHillOrder/output/02 - Quantity Sort.txt

@@ -0,0 +1,6 @@
+CCl4
+CHCl3
+CHNO
+C2H4
+C5H8O2
+C8H5NO2

package/config/medium/HillNotationAndHillOrder/output/03 - Duplicates.txt

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

package/config/medium/HillNotationAndHillOrder/output/04 - Bigger Sort.txt

@@ -0,0 +1,10 @@
+Al6Ca5O14
+B2O3
+BrH
+CCl4
+CHCl3
+CHNO
+C2H4BrCl
+CaO3Ti
+H2O4S
+H4Sn

package/config/medium/HillNotationAndHillOrder/output/05 - Parenthesis.txt

@@ -0,0 +1,3 @@
+C2H2O4
+C10H23N
+O8P2Zn3

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

@@ -0,0 +1,23 @@
+#include <iostream>
+#include <string>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+int main()
+{
+    int n;
+    cin >> n; cin.ignore();
+    for (int i = 0; i < n; i++) {
+        string s;
+        getline(cin, s);
+    }
+
+    // Write an answer using cout. DON'T FORGET THE "<< endl"
+    // To debug: cerr << "Debug messages..." << endl;
+
+    cout << "The area" << endl;
+    cout << "Overlap, But Infinite" << endl;
+    cout << "No Overlap" << endl;
+}

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

@@ -0,0 +1,24 @@
+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();
+        if (in.hasNextLine()) {
+            in.nextLine();
+        }
+        for (int i = 0; i < n; i++) {
+            String s = in.nextLine();
+        }
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+        System.out.println("The area");
+        System.out.println("Overlap, But Infinite");
+        System.out.println("No Overlap");
+    }
+}

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

@@ -0,0 +1,11 @@
+const n = parseInt(readline());
+for (let i = 0; i < n; i++) {
+    const s = readline();
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('The area');
+console.log('Overlap, But Infinite');
+console.log('No Overlap');

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

@@ -0,0 +1,13 @@
+<?php
+fscanf(STDIN, "%d", $n);
+for ($i = 0; $i < $n; $i++)
+{
+    $s = stream_get_line(STDIN, 30 + 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("The area\n");
+echo("Overlap, But Infinite\n");
+echo("No Overlap\n");

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

@@ -0,0 +1,11 @@
+const n: number = parseInt(readline());
+for (let i = 0; i < n; i++) {
+    const s: string = readline();
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('The area');
+console.log('Overlap, But Infinite');
+console.log('No Overlap');

package/config/medium/InequalityOverlapArea/config.json

@@ -0,0 +1,68 @@
+{
+    "path": "medium/InequalityOverlapArea",
+    "name": "Inequality Overlap Area",
+    "alphanumName": "InequalityOverlapArea",
+    "link": "https://www.codingame.com/ide/puzzle/inequality-overlap-area",
+    "tests": [
+        {
+            "name": "Simple Overlap",
+            "alphanumName": "SimpleOverlap",
+            "file": "01 - Simple Overlap.txt"
+        },
+        {
+            "name": "Floating",
+            "alphanumName": "Floating",
+            "file": "02 - Floating.txt"
+        },
+        {
+            "name": "Pentagon",
+            "alphanumName": "Pentagon",
+            "file": "03 - Pentagon.txt"
+        },
+        {
+            "name": "NO",
+            "alphanumName": "NO",
+            "file": "04 - NO.txt"
+        },
+        {
+            "name": "Infinite",
+            "alphanumName": "Infinite",
+            "file": "05 - Infinite.txt"
+        },
+        {
+            "name": "NoOverlap",
+            "alphanumName": "NoOverlap",
+            "file": "06 - NoOverlap.txt"
+        },
+        {
+            "name": "Not Finite",
+            "alphanumName": "NotFinite",
+            "file": "07 - Not Finite.txt"
+        },
+        {
+            "name": "Same Graph",
+            "alphanumName": "SameGraph",
+            "file": "08 - Same Graph.txt"
+        },
+        {
+            "name": "One Line",
+            "alphanumName": "OneLine",
+            "file": "09 - One Line.txt"
+        },
+        {
+            "name": "One Point",
+            "alphanumName": "OnePoint",
+            "file": "10 - One Point.txt"
+        },
+        {
+            "name": "Quadrilateral",
+            "alphanumName": "Quadrilateral",
+            "file": "11 - Quadrilateral.txt"
+        },
+        {
+            "name": "Rectangle",
+            "alphanumName": "Rectangle",
+            "file": "12 - Rectangle.txt"
+        }
+    ]
+}

package/config/medium/InequalityOverlapArea/input/01 - Simple Overlap.txt

@@ -0,0 +1,4 @@
+3
+2x + 3y >= 5
+4x + 3y <= -2
+0x + 1y <= 10

package/config/medium/InequalityOverlapArea/input/02 - Floating.txt

@@ -0,0 +1,5 @@
+4
+1.5x + 0.2y >= 0.8
+1.5x + 0.2y <= 10.6
+0.2x + 1.5y >= 0.5
+0.2x + 1.5y <= 10.2

package/config/medium/InequalityOverlapArea/input/03 - Pentagon.txt

@@ -0,0 +1,6 @@
+5
+2x + 9y <= 20
+2x + 1y <= 8
+1x + 1y >= -40
+1x + 0y >= -40
+0x + 2y >= -60

package/config/medium/InequalityOverlapArea/input/04 - NO.txt

@@ -0,0 +1,9 @@
+8
+52x + 84y <= 968
+81x - 71y >= 654
+8x - 941y <= 64
+5x - 97y <= 8
+1x + 0y <= -8
+9x - 2y >= 300
+82x - 91y <= -105
+910x - 918y >= 108

package/config/medium/InequalityOverlapArea/input/05 - Infinite.txt

@@ -0,0 +1,7 @@
+6
+5x + 9y >= 5
+7x + 2y >= 4
+9x + 2y >= -1
+-2x + 8y >= 3
+-8x - 5y <= -5
+-1.6x + 8y >= -5

package/config/medium/InequalityOverlapArea/input/06 - NoOverlap.txt

@@ -0,0 +1,10 @@
+9
+500x + 500y <= 1000
+-500x - 500y <= -1000
+300x - 200y <= 800
+-300x + 200y <= 700
+1000x + 0y >= 100
+0x + 1000y >= 100
+1000x + 0y <= 300
+0x + 1000y <= 300
+500x + 500y >= 1000

package/config/medium/InequalityOverlapArea/input/07 - Not Finite.txt

@@ -0,0 +1,10 @@
+9
+200x + 0y >= 200
+200x + 0y <= 600
+150x + 150y >= -900
+-150x + 150y >= -900
+0x + 200y >= -1000
+250x - 250y <= 1000
+-300x - 300y <= 1000
+300x + 600y >= -1000
+1x + 900y >= -815

package/config/medium/InequalityOverlapArea/input/08 - Same Graph.txt

@@ -0,0 +1,6 @@
+5
+6x + 2y >= 12
+3x + 1y >= 6
+9x + 3y >= 18
+-18x - 6y <= -36
+-60x - 20y <= -120

package/config/medium/InequalityOverlapArea/input/09 - One Line.txt

@@ -0,0 +1,7 @@
+6
+6x + 2y >= 12
+3x + 1y <= 6
+9x + 3y >= 18
+-18x - 6y >= -36
+-60x - 20y <= -120
+15x + 5y <= 30

package/config/medium/InequalityOverlapArea/input/10 - One Point.txt

@@ -0,0 +1,11 @@
+10
+6x + 2y >= 12
+3x + 1y <= 6
+9x + 3y >= 18
+-18x - 6y >= -36
+-60x - 20y <= -120
+15x + 5y <= 30
+0x + 1y <= 6
+-3x + 1y >= 6
+1x + 0y >= 0
+1x - 1y >= -6

package/config/medium/InequalityOverlapArea/input/11 - Quadrilateral.txt

@@ -0,0 +1,5 @@
+4
+8x - 6y >= 4
+-6x + 2y <= 12
+2x + 1y >= -19
+9x + 1y <= 5

package/config/medium/InequalityOverlapArea/input/12 - Rectangle.txt

@@ -0,0 +1,5 @@
+4
+1x + 0y >= 0
+0x + 1y >= 0
+1x + 0y <= 3.14
+0x + 1y <= 3.1415

package/config/medium/InequalityOverlapArea/output/01 - Simple Overlap.txt

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

package/config/medium/InequalityOverlapArea/output/02 - Floating.txt

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

package/config/medium/InequalityOverlapArea/output/03 - Pentagon.txt

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

package/config/medium/InequalityOverlapArea/output/04 - NO.txt

@@ -0,0 +1 @@
+No Overlap

package/config/medium/InequalityOverlapArea/output/05 - Infinite.txt

@@ -0,0 +1 @@
+Overlap, But Infinite

package/config/medium/InequalityOverlapArea/output/06 - NoOverlap.txt

@@ -0,0 +1 @@
+No Overlap

package/config/medium/InequalityOverlapArea/output/07 - Not Finite.txt

@@ -0,0 +1 @@
+Overlap, But Infinite

package/config/medium/InequalityOverlapArea/output/08 - Same Graph.txt

@@ -0,0 +1 @@
+Overlap, But Infinite

package/config/medium/InequalityOverlapArea/output/09 - One Line.txt

@@ -0,0 +1 @@
+No Overlap

package/config/medium/InequalityOverlapArea/output/10 - One Point.txt

@@ -0,0 +1 @@
+No Overlap

package/config/medium/InequalityOverlapArea/output/11 - Quadrilateral.txt

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

package/config/medium/InequalityOverlapArea/output/12 - Rectangle.txt

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

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

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

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

@@ -0,0 +1,24 @@
+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 w = in.nextInt();
+        if (in.hasNextLine()) {
+            in.nextLine();
+        }
+        for (int i = 0; i < w; i++) {
+            String s = in.nextLine();
+        }
+        String dir = in.next();
+
+        // Write an answer using System.out.println()
+        // To debug: System.err.println("Debug messages...");
+
+        System.out.println("coords of the mirrors");
+    }
+}

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

@@ -0,0 +1,12 @@
+var inputs = readline().split(' ');
+const l = parseInt(inputs[0]);
+const w = parseInt(inputs[1]);
+for (let i = 0; i < w; i++) {
+    const s = readline();
+}
+const dir = readline();
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('coords of the mirrors');

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

@@ -0,0 +1,12 @@
+<?php
+fscanf(STDIN, "%d %d", $l, $w);
+for ($i = 0; $i < $w; $i++)
+{
+    $s = stream_get_line(STDIN, $l + 1, "\n");
+}
+fscanf(STDIN, "%s", $dir);
+
+// Write an answer using echo(). DON'T FORGET THE TRAILING \n
+// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
+
+echo("coords of the mirrors\n");

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

@@ -0,0 +1,12 @@
+var inputs: string[] = readline().split(' ');
+const l: number = parseInt(inputs[0]);
+const w: number = parseInt(inputs[1]);
+for (let i = 0; i < w; i++) {
+    const s: string = readline();
+}
+const dir: string = readline();
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('coords of the mirrors');