@cyrilverloop/codingame-configuration 1.15.0 → 1.16.0

package/config/hard/ChessMovesOnFENPosition/config.json

@@ -0,0 +1,33 @@
+{
+    "path": "hard/ChessMovesOnFENPosition",
+    "name": "Chess moves on FEN position",
+    "alphanumName": "ChessMovesOnFENPosition",
+    "link": "https://www.codingame.com/ide/puzzle/chess-moves-on-fen-position",
+    "tests": [
+        {
+            "name": "Starting position 1 move",
+            "alphanumName": "StartingPosition1Move",
+            "file": "01 - Starting position 1 move.txt"
+        },
+        {
+            "name": "Starting position several moves",
+            "alphanumName": "StartingPositionSeveralMoves",
+            "file": "02 - Starting position several moves.txt"
+        },
+        {
+            "name": "Castling",
+            "alphanumName": "Castling",
+            "file": "03 - Castling.txt"
+        },
+        {
+            "name": "En passant",
+            "alphanumName": "EnPassant",
+            "file": "04 - En passant.txt"
+        },
+        {
+            "name": "Pawn promotion",
+            "alphanumName": "PawnPromotion",
+            "file": "05 - Pawn promotion.txt"
+        }
+    ]
+}

package/config/hard/ChessMovesOnFENPosition/input/01 - Starting position 1 move.txt

@@ -0,0 +1,3 @@
+rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR
+1
+e2e4

package/config/hard/ChessMovesOnFENPosition/input/02 - Starting position several moves.txt

@@ -0,0 +1,5 @@
+rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR
+3
+e2e4
+c7c5
+g1f3

package/config/hard/ChessMovesOnFENPosition/input/03 - Castling.txt

@@ -0,0 +1,4 @@
+r1bqk2r/pppp1ppp/2n2n2/4p3/1bB1P3/2NP1N2/PPP2PPP/R1BQK2R
+2
+e8g8
+e1g1

package/config/hard/ChessMovesOnFENPosition/input/04 - En passant.txt

@@ -0,0 +1,4 @@
+2kr3r/1pp1qppp/2np1n2/p3p2P/1bB1P1b1/2NP1N2/PPPBQPP1/2KR3R
+2
+g7g5
+h5g6

package/config/hard/ChessMovesOnFENPosition/input/05 - Pawn promotion.txt

@@ -0,0 +1,4 @@
+1N1rk2r/4q2p/3p1np1/4p3/2B3b1/3P1N2/2pBQPP1/2KR3R
+2
+c2d1r
+c1d1

package/config/hard/ChessMovesOnFENPosition/output/01 - Starting position 1 move.txt

@@ -0,0 +1 @@
+rnbqkbnr/pppppppp/8/8/4P3/8/PPPP1PPP/RNBQKBNR

package/config/hard/ChessMovesOnFENPosition/output/02 - Starting position several moves.txt

@@ -0,0 +1 @@
+rnbqkbnr/pp1ppppp/8/2p5/4P3/5N2/PPPP1PPP/RNBQKB1R

package/config/hard/ChessMovesOnFENPosition/output/03 - Castling.txt

@@ -0,0 +1 @@
+r1bq1rk1/pppp1ppp/2n2n2/4p3/1bB1P3/2NP1N2/PPP2PPP/R1BQ1RK1

package/config/hard/ChessMovesOnFENPosition/output/04 - En passant.txt

@@ -0,0 +1 @@
+2kr3r/1pp1qp1p/2np1nP1/p3p3/1bB1P1b1/2NP1N2/PPPBQPP1/2KR3R

package/config/hard/ChessMovesOnFENPosition/output/05 - Pawn promotion.txt

@@ -0,0 +1 @@
+1N1rk2r/4q2p/3p1np1/4p3/2B3b1/3P1N2/3BQPP1/3K3R

package/config/hard/DivisibilityOfFibonacciNumbersSum/code/CGCode.cpp

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

package/config/hard/DivisibilityOfFibonacciNumbersSum/code/CGCode.java

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

package/config/hard/DivisibilityOfFibonacciNumbersSum/code/CGCode.js

@@ -0,0 +1,12 @@
+const nb = parseInt(readline());
+for (let i = 0; i < nb; i++) {
+    var inputs = readline().split(' ');
+    const a = parseInt(inputs[0]);
+    const b = parseInt(inputs[1]);
+    const d = parseInt(inputs[2]);
+}
+
+// Write an answer using console.log()
+// To debug: console.error('Debug messages...');
+
+console.log('answer');

package/config/hard/DivisibilityOfFibonacciNumbersSum/code/CGCode.php

