@cyrilverloop/codingame-configuration 1.25.0 → 1.26.0
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/CHANGELOG.md +7 -0
- package/config/easy/PyramidStacker/code/CGCode.cpp +20 -0
- package/config/easy/PyramidStacker/code/CGCode.java +18 -0
- package/config/easy/PyramidStacker/code/CGCode.js +9 -0
- package/config/easy/PyramidStacker/code/CGCode.php +8 -0
- package/config/easy/PyramidStacker/code/CGCode.ts +9 -0
- package/config/easy/PyramidStacker/config.json +63 -0
- package/config/easy/PyramidStacker/input/01 - Full (Example).txt +2 -0
- package/config/easy/PyramidStacker/input/02 - Partial (Example).txt +2 -0
- package/config/easy/PyramidStacker/input/03 - One Cube.txt +2 -0
- package/config/easy/PyramidStacker/input/04 - Patchy.txt +2 -0
- package/config/easy/PyramidStacker/input/05 - Repeat.txt +2 -0
- package/config/easy/PyramidStacker/input/06 - Cut.txt +2 -0
- package/config/easy/PyramidStacker/input/07 - Full.txt +2 -0
- package/config/easy/PyramidStacker/input/08 - Sparse.txt +2 -0
- package/config/easy/PyramidStacker/input/09 - Tall.txt +2 -0
- package/config/easy/PyramidStacker/input/10 - Limit.txt +2 -0
- package/config/easy/PyramidStacker/input/11 - Empty.txt +2 -0
- package/config/easy/PyramidStacker/output/01 - Full (Example).txt +3 -0
- package/config/easy/PyramidStacker/output/02 - Partial (Example).txt +3 -0
- package/config/easy/PyramidStacker/output/03 - One Cube.txt +1 -0
- package/config/easy/PyramidStacker/output/04 - Patchy.txt +4 -0
- package/config/easy/PyramidStacker/output/05 - Repeat.txt +5 -0
- package/config/easy/PyramidStacker/output/06 - Cut.txt +5 -0
- package/config/easy/PyramidStacker/output/07 - Full.txt +7 -0
- package/config/easy/PyramidStacker/output/08 - Sparse.txt +7 -0
- package/config/easy/PyramidStacker/output/09 - Tall.txt +9 -0
- package/config/easy/PyramidStacker/output/10 - Limit.txt +10 -0
- package/config/easy/PyramidStacker/output/11 - Empty.txt +10 -0
- package/config/hard/XthLexicographicallySmallestNumber/code/CGCode.cpp +20 -0
- package/config/hard/XthLexicographicallySmallestNumber/code/CGCode.java +19 -0
- package/config/hard/XthLexicographicallySmallestNumber/code/CGCode.js +10 -0
- package/config/hard/XthLexicographicallySmallestNumber/code/CGCode.php +7 -0
- package/config/hard/XthLexicographicallySmallestNumber/code/CGCode.ts +10 -0
- package/config/hard/XthLexicographicallySmallestNumber/config.json +68 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/01 - test 1.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/02 - test 2.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/03 - test 3.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/04 - test 4.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/05 - test 5.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/06 - test 6.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/07 - test 7.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/08 - test 8.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/09 - test 9.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/10 - test 10.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/11 - test 11.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/input/12 - test 12.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/01 - test 1.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/02 - test 2.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/03 - test 3.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/04 - test 4.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/05 - test 5.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/06 - test 6.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/07 - test 7.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/08 - test 8.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/09 - test 9.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/10 - test 10.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/11 - test 11.txt +1 -0
- package/config/hard/XthLexicographicallySmallestNumber/output/12 - test 12.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/code/CGCode.cpp +20 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/code/CGCode.java +18 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/code/CGCode.js +9 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/code/CGCode.php +8 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/code/CGCode.ts +9 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/config.json +43 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/01 - Base case.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/02 - 2 digits long ans.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/03 - With 7.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/04 - With more digits (21).txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/05 - Still ok 100 digits!.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/06 - 250 NO WAY!.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/input/07 - 500.txt +2 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/01 - Base case.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/02 - 2 digits long ans.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/03 - With 7.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/04 - With more digits (21).txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/05 - Still ok 100 digits!.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/06 - 250 NO WAY!.txt +1 -0
- package/config/medium/NumbersWithOnlyTwoDistinctDigits/output/07 - 500.txt +1 -0
- package/config/medium/TheHoleTruth/code/CGCode.cpp +22 -0
- package/config/medium/TheHoleTruth/code/CGCode.java +23 -0
- package/config/medium/TheHoleTruth/code/CGCode.js +11 -0
- package/config/medium/TheHoleTruth/code/CGCode.php +11 -0
- package/config/medium/TheHoleTruth/code/CGCode.ts +11 -0
- package/config/medium/TheHoleTruth/config.json +58 -0
- package/config/medium/TheHoleTruth/input/01 - Simple ring.txt +6 -0
- package/config/medium/TheHoleTruth/input/02 - Two holes.txt +6 -0
- package/config/medium/TheHoleTruth/input/03 - No holes.txt +6 -0
- package/config/medium/TheHoleTruth/input/04 - Nested rings.txt +10 -0
- package/config/medium/TheHoleTruth/input/05 - Border-touching shapes.txt +12 -0
- package/config/medium/TheHoleTruth/input/06 - Smiley face.txt +13 -0
- package/config/medium/TheHoleTruth/input/07 - Tall grid with irregular hole.txt +14 -0
- package/config/medium/TheHoleTruth/input/08 - Nested blobs with winding walls.txt +41 -0
- package/config/medium/TheHoleTruth/input/09 - Concentric rings and L-shaped enclosures.txt +41 -0
- package/config/medium/TheHoleTruth/input/10 - Stress test.txt +58 -0
- package/config/medium/TheHoleTruth/output/01 - Simple ring.txt +1 -0
- package/config/medium/TheHoleTruth/output/02 - Two holes.txt +1 -0
- package/config/medium/TheHoleTruth/output/03 - No holes.txt +1 -0
- package/config/medium/TheHoleTruth/output/04 - Nested rings.txt +1 -0
- package/config/medium/TheHoleTruth/output/05 - Border-touching shapes.txt +1 -0
- package/config/medium/TheHoleTruth/output/06 - Smiley face.txt +1 -0
- package/config/medium/TheHoleTruth/output/07 - Tall grid with irregular hole.txt +1 -0
- package/config/medium/TheHoleTruth/output/08 - Nested blobs with winding walls.txt +1 -0
- package/config/medium/TheHoleTruth/output/09 - Concentric rings and L-shaped enclosures.txt +1 -0
- package/config/medium/TheHoleTruth/output/10 - Stress test.txt +1 -0
- package/package.json +1 -1
package/CHANGELOG.md
CHANGED
|
@@ -4,6 +4,13 @@ All notable changes to this project will be documented in this file.
|
|
|
4
4
|
The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
|
|
5
5
|
and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
|
|
6
6
|
|
|
7
|
+
## [1.26.0] - 2026-04-30
|
|
8
|
+
### Added
|
|
9
|
+
- configuration for "Pyramid Stacker".
|
|
10
|
+
- configuration for "Numbers with only two distinct digits".
|
|
11
|
+
- configuration for "The Hole Truth".
|
|
12
|
+
- configuration for "Xth Lexicographically Smallest Number".
|
|
13
|
+
|
|
7
14
|
## [1.25.0] - 2026-03-31
|
|
8
15
|
### Added
|
|
9
16
|
- configuration for "The Descent - Part 2".
|
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
#include <iostream>
|
|
2
|
+
#include <string>
|
|
3
|
+
#include <vector>
|
|
4
|
+
#include <algorithm>
|
|
5
|
+
|
|
6
|
+
using namespace std;
|
|
7
|
+
|
|
8
|
+
int main()
|
|
9
|
+
{
|
|
10
|
+
int n;
|
|
11
|
+
int h;
|
|
12
|
+
cin >> n >> h; cin.ignore();
|
|
13
|
+
string cubes;
|
|
14
|
+
cin >> cubes; cin.ignore();
|
|
15
|
+
|
|
16
|
+
// Write an answer using cout. DON'T FORGET THE "<< endl"
|
|
17
|
+
// To debug: cerr << "Debug messages..." << endl;
|
|
18
|
+
|
|
19
|
+
cout << "pyramid" << endl;
|
|
20
|
+
}
|
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
import java.util.*;
|
|
2
|
+
import java.io.*;
|
|
3
|
+
import java.math.*;
|
|
4
|
+
|
|
5
|
+
class Solution {
|
|
6
|
+
|
|
7
|
+
public static void main(String args[]) {
|
|
8
|
+
Scanner in = new Scanner(System.in);
|
|
9
|
+
int n = in.nextInt();
|
|
10
|
+
int h = in.nextInt();
|
|
11
|
+
String cubes = in.next();
|
|
12
|
+
|
|
13
|
+
// Write an answer using System.out.println()
|
|
14
|
+
// To debug: System.err.println("Debug messages...");
|
|
15
|
+
|
|
16
|
+
System.out.println("pyramid");
|
|
17
|
+
}
|
|
18
|
+
}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
var inputs: string[] = readline().split(' ');
|
|
2
|
+
const n: number = parseInt(inputs[0]);
|
|
3
|
+
const h: number = parseInt(inputs[1]);
|
|
4
|
+
const cubes: string = readline();
|
|
5
|
+
|
|
6
|
+
// Write an answer using console.log()
|
|
7
|
+
// To debug: console.error('Debug messages...');
|
|
8
|
+
|
|
9
|
+
console.log('pyramid');
|
|
@@ -0,0 +1,63 @@
|
|
|
1
|
+
{
|
|
2
|
+
"path": "easy/PyramidStacker",
|
|
3
|
+
"name": "Pyramid Stacker",
|
|
4
|
+
"alphanumName": "PyramidStacker",
|
|
5
|
+
"link": "https://www.codingame.com/ide/puzzle/pyramid-stacker",
|
|
6
|
+
"tests": [
|
|
7
|
+
{
|
|
8
|
+
"name": "Full (Example)",
|
|
9
|
+
"alphanumName": "FullExample",
|
|
10
|
+
"file": "01 - Full (Example).txt"
|
|
11
|
+
},
|
|
12
|
+
{
|
|
13
|
+
"name": "Partial (Example)",
|
|
14
|
+
"alphanumName": "PartialExample",
|
|
15
|
+
"file": "02 - Partial (Example).txt"
|
|
16
|
+
},
|
|
17
|
+
{
|
|
18
|
+
"name": "One Cube",
|
|
19
|
+
"alphanumName": "OneCube",
|
|
20
|
+
"file": "03 - One Cube.txt"
|
|
21
|
+
},
|
|
22
|
+
{
|
|
23
|
+
"name": "Patchy",
|
|
24
|
+
"alphanumName": "Patchy",
|
|
25
|
+
"file": "04 - Patchy.txt"
|
|
26
|
+
},
|
|
27
|
+
{
|
|
28
|
+
"name": "Repeat",
|
|
29
|
+
"alphanumName": "Repeat",
|
|
30
|
+
"file": "05 - Repeat.txt"
|
|
31
|
+
},
|
|
32
|
+
{
|
|
33
|
+
"name": "Cut",
|
|
34
|
+
"alphanumName": "Cut",
|
|
35
|
+
"file": "06 - Cut.txt"
|
|
36
|
+
},
|
|
37
|
+
{
|
|
38
|
+
"name": "Full",
|
|
39
|
+
"alphanumName": "Full",
|
|
40
|
+
"file": "07 - Full.txt"
|
|
41
|
+
},
|
|
42
|
+
{
|
|
43
|
+
"name": "Sparse",
|
|
44
|
+
"alphanumName": "Sparse",
|
|
45
|
+
"file": "08 - Sparse.txt"
|
|
46
|
+
},
|
|
47
|
+
{
|
|
48
|
+
"name": "Tall",
|
|
49
|
+
"alphanumName": "Tall",
|
|
50
|
+
"file": "09 - Tall.txt"
|
|
51
|
+
},
|
|
52
|
+
{
|
|
53
|
+
"name": "Limit",
|
|
54
|
+
"alphanumName": "Limit",
|
|
55
|
+
"file": "10 - Limit.txt"
|
|
56
|
+
},
|
|
57
|
+
{
|
|
58
|
+
"name": "Empty",
|
|
59
|
+
"alphanumName": "Empty",
|
|
60
|
+
"file": "11 - Empty.txt"
|
|
61
|
+
}
|
|
62
|
+
]
|
|
63
|
+
}
|
|
@@ -0,0 +1,2 @@
|
|
|
1
|
+
280 9
|
|
2
|
+
NMVGLARXEPCLHDCGGKEICUBXQKNEKOLGGGOMUMIJRLTWSBRMCWKYEOPFDLMKUSOOADTXWLPQDUJBOBLRAXNKCKFGLCQKVRPIMKAJQDMONVEZCRKMRKVAEZNLCQNYGJJIHAULMIWKPXSAUUVKHOJNTOOHZCCEUQBNSHICYWZCFIUACSECTWJACURWPGLTXYCSMGRTXRNNHMKOITUNYQAVUOPZREUDNSGTPDUAQVXNOQORYKOSEFUQDQRDQBANQYBFYDEEYSEWHPMMTJHVGZUJLEXH
|
|
@@ -0,0 +1,2 @@
|
|
|
1
|
+
384 10
|
|
2
|
+
CNEKBJWOVNUODVCUYUPYWMUZWDOPNRLDQUZFWDVNQEAXARHPBWPIGMCUEGOFXFPWPRFKRIQPJQBCFJCFYGYXSPGGFLDYZUEBONKXTGOJTOWQFLULMIYXXQBVHOYGPNFPYSSMBCIQCLSSIITTMICGMSXZTNGDPQDKZTHEFBWWKCFNRGHYLYWTVOZXAVWQNMSZRKBVSXQSKLEGIQAUXJHWXVCOHGPKGZSGMDGGBKEHSNELZQJKPCBRVIXUMUBNPVULVSQZIBZMTJXAIDULAYKDUDPUPPGMMFEDNZSQVFQOFZLZPEUZYZENMKJDEGOSLBBAWOXFGSAJGKBWZEEDWCPXEEBBBCELIFASBTMDMJJYXLCGRURJHSUTJDQGSSCEQGUH
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
Y
|
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
#include <iostream>
|
|
2
|
+
#include <string>
|
|
3
|
+
#include <vector>
|
|
4
|
+
#include <algorithm>
|
|
5
|
+
|
|
6
|
+
using namespace std;
|
|
7
|
+
|
|
8
|
+
int main()
|
|
9
|
+
{
|
|
10
|
+
long long m;
|
|
11
|
+
long long n;
|
|
12
|
+
int b;
|
|
13
|
+
long long x;
|
|
14
|
+
cin >> m >> n >> b >> x; cin.ignore();
|
|
15
|
+
|
|
16
|
+
// Write an answer using cout. DON'T FORGET THE "<< endl"
|
|
17
|
+
// To debug: cerr << "Debug messages..." << endl;
|
|
18
|
+
|
|
19
|
+
cout << "answer" << endl;
|
|
20
|
+
}
|
|
@@ -0,0 +1,19 @@
|
|
|
1
|
+
import java.util.*;
|
|
2
|
+
import java.io.*;
|
|
3
|
+
import java.math.*;
|
|
4
|
+
|
|
5
|
+
class Solution {
|
|
6
|
+
|
|
7
|
+
public static void main(String args[]) {
|
|
8
|
+
Scanner in = new Scanner(System.in);
|
|
9
|
+
long m = in.nextLong();
|
|
10
|
+
long n = in.nextLong();
|
|
11
|
+
int b = in.nextInt();
|
|
12
|
+
long x = in.nextLong();
|
|
13
|
+
|
|
14
|
+
// Write an answer using System.out.println()
|
|
15
|
+
// To debug: System.err.println("Debug messages...");
|
|
16
|
+
|
|
17
|
+
System.out.println("answer");
|
|
18
|
+
}
|
|
19
|
+
}
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
var inputs = readline().split(' ');
|
|
2
|
+
const m = parseInt(inputs[0]);
|
|
3
|
+
const n = parseInt(inputs[1]);
|
|
4
|
+
const b = parseInt(inputs[2]);
|
|
5
|
+
const x = parseInt(inputs[3]);
|
|
6
|
+
|
|
7
|
+
// Write an answer using console.log()
|
|
8
|
+
// To debug: console.error('Debug messages...');
|
|
9
|
+
|
|
10
|
+
console.log('answer');
|
|
@@ -0,0 +1,10 @@
|
|
|
1
|
+
var inputs: string[] = readline().split(' ');
|
|
2
|
+
const m: number = parseInt(inputs[0]);
|
|
3
|
+
const n: number = parseInt(inputs[1]);
|
|
4
|
+
const b: number = parseInt(inputs[2]);
|
|
5
|
+
const x: number = parseInt(inputs[3]);
|
|
6
|
+
|
|
7
|
+
// Write an answer using console.log()
|
|
8
|
+
// To debug: console.error('Debug messages...');
|
|
9
|
+
|
|
10
|
+
console.log('answer');
|
|
@@ -0,0 +1,68 @@
|
|
|
1
|
+
{
|
|
2
|
+
"path": "hard/XthLexicographicallySmallestNumber",
|
|
3
|
+
"name": "Xth Lexicographically Smallest Number",
|
|
4
|
+
"alphanumName": "XthLexicographicallySmallestNumber",
|
|
5
|
+
"link": "https://www.codingame.com/ide/puzzle/xth-lexicographically-smallest-number",
|
|
6
|
+
"tests": [
|
|
7
|
+
{
|
|
8
|
+
"name": "Test 1",
|
|
9
|
+
"alphanumName": "test1",
|
|
10
|
+
"file": "01 - test 1.txt"
|
|
11
|
+
},
|
|
12
|
+
{
|
|
13
|
+
"name": "Test 2",
|
|
14
|
+
"alphanumName": "test2",
|
|
15
|
+
"file": "02 - test 2.txt"
|
|
16
|
+
},
|
|
17
|
+
{
|
|
18
|
+
"name": "Test 3",
|
|
19
|
+
"alphanumName": "test3",
|
|
20
|
+
"file": "03 - test 3.txt"
|
|
21
|
+
},
|
|
22
|
+
{
|
|
23
|
+
"name": "Test 4",
|
|
24
|
+
"alphanumName": "test4",
|
|
25
|
+
"file": "04 - test 4.txt"
|
|
26
|
+
},
|
|
27
|
+
{
|
|
28
|
+
"name": "Test 5",
|
|
29
|
+
"alphanumName": "test5",
|
|
30
|
+
"file": "05 - test 5.txt"
|
|
31
|
+
},
|
|
32
|
+
{
|
|
33
|
+
"name": "Test 6",
|
|
34
|
+
"alphanumName": "test6",
|
|
35
|
+
"file": "06 - test 6.txt"
|
|
36
|
+
},
|
|
37
|
+
{
|
|
38
|
+
"name": "Test 7",
|
|
39
|
+
"alphanumName": "test7",
|
|
40
|
+
"file": "07 - test 7.txt"
|
|
41
|
+
},
|
|
42
|
+
{
|
|
43
|
+
"name": "Test 8",
|
|
44
|
+
"alphanumName": "test8",
|
|
45
|
+
"file": "08 - test 8.txt"
|
|
46
|
+
},
|
|
47
|
+
{
|
|
48
|
+
"name": "Test 9",
|
|
49
|
+
"alphanumName": "test9",
|
|
50
|
+
"file": "09 - test 9.txt"
|
|
51
|
+
},
|
|
52
|
+
{
|
|
53
|
+
"name": "Test 10",
|
|
54
|
+
"alphanumName": "test10",
|
|
55
|
+
"file": "10 - test 10.txt"
|
|
56
|
+
},
|
|
57
|
+
{
|
|
58
|
+
"name": "Test 11",
|
|
59
|
+
"alphanumName": "test11",
|
|
60
|
+
"file": "11 - test 11.txt"
|
|
61
|
+
},
|
|
62
|
+
{
|
|
63
|
+
"name": "Test 12",
|
|
64
|
+
"alphanumName": "test12",
|
|
65
|
+
"file": "12 - test 12.txt"
|
|
66
|
+
}
|
|
67
|
+
]
|
|
68
|
+
}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2 15 3 8
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
6 8 8 1
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
70 149 2 48
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
851 950 31 89
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
1208 7380 2 803
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2 100000000 10 1
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4421 87412 5 62080
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
1 100000000 2 50000000
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
1 100000000 10 100000000
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
818218 64845924 12 57752258
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
66097362 104618756 16 32740764
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
8921838386 9999999999 23 101867282
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
14
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
8
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
95
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
939
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4630
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
10
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
60697
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
92108858
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
99999999
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
30039084
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
98838125
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
9023705667
|
|
@@ -0,0 +1,20 @@
|
|
|
1
|
+
#include <iostream>
|
|
2
|
+
#include <string>
|
|
3
|
+
#include <vector>
|
|
4
|
+
#include <algorithm>
|
|
5
|
+
|
|
6
|
+
using namespace std;
|
|
7
|
+
|
|
8
|
+
int main()
|
|
9
|
+
{
|
|
10
|
+
int n;
|
|
11
|
+
cin >> n; cin.ignore();
|
|
12
|
+
int a;
|
|
13
|
+
int b;
|
|
14
|
+
cin >> a >> b; cin.ignore();
|
|
15
|
+
|
|
16
|
+
// Write an answer using cout. DON'T FORGET THE "<< endl"
|
|
17
|
+
// To debug: cerr << "Debug messages..." << endl;
|
|
18
|
+
|
|
19
|
+
cout << "answer" << endl;
|
|
20
|
+
}
|
|
@@ -0,0 +1,18 @@
|
|
|
1
|
+
import java.util.*;
|
|
2
|
+
import java.io.*;
|
|
3
|
+
import java.math.*;
|
|
4
|
+
|
|
5
|
+
class Solution {
|
|
6
|
+
|
|
7
|
+
public static void main(String args[]) {
|
|
8
|
+
Scanner in = new Scanner(System.in);
|
|
9
|
+
int n = in.nextInt();
|
|
10
|
+
int a = in.nextInt();
|
|
11
|
+
int b = in.nextInt();
|
|
12
|
+
|
|
13
|
+
// Write an answer using System.out.println()
|
|
14
|
+
// To debug: System.err.println("Debug messages...");
|
|
15
|
+
|
|
16
|
+
System.out.println("answer");
|
|
17
|
+
}
|
|
18
|
+
}
|
|
@@ -0,0 +1,9 @@
|
|
|
1
|
+
const n: number = parseInt(readline());
|
|
2
|
+
var inputs: string[] = readline().split(' ');
|
|
3
|
+
const a: number = parseInt(inputs[0]);
|
|
4
|
+
const b: number = parseInt(inputs[1]);
|
|
5
|
+
|
|
6
|
+
// Write an answer using console.log()
|
|
7
|
+
// To debug: console.error('Debug messages...');
|
|
8
|
+
|
|
9
|
+
console.log('answer');
|
|
@@ -0,0 +1,43 @@
|
|
|
1
|
+
{
|
|
2
|
+
"path": "medium/NumbersWithOnlyTwoDistinctDigits",
|
|
3
|
+
"name": "Numbers with only two distinct digits",
|
|
4
|
+
"alphanumName": "NumbersWithOnlyTwoDistinctDigits",
|
|
5
|
+
"link": "https://www.codingame.com/ide/puzzle/numbers-with-only-two-distinct-digits",
|
|
6
|
+
"tests": [
|
|
7
|
+
{
|
|
8
|
+
"name": "Base case",
|
|
9
|
+
"alphanumName": "BaseCase",
|
|
10
|
+
"file": "01 - Base case.txt"
|
|
11
|
+
},
|
|
12
|
+
{
|
|
13
|
+
"name": "2 digits long ans",
|
|
14
|
+
"alphanumName": "TwoDigitsLongAns",
|
|
15
|
+
"file": "02 - 2 digits long ans.txt"
|
|
16
|
+
},
|
|
17
|
+
{
|
|
18
|
+
"name": "With 7?",
|
|
19
|
+
"alphanumName": "With7",
|
|
20
|
+
"file": "03 - With 7.txt"
|
|
21
|
+
},
|
|
22
|
+
{
|
|
23
|
+
"name": "With more digits (21)",
|
|
24
|
+
"alphanumName": "WithMoreDigits21",
|
|
25
|
+
"file": "04 - With more digits (21).txt"
|
|
26
|
+
},
|
|
27
|
+
{
|
|
28
|
+
"name": "Still ok? 100 digits!",
|
|
29
|
+
"alphanumName": "StillOk100Digits",
|
|
30
|
+
"file": "05 - Still ok 100 digits!.txt"
|
|
31
|
+
},
|
|
32
|
+
{
|
|
33
|
+
"name": "250? NO WAY!",
|
|
34
|
+
"alphanumName": "Two50NOWAY",
|
|
35
|
+
"file": "06 - 250 NO WAY!.txt"
|
|
36
|
+
},
|
|
37
|
+
{
|
|
38
|
+
"name": "500??",
|
|
39
|
+
"alphanumName": "Five00",
|
|
40
|
+
"file": "07 - 500.txt"
|
|
41
|
+
}
|
|
42
|
+
]
|
|
43
|
+
}
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
44
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4444544
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
777777777666766667776
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4999999449449999994999449944944994449499994444449494944949944994494999944449444499949499449494994944
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2112112222112221212111112121221221121211221111121212111111121212222212211222122122212112211221221112222121221212121121112111222221122221221121111212121211211211221121211211121122122211212221112122111122212112212121112121121122111112111211111212122112
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
72727722222777772272722777727227277772277272727272277222722227227772222722727722727227777772277227727227277277222272777222777722722777772772722722777772227277272772277722772277772727772277777272772277722272227772222272777722277777277777777777777277777277772272227777727272222772772727772227772777272777772722777222777727222227722272277227772722222722727222222772772222277222777722227722777777727727227272727272727722772277777272277777277277277772272777227777222727272222772727727727272277772727222272
|
|
@@ -0,0 +1,22 @@
|
|
|
1
|
+
#include <iostream>
|
|
2
|
+
#include <string>
|
|
3
|
+
#include <vector>
|
|
4
|
+
#include <algorithm>
|
|
5
|
+
|
|
6
|
+
using namespace std;
|
|
7
|
+
|
|
8
|
+
int main()
|
|
9
|
+
{
|
|
10
|
+
int w;
|
|
11
|
+
int h;
|
|
12
|
+
cin >> w >> h; cin.ignore();
|
|
13
|
+
for (int i = 0; i < h; i++) {
|
|
14
|
+
string row;
|
|
15
|
+
getline(cin, row);
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
// Write an answer using cout. DON'T FORGET THE "<< endl"
|
|
19
|
+
// To debug: cerr << "Debug messages..." << endl;
|
|
20
|
+
|
|
21
|
+
cout << "answer" << endl;
|
|
22
|
+
}
|
|
@@ -0,0 +1,23 @@
|
|
|
1
|
+
import java.util.*;
|
|
2
|
+
import java.io.*;
|
|
3
|
+
import java.math.*;
|
|
4
|
+
|
|
5
|
+
class Solution {
|
|
6
|
+
|
|
7
|
+
public static void main(String args[]) {
|
|
8
|
+
Scanner in = new Scanner(System.in);
|
|
9
|
+
int W = in.nextInt();
|
|
10
|
+
int H = in.nextInt();
|
|
11
|
+
if (in.hasNextLine()) {
|
|
12
|
+
in.nextLine();
|
|
13
|
+
}
|
|
14
|
+
for (int i = 0; i < H; i++) {
|
|
15
|
+
String row = in.nextLine();
|
|
16
|
+
}
|
|
17
|
+
|
|
18
|
+
// Write an answer using System.out.println()
|
|
19
|
+
// To debug: System.err.println("Debug messages...");
|
|
20
|
+
|
|
21
|
+
System.out.println("answer");
|
|
22
|
+
}
|
|
23
|
+
}
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
var inputs = readline().split(' ');
|
|
2
|
+
const W = parseInt(inputs[0]);
|
|
3
|
+
const H = parseInt(inputs[1]);
|
|
4
|
+
for (let i = 0; i < H; i++) {
|
|
5
|
+
const row = readline();
|
|
6
|
+
}
|
|
7
|
+
|
|
8
|
+
// Write an answer using console.log()
|
|
9
|
+
// To debug: console.error('Debug messages...');
|
|
10
|
+
|
|
11
|
+
console.log('answer');
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
<?php
|
|
2
|
+
fscanf(STDIN, "%d %d", $W, $H);
|
|
3
|
+
for ($i = 0; $i < $H; $i++)
|
|
4
|
+
{
|
|
5
|
+
$row = stream_get_line(STDIN, 100 + 1, "\n");
|
|
6
|
+
}
|
|
7
|
+
|
|
8
|
+
// Write an answer using echo(). DON'T FORGET THE TRAILING \n
|
|
9
|
+
// To debug: error_log(var_export($var, true)); (equivalent to var_dump)
|
|
10
|
+
|
|
11
|
+
echo("answer\n");
|
|
@@ -0,0 +1,11 @@
|
|
|
1
|
+
var inputs: string[] = readline().split(' ');
|
|
2
|
+
const W: number = parseInt(inputs[0]);
|
|
3
|
+
const H: number = parseInt(inputs[1]);
|
|
4
|
+
for (let i = 0; i < H; i++) {
|
|
5
|
+
const row: string = readline();
|
|
6
|
+
}
|
|
7
|
+
|
|
8
|
+
// Write an answer using console.log()
|
|
9
|
+
// To debug: console.error('Debug messages...');
|
|
10
|
+
|
|
11
|
+
console.log('answer');
|
|
@@ -0,0 +1,58 @@
|
|
|
1
|
+
{
|
|
2
|
+
"path": "medium/TheHoleTruth",
|
|
3
|
+
"name": "The Hole Truth",
|
|
4
|
+
"alphanumName": "TheHoleTruth",
|
|
5
|
+
"link": "https://www.codingame.com/ide/puzzle/the-hole-truth",
|
|
6
|
+
"tests": [
|
|
7
|
+
{
|
|
8
|
+
"name": "Simple ring",
|
|
9
|
+
"alphanumName": "SimpleRing",
|
|
10
|
+
"file": "01 - Simple ring.txt"
|
|
11
|
+
},
|
|
12
|
+
{
|
|
13
|
+
"name": "Two holes",
|
|
14
|
+
"alphanumName": "TwoHoles",
|
|
15
|
+
"file": "02 - Two holes.txt"
|
|
16
|
+
},
|
|
17
|
+
{
|
|
18
|
+
"name": "No holes",
|
|
19
|
+
"alphanumName": "NoHoles",
|
|
20
|
+
"file": "03 - No holes.txt"
|
|
21
|
+
},
|
|
22
|
+
{
|
|
23
|
+
"name": "Nested rings",
|
|
24
|
+
"alphanumName": "NestedRings",
|
|
25
|
+
"file": "04 - Nested rings.txt"
|
|
26
|
+
},
|
|
27
|
+
{
|
|
28
|
+
"name": "Border-touching shapes",
|
|
29
|
+
"alphanumName": "BorderTouchingShapes",
|
|
30
|
+
"file": "05 - Border-touching shapes.txt"
|
|
31
|
+
},
|
|
32
|
+
{
|
|
33
|
+
"name": "Smiley face",
|
|
34
|
+
"alphanumName": "SmileyFace",
|
|
35
|
+
"file": "06 - Smiley face.txt"
|
|
36
|
+
},
|
|
37
|
+
{
|
|
38
|
+
"name": "Tall grid with irregular hole",
|
|
39
|
+
"alphanumName": "TallGridWithIrregularHole",
|
|
40
|
+
"file": "07 - Tall grid with irregular hole.txt"
|
|
41
|
+
},
|
|
42
|
+
{
|
|
43
|
+
"name": "Nested blobs with winding walls",
|
|
44
|
+
"alphanumName": "NestedBlobsWithWindingWalls",
|
|
45
|
+
"file": "08 - Nested blobs with winding walls.txt"
|
|
46
|
+
},
|
|
47
|
+
{
|
|
48
|
+
"name": "Concentric rings and L-shaped enclosures",
|
|
49
|
+
"alphanumName": "ConcentricRingsAndLShapedEnclosures",
|
|
50
|
+
"file": "09 - Concentric rings and L-shaped enclosures.txt"
|
|
51
|
+
},
|
|
52
|
+
{
|
|
53
|
+
"name": "Stress test",
|
|
54
|
+
"alphanumName": "StressTest",
|
|
55
|
+
"file": "10 - Stress test.txt"
|
|
56
|
+
}
|
|
57
|
+
]
|
|
58
|
+
}
|
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
30 40
|
|
2
|
+
..............................
|
|
3
|
+
..............................
|
|
4
|
+
....####....###...###.........
|
|
5
|
+
...####......###..##..........
|
|
6
|
+
....#.........###.##..........
|
|
7
|
+
........#..######.##..........
|
|
8
|
+
.......##############.........
|
|
9
|
+
....#...####...######.........
|
|
10
|
+
....##.#####...######.........
|
|
11
|
+
...#########...#######.....#..
|
|
12
|
+
....########...##..#########..
|
|
13
|
+
....########...#...##......#..
|
|
14
|
+
...#############...##.........
|
|
15
|
+
..###############..###.#......
|
|
16
|
+
..################.##.###.....
|
|
17
|
+
..################.#...#......
|
|
18
|
+
..##################..###.....
|
|
19
|
+
..################.#..###.....
|
|
20
|
+
..###############......###....
|
|
21
|
+
..################....#####...
|
|
22
|
+
..###############..#######....
|
|
23
|
+
..########################....
|
|
24
|
+
..#######################.....
|
|
25
|
+
..#######################.....
|
|
26
|
+
..########################....
|
|
27
|
+
..#########################...
|
|
28
|
+
..##############..#.###..##...
|
|
29
|
+
..##############..#.#.........
|
|
30
|
+
..##############..#.#.........
|
|
31
|
+
..##############....#.........
|
|
32
|
+
..####.#######.######...###...
|
|
33
|
+
..###..#######..#..##...#.....
|
|
34
|
+
...#..#######...#..##.#.##....
|
|
35
|
+
......#.#..#....#..#####......
|
|
36
|
+
......#.##..........#.#.......
|
|
37
|
+
.....##...............#.......
|
|
38
|
+
..####................#.......
|
|
39
|
+
...#.#........................
|
|
40
|
+
..............................
|
|
41
|
+
..............................
|
|
@@ -0,0 +1,41 @@
|
|
|
1
|
+
60 40
|
|
2
|
+
............................................................
|
|
3
|
+
............................................................
|
|
4
|
+
........#........................########.################..
|
|
5
|
+
........##.......................#########################..
|
|
6
|
+
......#...................############################.###..
|
|
7
|
+
......#...................#.....#################...#...#...
|
|
8
|
+
......#..................###...###################..........
|
|
9
|
+
......#....#######......#####...####################..#.....
|
|
10
|
+
......#..................###...#########################....
|
|
11
|
+
..........................#...##############.############...
|
|
12
|
+
.............................##############..#############..
|
|
13
|
+
............###...............#############..###..#.######..
|
|
14
|
+
..............#.....#....#....############.#.###..#.##..##..
|
|
15
|
+
..............#....##...###..#############...###....##...#..
|
|
16
|
+
........#######........####################.##########......
|
|
17
|
+
....#####..#............####..#..######################.....
|
|
18
|
+
....#......###...........###..#..######################.#...
|
|
19
|
+
...##............#..########..#..########################...
|
|
20
|
+
...##..........#.#..#.....##..#..############....#########..
|
|
21
|
+
...#...........###.........#.....############.#.#########...
|
|
22
|
+
...............#.........#.###############################..
|
|
23
|
+
....###.#...............##################################..
|
|
24
|
+
...#########...........###################################..
|
|
25
|
+
..###########...........########.######################.##..
|
|
26
|
+
...####.####.............######...####################...#..
|
|
27
|
+
..####...#####..........#############################.......
|
|
28
|
+
..####...###.#...........############################.......
|
|
29
|
+
...########..#........#...##########################........
|
|
30
|
+
....######...#........#############################.........
|
|
31
|
+
.....#..#.............#..######################..##.........
|
|
32
|
+
.....#................#...##################..#..##.........
|
|
33
|
+
.....####..........####....#.###############..#####.........
|
|
34
|
+
..##.#........................##############...#..#.....##..
|
|
35
|
+
.....#.........................####.######.#...#..#.....#...
|
|
36
|
+
...#.#...........................#...####..#...#..#.....#...
|
|
37
|
+
...#...........#......................#..###......#.....#...
|
|
38
|
+
...#...........#..........#................########.....#...
|
|
39
|
+
...#..........##..........#.............................#...
|
|
40
|
+
............................................................
|
|
41
|
+
............................................................
|
|
@@ -0,0 +1,58 @@
|
|
|
1
|
+
75 57
|
|
2
|
+
...........................................................................
|
|
3
|
+
...........................................................................
|
|
4
|
+
...........#...................#.....#.....................###.#####.#.#...
|
|
5
|
+
...........#...................#.....#....................###....##..#.##..
|
|
6
|
+
.......#...#...................#.....#...................###.....###.#.#...
|
|
7
|
+
....####...#......#.................##...................#####...###.#.....
|
|
8
|
+
...........#.....###........#.####..#.....................#########..#.....
|
|
9
|
+
...........####.#####......###..###.#.#######..............#######.........
|
|
10
|
+
...........#...#####......#####...#.#.#..#..#..............###.#...........
|
|
11
|
+
..............#######......###......#.#.....#..........#.#.##..............
|
|
12
|
+
..............#########.#####.......#########.........#####.##.............
|
|
13
|
+
.........#...#################.......#.................#.#..#...#..........
|
|
14
|
+
........###..####..############......##.....................#..###.........
|
|
15
|
+
.......##########...############.#...###.#.#.........#......#...#..........
|
|
16
|
+
.....#..##########...##############.###.#####.#.##...#......#...#....##....
|
|
17
|
+
....###..########....#############....#..#.########..#...#..#...#...###....
|
|
18
|
+
...#####..######..#################...#....#.#######.#..###.#.#.#..#.......
|
|
19
|
+
..#####....####..###################..#....#..#########..##.#####..#.......
|
|
20
|
+
...###......###..#############.######.#.#......#########.####.####.#.......
|
|
21
|
+
....###.##...############...#..###########.#.#..###########.#...#.###......
|
|
22
|
+
...########..##.####...###...#.####################.#..###..#......##......
|
|
23
|
+
....########..#..###.####...##########..#..#.#..#...#...##..#....#.##......
|
|
24
|
+
.....######..#############..##########...#........#########.#...#####......
|
|
25
|
+
.....#####...####.##.#####.#####..####..###...#.##########..#..######......
|
|
26
|
+
.....#######.####....##########..#####...#...##############.#.###########..
|
|
27
|
+
...##########...#.....#.#..####.######.....###..####..##################...
|
|
28
|
+
...#.#########.###...##.....#########....######.###...#################....
|
|
29
|
+
...#..###########################.##....####..######....#########....#.....
|
|
30
|
+
...##.##########################.......######.########..##########...#.....
|
|
31
|
+
...###......###.##################......####..######################.#.....
|
|
32
|
+
....#........#...##################....####...#########..#############.#...
|
|
33
|
+
...##............#..#..#####..#..####.#####.#.#########..################..
|
|
34
|
+
.........##.....##..#..#####....###....##.##..########...###############...
|
|
35
|
+
..........#......#..#..#.####....########.##########.#########.....######..
|
|
36
|
+
.....####.#......#..#..#...#......##..###..#########..##..##############...
|
|
37
|
+
.........###.....#.....#...........#...#...##############.#############....
|
|
38
|
+
........####.....#######.............#.#..###############################..
|
|
39
|
+
........######................#.....#####..#.############..###.##...#####..
|
|
40
|
+
.......#..#..................###...######......#######.#....#...#...#####..
|
|
41
|
+
.......#......................#..#######..#.....######...#.#...######.#....
|
|
42
|
+
.......#...................#.....#...#######.#..###.#...#####.###..........
|
|
43
|
+
.......######.............###....#..###########.#........#.###.#...........
|
|
44
|
+
...#####..#.#......######..#.....#..################...#.#..#..............
|
|
45
|
+
.......#..#.#....................#.###.##.#######.#...#####................
|
|
46
|
+
.......#..#.#....................#.##.....######.......#.#........#........
|
|
47
|
+
.......#....#..#..#...............###.....#######................###.......
|
|
48
|
+
......##############...............###.#....######....#...........#........
|
|
49
|
+
......#.....#########.######.......######..###.###..####...........####....
|
|
50
|
+
......#....###...#######...#........#..##.####..##.####............#..#....
|
|
51
|
+
......##..###......#####...............######...##..#..............#..#....
|
|
52
|
+
.......#..##.......#..##.....#.......#..#.#.....##.................#..#....
|
|
53
|
+
.......#.#####.....##.###....#.......#..........##.................#..#....
|
|
54
|
+
..........#####....#####.....#.......#.........##..................#..#....
|
|
55
|
+
............####..###.#......#.................#...................####....
|
|
56
|
+
............###..###.........#.................#...........................
|
|
57
|
+
...........................................................................
|
|
58
|
+
...........................................................................
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
1
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
0
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
2
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
4
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
9
|
|
@@ -0,0 +1 @@
|
|
|
1
|
+
33
|