id stringlengths 9 106 | d_with_params stringlengths 426 57.5k |
|---|---|
CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, false, false, true, true, false, false, false, false];
string [] param0 = ["vztuaitpcplnjy", "33855", "0011110101011", "mmq", "439340517954", "000000000", "uugaurrjbjegl", "6406553695441", "011001", "yjfqeevginjex"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, true, true, true, true, false, false, false, false, false];
int [] [] param0 = [[1, 4, 16, 64], [0, 4, 8, 12], [-2, 0, 2, 4, 6], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [46, 56, 66, 76, 86], [46, 56, 56, 66, 76, 86], [7, 9, 11, 21, 44, 45, 61, 67, 78, 97, 98, 99], [-96, -84, -74, -70, -68, -62, -50, -50, -38, -36, -36, -36, -34, -34, -28, -28, -26, -18, -12, -4, -4, -2, -2, 6, 6, 14, 24, 34, 36, 44, 50, 54, 54, 62, 64, 66, 70, 74, 74, 78, 84, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 3, 5, 11, 14, 15, 15, 17, 18, 19, 20, 20, 22, 32, 33, 35, 36, 37, 39, 44, 45, 46, 51, 54, 57, 58, 61, 61, 63, 64, 67, 69, 70, 70, 79, 82, 86, 89, 92, 93, 95, 99]];
int [] param1 = [4, 4, 5, 7, 5, 6, 11, 33, 33, 40];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, -1, 32, -1, -1, -1, 2, 7, -1, -1];
int [] param0 = [23, 62, 32, 82, 94, 44, 4, 53, 9, 23];
int [] param1 = [16, 76, 46, 48, 99, 21, 57, 23, 55, 15];
int [] param2 = [23, 81, 1, 72, 62, 46, 2, 80, 26, 73];
int [] param3 = [18, 97, 78, 58, 38, 60, 77, 5, 85, 42];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [48, 11, 50, 21, 39, 22, 3, 62, 2, 1];
int [] param0 = [48, 11, 50, 21, 94, 22, 3, 67, 59, 50];
int [] param1 = [63, 55, 89, 71, 39, 44, 41, 62, 2, 11];
int [] param2 = [56, 84, 96, 74, 42, 86, 68, 94, 83, 1];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [372, -1977127, 1, 95, -1149, 122222222, 108, -49, 12, 625];
int [] [] param0 = [[4, 1, 2, 3, 3, 8], [-9, -5, -8, 4, -1, -6, -8, -9, -8, -1, -2, -8], [0, 1], [7, 1, 7, 8], [-7, -4, -4, -2, 8, 3], [1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0], [9, 9, 9], [6, -6, 5], [0, 0, 0, 0, 0, 0, 1, 1, 1], [7, 5, 8, 6, 5]];
int [] param1 = [6, 12, 2, 4, 6, 30, 3, 3, 9, 5];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [309, 1, 454, 0, 60, 20, 185, 63, 191, 295];
int [] [] [] param0 = [[[-43, -43, -39, -38, -36, -26, -25, -22, -12, -12, -11, -4, -3, 2, 3, 4, 18, 19, 25, 26, 27, 31, 31, 33, 33, 36, 42, 44, 47], [-48, -45, -40, -36, -35, -35, -29, -27, -25, -23, -13, -4, 5, 12, 13, 13, 18, 21, 22, 25, 32, 33, 34, 37, 43, 45, 46, 48, 48], [-48, -47, -46, -45, -36, -36, -30, -27, -27, -24, -22, -22, -18, -3, -3, -2, -1, 0, 0, 3, 4, 16, 19, 21, 28, 32, 34, 39, 49], [-46, -38, -36, -31, -30, -30, -29, -27, -21, -19, -14, -13, -12, -8, -7, -2, 1, 1, 3, 10, 11, 19, 19, 22, 28, 36, 47, 47, 49], [-45, -42, -29, -27, -25, -20, -17, -15, -12, -12, -10, -5, 1, 2, 3, 4, 11, 22, 29, 29, 31, 34, 36, 37, 42, 42, 44, 48, 48], [-49, -44, -43, -40, -39, -30, -30, -22, -22, -18, -15, -14, -12, -11, -7, -7, -3, -1, 0, 1, 13, 22, 40, 42, 42, 42, 44, 46, 48], [-49, -49, -42, -34, -29, -27, -24, -19, -14, -7, -3, -2, 1, 4, 5, 8, 12, 13, 18, 23, 24, 24, 29, 30, 36, 38, 44, 46, 48], [-47, -42, -38, -33, -28, -27, -26, -25, -24, -18, -15, -14, -14, -11, -6, -5, -3, -2, 1, 2, 6, 7, 17, 17, 20, 36, 37, 41, 41], [-47, -47, -43, -41, -39, -38, -27, -25, -23, -22, -21, -18, -14, -13, -12, -10, -8, 3, 13, 25, 27, 28, 30, 33, 33, 35, 38, 42, 45], [-49, -48, -47, -47, -45, -39, -36, -35, -28, -28, -26, -9, 0, 3, 9, 16, 19, 19, 20, 22, 24, 25, 27, 33, 35, 43, 47, 48, 49], [-49, -41, -36, -36, -35, -34, -34, -32, -28, -27, -23, -18, -4, 2, 4, 10, 16, 16, 18, 21, 25, 25, 27, 34, 36, 42, 42, 43, 44], [-48, -35, -32, -28, -23, -22, -21, -17, -10, -10, -2, 3, 6, 7, 9, 12, 20, 21, 22, 22, 23, 24, 25, 28, 33, 37, 41, 42, 44], [-48, -47, -45, -44, -44, -41, -37, -32, -32, -28, -26, -25, -21, -8, 2, 2, 5, 7, 9, 12, 13, 14, 17, 25, 26, 32, 33, 35, 39], [-44, -40, -39, -39, -37, -27, -27, -16, -13, -11, -4, -3, 4, 8, 16, 19, 22, 24, 25, 27, 31, 32, 35, 36, 40, 45, 45, 47, 48], [-41, -39, -37, -30, -29, -27, -23, -21, -21, -16, -15, -15, -11, -11, -10, -9, -7, 2, 2, 5, 6, 8, 8, 8, 17, 30, 32, 42, 45], [-45, -42, -39, -32, -28, -25, -24, -23, -18, -16, -15, -12, -7, 3, 4, 8, 11, 12, 15, 17, 20, 21, 30, 32, 35, 38, 43, 44, 45], [-42, -41, -40, -37, -35, -33, -32, -21, -18, -16, -11, -8, -8, -3, -3, -2, 4, 13, 15, 22, 24, 31, 32, 34, 37, 38, 43, 45, 48], [-49, -43, -39, -38, -25, -22, -20, -17, -14, -13, -13, -4, 1, 7, 7, 10, 14, 16, 20, 24, 27, 30, 37, 38, 39, 40, 43, 48, 49], [-49, -49, -48, -48, -46, -43, -43, -35, -34, -28, -24, -8, -8, -2, 11, 11, 18, 19, 20, 22, 26, 30, 30, 33, 38, 38, 41, 48, 49], [-44, -43, -36, -36, -32, -29, -26, -23, -21, -16, -15, -5, -5, -4, -3, -2, 4, 5, 5, 10, 13, 19, 21, 22, 24, 26, 35, 39, 47], [-49, -48, -44, -40, -32, -25, -23, -7, -4, -3, -2, -1, 4, 4, 11, 19, 20, 20, 22, 24, 24, 27, 30, 31, 39, 42, 44, 45, 45], [-43, -42, -38, -37, -30, -27, -20, -18, -16, -15, -14, -12, -7, 7, 12, 13, 14, 16, 17, 18, 22, 22, 23, 31, 37, 38, 43, 44, 48], [-43, -36, -33, -31, -30, -23, -17, -15, -14, -14, -13, -12, -11, -10, -9, -7, -5, -2, 0, 12, 14, 23, 24, 24, 28, 33, 37, 42, 44], [-49, -47, -47, -46, -44, -43, -34, -31, -19, -18, -16, -9, -8, -7, -6, -3, 0, 7, 14, 16, 16, 18, 28, 33, 36, 36, 37, 47, 49], [-48, -45, -45, -40, -38, -35, -34, -32, -27, -27, -18, -17, -17, -9, -6, -3, 2, 6, 6, 7, 11, 12, 13, 16, 29, 35, 37, 40, 42], [-49, -46, -46, -46, -42, -40, -39, -39, -36, -30, -26, -26, -25, -20, -18, -17, -15, -9, -5, -5, 0, 6, 10, 11, 13, 14, 14, 26, 31], [-49, -46, -43, -41, -35, -34, -33, -32, -28, -19, -12, -11, -7, -5, -1, 10, 11, 11, 12, 12, 13, 18, 18, 22, 26, 32, 42, 43, 43], [-47, -40, -35, -34, -32, -31, -29, -18, -17, -13, -8, -8, -6, -6, 5, 6, 11, 18, 22, 23, 24, 27, 28, 30, 33, 34, 45, 47, 49], [-46, -44, -41, -38, -37, -34, -30, -19, -17, -14, -14, -13, -12, -7, 1, 9, 10, 11, 11, 12, 15, 17, 20, 20, 23, 29, 29, 32, 42]], [[-33, 6], [-16, 18]], [[-48, -48, -45, -44, -43, -41, -39, -37, -36, -35, -34, -32, -29, -29, -27, -27, -27, -26, -16, -13, -11, -10, -8, -5, -3, -3, 5, 6, 13, 14, 16, 24, 26, 32, 44, 49], [-48, -45, -45, -39, -39, -30, -25, -23, -21, -21, -20, -16, -15, -13, -10, -1, 0, 2, 3, 3, 8, 8, 11, 19, 22, 22, 27, 31, 34, 35, 36, 38, 40, 40, 44, 48], [-43, -43, -42, -41, -40, -34, -32, -28, -26, -24, -23, -23, -21, -19, -18, -18, -8, -8, -8, -7, -4, -3, 5, 5, 9, 18, 20, 24, 25, 28, 28, 32, 32, 33, 36, 46], [-49, -48, -46, -42, -39, -33, -32, -30, -26, -19, -17, -16, -16, -13, -12, -11, -4, -3, 0, 6, 8, 19, 26, 26, 32, 33, 37, 39, 39, 39, 41, 42, 42, 47, 47, 48], [-46, -46, -44, -42, -40, -40, -38, -38, -33, -31, -24, -23, -22, -21, -21, -15, -6, -3, -2, 7, 9, 10, 14, 15, 17, 17, 20, 20, 24, 25, 29, 31, 32, 33, 46, 47], [-48, -44, -43, -43, -40, -35, -25, -13, -13, -12, -9, -5, -3, 0, 4, 5, 5, 7, 10, 18, 19, 22, 23, 27, 27, 27, 29, 30, 30, 30, 36, 40, 42, 43, 44, 45], [-48, -45, -44, -43, -36, -34, -31, -28, -28, -27, -26, -26, -24, -18, -15, -15, -14, -7, -3, -2, 2, 3, 6, 13, 13, 15, 19, 22, 26, 35, 36, 37, 40, 40, 47, 49], [-49, -49, -46, -46, -44, -44, -44, -34, -28, -24, -21, -20, -19, -19, -11, -10, -4, 1, 1, 8, 8, 11, 18, 21, 24, 29, 31, 32, 35, 39, 39, 43, 43, 43, 44, 46], [-48, -42, -36, -34, -30, -29, -27, -23, -15, -11, -11, -5, -5, -5, -4, -1, -1, 0, 1, 5, 5, 7, 14, 17, 23, 23, 23, 23, 26, 36, 37, 39, 41, 42, 46, 49], [-46, -43, -43, -42, -42, -42, -41, -39, -38, -29, -24, -24, -22, -22, -21, -14, -11, -9, -3, 1, 2, 6, 9, 10, 12, 13, 15, 15, 25, 26, 27, 36, 37, 40, 43, 49], [-45, -41, -41, -37, -36, -32, -31, -31, -31, -23, -21, -14, -9, -8, -6, -3, -2, 2, 4, 13, 13, 14, 20, 21, 24, 26, 27, 28, 31, 32, 32, 37, 38, 43, 44, 44], [-49, -47, -38, -37, -36, -31, -25, -24, -15, -15, -14, -8, -6, -4, -3, -1, 0, 0, 3, 5, 5, 11, 11, 23, 24, 25, 26, 27, 27, 31, 37, 39, 40, 48, 49, 49], [-49, -44, -41, -31, -31, -28, -21, -20, -17, -9, -4, -1, 0, 4, 6, 7, 12, 15, 15, 16, 16, 16, 17, 17, 21, 22, 22, 23, 25, 27, 31, 32, 33, 39, 40, 44], [-49, -48, -48, -38, -29, -26, -25, -25, -18, -16, -15, -15, -15, -14, -1, 0, 2, 7, 11, 13, 18, 19, 24, 24, 25, 29, 31, 31, 32, 33, 35, 38, 48, 48, 48, 49], [-44, -43, -43, -31, -31, -30, -21, -20, -20, -19, -15, -9, -6, -5, -2, 3, 3, 3, 6, 8, 8, 13, 13, 19, 20, 23, 24, 25, 31, 34, 35, 43, 43, 43, 47, 48], [-48, -45, -45, -35, -27, -24, -21, -16, -15, -15, -13, -11, -10, -5, 0, 0, 1, 2, 6, 6, 9, 9, 10, 12, 12, 13, 14, 17, 20, 26, 28, 28, 29, 30, 33, 35], [-48, -47, -45, -37, -35, -32, -32, -31, -29, -25, -24, -20, -19, -15, -10, -7, -1, 2, 2, 2, 4, 7, 8, 10, 14, 17, 17, 19, 19, 24, 31, 35, 41, 46, 47, 47], [-47, -45, -43, -39, -37, -37, -36, -27, -27, -27, -26, -13, -12, -10, -8, -2, -1, 1, 3, 4, 4, 8, 10, 18, 25, 29, 30, 31, 31, 33, 36, 41, 43, 46, 46, 49], [-49, -42, -37, -33, -27, -20, -19, -19, -17, -13, -12, -12, -10, -9, -9, -6, -6, -1, 14, 16, 20, 21, 24, 25, 25, 26, 27, 30, 30, 31, 33, 40, 43, 43, 46, 46], [-48, -43, -42, -41, -38, -36, -27, -26, -13, -11, -11, -8, -3, 2, 2, 4, 5, 6, 10, 14, 15, 16, 22, 25, 26, 28, 29, 30, 30, 35, 37, 41, 41, 45, 48, 49], [-47, -39, -35, -27, -19, -14, -14, -12, -7, -7, -6, -2, -2, 1, 3, 6, 12, 13, 13, 14, 14, 14, 15, 17, 19, 20, 22, 24, 25, 29, 33, 34, 34, 39, 42, 49], [-47, -47, -42, -37, -36, -36, -34, -26, -22, -21, -16, -15, -14, -13, -11, 0, 0, 0, 5, 10, 14, 18, 18, 21, 22, 25, 26, 26, 29, 30, 32, 33, 37, 38, 41, 45], [-48, -47, -44, -41, -38, -28, -27, -21, -21, -17, -16, -16, -16, -15, -14, -7, -3, 2, 4, 4, 4, 5, 6, 11, 15, 16, 18, 19, 22, 26, 28, 30, 32, 36, 39, 47], [-49, -42, -41, -39, -38, -32, -30, -28, -23, -22, -17, -15, -14, -12, -7, -4, -2, 0, 1, 6, 7, 9, 13, 13, 13, 16, 19, 20, 21, 24, 25, 26, 27, 29, 31, 31], [-49, -48, -47, -46, -41, -41, -39, -39, -38, -34, -33, -27, -26, -20, -19, -16, -13, -12, -12, -9, -8, -2, -2, -1, 0, 8, 10, 15, 20, 21, 22, 32, 32, 36, 38, 40], [-43, -42, -41, -37, -35, -33, -30, -25, -24, -24, -22, -22, -21, -15, -14, -10, -9, -7, -4, -1, 9, 11, 11, 12, 16, 17, 23, 23, 24, 26, 33, 35, 36, 39, 39, 45], [-41, -40, -39, -34, -32, -30, -29, -26, -25, -23, -22, -20, -19, -19, -13, -12, -8, -7, -7, -6, -6, -6, 0, 0, 0, 4, 7, 8, 13, 18, 34, 39, 41, 44, 48, 48], [-49, -49, -47, -45, -38, -34, -27, -23, -23, -23, -21, -20, -20, -19, -10, -5, -4, 1, 9, 11, 16, 19, 19, 19, 21, 21, 24, 25, 27, 29, 32, 33, 34, 43, 47, 49], [-46, -42, -36, -35, -35, -32, -29, -27, -27, -26, -23, -23, -23, -22, -18, -14, -12, -9, -7, -4, -4, 11, 16, 17, 17, 19, 19, 19, 21, 23, 27, 32, 38, 38, 45, 49], [-48, -42, -42, -42, -40, -39, -34, -34, -32, -25, -18, -12, -11, -9, -8, -8, 0, 2, 4, 9, 12, 13, 13, 14, 19, 22, 25, 25, 27, 28, 31, 32, 38, 38, 39, 39], [-46, -46, -45, -42, -41, -41, -41, -31, -31, -31, -29, -27, -25, -18, -9, -9, -8, -3, -2, -2, 4, 5, 9, 14, 14, 20, 25, 29, 30, 34, 40, 42, 44, 48, 49, 49], [-49, -49, -45, -44, -43, -43, -39, -36, -28, -20, -19, -18, -16, -14, -8, -7, -7, -6, -1, 1, 1, 3, 3, 4, 5, 16, 18, 19, 22, 30, 35, 38, 40, 46, 46, 47], [-48, -37, -36, -35, -32, -29, -27, -23, -22, -22, -16, -15, -14, -14, -9, -8, -6, 3, 5, 8, 9, 9, 12, 14, 15, 16, 22, 26, 29, 29, 37, 38, 44, 48, 48, 49], [-47, -46, -46, -42, -42, -41, -40, -39, -34, -33, -32, -30, -23, -23, -21, -20, -16, -14, -13, -12, -7, -1, 0, 6, 7, 7, 13, 17, 17, 18, 25, 25, 27, 28, 40, 45], [-47, -47, -47, -34, -33, -33, -28, -8, -5, 0, 1, 1, 1, 8, 9, 11, 12, 15, 15, 17, 17, 18, 23, 26, 28, 29, 30, 32, 35, 35, 39, 40, 40, 41, 43, 49], [-49, -46, -42, -35, -35, -35, -33, -33, -30, -17, -16, -14, -14, -13, -11, -4, -4, -3, 7, 7, 12, 13, 16, 16, 16, 18, 28, 30, 36, 37, 38, 41, 41, 43, 47, 49]], [[5, 11, 41, 46], [-32, -25, -2, 10], [4, 22, 34, 44], [-40, -27, 12, 29]], [[-43, -38, -33, -18, -1, 7, 7, 9, 11, 14, 15, 18, 27, 45], [-43, -29, -27, -23, -14, -13, -12, -7, -3, 2, 19, 26, 29, 32], [-46, -43, -42, -27, -13, 2, 5, 7, 23, 25, 28, 38, 45, 49], [-49, -45, -23, -20, -5, -1, 21, 25, 28, 36, 39, 39, 41, 46], [-45, -42, -31, -29, -17, 3, 14, 15, 24, 36, 38, 40, 40, 45], [-36, -31, -27, -21, -11, -2, 10, 16, 18, 18, 33, 46, 47, 47], [-49, -44, -32, -14, -10, 3, 13, 22, 25, 35, 37, 42, 44, 48], [-48, -26, -26, -19, -16, -12, -5, -4, 0, 9, 26, 26, 40, 40], [-49, -47, -46, -40, 8, 15, 15, 18, 19, 23, 32, 35, 45, 48], [-31, -31, -29, -11, -6, 2, 14, 20, 23, 33, 35, 43, 46, 47], [-46, -37, -36, -36, -13, -2, -1, 4, 7, 14, 26, 27, 32, 43], [-48, -43, -38, -31, -31, -27, -20, -17, -9, 16, 17, 34, 35, 45], [-44, -38, -25, -15, -12, -1, 3, 11, 21, 27, 30, 36, 44, 47], [-48, -43, -43, -37, -37, -31, -26, -24, -18, -11, -3, -2, -2, 29]], [[-37, -29, -26, -3, 2, 6, 8, 14, 28, 42], [-44, -43, -36, -27, -11, 0, 18, 25, 38, 47], [-33, -3, 2, 11, 13, 15, 16, 17, 24, 28], [-39, -34, -5, -3, 0, 11, 32, 33, 44, 44], [-47, -23, 2, 8, 12, 31, 32, 33, 35, 41], [-45, -34, -10, -3, 15, 26, 38, 40, 41, 44], [-45, -36, -32, -12, -11, -8, 13, 22, 33, 39], [-42, -36, -32, -27, -27, -15, 17, 19, 30, 39], [-42, -24, -23, -12, -10, -5, 23, 33, 33, 40], [-49, -39, -26, -14, 0, 2, 28, 32, 37, 40]], [[-47, -44, -44, -33, -32, -28, -26, -22, -21, -21, -20, -15, -13, -11, -7, -5, 3, 6, 22, 25, 27, 31, 39, 42, 47, 48], [-44, -39, -29, -23, -21, -16, -15, -13, -7, -7, -6, -4, -3, -1, 0, 2, 3, 6, 10, 13, 13, 28, 32, 33, 34, 39], [-48, -43, -42, -40, -33, -33, -33, -23, -22, -16, -14, -13, -12, -11, -9, -9, -3, 4, 8, 9, 15, 20, 24, 36, 42, 45], [-41, -40, -34, -34, -31, -31, -31, -29, -22, -18, -16, -12, -8, -5, -3, 3, 7, 16, 16, 18, 18, 20, 25, 29, 30, 45], [-48, -47, -43, -41, -37, -36, -34, -34, -23, -6, -1, 2, 5, 9, 9, 17, 20, 21, 23, 30, 31, 34, 38, 43, 44, 46], [-44, -41, -39, -36, -32, -29, -20, -12, -7, 2, 2, 4, 4, 5, 11, 13, 14, 18, 22, 23, 24, 27, 32, 34, 44, 49], [-47, -34, -33, -29, -28, -27, -22, -9, -8, -3, 3, 4, 6, 7, 10, 11, 13, 15, 19, 27, 37, 42, 43, 45, 46, 47], [-43, -37, -31, -31, -29, -27, -25, -24, -14, -12, -6, -2, -2, 1, 8, 21, 23, 26, 26, 28, 30, 31, 39, 39, 49, 49], [-48, -40, -37, -34, -34, -26, -21, -19, -17, -15, -12, -4, 3, 5, 5, 6, 15, 23, 27, 28, 29, 36, 42, 45, 47, 49], [-47, -46, -45, -38, -37, -37, -36, -26, -25, -12, -8, -1, 0, 4, 9, 9, 19, 24, 26, 28, 29, 30, 36, 39, 43, 44], [-48, -48, -46, -43, -33, -25, -22, -21, -21, -17, -15, -13, -13, -11, -5, -3, 1, 4, 11, 13, 16, 16, 24, 30, 38, 41], [-48, -41, -40, -38, -38, -27, -27, -24, -15, -13, -11, -2, 4, 7, 11, 16, 17, 18, 27, 28, 28, 30, 32, 36, 45, 48], [-47, -42, -41, -32, -31, -24, -24, -22, -18, -16, -14, -14, -11, -8, 3, 4, 10, 12, 20, 21, 22, 25, 29, 34, 37, 47], [-49, -49, -44, -42, -38, -34, -29, -26, -24, -24, -19, -14, -7, -4, -1, 3, 8, 12, 14, 15, 24, 28, 34, 36, 42, 46], [-46, -38, -34, -32, -30, -29, -28, -19, -14, -8, -3, 8, 14, 17, 20, 20, 20, 22, 23, 24, 24, 29, 36, 42, 45, 46], [-49, -47, -46, -35, -32, -28, -28, -24, -24, -23, -14, -11, -10, -9, -8, -7, -5, 4, 14, 22, 24, 29, 31, 37, 46, 48], [-49, -47, -45, -43, -41, -38, -38, -35, -32, -29, -27, -15, -14, -13, -2, 2, 12, 13, 13, 19, 21, 22, 25, 26, 30, 30], [-47, -47, -38, -35, -35, -34, -33, -30, -29, -22, -21, -15, -14, -10, -8, -4, 4, 10, 15, 25, 26, 27, 31, 32, 36, 48], [-45, -43, -42, -41, -40, -30, -25, -24, -18, -18, -16, -10, -10, -8, -6, -1, 9, 15, 23, 25, 26, 28, 32, 34, 42, 43], [-48, -38, -34, -32, -31, -27, -27, -26, -23, -16, -11, -10, -9, -7, -6, -1, -1, 2, 12, 13, 17, 19, 23, 31, 37, 45], [-42, -25, -19, -18, -12, -12, -10, 0, 2, 4, 6, 6, 19, 28, 31, 37, 37, 38, 39, 40, 40, 40, 41, 42, 48, 49], [-48, -45, -41, -37, -36, -35, -34, -33, -29, -18, -18, -13, -11, -10, 4, 5, 5, 14, 23, 28, 29, 29, 29, 31, 32, 35], [-47, -42, -31, -22, -19, -14, -12, -8, -8, 1, 2, 3, 8, 13, 18, 19, 27, 29, 31, 39, 42, 43, 48, 49, 49, 49], [-45, -43, -22, -20, -16, -16, -3, 0, 0, 4, 6, 13, 13, 14, 19, 23, 23, 32, 34, 37, 37, 39, 40, 43, 44, 47], [-49, -36, -29, -27, -26, -25, -19, -14, -12, -11, -10, -7, -6, -3, -1, 0, 1, 6, 10, 16, 18, 23, 24, 38, 46, 48], [-47, -45, -39, -34, -29, -23, -17, -11, -10, -8, -7, -7, -5, 2, 2, 7, 14, 17, 17, 26, 29, 31, 31, 33, 34, 49]], [[-48, -47, -44, -39, -37, -35, -28, -12, -7, -7, -5, 2, 8, 9, 15, 27], [-34, -25, -25, -23, -17, -9, -6, 4, 8, 16, 19, 36, 36, 44, 45, 46], [-47, -26, -20, -12, -6, 0, 8, 9, 13, 17, 22, 24, 29, 29, 38, 38], [-44, -36, -34, -32, -30, -27, -26, -21, -10, 9, 16, 27, 28, 31, 36, 40], [-23, -20, -16, -15, -9, -2, 0, 0, 4, 12, 14, 20, 22, 33, 35, 41], [-44, -43, -41, -39, -36, -27, -20, -13, -13, -5, 3, 28, 30, 31, 36, 40], [-47, -37, -33, -33, -2, -1, 10, 16, 20, 25, 25, 35, 40, 44, 45, 46], [-49, -47, -45, -42, -41, -37, -32, -31, -15, -14, 0, 21, 26, 27, 34, 47], [-43, -43, -34, -33, -31, -25, -24, -17, -5, -1, 15, 23, 24, 34, 40, 46], [-48, -42, -34, -34, -27, -26, -19, -11, -7, 8, 19, 22, 23, 34, 35, 42], [-49, -43, -39, -15, -8, -4, -3, -2, 16, 20, 21, 22, 22, 30, 32, 34], [-49, -46, -40, -31, -28, -19, -15, -12, -10, -8, 5, 8, 37, 42, 42, 43], [-48, -35, -22, -20, -16, -15, -11, -9, -6, 2, 17, 18, 29, 38, 46, 49], [-39, -34, -25, -24, -11, -9, 2, 9, 14, 18, 21, 26, 29, 34, 39, 47], [-41, -31, -19, -12, -9, -6, 1, 10, 11, 16, 22, 24, 26, 27, 35, 43], [-42, -32, -32, -31, -18, -13, -5, 3, 5, 13, 20, 26, 28, 42, 43, 47]], [[-47, -46, -43, -40, -39, -36, -31, -30, -28, -26, -23, -9, -5, -5, -4, 4, 5, 9, 15, 34, 35, 38, 38, 39, 42, 42, 45, 47, 48], [-47, -46, -46, -43, -34, -31, -31, -29, -27, -24, -23, -19, -15, -12, -11, -11, -2, 0, 4, 10, 19, 19, 28, 28, 40, 42, 45, 45, 47], [-48, -47, -42, -41, -41, -27, -26, -23, -21, -19, -16, -13, -2, 0, 1, 6, 18, 20, 20, 24, 28, 29, 29, 36, 42, 46, 48, 49, 49], [-48, -43, -43, -37, -33, -33, -25, -20, -19, -19, -18, -8, -5, -4, -3, -2, 3, 4, 5, 9, 9, 9, 12, 13, 13, 23, 39, 43, 45], [-45, -43, -42, -34, -34, -26, -24, -17, -15, -12, -7, -4, -3, -1, 3, 12, 14, 16, 20, 21, 21, 23, 27, 33, 37, 46, 46, 47, 47], [-48, -44, -41, -38, -23, -18, -14, -14, -7, -7, -5, -4, 1, 3, 4, 4, 9, 14, 15, 16, 23, 25, 28, 29, 30, 34, 35, 38, 38], [-47, -46, -45, -44, -40, -38, -34, -33, -12, -9, -6, 2, 6, 9, 10, 11, 11, 13, 14, 28, 30, 30, 31, 33, 35, 36, 41, 41, 41], [-45, -44, -42, -39, -38, -37, -33, -29, -29, -25, -18, -8, 1, 8, 8, 9, 10, 10, 10, 13, 18, 19, 20, 25, 29, 33, 42, 42, 43], [-49, -47, -47, -46, -41, -39, -36, -36, -32, -29, -29, -15, -8, -7, 2, 4, 6, 10, 14, 16, 21, 26, 27, 27, 34, 42, 42, 47, 49], [-49, -48, -42, -41, -34, -33, -25, -24, -22, -20, -14, -14, -13, -10, -8, -6, -5, -5, -4, -2, 0, 3, 6, 11, 23, 35, 40, 44, 45], [-44, -40, -33, -28, -28, -24, -22, -22, -21, -18, -18, -13, -10, -10, -8, -7, -5, 1, 3, 3, 6, 8, 20, 20, 25, 31, 33, 40, 40], [-47, -47, -45, -44, -38, -33, -33, -30, -28, -15, -14, -13, -8, -5, -4, -3, 1, 2, 9, 9, 13, 20, 25, 36, 37, 38, 43, 43, 48], [-48, -45, -44, -38, -37, -37, -34, -30, -28, -23, -23, -17, -16, -15, -6, 1, 3, 5, 9, 10, 10, 16, 16, 26, 28, 31, 32, 44, 47], [-44, -43, -41, -33, -30, -27, -27, -26, -23, -22, -22, -16, -15, -9, -3, -2, -1, 5, 9, 9, 13, 16, 21, 29, 33, 39, 39, 47, 47], [-48, -38, -36, -32, -28, -28, -27, -23, -21, -21, -16, -6, -4, -2, 4, 10, 13, 15, 19, 21, 25, 26, 26, 30, 31, 38, 40, 48, 48], [-48, -46, -43, -41, -37, -36, -32, -31, -25, -12, -11, -11, -7, -7, -5, 1, 12, 16, 19, 21, 27, 31, 32, 33, 34, 41, 44, 46, 48], [-42, -42, -41, -31, -27, -24, -22, -21, -8, -7, -1, 0, 2, 2, 4, 6, 8, 13, 20, 21, 21, 24, 28, 31, 36, 39, 41, 45, 46], [-48, -47, -46, -41, -34, -26, -25, -24, -23, -18, -13, -8, -4, -4, -2, 5, 5, 11, 12, 13, 14, 20, 23, 25, 29, 34, 36, 38, 39], [-45, -45, -40, -38, -38, -36, -33, -27, -25, -24, -24, -22, -16, -14, -13, -8, -5, -3, 3, 12, 13, 14, 17, 20, 38, 41, 46, 47, 48], [-44, -43, -37, -34, -33, -21, -20, -20, -19, -19, -18, -17, -15, -11, -10, -6, -5, -4, 0, 2, 4, 6, 23, 24, 31, 32, 35, 44, 49], [-47, -43, -39, -34, -24, -17, -17, -12, -10, -10, -5, -1, 2, 7, 11, 12, 13, 16, 19, 24, 24, 25, 26, 26, 33, 38, 40, 45, 46], [-42, -40, -38, -37, -35, -35, -34, -26, -24, -22, -10, -6, -2, 2, 3, 10, 11, 12, 16, 17, 27, 28, 29, 31, 32, 33, 34, 44, 49], [-47, -43, -42, -30, -26, -26, -26, -24, -22, -22, -18, -13, -9, -8, -7, -2, -2, 1, 5, 6, 14, 15, 18, 19, 24, 26, 46, 48, 48], [-48, -45, -41, -30, -23, -22, -21, -17, -16, -14, -13, -7, -5, -2, -1, 4, 6, 8, 14, 19, 30, 31, 33, 34, 34, 40, 43, 49, 49], [-49, -46, -45, -44, -38, -37, -36, -35, -31, -30, -28, -28, -26, -25, -15, -13, -8, -4, 4, 4, 10, 20, 24, 27, 30, 30, 30, 37, 48], [-47, -46, -44, -44, -42, -41, -40, -30, -29, -29, -27, -23, -17, -12, -10, -9, 7, 12, 19, 22, 30, 38, 40, 41, 43, 43, 46, 49, 49], [-47, -44, -37, -37, -29, -27, -25, -20, -17, -14, -14, -13, -6, -1, -1, 1, 6, 7, 8, 8, 12, 18, 18, 22, 28, 29, 37, 42, 45], [-46, -45, -43, -42, -41, -34, -31, -23, -20, -15, -15, -11, -7, -2, 1, 1, 9, 10, 12, 21, 22, 27, 29, 29, 33, 34, 41, 42, 49], [-47, -45, -41, -39, -31, -29, -28, -23, -22, -15, -14, -14, -8, -8, -3, 5, 5, 8, 9, 11, 12, 16, 20, 25, 32, 32, 36, 38, 49]], [[-43, -41, -38, -35, -34, -32, -30, -30, -30, -25, -25, -18, -16, -12, -9, -7, -5, -2, -1, 1, 2, 5, 10, 12, 12, 17, 22, 23, 23, 28, 33, 37, 40, 43, 47, 48], [-48, -46, -41, -40, -36, -28, -27, -18, -16, -12, -12, -7, -7, -7, -6, -5, 5, 6, 7, 13, 13, 14, 14, 22, 24, 26, 26, 27, 29, 46, 46, 46, 47, 47, 48, 49], [-47, -47, -46, -44, -40, -38, -37, -35, -35, -34, -30, -16, -7, -6, -6, -3, -2, -1, 3, 4, 8, 13, 13, 16, 17, 20, 21, 21, 31, 31, 33, 33, 42, 43, 44, 47], [-48, -45, -39, -30, -29, -29, -29, -24, -21, -20, -16, -14, -13, -13, -10, -10, -4, -4, -3, -1, 6, 9, 10, 11, 11, 13, 14, 14, 16, 17, 24, 25, 34, 35, 41, 48], [-45, -39, -36, -33, -32, -31, -30, -26, -26, -17, -17, -15, -14, -13, -11, -11, -6, -5, 1, 2, 5, 6, 13, 15, 18, 23, 26, 32, 35, 35, 36, 42, 44, 47, 47, 49], [-44, -43, -40, -39, -38, -37, -35, -30, -24, -24, -15, -15, -15, -14, -11, -4, -4, 1, 1, 4, 4, 10, 13, 16, 17, 17, 23, 29, 35, 35, 37, 38, 41, 44, 45, 47], [-46, -46, -46, -43, -43, -38, -35, -30, -26, -23, -21, -18, -16, -6, -6, -6, -5, -4, -3, -1, -1, 4, 8, 10, 13, 18, 20, 22, 27, 27, 28, 39, 42, 43, 46, 49], [-48, -41, -34, -31, -26, -21, -21, -2, -1, 3, 5, 5, 5, 10, 12, 14, 15, 15, 18, 19, 21, 29, 31, 33, 35, 37, 38, 38, 39, 43, 43, 45, 45, 47, 48, 49], [-44, -43, -41, -35, -30, -28, -28, -28, -19, -18, -15, -12, -5, -4, -2, 2, 2, 4, 4, 6, 10, 12, 14, 16, 16, 21, 26, 26, 27, 27, 30, 31, 32, 38, 39, 39], [-43, -42, -40, -39, -39, -37, -36, -31, -30, -28, -28, -27, -27, -24, -23, -20, -15, -5, 1, 1, 10, 12, 14, 14, 16, 16, 28, 30, 31, 32, 37, 42, 44, 44, 45, 49], [-45, -39, -36, -36, -36, -35, -33, -33, -22, -19, -17, -14, -14, -4, -3, -1, 10, 12, 14, 16, 17, 19, 22, 22, 24, 26, 27, 28, 31, 38, 39, 40, 48, 48, 49, 49], [-43, -39, -38, -34, -32, -29, -28, -25, -24, -15, -12, -10, -9, -7, -2, -2, 0, 3, 3, 5, 5, 11, 11, 18, 19, 20, 20, 20, 27, 28, 36, 39, 40, 41, 43, 45], [-49, -43, -41, -36, -34, -33, -30, -26, -23, -23, -23, -22, -13, -8, -4, -3, -1, 2, 6, 13, 17, 18, 20, 23, 23, 31, 31, 33, 34, 36, 37, 39, 41, 43, 44, 46], [-46, -46, -45, -44, -42, -38, -35, -32, -28, -28, -26, -21, -20, -16, -13, -12, -12, -8, -3, 1, 2, 4, 5, 5, 13, 16, 18, 18, 19, 22, 25, 33, 34, 38, 41, 44], [-49, -49, -49, -47, -46, -37, -34, -31, -30, -25, -22, -18, -17, -13, -13, -12, -7, -5, -4, -3, -2, -2, 1, 4, 12, 12, 24, 30, 30, 30, 33, 38, 43, 44, 45, 49], [-44, -43, -39, -39, -38, -37, -35, -34, -34, -26, -17, -14, -12, -8, -6, -2, 1, 6, 6, 8, 13, 16, 16, 19, 22, 22, 26, 26, 30, 34, 38, 39, 42, 43, 45, 49], [-48, -46, -44, -42, -36, -35, -32, -31, -28, -25, -23, -22, -18, -18, -18, -16, -15, -1, 1, 2, 2, 4, 4, 6, 9, 9, 10, 13, 14, 14, 18, 23, 43, 45, 47, 49], [-48, -43, -41, -41, -36, -35, -34, -16, -14, -13, -7, -5, -5, -3, 2, 2, 3, 8, 9, 9, 10, 20, 20, 22, 22, 24, 25, 26, 33, 36, 38, 42, 43, 43, 44, 44], [-48, -46, -45, -40, -36, -33, -30, -29, -29, -28, -27, -26, -24, -24, -24, -22, -17, -16, -11, -6, -1, 1, 3, 8, 9, 11, 14, 14, 23, 24, 25, 26, 27, 41, 45, 49], [-49, -42, -31, -30, -30, -30, -28, -27, -26, -18, -14, -13, -10, -7, -6, 3, 4, 7, 12, 14, 16, 19, 20, 22, 25, 26, 27, 28, 30, 30, 32, 39, 43, 44, 44, 45], [-49, -48, -46, -44, -44, -43, -40, -40, -40, -37, -33, -27, -23, -17, -14, -7, -5, -2, 8, 9, 11, 13, 13, 15, 20, 26, 30, 30, 33, 35, 35, 39, 40, 41, 42, 43], [-38, -36, -36, -35, -35, -28, -26, -22, -20, -18, -18, -16, -16, -15, -14, -14, -13, -12, -11, -7, -6, -4, 1, 3, 6, 8, 12, 16, 18, 22, 22, 36, 37, 40, 45, 49], [-49, -46, -43, -43, -40, -38, -32, -32, -31, -30, -28, -26, -25, -16, -16, -15, -14, -14, -13, -11, -6, -5, -4, 0, 3, 6, 21, 37, 37, 38, 39, 40, 42, 45, 45, 47], [-49, -40, -37, -35, -34, -34, -33, -31, -28, -22, -19, -19, -18, -18, -16, -12, -12, -11, -8, -8, -2, -1, 8, 10, 18, 21, 23, 25, 26, 34, 38, 42, 42, 44, 44, 47], [-48, -46, -39, -38, -34, -22, -19, -14, -10, -9, -5, 2, 3, 7, 7, 7, 7, 9, 11, 15, 20, 24, 26, 27, 28, 28, 28, 29, 30, 30, 30, 33, 37, 38, 38, 47], [-49, -44, -43, -42, -37, -36, -31, -31, -20, -19, -17, -14, -11, -10, -9, -7, -3, -3, -2, -2, -1, 5, 7, 14, 14, 16, 18, 20, 23, 23, 30, 31, 38, 43, 45, 47], [-49, -44, -44, -38, -37, -32, -32, -31, -31, -29, -29, -22, -20, -19, -19, -16, -9, -7, 1, 3, 4, 5, 5, 13, 15, 17, 21, 21, 29, 35, 35, 39, 40, 41, 44, 45], [-48, -46, -43, -43, -40, -40, -38, -38, -32, -29, -26, -19, -18, -17, -14, -13, -9, -7, -5, -2, 1, 3, 4, 8, 10, 15, 17, 18, 26, 27, 30, 32, 33, 36, 43, 46], [-47, -45, -41, -40, -39, -39, -38, -29, -26, -24, -21, -21, -17, -15, -9, -8, -7, -3, -2, 6, 6, 7, 8, 10, 11, 11, 17, 23, 26, 27, 28, 29, 33, 34, 36, 42], [-49, -49, -49, -42, -41, -33, -33, -32, -29, -26, -24, -23, -21, -20, -17, -17, -13, -13, -9, -2, -2, -1, 1, 4, 7, 11, 11, 12, 22, 24, 24, 36, 37, 41, 41, 43], [-45, -39, -36, -33, -33, -31, -29, -24, -23, -23, -21, -20, -8, -8, -7, -5, -2, 1, 4, 8, 8, 11, 13, 14, 14, 14, 16, 16, 17, 19, 22, 27, 28, 34, 37, 38], [-49, -48, -47, -41, -41, -38, -38, -35, -34, -27, -26, -26, -19, -17, -5, -2, -2, -1, 1, 4, 5, 5, 6, 9, 11, 12, 16, 29, 33, 34, 36, 42, 42, 43, 43, 47], [-46, -45, -44, -41, -35, -35, -28, -25, -24, -14, -13, -11, -11, -7, -4, -4, 2, 4, 5, 6, 7, 7, 8, 11, 13, 16, 16, 20, 25, 27, 35, 36, 37, 39, 43, 48], [-48, -41, -40, -38, -37, -32, -24, -20, -19, -15, -7, -5, -1, 0, 3, 7, 8, 15, 18, 25, 25, 26, 27, 28, 31, 33, 37, 38, 38, 39, 43, 43, 47, 48, 48, 49], [-49, -39, -37, -35, -28, -23, -22, -21, -20, -17, -16, -11, -8, -2, -1, 2, 3, 3, 7, 8, 9, 10, 14, 19, 23, 23, 26, 28, 28, 35, 40, 41, 44, 45, 47, 48], [-48, -44, -40, -38, -37, -30, -27, -26, -24, -23, -23, -22, -22, -20, -16, -16, -12, 0, 0, 1, 2, 5, 8, 16, 22, 22, 27, 27, 32, 35, 39, 39, 44, 46, 46, 49]]];
int [] param1 = [27, 1, 35, 3, 13, 8, 18, 11, 16, 27];
int [] param2 = [27, 1, 28, 2, 13, 8, 15, 11, 15, 25];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_BINARY_DECIMAL_CONVERSION_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 20, 154, 0, 130, 61, 0, 0, 1, 0];
string [] param0 = ["uemiagf", "753310137", "010011010", "kni", "04562016903312", "000111101", "bk", "9", "1", "xxt nxllk"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, true, true, true, false, false, false, false, false];
int [] param0 = [1, 3, 27, 9, -9, 11, 57, 21, 60, 44];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1082, 2347, 11, 79, 1597, 106, 3322, 436, 352, 821];
int [] param0 = [46, 68, 4, 12, 56, 14, 81, 29, 26, 40];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
WILDCARD_CHARACTER_MATCHING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, false, true, false, true, true, true, false];
string [] param0 = ["g*ks", "ge?ks*", "g*k", "*pqrs", "abc*bcd", "abc*c?d", "*c*d", "*?c*d", "?*1", "a*"];
string [] param1 = ["geeks", "geeksforgeeks", "gee", "pqrst", "abcdhghgbcd", "abcd", "abcd", "abcd", "010111111001", "cbzhmjugcujd"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 1, 0, 0, 0, 0, 0, 0, 0, 0];
int [] param0 = [45, 16, 15, 91, 82, 18, 31, 6, 93, 35];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [6, -98, 0, 1, -98, 0, 5, -160, 0, 23];
int [] [] param0 = [[2, 4, 5, 9, 10, 10, 11, 14, 15, 19, 21, 22, 29, 36, 36, 38, 39, 39, 39, 41, 41, 42, 45, 45, 48, 55, 56, 57, 64, 66, 66, 66, 66, 69, 74, 76, 80, 81, 82, 82, 85, 87, 95, 95], [-98, -88, -52, -10, -6, 16, 20, 36, 48, 66, 68, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 4, 5, 6, 10, 11, 15, 24, 29, 32, 35, 43, 48, 49, 62, 71, 78, 91], [-98, -92, -88, -84, -82, -78, -74, -74, -68, -62, -62, -56, -56, -50, -46, -44, -26, -18, -14, -8, -8, -6, 8, 16, 20, 20, 22, 26, 36, 42, 44, 44, 52, 60, 66, 68, 68, 70, 76, 84], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 12, 38, 39, 52, 54, 62, 81, 87, 93], [-84, -76, -74, -70, -40, -32, -32, -26, -24, -18, -18, -12, -10, -8, 0, 4, 8, 16, 40, 40, 44, 60, 70, 86, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [23, 31, 44, 56, 58, 61, 62, 63, 72, 74, 86, 97, 97, 98]];
int [] param1 = [33, 6, 16, 13, 25, 32, 6, 25, 37, 12];
int [] param2 = [27, 10, 16, 17, 34, 32, 8, 20, 29, 13];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
POLICEMEN_CATCH_THIEVES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 0, 0, 0, 0, 0, 0, 0, 1];
char [] [] param0 = [['a', 'b', 'b', 'd', 'e', 'e', 'f', 'g', 'g', 'g', 'i', 'j', 'o', 'p', 'q', 'q', 'q', 'q', 'r', 'r', 's', 'u', 'x', 'y', 'y', 'c', 'd', 'h', 'i', 'i', 'i', 'i', 'k', 'k', 'l', 'l', 'l', 'l', 'm', 'p', 'r', 'r', 's', 't', 't', 'u', 'x', 'z'], ['7', '6', '0', '1', '0', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['y', 'k', 's', 'i', 's', 'r', 'i', 'z', 'y', 'f', 'e', 'u', 'y', 'g', 'f', 'f', 's', 'v', 'v', 'd', 'v', 'v', 's', 'd', 'k', 's', 'f', 'v', 'g', 'i', 'j', 'p', 'j', 'k', 'r', 'n', 'm', 'o', 'l', 'x', 'y', 'u', 'y', 'k', 'w'], ['1', '1', '5', '8', '8'], ['0', '1', '0', '0', '1', '1', '1', '0', '0', '0', '1', '0', '1', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '0', '0', '1', '1', '1', '0', '0', '0', '0', '0', '0'], ['a', 'i', 'k', 'q', 'q', 'x', 'z', 'f', 'g'], ['7', '0', '6', '9', '7', '5', '1', '3', '9', '8', '0', '0', '1', '3', '9', '2', '5', '5', '2', '7', '9', '3', '3', '9', '3', '8', '5', '5', '0', '4', '6', '2', '7', '4', '0', '4', '6', '4', '2', '3'], ['0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1'], ['d', 'c', 'p', 'h', 'g', 'o', 'u', 'p', 't', 'g', 'e', 'u', 'n', 'e', 'u']];
int [] param1 = [33, 3, 9, 24, 2, 23, 5, 35, 8, 11];
int [] param2 = [45, 3, 10, 44, 2, 18, 8, 28, 10, 12];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 10, 2798, 20, 2, 270, 8, 2, 563, 3];
string [] param0 = ["r", "2956350", "11100111110101", "tztdliifad", "98", "1100100001", "okwgeatf", "19", "00010110100", "cyq"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [5, 11, 13, 13, 7, 3, 16, 17, 13, 5];
int [] param0 = [50, 92, 49, 94, 7, 30, 88, 98, 94, 23];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, true, true, false, false, false, false, false, false];
int [] param0 = [1, 2, 8, 1024, 24, 7, 46, 61, 73, 66];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [49, 59, 76, 27, 61, 67, 63, 85, 26, 16];
int [] param0 = [49, 59, 76, 27, 61, 67, 63, 85, 90, 24];
int [] param1 = [31, 28, 25, 22, 19, 16, 13, 10, 7, 4];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [-180831, -15630, -251193, -111919, -208740, -268510, -287700, -138167, -10289, -32987];
double [] param0 = [7322.337365895532, -0.5025472034247969, 8735.336068205026, -5478.862697905712, 8264.126919165505, -9671.311773842834, 9995.328351000411, -5274.574323066984, 1310.8711644223736, -2829.678131972794];
double [] param1 = [6996.326968156217, -2910.070017192333, 1910.3752934680874, -9470.18148108585, 7058.937313484608, -3867.070379361206, 2145.339179488316, -3583.7503371694124, 5214.059687285893, -9371.556600288217];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [49, -96, 0, 79, -90, 1, 2, 86, 0, 11];
int [] [] param0 = [[49, 90], [-96, 94, 92, -24, 48, 54, -30, -86, 28, -18, 12, -64, -36, 68, 68, -78, -6, 30, -84, 20, 52, -36, 40, -62, 90, -48, 86, 98, 12, 44, 98, -66, 52, 34, 36, 76, -50, -20, -20, -20], [0, 1], [79, 55, 18, 99, 38, 93, 19, 49, 21, 74, 16, 76, 82, 52, 86, 17, 42, 9, 6, 63, 1, 40, 75, 59, 41, 81], [-90, -84, -82, -68, -66, -66, -60, -60, -48, -44, -36, -34, -30, -16, -14, -12, -10, -6, 2, 10, 10, 14, 22, 26, 30, 34, 46, 50, 52, 62, 64, 64, 66, 72, 74, 78, 78, 82, 84, 88, 92], [1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1], [2, 4, 5, 7, 7, 18, 18, 23, 23, 25, 25, 31, 41, 43, 45, 46, 52, 52, 55, 64, 69, 69, 80, 81, 84, 90, 91, 93, 94, 94, 94, 94, 96, 98, 99], [86, 66, -8, 2, -18, -22, 38, 4, -38, -54, 78, 64, 78, 20, -32, 84, -70, 66, -46, 12, -12, 8, 44, 14, 20], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [11, 4, 98, 38, 20, 41, 1, 8]];
int [] param1 = [2, 40, 2, 26, 41, 26, 35, 25, 30, 8];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [188941273, 657, 685792227, 52054840, 59864, 1728, 95, 2385, 5453761, 3];
int [] param0 = [61, 22, 65, 57, 36, 25, 16, 26, 50, 5];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [62, 168, 0, 69, 146, 0, 54, 161, 0, 33];
int [] [] param0 = [[4, 4, 5, 7, 7, 9, 13, 15, 18, 19, 25, 27, 27, 29, 32, 36, 48, 51, 53, 53, 55, 65, 66, 67, 72, 74, 74, 76, 77, 79, 80, 81, 82, 83, 83, 86, 87, 97, 98, 98, 99], [-90, -90, -88, -84, -84, -84, -80, -74, -52, -26, -26, -16, -8, 6, 14, 16, 34, 64, 72, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [10, 12, 12, 13, 13, 23, 25, 26, 29, 32, 39, 43, 43, 54, 62, 79, 92], [-94, -86, -72, -64, -64, -58, -56, -56, -56, -56, -54, -54, -52, -42, -42, -40, -36, -32, -28, -22, -20, -18, -12, -8, -6, -4, 0, 2, 4, 10, 16, 30, 32, 48, 48, 60, 70, 74, 76, 84], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 5, 8, 12, 16, 16, 17, 20, 20, 23, 26, 26, 27, 28, 32, 34, 40, 40, 41, 41, 44, 45, 47, 49, 51, 52, 54, 57, 60, 62, 63, 64, 66, 68, 69, 70, 71, 76, 77, 80, 80, 80, 90, 91, 92, 94, 96, 98, 99], [-98, -92, -92, -92, -92, -86, -78, -74, -72, -68, -60, -52, -48, -48, -46, -46, -44, -40, -38, -26, -18, 2, 4, 4, 10, 14, 14, 16, 20, 38, 48, 48, 50, 56, 60, 66, 74, 76, 80, 84, 88, 96, 96, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [49, 66, 84]];
int [] param1 = [41, 21, 26, 17, 40, 34, 49, 44, 34, 3];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PERFECT_REVERSIBLE_STRING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, true, false, true, true, true, false, false, false, true];
string [] param0 = ["ab", "303", "11110000", "aba", "404", "10101", "abab", "6366", "001", ""];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, true, true, true, true, false, false, false, false];
int [] [] param0 = [[4, 9, 10, 19, 24, 25, 26, 30, 36, 43, 44, 49, 52, 62, 66, 69, 72, 77, 80, 80, 82, 84, 90, 93, 94, 98], [-24, -80, -72, 80, -96, -94, 64, 18, 12, 16, 74, 16, 54, 66, -96, -90, 54, 72, -32, -2, 90, -18, -98, 12, -42, -30, -82, -56, -86, 40], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [28, 15, 21, 28, 85, 68, 24], [-86, -82, -66, -44, -44, -38, -22, -6, -2, 14, 26, 40, 54, 58, 60, 66, 72, 80, 94, 96, 98], [1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1], [44, 53, 85, 85, 86, 88, 93], [70, -38, 62, -34, 74, -32, -58, -34, -54], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [41, 64, 39, 96, 54, 54, 57, 4, 82, 43, 44, 56, 1]];
int [] [] param1 = [[4, 8, 17, 20, 22, 25, 27, 30, 31, 33, 35, 35, 38, 41, 49, 51, 60, 61, 66, 67, 69, 82, 84, 85, 86, 88], [30, -60, -24, 18, 40, 44, -40, 62, 66, -38, 50, -74, -42, -86, -82, -8, 50, -72, -2, -48, -38, -20, -8, 56, -32, 68, 94, 80, -48, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [57, 46, 47, 49, 16, 81, 60], [-96, -86, -74, -56, -52, -42, -32, -22, -16, -10, -4, -4, 10, 42, 48, 52, 58, 62, 84, 90, 96], [0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1], [4, 5, 8, 15, 29, 40, 91], [48, -86, -18, 14, 88, 92, -56, -8, -74], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [44, 58, 40, 87, 22, 82, 8, 81, 88, 42, 15, 14, 81]];
int [] [] param2 = [[12, 14, 17, 20, 22, 27, 29, 31, 32, 38, 41, 43, 56, 59, 59, 64, 66, 67, 68, 69, 71, 76, 83, 83, 85, 99], [-24, 80, 50, -56, -92, 20, 86, -42, -30, 96, 40, -32, -64, 54, -38, -72, -70, 54, -28, 98, 60, 98, -12, -30, -30, 68, -66, 68, -58, 52], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [76, 49, 6, 44, 71, 24, 57], [-92, -92, -90, -82, -62, -44, -42, -40, -38, -36, -22, -20, -8, 12, 22, 26, 30, 44, 54, 64, 86], [1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0], [30, 53, 71, 75, 76, 82, 84], [8, 8, 32, 76, 76, 94, 22, -60, -42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [64, 20, 24, 42, 37, 46, 6, 47, 12, 93, 8, 5, 11]];
int [] param3 = [25, 26, 14, 6, 13, 25, 5, 6, 15, 7];
int [] param4 = [18, 22, 14, 5, 20, 25, 3, 6, 14, 8];
int [] param5 = [16, 20, 14, 5, 17, 23, 4, 6, 10, 6];
int [] param6 = [222, 21, 2, 73, 6, 0, 3, 7, 13, 10];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i], param6[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_NUMBERS_THAT_DONT_CONTAIN_3 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [67, 68, 2, 26, 44, 26, 26, 13, 58, 57];
int [] param0 = [85, 86, 3, 35, 59, 38, 33, 15, 75, 74];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
UNIQUE_CELLS_BINARY_MATRIX | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 1, 1, 0, 0, 0, 0, 0, 0];
int [] [] [] param0 = [[[0, 1, 0, 0], [0, 0, 1, 0], [1, 0, 0, 1]], [[0, 1, 0, 0], [0, 0, 1, 1], [1, 0, 1, 1]], [[0, 1, 0, 0], [0, 0, 1, 0], [1, 1, 0, 1]], [[1, 1, 1, 1], [0, 0, 1, 0], [1, 0, 0, 1]], [[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 33, 13, 43, 21, 83, 34, 30, 20, 82, 85, 36], [7, 69, 9, 45, 18, 47, 1, 78, 72, 53, 37, 20, 95, 71, 58, 41, 38, 44, 15, 35, 81, 27, 21, 40, 44, 90, 44, 5, 97, 49], [69, 92, 21, 8, 66, 37, 14, 34, 60, 61, 46, 21, 91, 18, 61, 69, 34, 82, 54, 99, 90, 29, 41, 92, 70, 90, 58, 82, 30, 33], [63, 96, 90, 86, 34, 49, 12, 22, 85, 24, 56, 25, 66, 1, 74, 34, 5, 17, 1, 78, 21, 6, 75, 39, 59, 20, 84, 85, 64, 24], [41, 90, 67, 38, 38, 28, 10, 24, 62, 52, 71, 87, 87, 24, 95, 50, 86, 91, 38, 69, 18, 72, 99, 49, 17, 76, 86, 53, 6, 94], [66, 5, 2, 62, 99, 5, 31, 81, 63, 91, 95, 74, 76, 18, 77, 57, 72, 99, 62, 4, 62, 46, 71, 21, 60, 45, 79, 98, 22, 65], [6, 65, 83, 27, 10, 55, 78, 34, 41, 32, 67, 51, 80, 39, 97, 5, 58, 99, 17, 23, 90, 46, 7, 62, 7, 15, 30, 20, 67, 86], [54, 50, 71, 95, 49, 50, 3, 64, 46, 81, 22, 52, 37, 60, 67, 48, 30, 88, 97, 43, 10, 71, 80, 96, 2, 72, 79, 67, 84, 98], [46, 41, 4, 87, 8, 10, 5, 74, 90, 80, 59, 58, 23, 61, 17, 28, 18, 52, 58, 41, 75, 98, 79, 1, 97, 73, 17, 79, 4, 46], [70, 6, 83, 23, 94, 1, 73, 61, 22, 65, 57, 36, 25, 16, 26, 92, 5, 22, 14, 73, 78, 80, 94, 96, 70, 17, 1, 18, 75, 11], [92, 12, 34, 80, 74, 8, 90, 42, 14, 51, 9, 83, 98, 38, 29, 29, 28, 88, 92, 76, 83, 6, 2, 53, 31, 37, 56, 93, 40, 12], [55, 97, 57, 45, 25, 42, 18, 30, 18, 7, 79, 30, 5, 69, 33, 6, 48, 4, 13, 26, 49, 20, 32, 96, 65, 89, 89, 53, 65, 3], [21, 43, 25, 85, 67, 93, 35, 86, 23, 13, 98, 23, 63, 99, 83, 15, 79, 26, 67, 81, 94, 61, 28, 34, 16, 43, 11, 24, 87, 25], [77, 19, 34, 66, 72, 5, 75, 66, 54, 96, 24, 76, 80, 51, 24, 50, 54, 17, 96, 84, 35, 30, 47, 42, 22, 31, 51, 37, 88, 88], [13, 89, 31, 14, 84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27, 23, 35, 13, 26, 78, 35, 41, 6, 72, 52, 53, 79], [8, 47, 80, 93, 64, 34, 29, 35, 48, 74, 65, 69, 67, 14, 46, 27, 46, 29, 1, 82, 3, 26, 21, 24, 45, 84, 29, 18, 3, 51], [97, 18, 37, 63, 85, 19, 23, 84, 55, 24, 83, 26, 97, 96, 54, 99, 89, 33, 88, 57, 9, 64, 75, 85, 59, 81, 16, 5, 44, 46], [10, 77, 58, 70, 64, 80, 70, 93, 60, 25, 87, 11, 93, 85, 63, 26, 41, 53, 75, 24, 81, 73, 72, 94, 7, 87, 73, 83, 64, 72], [46, 78, 51, 92, 99, 71, 6, 30, 16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73], [30, 62, 77, 26, 66, 61, 61, 45, 46, 24, 77, 16, 82, 16, 66, 1, 74, 25, 14, 81, 82, 7, 21, 93, 91, 49, 4, 12, 22, 34], [26, 28, 19, 31, 14, 87, 81, 23, 81, 8, 38, 10, 30, 7, 2, 22, 5, 67, 73, 69, 56, 20, 93, 70, 68, 57, 21, 17, 79, 27], [39, 83, 67, 92, 86, 70, 95, 69, 13, 98, 50, 10, 56, 44, 28, 85, 37, 36, 56, 92, 77, 57, 36, 1, 43, 9, 84, 81, 67, 32], [99, 70, 58, 52, 70, 89, 28, 65, 40, 80, 20, 88, 79, 10, 76, 62, 37, 99, 60, 91, 77, 94, 67, 52, 35, 62, 12, 29, 30, 22], [81, 53, 91, 22, 60, 49, 49, 7, 46, 11, 16, 54, 57, 36, 51, 22, 37, 3, 35, 38, 55, 41, 38, 88, 34, 99, 11, 79, 14, 81], [21, 28, 86, 60, 34, 65, 87, 96, 4, 56, 70, 80, 10, 35, 88, 10, 76, 63, 97, 91, 25, 74, 89, 32, 56, 26, 68, 73, 27, 73], [90, 11, 53, 32, 59, 30, 9, 11, 87, 17, 96, 11, 57, 86, 50, 96, 73, 81, 53, 89, 80, 97, 66, 43, 39, 42, 76, 34, 25, 78], [9, 94, 12, 10, 88, 34, 76, 26, 96, 35, 77, 83, 56, 77, 56, 86, 48, 23, 65, 8, 98, 13, 49, 10, 3, 28, 27, 85, 11, 88], [12, 7, 42, 96, 10, 61, 64, 28, 26, 93, 91, 52, 74, 4, 22, 10, 4, 7, 63, 87, 67, 88, 30, 76, 21, 48, 17, 67, 79, 96], [9, 40, 86, 96, 59, 69, 41, 68, 48, 61, 5, 7, 75, 6, 29, 51, 81, 28, 57, 63, 38, 83, 49, 12, 45, 83, 97, 45, 5, 65], [35, 35, 31, 36, 40, 99, 40, 61, 12, 82, 92, 13, 30, 40, 17, 73, 22, 56, 62, 57, 15, 93, 54, 16, 84, 89, 24, 80, 80, 25]], [[0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 45, 59, 40, 83, 46, 59, 89, 37, 82, 68, 65, 97, 28, 41, 83, 97, 15, 87, 93, 39, 78, 94, 66, 77, 28, 31, 12, 13, 3], [63, 29, 64, 94, 76, 85, 66, 50, 80, 96, 92, 73, 17, 56, 83, 7, 36, 40, 1, 42, 36, 39, 1, 88, 63, 74, 75, 86, 56, 31, 1, 41, 11, 6, 51, 64, 81, 78, 96, 20, 4, 39, 47, 22, 93, 42, 77, 79], [35, 25, 3, 51, 12, 14, 40, 32, 50, 68, 29, 31, 96, 24, 11, 30, 19, 36, 6, 2, 19, 46, 40, 18, 36, 46, 56, 52, 54, 56, 20, 1, 23, 38, 20, 4, 69, 6, 63, 90, 1, 63, 79, 80, 87, 86, 54, 69], [43, 5, 70, 66, 10, 36, 35, 45, 23, 62, 47, 16, 37, 42, 35, 40, 16, 69, 11, 51, 93, 75, 80, 89, 50, 67, 67, 65, 12, 7, 43, 46, 96, 22, 76, 6, 38, 39, 60, 85, 62, 92, 96, 27, 49, 15, 33, 96], [46, 98, 71, 13, 53, 39, 50, 70, 60, 9, 4, 94, 92, 21, 12, 77, 50, 13, 52, 91, 92, 82, 80, 21, 55, 10, 78, 92, 29, 11, 30, 40, 91, 49, 3, 1, 32, 39, 85, 2, 74, 31, 18, 7, 5, 29, 68, 46], [56, 3, 13, 67, 72, 50, 4, 42, 99, 76, 24, 19, 99, 82, 40, 34, 89, 7, 75, 38, 19, 99, 45, 20, 91, 95, 89, 2, 93, 37, 31, 42, 6, 85, 97, 9, 74, 86, 95, 53, 11, 83, 76, 16, 13, 38, 13, 15], [18, 16, 41, 50, 69, 91, 66, 41, 27, 59, 65, 14, 35, 23, 22, 27, 50, 25, 98, 54, 49, 91, 99, 85, 3, 25, 68, 57, 15, 67, 11, 92, 3, 18, 53, 9, 79, 72, 40, 56, 14, 61, 13, 47, 74, 94, 5, 86], [99, 5, 12, 35, 85, 26, 1, 10, 38, 24, 95, 47, 87, 85, 2, 95, 2, 30, 25, 83, 62, 1, 92, 63, 84, 59, 54, 69, 55, 94, 87, 42, 91, 53, 65, 9, 71, 51, 90, 16, 53, 70, 62, 37, 61, 57, 45, 76], [88, 17, 2, 95, 37, 54, 42, 29, 65, 78, 40, 11, 58, 96, 20, 66, 31, 5, 96, 50, 9, 41, 10, 53, 49, 26, 67, 36, 23, 94, 39, 59, 23, 23, 43, 25, 84, 60, 33, 33, 65, 47, 33, 38, 24, 73, 95, 49], [92, 87, 30, 82, 58, 90, 97, 59, 16, 93, 16, 33, 39, 46, 38, 23, 26, 49, 81, 24, 83, 42, 27, 2, 8, 79, 41, 13, 91, 22, 47, 47, 65, 69, 29, 79, 30, 46, 6, 6, 87, 52, 5, 86, 41, 20, 20, 39], [30, 48, 81, 60, 23, 60, 50, 13, 74, 38, 39, 68, 19, 52, 41, 92, 27, 23, 19, 80, 35, 5, 88, 5, 93, 6, 41, 41, 54, 44, 48, 37, 93, 56, 33, 91, 35, 6, 46, 74, 36, 44, 7, 7, 29, 80, 65, 60], [35, 57, 29, 38, 77, 12, 87, 80, 58, 78, 80, 6, 36, 52, 88, 27, 25, 40, 36, 60, 29, 95, 3, 13, 68, 11, 48, 79, 60, 2, 79, 70, 13, 35, 51, 56, 40, 77, 59, 12, 16, 53, 41, 20, 40, 61, 77, 34], [19, 45, 91, 29, 19, 56, 27, 2, 40, 65, 78, 8, 27, 97, 95, 30, 25, 49, 56, 65, 31, 99, 60, 85, 34, 17, 73, 29, 72, 83, 6, 88, 6, 3, 95, 31, 76, 52, 8, 90, 26, 15, 77, 56, 86, 62, 13, 46], [54, 9, 88, 3, 23, 12, 41, 44, 58, 11, 19, 59, 73, 37, 10, 73, 33, 77, 20, 44, 75, 93, 13, 63, 14, 73, 54, 42, 38, 83, 72, 82, 98, 36, 9, 80, 5, 15, 24, 64, 48, 43, 39, 25, 80, 86, 80, 97], [5, 60, 7, 18, 6, 12, 33, 98, 21, 58, 82, 78, 42, 94, 46, 3, 57, 53, 62, 13, 51, 19, 59, 62, 37, 77, 15, 90, 70, 91, 12, 89, 50, 47, 16, 16, 67, 34, 88, 46, 87, 64, 94, 49, 21, 53, 62, 81], [54, 82, 3, 53, 12, 80, 38, 78, 91, 18, 84, 35, 81, 84, 70, 90, 71, 76, 17, 21, 70, 47, 37, 89, 54, 15, 11, 9, 68, 3, 13, 96, 6, 1, 5, 66, 86, 96, 41, 50, 7, 21, 81, 53, 20, 65, 32, 96], [84, 74, 6, 41, 33, 74, 25, 24, 95, 93, 12, 37, 50, 9, 93, 67, 4, 54, 85, 6, 66, 37, 84, 45, 97, 14, 84, 43, 66, 7, 55, 37, 76, 16, 17, 95, 71, 90, 1, 2, 95, 84, 33, 13, 65, 51, 33, 3], [60, 83, 44, 96, 5, 47, 43, 47, 6, 60, 36, 37, 77, 76, 6, 30, 92, 10, 28, 6, 73, 24, 52, 82, 68, 45, 87, 27, 68, 13, 75, 75, 19, 33, 78, 13, 7, 33, 32, 45, 56, 72, 46, 98, 19, 34, 63, 70], [54, 55, 50, 65, 45, 30, 79, 73, 61, 93, 59, 2, 30, 46, 68, 19, 84, 5, 73, 84, 57, 63, 52, 59, 60, 80, 84, 20, 90, 33, 12, 21, 56, 23, 20, 87, 49, 47, 70, 45, 76, 35, 72, 27, 80, 47, 32, 29], [71, 80, 53, 93, 56, 89, 43, 4, 64, 91, 87, 23, 60, 30, 43, 88, 48, 80, 7, 87, 31, 19, 52, 68, 6, 83, 60, 91, 93, 12, 38, 13, 28, 5, 46, 46, 81, 27, 26, 62, 68, 72, 90, 97, 12, 77, 85, 52], [37, 25, 39, 67, 19, 71, 81, 77, 24, 51, 45, 8, 72, 45, 2, 30, 67, 45, 26, 17, 38, 67, 57, 33, 94, 79, 72, 94, 64, 23, 12, 8, 73, 72, 38, 33, 48, 97, 45, 75, 23, 43, 25, 15, 10, 20, 16, 99], [98, 85, 57, 46, 1, 25, 56, 46, 59, 62, 78, 61, 83, 8, 41, 15, 44, 82, 1, 97, 65, 34, 4, 81, 2, 39, 54, 10, 42, 45, 26, 27, 39, 25, 29, 82, 22, 90, 60, 90, 52, 85, 21, 8, 66, 98, 76, 18], [81, 15, 3, 85, 83, 59, 55, 32, 11, 82, 53, 29, 67, 4, 92, 9, 57, 38, 7, 65, 35, 47, 34, 63, 9, 90, 72, 19, 26, 46, 56, 10, 43, 30, 40, 55, 58, 31, 72, 47, 77, 37, 94, 57, 79, 57, 99, 3], [29, 88, 45, 87, 73, 2, 15, 96, 18, 29, 40, 3, 97, 58, 71, 94, 91, 38, 29, 31, 65, 43, 27, 27, 93, 69, 3, 29, 13, 97, 60, 84, 67, 70, 81, 47, 68, 97, 33, 6, 64, 78, 71, 70, 51, 67, 22, 72], [24, 77, 77, 65, 53, 41, 32, 69, 71, 45, 32, 28, 97, 14, 13, 93, 50, 40, 1, 47, 91, 30, 34, 46, 1, 34, 59, 7, 65, 42, 82, 99, 19, 13, 23, 66, 3, 86, 36, 49, 72, 87, 72, 57, 89, 99, 64, 11], [41, 6, 45, 81, 57, 82, 33, 61, 18, 7, 29, 69, 16, 95, 69, 74, 29, 29, 16, 4, 65, 72, 92, 1, 92, 3, 64, 66, 89, 57, 75, 18, 39, 84, 81, 7, 55, 17, 68, 36, 94, 1, 35, 76, 17, 80, 28, 32], [55, 35, 19, 93, 93, 80, 4, 21, 44, 62, 1, 83, 51, 90, 76, 17, 37, 92, 36, 29, 69, 3, 15, 67, 77, 69, 21, 23, 47, 86, 34, 41, 90, 47, 31, 35, 7, 45, 57, 96, 22, 70, 21, 49, 47, 27, 10, 86], [44, 51, 18, 68, 99, 38, 36, 60, 68, 74, 96, 74, 45, 74, 75, 9, 13, 57, 82, 57, 37, 47, 11, 28, 6, 33, 14, 47, 29, 15, 56, 69, 86, 31, 19, 18, 58, 70, 73, 30, 95, 35, 17, 16, 97, 68, 95, 33], [36, 11, 60, 4, 63, 5, 64, 85, 77, 4, 35, 26, 26, 19, 37, 11, 66, 31, 18, 75, 44, 16, 58, 2, 59, 96, 48, 86, 36, 8, 36, 25, 40, 95, 4, 43, 74, 27, 38, 81, 38, 64, 89, 17, 13, 85, 79, 24], [7, 64, 63, 22, 53, 74, 97, 12, 72, 22, 39, 47, 64, 44, 16, 59, 34, 46, 80, 78, 70, 55, 74, 24, 27, 73, 16, 2, 31, 63, 47, 19, 56, 11, 86, 93, 95, 8, 74, 6, 31, 99, 50, 29, 21, 41, 69, 69], [88, 79, 56, 28, 34, 56, 77, 55, 44, 32, 86, 29, 3, 69, 11, 48, 53, 56, 53, 26, 9, 75, 65, 56, 28, 23, 31, 66, 61, 82, 16, 59, 81, 48, 17, 35, 95, 99, 59, 88, 41, 37, 30, 82, 91, 16, 84, 47], [28, 21, 41, 45, 97, 73, 64, 88, 13, 94, 43, 97, 58, 88, 20, 63, 1, 23, 33, 57, 81, 54, 66, 95, 31, 54, 16, 37, 7, 1, 94, 18, 42, 39, 26, 75, 65, 57, 69, 86, 77, 17, 7, 71, 12, 38, 87, 48], [55, 54, 72, 15, 30, 55, 73, 21, 60, 78, 8, 47, 36, 73, 26, 84, 70, 34, 60, 23, 97, 85, 41, 90, 69, 55, 73, 45, 61, 33, 89, 52, 81, 19, 75, 8, 70, 6, 72, 57, 88, 60, 19, 52, 41, 91, 84, 88], [38, 69, 16, 39, 97, 74, 51, 5, 83, 62, 41, 85, 67, 59, 92, 19, 80, 62, 53, 66, 8, 46, 12, 88, 65, 82, 23, 39, 60, 27, 57, 44, 70, 28, 23, 34, 25, 11, 48, 65, 10, 73, 26, 10, 18, 60, 73, 45], [26, 9, 36, 15, 24, 40, 2, 4, 95, 20, 39, 45, 26, 60, 69, 68, 86, 70, 31, 69, 7, 69, 4, 91, 73, 37, 2, 49, 83, 17, 17, 40, 51, 88, 77, 28, 46, 78, 87, 87, 74, 49, 17, 27, 62, 11, 83, 44], [91, 36, 16, 60, 87, 97, 52, 22, 78, 77, 86, 71, 38, 65, 51, 97, 86, 23, 15, 79, 31, 28, 67, 42, 25, 33, 97, 23, 92, 53, 16, 37, 5, 11, 12, 21, 18, 14, 33, 21, 26, 89, 25, 35, 63, 20, 63, 66], [12, 32, 97, 48, 95, 97, 59, 20, 37, 40, 61, 56, 14, 36, 76, 90, 34, 6, 46, 77, 22, 99, 83, 23, 64, 96, 44, 11, 68, 61, 76, 56, 51, 63, 30, 10, 88, 23, 1, 48, 4, 28, 44, 67, 2, 58, 6, 42], [17, 37, 44, 23, 40, 85, 44, 31, 76, 93, 13, 90, 97, 98, 20, 47, 10, 65, 52, 63, 29, 54, 86, 50, 65, 44, 8, 9, 23, 84, 34, 16, 86, 62, 87, 65, 78, 52, 23, 38, 40, 8, 32, 40, 66, 48, 13, 27], [46, 71, 3, 85, 61, 72, 65, 17, 26, 29, 72, 38, 51, 43, 72, 8, 25, 55, 45, 91, 86, 67, 57, 49, 54, 47, 64, 24, 62, 33, 99, 40, 29, 8, 75, 16, 33, 64, 11, 29, 49, 88, 66, 5, 88, 53, 44, 7], [95, 94, 70, 69, 79, 27, 99, 54, 73, 23, 58, 17, 87, 46, 47, 93, 59, 45, 62, 54, 75, 13, 12, 2, 42, 54, 11, 78, 22, 85, 49, 37, 36, 89, 49, 58, 3, 66, 91, 33, 18, 48, 75, 71, 37, 50, 36, 27], [22, 31, 40, 54, 64, 70, 53, 54, 54, 97, 71, 6, 64, 54, 65, 46, 42, 93, 75, 92, 56, 40, 15, 30, 23, 12, 92, 95, 30, 16, 30, 68, 33, 57, 97, 28, 85, 79, 26, 14, 57, 15, 66, 16, 37, 11, 11, 33], [2, 33, 63, 3, 84, 33, 26, 34, 78, 52, 93, 66, 72, 27, 72, 71, 75, 94, 49, 47, 21, 21, 71, 84, 61, 14, 20, 5, 31, 62, 12, 56, 56, 12, 66, 26, 68, 30, 98, 20, 66, 35, 79, 51, 14, 55, 36, 53], [54, 63, 94, 58, 27, 2, 85, 78, 91, 85, 23, 35, 62, 72, 59, 76, 64, 92, 41, 33, 97, 9, 79, 74, 49, 2, 3, 23, 74, 19, 18, 35, 54, 60, 9, 95, 94, 52, 50, 12, 17, 91, 85, 49, 48, 27, 14, 55], [13, 3, 64, 88, 96, 72, 99, 23, 80, 73, 39, 58, 18, 54, 31, 64, 42, 37, 98, 70, 78, 88, 97, 42, 83, 29, 70, 3, 18, 85, 29, 52, 42, 52, 36, 95, 8, 96, 80, 86, 2, 51, 15, 17, 13, 54, 99, 25], [74, 75, 33, 78, 98, 22, 44, 4, 26, 1, 10, 2, 29, 25, 87, 94, 60, 89, 13, 40, 34, 35, 79, 39, 42, 84, 86, 25, 14, 83, 86, 87, 1, 39, 30, 5, 94, 71, 62, 77, 31, 7, 29, 51, 89, 77, 79, 51], [94, 71, 69, 14, 94, 23, 80, 88, 43, 56, 21, 30, 76, 40, 94, 22, 2, 23, 87, 86, 62, 30, 27, 98, 75, 93, 37, 70, 16, 20, 74, 46, 74, 25, 59, 86, 32, 17, 90, 80, 10, 17, 2, 66, 29, 4, 30, 61], [58, 76, 34, 78, 24, 88, 82, 25, 89, 25, 92, 30, 55, 89, 24, 39, 77, 2, 34, 16, 48, 24, 50, 2, 93, 39, 81, 59, 23, 12, 77, 69, 15, 60, 64, 2, 70, 64, 36, 87, 13, 2, 5, 40, 80, 64, 39, 35], [57, 41, 45, 34, 19, 90, 42, 17, 35, 76, 35, 6, 52, 74, 43, 23, 83, 43, 53, 72, 73, 67, 97, 66, 34, 35, 82, 27, 27, 64, 39, 60, 81, 73, 96, 23, 78, 11, 4, 51, 38, 51, 48, 80, 36, 25, 5, 74]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], [69, 62, 79, 46, 48, 38, 61, 81, 17, 48, 33, 18, 36, 54, 3, 89, 99, 20], [31, 21, 34, 57, 37, 1, 57, 55, 31, 23, 75, 48, 20, 7, 99, 2, 97, 40], [24, 74, 9, 43, 97, 51, 85, 78, 50, 87, 76, 22, 92, 91, 10, 82, 88, 67], [4, 30, 85, 22, 92, 73, 41, 16, 56, 69, 14, 52, 14, 47, 16, 43, 68, 37], [14, 41, 87, 73, 24, 75, 92, 19, 83, 12, 47, 98, 12, 3, 30, 58, 46, 51], [99, 15, 43, 22, 9, 92, 93, 39, 81, 68, 57, 68, 7, 2, 54, 37, 74, 82], [28, 59, 46, 63, 35, 99, 94, 85, 58, 89, 13, 71, 6, 84, 45, 5, 38, 44], [25, 82, 88, 15, 72, 77, 39, 48, 52, 60, 89, 23, 69, 52, 86, 22, 25, 55], [64, 65, 4, 52, 32, 53, 26, 79, 35, 91, 14, 34, 60, 25, 54, 27, 21, 48], [35, 52, 70, 99, 26, 15, 5, 90, 33, 25, 81, 52, 44, 20, 56, 66, 8, 83], [64, 29, 48, 19, 9, 72, 15, 98, 68, 63, 91, 38, 47, 13, 96, 99, 46, 36], [10, 55, 23, 23, 68, 44, 5, 4, 30, 52, 97, 13, 18, 32, 33, 58, 62, 71], [14, 14, 10, 59, 39, 46, 18, 19, 37, 3, 55, 7, 71, 52, 54, 38, 63, 64], [6, 74, 52, 44, 36, 37, 64, 48, 27, 65, 1, 48, 85, 37, 92, 49, 55, 39], [36, 66, 66, 68, 2, 65, 18, 41, 98, 91, 39, 26, 75, 3, 49, 28, 16, 99], [22, 80, 97, 77, 49, 28, 16, 64, 60, 66, 26, 42, 92, 3, 21, 32, 70, 69], [24, 65, 23, 80, 8, 45, 89, 11, 57, 12, 72, 10, 63, 35, 38, 21, 51, 18]], [[0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 2, 93, 66, 82, 36, 56], [21, 97, 63, 2, 74, 15, 62, 12, 3, 4, 9, 46, 42, 74, 31, 37, 11, 61, 27, 46, 70, 94, 43, 99, 45], [18, 50, 6, 13, 12, 7, 14, 73, 99, 47, 7, 39, 56, 85, 19, 27, 61, 66, 52, 56, 14, 33, 12, 85, 94], [86, 66, 93, 24, 96, 45, 76, 55, 71, 53, 66, 19, 51, 82, 98, 66, 45, 40, 83, 6, 51, 41, 47, 17, 23], [40, 73, 37, 85, 58, 21, 27, 11, 39, 94, 63, 28, 84, 47, 47, 4, 61, 18, 50, 93, 36, 91, 1, 35, 5], [6, 60, 5, 32, 39, 95, 40, 42, 74, 95, 8, 91, 29, 60, 78, 23, 4, 34, 38, 61, 27, 83, 31, 3, 93], [77, 27, 43, 60, 96, 46, 37, 67, 6, 59, 3, 77, 11, 27, 2, 64, 44, 76, 55, 40, 76, 23, 64, 95, 57], [10, 35, 6, 89, 95, 54, 94, 79, 67, 82, 56, 81, 60, 14, 46, 16, 27, 37, 97, 61, 20, 25, 50, 58, 78], [37, 5, 54, 37, 74, 10, 9, 78, 33, 93, 24, 70, 57, 26, 39, 44, 64, 48, 67, 48, 40, 46, 96, 90, 3], [76, 14, 83, 4, 12, 99, 23, 3, 3, 42, 80, 77, 19, 28, 38, 9, 56, 17, 7, 72, 76, 54, 28, 66, 28], [25, 91, 99, 79, 49, 48, 99, 47, 62, 33, 42, 87, 27, 8, 62, 38, 4, 54, 48, 69, 16, 61, 18, 45, 18], [8, 29, 21, 54, 91, 47, 66, 68, 48, 76, 80, 89, 23, 17, 61, 52, 42, 51, 1, 21, 57, 36, 2, 23, 60], [59, 66, 43, 59, 74, 73, 93, 90, 36, 60, 93, 4, 21, 97, 95, 92, 97, 4, 4, 33, 14, 9, 88, 64, 62], [89, 7, 92, 5, 13, 2, 84, 12, 91, 7, 34, 21, 60, 82, 10, 38, 58, 56, 44, 85, 80, 64, 20, 50, 54], [46, 40, 24, 85, 58, 31, 50, 10, 84, 14, 19, 30, 57, 16, 22, 54, 84, 70, 43, 97, 19, 5, 71, 98, 20], [15, 38, 1, 5, 98, 54, 85, 61, 78, 17, 76, 27, 70, 25, 91, 45, 2, 22, 96, 54, 17, 61, 66, 26, 56], [33, 1, 40, 43, 44, 62, 36, 56, 39, 89, 13, 39, 12, 21, 87, 18, 13, 19, 35, 46, 57, 34, 62, 56, 1], [57, 86, 28, 4, 71, 75, 76, 40, 53, 39, 35, 98, 82, 10, 51, 64, 79, 59, 26, 3, 77, 98, 17, 65, 78], [1, 88, 57, 11, 67, 77, 55, 86, 41, 59, 30, 25, 71, 64, 89, 25, 66, 34, 55, 58, 86, 54, 1, 18, 16], [56, 74, 31, 48, 77, 34, 34, 60, 76, 37, 40, 17, 41, 56, 54, 79, 13, 46, 72, 17, 11, 40, 46, 65, 32], [52, 10, 59, 15, 3, 9, 8, 74, 8, 16, 11, 23, 56, 56, 22, 18, 39, 3, 8, 5, 91, 5, 19, 81, 61], [46, 18, 61, 60, 2, 50, 63, 71, 49, 80, 71, 18, 90, 93, 16, 46, 94, 25, 8, 64, 14, 22, 78, 91, 35], [51, 76, 43, 85, 75, 3, 73, 55, 19, 42, 61, 23, 80, 4, 96, 65, 4, 59, 90, 91, 80, 30, 33, 80, 33], [20, 95, 48, 27, 32, 86, 27, 25, 66, 87, 12, 46, 48, 85, 75, 85, 37, 4, 90, 84, 61, 71, 47, 91, 47], [17, 32, 10, 50, 75, 59, 18, 66, 35, 6, 3, 71, 35, 77, 66, 66, 51, 72, 73, 34, 39, 95, 93, 49, 47]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 83, 85, 49, 74], [4, 62, 18, 60, 64, 20, 52, 36, 62, 48, 96, 57, 57, 91, 41, 88, 93, 53, 88, 62, 29, 39, 82], [10, 61, 56, 9, 50, 75, 12, 2, 90, 73, 17, 35, 46, 67, 70, 87, 35, 79, 72, 96, 34, 11, 3], [93, 10, 82, 82, 12, 91, 51, 83, 97, 89, 59, 2, 2, 5, 22, 33, 69, 28, 58, 14, 50, 74, 41], [15, 74, 68, 43, 55, 49, 18, 81, 95, 97, 25, 12, 55, 47, 85, 81, 84, 93, 67, 71, 64, 60, 97], [90, 84, 43, 37, 32, 99, 85, 52, 53, 56, 72, 2, 48, 16, 91, 36, 10, 92, 81, 89, 79, 18, 92], [2, 40, 42, 95, 95, 25, 1, 82, 16, 42, 37, 37, 71, 6, 78, 22, 95, 74, 46, 40, 54, 46, 36], [41, 98, 67, 23, 43, 61, 17, 93, 65, 3, 78, 75, 30, 21, 16, 62, 60, 9, 66, 26, 67, 15, 12], [19, 14, 15, 87, 11, 63, 43, 67, 43, 1, 4, 85, 25, 84, 74, 82, 97, 53, 35, 25, 3, 51, 50], [13, 35, 89, 55, 18, 51, 30, 40, 30, 58, 88, 90, 65, 97, 72, 12, 8, 75, 78, 18, 65, 85, 10], [37, 29, 46, 88, 44, 36, 18, 79, 32, 20, 34, 73, 41, 98, 35, 57, 27, 18, 21, 18, 27, 95, 28], [97, 15, 45, 47, 36, 19, 99, 96, 45, 57, 76, 29, 98, 16, 22, 72, 55, 12, 98, 16, 55, 47, 73], [27, 99, 11, 83, 95, 15, 53, 91, 33, 71, 87, 22, 65, 58, 27, 75, 12, 60, 85, 72, 77, 33, 66], [9, 77, 26, 45, 55, 52, 9, 79, 7, 57, 57, 37, 73, 78, 30, 51, 47, 84, 54, 23, 79, 58, 56], [31, 68, 89, 62, 83, 60, 37, 34, 1, 41, 95, 44, 35, 27, 21, 72, 82, 23, 41, 93, 80, 50, 74], [81, 22, 40, 2, 42, 30, 44, 83, 10, 84, 63, 24, 6, 45, 18, 16, 40, 16, 79, 70, 97, 13, 68], [96, 50, 29, 58, 7, 97, 5, 40, 4, 7, 80, 37, 75, 59, 50, 69, 29, 55, 89, 67, 96, 30, 20], [94, 67, 61, 44, 56, 79, 60, 41, 78, 40, 50, 10, 17, 15, 93, 53, 98, 99, 73, 51, 81, 66, 26], [38, 92, 30, 55, 9, 92, 16, 24, 86, 20, 62, 52, 78, 52, 43, 96, 10, 66, 71, 65, 15, 75, 84], [50, 41, 60, 33, 52, 38, 84, 64, 10, 96, 50, 63, 59, 12, 58, 89, 9, 49, 61, 81, 78, 88, 51], [45, 67, 80, 18, 61, 50, 14, 10, 74, 6, 3, 86, 2, 76, 1, 52, 13, 32, 25, 38, 5, 18, 10], [53, 83, 34, 30, 32, 11, 86, 30, 1, 6, 78, 56, 67, 58, 79, 95, 19, 61, 62, 86, 71, 91, 35], [43, 5, 46, 35, 87, 36, 4, 61, 2, 35, 46, 4, 60, 48, 4, 70, 51, 17, 4, 86, 57, 85, 76]]];
int [] param1 = [3, 3, 3, 3, 1, 1, 10, 15, 17];
int [] param2 = [4, 4, 4, 4, 28, 32, 12, 17, 22];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SUM_PAIRWISE_PRODUCTS_2 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1397887, 15675, 11449977, 1155, 420497, 2645897, 3327486, 2493271, 2972060, 15675];
int [] param0 = [57, 18, 97, 9, 42, 67, 71, 66, 69, 18];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 5, 5, 3, 6, 11, 5, 6, 13, 5];
int [] [] param0 = [[7, 33, 34, 42, 42, 45, 73], [-98, -90, -80, -66, -64, -62, -48, -30, -20, -10, 4, 6, 12, 14, 32, 42, 44, 44, 52, 64, 86, 92, 94], [0, 0, 0, 0, 1], [11, 44, 71, 82, 85, 89], [-96, -92, -78, -72, -68, -58, -52, -50, -50, -48, -42, -32, -20, -18, -4, 0, 0, 2, 18, 18, 20, 24, 32, 34, 36, 38, 38, 60, 66, 68, 70, 72, 72, 74, 76, 96, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8, 9, 10, 11, 12, 15, 17, 19, 20, 21, 24, 30, 33, 35, 36, 39, 41, 41, 42, 54, 62, 63, 68, 70, 71, 72, 77, 85, 86, 86, 94, 95, 97, 97], [-94, -90, -72, -70, -66, -60, -24, -16, 4, 4, 10, 22, 28, 36, 46, 60, 70, 72, 76, 92, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [7, 10, 12, 16, 20, 28, 31, 40, 42, 47, 53, 57, 59, 63, 63, 67, 69, 84, 90, 97]];
int [] param1 = [5, 23, 5, 6, 37, 21, 34, 21, 24, 20];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [34, 30, 2, 13, 9, 2, 16, 25, 2, 15];
int [] [] param0 = [[4, 4, 6, 7, 8, 11, 13, 18, 26, 35, 36, 37, 45, 46, 46, 47, 48, 49, 51, 52, 53, 56, 61, 74, 75, 77, 80, 83, 85, 86, 87, 90, 93, 95, 97, 98, 99, 99], [78, -48, 50, -20, -6, 58, -8, 66, 72, 68, 4, 80, 58, -26, -82, -56, 92, 76, 20, 82, -46, 86, 38, 60, -62, -48, 76, 8, -66, -4, -98, -96, -52, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [98, 78, 94, 42, 62, 83, 7, 62, 60, 94, 16, 28, 50, 15, 18, 71, 86, 47, 62, 89], [-82, -70, -68, -56, -50, -44, 4, 18, 28, 30, 30, 42, 66, 78, 80], [1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0], [4, 5, 13, 15, 18, 28, 32, 40, 46, 46, 55, 57, 61, 63, 65, 68, 77, 79, 79, 96], [-2, 82, 2, -74, -6, -24, 54, -74, -98, 8, -94, -60, -42, -38, 36, -38, -58, -70, -28, -34, 70, -6, -2, -76, -40, -4, 0, -4, 76, 48, -34, -26, -48, -58, -88, -44, 20, -22, 78], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 90, 28, 71, 69, 45, 92, 63, 72, 76, 47, 85, 36, 59, 88, 46, 28, 19, 50, 31, 63, 13]];
int [] param1 = [36, 33, 19, 15, 9, 25, 17, 31, 26, 15];
int [] param2 = [37, 23, 13, 11, 11, 25, 18, 24, 24, 12];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [630, 4371, 28, 3321, 3240, 1128, 28, 861, 1770, 595];
int [] param0 = [35, 93, 7, 81, 80, 47, 7, 41, 59, 34];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [30, 80, 20, 40, 80, 90, 90, 20, 90, 0];
int [] param0 = [31, 78, 19, 36, 77, 94, 86, 16, 95, 2];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, true, false, false, false, false, false, false];
int [] param0 = [57, 3, 10, 10, 6, 3, 3, 20, 96, 25];
int [] param1 = [1, 9, 101, 10000, 46656, 2048, 40, 79, 98, 5];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 6, 0, 2, 0, 1, 6, 35, 0];
string [] param0 = ["fzokcdz lav", "2", "1000001110", "iaoybzgiwho", "211806", "1", "cvaqtg", "6265187228", "10111101101000", "vei"];
string [] param1 = ["fka", "187012", "0", "oa", "10", "001011100", "ct", "628", "01111", "bigsvkqg"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_INTEGER_OVERFLOW_MULTIPLICATION | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, true, true, false, false, false, false, false, false, false];
long [] param0 = [37, 10000000000, 10000000000, 999999999, 39, 92, 14, 19, 14, 88];
long [] param1 = [80, -10000000000, 10000000000, 999999999, 36, 56, 21, 38, 82, 41];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, true, false, false, false, false, false, false];
char [] [] param0 = [['l', 'i', 's', 't', 'e', 'n'], ['t', 'r', 'i', 'a', 'n', 'g', 'l', 'e'], ['t', 'e', 's', 't'], ['n', 'i', 'g', 'h', 't'], ['i', 'n', 'c', 'h'], ['d', 'u', 's', 't', 'y'], ['g', 'j', 'l', 'm', 'o', 'o', 's', 't', 't', 'x', 'a', 'a', 'b', 'c', 'e', 'e', 'f', 'g', 'l', 'l', 'p', 'w', 'z'], ['4', '1', '6', '5', '8', '6', '9', '9', '1', '2', '2', '7', '7', '2', '7', '4', '3', '3', '3', '0'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['e', 'r', 'i', 'o', 'p', 'y', 'd', 'q', 'g', 't', 's', 'z', ' ', 'b', 'v', 'c', 'w']];
char [] [] param1 = [['s', 'i', 'l', 'e', 'n', 't'], ['i', 'n', 't', 'e', 'g', 'r', 'a', 'l'], ['t', 't', 'e', 'w'], ['t', 'h', 'i', 'n', 'g'], ['s', 't', 'u', 'd', 'y'], ['1'], ['e', 'j', 'r', 'x', 'y', 'a', 'j', 'o', 'y'], ['9', '9', '3', '1', '0', '2', '0'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['g', 'l', 'a', 'j', 'z', 'e']];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [9, -1, 1, 0, 15, 4, -1, 4, 2, -1];
int [] [] param0 = [[2, 4, 6, 19, 21, 23, 32, 34, 47, 51, 56, 57, 57, 65, 68, 68, 69, 70, 71, 73, 74, 74, 77, 77, 79, 82, 82, 86, 87, 87, 88, 89, 90, 91, 92], [24, 62, -32, -28, 42, -46, -96, -70, -68, 60, 44, 34, -30, 96, -26, 92, 62, 42, -46, -38, 44, 54, -94, 52, 66, 68, -96, -58, 84, -2, 66, 30, 42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [94, 6, 48, 34, 31], [-98, -88, -82, -80, -76, -70, -70, -60, -60, -52, -50, -46, -44, -44, -44, -20, -18, -12, -12, -12, -10, -8, -6, -4, 4, 4, 18, 28, 32, 34, 42, 42, 44, 46, 48, 54, 60, 70, 70, 72, 78, 78, 78, 78, 84, 86, 90, 96, 98], [0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0], [1, 5, 13, 17, 26, 26, 32, 35, 38, 38, 39, 45, 52, 58, 60, 61, 62, 63, 82, 83, 85, 89, 89, 91], [-68, -52, 4, -90, 90, 88, 38, -18, 86, 4, 14, -32, -14, -44, -88, -50, -12, -26, -68, -20, -30, 22, 0, 14, -40, 58, -6, 28, -44, 8, 28, 96, -46, -12], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [17, 33, 36, 34, 32, 10, 37, 48, 47, 32, 21, 18, 75, 8, 18, 52, 21, 73, 25, 25, 80, 32, 10, 24, 1, 89, 7, 42, 86, 85, 73, 12, 20, 20, 1, 74, 77, 4, 24, 74, 8]];
int [] param1 = [29, 23, 32, 4, 45, 15, 13, 32, 13, 20];
int [] param2 = [20, 31, 31, 3, 30, 8, 22, 22, 11, 28];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1352078, 10, 252, 352716, 24310, 924, 10400600, 126, 35, 2704156];
int [] param0 = [23, 5, 10, 21, 17, 12, 26, 9, 7, 24];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_EQUAL_POINT_STRING_BRACKETS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [4, 2, 0, 5, 3, 3, 3, 1, 7, 8];
string [] param0 = ["(())))(", "))", "((", "))(()(()()(", ")((()(()", "))(()", "()))", "()", "1100110", "dhfsnebd"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
string [] results = ["v", "86028087054621937", "00000000000000000111111111111111111", "smdawnfhbehmzhcxlareddqvuwokunbkymlhlxhrditay", "00000111222334445555667777788889989999", "11000101100010011000011", "ggjklnqrrsuwxyyabbbcdeeffhjjkklmmnosttwzxz", "4", "00000000111111111", "nhmnnfyzdyspyr"];
char [] [] param0 = [['v'], ['6', '8', '3', '3', '5', '2', '5', '6', '9', '9', '2', '6', '2', '1', '9', '3', '7'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['e', 'g', 'a', 'r', 'f', 'u', 'w', 'k', 'u', 'z', 'y', 'v', 'a', 'w', 'm', 'g', 'h', 'o', 'i', 'a', 'u', 'v', 'f', 'b', 'q', 'e', 'e', 'e', 'l', 'c', ' ', 'w', 'k', ' ', 'k', 'j', 'j', 's', 'q', 'u', 'n', 'i', 't', 'a', 'y'], ['0', '0', '0', '0', '1', '1', '1', '2', '2', '2', '2', '2', '2', '3', '3', '3', '3', '4', '4', '4', '4', '5', '5', '6', '6', '6', '7', '7', '7', '7', '7', '7', '8', '8', '9', '9', '9', '9'], ['1', '0', '0', '1', '0', '1', '1', '1', '0', '0', '0', '1', '0', '0', '0', '1', '1', '0', '0', '0', '0', '1', '1'], [' ', 'b', 'd', 'd', 'd', 'e', 'e', 'e', 'g', 'h', 'j', 'k', 'k', 'k', 'l', 'n', 'o', 's', 'v', 'w', 'y', 'z', 'b', 'c', 'd', 'd', 'f', 'f', 'f', 'f', 'f', 'f', 'i', 'k', 'k', 'o', 't', 'u', 'v', 'x', 'x', 'z'], ['4'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1'], ['d', 'i', 'u', 'k', 'e', 's', 'n', 'z', 'd', 'y', 's', 'p', 'y', 'r']];
char [] [] param1 = [['v'], ['8', '6', '0', '2', '8', '0', '8', '7', '0', '5', '4', '6', '2', '1', '9', '3', '7'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['s', 'm', 'd', 'a', 'w', 'n', 'f', 'h', 'b', 'e', 'h', 'm', 'z', 'h', 'c', 'x', 'l', 'a', 'r', 'e', 'd', 'd', 'q', 'v', 'u', 'w', 'o', 'k', 'u', 'n', 'b', 'k', 'y', 'm', 'l', 'h', 'l', 'x', 'h', 'r', 'd', 'i', 't', 'a', 'y'], ['0', '0', '0', '0', '0', '1', '1', '1', '2', '2', '2', '3', '3', '4', '4', '4', '5', '5', '5', '5', '6', '6', '7', '7', '7', '7', '7', '8', '8', '8', '8', '9', '9', '8', '9', '9', '9', '9'], ['1', '1', '0', '0', '0', '1', '0', '1', '1', '0', '0', '0', '1', '0', '0', '1', '1', '0', '0', '0', '0', '1', '1'], ['g', 'g', 'j', 'k', 'l', 'n', 'q', 'r', 'r', 's', 'u', 'w', 'x', 'y', 'y', 'a', 'b', 'b', 'b', 'c', 'd', 'e', 'e', 'f', 'f', 'h', 'j', 'j', 'k', 'k', 'l', 'm', 'm', 'n', 'o', 's', 't', 't', 'w', 'z', 'x', 'z'], ['4'], ['0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['n', 'h', 'm', 'n', 'n', 'f', 'y', 'z', 'd', 'y', 's', 'p', 'y', 'r']];
int [] param2 = [0, 11, 34, 41, 33, 13, 40, 0, 12, 7];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [5, 8, 6, 12, 11, 11, 11, 12, 11, 8];
int [] param0 = [5, 19, 7, 94, 58, 65, 69, 96, 80, 14];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [3, 15, 7, 127, 255, 31, 63, 1023, 4095, 32767];
int [] param0 = [2, 4, 3, 7, 8, 5, 6, 10, 12, 15];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_PAIRS_DIFFERENCE_EQUAL_K | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 0, 0, 3, 0, 0, 2, 0, 0, 3];
int [] [] param0 = [[9, 14, 17, 19, 22, 23, 23, 27, 30, 31, 34, 37, 37, 39, 39, 42, 57, 61, 68, 73, 77, 79, 91, 96, 97], [-78, -42, 28, -88, 18, -52], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [8, 46, 57, 28, 80, 2, 75, 57, 83, 45, 32, 49, 77, 30, 94, 33, 23, 29, 35, 81, 85], [-90, -72, -72, -62, -62, -54, -54, -52, -48, -38, -22, -22, -22, -12, -12, -8, -8, -8, -6, -6, -2, 6, 12, 26, 26, 28, 28, 38, 40, 48, 52, 52, 58, 60, 68, 70, 72, 76, 76, 76, 92], [0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1], [3, 13, 19, 23, 27, 32, 49, 52, 54, 57, 58, 58, 63, 67, 68, 68, 69, 70, 75, 80, 86, 90, 91, 95], [-56, 40, -66, 42, 8, -40, -8, -42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [99, 12, 90, 10, 86, 86, 81, 19, 1, 1, 98, 82, 34, 39, 34, 1, 54, 47, 39, 82, 21, 50, 82, 41, 98, 47, 88, 46, 72, 28, 28, 29, 60, 87, 92, 53, 93, 29, 74, 75, 11, 32, 48, 47, 85, 16, 20]];
int [] param1 = [19, 3, 16, 15, 22, 45, 19, 7, 16, 24];
int [] param2 = [19, 4, 14, 11, 25, 39, 21, 6, 28, 45];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [12, 0, 2, 0, 2, 8, 15, 14, 4, 2];
int [] [] param0 = [[1, 4, 18, 22, 28, 34, 35, 39, 44, 45, 67, 73, 75, 79, 81, 83, 89, 93, 96], [52, -28], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [24], [-68, 14, 36, 62], [1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0], [7, 10, 19, 22, 24, 28, 29, 39, 46, 55, 62, 66, 68, 73, 74, 76, 83, 84, 85, 99], [-38, 56, 86, 12, 24, -90, -20, -46, 38, 92, -44, -74, 54, 50, 46, 50, -94, 64, 32, -84, 70], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [61, 89, 8]];
int [] param1 = [12, 1, 21, 0, 2, 12, 15, 14, 8, 2];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [41, 131, 1, 1, 90, 1, 89625, 6, 11, 1578];
int [] param0 = [93, 17, 38, 33, 78, 40, 95, 12, 69, 78];
int [] param1 = [54, 4, 39, 64, 35, 61, 16, 8, 60, 21];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CALCULATE_VOLUME_DODECAHEDRON | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
double [] results = [1345766.2993890555, 2981083.5487053124, 81596.89069273109, 7663.118960624633, 4541961.260438062, 61304.95168499706, 1016520.3932458181, 5774704.218276865, 7663.118960624633, 4381671.801138677];
int [] param0 = [56, 73, 22, 10, 84, 20, 51, 91, 10, 83];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, true, true, false, false, true, true, false];
int [] param0 = [59, -20, -100, 54, -16, -23, 93, 24, -8, 29];
int [] param1 = [-99, -21, 79, -49, 16, -68, 37, -61, 69, 10];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [-1, 0, -1, 0, 0, 0, 0, 0, 0, -1];
int [] param0 = [11, 87, 51, 89, 64, 57, 65, 32, 73, 3];
int [] param1 = [36, 1, 1, 67, 10, 86, 90, 23, 61, 99];
int [] param2 = [62, 62, 47, 9, 79, 99, 42, 28, 63, 6];
int [] param3 = [64, 64, 90, 52, 45, 43, 82, 26, 77, 19];
int [] param4 = [50, 54, 14, 94, 67, 83, 77, 60, 92, 21];
int [] param5 = [4, 41, 71, 21, 78, 63, 32, 45, 76, 28];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
char [] results = ['e', '3', '1', 'a', '1', '1', 'w', '1', '1', 'a'];
string [] param0 = ["geeekk", "3786868", "110", "aaaabbcbbb", "11", "011101", "wohnyjylc", "3141711779", "10111101101", "aabbabababcc"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [5, 13, 144, 1597, 17711, 196418, 2178309, 24157817, 267914296, 433494437, 1134903170];
int [] param0 = [3, 5, 10, 15, 20, 25, 30, 35, 40, 41, 43];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
C_PROGRAM_FACTORIAL_NUMBER_2 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600];
int [] param0 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
TRIANGULAR_NUMBERS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, false, false, false, false, false, false, true, false];
int [] param0 = [97, 97, 32, 40, 18, 14, 90, 39, 1, 57];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [-1, 2, -1, -1, -1, -1, -1, 10, 0, -1];
string [] param0 = ["ci", "76478", "1", "tr", "10", "01", "rmhzp", "5784080133917", "1100", "ok"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
double [] results = [65.91176470588235, 48.0, 20.43243243243243, 30.72340425531915, 45.555555555555564, 11.375, 40.949999999999996, 19.027027027027028, 88.36363636363636, 23.823529411764707];
int [] param0 = [54, 42, 63, 19, 41, 7, 39, 11, 96, 15];
int [] param1 = [83, 56, 12, 76, 50, 26, 42, 64, 81, 54];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 1, 0, 0, 0, 1, 0, 1, 1, 1];
long [] param0 = [79, 61, 39, 39, 61, 86, 7, 86, 86, 11];
long [] param1 = [84, 29, 77, 65, 78, 73, 92, 50, 63, 2];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FINDING_POWER_PRIME_NUMBER_P_N_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 0, 0, 0, 0, 13, 3, 0, 1, 2];
int [] param0 = [76, 77, 9, 59, 8, 97, 78, 41, 72, 71];
int [] param1 = [43, 91, 42, 67, 52, 8, 24, 88, 61, 28];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 0, 1, 0, 1, 0, 0, 0, 0, 0];
int [] [] param0 = [[5, 5, 5, 10, 20], [5, 5, 5, 20, 10], [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10], [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 18], [5, 5, 20], [10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [5, 10, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [-82, -10, -78, -84, 68, 62, 10, 20, -86, -98, 92, 70, 40, -12, -20, -36, 8, -70, 6, 8, 44, -24, 8, -18, 76, -54, -14, -94, -68, -62, -24, -36, -74, 92, 92, -80, 48, 56, 94], [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [46, 46, 93, 57, 82, 34, 83, 80, 77, 36, 80, 85, 69, 28, 9, 56, 49, 27, 83, 25, 1, 80, 99, 14, 69, 82, 79, 71, 74, 34]];
int [] param1 = [4, 5, 27, 12, 2, 17, 7, 31, 25, 20];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
GCD_ELEMENTS_GIVEN_RANGE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [57, 22, 17, 74, 1, 1, 1, 1, 1, 1];
int [] param0 = [57, 22, 17, 74, 93, 56, 5, 5, 9, 98];
int [] param1 = [57, 22, 17, 74, 22, 54, 33, 68, 75, 21];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, true, false, true, false, true, true, true, false, false];
int [] param0 = [67, 90, 55, 90, 83, 32, 58, 38, 87, 87];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MINIMUM_PERIMETER_N_BLOCKS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [28, 36, 30, 28, 38, 34, 24, 18, 34, 34];
int [] param0 = [45, 80, 54, 48, 83, 68, 32, 20, 68, 66];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 1, 2, 2, 1, 2, 2, 1, 1, 3];
int [] [] param0 = [[3, 5, 9, 24, 28, 31, 49, 54, 67, 85, 86, 94, 97, 97], [-34, 16, -80, -10, 80, 2, 50, -74, -76, 36, -84, -24, 74, -54, -22, 46, 80, 58, -8, 70, 24, -88, 52, 62, 30, 42, 48, 16, 78, -82, 64, -36, 84, -72], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [49, 61, 68, 4, 90, 89, 71, 74, 45, 61, 35, 41, 59], [-42, -8, 28, 56, 80, 96], [1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1], [3, 4, 6, 6, 13, 27, 27, 29, 32, 36, 46, 50, 52, 65, 69, 70, 71, 83, 87, 91], [64, -76, 28, 6, 56, 18, 32, -50, -20, 18, -26, -90, 32, 50, -18, 98, 84, 40, 50, 88, -70, -6, -24, -44, -96, -58, 48, -78, -14], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [50, 48, 61, 87, 7, 78, 93, 44, 16, 88, 98, 15, 73, 93, 43, 46, 42, 34, 1, 35, 79, 35, 84, 60, 18, 79, 17, 4, 78, 1, 20, 64]];
int [] param1 = [11, 29, 13, 11, 4, 17, 10, 15, 15, 25];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
LONGEST_SUBARRAY_COUNT_1S_ONE_COUNT_0S | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 1, 1, 1, 3, 7, 1, 3, 3, 1];
int [] [] param0 = [[6, 10, 31, 35], [4, 88, -72, 28, -54, 32, -34], [0, 0, 0, 1, 1, 1, 1, 1, 1], [39, 22, 15, 10, 34, 87, 46, 83, 74, 77, 61, 90, 43, 67, 64, 72, 92, 52, 68, 53, 67, 32, 82, 76, 76, 47, 74, 47, 8, 80, 85, 58, 75], [-82, -58, -50, -30, -14, -4, -2, -2, 0, 22, 36, 58, 70, 80, 80, 82, 84, 90], [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1], [4, 11, 17, 21, 21, 22, 30, 31, 36, 37, 39, 40, 45, 46, 47, 48, 52, 53, 53, 60, 60, 65, 66, 66, 67, 67, 87, 88, 91, 97], [-4, -60, -78, -50, 64, 18, 0, 76, 12, 86, -22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 39, 50, 37, 71, 66, 55, 34, 1, 41, 34, 99, 69, 31]];
int [] param1 = [2, 6, 4, 26, 14, 7, 29, 7, 17, 11];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_CALCULATE_VOLUME_ELLIPSOID | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
float [] results = [522232.74089280004, -283737.6598056, 379381.2427776, -112115.51806000002, 1639671.7048656002, -1938016.9772600005, 306019.63709100004, -238081.08602880003, 192599.16093600003, -1561484.5209600003];
float [] param0 = [32.4, -37.4, 89.6, -26.0, 86.1, -73.3, 78.3, -65.6, 44.4, -72.8];
float [] param1 = [45.3, -66.3, 35.7, -10.7, 95.2, -65.0, 36.7, -14.2, 22.1, -80.0];
float [] param2 = [85.2, -27.4, 28.4, -96.5, 47.9, -97.4, 25.5, -61.2, 47.0, -64.2];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, true, false, false, false, false, false, false];
string [] param0 = ["amazon", "onamaz", "amazon", "ab", "737009", "000110", "l", "4420318628", "11011111000000", " pvfhanc"];
string [] param1 = ["azonam", "amazon", "azoman", "ab", "239119", "01111", "yvo hqvngxow", "52856", "10", "xbidfbigb"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_TRIPLET_SUM_ARRAY_2 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [265, -100000026, 3, 218, 52, 3, -99999966, 286, 2, 292];
int [] [] param0 = [[4, 7, 12, 21, 22, 25, 27, 28, 28, 31, 32, 32, 41, 45, 47, 51, 53, 60, 61, 61, 63, 71, 74, 82, 83, 85, 88, 92, 96, 96], [-52, 26, 74, -62, -76], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [63, 71, 15, 28, 31, 84, 8, 17, 24, 42, 66, 95, 30], [-94, -92, -92, -90, -88, -88, -86, -82, -80, -78, -66, -54, -52, -52, -46, -46, -42, -36, -32, -24, -24, -14, -14, -14, -12, -10, 0, 6, 8, 20, 24, 24, 28, 38, 38, 52, 54, 56, 64, 74, 74, 76, 82, 94, 94], [0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0], [15, 19, 80], [4, 80, 18, 74, 36, -30, -72, -28, -32, -16, -8, 38, 78, -48, 98, -64, 86, -60, -44, 84, -98, 40, 14, 30, 44, 90, -30, -42, 24, -28, 24, 40, -96, 98, 90, -68, -54, -52, 62, 34, -98, 68, -56, -94, -78, -12, 28], [0, 1, 1, 1, 1, 1], [2, 18, 96, 7, 99, 83, 3, 88, 23, 77, 6, 28, 55, 49, 69, 55, 48, 76, 43, 11, 43, 44, 17, 74, 27, 64, 76, 77, 53, 26, 73, 12, 19, 62, 18, 34, 13, 31, 97, 96, 85, 27, 30, 97, 89, 25]];
int [] param1 = [28, 2, 11, 6, 31, 30, 2, 41, 3, 41];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 0, 0, 0, 0, 4, 0, 0, 0];
int [] [] param0 = [[4, 13, 13, 16, 16, 19, 39, 41, 48, 52, 57, 62, 65, 67, 76, 84, 88, 91, 95, 96, 97, 98], [62, 76, 86, -8, 84, -6, 72, 84, 6, -50, -18, -94, 54, 90, -74, -64, -26, -14, -32, 62, 10, 4, 70, -28, 8, 18, 4, -62, -76, 84, -78, -4, 84, 98, 58, -68, 42, -6, 34, -38, 52, -84, 78], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [11, 75, 98, 29, 62, 53, 48, 91, 86, 66, 48, 94], [-94, -84, -70, -70, -40, -40, -36, -24, 10, 48, 62, 74], [1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0], [1, 2, 6, 7, 10, 11, 13, 19, 19, 25, 29, 30, 32, 34, 35, 45, 45, 46, 47, 48, 48, 53, 58, 61, 64, 65, 67, 75, 76, 81, 81, 84, 84, 85, 86, 94, 94, 96, 99], [-56, 42, -34, -12, -86, 82, -96, -66, 30, 16, -40, 72, 84, 94, -48, -30, 26, 50, 42, -44, -50, 22, -38, 8, 34, 94, 2, 16, -32, 18, -58, 12, -26, 28, -62], [0, 0, 0, 0, 1, 1, 1], [6, 29]];
int [] param1 = [18, 32, 10, 8, 11, 36, 25, 21, 4, 1];
int [] param2 = [12, 38, 6, 6, 7, 40, 19, 30, 5, 1];
int [] param3 = [17, 23, 6, 6, 8, 37, 37, 26, 5, 1];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 3, 3, 0, 0, 0, 0, 0, 0, 0];
string [] param0 = ["1001ab010abc01001", "1001010001", "010100010100", "dlcu", "7072430592", "011", "pnjpypyoza", "1037", "111", "hxk"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2016, 1035, 741, 3403, 120, 231, 3003, 2701, 4753, 1431];
int [] param0 = [62, 44, 37, 81, 14, 20, 76, 72, 96, 52];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [10, 6, 0, 2, 6, 1, 8, 4, 2, 4];
string [] param0 = ["yygwgyrovdsh", "56109778", "101", "rxm", "187546405", "0110010", "wvodamgvi", "56719", "10100011001100", "wtpai"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 1, 9, 0, 1, 2, 1, 0, 24, 1];
int [] [] param0 = [[4, 7, 10, 12, 12, 24, 29, 38, 45, 51, 53, 54, 59, 68, 72, 73, 85, 86, 88, 92, 92, 95], [-6, 48, -70, 14, -86, 56, 80, -64, 64, -88, -14, 78, 14, -18, 52, 2, 22, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [10, 93, 2, 16, 36, 49, 36, 86, 6, 99, 95, 2], [-98, -96, -80, -64, -42, -30, -6, 10, 62, 66, 82], [1, 1, 0, 1, 1], [7, 11, 13, 15, 21, 33, 36, 39, 66, 99], [-40], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [79, 91, 31, 16, 28, 45, 37, 43, 73, 73, 76, 28, 71, 60, 64, 60, 99, 36, 47, 38, 65, 34, 22, 94, 84, 51, 72, 45, 71, 2]];
int [] [] param1 = [[7, 9, 17, 23, 25, 26, 29, 32, 35, 56, 56, 58, 59, 59, 62, 63, 72, 82, 85, 86, 95, 97], [-62, -58, 60, -30, 42, 8, 66, -48, -18, 64, -76, -90, -48, -90, -24, 64, -88, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [99, 28, 7, 21, 62, 89, 82, 41, 43, 77, 8, 14], [-62, -50, -42, 24, 44, 46, 52, 54, 60, 72, 72], [1, 1, 1, 0, 0], [23, 36, 42, 44, 62, 65, 70, 78, 82, 89], [-98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 94, 12, 27, 98, 38, 75, 20, 94, 43, 32, 90, 23, 41, 88, 2, 62, 96, 53, 57, 48, 79, 6, 16, 11, 46, 73, 57, 67, 7]];
int [] param2 = [15, 15, 10, 6, 9, 4, 9, 0, 31, 18];
int [] param3 = [13, 9, 10, 10, 6, 2, 9, 0, 26, 18];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 11, 6, 5, 1, 13, 1, 8, 26, 3];
int [] [] param0 = [[8, 24, 28, 64, 75, 86, 93, 95], [2, -30, -8, -78, 58, -42, -94, 84, -58, 14, 78, 34, 30, 6, -18, -92, 0, 94, -54, 58, 0, -86, 66, 86, 8, -26, 50, 16, -30, -68, 98, -28, -4, -6], [0, 0, 0, 0, 0, 0, 1], [51, 5, 48, 61, 71, 2, 4, 35, 50, 76, 59, 64, 81, 5, 21, 95], [-64, -52, 44, 52, 90], [0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1], [2, 15, 25, 55, 72, 96, 98], [-60, 30, -58, 52, 40, 74, 74, 76, -72, -48, 8, -56, -24, -40, -98, -76, -56, -20, 30, -30, -34, 4, -34], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [37, 84, 20, 34, 56, 1, 87, 72]];
int [] [] param1 = [[19, 30, 41, 51, 62, 68, 85, 96], [40, 22, -24, 80, -76, -4, -8, -34, 96, -98, 16, 28, 14, 52, 10, -10, -62, 64, -48, 10, -64, -90, -52, 46, 34, 50, 50, -84, 68, -12, -44, 28, -22, 78], [0, 0, 0, 0, 0, 1, 1], [67, 84, 86, 43, 50, 90, 49, 8, 40, 67, 5, 51, 40, 28, 31, 47], [-62, -16, 22, 26, 58], [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], [3, 6, 11, 19, 26, 37, 39], [-96, -40, -76, 52, -20, -28, -64, -72, 36, 56, 52, 34, 14, 8, -50, 6, -82, -98, -8, 18, -76, -66, -22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [68, 62, 84, 54, 15, 29, 70, 96]];
int [] param2 = [8, 34, 7, 16, 5, 30, 7, 23, 42, 8];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SQUARE_ROOT_OF_A_PERFECT_SQUARE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
float [] results = [41.99589376968351, -3544.737136289062, 88.84373605423394, -3008.0331952533734, 78.45502015008492, -5799.751467314729, 90.74222584648552, -1829.5367705266551, 76.01465104349802, -7785.473710863676];
float [] param0 = [1763.655093333857, -3544.737136289062, 7893.209433000695, -3008.0331952533734, 6155.190186637041, -5799.751467314729, 8234.151546380555, -1829.5367705266551, 5778.227173218819, -7785.473710863676];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_CHECK_PLUS_PERFECT_NUMBER | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, false, false, false, false, false, false, false];
int [] param0 = [371, 9474, 85, 35, 54, 17, 97, 63, 12, 43];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [56, 56, 51, 54, 70, 57, 80, 54, 70, 5];
int [] param0 = [56, 56, 36, 71, 3, 84, 30, 82, 90, 38];
int [] param1 = [5, 60, 56, 54, 70, 57, 80, 54, 70, 4];
int [] param2 = [82, 17, 51, 6, 81, 47, 85, 32, 55, 5];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIBONACCI_MODULO_P | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [36, 30, 18, 8, 6, 24, 60, 100, 70, 20];
int [] param0 = [51, 40, 68, 7, 8, 32, 93, 75, 71, 15];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [31, 7, 2047, 15, 255, 8191, 63, 7, 65535, 511];
int [] param0 = [5, 3, 11, 4, 8, 13, 6, 3, 16, 9];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, true, true, false, false, false, false, false];
int [] [] param0 = [[2, 3, 1, 1, 1], [2, 2, 1, 1, 2], [2, 2, 1, 1, 1], [0, 0, 0, 3, 3, 4], [-10, 12, 2], [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], [1, 6, 10, 13, 15, 17, 18, 23, 26, 28, 30, 32, 32, 33, 36, 39, 39, 41, 43, 50, 50, 51, 53, 54, 59, 59, 63, 63, 63, 66, 66, 71, 71, 74, 78, 89, 89, 93], [66, -96, -14, 74, -20], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90]];
int [] param1 = [5, 5, 5, 6, 3, 19, 30, 4, 31, 10];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1578, -338, 25, 0, 596, 24, 1866, 406, 20, 1153];
int [] [] param0 = [[2, 10, 11, 11, 12, 14, 15, 17, 27, 27, 28, 36, 36, 44, 47, 47, 54, 55, 62, 64, 68, 69, 70, 70, 75, 76, 78, 85, 85, 91, 95, 97], [-98, -92, -86, -84, -72, -70, -70, -66, -62, -50, -44, -40, -36, -34, -30, -14, -12, -8, -4, -2, 2, 2, 10, 10, 30, 30, 36, 40, 58, 78, 78, 82, 88, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 77, 78], [-88, -88, -88, -82, -58, -54, -48, -46, -46, -44, -20, -2, 10, 28, 28, 28, 42, 42, 44, 50, 50, 54, 56, 58, 62, 68, 70, 72, 74, 76, 78, 88, 90, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 7, 10, 11, 15, 17, 20, 20, 29, 29, 32, 37, 38, 39, 40, 41, 45, 51, 60, 64, 64, 68, 68, 70, 71, 71, 71, 75, 76, 82, 84, 87, 88, 88, 95, 98], [-98, -88, -74, -66, -60, -52, -46, -40, -36, -34, -32, -28, -28, -24, -22, -20, -16, -14, -4, -4, 4, 12, 18, 28, 32, 44, 52, 56, 60, 60, 64, 70, 74, 76, 76, 86, 94, 94, 94, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 2, 9, 9, 13, 14, 14, 15, 20, 22, 25, 25, 36, 39, 46, 47, 61, 63, 66, 73, 79, 91, 94, 95, 95, 99]];
int [] param1 = [32, 34, 48, 3, 34, 43, 36, 40, 45, 27];
int [] param2 = [18, 25, 26, 1, 24, 40, 21, 23, 41, 23];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_THE_FIRST_MISSING_NUMBER | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [19, 19, 26, 20, 8, 24, 0, 32, 28, 0];
int [] [] param0 = [[3, 6, 7, 9, 11, 14, 18, 30, 30, 32, 32, 34, 37, 44, 45, 45, 48, 48, 48, 52, 58, 60, 63, 67, 69, 69, 81, 83, 87, 89, 97, 99], [88, -62, 16, 80, 66, 78, 88, 38, 52, -96, 48, 98, 96, -62, 18, 34, -58, 30, -10, 26, -98, 48, -96, 4, 92, 36, 36, -36, -32, -70, 62, -58, -58, -84, 86, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [79, 99, 79, 85, 61, 58, 62, 61, 39, 87, 39, 74, 36, 70, 30, 43, 20, 52, 54, 50, 81, 98, 42], [-98, -72, -46, -44, -42, -40, -16, -4, 62, 70, 74], [1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], [58], [4, -84, -42, 12, -50, 42, -36, -38, -36, 98, -2, 20, 6, -96, -78, 24, 34, 88, 0, 74, 0, -8, -86, -68, -42, 98, -26, 86, -70, -32, -82, 78, 46, 58, 84, 4, -60, -90, -52, -78], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8]];
int [] param1 = [24, 19, 26, 20, 8, 26, 0, 37, 28, 0];
int [] param2 = [18, 26, 28, 20, 10, 23, 0, 31, 28, 0];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, true, true, false, true, false, true, false];
int [] [] param0 = [[2, 3, 4, 10, 11, 13, 17, 19, 23, 26, 28, 29, 30, 34, 35, 37, 38, 38, 43, 49, 49, 50, 52, 53, 55, 55, 57, 58, 58, 59, 64, 66, 67, 70, 72, 72, 75, 77, 77, 87, 89, 89, 90, 91, 98, 99, 99, 99], [56, -94, -26, -52, 58, -66, -52, -66, -94, 44, 38, -66, 70, -70, -80, -78, -72, -60, -76, 68, -50, 32, -16, 84, 74, -42, 98, -8, 72, 26, 24, 6, 24, 86, 86, 78, -92, 80, 32, -74, 26, 50, 92, 4, 2, -34, -2, -18, -10], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [38, 79, 76, 92, 92], [-42, -28, 2, 32, 50, 56, 86, 96, 98], [1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99], [-96, 96, -98, -42, -74, 40, 42, 50, -46, -52, 8, -46, 48, 88, -78, -72, -10, -20, 98, -40, -18, 36, 4, 46, 52, 28, -88, -28, -28, -86], [0, 0, 0, 0, 1, 1], [66, 12, 48, 82, 33, 77, 99, 98, 14, 92]];
int [] param1 = [46, 30, 13, 2, 7, 11, 9, 29, 3, 7];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, true, true, true, false, true, true, false, true];
int [] [] param0 = [[1, 1, 2, 3, 1], [2, 3, 3, 5, 3, 3], [0, 0, 1, 1, 1], [7, 60, 78, 91, 80, 75, 85, 21, 41, 63, 1, 84, 69, 13, 94, 25, 54, 54, 52, 68, 53, 35, 17, 37, 98, 27, 2, 31], [-96, -94, -82, -80, -78, -66, -36, -24, -18, -12, -2, -2, 6, 8, 10, 12, 36, 38, 42, 58, 64, 68, 82, 84, 86, 88, 94], [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0], [16, 19, 25, 25, 32, 37, 48, 59, 60, 60, 71, 74, 77, 81, 91, 94], [-62, -94, 72, -22, 86, -80, 64, 98, -82, -50, 12, -4, 56, 46, -80, 2, -86, -44, -26, 68, -94, -82, 74, 26, 94, 40, 50, -40, -42, -10], [0, 0, 0, 0, 0, 1, 1, 1], [83, 57, 2, 47, 70, 22, 49, 51, 25, 57, 32, 7, 8, 99, 6, 86, 24, 79, 42, 43, 1, 24, 68, 11, 24, 12, 43, 40, 14, 45, 11, 46, 12, 80, 66]];
int [] param1 = [5, 6, 2, 24, 24, 34, 10, 20, 5, 21];
int [] param2 = [2, 2, 1, 2, 3, 2, 8, 4, 2, 33];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
K_TH_ELEMENT_TWO_SORTED_ARRAYS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [31, 20, 0, 71, -22, 0, 30, 86, 1, 70];
int [] [] param0 = [[2, 2, 4, 4, 9, 10, 14, 16, 16, 19, 20, 21, 25, 26, 29, 36, 36, 37, 38, 44, 44, 49, 53, 54, 56, 61, 62, 64, 72, 72, 73, 77, 80, 84, 84, 87, 93, 94], [2, 4, -90, 62, 22, -94, -74, -22, 44, -94, 20, -40, 20, 0, 32, 24, 78, 8, 4, 98, -74, -60], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [85, 44, 62, 2, 71, 88, 60, 78, 32, 46, 17, 47, 65, 78, 65, 94], [-94, -84, -82, -70, -70, -60, -54, -54, -52, -52, -46, -40, -40, -36, -34, -32, -30, -22, -18, -16, -10, -4, 8, 12, 18, 22, 32, 38, 38, 44, 50, 56, 64, 82, 84, 86, 88], [0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [53, 96, 99], [98, 86, 36, -68, 86, 22, 52, -20, -2, 74, -72, 86, 80, -78, 14, 62, 10, 94, -66, 78, 28, 92, -8, 46, -24, 66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [6, 21, 86, 58, 48, 27, 18, 73, 16, 79, 51, 33, 63, 26, 37, 88, 48, 58, 44, 32, 58, 23, 31]];
int [] [] param1 = [[6, 8, 10, 10, 12, 14, 24, 31, 33, 33, 35, 35, 35, 41, 46, 47, 49, 51, 52, 56, 57, 59, 62, 65, 72, 72, 73, 73, 79, 80, 82, 83, 83, 84, 87, 87, 93, 99], [58, 74, -46, 38, -58, -78, -32, -84, 84, -54, 84, -34, -26, 88, 74, 48, 26, -92, 68, -86, 74, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [18, 3, 15, 9, 61, 73, 3, 62, 87, 1, 54, 97, 61, 37, 23, 65], [-92, -68, -64, -62, -54, -52, -52, -34, -24, -22, -20, -12, -12, -10, 6, 10, 14, 22, 22, 24, 24, 30, 30, 36, 36, 48, 50, 56, 58, 64, 68, 80, 84, 88, 88, 92, 94], [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0], [30, 55, 56], [72, -72, -90, 24, -22, 60, 78, -68, 98, 26, -30, -20, 44, -96, 8, 90, 0, 98, -24, -68, -32, -62, 0, -60, 26, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [87, 77, 44, 15, 70, 89, 36, 79, 82, 3, 18, 76, 37, 79, 85, 97, 19, 53, 17, 74, 87, 58, 49]];
int [] param2 = [27, 18, 30, 11, 19, 24, 1, 22, 42, 14];
int [] param3 = [21, 11, 31, 11, 26, 17, 1, 19, 40, 22];
int [] param4 = [23, 12, 42, 13, 28, 23, 1, 24, 42, 19];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
DIVISIBILITY_BY_7 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, true, true, true, false, false, false, false, false];
int [] param0 = [0, -21, 7, 63, 84, 73, 81, -10, 47, 23];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [34, 832, 0, 212, 58, 13, 47, 372, 3, 1000];
int [] [] [] param0 = [[[6, 10, 23, 28, 35, 55, 91], [11, 14, 15, 54, 55, 62, 81], [18, 26, 40, 43, 47, 89, 93], [3, 11, 19, 53, 65, 82, 92], [14, 32, 43, 44, 51, 77, 83], [6, 6, 30, 30, 33, 73, 74], [2, 2, 10, 61, 70, 81, 84]], [[-28, -20, -60, 92, 12, -66, 20, -22, 72, -90, 30, 90, -64, 38, 24, 78, 42, -72, -86, 88, -66, -74, -52, 26, -76, -64, -54, -56, -50, -12, -50, -58, -42, 20], [-84, -90, 32, 4, -54, -96, 72, 70, -2, 62, -20, 22, -38, 78, -86, -50, 64, 92, 16, 22, 44, -72, -88, -54, 58, 72, -28, 34, -10, -12, -82, 38, -76, 86], [30, 94, 12, -58, 24, -58, 82, -96, -84, -76, -56, -2, -82, -12, -24, 86, -94, 72, 36, 86, 54, 76, -96, -94, -70, 76, 0, -48, -84, 6, -90, 44, -8, -22], [-36, 90, 20, 44, -66, -54, 54, 14, -12, 58, -10, 84, -4, 88, -70, -24, -84, -8, 58, -22, 2, -32, -28, -60, -74, -12, -10, -6, -58, -54, -8, -94, 72, 86], [-20, 88, 28, 76, 78, 52, 0, -60, 94, -22, -56, -8, 66, -36, -48, -12, 42, -84, 22, -78, 18, -68, 46, 36, 50, -80, 18, 6, 86, -18, -90, -94, 54, 60], [44, -44, -52, -24, 32, 24, -88, -62, -64, 24, -24, 76, -22, -60, 76, 12, 10, -96, -68, 98, -86, 20, -40, -30, -22, -14, -68, -68, -52, -72, -68, -36, 4, 42], [78, 74, -96, 46, -36, -14, 72, -64, -16, 26, 74, -82, 82, 96, -82, 70, -66, -90, -72, 64, -52, 46, -38, 70, 98, 26, -48, -66, -92, -86, -94, -18, 90, -58], [20, 56, -12, 82, -24, -54, 48, 22, -58, -94, -4, -78, -74, -82, 58, 2, 32, 76, 54, 76, -54, -32, 34, 56, -48, 22, 30, 86, -76, -90, 20, 2, 4, 10], [42, 98, 42, -6, 78, 92, -44, -14, 80, 14, 48, 94, 46, -30, 40, -64, 36, 66, 40, 94, 36, 94, -2, -92, 70, -44, 28, -86, 44, 98, -76, 66, -16, -24], [-64, -44, 28, -24, 92, 18, 88, -36, 72, 0, 38, 42, 46, -94, 10, -62, -64, -40, 4, 44, -42, -66, -62, 12, -72, -68, 26, 58, -64, 90, -20, -74, 46, 28], [-2, 42, 94, -52, -46, -14, -80, -74, 22, -56, 8, -88, 0, -58, 82, -12, 96, 40, -86, -30, 88, 50, 28, -40, 16, 16, -58, -18, -78, 40, 66, -6, -50, -36], [-46, -8, -76, -74, 38, -76, -2, 80, -30, -64, 64, 34, 80, -14, -4, 58, -48, 30, 56, 2, 98, -82, 82, -36, 38, 14, 24, 92, -38, 40, 6, 12, 90, 90], [-12, 24, 20, -22, -86, 4, 48, 90, -10, -90, -36, 56, -18, -72, -84, 68, -18, 48, -80, -84, 62, 4, 4, 54, -26, -28, -58, -12, -6, 32, 88, -62, 58, -52], [54, 76, 2, -98, -64, 64, 2, -22, 18, -78, -44, -78, 6, 92, -32, 14, -98, -70, -52, -20, 14, 32, 40, 32, 62, 42, 34, -52, 2, 52, 64, 12, 44, -12], [22, -48, 30, -98, -94, 36, 76, 52, 56, 76, -40, -34, -58, -70, 26, 20, -6, 92, 90, 30, 2, -34, 96, 50, 96, -82, -38, -42, 54, -80, -82, -10, -94, 64], [-46, -36, -84, 54, -64, -48, 60, 70, 78, 20, -92, -34, 88, -38, -34, 40, -70, 58, -22, -38, 46, -36, 28, -24, -16, 70, 6, -76, -30, 58, 4, 84, 92, 80], [24, 48, -54, -98, 60, 18, 70, -6, 62, -60, 80, -66, 78, -50, 36, 84, 30, 56, -56, 56, -70, 38, -70, 26, -6, -32, 86, 72, -68, 42, 30, 2, -86, 72], [-84, -98, 74, -36, 78, -10, -84, 26, 76, 38, -6, -26, 76, 26, 18, 44, -96, 92, 74, -36, 34, 64, 98, 84, 68, -56, -98, -16, 44, -84, 68, -66, 58, -4], [72, -68, 94, 76, -60, -40, -34, 78, -8, -28, 44, 88, 60, -20, 58, -46, -10, 48, -52, -38, -62, 12, 30, -96, -22, -76, -40, -20, -74, 78, 94, 78, -64, 44], [92, -76, 8, 8, 66, 70, -12, 32, 6, 28, 20, 50, 2, 78, -98, 98, 94, 82, -58, 56, 10, -94, 26, 26, -42, -66, 16, -92, 24, 72, 56, 56, 14, 46], [32, -90, -64, -14, 92, -18, -82, 36, 34, -58, -22, -8, 88, 76, 30, -68, -44, 88, 66, 74, -32, -54, -68, -18, 92, 60, -30, 82, 34, 26, -60, 82, 32, 54], [-88, 56, 76, 82, -82, 0, 74, 98, 28, 2, -26, 56, 80, 44, -10, -38, 44, -28, 88, 18, -68, 6, 90, -38, -30, -26, 56, 24, -22, 12, 78, 30, 26, -42], [84, 86, 48, -84, 88, -40, -18, 40, -70, 10, 76, 54, -82, -60, -28, -2, -74, 82, -64, 14, -84, -16, -84, 20, 16, -52, -12, 26, 82, 2, 68, 98, -84, 76], [-20, 52, -34, 56, -58, -34, 10, 30, 14, 40, -72, 84, -50, -22, -54, -14, 12, -66, -38, 4, -44, -86, -64, 60, -88, 32, -60, 74, -96, -50, -88, -14, -42, -82], [46, -72, -10, -70, -8, 60, -10, 28, -12, -82, 84, 36, -76, 72, -98, -12, -20, -92, -16, -34, 68, 98, -96, -80, 44, -72, 22, -46, 54, 54, 8, -42, -84, 76], [38, 84, 32, 70, 82, 44, 52, 48, 0, 42, -18, -80, 86, -50, -48, -48, 40, 72, -76, 16, 42, -48, -74, 64, 38, -38, -66, -70, 96, -56, 38, -68, -34, -18], [-92, 94, 84, 50, 26, 38, -16, -18, -86, -52, -12, 36, -76, 10, -92, 78, -94, 62, -48, 18, -82, -8, -74, -90, 6, 22, -90, 52, 84, 48, -98, -30, -44, 2], [32, -54, 38, -34, 90, 58, 30, 86, -52, -82, 26, -30, 22, -68, 44, 44, -54, 24, -12, 18, 62, 82, 86, 26, -78, 74, 36, 62, 50, -84, 80, -2, 44, -84], [42, -32, -36, 54, 64, 54, 88, 30, 26, 6, 98, 34, -40, 18, -50, -34, -68, -2, -94, -42, -72, 38, 22, 62, -42, -58, -88, -52, -44, 14, 14, 62, -56, -52], [-64, -44, 14, 48, -98, -48, 80, -34, 10, 46, -64, 38, 72, -80, -72, 52, 92, -22, -28, 2, 0, -70, 18, -34, 60, 36, 8, 2, -94, 80, -32, -16, -82, -72], [94, -90, 84, -34, 62, 70, -86, -20, -30, 42, -84, 20, -16, 90, -90, 20, -90, 76, 72, -12, 54, 72, 80, 30, 62, 66, -96, 14, 0, 4, -78, -40, -8, 74], [-70, 20, 74, -76, 82, -88, 88, -90, -8, -24, -30, 10, 28, -88, -72, 4, 0, -66, -82, -20, 90, -28, 48, 82, -2, 4, 38, 62, -38, 14, 56, 74, 86, 58], [-6, 52, 94, 20, 88, -56, -40, -36, 68, -24, 68, -96, 90, 28, 0, 10, -44, -94, 18, -60, 98, 24, 26, -62, -88, 50, -10, 40, 64, 24, 56, -72, 30, 8], [62, 20, 56, -38, -10, 48, 94, 38, 60, -60, -4, -56, -20, 62, 0, 0, -82, 46, 58, 4, -8, 56, 46, -82, -34, 14, -38, 48, 48, -22, 38, 64, 6, 94]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[45, 7, 63, 28, 82, 79, 40, 94, 89, 61], [50, 94, 80, 10, 25, 12, 1, 73, 84, 38], [82, 93, 37, 59, 12, 37, 96, 12, 56, 39], [76, 56, 97, 56, 32, 33, 24, 31, 62, 94], [90, 2, 52, 81, 1, 52, 95, 93, 75, 4], [8, 47, 21, 75, 12, 90, 91, 34, 74, 73], [77, 76, 81, 68, 64, 28, 41, 84, 71, 72], [99, 93, 47, 15, 95, 76, 21, 48, 80, 39], [32, 6, 88, 96, 18, 56, 74, 93, 9, 13], [27, 8, 53, 66, 4, 74, 14, 25, 41, 78]], [[-90, -88, -58, -54, -26, -2, 6, 66], [-80, -78, -60, -4, -2, 58, 64, 68], [-98, -78, -22, -6, 28, 82, 86, 92], [-84, -4, 52, 64, 66, 84, 86, 98], [-62, 28, 32, 76, 92, 92, 96, 96], [-90, -54, -42, 6, 24, 42, 44, 46], [-94, -80, -36, -20, -20, -10, 24, 86], [-78, -8, 2, 48, 56, 66, 68, 78]], [[0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0], [1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0], [1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1], [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0], [1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0], [0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1], [1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0], [0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0], [1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0], [1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1], [0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0], [1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1], [1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1], [0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1], [1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0], [1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0], [1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1], [1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1], [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0], [0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1]], [[13, 31, 35, 45, 73], [16, 47, 54, 84, 87], [8, 48, 50, 64, 81], [19, 43, 79, 88, 91], [38, 47, 53, 57, 69]], [[-70, -46, 18, -10, -88, -22, -68, 2, -42, 94, 64, -98, -74, -88, -60, 96, 64, 42, -26, 60, 56, 56, -92, -72, 30], [12, -34, 44, 82, 94, 88, -60, -88, -98, -82, 10, -36, 94, -64, -26, 26, -62, 94, -90, 12, -76, 30, 40, 62, -84], [-90, 98, -44, 58, 20, 84, 76, 80, 44, 98, 60, 42, -66, 2, 10, 98, 28, -38, 18, 42, 2, 34, -64, -46, 62], [-36, 50, 52, -8, -28, 52, -76, 18, 68, -16, 34, -38, -90, 68, -6, -16, -98, 12, -78, -18, -28, -38, 26, 76, 26], [-70, 14, -96, -42, 18, -18, 72, -18, -78, 90, 68, -22, 58, 98, 62, -92, -38, 86, -40, 22, 38, 86, -60, 46, -72], [-12, -64, -2, 62, 62, 16, 40, -58, 8, -16, -80, 84, -10, 10, -58, 30, -18, 36, 4, -88, -50, 30, -30, -94, -20], [28, 76, 74, 80, 38, -32, 4, 56, -52, -24, 94, 6, 12, -66, 94, -70, 98, -72, 22, 30, -8, -72, -26, 52, 98], [-36, -96, 94, -64, -68, 78, 80, -90, -68, 60, -78, -84, 34, 6, 20, 60, -86, 84, -96, 98, -38, -78, 50, 30, 22], [14, 88, 88, -34, -76, 48, 10, -14, 36, 94, 90, 90, -90, 26, 70, -64, 64, -92, 0, -60, 6, -60, 8, -44, 54], [-30, -64, -34, -26, -82, -48, -98, -50, 76, -40, -16, 52, -70, 68, 82, 86, 32, -70, 98, -80, 14, -48, -32, -84, 16], [30, -70, 36, 34, -16, -96, -62, -62, -8, 66, 68, -2, 16, -26, 32, -50, 72, -32, 72, 52, -22, -76, -4, 90, 20], [92, -72, -48, 84, -98, -80, 74, -30, 58, 6, -10, -84, -96, -60, -18, -42, 26, -96, -20, -18, -12, 2, 58, 6, 36], [-74, -44, -20, -58, 58, 24, -34, 6, 52, -40, 36, -22, -78, 82, 64, 56, -70, -2, -32, 74, 98, 38, 30, 80, -80], [58, 92, -16, 76, -28, -10, 60, -80, 96, -72, 38, -64, 8, -84, 90, 20, 64, -74, -78, -94, -68, 44, 62, 14, -74], [-2, -30, -10, -84, 66, -16, 58, 26, 42, -98, 18, 54, 22, -2, -62, 10, 14, 26, 32, -56, -84, -14, -50, -48, 52], [-94, -58, 38, -76, -46, -98, -14, 34, 8, 8, 4, 26, 48, -74, -62, 90, 54, 88, 56, 16, -36, -2, -72, -8, 84], [22, -60, -50, 50, 22, -46, -42, 38, 74, -2, -66, -94, 38, 12, 8, -84, 10, 94, 56, -16, -38, -84, 30, -90, -90], [-32, -98, 24, -80, -24, 56, -84, -50, 86, 0, 22, -26, 70, -38, -16, -52, 70, 34, 92, 24, -88, 42, 2, -70, -32], [28, -8, 52, 64, -50, -24, 24, 32, 70, -54, -34, 24, -46, 22, -42, -6, -24, 62, 44, 22, -58, -54, 16, 4, -64], [-12, 44, 4, 24, 76, -82, 86, 50, -10, -28, 44, 36, -8, 76, -2, -96, 52, 52, -48, 66, 80, 76, 26, -16, 20], [18, -50, -68, 30, -36, -4, 14, -52, -32, 0, 68, 74, 84, 4, 64, 92, 24, 12, -8, -22, -22, 14, -44, -26, 80], [82, 26, -46, -10, 62, -70, -74, 72, -14, 98, 8, -54, 30, 26, 44, 38, -22, 24, 98, 8, 56, -96, -94, -62, 48], [32, -10, -72, 66, -86, -94, -98, 4, 22, -54, -74, 22, -24, -12, -80, 98, -38, -34, -52, -74, 96, -62, 68, 24, 34], [66, -6, -38, -62, -16, 82, -78, -20, 50, 62, 96, 46, -22, 74, -84, 54, -32, -16, 62, -4, -70, -38, -6, -4, -94], [-10, 0, -30, -28, 38, -48, 80, 4, -52, -88, 42, 4, -44, -10, 56, -22, 70, -78, 52, 0, -32, -30, 42, -54, -98]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[65, 68, 77, 53, 21, 82, 84, 4, 96, 27, 89, 71, 45, 94, 87, 29, 57, 21, 97, 82, 27, 78, 40, 31, 8, 67, 35, 75, 98, 87, 69, 30, 37, 16, 14], [71, 97, 2, 46, 5, 45, 45, 60, 15, 42, 2, 88, 29, 93, 85, 25, 22, 83, 62, 13, 62, 38, 57, 33, 33, 56, 12, 87, 93, 29, 43, 60, 65, 24, 69], [57, 35, 45, 69, 13, 32, 55, 27, 88, 3, 1, 63, 93, 45, 86, 69, 43, 85, 12, 92, 75, 15, 38, 62, 35, 16, 64, 15, 96, 64, 58, 80, 97, 40, 57], [20, 37, 32, 74, 16, 5, 20, 56, 91, 43, 60, 50, 59, 84, 13, 19, 79, 38, 27, 81, 74, 36, 5, 51, 48, 27, 59, 54, 28, 68, 71, 8, 15, 29, 73], [20, 65, 7, 34, 10, 48, 70, 25, 76, 41, 78, 11, 12, 83, 42, 92, 53, 83, 29, 45, 99, 23, 60, 80, 60, 21, 59, 40, 1, 25, 16, 33, 89, 22, 67], [67, 75, 43, 52, 63, 5, 25, 38, 53, 16, 96, 93, 70, 86, 73, 10, 55, 14, 84, 69, 71, 54, 56, 78, 57, 15, 81, 84, 16, 21, 75, 68, 25, 66, 66], [91, 95, 47, 72, 72, 5, 22, 69, 40, 48, 70, 38, 71, 18, 25, 67, 89, 21, 95, 49, 42, 80, 52, 64, 86, 93, 76, 46, 43, 63, 1, 26, 74, 25, 89], [4, 82, 60, 43, 72, 7, 17, 6, 42, 44, 21, 2, 13, 32, 77, 29, 5, 90, 96, 82, 17, 84, 15, 60, 79, 68, 73, 44, 33, 10, 47, 1, 40, 73, 22], [26, 35, 33, 10, 61, 38, 19, 68, 83, 7, 12, 91, 32, 27, 57, 85, 54, 69, 83, 7, 78, 73, 37, 50, 9, 5, 54, 48, 9, 52, 30, 78, 60, 3, 52], [24, 28, 39, 55, 75, 81, 82, 81, 25, 14, 85, 11, 47, 27, 4, 51, 34, 40, 71, 18, 19, 82, 15, 75, 12, 35, 36, 12, 16, 92, 44, 44, 36, 59, 30], [16, 80, 84, 9, 46, 5, 95, 18, 44, 86, 39, 66, 58, 67, 47, 92, 75, 74, 84, 95, 53, 51, 45, 48, 22, 82, 12, 79, 55, 98, 45, 92, 63, 64, 44], [15, 99, 17, 75, 61, 26, 29, 89, 4, 27, 42, 86, 24, 19, 41, 91, 83, 13, 95, 66, 91, 64, 72, 12, 29, 29, 86, 30, 73, 69, 13, 2, 33, 4, 56], [74, 57, 97, 2, 63, 12, 16, 60, 99, 56, 73, 3, 92, 52, 16, 83, 75, 46, 31, 1, 55, 30, 85, 79, 16, 68, 88, 40, 87, 17, 99, 26, 35, 79, 15], [27, 72, 15, 72, 4, 65, 25, 99, 8, 49, 17, 28, 70, 6, 55, 1, 67, 52, 73, 79, 40, 84, 16, 74, 78, 16, 15, 41, 90, 10, 60, 12, 37, 14, 25], [94, 53, 30, 59, 63, 99, 79, 95, 18, 71, 67, 5, 89, 16, 79, 84, 41, 60, 86, 35, 27, 12, 33, 24, 26, 98, 13, 92, 20, 72, 50, 80, 34, 96, 30], [99, 16, 48, 9, 54, 31, 19, 34, 62, 80, 88, 16, 79, 31, 52, 56, 71, 44, 15, 66, 86, 24, 89, 61, 12, 14, 34, 20, 63, 78, 82, 35, 63, 81, 48], [45, 87, 86, 49, 31, 29, 25, 96, 95, 6, 37, 17, 31, 58, 21, 2, 7, 91, 22, 4, 91, 45, 96, 85, 99, 73, 92, 10, 87, 24, 57, 4, 81, 48, 88], [58, 1, 66, 40, 48, 53, 6, 14, 62, 36, 21, 25, 54, 72, 27, 78, 4, 8, 91, 83, 94, 92, 91, 61, 37, 44, 3, 49, 28, 83, 91, 87, 83, 57, 13], [94, 41, 72, 29, 43, 50, 50, 47, 70, 56, 17, 29, 56, 52, 48, 2, 33, 59, 39, 55, 35, 31, 76, 31, 26, 96, 49, 60, 50, 60, 3, 20, 56, 47, 2], [63, 77, 93, 63, 51, 70, 42, 8, 26, 54, 74, 38, 56, 65, 66, 43, 64, 35, 65, 68, 3, 88, 55, 81, 27, 25, 59, 84, 39, 54, 51, 30, 70, 71, 27], [5, 26, 36, 11, 56, 23, 3, 79, 58, 44, 89, 80, 96, 26, 69, 10, 75, 97, 92, 57, 80, 44, 2, 29, 2, 86, 75, 35, 96, 64, 5, 91, 51, 76, 8], [3, 96, 22, 63, 28, 90, 45, 21, 75, 27, 7, 73, 47, 48, 98, 43, 26, 70, 76, 37, 50, 44, 1, 35, 68, 40, 50, 72, 66, 12, 72, 41, 60, 31, 85], [95, 32, 20, 83, 47, 94, 73, 84, 18, 77, 60, 30, 29, 52, 51, 30, 69, 68, 50, 59, 31, 42, 33, 65, 19, 15, 66, 68, 3, 87, 60, 43, 53, 70, 94], [23, 49, 15, 47, 81, 9, 66, 50, 53, 93, 42, 46, 95, 96, 58, 1, 94, 92, 90, 82, 1, 41, 48, 83, 99, 33, 72, 91, 42, 8, 58, 96, 83, 30, 60], [10, 64, 36, 16, 3, 86, 86, 85, 94, 27, 66, 72, 43, 23, 39, 38, 36, 14, 95, 57, 47, 51, 19, 30, 16, 76, 64, 60, 88, 42, 38, 61, 96, 50, 19], [40, 47, 62, 69, 46, 63, 47, 2, 51, 96, 91, 2, 37, 37, 57, 22, 98, 64, 91, 81, 39, 87, 74, 22, 15, 61, 60, 50, 61, 62, 40, 36, 39, 16, 56], [28, 35, 32, 52, 47, 88, 63, 21, 83, 32, 34, 52, 82, 11, 75, 82, 1, 40, 1, 24, 41, 86, 71, 81, 49, 12, 65, 67, 94, 87, 59, 72, 17, 6, 60], [56, 12, 21, 75, 66, 20, 64, 20, 95, 36, 62, 24, 86, 9, 58, 49, 81, 98, 53, 11, 6, 59, 51, 49, 87, 47, 45, 49, 40, 90, 9, 8, 49, 52, 26], [12, 97, 64, 71, 80, 26, 89, 35, 93, 50, 92, 16, 83, 40, 6, 91, 67, 98, 17, 32, 24, 99, 35, 96, 53, 15, 37, 25, 85, 78, 23, 55, 7, 5, 78], [83, 71, 72, 68, 6, 10, 50, 14, 13, 71, 21, 97, 11, 6, 36, 75, 55, 34, 94, 73, 71, 46, 37, 60, 18, 49, 93, 85, 14, 16, 26, 95, 51, 75, 96], [90, 63, 33, 60, 37, 11, 20, 77, 34, 60, 97, 58, 43, 68, 54, 72, 60, 11, 66, 22, 4, 42, 89, 52, 44, 15, 76, 97, 32, 70, 1, 20, 69, 37, 51], [2, 78, 17, 50, 82, 17, 31, 56, 31, 36, 19, 61, 32, 81, 88, 4, 69, 47, 41, 1, 90, 42, 67, 23, 13, 86, 95, 61, 72, 30, 46, 76, 86, 43, 15], [30, 60, 24, 25, 53, 58, 2, 65, 84, 45, 44, 26, 8, 83, 31, 79, 52, 2, 66, 50, 93, 97, 10, 46, 58, 85, 85, 13, 51, 80, 83, 88, 58, 62, 23], [4, 31, 8, 25, 54, 87, 11, 92, 45, 87, 45, 60, 64, 43, 64, 47, 61, 98, 48, 75, 8, 34, 8, 52, 81, 86, 8, 62, 65, 14, 69, 91, 48, 87, 12], [64, 30, 8, 66, 69, 77, 81, 35, 79, 12, 99, 67, 10, 2, 15, 63, 7, 20, 60, 8, 90, 58, 8, 30, 84, 54, 54, 95, 29, 53, 94, 31, 4, 29, 44]]];
int [] param1 = [3, 33, 9, 6, 6, 27, 2, 15, 21, 28];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SMALLEST_SUM_CONTIGUOUS_SUBARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, -58, 0, 1, -316, 0, 3, -402, 0, 1];
int [] [] param0 = [[2, 9, 13, 14, 15, 18, 19, 19, 25, 26, 29, 29, 29, 30, 31, 36, 37, 37, 38, 39, 39, 40, 40, 42, 42, 46, 50, 53, 58, 60, 62, 64, 65, 67, 68, 69, 72, 77, 78, 83, 85, 89, 90, 93, 95, 95, 97], [14, -58, 8, 78, -26, -20, -60, 42, -64, -12], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [44, 88, 20, 47, 69, 42, 26, 49, 71, 91, 18, 95, 9, 66, 60, 37, 47, 29, 98, 63, 15, 9, 80, 66, 1, 9, 57, 56, 20, 2, 1], [-78, -64, -62, -60, -52, 4, 8, 46, 72, 74], [0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], [3, 7, 16, 17, 23, 23, 23, 28, 29, 30, 34, 38, 40, 41, 43, 43, 44, 46, 51, 51, 51, 55, 57, 58, 61, 62, 66, 66, 67, 69, 70, 73, 75, 77, 79, 80, 85, 85, 87, 87, 93, 96], [80, 22, 38, 26, 62, -48, -48, 46, -54, 4, 76, 46, 48, 40, -92, -98, -88, 12, -42, -94, 76, -16, -82, 62, 18, -24], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [85, 44, 1, 97, 50, 74, 62, 90, 3, 78, 8, 48, 96, 41, 36, 91, 57, 97, 85, 90, 78, 43, 28, 92, 85, 59, 29, 38, 34, 65, 20, 26, 27, 23, 71, 22, 47, 99, 68, 93, 67, 66, 69, 82, 98, 15, 44, 51, 65]];
int [] param1 = [24, 6, 8, 26, 8, 11, 38, 22, 13, 45];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 1, 0, 0, 2, 0, 0, 1, 2];
string [] param0 = ["zcoqhum", "2674377254", "11", "lbuglvrywapbpo", "26382426486138", "111010111010", "huinqjxndbfp", "5191", "1110101101", "2202200"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, true, true, false, true, false, true, true, false];
int [] param0 = [474, 9445, 90, 30, 37453, 27, 2400, 98, 46, 722];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [198, 1100, 0, 217, 468, 1, 671, 710, 0, 703];
int [] [] param0 = [[5, 14, 15, 21, 0, 0, 42, 0, 0, 0, 0, 48, 0, 0, 53, 60, 62, 69, 69, 79, 82, 86, 96], [-54, 0, -22, 94, 58, 0, -12, 84, 0, 0, -34, 16, -10, -32, 50, -78, 68, -52, -64, 66, 0, 0, -38, -18, -84, -66, -36, 64, -12, 44, 48, 8, 42], [0, 0, 0, 1], [63, 49, 18, 36, 21, 30, 45, 87], [-96, 0, 0, -72, -62, -56, -52, -44, 0, 0, -28, -22, -20, -12, 0, 0, -2, 2, 2, 4, 36, 44, 46, 50, 50, 54, 66, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0], [1, 2, 8, 12, 0, 0, 14, 17, 18, 27, 28, 31, 34, 37, 38, 42, 43, 45, 49, 52, 53, 0, 0, 58, 62, 66, 71, 74, 87, 93, 96, 99], [0, -28, -30, 86, 0, -80, 76, -2, 28, 0, 0, 84, 0, 0, -88, 0, 42, 16, 0, 0, 78, -8, -46, -6, 0, 0, 0, -12, -32, -72, 84, -82, 76, -84, 80, -50, 90, -50, -14, -82, 78, 48, -10, 86, 34, -20, -76, 58], [0, 1], [83, 86, 57, 18, 98, 52, 1, 37, 11, 49, 10, 67, 2, 60, 30, 42, 8, 97, 25, 55, 5, 75, 9, 67]];
int [] param1 = [15, 28, 2, 6, 18, 34, 25, 28, 1, 16];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [7, 2, 3, 8, 1, 3, 9, 1, 2, 7];
int [] [] param0 = [[7, 8, 11, 11, 14, 19, 25, 27, 41, 42, 46, 52, 53, 54, 55, 58, 59, 62, 63, 66, 67, 69, 74, 75, 77, 81, 83, 84, 88, 88, 93, 93, 94], [-96, -92, -78, -72, -60, -56, -28, -18, 12, 14, 16, 16, 20, 20, 30, 40, 72, 76, 76, 80, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 4, 6, 12, 13, 14, 15, 16, 19, 21, 22, 27, 33, 37, 37, 40, 43, 45, 48, 50, 59, 63, 64, 65, 66, 67, 67, 67, 73, 78, 80, 81, 84, 85, 85, 91, 95, 95, 97, 98], [-98, -92, -90, -88, -88, -74, -64, -64, -64, -62, -60, -52, -48, -46, -42, -42, -38, -34, -28, -26, -20, -20, -18, -4, 0, 2, 2, 6, 18, 18, 18, 20, 24, 24, 26, 32, 40, 46, 58, 66, 74, 78, 90, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8, 12, 13, 13, 13, 16, 16, 17, 19, 20, 22, 23, 26, 29, 29, 30, 31, 37, 38, 39, 39, 41, 45, 45, 46, 49, 49, 53, 56, 62, 62, 66, 67, 68, 68, 69, 69, 73, 77, 78, 82, 85, 85, 88, 88, 97], [-98, -98, -88, -84, -78, -76, -76, -74, -70, -68, -64, -62, -58, -44, -42, -38, -30, -28, -26, -24, -22, -20, -8, -6, 2, 4, 8, 8, 16, 18, 20, 34, 36, 40, 46, 60, 72, 78, 82, 82, 86, 90, 94, 94, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 4, 21, 22, 23, 27, 27, 28, 28, 29, 30, 37, 39, 48, 50, 51, 54, 57, 61, 64, 64, 70, 71, 77, 85, 85, 88, 92, 93, 96, 97]];
int [] param1 = [33, 21, 37, 40, 44, 40, 46, 45, 28, 31];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [4, 11, 5, 6, 4, 7, 3, 5, 4, 3];
int [] param0 = [12, 11, 10, 9, 8, 7, 6, 5, 4, 3];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
TILING_WITH_DOMINOES | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 0, 41, 0, 3, 0, 11, 153, 571];
int [] param0 = [9, 13, 5, 6, 7, 2, 19, 4, 8, 10];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, true, false, false, false, false, false, false, false, false];
string [] param0 = ["ba", "aabb", "abab", "aaabb", "aabbb", "abaabbaa", "abaababb", "bbaa", "11001000", "zwxv te"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 0, 0, 1, 0, 0, 0, 0, 0];
int [] [] param0 = [[9, 16, 19, 24, 36, 38, 42, 49, 51, 53, 53, 57, 57, 58, 71, 78, 78, 92, 92, 93], [28, -74, -18, 10, 26, 28, -96, -80, 82, 94, 22, 50, 72, -90, 76, 50, 20, -44, -80], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 8, 66, 90, 50, 65, 76, 90, 27], [-98, -96, -90, -82, -80, -78, -70, -66, -60, -60, -50, -48, -34, -26, -24, -16, -14, -8, -6, 4, 22, 24, 26, 30, 30, 48, 52, 56, 60, 62, 74, 76, 78, 86], [1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0], [4, 6, 17, 19, 24, 29, 30, 31, 32, 37, 37, 40, 43, 44, 44, 45, 57, 64, 69, 70, 73, 78, 86, 89, 91, 92, 94], [32, -88, 70, -6, 28, -48], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [37, 84, 97, 74, 12, 26, 47, 10, 14, 33]];
int [] param1 = [13, 18, 30, 4, 32, 15, 17, 4, 13, 5];
int [] param2 = [12, 13, 21, 8, 24, 16, 21, 3, 12, 9];
int [] param3 = [13, 13, 31, 5, 24, 12, 15, 4, 11, 8];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
HIGHWAY_BILLBOARD_PROBLEM | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 0, 0, 0, 0, 0, 0, 0, 0, 0];
int [] param0 = [16, 39, 5, 10, 14, 32, 2, 22, 15, 8];
int [] [] param1 = [[6, 15, 15, 18, 23, 29, 32, 36, 37, 39, 40, 41, 44, 49, 51, 52, 53, 57, 66, 68, 82, 89, 96], [76, 60, 88, 46, -20, -78, -22, 54, -18, 92, -42, -66, -90, -72, -48, 22, -72, -42, -46, 94, 82, -78, 14, 86, 10, -64, -78, 66, 78, -36, 50, -20, -40, -12, 10, -46, 56, -18, 4, -76, -64, 74, 22, 34, 4, -2], [0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [21, 69, 30, 10, 71, 72, 71, 78, 30, 9, 72, 10, 7, 87, 30, 46, 56, 74, 73, 60, 86], [-76, -76, -66, -64, -62, -60, -52, -48, -42, -28, -14, -6, -6, 16, 20, 20, 38, 46, 58, 60, 70, 72, 86, 98], [1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1], [16, 38, 72, 82], [28, -76, 42, -2, 30, -10, 52, 66, 26, 96, 96, -72, 26, -86, -30, -78, 32, -32, 58, 12, -72, 8, 34, -68, -28, -66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [95, 12, 65, 97, 92, 49, 94, 32, 37, 97, 9, 35]];
int [] [] param2 = [[1, 2, 5, 5, 24, 26, 31, 32, 33, 41, 57, 59, 71, 75, 79, 87, 87, 88, 92, 94, 96, 96, 99], [28, 8, -60, 84, 68, -54, -56, 0, -68, -84, -6, 92, -80, -24, 86, -6, -44, 82, 74, 90, -46, 40, 62, 50, -42, 38, 78, 94, 46, -14, -48, 66, 70, 52, 10, -88, 54, -10, 98, 34, 16, -2, -62, -56, -40, 86], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [72, 45, 7, 30, 76, 35, 75, 72, 4, 7, 55, 56, 7, 52, 48, 27, 11, 76, 66, 48, 33], [-90, -82, -78, -76, -74, -52, -48, -44, -44, -40, -38, -14, -6, 10, 20, 38, 38, 40, 44, 48, 52, 54, 76, 78], [0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1], [15, 34, 56, 74], [68, -38, 34, 20, 40, 78, 52, 80, 58, -12, -18, 10, 40, 34, 20, -32, -8, -46, 8, 62, 94, -30, -94, 26, -40, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 32, 14, 49, 90, 37, 92, 1, 8, 75, 50, 9]];
int [] param3 = [12, 25, 9, 18, 15, 28, 2, 13, 25, 9];
int [] param4 = [12, 27, 6, 20, 17, 36, 3, 16, 15, 8];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
COUNT_DISTINCT_OCCURRENCES_AS_A_SUBSEQUENCE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 2, 20, 0, 2, 0, 1, 4, 6, 1];
string [] param0 = ["banana", "49597223", "1000010000011", "btlzufk", "3474007", "0010", "dkhhotd", "9123259723", "11001000111110", "iy wjliz"];
string [] param1 = ["ban", "42", "010", "epsvuzp lf", "370", "00000", "dot", "123", "0", "ii"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
DIVISIBILITY_9_USING_BITWISE_OPERATORS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, true, false, false, false, false, true, false, false];
int [] param0 = [96, 85, 54, 14, 47, 11, 49, 99, 28, 82];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [429, 42, 9694845, 58786, 16796, 5, 4862, 1430, 742900, 132];
int [] param0 = [7, 5, 15, 11, 10, 3, 9, 8, 13, 6];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
SUM_SERIES_555555_N_TERMS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [61719994, 5, 6171995, 6169, 617199994, 617196, 5, 614, 60, 61716];
int [] param0 = [8, 1, 7, 4, 9, 6, 1, 3, 2, 5];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
PROGRAM_FIND_STRING_START_END_GEEKS | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, true, true, false, true, false, false, false];
string [] param0 = ["geeksmanishgeeks", "shreyadhatwalia", "10000100", "abaa", "30645530", "0000011011001", "dkqed", "48694119324654", "1101010010", "ks"];
string [] param1 = ["geeks", "abc", "100", "a", "30", "001", "d", "654", "11", "ksflmngggomhks"];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 12, 4, 9, 8, 13, 13, 5, 4, 9];
int [] param0 = [2, 39, 31, 45, 35, 94, 67, 50, 4, 63];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2 | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [10, 10, 9, 16, 4, 12, 14, 9, 13, 8];
int [] param0 = [73, 91, 27, 79, 31, 84, 68, 9, 85, 35];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE | import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [832, 308, 2, 419, -182, 7, 895, 450, 0, 895];
int [] [] param0 = [[5, 6, 8, 9, 10, 10, 16, 17, 17, 20, 21, 22, 23, 28, 29, 32, 36, 37, 40, 41, 42, 43, 47, 47, 48, 48, 49, 49, 52, 52, 53, 59, 61, 64, 65, 79, 79, 81, 87, 91, 92, 98], [98, 76, -80, -30, 82, 52, -14, 28, 98, 18, 82, 52, 26, -62, -8], [0, 0, 0, 0, 0, 1, 1, 1, 1], [21, 26, 85, 73, 47, 10, 54, 9, 11, 70, 42, 95, 44, 91], [-94, -92, -90, -84, -76, -68, -60, -50, -34, -34, -20, -16, -6, 18, 50, 54, 66, 70, 96], [1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], [2, 3, 4, 4, 14, 14, 18, 21, 24, 26, 29, 31, 32, 34, 36, 37, 38, 40, 42, 44, 44, 54, 63, 69, 77, 77, 82, 82, 86, 87, 90, 93, 95], [-46, 64, -44, 88, -74, 54, 40, -2, -24, 94, 40, -44, 56, -54, -60, -86, -58, 48, -90, 12, -76, -30, 94, -34, 14, 12, 80, -40, 60], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [4, 32, 63, 23, 44, 57, 59, 69, 88, 61, 66, 61, 65, 33, 79, 58, 71, 2, 80, 41, 83, 12, 20, 9, 7, 40, 36, 97, 10, 98, 66, 78, 71, 37, 53]];
int [] param1 = [35, 7, 7, 12, 9, 16, 31, 22, 7, 26];
int n_success = 0;
for (int i = 0; i < param0.length; i++) {
if (results[i] == f_filled(param0[i], param1[i])) {
n_success += 1;
}}
writefln("#Results:%d, %d", n_success, param0.length);
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.