@@ -0,0 +1,11 @@
+<?php
+fscanf(STDIN, "%d", $nb);
+for ($i = 0; $i < $nb; $i++)
+{
+    fscanf(STDIN, "%d %d %d", $a, $b, $d);
+}
+
+// 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/hard/DivisibilityOfFibonacciNumbersSum/code/CGCode.ts

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

package/config/hard/DivisibilityOfFibonacciNumbersSum/config.json

@@ -0,0 +1,53 @@
+{
+    "path": "hard/DivisibilityOfFibonacciNumbersSum",
+    "name": "Divisibility of Fibonacci numbers sum",
+    "alphanumName": "DivisibilityOfFibonacciNumbersSum",
+    "link": "https://www.codingame.com/ide/puzzle/divisibility-of-fibonacci-numbers-sum",
+    "tests": [
+        {
+            "name": "First example",
+            "alphanumName": "FirstExample",
+            "file": "01 - First example.txt"
+        },
+        {
+            "name": "Other example",
+            "alphanumName": "OtherExample",
+            "file": "02 - Other example.txt"
+        },
+        {
+            "name": "Big numbers",
+            "alphanumName": "BigNumbers",
+            "file": "03 - Big numbers.txt"
+        },
+        {
+            "name": "Even big numbers",
+            "alphanumName": "EvenBigNumbers",
+            "file": "04 - Even big numbers.txt"
+        },
+        {
+            "name": "Larger indices",
+            "alphanumName": "LargerIndices",
+            "file": "05 - Larger indices.txt"
+        },
+        {
+            "name": "Even larger indices",
+            "alphanumName": "EvenLargerIndices",
+            "file": "06 - Even larger indices.txt"
+        },
+        {
+            "name": "Become really big",
+            "alphanumName": "BecomeReallyBig",
+            "file": "07 - Become really big.txt"
+        },
+        {
+            "name": "Really huge",
+            "alphanumName": "ReallyHuge",
+            "file": "08 - Really huge.txt"
+        },
+        {
+            "name": "Other really huge",
+            "alphanumName": "OtherReallyHuge",
+            "file": "09 - Other really huge.txt"
+        }
+    ]
+}

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/01 - First example.txt

@@ -0,0 +1,14 @@
+13
+10 12 2
+10 12 32
+10 12 64
+10 12 3
+10 12 9
+10 12 27
+10 12 5
+10 12 7
+10 12 11
+10 12 287
+10 12 288
+10 12 289
+10 12 1000

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/02 - Other example.txt

@@ -0,0 +1,25 @@
+24
+0 10 1
+0 10 1000
+0 10 2
+0 10 3
+0 10 5
+0 10 7
+0 10 11
+0 10 13
+0 10 17
+0 10 142
+0 10 143
+0 10 144
+5 16 1
+5 16 16
+5 16 32
+5 16 3
+5 16 5
+5 16 7
+5 16 23
+5 16 529
+5 16 49
+5 16 2575
+5 16 2576
+5 16 2577

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/03 - Big numbers.txt

@@ -0,0 +1,26 @@
+25
+32 85 43
+20 100 4
+32 85 45
+20 100 3
+32 85 2521
+20 100 5
+20 100 25
+32 85 128
+20 100 11
+32 85 25
+20 100 121
+20 100 41
+32 85 31
+20 100 4577887
+32 85 64
+32 85 9
+32 85 27
+20 100 1174951
+32 85 5
+20 100 2
+32 85 7
+32 85 13
+32 85 61
+32 85 17
+32 85 19

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/04 - Even big numbers.txt

@@ -0,0 +1,24 @@
+23
+123 234 343
+123 234 2401
+123 234 26013
+123 234 3
+123 234 78039
+123 234 5
+110 301 1024
+123 234 103680
+123 234 103682
+123 234 20641
+110 301 512
+123 234 103681
+110 301 1097
+110 301 3167
+211 398 43759
+353 616 6561
+211 398 43763
+353 616 122464
+353 616 5021024
+211 398 81
+353 616 19683
+432 433 106998173
+321 321 6

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/05 - Larger indices.txt

@@ -0,0 +1,17 @@
+16
+1234 2345 4
+3897 3910 54988205
+1781 2444 9
+1234 2345 6
+1234 2345 36
+3560 4013 15
+1781 2444 2529
+1234 2345 3
+2123 4489 12810074
+1234 2345 9
+1234 2345 8
+2123 4489 25620148
+1234 2345 5
+1234 2345 7
+1234 2345 15
+1781 2444 18

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/06 - Even larger indices.txt

@@ -0,0 +1,14 @@
+13
+12345 23456 2
+12345 23456 27
+12378 64506 2659000
+40045 70000 4023361
+12345 23456 7
+28090 34708 282609
+21568 554433 1488436
+12345 23456 81
+12345 23456 5
+34890 40566 243296
+12345 23456 16
+12345 23456 32
+12345 23456 3

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/07 - Become really big.txt

@@ -0,0 +1,21 @@
+20
+654321 987654 4
+489 1005 258282
+654321 987654 3
+2468 897089 74400513
+654321 987654 55592635
+654321 987654 17
+489 1005 774846
+654321 987654 5
+48903 4680607 1399681
+654321 987654 289
+780613 980156 30
+654321 987654 54289
+48903 4680607 9797767
+654321 987654 53
+2468 897089 87927879
+654321 987654 2809
+654321 987654 11881
+780613 980156 6
+654321 987654 7647985
+654321 987654 29717

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/08 - Really huge.txt

@@ -0,0 +1,14 @@
+13
+987000000 987654321 6493915
+123456789 123567900 8690943
+523489014 528904156 121639
+987000000 987654321 48533
+987000000 987654321 3
+987000000 987654321 2
+523489014 528904156 364917
+987000000 987654321 17
+987000000 987654321 289
+123456789 123567900 10373061
+987000000 987654321 9349
+987000000 987654321 34439
+987000000 987654321 4021

package/config/hard/DivisibilityOfFibonacciNumbersSum/input/09 - Other really huge.txt

@@ -0,0 +1,19 @@
+18
+999000000 1000000000 15625
+1000000000 1000000000 5
+42 4894511 452240819
+979000000 979002345 28883462
+1000000000 1000000000 1953125
+1000000000 1000000000 41
+979000000 979002345 43325193
+1000000000 1000000000 1681
+999000000 1000000000 78125
+1000000000 1000000000 3
+999000000 1000000000 7
+42 4894511 421051797
+999000000 1000000000 11
+1000000000 1000000000 9765625
+1000000000 1000000000 1
+999000000 1000000000 1681
+1000000000 1000000000 7
+1000000000 1000000000 11

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/01 - First example.txt

@@ -0,0 +1,13 @@
+F_10 + ... + F_12 is divisible by 2
+F_10 + ... + F_12 is divisible by 32
+F_10 + ... + F_12 is NOT divisible by 64
+F_10 + ... + F_12 is divisible by 3
+F_10 + ... + F_12 is divisible by 9
+F_10 + ... + F_12 is NOT divisible by 27
+F_10 + ... + F_12 is NOT divisible by 5
+F_10 + ... + F_12 is NOT divisible by 7
+F_10 + ... + F_12 is NOT divisible by 11
+F_10 + ... + F_12 is NOT divisible by 287
+F_10 + ... + F_12 is divisible by 288
+F_10 + ... + F_12 is NOT divisible by 289
+F_10 + ... + F_12 is NOT divisible by 1000

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/02 - Other example.txt

@@ -0,0 +1,24 @@
+F_0 + ... + F_10 is divisible by 1
+F_0 + ... + F_10 is NOT divisible by 1000
+F_0 + ... + F_10 is NOT divisible by 2
+F_0 + ... + F_10 is NOT divisible by 3
+F_0 + ... + F_10 is NOT divisible by 5
+F_0 + ... + F_10 is NOT divisible by 7
+F_0 + ... + F_10 is divisible by 11
+F_0 + ... + F_10 is divisible by 13
+F_0 + ... + F_10 is NOT divisible by 17
+F_0 + ... + F_10 is NOT divisible by 142
+F_0 + ... + F_10 is divisible by 143
+F_0 + ... + F_10 is NOT divisible by 144
+F_5 + ... + F_16 is divisible by 1
+F_5 + ... + F_16 is divisible by 16
+F_5 + ... + F_16 is NOT divisible by 32
+F_5 + ... + F_16 is NOT divisible by 3
+F_5 + ... + F_16 is NOT divisible by 5
+F_5 + ... + F_16 is divisible by 7
+F_5 + ... + F_16 is divisible by 23
+F_5 + ... + F_16 is NOT divisible by 529
+F_5 + ... + F_16 is NOT divisible by 49
+F_5 + ... + F_16 is NOT divisible by 2575
+F_5 + ... + F_16 is divisible by 2576
+F_5 + ... + F_16 is NOT divisible by 2577

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/03 - Big numbers.txt

@@ -0,0 +1,25 @@
+F_32 + ... + F_85 is NOT divisible by 43
+F_20 + ... + F_100 is NOT divisible by 4
+F_32 + ... + F_85 is divisible by 45
+F_20 + ... + F_100 is divisible by 3
+F_32 + ... + F_85 is divisible by 2521
+F_20 + ... + F_100 is divisible by 5
+F_20 + ... + F_100 is NOT divisible by 25
+F_32 + ... + F_85 is NOT divisible by 128
+F_20 + ... + F_100 is divisible by 11
+F_32 + ... + F_85 is NOT divisible by 25
+F_20 + ... + F_100 is NOT divisible by 121
+F_20 + ... + F_100 is divisible by 41
+F_32 + ... + F_85 is divisible by 31
+F_20 + ... + F_100 is divisible by 4577887
+F_32 + ... + F_85 is divisible by 64
+F_32 + ... + F_85 is divisible by 9
+F_32 + ... + F_85 is NOT divisible by 27
+F_20 + ... + F_100 is divisible by 1174951
+F_32 + ... + F_85 is divisible by 5
+F_20 + ... + F_100 is divisible by 2
+F_32 + ... + F_85 is NOT divisible by 7
+F_32 + ... + F_85 is NOT divisible by 13
+F_32 + ... + F_85 is divisible by 61
+F_32 + ... + F_85 is NOT divisible by 17
+F_32 + ... + F_85 is divisible by 19

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/04 - Even big numbers.txt

@@ -0,0 +1,23 @@
+F_123 + ... + F_234 is divisible by 343
+F_123 + ... + F_234 is NOT divisible by 2401
+F_123 + ... + F_234 is divisible by 26013
+F_123 + ... + F_234 is divisible by 3
+F_123 + ... + F_234 is NOT divisible by 78039
+F_123 + ... + F_234 is NOT divisible by 5
+F_110 + ... + F_301 is NOT divisible by 1024
+F_123 + ... + F_234 is NOT divisible by 103680
+F_123 + ... + F_234 is NOT divisible by 103682
+F_123 + ... + F_234 is divisible by 20641
+F_110 + ... + F_301 is divisible by 512
+F_123 + ... + F_234 is divisible by 103681
+F_110 + ... + F_301 is NOT divisible by 1097
+F_110 + ... + F_301 is divisible by 3167
+F_211 + ... + F_398 is NOT divisible by 43759
+F_353 + ... + F_616 is divisible by 6561
+F_211 + ... + F_398 is divisible by 43763
+F_353 + ... + F_616 is divisible by 122464
+F_353 + ... + F_616 is NOT divisible by 5021024
+F_211 + ... + F_398 is NOT divisible by 81
+F_353 + ... + F_616 is NOT divisible by 19683
+F_432 + ... + F_433 is divisible by 106998173
+F_321 + ... + F_321 is NOT divisible by 6

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/05 - Larger indices.txt

@@ -0,0 +1,16 @@
+F_1234 + ... + F_2345 is divisible by 4
+F_3897 + ... + F_3910 is divisible by 54988205
+F_1781 + ... + F_2444 is divisible by 9
+F_1234 + ... + F_2345 is divisible by 6
+F_1234 + ... + F_2345 is NOT divisible by 36
+F_3560 + ... + F_4013 is NOT divisible by 15
+F_1781 + ... + F_2444 is divisible by 2529
+F_1234 + ... + F_2345 is divisible by 3
+F_2123 + ... + F_4489 is divisible by 12810074
+F_1234 + ... + F_2345 is NOT divisible by 9
+F_1234 + ... + F_2345 is NOT divisible by 8
+F_2123 + ... + F_4489 is NOT divisible by 25620148
+F_1234 + ... + F_2345 is NOT divisible by 5
+F_1234 + ... + F_2345 is NOT divisible by 7
+F_1234 + ... + F_2345 is NOT divisible by 15
+F_1781 + ... + F_2444 is NOT divisible by 18

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/06 - Even larger indices.txt

@@ -0,0 +1,13 @@
+F_12345 + ... + F_23456 is divisible by 2
+F_12345 + ... + F_23456 is divisible by 27
+F_12378 + ... + F_64506 is NOT divisible by 2659000
+F_40045 + ... + F_70000 is divisible by 4023361
+F_12345 + ... + F_23456 is NOT divisible by 7
+F_28090 + ... + F_34708 is divisible by 282609
+F_21568 + ... + F_554433 is divisible by 1488436
+F_12345 + ... + F_23456 is NOT divisible by 81
+F_12345 + ... + F_23456 is NOT divisible by 5
+F_34890 + ... + F_40566 is NOT divisible by 243296
+F_12345 + ... + F_23456 is divisible by 16
+F_12345 + ... + F_23456 is NOT divisible by 32
+F_12345 + ... + F_23456 is divisible by 3

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/07 - Become really big.txt

@@ -0,0 +1,20 @@
+F_654321 + ... + F_987654 is NOT divisible by 4
+F_489 + ... + F_1005 is divisible by 258282
+F_654321 + ... + F_987654 is NOT divisible by 3
+F_2468 + ... + F_897089 is divisible by 74400513
+F_654321 + ... + F_987654 is NOT divisible by 55592635
+F_654321 + ... + F_987654 is divisible by 17
+F_489 + ... + F_1005 is NOT divisible by 774846
+F_654321 + ... + F_987654 is NOT divisible by 5
+F_48903 + ... + F_4680607 is divisible by 1399681
+F_654321 + ... + F_987654 is NOT divisible by 289
+F_780613 + ... + F_980156 is NOT divisible by 30
+F_654321 + ... + F_987654 is NOT divisible by 54289
+F_48903 + ... + F_4680607 is NOT divisible by 9797767
+F_654321 + ... + F_987654 is divisible by 53
+F_2468 + ... + F_897089 is NOT divisible by 87927879
+F_654321 + ... + F_987654 is NOT divisible by 2809
+F_654321 + ... + F_987654 is NOT divisible by 11881
+F_780613 + ... + F_980156 is divisible by 6
+F_654321 + ... + F_987654 is NOT divisible by 7647985
+F_654321 + ... + F_987654 is divisible by 29717

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/08 - Really huge.txt

@@ -0,0 +1,13 @@
+F_987000000 + ... + F_987654321 is NOT divisible by 6493915
+F_123456789 + ... + F_123567900 is NOT divisible by 8690943
+F_523489014 + ... + F_528904156 is divisible by 121639
+F_987000000 + ... + F_987654321 is divisible by 48533
+F_987000000 + ... + F_987654321 is NOT divisible by 3
+F_987000000 + ... + F_987654321 is divisible by 2
+F_523489014 + ... + F_528904156 is NOT divisible by 364917
+F_987000000 + ... + F_987654321 is divisible by 17
+F_987000000 + ... + F_987654321 is NOT divisible by 289
+F_123456789 + ... + F_123567900 is divisible by 10373061
+F_987000000 + ... + F_987654321 is divisible by 9349
+F_987000000 + ... + F_987654321 is divisible by 34439
+F_987000000 + ... + F_987654321 is divisible by 4021

package/config/hard/DivisibilityOfFibonacciNumbersSum/output/09 - Other really huge.txt

@@ -0,0 +1,18 @@
+F_999000000 + ... + F_1000000000 is divisible by 15625
+F_1000000000 + ... + F_1000000000 is divisible by 5
+F_42 + ... + F_4894511 is divisible by 452240819
+F_979000000 + ... + F_979002345 is divisible by 28883462
+F_1000000000 + ... + F_1000000000 is divisible by 1953125
+F_1000000000 + ... + F_1000000000 is divisible by 41
+F_979000000 + ... + F_979002345 is NOT divisible by 43325193
+F_1000000000 + ... + F_1000000000 is NOT divisible by 1681
+F_999000000 + ... + F_1000000000 is NOT divisible by 78125
+F_1000000000 + ... + F_1000000000 is divisible by 3
+F_999000000 + ... + F_1000000000 is divisible by 7
+F_42 + ... + F_4894511 is NOT divisible by 421051797
+F_999000000 + ... + F_1000000000 is divisible by 11
+F_1000000000 + ... + F_1000000000 is NOT divisible by 9765625
+F_1000000000 + ... + F_1000000000 is divisible by 1
+F_999000000 + ... + F_1000000000 is NOT divisible by 1681
+F_1000000000 + ... + F_1000000000 is divisible by 7
+F_1000000000 + ... + F_1000000000 is divisible by 11

package/config/hard/DominoesSolver/code/CGCode.cpp

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

package/config/hard/DominoesSolver/code/CGCode.java

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

package/config/hard/DominoesSolver/code/CGCode.js

@@ -0,0 +1,14 @@
+const n = parseInt(readline());
+var inputs = readline().split(' ');
+const h = parseInt(inputs[0]);
+const w = parseInt(inputs[1]);
+for (let i = 0; i < h; i++) {
+    const line = readline();
+}
+for (let i = 0; i < h; i++) {
+
+    // Write an answer using console.log()
+    // To debug: console.error('Debug messages...');
+
+    console.log('|=');
+}