Code Evaluation
Collection
Datasets to be used with code evaluation: https://github.com/aip-hd-research/CodeEvaluation
•
3 items
•
Updated
id
stringlengths 9
106
| d_with_params
stringlengths 426
57.5k
|
|---|---|
PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, false, false, false, false, false, false, false];
int [] param0 = [37, 39, 73, 8, 28, 66, 20, 36, 6, 51];
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_SORTED_ROWS_MATRIX
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 0, 0, 0, 9, 0, 6, 0, 0, 0];
int [] [] [] param0 = [[[4, 12, 13, 24, 25, 26, 27, 35, 41, 60, 69, 71, 73, 78, 85, 86, 95, 99], [1, 13, 18, 25, 41, 42, 44, 45, 49, 49, 51, 52, 59, 63, 64, 67, 78, 97], [1, 2, 11, 18, 23, 26, 30, 31, 41, 42, 45, 71, 75, 90, 91, 92, 95, 97], [26, 30, 44, 46, 46, 54, 56, 60, 67, 68, 75, 77, 77, 83, 87, 87, 94, 98], [19, 20, 27, 31, 33, 34, 37, 41, 42, 49, 60, 60, 64, 67, 71, 73, 77, 92], [2, 6, 9, 11, 20, 29, 37, 41, 42, 44, 49, 58, 62, 76, 87, 89, 94, 97], [7, 8, 9, 14, 20, 45, 49, 54, 63, 63, 64, 71, 72, 73, 73, 89, 94, 95], [2, 3, 7, 16, 17, 23, 23, 25, 44, 50, 58, 58, 59, 78, 83, 87, 90, 99], [4, 16, 18, 22, 23, 33, 34, 43, 43, 46, 51, 56, 62, 75, 79, 85, 97, 97], [16, 18, 29, 32, 39, 53, 54, 55, 67, 70, 72, 72, 76, 76, 86, 87, 96, 96], [6, 30, 34, 37, 38, 42, 52, 54, 59, 67, 71, 71, 72, 81, 85, 87, 91, 93], [2, 6, 6, 16, 18, 20, 21, 31, 40, 42, 50, 56, 62, 80, 80, 83, 91, 96], [2, 5, 6, 14, 16, 21, 23, 37, 52, 59, 72, 86, 86, 87, 87, 89, 90, 91], [1, 10, 17, 20, 22, 25, 27, 32, 37, 37, 44, 49, 65, 78, 80, 81, 85, 95], [1, 13, 14, 21, 43, 50, 52, 58, 62, 64, 65, 66, 66, 66, 67, 70, 81, 82], [1, 2, 9, 16, 17, 23, 25, 29, 30, 31, 42, 65, 73, 74, 82, 87, 92, 92], [1, 5, 9, 13, 21, 28, 32, 33, 34, 38, 46, 60, 80, 86, 93, 94, 96, 98], [11, 18, 23, 24, 25, 26, 28, 48, 59, 59, 67, 72, 82, 83, 86, 89, 92, 96]], [[82, 82, 2, 8, -32, 90, -76, -64, -66, -46, -72, -58, -28, -86, -8, -96, -62, -32, 54, -16, 96, 28, 76, 90, -40, 98, 88, -90, 4, -50, 70, 32, -74, -72, -72, 10, 36, 50, -16, -36], [-52, -6, 12, -6, -64, 6, 38, -14, -86, 74, -74, 82, 54, 2, 46, -94, 88, 86, -32, -72, 72, 88, 90, -8, -58, 32, -90, -68, -70, 72, 34, 74, -30, 92, 90, -88, 82, -54, 42, 94], [-4, -32, -12, -96, 16, -32, 32, 52, 2, -6, 2, -10, 40, -64, 4, -56, -50, 46, 54, -6, -14, -40, -98, -4, -20, 98, 94, 60, -70, -94, 52, -4, 32, 20, -30, -94, -50, 50, -86, -66], [10, 84, 2, -44, -54, -82, -64, 70, -20, -40, -50, 10, 26, -14, -88, 10, -80, -48, 10, 16, -14, -52, 74, -60, 48, -60, -62, 38, 56, -34, 86, 20, 74, -20, 28, -46, -44, 96, -58, -8], [-48, -36, -18, -66, -20, 60, -36, 34, -94, 44, -14, -34, -84, -26, 38, 48, 14, 12, 72, -76, 26, 50, -58, 40, 90, 14, -40, 22, -26, -24, 66, -62, -34, 16, -34, -30, 54, -76, -26, 4], [-26, 56, 74, -82, 58, -42, -98, 96, -24, -36, -86, -80, 42, 78, -2, -90, -8, -52, 46, -20, -16, 64, -36, -8, -16, -60, 96, 40, 66, 98, 14, -36, -78, -40, 52, 60, -20, 38, 26, -98], [-12, 60, -56, -66, 68, -20, -74, 30, 14, -36, -22, -54, 50, 62, -44, 14, 90, 66, 80, 76, -86, 92, -80, -6, 48, 44, 24, 40, 94, -42, 68, 28, -20, 98, 40, 50, -18, 90, 6, 2], [-98, 4, -32, -34, -64, 58, 16, 48, 82, 10, 36, 32, -60, -40, 2, -14, -58, 28, -44, 60, -28, -6, -68, 46, -50, 62, 10, 44, -4, 76, 60, -26, 52, 40, -88, -56, -36, -70, -66, -22], [18, -66, -82, 52, 34, -86, -50, -64, 18, 10, -14, 8, 80, -76, 20, 76, 96, -12, -36, 86, -10, 16, -14, 66, -4, 14, -82, 0, 2, 90, 78, -48, 42, -60, 90, -16, 80, 16, -64, -58], [12, 8, -74, 78, 46, -84, 20, 14, -2, -42, -80, -66, -64, 34, 58, 0, 28, -8, 34, 92, -14, -54, 82, 68, 64, 6, 30, 78, -50, -28, -74, -12, -18, 82, -50, -86, -2, -78, 94, -66], [10, -76, 58, 32, -44, 60, -14, 24, -92, 24, 16, 80, 90, -60, -6, 8, -50, 90, 60, 82, 6, 84, 74, -48, -98, -2, -38, 74, 64, 52, 8, -32, -58, -58, 70, -14, 68, 46, 32, 74], [84, 98, 78, 34, -94, 84, 10, 84, 10, -58, -70, -30, 98, -28, -80, 56, -36, 96, 82, 38, 2, -38, 28, 18, 82, 60, -16, -64, 90, 34, -10, 98, 36, 40, -6, -32, -32, -24, 92, 12], [54, 92, -30, -12, 40, 48, 8, 34, -20, -58, 8, -14, 0, -34, 98, -32, -98, 40, -44, 34, 94, -56, -90, 64, 4, -76, -34, -68, 48, 28, 84, -4, -46, -54, 72, -82, 0, -82, 38, -6], [44, -66, -86, 54, -4, 36, 62, 88, -16, -88, -26, -50, -84, -90, 38, 14, 62, 14, -92, 64, -50, -2, -96, -4, 94, -84, 26, -86, -68, 6, -18, -66, -56, -88, -92, -86, 64, -6, -92, -12], [-36, 80, -28, -42, 58, -12, -66, -38, -76, 34, -52, -32, -80, 66, 54, -2, -40, 78, 14, -54, 6, -92, 68, -40, 72, -80, 52, -60, 98, -60, -92, 26, -24, 26, 46, 34, 80, -92, 16, 16], [-4, 60, -72, -6, 46, 76, -8, 82, 42, -68, -86, 10, 20, 80, -22, 64, -40, 22, -6, -58, -74, -86, -16, -14, -76, -54, -98, -50, -74, 80, -44, 18, -70, -80, 58, -48, -70, 44, 46, 88], [-80, -76, -46, -92, -78, -72, -56, 72, -52, -86, -48, 6, 84, 38, -14, 66, 48, 86, 36, -80, -54, -44, -88, -18, -50, -56, -20, -14, -52, -98, -44, -76, -42, -66, -20, 62, 0, -54, -82, -70], [44, 98, 78, 56, -14, -70, -24, 62, 88, 70, -42, 72, 80, 42, 22, -90, -50, -22, 14, 40, 42, 34, 66, -58, 70, 22, -86, 58, -82, 54, -20, 72, 20, 32, 8, 30, 52, -6, -12, -62], [-4, 70, -76, 22, 22, 44, -84, -74, 34, -36, 64, -78, 50, 72, -40, -78, -26, -66, -84, -28, -40, -96, 66, 36, -28, -18, 4, 0, 20, 18, 78, -74, -58, -64, -68, 68, -84, 20, -56, -16], [0, 24, 64, -50, -36, 70, -88, -34, 70, 68, -68, 80, 88, 12, -50, 74, 32, 18, -14, 74, 58, 68, -62, -30, 20, 94, -68, 96, -32, -94, -70, -44, -76, -94, 34, 54, -74, 62, -80, -10], [-64, -26, -26, 44, 14, -72, -74, 36, -8, -64, -34, 6, 18, 14, 74, -90, 66, -12, -6, -6, -12, -58, 72, 18, 62, -44, 12, -56, 66, 34, 44, 0, -98, 96, -94, -60, 76, 52, 48, -6], [6, -58, 14, 82, -72, 0, 92, 8, -6, -18, 74, -66, 68, -24, -20, 90, -48, 54, 18, -24, -8, -48, 72, -78, -54, 84, 18, -52, -36, -30, -82, -34, 8, -94, -34, -78, -28, 44, 92, -78], [-50, -84, -82, -12, 62, -72, -36, 84, -36, -82, 12, -52, 12, -34, 36, 8, -24, 58, 6, -34, 0, -22, 46, 98, 62, 80, -88, -24, 98, 30, 22, 94, -38, -24, 78, 62, 0, -10, 2, 52], [94, -10, -88, -12, -10, 56, -86, 18, 54, -20, 22, -18, 76, -88, -38, 38, -88, -20, 82, 88, -80, -34, 14, 54, 28, -46, -88, -84, -86, 38, 86, 26, 98, -28, 14, -24, -22, -80, -98, 58], [60, 52, 12, -86, -54, -30, 10, -2, -54, -74, 56, 74, -74, 92, 86, -92, -28, -54, 30, -56, 40, 96, 92, 16, 82, -70, -80, 92, -80, 14, 56, -6, 8, -92, 20, 10, -50, -64, -34, 50], [64, 70, -74, -72, 78, 46, 42, 44, -96, -18, -62, 56, -90, -14, 38, 82, 8, -58, 52, 92, -90, 22, -60, 62, 60, -64, -56, -74, 92, -2, -90, -14, -56, -64, 38, 18, -52, -92, 30, -36], [50, 84, 82, 36, 60, 34, -50, -64, -72, 30, 8, 84, 48, -24, 78, 80, -10, -90, 82, -80, -4, -94, 24, 92, 92, -16, -80, 68, 60, 98, -92, 52, 60, 8, -72, 12, -60, -84, -44, -34], [-98, -30, 30, 36, 96, 74, -82, -2, -72, -38, -40, 10, 92, 30, 98, -28, 56, 70, -84, 66, 40, 92, 42, -86, -58, -90, -10, 98, -12, -80, 94, 4, -84, 60, 94, -90, 74, -68, 64, -76], [2, 94, 38, -6, 64, 4, -42, 92, -12, 54, 82, 90, -64, 32, 0, -24, -16, -68, 78, 54, 28, -86, -56, 4, 16, 98, 32, -18, -76, 90, -6, 72, 40, 20, 6, -90, 52, -62, 4, 30], [22, 90, 54, -34, -30, 0, -72, -6, 36, 28, -96, 86, -2, -48, -30, 8, -60, -32, 24, -50, -76, -86, 32, 28, -66, -88, 24, 86, 72, 96, 22, -32, -92, -26, 48, -52, -12, 4, -94, 2], [-44, 70, 38, 36, -36, 46, -68, -44, -36, 34, -32, -44, -22, -80, -64, 28, 60, 92, -52, 14, 42, -80, -70, 50, 24, -34, 16, 64, 62, -94, 18, -48, -68, 16, 76, -42, 30, -88, 46, -12], [46, 46, 44, 16, -70, -6, -78, -46, 70, 30, 70, 88, 66, 56, -12, 4, 76, -50, -28, -98, -16, -86, -68, 36, 28, -92, -46, -86, -2, 90, 6, 36, -62, -30, -26, -38, 22, -60, -20, -70], [80, 38, -94, -42, 70, -20, 42, -62, -30, 54, 82, -94, -78, 74, 60, 54, -52, -56, 66, 86, -30, -14, 0, -6, -22, 56, 70, -86, 50, 82, 72, -10, 54, 24, -46, -26, -20, -54, -96, 30], [-48, 94, 54, -16, 70, 20, -20, -2, -8, 84, -60, 30, -18, -14, 32, 42, 24, 26, -12, -62, 2, -94, 26, 36, -88, -22, -64, 46, 36, 74, -44, -56, -36, -98, 70, 72, -68, 68, 76, -32], [-4, 36, 0, 14, -42, -38, -98, -2, -44, -90, 82, 80, -66, 38, 62, 34, 52, 44, -22, 80, -74, -88, -74, 24, 98, 8, 18, -26, -4, -82, -60, 44, -2, 30, 20, 52, 26, -22, -54, 96], [98, -54, -12, -12, -74, 34, -6, -36, -94, 40, 96, 42, -32, -46, -46, 88, -90, 26, -98, 30, 92, -34, 74, -94, 36, -68, -66, 74, -2, 6, 94, -12, 82, 90, -2, 78, -80, -84, 18, 74], [-42, 30, 56, -74, -16, -44, 4, -62, -12, -62, -22, 64, 56, 96, -16, 40, 10, 88, -66, 54, 56, 96, 74, -6, -36, -70, -82, 74, -14, -18, -32, -70, 60, 26, -88, -78, -8, 32, -84, 90], [-44, -14, -44, 96, 0, 54, 2, 74, 36, -56, -98, -16, -70, 68, -88, 26, -18, 30, 62, -88, -28, -58, 62, -38, -62, 28, -80, -6, 88, -16, 64, -58, 14, 94, -40, 2, -12, -16, -24, -64], [20, 18, -94, 94, -2, -74, -56, -46, 62, -88, -16, -30, -10, -54, 38, 22, -42, 32, 28, -42, 44, 64, 46, 66, -96, 70, -32, 10, -14, 72, -42, 98, -54, 36, 76, 24, -96, 86, 54, -88], [74, -48, 90, 78, -44, 0, 76, -16, -28, -92, 10, -32, -30, -78, -8, 40, -90, 74, -40, 16, -78, 22, -42, 36, 68, 44, 42, 6, -60, 36, -74, -92, 92, -44, 40, -92, -46, 56, -36, -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, 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], [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, 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], [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, 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], [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], [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, 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, 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, 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], [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, 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, 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], [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, 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, 0, 0, 0, 0, 0, 0, 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], [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, 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], [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, 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], [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]], [[91, 8, 34, 7, 66, 59, 90, 78, 54, 77, 55, 29, 90, 69, 85, 42, 39, 49, 83, 59, 3, 41, 65, 60, 4, 45, 65, 29, 47, 40, 96, 11, 21, 74, 34, 83, 12, 3, 6, 67, 30, 29, 40, 87, 35, 73, 17, 13, 20], [38, 36, 55, 16, 85, 38, 67, 15, 37, 25, 81, 61, 31, 68, 31, 11, 23, 39, 35, 21, 66, 66, 52, 49, 55, 35, 40, 47, 99, 25, 91, 6, 50, 3, 62, 11, 46, 88, 95, 17, 40, 70, 35, 76, 59, 84, 4, 99, 84], [61, 2, 63, 5, 81, 77, 7, 32, 74, 17, 53, 17, 86, 5, 86, 15, 80, 84, 94, 64, 86, 94, 64, 7, 90, 64, 15, 94, 56, 51, 64, 84, 77, 70, 49, 2, 46, 96, 64, 25, 18, 54, 39, 73, 77, 23, 46, 14, 23], [48, 22, 2, 60, 46, 8, 3, 70, 58, 6, 27, 23, 71, 92, 10, 45, 48, 85, 81, 86, 61, 27, 85, 75, 1, 49, 47, 82, 8, 74, 92, 40, 61, 27, 12, 30, 37, 66, 84, 36, 86, 40, 36, 96, 60, 96, 70, 27, 41], [13, 6, 54, 10, 54, 19, 24, 61, 87, 77, 14, 45, 37, 15, 74, 4, 47, 61, 78, 91, 68, 99, 67, 70, 70, 26, 72, 19, 75, 93, 56, 66, 76, 80, 49, 45, 62, 85, 50, 51, 48, 40, 48, 13, 69, 62, 82, 13, 13], [25, 75, 45, 24, 38, 4, 19, 83, 38, 61, 21, 59, 71, 72, 76, 59, 36, 31, 72, 23, 16, 22, 68, 40, 28, 60, 89, 87, 87, 89, 16, 11, 45, 89, 75, 25, 43, 67, 69, 41, 66, 91, 38, 62, 73, 29, 13, 45, 68], [30, 1, 39, 11, 69, 4, 8, 3, 52, 59, 24, 47, 88, 62, 30, 96, 38, 80, 62, 86, 81, 12, 72, 65, 10, 64, 95, 58, 60, 95, 51, 60, 89, 35, 54, 85, 67, 38, 58, 85, 12, 40, 5, 47, 35, 95, 26, 60, 33], [47, 58, 24, 5, 76, 9, 56, 45, 32, 69, 14, 63, 7, 2, 55, 36, 29, 59, 15, 64, 65, 80, 99, 2, 99, 23, 18, 98, 26, 38, 58, 52, 92, 53, 18, 40, 86, 93, 18, 26, 71, 65, 29, 91, 80, 91, 29, 44, 31], [63, 5, 55, 56, 10, 58, 53, 43, 89, 30, 98, 71, 20, 94, 28, 27, 65, 65, 54, 66, 69, 28, 82, 30, 2, 13, 71, 16, 31, 55, 65, 62, 76, 66, 36, 70, 42, 66, 82, 73, 63, 21, 27, 89, 44, 99, 70, 75, 96], [6, 19, 62, 34, 59, 79, 75, 95, 84, 64, 95, 81, 81, 77, 83, 62, 24, 4, 18, 97, 33, 43, 57, 40, 90, 65, 10, 88, 84, 54, 68, 58, 40, 46, 88, 32, 1, 97, 4, 36, 41, 57, 30, 13, 43, 77, 88, 99, 29], [23, 37, 24, 76, 53, 11, 28, 95, 2, 89, 27, 47, 2, 3, 12, 67, 25, 66, 7, 38, 45, 63, 15, 93, 2, 12, 44, 28, 68, 27, 52, 23, 85, 4, 59, 92, 35, 17, 27, 7, 91, 20, 84, 22, 26, 34, 63, 87, 54], [97, 74, 14, 36, 43, 72, 69, 25, 78, 13, 46, 10, 88, 50, 49, 98, 55, 43, 22, 78, 13, 78, 46, 9, 24, 32, 61, 91, 51, 53, 58, 95, 54, 47, 11, 21, 18, 60, 10, 27, 82, 66, 90, 40, 45, 52, 98, 85, 16], [34, 59, 78, 37, 11, 87, 79, 40, 58, 33, 82, 33, 96, 86, 94, 40, 71, 85, 59, 22, 65, 73, 20, 63, 76, 91, 24, 29, 68, 27, 45, 97, 69, 33, 43, 86, 92, 31, 19, 32, 15, 39, 37, 19, 14, 38, 5, 53, 20], [44, 25, 58, 89, 40, 99, 34, 90, 26, 87, 63, 16, 43, 84, 77, 25, 48, 55, 7, 47, 43, 84, 3, 41, 28, 65, 34, 9, 43, 39, 76, 8, 52, 12, 75, 43, 16, 94, 18, 93, 12, 83, 54, 15, 27, 81, 46, 89, 24], [67, 92, 60, 34, 46, 5, 80, 64, 53, 65, 94, 65, 36, 66, 56, 52, 82, 54, 32, 55, 69, 88, 43, 41, 11, 8, 33, 95, 32, 48, 71, 9, 89, 7, 2, 33, 29, 76, 33, 38, 99, 48, 99, 92, 68, 22, 70, 19, 14], [90, 32, 71, 27, 57, 73, 87, 90, 40, 24, 15, 27, 70, 87, 74, 29, 8, 30, 17, 87, 13, 93, 46, 87, 12, 30, 43, 80, 14, 3, 23, 75, 67, 51, 23, 49, 69, 69, 69, 54, 57, 46, 60, 43, 47, 70, 14, 30, 95], [69, 58, 48, 20, 45, 70, 13, 66, 65, 42, 62, 76, 9, 8, 17, 28, 22, 2, 60, 6, 73, 54, 24, 32, 15, 11, 75, 62, 8, 99, 51, 36, 83, 15, 55, 18, 17, 78, 80, 82, 97, 70, 60, 46, 78, 16, 1, 26, 43], [34, 59, 69, 68, 91, 5, 24, 72, 81, 23, 64, 19, 72, 6, 66, 72, 91, 96, 65, 11, 28, 27, 27, 87, 87, 61, 29, 52, 86, 14, 41, 86, 59, 5, 42, 91, 22, 50, 9, 6, 99, 37, 24, 4, 8, 67, 62, 38, 99], [62, 48, 96, 3, 14, 75, 47, 80, 50, 61, 51, 77, 82, 37, 31, 49, 87, 48, 94, 4, 92, 94, 99, 26, 65, 29, 18, 4, 9, 14, 35, 60, 54, 33, 52, 49, 44, 31, 53, 95, 28, 3, 14, 97, 53, 19, 80, 73, 5], [18, 14, 24, 76, 93, 33, 55, 40, 65, 59, 45, 3, 29, 17, 12, 4, 60, 72, 23, 82, 14, 94, 65, 19, 24, 50, 91, 80, 96, 78, 41, 37, 75, 77, 4, 94, 69, 80, 48, 5, 55, 85, 43, 58, 36, 3, 8, 40, 87], [92, 18, 42, 47, 28, 4, 55, 10, 46, 52, 75, 20, 48, 62, 7, 14, 78, 95, 49, 58, 14, 2, 43, 29, 57, 98, 83, 90, 56, 62, 92, 91, 2, 69, 79, 44, 1, 5, 43, 54, 34, 88, 67, 60, 42, 37, 56, 51, 3], [28, 31, 22, 14, 75, 56, 68, 57, 39, 10, 73, 69, 72, 27, 79, 2, 99, 99, 10, 24, 48, 56, 19, 9, 21, 80, 36, 43, 11, 49, 85, 49, 84, 84, 28, 48, 13, 80, 39, 94, 8, 19, 97, 73, 3, 12, 29, 34, 34], [99, 50, 58, 74, 49, 22, 2, 84, 94, 89, 94, 38, 68, 86, 42, 41, 43, 69, 49, 17, 17, 96, 78, 18, 93, 48, 18, 32, 87, 16, 6, 70, 97, 72, 55, 20, 40, 56, 51, 54, 3, 57, 69, 71, 74, 18, 64, 31, 39], [23, 18, 26, 32, 12, 65, 32, 90, 98, 14, 8, 79, 44, 56, 52, 33, 34, 31, 92, 95, 99, 11, 90, 65, 59, 95, 49, 27, 77, 64, 21, 33, 2, 69, 11, 67, 65, 89, 40, 12, 66, 60, 65, 10, 62, 48, 32, 84, 43], [87, 26, 33, 4, 89, 44, 32, 68, 19, 61, 35, 74, 56, 55, 82, 66, 79, 76, 10, 64, 95, 33, 87, 89, 88, 67, 11, 14, 85, 99, 56, 78, 72, 51, 43, 44, 76, 11, 77, 14, 83, 70, 44, 58, 2, 46, 75, 61, 31], [93, 73, 8, 30, 6, 84, 16, 28, 43, 47, 80, 29, 89, 86, 91, 83, 98, 42, 91, 65, 20, 77, 34, 1, 24, 57, 77, 96, 66, 61, 55, 63, 7, 1, 52, 67, 85, 47, 32, 74, 88, 34, 94, 73, 7, 59, 78, 47, 42], [90, 35, 30, 1, 10, 96, 62, 91, 53, 13, 6, 33, 44, 6, 62, 49, 40, 35, 55, 30, 96, 98, 51, 57, 83, 45, 52, 51, 64, 70, 92, 99, 91, 2, 7, 95, 50, 77, 82, 23, 2, 56, 39, 97, 86, 55, 72, 69, 92], [45, 12, 56, 49, 85, 32, 64, 91, 3, 47, 10, 82, 50, 33, 71, 53, 94, 32, 57, 63, 59, 65, 83, 85, 73, 94, 28, 95, 76, 11, 51, 17, 87, 12, 69, 65, 58, 31, 76, 94, 13, 42, 15, 43, 34, 14, 60, 88, 24], [75, 34, 12, 19, 35, 60, 73, 5, 33, 74, 27, 12, 68, 58, 69, 94, 31, 99, 86, 32, 35, 78, 56, 6, 43, 71, 30, 56, 88, 14, 46, 41, 12, 6, 52, 15, 84, 52, 6, 13, 60, 49, 61, 45, 42, 72, 51, 82, 99], [95, 81, 81, 39, 93, 29, 96, 7, 99, 11, 94, 42, 1, 16, 99, 74, 68, 49, 15, 6, 15, 80, 68, 25, 86, 69, 76, 6, 64, 96, 87, 57, 94, 99, 39, 71, 3, 92, 68, 30, 5, 91, 49, 40, 5, 26, 58, 82, 90], [4, 57, 97, 16, 67, 90, 23, 89, 24, 84, 90, 66, 76, 51, 21, 44, 41, 52, 54, 71, 14, 64, 80, 49, 88, 2, 94, 76, 10, 71, 78, 1, 59, 39, 18, 56, 45, 43, 95, 13, 30, 93, 86, 78, 21, 14, 31, 98, 76], [40, 86, 5, 71, 50, 83, 56, 89, 56, 6, 75, 48, 16, 31, 65, 10, 90, 63, 84, 63, 1, 81, 6, 21, 89, 58, 70, 18, 72, 49, 10, 68, 2, 99, 10, 51, 86, 63, 55, 77, 90, 32, 53, 48, 99, 76, 45, 31, 52], [99, 19, 61, 12, 65, 15, 53, 96, 50, 46, 9, 32, 91, 55, 84, 30, 59, 58, 92, 99, 37, 68, 94, 78, 59, 47, 51, 4, 89, 10, 84, 84, 43, 83, 95, 2, 54, 81, 22, 60, 11, 30, 98, 59, 57, 37, 88, 43, 9], [14, 75, 98, 81, 61, 53, 54, 7, 97, 68, 98, 21, 92, 20, 12, 26, 14, 69, 52, 59, 36, 37, 89, 82, 13, 57, 26, 34, 12, 72, 12, 63, 91, 10, 21, 73, 46, 60, 8, 17, 5, 50, 30, 10, 83, 53, 97, 90, 39], [64, 61, 79, 7, 82, 31, 35, 88, 41, 39, 61, 54, 15, 67, 50, 86, 79, 58, 54, 9, 51, 83, 47, 8, 43, 6, 53, 61, 51, 45, 90, 42, 38, 35, 70, 7, 1, 18, 26, 87, 51, 76, 34, 82, 76, 66, 10, 66, 7], [62, 86, 31, 83, 51, 75, 40, 72, 22, 4, 42, 47, 56, 77, 36, 55, 36, 36, 74, 55, 67, 3, 96, 88, 38, 68, 2, 34, 92, 83, 16, 97, 70, 13, 36, 65, 73, 20, 49, 53, 49, 13, 32, 47, 42, 29, 26, 81, 44], [44, 18, 97, 11, 67, 31, 23, 89, 39, 31, 82, 62, 55, 55, 15, 83, 66, 6, 13, 58, 88, 97, 62, 21, 37, 75, 27, 18, 78, 11, 52, 47, 33, 9, 87, 49, 38, 67, 12, 14, 3, 5, 60, 63, 13, 22, 2, 31, 45], [55, 47, 20, 4, 13, 45, 34, 25, 95, 4, 13, 19, 1, 36, 74, 85, 51, 23, 35, 95, 23, 65, 63, 58, 67, 12, 18, 51, 21, 23, 38, 87, 92, 65, 69, 14, 48, 62, 86, 73, 41, 52, 12, 55, 85, 46, 88, 44, 38], [83, 29, 86, 98, 92, 66, 4, 69, 74, 50, 78, 75, 3, 44, 78, 34, 12, 54, 17, 90, 23, 97, 21, 96, 6, 3, 73, 5, 58, 93, 45, 64, 2, 97, 33, 93, 14, 62, 68, 19, 53, 66, 78, 5, 52, 94, 84, 60, 54], [15, 44, 11, 54, 64, 99, 91, 94, 57, 73, 95, 25, 24, 4, 66, 11, 84, 83, 50, 89, 31, 83, 27, 75, 98, 49, 15, 3, 59, 20, 67, 67, 4, 67, 23, 97, 87, 17, 67, 57, 91, 34, 81, 99, 90, 29, 55, 88, 28], [18, 89, 80, 81, 71, 51, 19, 14, 63, 18, 10, 40, 7, 64, 41, 55, 51, 75, 30, 89, 7, 18, 18, 89, 46, 98, 25, 1, 71, 6, 43, 89, 88, 30, 90, 30, 37, 57, 99, 3, 37, 91, 45, 69, 46, 32, 19, 51, 83], [11, 5, 99, 30, 60, 57, 35, 66, 16, 60, 93, 22, 7, 20, 58, 29, 91, 80, 59, 81, 52, 1, 51, 79, 88, 26, 92, 40, 12, 59, 9, 57, 42, 94, 24, 17, 79, 36, 48, 71, 83, 48, 88, 50, 69, 12, 62, 27, 22], [50, 91, 58, 61, 4, 65, 8, 12, 10, 67, 97, 24, 59, 37, 57, 29, 58, 43, 66, 25, 7, 97, 93, 73, 98, 24, 86, 31, 8, 30, 64, 93, 66, 4, 91, 78, 70, 67, 33, 5, 63, 41, 16, 39, 7, 42, 21, 22, 75], [2, 16, 31, 71, 84, 77, 39, 36, 83, 7, 14, 43, 53, 3, 76, 98, 29, 68, 75, 3, 5, 94, 73, 21, 2, 97, 73, 48, 6, 66, 45, 85, 27, 99, 62, 67, 34, 66, 13, 39, 18, 11, 4, 35, 62, 55, 91, 86, 63], [1, 57, 15, 25, 30, 61, 83, 28, 24, 17, 60, 56, 58, 7, 68, 10, 76, 6, 35, 18, 28, 55, 82, 52, 19, 18, 63, 40, 49, 95, 82, 76, 78, 85, 61, 79, 31, 48, 49, 40, 60, 67, 65, 86, 71, 44, 45, 58, 33], [64, 70, 88, 84, 20, 95, 73, 14, 2, 56, 94, 73, 83, 25, 93, 58, 49, 91, 76, 72, 10, 42, 73, 35, 49, 88, 12, 87, 78, 87, 78, 38, 57, 81, 12, 19, 14, 75, 71, 24, 78, 32, 23, 61, 8, 68, 61, 54, 4], [22, 20, 70, 20, 61, 33, 74, 38, 14, 2, 88, 96, 31, 86, 10, 34, 61, 59, 92, 47, 92, 70, 52, 1, 39, 47, 62, 17, 92, 95, 7, 5, 56, 73, 86, 36, 25, 73, 10, 90, 38, 25, 42, 88, 3, 75, 44, 71, 61], [90, 36, 14, 93, 21, 25, 23, 58, 5, 43, 65, 53, 93, 76, 93, 25, 48, 20, 73, 42, 28, 2, 92, 13, 24, 28, 20, 88, 53, 90, 52, 86, 33, 31, 39, 58, 19, 80, 54, 24, 19, 48, 11, 17, 41, 13, 63, 56, 48], [87, 89, 92, 89, 55, 51, 31, 4, 3, 3, 8, 39, 23, 32, 25, 74, 83, 66, 79, 54, 45, 97, 33, 22, 89, 1, 7, 91, 97, 2, 55, 18, 32, 69, 12, 71, 94, 85, 56, 47, 16, 27, 99, 80, 32, 15, 50, 79, 25]], [[-94, -78, -30, -16, -14, 22, 44, 44, 54, 60, 68, 72, 92, 94, 98], [-92, -68, -52, -40, -30, -28, -20, -16, 14, 38, 42, 54, 60, 72, 86], [-78, -68, -58, -36, -10, -10, 42, 48, 52, 52, 58, 68, 72, 78, 96], [-94, -86, -84, -60, -40, 0, 0, 22, 48, 56, 70, 72, 80, 90, 96], [-98, -92, -80, -68, -58, 38, 50, 52, 58, 60, 62, 62, 72, 86, 90], [-94, -92, -70, -64, -46, -38, -32, -14, -10, -6, 18, 30, 32, 74, 98], [-72, -60, -52, -50, -26, -24, -6, 4, 10, 40, 46, 86, 88, 98, 98], [-94, -72, -40, -36, -36, -28, 0, 18, 34, 36, 38, 44, 50, 54, 98], [-72, -60, -40, -38, -36, -26, -18, -8, -2, 2, 30, 34, 50, 76, 80], [-96, -74, -46, -38, -26, -16, -10, 2, 2, 20, 28, 48, 48, 60, 90], [-86, -60, -58, -58, -46, -40, -4, 2, 16, 18, 26, 62, 64, 78, 98], [-98, -50, -12, -10, -2, 12, 20, 40, 60, 66, 76, 78, 84, 90, 92], [-72, -68, -68, -52, -8, -6, 10, 20, 42, 52, 54, 56, 72, 86, 90], [-80, -74, -32, 10, 18, 54, 62, 74, 76, 78, 86, 86, 88, 94, 96], [-98, -78, -76, -72, -56, -30, -26, 0, 36, 42, 44, 76, 84, 88, 94]], [[0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1], [1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0], [1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0], [1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0], [1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0], [1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1], [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0], [0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1], [0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1], [1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1], [0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1], [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0], [1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0], [1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1], [0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0], [1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0], [0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1], [1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1], [1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0], [1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], [1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0], [0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1], [1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1], [1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1], [0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0]], [[2, 21, 39, 67, 70, 73, 83, 86, 87, 93], [31, 42, 53, 56, 64, 65, 85, 89, 94, 98], [3, 15, 17, 50, 52, 67, 73, 82, 91, 94], [12, 15, 16, 21, 23, 30, 33, 38, 50, 89], [5, 7, 25, 28, 38, 43, 43, 58, 64, 86], [24, 26, 29, 33, 46, 47, 52, 71, 86, 96], [7, 10, 23, 24, 36, 39, 47, 61, 77, 89], [1, 10, 26, 27, 61, 62, 64, 80, 85, 94], [3, 8, 16, 32, 37, 48, 54, 58, 77, 82], [43, 52, 70, 76, 81, 84, 84, 85, 95, 99]], [[62, -24, -62, -18, 46, 14, 90, -42, -98, -52, 36, 96, 26, -26, 38, -88, 88, -98, -86], [-24, 58, -70, -56, 68, -66, -24, 30, -86, -74, 98, -24, -48, -28, 24, -64, 22, 46, 40], [2, -30, -94, 6, -24, -42, -70, -20, -80, 14, 74, 72, -68, 58, 36, 40, 88, -80, 54], [-24, -50, -96, -36, 36, 30, -58, 64, 98, -86, -74, -18, -64, 74, -46, -24, 68, 34, 24], [-34, 96, 14, -50, -68, -72, -38, -52, 56, 4, 60, -90, -70, 16, -4, 0, -82, 2, -16], [22, 10, 54, -86, 14, 12, 64, -54, 92, 2, 88, 50, -24, -86, -32, 46, -66, -26, -90], [-22, 26, 44, 2, 70, -94, -78, 32, -30, -64, 90, -16, 68, -60, -10, -18, -64, 20, -18], [72, -14, -98, -54, 72, 18, 24, 4, -16, -26, 78, -80, 26, -10, 18, 20, 22, 68, 20], [-32, 74, 14, -18, 88, 42, 6, -6, -16, -30, 80, -16, 24, -96, -96, -52, -38, -34, -46], [-12, -72, -48, 52, -64, -30, 26, 64, 0, 34, 52, -66, 98, -96, -52, -96, 38, -56, -32], [-2, 18, -60, -52, -46, 62, -10, 82, -24, 34, 72, 50, -98, -96, 78, 86, 6, 32, -60], [-44, -52, -66, -46, 24, 80, -68, 92, -32, 26, -44, 30, 72, -56, -56, 28, -26, 22, -92], [82, -58, -60, -30, -68, -18, -72, 98, 92, -28, -30, 44, 78, 10, 54, 56, 2, -92, 24], [4, 96, -84, 68, 14, -86, 6, 22, -6, -60, 2, -38, -48, 48, -74, -52, -44, -68, -96], [46, 4, 16, 20, -12, 86, -56, 88, 8, -68, 56, 14, 2, -38, -20, -42, -64, 86, 30], [96, 68, -74, 14, 66, -20, 72, 60, 56, -78, -14, 2, 60, 16, -2, -90, -46, 24, 68], [-80, 40, 72, -88, -2, 12, -96, -34, -88, 94, 46, -62, 84, -68, 14, -62, -26, -94, -66], [24, -60, -30, -22, -42, -2, -52, 76, -16, 26, -82, 64, 88, 6, -42, -46, 36, 50, 98], [-30, -16, -80, -16, -42, -6, 60, -78, -94, -42, -20, 44, -78, 70, 48, -84, -52, -22, 46]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [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], [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], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[58, 85, 97, 21, 67, 89, 63, 21, 3, 59, 28, 4, 57, 94, 75, 40, 26, 76, 91, 6, 64, 58, 31, 26, 69, 56], [61, 73, 86, 49, 29, 98, 33, 19, 25, 73, 53, 43, 38, 38, 35, 8, 76, 31, 86, 93, 82, 13, 22, 28, 38, 88], [36, 22, 61, 11, 68, 82, 29, 74, 11, 31, 71, 46, 70, 47, 91, 56, 26, 34, 52, 41, 82, 3, 21, 59, 15, 3], [67, 75, 36, 39, 7, 71, 38, 63, 36, 73, 77, 63, 61, 19, 58, 96, 24, 71, 76, 5, 92, 80, 56, 51, 57, 11], [81, 94, 93, 62, 55, 71, 63, 25, 30, 12, 82, 98, 12, 57, 44, 59, 67, 18, 56, 20, 37, 80, 66, 57, 34, 64], [69, 90, 68, 50, 46, 79, 27, 12, 24, 37, 33, 24, 2, 33, 50, 3, 21, 20, 30, 30, 27, 8, 82, 99, 71, 83], [4, 52, 66, 74, 99, 99, 10, 51, 25, 84, 50, 37, 10, 56, 36, 42, 92, 89, 70, 67, 17, 89, 44, 63, 1, 34], [78, 19, 58, 40, 15, 68, 31, 14, 96, 72, 74, 34, 10, 64, 69, 91, 12, 65, 82, 30, 20, 76, 73, 22, 49, 65], [11, 46, 64, 46, 13, 96, 43, 95, 47, 18, 45, 16, 69, 36, 53, 50, 24, 68, 43, 91, 31, 48, 47, 1, 91, 44], [86, 37, 91, 17, 78, 5, 39, 37, 62, 68, 26, 91, 19, 64, 42, 55, 65, 56, 85, 33, 90, 70, 97, 51, 61, 42], [47, 84, 97, 98, 53, 58, 83, 86, 30, 42, 4, 72, 67, 32, 50, 37, 43, 92, 40, 6, 1, 98, 25, 16, 36, 18], [5, 15, 23, 78, 81, 92, 74, 55, 30, 59, 43, 27, 48, 24, 33, 90, 79, 61, 16, 76, 13, 75, 13, 91, 86, 97], [50, 81, 63, 53, 30, 92, 83, 19, 43, 90, 40, 66, 2, 92, 72, 35, 87, 11, 26, 55, 26, 92, 80, 79, 68, 73], [2, 55, 80, 76, 99, 98, 8, 31, 23, 87, 99, 75, 72, 45, 79, 70, 84, 36, 9, 78, 44, 45, 38, 96, 66, 39], [78, 28, 1, 62, 38, 69, 48, 57, 89, 60, 15, 7, 67, 99, 63, 37, 65, 27, 1, 8, 17, 15, 1, 39, 11, 49], [20, 70, 15, 29, 42, 31, 49, 87, 50, 11, 66, 55, 21, 35, 77, 7, 65, 3, 92, 86, 52, 36, 16, 55, 25, 59], [24, 90, 55, 67, 66, 96, 58, 49, 21, 1, 39, 30, 65, 55, 57, 64, 98, 27, 90, 65, 43, 26, 10, 77, 86, 9], [40, 44, 98, 40, 1, 40, 6, 30, 39, 41, 10, 55, 44, 38, 44, 86, 95, 80, 86, 41, 40, 94, 35, 46, 87, 36], [30, 21, 73, 92, 41, 17, 19, 71, 53, 19, 80, 65, 93, 1, 69, 48, 95, 54, 81, 52, 50, 72, 91, 9, 73, 74], [42, 87, 8, 31, 39, 47, 35, 29, 70, 42, 94, 53, 27, 53, 67, 51, 28, 86, 27, 77, 8, 84, 48, 34, 71, 2], [84, 68, 18, 85, 35, 63, 98, 68, 95, 24, 85, 10, 23, 88, 15, 70, 15, 46, 46, 52, 4, 72, 21, 75, 11, 21], [21, 1, 28, 27, 46, 61, 52, 56, 43, 9, 88, 19, 41, 40, 12, 90, 49, 56, 92, 65, 3, 46, 16, 46, 45, 64], [65, 27, 31, 4, 16, 63, 97, 48, 45, 39, 37, 7, 89, 99, 19, 93, 57, 16, 25, 43, 80, 27, 70, 63, 50, 69], [97, 69, 6, 27, 72, 96, 13, 62, 99, 28, 63, 5, 85, 45, 67, 97, 60, 65, 21, 24, 85, 46, 21, 6, 31, 19], [89, 76, 25, 93, 74, 3, 97, 44, 8, 25, 95, 57, 65, 17, 32, 72, 31, 85, 38, 53, 76, 1, 58, 41, 87, 76], [42, 30, 40, 72, 77, 45, 71, 43, 39, 3, 8, 52, 99, 92, 80, 1, 83, 60, 29, 93, 9, 96, 50, 73, 32, 92]]];
int [] param1 = [14, 28, 28, 48, 14, 19, 6, 11, 8, 25];
int [] param2 = [17, 27, 16, 37, 7, 20, 5, 18, 10, 14];
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_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [95, 3, 3, 10, 82, 1, 77, 11, 23, 61];
int [] param0 = [95, 48, 3, 10, 82, 1, 77, 99, 23, 61];
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_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [54, 41, 50, 4, 73, 79, 35, 43, 71, 45];
int [] param0 = [61, 45, 53, 4, 82, 86, 37, 48, 81, 50];
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);
}
|
SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [7, -1, 4, -1, -1, -1, -1, -1, -1, -1];
int [] [] param0 = [[8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3], [6, 90], [1, 2, 3, 4, 5, 4], [97, 35, 60, 96, 3, 67, 72, 95, 55, 9, 69, 28, 15, 91, 31, 59], [-84, -78, -74, -70, -68, -60, -56, -54, -48, -46, -28, -16, -6, 0, 0, 8, 8, 8, 12, 16, 26, 30, 32, 34, 36, 40, 46, 48, 70, 70, 72, 76, 78, 78, 80, 84, 84, 86], [1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1], [55, 64, 76, 79, 93, 96], [66, -90, 98, -50, 0, 46, 42, 64, -96, -80, -96, 20, -10, -84], [0, 0, 0, 0, 0, 0, 1], [94, 4, 34, 87, 32, 3, 92, 68, 57, 76, 24, 33, 3, 4, 30, 70, 49, 30, 72, 82, 16, 53, 6, 24, 92, 96, 89, 28, 21, 8, 36, 9, 40, 85, 51, 1, 63, 68, 74, 26, 40, 3, 9, 32, 67, 4, 6, 73]];
int [] param1 = [12, 1, 6, 15, 22, 5, 4, 8, 6, 25];
int [] param2 = [3, 1, 5, 9, 31, 7, 4, 13, 5, 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);
}
|
DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [9, 9, 33, 2, 6, 64, 53, 53, 71, 9];
int [] param0 = [19, 23, 92, 9, 20, 68, 66, 77, 90, 26];
int [] param1 = [14, 51, 10, 50, 67, 25, 30, 22, 1, 34];
int [] param2 = [34, 5, 24, 34, 20, 40, 24, 32, 71, 54];
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);
}
|
DOUBLE_FACTORIAL_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 8, 105, 3840, 135135, 10321920, 654729075];
int [] param0 = [1, 4, 7, 10, 13, 16, 19];
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);
}
|
EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 6, 14, 5, -1, -1, -1, -1, 21, -1];
int [] [] param0 = [[5, 4, 5, 6, 5, 4, 3, 2], [5, 4, 5, 6, 5, 4, 3, 2], [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], [50, 51, 52, 51, 50, 49, 48], [-86, -68, -32, -6, 6, 10, 30, 34, 58, 92], [1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0], [58], [-64, 78, 58, 36, 48, 80, -80, 74, -98, 46, -48, 24, 80, 72, 90, -46, 14, 68, 38, 58, -54, 80, 44, -62, 34, -28, 92, 84, 90, 44, -26, 88, 18, 22, -32, 54, 58, 92], [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], [5]];
int [] param1 = [29, 19, 37, 17, 6, 27, 0, 24, 35, 0];
int [] param2 = [6, 3, 1, 49, 6, 22, 0, 34, 1, 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);
}
|
N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1324, 109, 703, 1333, 28, 55, 406, 46, 118, 523];
int [] param0 = [93, 10, 55, 94, 2, 5, 37, 4, 11, 46];
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_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [1792, 6, 80, 240, 28160, 11520, 24, 672, 159744, 4608];
int [] param0 = [7, 2, 4, 5, 10, 9, 3, 6, 12, 8];
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_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [852, 240, 0, 734, 0, 2, 377, 122, 1, 1024];
int [] [] param0 = [[4, 8, 10, 10, 16, 23, 33, 36, 43, 47, 50, 55, 56, 72, 84, 85, 86, 86, 88, 90, 92, 99], [48, -22, 84, 76, 50, -14, -82, 28, 86, -50, -40, 10, 48, 20, -48, -84, -64, -48, -32, -84, -32, 10, 42, -10, -68, -16, -94, -76, 42, -96, 16, -64, 60, 8, -88, -62, 82, -24, -28, 40, 18, 8], [0, 0, 0, 1], [74, 64, 93, 72, 75, 90, 46, 72, 91, 98, 57, 58, 76, 29, 88, 3, 86, 1, 78, 74, 56, 54, 57, 3, 94, 2, 14, 32, 67, 62, 1, 30, 78, 95, 40], [-94, -88, -68, -24, 60, 94], [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0], [3, 7, 12, 15, 17, 23, 31, 31, 32, 37, 41, 54, 57, 60, 62, 62, 64, 70, 71, 74, 75, 83, 97, 98], [-2, 26, -74, 96, -70, 56, 92, -74, -38, -18, 36, 44, -10, -26, 26, -22, -58, 78, 86, 22, 76, 50, 88, -86, -80, -36, -48, 90, -34, 62, 46, -56, -32], [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], [86, 30, 87, 99, 8, 1, 24, 46, 12, 21, 43, 73, 28, 3, 35, 49, 14, 37, 63, 98, 65, 43, 86, 69, 27, 60, 45, 88, 25, 86, 11, 9, 86, 73, 40, 70, 49, 50, 95, 69, 94]];
int [] [] param1 = [[8, 26, 30, 35, 45, 47, 55, 56, 59, 61, 64, 66, 67, 69, 73, 77, 78, 81, 82, 85, 86, 99], [82, 94, 34, 12, 18, -68, 14, -16, -30, -16, 6, 74, -68, 76, -76, 52, -32, -38, 78, 64, -60, -46, 82, -60, 98, -70, -52, -96, -6, -44, 66, -66, 22, -42, -66, 4, -2, -48, -94, 72, 56, 88], [0, 0, 1, 1], [9, 50, 22, 60, 36, 46, 76, 48, 90, 64, 16, 24, 41, 12, 36, 36, 93, 52, 26, 38, 68, 5, 55, 19, 35, 5, 7, 96, 67, 64, 24, 85, 6, 33, 7], [-80, -72, -60, -42, -24, -6], [1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0], [3, 10, 10, 12, 12, 14, 15, 19, 19, 20, 25, 27, 27, 28, 40, 41, 50, 51, 53, 57, 60, 65, 75, 99], [76, 42, 0, 4, -96, -24, -50, -54, 26, -8, -38, -46, 42, -50, 16, -2, -6, 2, -8, 56, 64, -58, -96, 2, -64, -66, -14, 58, -76, -26, 78, -96, 48], [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], [27, 66, 77, 34, 98, 75, 43, 27, 79, 32, 54, 40, 29, 47, 63, 15, 23, 33, 59, 76, 27, 31, 92, 43, 12, 20, 97, 67, 11, 12, 83, 79, 52, 46, 51, 36, 87, 96, 90, 6, 62]];
int [] param2 = [20, 30, 2, 20, 4, 22, 22, 17, 39, 34];
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);
}
|
DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [4, 2, 2, 5, 0, 5, 2, 5, 3, 4];
char [] [] param0 = [['t', 't', 'f', 't'], ['t', 'f', 't'], ['t', 'f', 'f'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't'], ['t', 't', 'f', 't']];
char [] [] param1 = [['|', '&', '^'], ['^', '&'], ['^', '|'], ['|', '|', '|'], ['&', '&', '&'], ['&', '&', '^'], ['^', '&', '|'], ['^', '^', '^'], ['^', '|', '|'], ['|', '^', '|']];
int [] param2 = [4, 3, 3, 4, 4, 4, 4, 4, 4, 4];
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_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES
|
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 = [8, 400, 1, 61, 60, 88, 60, 26, 33, 70];
int [] param1 = [4, 1, 400, 40, 49, 10, 79, 88, 65, 57];
int [] param2 = [2, 10, 10, 2, 68, 69, 92, 75, 57, 77];
int [] param3 = [6, 74, 74, 50, 77, 71, 29, 84, 21, 52];
int [] param4 = [0, 38, 38, 0, 71, 26, 38, 10, 61, 87];
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);
}
|
NUMBER_SUBSEQUENCES_FORM_AI_BJ_CK
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 3, 7, 1, 0, 0, 111, 0, 0, 0];
string [] param0 = ["", "abbc", "abcabc", "agsdbkfdc ", "ababab", "aaaaaaa", "aabaaabcc", "19", "1001100", "dtanuqbu"];
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_REPETITIVE_ELEMENT_1_N_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [287, -575, -115, 1705, -407, -366, 1132, -56, -446, 753];
int [] [] param0 = [[4, 8, 27, 34, 39, 42, 43, 54, 72], [-38, -66, -38, -48, -96, 74, -32, -62, -34, -32, -88, -12, -8, -4], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [88, 86, 23, 81, 76, 16, 94, 64, 59, 50, 71, 62, 10, 89, 73, 64, 65, 96, 83, 40, 99, 40, 77, 33, 14, 62, 6, 89, 74, 96, 93, 29, 15, 93, 9, 58, 98, 76, 23, 23, 70, 99], [-96, -94, -82, -64, -56, -40, -36, -34, -32, -24, -24, -22, -20, -20, -20, -18, -18, -12, -10, -6, 16, 20, 20, 22, 26, 30, 36, 46, 46, 50, 50, 52, 64, 64, 64, 68, 72, 74, 76, 92, 96, 98], [0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1], [2, 6, 7, 13, 19, 23, 37, 39, 42, 42, 43, 45, 52, 53, 55, 56, 59, 63, 66, 71, 76, 85, 86, 89, 92, 94, 96, 99], [52, -56, -12, 78, 6, 32, 0, 36, 34, -54, -74, -32], [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], [10, 42, 50, 5, 74, 81, 30, 76, 6, 34, 86, 4, 77, 71, 96, 22, 34, 50, 35, 16, 60, 11, 21, 38]];
int [] param1 = [9, 14, 16, 42, 42, 28, 28, 12, 31, 24];
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);
}
|
SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [4, 6, 0, 330, 0, 0, 0, 0, 0, 0];
int [] param0 = [10, 5, 2, 83, 91, 18, 83, 98, 43, 31];
int [] param1 = [4, 2, 8, 7, 0, 53, 41, 53, 37, 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);
}
|
FRIENDS_PAIRING_PROBLEM
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [10349536, 568504, 35696, 764, 76, 4, 1];
int [] param0 = [15, 13, 11, 8, 6, 3, 1];
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);
}
|
POSSIBLE_TO_MAKE_A_DIVISIBLE_BY_3_NUMBER_USING_ALL_DIGITS_IN_AN_ARRAY
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, true, true, true, false, false, false, false, false];
int [] [] param0 = [[2, 4, 9, 11, 12, 15, 16, 19, 21, 21, 23, 23, 24, 30, 31, 31, 32, 34, 37, 41, 41, 43, 45, 46, 47, 54, 58, 60, 62, 66, 66, 74, 74, 75, 75, 77, 77, 85, 89, 90, 92, 92, 93, 95, 98], [0, 66, 92, 24, -8, 88, -92, 86, 80, 82, 42, -20, -56, -2, -84, 32], [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, 1], [99, 83, 11, 99, 80, 76, 32, 12, 94, 66, 76], [-88, -84, -80, -80, -80, -80, -72, -68, -64, -62, -60, -52, -48, -44, -36, -24, -20, -18, -14, -8, -6, -6, -4, 6, 10, 14, 18, 24, 26, 26, 50, 50, 52, 60, 76, 90, 96, 98], [0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1], [6, 6, 8, 8, 10, 24, 24, 26, 27, 30, 34, 34, 36, 36, 39, 40, 41, 44, 45, 50, 52, 53, 57, 62, 64, 64, 70, 71, 72, 78, 78, 79, 80, 82, 89, 95, 96], [-28, -84, -14, -20, -14, -26, 28, -66, 48, 82, -46, -10, -94, 76, 56, -6, 72, -92, -32, 66, 50, -72, 64, 12, 48, 88, -36, -12, -6, -18, -36, -34, 44, 40, -54], [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], [17, 47, 89, 75, 57, 69, 70, 57, 83, 79, 57, 49]];
int [] param1 = [30, 14, 29, 5, 19, 14, 28, 25, 19, 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);
}
|
NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 2, 3, 2, 2, 2, 2, 2, 3, 2];
int [] param0 = [35, 85, 22, 8, 12, 58, 65, 10, 23, 5];
int [] param1 = [8, 55, 23, 43, 64, 25, 4, 95, 13, 50];
int [] param2 = [77, 33, 64, 29, 11, 26, 28, 55, 54, 71];
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);
}
|
MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [48, 6, 58, 1, 43, 1, 19, 19, 34, 25];
long [] param0 = [60, 46, 4, 67, 93, 89, 8, 53, 96, 38];
long [] param1 = [24, 43, 50, 1, 35, 97, 78, 73, 92, 64];
long [] param2 = [58, 29, 71, 66, 73, 8, 55, 22, 83, 83];
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_SUBARRAY_SUM_USING_PREFIX_SUM
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [633, 114, 8, 999, -24, 7, 811, 204, 0, 1971];
int [] [] param0 = [[8, 9, 11, 17, 18, 19, 23, 24, 27, 30, 31, 31, 35, 44, 46, 47, 49, 51, 55, 58, 59, 61, 65, 67, 71, 71, 71, 71, 78, 78, 82, 91, 98], [-82, -28, -66, -52, -36, 36, -88, 52, -62, 46, 42, 26, -60, 18, -52, 38, 94, -68, 44, -94, 14, 36, -70], [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], [28, 36, 42, 42, 5, 52, 74, 86, 55, 82, 59, 81, 4, 90, 24, 34, 20, 99, 86, 25, 52, 48, 62, 5, 67, 83, 60, 72, 80, 73, 38, 55, 8, 70, 95], [-92, -52, -24, 36, 56], [0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0], [1, 1, 4, 4, 7, 7, 17, 18, 20, 26, 26, 32, 37, 38, 42, 44, 44, 46, 50, 53, 57, 58, 58, 60, 61, 61, 64, 74, 75, 77, 83, 83, 84, 84, 85, 87, 88, 90, 95, 96, 97, 98, 99, 99], [-86, 2, 26, 54, -16, 16, 48, 24, 50, -10, -32, -62, 48, -12, -66], [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], [58, 14, 79, 11, 31, 28, 61, 86, 25, 27, 75, 78, 32, 55, 86, 48, 15, 51, 6, 78, 23, 82, 16, 62, 35, 51, 91, 16, 79, 38, 97, 30, 23, 58, 95, 57, 82, 35, 57, 43, 22, 41, 58, 69, 25, 65, 13, 79]];
int [] param1 = [20, 15, 19, 19, 3, 13, 25, 13, 14, 39];
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_BITONIC_SUBARRAY
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [315, 230, 1, 228, 312, 1, 610, 68, 1, 13];
int [] [] param0 = [[7, 12, 16, 23, 26, 27, 39, 39, 40, 44, 57, 58, 77, 78, 81, 82, 84, 86, 91, 94, 94, 95, 97], [72, 38, -60, 98, -52, -38, -2, 94, 34, 56, 90, 46, 6, -2, 30, -96, -76, -96, -76, 32, 68, 64, -32, -4, 72, -62, 58, 20, -84, 0, -96, 70, -22, -56, 70, -74, -90, -86, -14, 82, -90, 40, -64, 94], [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], [69, 31, 85, 84, 28, 28], [-80, -74, -24, -22, -22, 4, 20, 28, 30, 32, 36, 58, 58, 68, 92, 94, 98], [1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1], [2, 2, 2, 4, 6, 7, 8, 10, 15, 17, 19, 20, 21, 27, 28, 29, 32, 32, 40, 44, 46, 47, 49, 50, 50, 52, 55, 56, 58, 59, 64, 69, 73, 74, 74, 77, 80, 80, 84, 89, 91, 95, 96, 96, 97, 98, 98, 99], [26, -86, 8, 64, -40, 64, 60, -16, 54, -42, -86, 14, -48, -20, -42, -4, -34, -52, -74, 22, 10], [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], [8, 5, 5, 56, 5, 38]];
int [] param1 = [13, 37, 33, 5, 16, 10, 46, 18, 27, 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);
}
|
NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [44, 77, 103, 6, 56, 25, 78, 49, 86, 61];
int [] param0 = [42, 75, 94, 5, 52, 22, 77, 44, 85, 59];
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_ARRAY_SORTED_NOT_ITERATIVE_RECURSIVE_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, false, true, false, true, false, true, false];
int [] [] param0 = [[6, 8, 8, 16, 19, 19, 21, 23, 26, 33, 34, 36, 38, 39, 41, 41, 45, 47, 52, 52, 55, 57, 60, 60, 60, 61, 69, 69, 70, 70, 72, 73, 73, 75, 78, 81, 84, 84, 85, 88, 88, 89, 90, 91, 97], [2, -90, 66, 24, -18, 70, 34, 18, 84, -62], [1, 1], [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], [-38, 38, 40, 72], [1, 0, 0, 0, 1], [11, 15, 16, 17, 17, 17, 22, 23, 23, 25, 27, 28, 28, 31, 33, 36, 38, 40, 42, 44, 46, 49, 51, 51, 52, 60, 62, 65, 67, 71, 74, 77, 77, 78, 78, 79, 83, 83, 86, 86, 87, 87, 87, 88, 91, 92, 97, 97, 97], [-26, -90, -78, -76, -58, -64, -72, -34, -58, -48, 78, -50, -30, 26, -60, 26], [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], [56, 51, 63, 30, 10, 88, 23, 1, 48, 4, 28, 44]];
int [] param1 = [22, 9, 1, 23, 2, 3, 44, 9, 23, 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);
}
|
NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [47905, 30856, 47905, 34220, 4, 147440, 84, 560, 91881, 105995];
int [] param0 = [67, 58, 67, 60, 4, 97, 9, 16, 83, 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);
}
|
FIND_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [610, 7952, 0, 50904, 31016, 0, 2307, 492, 0, 0];
int [] [] param0 = [[7, 9, 22, 68], [24, 40, 98, 58, -24, 24, 76, 48, -92, -16, -46, -48, -70, 88, 66, 2, 44, 36, 34, 34, 46, 90, -80, -24, -58, 68, 72, -20, -62, -40], [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], [32, 15, 41, 41, 4, 42, 22, 33, 33, 11, 68, 5, 41, 80, 39, 15, 36, 75, 41, 11, 25, 40, 50, 19, 39, 12, 75, 28, 52, 20, 63, 5, 27, 53, 19, 62, 98, 72, 10, 90, 74, 93, 52, 81, 91, 65, 90, 93], [-94, -76, -68, -50, -28, -20, 18, 24, 30, 54, 74, 84, 98], [1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0], [14, 27, 43, 49], [78, -26, -12, 38, -90], [0, 1, 1, 1], [12, 69, 57, 7, 52, 14, 15, 83, 67, 57, 15, 86, 81, 43, 1, 64, 45, 68, 30, 23, 14, 70, 13, 51, 23, 33, 98, 68, 24, 43, 12, 82, 46]];
int [] [] param1 = [[14, 22, 54, 58], [30, -88, 6, -26, -76, 14, -80, -30, -58, 76, 40, -28, -54, 38, -60, -60, 88, -80, -22, 90, 50, -48, 68, -26, 26, -2, 68, -16, 88, -72], [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], [80, 18, 9, 29, 62, 89, 4, 40, 47, 15, 35, 82, 22, 97, 63, 54, 7, 58, 64, 73, 54, 79, 21, 21, 20, 19, 56, 42, 6, 97, 7, 34, 55, 35, 57, 86, 73, 88, 20, 29, 48, 52, 8, 77, 2, 12, 6, 47], [-88, -80, -78, -68, -44, -38, 42, 50, 62, 68, 70, 80, 92], [1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1], [51, 59, 76, 83], [14, 50, -6, -38, 80], [0, 0, 0, 1], [12, 48, 57, 40, 47, 36, 22, 50, 68, 98, 77, 78, 39, 55, 87, 75, 65, 27, 33, 27, 70, 34, 67, 71, 84, 33, 7, 61, 3, 9, 67, 92, 60]];
int [] param2 = [3, 22, 22, 30, 11, 21, 2, 3, 3, 17];
int [] param3 = [2, 22, 19, 25, 8, 33, 2, 2, 2, 32];
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);
}
|
FIND_THE_ELEMENT_THAT_APPEARS_ONCE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [72, -28, 1, 25, 104, 0, 10, 34, 0, 1];
int [] [] param0 = [[7, 26, 26, 48, 59, 62, 66, 70, 72, 75, 76, 81, 97, 98], [-42, -48, -64, -74, 56, -34, 20, 16, 34, -84, 86, 38, 56, -86, 30, -74, -96, 96, 12, 10, -46, 10, -36, 38, 34, -46, -20, 14, 12, 62, -54, 20, -82, 24, 96], [0, 0, 1, 1], [68, 91, 61, 6, 32, 47, 76, 69, 44, 71, 29, 79, 74, 33, 44, 33, 45, 75, 43, 82, 83, 81, 95, 16, 86, 33, 69, 61, 73, 21, 54, 17, 98, 62, 14, 72, 80, 31, 56, 82, 14, 48, 76], [-98, -96, -92, -62, -52, -42, -42, -26, 4, 10, 14, 38, 64, 66, 72, 74, 82], [0, 1, 1, 1, 0, 0, 0, 1, 0, 1], [53, 63, 63], [-96, -38, -26, -46, 68, -36, 20, -18, -10, 52, 40, 94, -8, -64, 82, -22], [0, 0, 0, 0, 0, 1, 1], [99, 46, 48, 81, 27, 97, 26, 50, 77, 32, 45, 99, 46]];
int [] param1 = [7, 27, 3, 38, 14, 5, 2, 15, 3, 12];
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_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [64, 32, 64, 64, 128, 128, 32, 64, 64, 32];
int [] param0 = [60, 20, 33, 34, 68, 79, 20, 41, 36, 17];
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_DIGITS_PRODUCT_TWO_NUMBERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [4, 4, 4, 4, 4, 3, 3, 4, 3, 4];
int [] param0 = [86, 81, 48, 64, 56, 5, 25, 94, 5, 46];
int [] param1 = [39, 87, 84, 80, 20, 70, 13, 83, 55, 46];
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);
}
|
TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [14307150, 715, 24310, 48620, 220, 1307504, 2002, 293930, 11440, 167960];
int [] param0 = [21, 4, 8, 9, 3, 15, 5, 12, 7, 11];
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);
}
|
RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [57, 93, 19, 27, 32, 41, 104, 27, 13, 57];
int [] param0 = [50, 83, 18, 24, 31, 38, 94, 24, 13, 53];
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);
}
|
PERMUTE_TWO_ARRAYS_SUM_EVERY_PAIR_GREATER_EQUAL_K
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, false, true, false, false, true, false, false, true];
int [] [] param0 = [[99, 97, 90, 88, 87, 70, 52, 52, 43, 40, 27, 25, 16, 12, 9], [94, 92, 92, 88, 74, 72, 70, 56, 42, 42, 30, 30, 20, 18, 14, 12, 10, 8, 6, -14, -26, -28, -42, -44, -48, -68, -74, -74, -76, -78, -80, -84, -86, -90, -90, -90, -92, -94, -96, -96, -98, -98], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0], [97, 77, 75, 72, 71, 70, 69, 65, 59, 55, 51, 48, 47, 42, 35, 31, 26, 18, 16, 15, 15, 13, 11, 6, 3, 2], [94, 92, 90, 90, 84, 84, 74, 72, 68, 58, 56, 56, 54, 52, 36, 32, 18, 18, 16, 16, 4, 2, -2, -4, -4, -20, -34, -40, -42, -46, -48, -52, -52, -52, -64, -66, -70, -72], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], [98, 96, 96, 94, 93, 92, 87, 82, 80, 80, 80, 79, 72, 72, 66, 66, 64, 58, 53, 48, 44, 37, 34, 32, 23, 21, 18, 17, 8], [94, 80, 78, 62, 52, 50, 32, 28, 24, 24, 22, 18, 18, 14, 14, 10, 10, -8, -14, -14, -16, -20, -22, -28, -38, -48, -50, -66, -78, -78, -80, -82, -88, -88, -98], [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, 0, 0, 0, 0, 0, 0, 0, 0, 0], [92, 91, 85, 75, 72, 67, 65, 58, 53, 45, 39, 33, 31, 13, 10, 10]];
int [] [] param1 = [[4, 7, 11, 20, 34, 35, 36, 44, 46, 71, 72, 78, 85, 85, 91], [-98, -86, -84, -80, -80, -78, -76, -76, -74, -72, -56, -50, -48, -44, -44, -42, -32, -32, -32, -22, -20, -18, -14, 8, 16, 16, 18, 24, 30, 40, 44, 50, 60, 62, 62, 68, 70, 76, 84, 94, 94, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [4, 11, 12, 12, 14, 15, 20, 21, 36, 37, 38, 44, 45, 46, 48, 51, 60, 62, 65, 73, 78, 79, 81, 88, 89, 98], [-94, -76, -74, -56, -54, -50, -46, -38, -26, -24, -24, -22, -16, -10, -6, -4, -4, 0, 0, 6, 12, 12, 18, 20, 38, 50, 52, 52, 54, 64, 64, 72, 72, 72, 76, 90, 96, 96], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [11, 15, 17, 19, 23, 23, 26, 27, 36, 43, 46, 47, 55, 59, 63, 66, 77, 79, 79, 82, 85, 86, 86, 91, 91, 94, 94, 97, 99], [-96, -82, -80, -80, -66, -54, -46, -44, -40, -30, -16, -14, 2, 6, 12, 20, 24, 32, 36, 38, 42, 46, 52, 56, 62, 66, 70, 88, 88, 90, 90, 96, 96, 98, 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, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [7, 12, 19, 21, 28, 34, 39, 40, 41, 69, 71, 71, 74, 78, 91, 92]];
int [] param2 = [10, 40, 11, 25, 26, 13, 20, 31, 31, 14];
int [] param3 = [7, 38, 15, 16, 30, 13, 14, 24, 30, 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);
}
|
SUM_FIBONACCI_NUMBERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [88, 12, 33, 2, 4, 609, 232, 143, 20, 7];
int [] param0 = [9, 5, 7, 2, 3, 13, 11, 10, 6, 4];
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);
}
|
GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, false, true, false, false, false, false, false];
int [] [] param0 = [[3, 8, 10, 15, 18, 19, 20, 20, 21, 22, 26, 30, 32, 34, 43, 45, 50, 50, 51, 52, 53, 56, 57, 58, 62, 63, 65, 82, 86, 91, 91, 92, 92, 93, 97], [30, -34, 86, -30, -26, 2, 90, 8, 26, -8, -8, 0, -86, 68, 22, 72, -76, 48, -24, 90, -22, -58, -54, 90, -12, -12, 88, 72, -58, 68, 84, 22, 60, 66, -52, -38, -90, 62, 30, -26, 88, -36, 92, 32, -32, -42, -90, -40, -10], [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], [20, 68, 40, 19, 74, 69], [-98, -94, -94, -94, -90, -88, -88, -78, -74, -70, -68, -66, -64, -62, -54, -50, -40, -40, -40, -40, -28, -22, -22, -18, -14, -12, 0, 6, 6, 8, 12, 20, 22, 26, 28, 36, 42, 44, 48, 52, 56, 60, 68, 84], [1, 1, 0], [12, 22, 38, 76, 80, 86], [-36, -10, -26, 34, -50, 66, -2, -14, -62, 60, -48, 94, -70, 6, -60, -90, 28, -4, -20, -52, 40, -76, -92, -14, 54, 4, -58, 38, -74, -96, -88, 86, -54, 98, 48, 68, 78, -28, -80, -46], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [69, 99, 25, 52, 41, 51, 7, 33, 42, 91, 85, 57, 91, 89, 86, 11, 70, 67, 30, 92, 81, 23, 51, 98, 85, 5, 50, 44]];
int [] param1 = [35, 49, 37, 6, 44, 3, 6, 40, 21, 28];
int [] param2 = [30, 10, 1, 88, 94, 60, 3, 37, 20, 27];
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);
}
|
PRODUCT_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [72, 15, 35, 0, 1, 1, 9, 0, 1, 1];
string [] param0 = ["(0(5(6()())(4()(9()())))(7(1()())(3()())))", "(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", "(0(5(6()())(4()(9()())))(7(1()())(3()())))", "(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", "(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", "(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))", "(0(5(6()())(4()(9()())))(7(1()())(3()())))", "(0(5(6()())(4()(9()())))(7(1()())(3()())))", "0010", "kjtdgmy"];
int [] param1 = [2, 3, 1, 2, 4, 100, 3, 0, 12, 97];
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_OF_SUBSTRINGS_WITH_ODD_DECIMAL_VALUE_IN_A_BINARY_STRING
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 1, 3, 0, 1, 15, 0, 0, 21, 0];
string [] param0 = ["ogiokjf", "517376", "11", "ze", "8763644247018", "00111010001", "hgwkbkuovu", "652", "101000011110", "kvdpg "];
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_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, false, true, false, true, false, false, false, true];
string [] param0 = ["zcoqhum", "7437725", "11", "buglvr", "9", "101101010110", "yguim", "8198", "11101", "huinqjxndbfp"];
int [] param1 = [2, 53, 30, 1, 92, 3, 18, 90, 71, 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);
}
|
FIND_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [536870912, 67108864, 8388608, 1048576, 131072, 16384, 2048, 256, 32, 4];
int [] param0 = [30, 27, 24, 21, 18, 15, 12, 9, 6, 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);
}
|
NEXT_POWER_OF_2_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [8, 128, 32, 64, 32, 2, 8, 128, 32, 8];
int [] param0 = [8, 79, 31, 63, 18, 2, 6, 85, 29, 8];
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_DISTANCE_TWO_OCCURRENCES_ELEMENT_ARRAY
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 30, 10, 0, 0, 28, 1, 0, 20, 0];
int [] [] param0 = [[1, 20, 25, 28, 29, 31, 34, 35, 38, 39, 41, 43, 46, 55, 56, 60, 65, 66, 74, 77, 79, 80, 81, 83, 84, 88, 88, 88, 90, 91, 99], [26, 14, 56, 84, -56, -84, -98, 12, -78, 18, -42, 58, 46, -66, -46, 66, 98, 34, -16, 8, -20, 66, 74, 26, 42, -84, 38, 86, 14, 86, 26, -42, -30, 6, -54, -76, -66, 18, 58, 66, 74, -62, 8, -42, 62, -14, -90, 98, -24], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [69, 87], [-98, -88, -86, -62, -52, -26, -24, -20, -12, 6, 8, 26, 36, 40, 42, 54, 68, 72, 84, 92, 94, 98, 98], [1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0], [11, 16, 17, 19, 20, 21, 21, 22, 27, 37, 45, 49, 64, 77, 81, 85, 96], [-20, 0, 18, -96], [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], [54, 5, 98, 71, 9, 34, 60, 28, 58, 66, 28, 45, 4]];
int [] param1 = [27, 34, 11, 1, 12, 29, 9, 2, 22, 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);
}
|
MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [19, 130, 661, 43, 778, 1096, 28, 479, 413, 51];
int [] [] param0 = [[3, 7, 27, 32, 36, 37, 44, 48, 50, 64, 86], [-22, 6, -20, 60, -74, 98, 52, -22], [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], [77, 11, 51, 11, 84, 79, 43, 12, 14, 50, 15, 6, 85, 32, 74, 49, 7, 2, 58], [-90, -66, -64, -58, -46, -44, -32, -30, -30, -22, -18, -14, 12, 12, 18, 34, 44, 60, 70, 70, 74, 76, 86, 98, 98], [1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1], [9, 22, 27, 27, 37, 53, 53, 56, 63, 73, 76, 81, 82], [-46, 60, 80, 80, 42, -98, 30, -48, 4, -32, -78, 40, 52, 26, 88, 4, 22, 62, 88, -94, 2, 0, 58, 38, 52, -50, -52, 58, -62, 30, -38, -8, -82, -66], [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], [42, 69, 93, 82, 8, 23, 73, 1, 77, 39, 49, 4, 95, 85]];
int [] param1 = [5, 5, 23, 9, 12, 36, 10, 18, 19, 12];
int [] param2 = [10, 4, 29, 17, 22, 31, 11, 19, 22, 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);
}
|
COUNT_DIGITS_FACTORIAL_SET_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [93, 4, 74, 44, 112, 14, 15, 149, 102, 139];
int [] param0 = [66, 7, 55, 37, 76, 16, 17, 95, 71, 90];
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_TIME_TO_FINISH_TASKS_WITHOUT_SKIPPING_TWO_CONSECUTIVE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [93, -834, 5, 359, -1152, 1, 28, -314, 1, 397];
int [] [] param0 = [[5, 17, 25, 27, 29, 30, 34, 49, 72, 75, 90, 93, 93, 94], [-70, -32, 62, 0, -10, 92, -94, -86, 52, 6, -26, -92, -10, 70, -82, 28, 86, 58, 86, -58, 84, -80, -18, -92, -34, 6, 34, 36, 70, -50, -6, -54, 84, 22, 30, -96, -84, 72, 2, 26, -20, 4, 48, -98, 62, -28, -68], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [34, 40, 92, 35, 29, 26, 12, 66, 7, 28, 86, 4, 35, 79, 1, 48, 41, 47, 15, 75, 45, 6, 3, 94, 39, 50, 20, 8, 58, 51, 83, 44, 53, 76, 19, 84, 68, 54, 36, 53], [-98, -98, -92, -92, -88, -82, -74, -70, -68, -68, -64, -60, -52, -52, -42, -42, -38, -36, -36, -34, -26, -24, -22, -12, -2, -2, 4, 6, 44, 44, 48, 54, 62, 62, 64, 74, 78, 82, 86, 86, 90, 90, 94], [1, 1, 0, 0, 1, 0, 0, 1, 1, 1], [9, 15, 19, 29, 30, 39, 40, 61], [92, 0, 46, 70, -60, -50, 58, -56, 8, -90, 84, 16, 40, -62, 50, 78, 26, -42, -40, 98, -52, 62, 16, -62, -76, -70, -60, 32, 4, -68, 52, -64, 70, 12, -10], [0, 0, 0, 1, 1, 1, 1], [32, 96, 63, 93, 53, 1, 22, 19, 50, 74, 6, 94, 81, 85, 4, 86, 88, 75, 94]];
int [] param1 = [8, 36, 21, 29, 36, 5, 4, 21, 5, 18];
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);
}
|
STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [false, false, false, false, false, false, false, true, false, false];
int [] [] param0 = [[2, 3, 3, 3, 4, 5, 6, 9, 18, 20, 35, 39, 39, 45, 50, 55, 57, 61, 63, 65, 72, 73, 77, 77, 78, 87, 88, 91, 93, 95, 98], [-86, 10, -8, 8, -24, -2, -84, -86, -54, 50, 56, -22, -8, -62, 0, -50, -32], [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], [3, 42, 88, 89, 41, 71, 67, 5, 84, 20, 75, 36, 34, 20, 31, 16, 86, 89, 53, 47, 57, 27, 47, 93, 59, 66, 40, 18, 69, 36, 98, 99, 81], [-98, -94, -94, -90, -88, -82, -80, -78, -78, -68, -58, -58, -52, -36, -30, -14, -12, -6, -2, -2, 2, 4, 10, 14, 22, 24, 26, 38, 38, 46, 46, 48, 50, 54, 58, 60, 64, 64, 66, 70, 74, 74, 86, 88, 96, 96], [1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [19, 37, 44, 65, 72, 87], [88], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [5, 8, 53, 60, 85, 94, 77, 53, 81, 54, 67, 48, 56, 49, 16, 1, 85, 6, 55, 98, 62, 36, 4, 7, 64]];
int [] [] param1 = [[2, 5, 7, 13, 16, 23, 24, 25, 27, 31, 31, 33, 34, 35, 38, 46, 49, 49, 51, 52, 58, 61, 62, 66, 68, 71, 73, 78, 91, 94, 98], [-8, -46, 22, -66, -94, -96, 70, 58, -4, -70, -96, 34, -80, -26, -52, 52, -76], [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], [16, 61, 39, 99, 71, 73, 35, 47, 62, 80, 1, 49, 54, 35, 39, 55, 7, 6, 85, 84, 11, 51, 38, 4, 72, 10, 33, 65, 64, 32, 16, 99, 9], [-92, -92, -80, -72, -72, -72, -70, -68, -64, -56, -40, -38, -34, -24, -10, -8, -8, -2, 0, 2, 4, 6, 14, 14, 18, 20, 34, 36, 36, 38, 38, 42, 48, 56, 64, 70, 72, 76, 76, 76, 76, 78, 84, 90, 94, 96], [0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0], [17, 31, 39, 46, 56, 88], [-30], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [69, 37, 32, 5, 84, 14, 25, 9, 86, 85, 30, 82, 99, 92, 32, 43, 79, 58, 75, 90, 49, 54, 95, 76, 80]];
int [] param2 = [23, 16, 21, 19, 27, 19, 4, 0, 13, 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);
}
|
COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [22, 33, 47, 34, 22, 90, 46, 44, 14, 60];
int [] param0 = [1, 6, 75, 51, 19, 82, 72, 48, 12, 41];
int [] param1 = [44, 61, 20, 17, 25, 98, 21, 41, 17, 80];
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_PAIRS_N_B_N_GCD_B_B
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [52, 326, 170, 231, 267, 74, 52, 300, 66, 103];
int [] param0 = [17, 72, 43, 55, 62, 22, 17, 68, 20, 29];
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);
}
|
ADD_1_TO_A_GIVEN_NUMBER_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [21, 69, 53, 62, 4, 89, 42, 79, 95, 19];
int [] param0 = [20, 68, 52, 61, 3, 88, 41, 78, 94, 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);
}
|
C_PROGRAM_FACTORIAL_NUMBER
|
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);
}
|
COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 7, 81, 10609, 181997601];
int [] param0 = [2, 4, 8, 16, 32];
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_REPETITIVE_ELEMENT_1_N_1_2
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [52, 46, 1, 28, -32, 16, 25, 103, 21, 9];
int [] [] param0 = [[2, 2, 4, 5, 5, 7, 7, 7, 8, 11, 14, 15, 18, 19, 20, 25, 25, 29, 29, 31, 32, 32, 33, 38, 42, 48, 52, 55, 60, 61, 63, 71, 74, 78, 82, 82, 84, 84, 87, 87, 88, 90, 93, 94, 94], [46, 2, 62, 60, 92, 4, 26, 66, 66, 90, 26, -14, 76, -20, -68], [0, 0, 0, 1, 1, 1, 1, 1], [87, 67, 11, 47, 64, 81, 94, 75, 58, 77, 18, 2, 85, 26, 6, 44, 55, 19, 46, 49, 5, 69, 44, 12, 42, 66, 46, 9, 26, 49, 68, 95, 6, 9, 11, 72, 5, 67], [-98, -94, -92, -82, -78, -64, -62, -58, -52, -44, -40, -38, -8, 6, 10, 20, 22, 28, 30, 30, 36, 54, 54, 58, 64, 68, 76, 78, 84, 88, 90, 94, 96], [1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1], [1, 14, 15, 15, 21, 34, 38, 39, 41, 50, 60, 74, 96, 97], [96, -12, -16, -52], [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], [66, 21, 21, 59, 78, 8, 46, 41, 16, 32, 97, 93, 32, 86, 91, 61, 67, 61, 97, 49, 66, 35, 24, 35, 65, 45, 83]];
int [] param1 = [31, 8, 4, 34, 29, 17, 7, 3, 21, 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_REPEATED_SUBSEQUENCE_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
string [] results = ["x", "7733007", "0000111111", "", "", "10", "", "", "0000010", ""];
string [] param0 = ["qnqxjorx", "27473733400077", "000010111111", "tnvwgrwslu", "9537", "1100", "lycoiqfzn", "52", "00100001100", "rkxe"];
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_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, true, false, false, true, false, false, true, false];
int [] [] param0 = [[7, 10, 10, 10, 13, 17, 23, 24, 25, 28, 30, 33, 37, 49, 49, 50, 57, 60, 60, 63, 63, 64, 65, 65, 72, 81, 84, 85, 85, 94, 96], [-94, -94, -92, -92, -90, -88, -86, -80, -76, -76, -68, -62, -58, -56, -54, -50, -42, -42, -20, -18, -18, -14, -8, -2, 0, 0, 0, 2, 6, 8, 8, 12, 18, 18, 30, 44, 44, 56, 56, 56, 58, 62, 62, 62, 74, 82, 86, 94], [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], [9, 10, 12, 12, 19, 20, 24, 26, 26, 30, 32, 36, 38, 45, 46, 51, 51, 52, 55, 56, 57, 57, 64, 65, 68, 80, 80, 82, 85, 86, 90, 92, 93, 94], [-98, -90, -86, -86, -84, -84, -82, -80, -78, -72, -70, -68, -66, -64, -52, -52, -50, -38, -28, -26, -24, -14, -8, 16, 26, 26, 28, 34, 36, 40, 42, 44, 44, 46, 50, 60, 68, 78, 80, 86, 90, 92, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [6, 8, 11, 13, 14, 26, 26, 41, 48, 70, 82, 83, 84, 88, 96], [-94, -90, -88, -84, -62, -54, -50, -46, -38, -16, 0, 2, 2, 4, 14, 16, 18, 18, 26, 26, 30, 32, 48, 50, 62, 64, 68, 70, 76, 76, 76, 80, 80, 88, 90, 92, 94, 98], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [5, 7, 8, 13, 19, 26, 27, 27, 33, 38, 43, 44, 54, 54, 55, 59, 64, 65, 66, 68, 70, 77, 84, 92, 97]];
int [] [] param1 = [[10, 13, 17, 63], [-18, 12, 44], [0, 0, 0], [2, 32, 58, 80], [-99, -90, -90, -86], [0, 0, 1, 1], [1, 9, 12, 16], [-76, -54, 4, 78], [0, 0, 1, 1], [5, 9, 13, 93]];
int [] param2 = [31, 48, 44, 34, 43, 18, 15, 38, 12, 25];
int [] param3 = [4, 3, 3, 4, 4, 4, 4, 4, 4, 4];
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);
}
|
NUMBER_N_DIGIT_STEPPING_NUMBERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [17, 116, 424, 2986, 61, 1556, 32, 5721, 10982, 222];
int [] param0 = [2, 5, 7, 10, 4, 9, 3, 11, 12, 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);
}
|
GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 0, 0, 0, 4, 0, 1, 0, 0, 0];
int [] [] param0 = [[24, 54], [68, -30, -18, -6, 70, -40, 86, 98, -24, -48], [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], [84, 44, 40, 45, 2, 41, 52, 17, 50, 41, 5, 52, 48, 90, 13, 55, 34, 55, 94, 44, 41, 2], [-92, -76, -74, -72, -68, -64, -58, -44, -44, -38, -26, -24, -20, -12, -8, -8, -4, 10, 10, 10, 20, 20, 26, 26, 28, 50, 52, 54, 60, 66, 72, 74, 78, 78, 78, 80, 86, 88], [1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1], [5, 5, 15, 19, 22, 24, 26, 27, 28, 32, 37, 39, 40, 43, 49, 52, 55, 56, 58, 58, 59, 62, 67, 68, 77, 79, 79, 80, 81, 87, 95, 95, 96, 98, 98], [-98, 28, 54, 44, -98, -70, 48, -98, 56, 4, -18, 26, -8, -58, 30, 82, 4, -38, 42, 64, -28], [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], [26, 72, 74, 86, 98, 86, 22, 6, 95, 36, 11, 82, 34, 3, 50, 36, 81, 94, 55, 30, 62, 53, 50, 95, 32, 83, 9, 16]];
int [] param1 = [1, 8, 33, 18, 29, 19, 28, 17, 24, 19];
int [] param2 = [1, 8, 28, 16, 30, 10, 34, 14, 24, 16];
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);
}
|
ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [33, 14, 7, 4, 64, 1, 14, 26, 1, 1];
int [] [] param0 = [[2, 5, 5, 9, 10, 10, 11, 14, 23, 27, 31, 32, 33, 33, 33, 37, 39, 41, 41, 42, 42, 43, 47, 60, 61, 68, 73, 73, 73, 78, 80, 80, 82, 83, 86, 87, 89, 92, 94, 98], [80, -58, 64, 48, -16, 60, -50, -52, 62, -86, -96, 52, 26, -30, 14], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1], [90, 23, 43, 42, 7, 71, 79], [-96, -96, -90, -84, -68, -64, -56, -56, -50, -50, -48, -46, -28, -18, 0, 0, 6, 32, 32, 34, 42, 42, 46, 50, 50, 52, 64, 64, 70, 76, 84, 88], [1, 1, 1], [2, 9, 15, 19, 26, 29, 42, 45, 46, 47, 55, 60, 60, 61, 62, 64, 68, 69, 74, 79, 96], [-32, 12, 80, 42, 80, 8, 58, -76, -42, -98, 22, -90, -16, -4, -62, -32, 28, 12, 78, -52, -84, 78, 88, -76, -52, 68, -34, -16, -4, 2, -78, -94, -22, 34, 6, -62, 72], [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], [52, 19]];
int [] param1 = [33, 14, 7, 4, 28, 1, 14, 26, 26, 1];
int [] param2 = [37, 13, 6, 4, 21, 2, 17, 31, 14, 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);
}
|
PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
float [] results = [226045593884.95786, -39040194699.58562, 2931270907.5877957, -15863477478.565292, 340504220608.1437, -23882990818.874195, 45359252560.89365, -7495479637.450533, 610364933.1115178, -92632540179.42117];
float [] param0 = [8448.900678262902, -1849.728957491451, 412.667844022232, -5954.835911765373, 8437.913444665008, -7183.181663518317, 2340.7905920227954, -7281.157547371143, 471.3930826982504, -7550.426360065503];
float [] param1 = [8135.461799983198, -4240.89241631363, 9798.083992381831, -661.8872499003203, 8182.675681595904, -6846.746446198541, 5479.00956987109, -615.8705455524116, 1357.3753126091392, -2693.2262997056355];
float [] param2 = [6577.239053611328, -9953.518310747193, 1449.9204200270522, -8049.6051526695055, 9863.296545513396, -971.2199894221352, 7073.449591910562, -3343.0245192607968, 1907.815700915636, -9110.64755244532];
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_COST_CUT_BOARD_SQUARES
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [87730, -1800, 119, 21597, -28058, 341, 243, -41332, 7, 4707];
int [] [] param0 = [[98, 97, 93, 90, 90, 87, 87, 87, 83, 77, 75, 73, 70, 70, 69, 67, 67, 61, 60, 59, 58, 58, 56, 53, 52, 46, 46, 44, 40, 37, 34, 33, 33, 33, 32, 28, 26, 25, 25, 23, 22, 22, 20, 18, 16, 9, 9, 1], [78, 66, 66, 52, -4, -52, -72, -74], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [97, 96, 89, 87, 83, 78, 77, 76, 67, 66, 63, 58, 54, 52, 48, 44, 38, 37, 28, 28, 19, 2], [96, 90, 86, 78, 70, 32, 26, 26, 20, 16, 14, -2, -2, -4, -8, -10, -34, -44, -58, -60, -62, -62, -68, -72, -76, -78, -84], [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], [75, 30], [96, 78, 74, 70, 70, 62, 60, 58, 50, 46, 44, 40, 38, 38, 36, 32, 24, 22, 16, 14, 10, 0, -8, -10, -10, -18, -20, -36, -52, -54, -56, -56, -60, -60, -68, -82, -96], [1, 0, 0, 0], [90, 81, 81, 74, 67, 40, 29, 25, 24, 13, 10]];
int [] [] param1 = [[99, 97, 96, 95, 92, 91, 88, 87, 86, 77, 74, 73, 73, 72, 71, 70, 70, 67, 63, 62, 60, 59, 56, 55, 55, 55, 50, 47, 45, 39, 39, 37, 35, 30, 30, 29, 27, 25, 23, 20, 19, 17, 16, 13, 10, 9, 3, 2], [88, 84, 72, 30, -34, -40, -76, -78], [1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [94, 92, 91, 83, 79, 75, 75, 72, 63, 63, 47, 40, 37, 36, 36, 33, 33, 29, 26, 19, 9, 5], [98, 92, 78, 66, 64, 50, 48, 42, 36, 26, 16, 16, 0, -4, -10, -18, -24, -32, -32, -48, -60, -62, -76, -82, -86, -98, -98], [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], [39, 10], [94, 92, 92, 90, 86, 80, 78, 70, 64, 62, 46, 46, 40, 40, 32, 6, 4, -6, -14, -18, -20, -22, -24, -28, -34, -42, -50, -56, -62, -66, -76, -86, -86, -90, -92, -94, -96], [1, 1, 1, 0], [75, 74, 58, 53, 51, 49, 45, 25, 23, 14, 7]];
int [] param2 = [48, 8, 24, 22, 27, 29, 2, 37, 4, 11];
int [] param3 = [48, 8, 24, 22, 27, 29, 2, 37, 4, 11];
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);
}
|
CHECK_GIVEN_STRING_ROTATION_PALINDROME
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, false, true, false, false, false, true, false, false, false];
string [] param0 = ["aadaa", "2674377254", "11", "0011000", "26382426486138", "111010111010", "abccba", "5191", "1110101101", "abcdecbe"];
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);
}
|
MEDIAN_OF_TWO_SORTED_ARRAYS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [39, 22, 0, 84, -12, 0, 56, 94, 0, 67];
int [] [] param0 = [[2, 6, 18, 21, 23, 27, 44, 44, 69, 72, 78, 88, 90, 98], [90, 54, 24, -10, -84, -74, 58, 96, -28, -92, -18, 90, 70, -60, 72, 78, 10, 42, -2, -18, -38, -16, 18, -86, 40, -46, -38, 66, 20, -16, 48], [0, 1, 1], [53, 17, 94, 21, 16, 75, 67, 51, 44, 71, 65, 82], [-96, -92, -80, -68, -64, -64, -60, -56, -52, -50, -50, -22, -20, -4, -2, 0, 6, 20, 22, 28, 38, 40, 48, 50, 56, 58, 64, 64, 80, 82, 90, 92, 92, 92], [0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1], [8, 15, 17, 19, 21, 32, 34, 38, 41, 41, 49, 49, 51, 54, 54, 56, 56, 57, 59, 63, 70, 74, 79, 79, 84, 84, 86, 88, 89, 93, 98], [96, -42, -94, -46, -68, 76, 8, 16, -54, -94, 76, 24, 94, 10, 34, 78, -30, 0, -52, 80, 98, -58, 92, 12, 26, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [61, 69, 66, 3]];
int [] [] param1 = [[6, 12, 16, 18, 26, 34, 48, 48, 49, 56, 61, 79, 81, 89], [-72, -62, 14, -58, 70, 54, 88, -40, -94, 4, 60, -16, -38, -98, -70, -46, 66, 42, 26, 36, 56, -4, 32, 30, -46, -42, -72, 44, 16, 4, 24], [0, 1, 1], [98, 50, 8, 11, 80, 41, 59, 24, 94, 41, 75, 78], [-88, -72, -72, -58, -54, -50, -48, -34, -24, -14, -14, -14, -10, -6, 4, 12, 16, 18, 26, 30, 32, 34, 40, 46, 52, 54, 58, 62, 62, 72, 82, 82, 92, 98], [1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1], [5, 6, 17, 18, 22, 29, 32, 33, 36, 44, 45, 47, 59, 59, 60, 65, 67, 68, 69, 71, 72, 76, 78, 81, 84, 85, 85, 86, 86, 87, 92], [88, 78, -26, 10, 84, 34, 56, -8, -30, 46, 48, 20, 26, -78, 96, 44, 92, -44, -86, 24, -58, -96, -86, -12, -98, 18], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [39, 84, 97, 15]];
int [] param2 = [12, 16, 2, 10, 25, 40, 29, 17, 17, 3];
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_DIGIT_RAISED_POWER_B
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 9, 6, 0, 0, 0, 5, 2, 0, 0];
int [] param0 = [11, 41, 5, 1, 24, 5, 66, 7, 77, 60];
int [] param1 = [2, 3, 4, 2, 1, 2, 5, 10, 2, 2];
int [] param2 = [1, 3, 3, 4, 5, 3, 8, 3, 10, 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);
}
|
COUNT_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [31, 72, 23, 42, 0, 0, 33, 94, 60, 11];
int [] param0 = [31, 72, 23, 42, 13, 93, 33, 94, 60, 11];
int [] param1 = [91, 85, 49, 32, 7, 5, 32, 76, 60, 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);
}
|
ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [116, 61, 169, 78, 81, 62, 128, 41, 70, 120];
int [] param0 = [56, 17, 73, 75, 27, 61, 65, 22, 61, 97];
int [] param1 = [60, 44, 96, 3, 54, 1, 63, 19, 9, 23];
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_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 1, 2, 1, 3, 5, 2, 0, 0, 0];
int [] [] param0 = [[16, 18, 24, 27, 34, 36, 41, 43, 43, 52, 59, 76, 86, 87, 90, 91, 94, 96, 98, 98], [64, 66, -36], [0, 0, 0], [9, 85, 34, 43, 70, 96, 44, 7, 27, 33, 34, 5, 91, 84, 76, 45, 20, 37, 15, 37, 20, 24, 13, 49, 74, 13, 50, 81, 81, 66, 23, 36, 91, 80, 61, 15, 96, 70, 90, 25, 16, 62, 75, 63, 6, 65, 38, 12], [-98, -98, -98, -34, -32, -26, -12, 0, 18, 52, 68, 72], [1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1], [1, 3, 6, 6, 10, 12, 15, 16, 21, 22, 23, 29, 33, 37, 40, 40, 43, 52, 55, 59, 64, 65, 71, 72, 80, 83, 86, 86, 88, 88], [-14, -30, -38, -38, -8, 40, -34, 2, -84, 68, -42, 38, -14, 0, -64, 12, -2, -38, -8, -44, -88, -34, -80, -36, 82, 70, 96, -32, 16, -52, -12, -46, -28, -86, 30, -14, 50, -44, 22, 30, -4, 78, 52], [1, 1, 1, 1], [11, 50, 1, 93, 12, 7, 55, 35, 36, 62, 61, 71, 16]];
int [] param1 = [14, 1, 2, 43, 11, 11, 29, 39, 2, 11];
int [] param2 = [43, 64, 0, 5, -98, 1, 40, 26, 3, 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);
}
|
SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [12, 7, 6, 17, -1, -1, 12, 7, 15, 13];
int [] param0 = [55, 35, 24, 75, 5, 7, 50, 28, 67, 59];
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);
}
|
LONGEST_REPEATING_SUBSEQUENCE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 3, 6, 1, 1, 0, 1, 3, 5, 0];
string [] param0 = ["jxzfz", "7648992235770", "11100000", "crn sgyjpsctj", "434", "1", "jrfziasbrpbz", "03779368305592", "1111000", "bkuluii"];
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_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [89, 2256, 32, 62, 52, 1, 24, -240, 1, 14];
int [] [] [] param0 = [[[23, 37, 54, 57, 59, 75, 97], [9, 15, 34, 39, 80, 96, 99], [15, 25, 26, 31, 43, 47, 93], [22, 31, 37, 44, 54, 62, 91], [7, 19, 32, 56, 57, 70, 81], [16, 37, 49, 77, 81, 82, 85], [44, 48, 64, 74, 79, 89, 99]], [[-24, -34, -86, -16, -34, 14, 76, 4, 18, 60, -4, -24, 46, -26, -74, 6, 50, -34, 8, -30, -62, 56, -78, -50, 76, -98, -64, -72, -76, 46, -70, 4, -92, -18, 10, -76, 78, -26], [-34, -30, -96, -4, 76, 48, -10, 96, -88, 96, 90, 40, -24, 68, -42, -48, -30, -32, -44, -50, -98, 34, -78, -52, -88, -38, 54, -64, -94, -48, -80, -2, -90, -14, -8, 90, -78, -36], [30, -80, -58, 48, -80, -78, 40, -48, -40, -84, 2, 44, 72, 6, 78, -84, -30, -70, 32, 86, 16, 68, 40, -36, 80, -46, 66, -92, 8, 72, -56, 58, -72, 44, 40, 6, 66, -66], [16, -72, -66, -30, 66, -94, 36, -34, -78, 14, -74, -54, 48, 6, -40, -40, -24, -6, 18, -20, -88, -8, 82, -56, -96, -32, 30, -22, 70, -4, 98, -40, -72, 66, -54, -60, 52, 66], [-28, -52, 90, -52, 12, 98, 42, -52, 38, -60, -28, 94, 86, -22, -62, 68, 12, 92, -82, 18, -2, 82, -28, 72, -78, -70, 40, -54, -24, -68, -74, -40, -32, 14, 88, 94, -46, -14], [-38, -30, 62, -52, 54, 56, 12, 32, -78, 24, 38, -82, 6, -64, -96, -56, -30, 62, -94, -26, -64, -38, 96, 72, 54, -56, 56, 82, 6, -30, 94, 80, -68, 18, 84, 58, -48, -34], [82, -44, 14, -26, -14, -92, 62, -48, -52, 26, -30, -76, -26, 28, 54, -16, -60, 16, -76, -90, 20, -8, 56, -86, 66, -84, 92, -52, 90, 30, 38, -2, 90, -50, 88, 44, -66, -80], [-22, 68, 62, -84, -76, -12, 82, 70, -58, 86, 20, -66, 96, -28, 6, 60, -90, 52, -28, 8, 34, 90, 38, 24, 76, -22, 6, 16, -46, -4, 84, -6, 6, 30, 50, 26, 8, -8], [34, -62, -26, 18, -14, 42, -50, 72, 16, -62, -76, 32, -20, 82, 8, 74, 60, -60, -16, -50, -38, -88, 68, -26, 66, -14, 64, 42, 98, 40, -56, 28, -96, 36, -82, -74, 38, -26], [-66, -58, -84, 16, -42, 4, -38, -6, -32, -98, 20, -96, 60, -38, 24, -8, -74, 52, 98, 52, -10, -24, -22, 78, -20, 58, -24, -98, -76, 0, -94, 6, 28, 42, 20, -36, 68, -68], [-20, 70, -80, 68, -26, -26, -22, 88, 86, 12, -98, -80, 2, -22, -2, 2, -52, -50, 30, 12, 74, 34, -14, -54, 70, 16, -76, -56, 16, -50, -14, -4, 30, 48, -14, 84, -34, 30], [68, 68, -86, 66, -64, 60, -28, 52, 14, -40, -98, 22, -30, 28, -48, -76, 66, 94, -28, 32, 88, 86, -76, -4, 68, -56, 76, -4, 36, 16, -4, 8, -44, -84, 74, 74, 96, -22], [-14, -88, -52, -72, -60, -50, 32, 86, 14, -26, 36, -84, 38, 80, -86, -64, 14, -96, 86, -52, -48, -16, -78, -66, -10, -24, 70, 22, 90, 46, -74, 36, -74, 2, 96, 6, 4, 34], [-34, 72, -40, 34, -30, 18, 54, -50, 0, 94, -62, 80, 4, 84, 10, 98, 56, -36, -94, 88, 10, -30, 90, -52, 14, -46, 30, 82, -66, 8, -98, 86, -90, 46, -44, -92, 22, 58], [70, -44, -28, -78, -62, -78, -96, -6, -92, -86, -82, 72, -50, 26, -4, 82, -42, 58, 28, -88, 98, -98, -14, 72, -24, 58, 72, -72, 6, -78, 34, -34, 58, -62, 78, -98, 0, 50], [84, 48, -82, -32, -22, 16, -34, -28, -76, 40, 26, 30, 70, 28, -64, -90, 70, -90, 82, 60, 10, -52, 0, 50, -38, -32, -18, 2, 48, 20, -96, 4, 62, -28, 28, -12, 50, -90], [64, 58, -34, 10, -44, -72, 62, 70, 60, 84, -12, -46, -82, -12, 80, 46, 44, -58, -18, 10, 44, 50, -60, -20, 82, -10, 18, -4, 48, 22, -14, 12, -76, -32, 8, -60, -54, -6], [22, -58, 58, -24, -58, -64, 62, -38, -36, 44, -82, 46, -78, 54, 96, 24, 84, 90, -2, -98, -74, 8, 44, -94, 84, 48, -2, 66, -44, 52, -42, -36, 34, -98, -6, 54, 26, 18], [-28, 30, -66, -14, -20, -44, -62, -20, 90, -92, -38, 64, 44, -60, 90, -60, -82, 36, -46, 52, -60, 26, 12, 80, -64, 92, -22, -68, -10, 54, -96, 44, 70, 10, 4, -4, -94, 66], [-70, 54, -32, 92, -26, -66, 28, -98, -14, -20, 40, -36, -6, -60, -36, -32, 26, 90, 34, -34, 82, 48, -82, -8, -86, -74, -58, -68, -68, -16, -26, -88, -6, -76, -12, -68, -98, -94], [14, -84, 90, 88, 80, -28, -46, 4, -4, 36, -56, -44, 68, 24, 24, 70, 36, -4, 58, -78, 14, -48, -46, 58, -44, -66, 72, -36, 84, 70, -26, 72, 76, 30, -30, 92, 4, -40], [-24, -28, 0, -44, -48, 74, 76, 50, -88, 36, -24, 62, -34, 82, -20, 38, -76, 16, -70, 92, -82, 56, 72, 78, 40, 52, -52, -38, 36, -44, 92, 46, -60, -54, 58, 96, 74, -18], [70, -30, -62, -74, -88, -92, 72, -42, 34, 76, -4, -94, 22, -82, 56, 2, 44, -64, -88, -20, 96, 0, -12, -20, -40, -56, -8, 18, -8, 18, 98, 28, 50, -14, 72, 50, 4, 38], [72, -66, 16, -44, 94, 10, 60, 96, 24, 12, 92, 30, 2, 64, 4, 58, 74, -24, -96, -52, 72, 10, -2, -18, -74, -2, 70, -6, -60, 72, -32, 34, -78, -10, -2, -30, 54, 42], [80, 92, 18, 54, -42, 50, -62, 76, 94, 38, 84, 78, 44, 98, 78, -54, -36, -80, 62, 14, 24, 86, 52, 4, 78, 96, 20, 58, -64, -42, 20, -98, -90, 6, 30, 56, -66, -34], [-86, 60, -62, -32, -12, 92, -54, -2, 8, 58, 68, 42, -46, -8, 82, -28, -96, 62, 46, -12, 2256, 88, 82, -26, -42, 36, 46, -46, 54, -58, -58, -62, 32, -48, -60, 86, 4, 56], [88, -36, 4, 60, 24, 6, 72, 58, 44, 14, -40, -64, 36, -92, 36, -56, -78, 86, 80, 80, -94, 64, -4, -2, 86, 26, -98, -56, 62, -56, -18, 40, 12, 26, 50, 72, -16, -58], [-88, 4, -66, 64, 42, 94, 54, -38, 8, -18, -8, 88, 46, 42, 64, -88, 94, 58, -50, 26, 38, 92, -66, 82, 8, 38, -92, -32, 50, -44, -88, -6, 34, 12, 66, 54, -52, -86], [20, -90, 2, -94, -76, -28, -76, 44, -12, -56, 50, 4, 34, -88, 46, 2, 60, 52, 22, 98, -84, 6, -26, -90, -4, 48, -66, -42, 58, -22, 30, -22, -82, -50, 42, 84, 94, 4], [-56, 4, -4, 54, 64, 82, 88, 8, 50, 66, -2, 80, -4, 12, 24, -56, -52, 80, 66, 82, -66, -92, -42, -56, 66, -92, -60, -92, -52, -54, 32, 22, -42, -46, -66, 60, 10, -62], [-44, 0, 6, -54, -98, 72, -98, -28, -4, -86, -10, -76, -64, -66, 58, 60, 24, 90, -6, -54, -22, 84, -34, 64, 36, 18, 14, -32, -88, -32, 84, -8, 60, 98, 28, -6, 14, -88], [-94, -92, 74, 96, 28, 34, 56, 74, -62, -46, -8, 10, -96, -72, 50, -98, -28, 72, 2, 46, 68, 14, -72, -78, -76, 68, 52, -30, -32, 90, 40, 50, 50, 20, 98, 2, 72, 44], [-6, 94, 16, -70, -74, -46, 22, 24, 44, -40, 52, -50, 94, -66, 84, -66, 14, -12, 48, -6, 64, -12, -44, -14, 2, -48, -22, 52, -28, -18, 8, 72, -28, 68, 44, -28, -20, 62], [12, -94, -86, -52, -92, -76, -78, 10, -8, 30, 34, 26, -80, -8, 68, 92, 66, 16, -48, 70, 30, -56, -80, -78, 58, 94, -56, -12, 56, -94, -60, -70, 0, -94, 6, 36, 48, -98], [74, 72, 20, -84, 96, -84, 40, -36, -88, -14, 60, -70, 36, -28, -18, -82, -36, 92, -86, 44, -16, -66, 28, -88, -18, -52, 66, -26, -90, -12, -16, 80, -28, 82, -92, 82, -76, -80], [40, -38, -48, 72, -30, 70, -14, 14, 90, 42, -6, 52, -94, 44, -32, -8, -74, 80, -18, -10, 74, -80, 86, -82, -2, 10, -12, 58, -70, -18, 86, 40, 62, 76, 88, 68, 68, 4], [86, 4, 16, 86, -66, 72, -38, -40, -52, 14, -60, -88, -44, -60, -64, 84, -50, -78, -44, -18, 78, 74, -66, -64, 18, 26, 74, 98, -18, -96, -82, 4, -74, -40, -50, -46, -4, 94], [-70, -64, -10, -22, -88, -48, 84, 78, 16, 64, 78, -48, 66, -88, 44, 60, -10, -48, 60, -40, 86, -40, 32, 16, 28, -30, 32, -74, 10, -34, 38, -36, -30, 2, 14, -92, -48, 88]], [[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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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]], [[84, 65, 61, 9, 50, 58, 19, 98, 63, 92, 42, 82, 5, 55, 81, 77, 1, 92, 74, 40, 13, 59, 48, 51, 18, 42, 34, 78, 41, 82, 13, 6, 92], [31, 76, 5, 83, 74, 92, 29, 9, 40, 28, 36, 36, 4, 73, 32, 6, 79, 8, 45, 89, 60, 34, 82, 27, 68, 24, 68, 47, 27, 42, 3, 61, 19], [56, 19, 38, 73, 69, 25, 38, 90, 20, 50, 27, 8, 1, 84, 9, 44, 54, 64, 8, 74, 19, 52, 40, 9, 75, 66, 58, 8, 40, 46, 55, 54, 75], [12, 13, 58, 11, 23, 52, 60, 91, 95, 86, 63, 25, 62, 93, 35, 36, 60, 87, 94, 46, 3, 85, 35, 77, 28, 22, 33, 7, 92, 76, 33, 53, 30], [2, 4, 55, 27, 47, 76, 45, 70, 34, 36, 5, 2, 50, 24, 32, 85, 81, 34, 5, 35, 56, 72, 21, 39, 58, 90, 49, 75, 74, 49, 76, 22, 30], [35, 66, 31, 4, 44, 70, 53, 57, 36, 36, 54, 26, 96, 4, 22, 34, 1, 87, 57, 51, 16, 36, 47, 91, 39, 5, 25, 45, 61, 5, 37, 51, 88], [45, 98, 42, 35, 56, 86, 16, 75, 9, 32, 14, 92, 40, 25, 24, 29, 5, 1, 75, 13, 3, 8, 71, 79, 96, 33, 22, 13, 30, 20, 41, 84, 59], [74, 33, 15, 13, 27, 6, 87, 95, 74, 82, 7, 52, 29, 66, 44, 89, 74, 21, 57, 22, 32, 13, 14, 42, 12, 99, 55, 9, 16, 94, 37, 72, 29], [64, 47, 16, 76, 77, 39, 94, 53, 65, 65, 80, 12, 25, 14, 6, 77, 66, 12, 37, 63, 78, 17, 32, 16, 22, 7, 40, 25, 8, 27, 32, 55, 39], [27, 52, 60, 70, 10, 52, 14, 60, 35, 31, 27, 50, 74, 87, 32, 28, 55, 98, 68, 9, 72, 48, 53, 39, 29, 64, 84, 64, 47, 7, 69, 22, 72], [89, 58, 93, 44, 1, 12, 98, 64, 65, 97, 36, 4, 84, 47, 49, 77, 81, 11, 30, 3, 69, 73, 30, 68, 73, 10, 96, 40, 71, 57, 3, 81, 46], [39, 71, 95, 88, 22, 67, 25, 57, 53, 22, 98, 68, 19, 28, 10, 26, 79, 13, 50, 2, 10, 54, 44, 88, 69, 97, 75, 31, 18, 77, 17, 22, 53], [85, 17, 87, 79, 24, 25, 49, 13, 15, 16, 36, 98, 41, 78, 77, 89, 31, 91, 20, 85, 51, 29, 55, 94, 69, 16, 85, 91, 83, 9, 66, 96, 16], [67, 72, 45, 87, 18, 95, 50, 29, 69, 80, 43, 78, 53, 37, 71, 67, 41, 16, 66, 77, 69, 74, 50, 11, 37, 80, 5, 60, 5, 56, 85, 9, 92], [92, 36, 57, 21, 48, 29, 77, 51, 52, 74, 68, 1, 18, 60, 70, 47, 98, 75, 81, 17, 12, 74, 1, 52, 50, 21, 30, 24, 17, 56, 29, 65, 18], [63, 47, 21, 28, 54, 39, 53, 42, 30, 59, 74, 9, 14, 66, 94, 45, 27, 44, 43, 98, 60, 57, 1, 65, 35, 19, 35, 58, 27, 38, 82, 96, 96], [29, 64, 7, 9, 34, 80, 65, 45, 40, 56, 95, 7, 32, 36, 9, 70, 83, 73, 92, 73, 20, 19, 65, 27, 87, 2, 88, 64, 48, 71, 20, 57, 11], [85, 39, 35, 38, 44, 69, 64, 28, 47, 77, 38, 4, 84, 50, 54, 72, 62, 33, 31, 60, 68, 37, 80, 62, 74, 96, 81, 17, 64, 11, 91, 85, 64], [45, 96, 40, 46, 4, 53, 91, 75, 80, 53, 8, 29, 93, 10, 11, 48, 15, 96, 80, 13, 47, 23, 81, 23, 41, 59, 28, 37, 6, 16, 46, 49, 89], [1, 59, 53, 1, 36, 70, 18, 90, 6, 18, 15, 1, 74, 7, 57, 87, 54, 92, 8, 41, 47, 60, 60, 18, 77, 5, 79, 47, 83, 23, 9, 42, 55], [45, 22, 54, 33, 86, 86, 2, 52, 34, 74, 17, 40, 78, 5, 77, 8, 52, 13, 8, 24, 27, 97, 9, 8, 28, 91, 74, 98, 99, 8, 18, 12, 85], [43, 68, 81, 7, 74, 86, 13, 75, 46, 95, 62, 39, 98, 22, 51, 53, 46, 62, 25, 90, 54, 5, 26, 45, 31, 84, 95, 63, 11, 27, 2, 43, 7], [20, 68, 7, 65, 20, 49, 16, 59, 39, 68, 20, 43, 2, 37, 39, 14, 90, 45, 94, 31, 68, 94, 88, 72, 80, 95, 1, 88, 19, 93, 21, 71, 27], [41, 67, 5, 99, 99, 88, 90, 4, 31, 54, 22, 28, 1, 27, 2, 46, 94, 37, 21, 43, 21, 4, 44, 74, 72, 49, 39, 58, 91, 76, 39, 70, 43], [23, 23, 33, 86, 60, 69, 14, 39, 49, 89, 1, 32, 65, 67, 62, 63, 16, 70, 59, 20, 53, 50, 8, 93, 52, 75, 77, 20, 16, 13, 92, 16, 18], [97, 3, 56, 96, 41, 64, 6, 95, 92, 95, 30, 15, 1, 13, 55, 68, 88, 8, 99, 55, 81, 9, 87, 46, 93, 83, 54, 51, 32, 52, 62, 54, 41], [81, 13, 63, 13, 67, 97, 51, 72, 40, 49, 87, 12, 24, 92, 46, 46, 45, 38, 95, 67, 51, 51, 88, 62, 71, 66, 32, 57, 23, 27, 21, 13, 52], [6, 91, 35, 9, 74, 55, 71, 71, 28, 63, 89, 65, 95, 45, 26, 47, 64, 27, 88, 10, 42, 45, 14, 27, 32, 93, 95, 64, 14, 88, 53, 30, 41], [55, 51, 89, 7, 37, 36, 89, 43, 26, 78, 33, 2, 21, 94, 58, 40, 95, 46, 68, 89, 38, 75, 97, 58, 78, 12, 6, 57, 18, 3, 96, 61, 17], [56, 24, 53, 35, 66, 26, 30, 60, 27, 57, 82, 78, 84, 84, 94, 31, 48, 59, 33, 27, 54, 33, 20, 67, 46, 19, 71, 91, 70, 29, 26, 17, 66], [85, 48, 88, 33, 78, 98, 69, 3, 81, 70, 80, 66, 84, 61, 48, 17, 8, 25, 8, 29, 82, 59, 62, 1, 58, 71, 74, 86, 8, 94, 15, 22, 79], [43, 32, 57, 81, 97, 19, 68, 26, 21, 12, 12, 44, 10, 81, 42, 92, 44, 58, 10, 11, 2, 5, 33, 1, 86, 46, 85, 40, 13, 16, 44, 70, 42], [31, 28, 33, 90, 54, 30, 46, 18, 1, 95, 73, 79, 87, 16, 87, 39, 92, 26, 85, 75, 42, 56, 11, 78, 50, 6, 63, 77, 46, 77, 45, 35, 83]], [[-82, -82, -76, -74, -72, -70, -70, -68, -66, -56, -56, -50, -48, -44, -42, -38, -36, -32, -26, -20, -20, -18, -8, 6, 8, 12, 12, 14, 18, 20, 24, 24, 30, 32, 36, 38, 40, 44, 50, 56, 60, 62, 66, 70, 76, 78, 90, 98, 98], [-92, -80, -76, -70, -58, -58, -50, -48, -38, -36, -34, -32, -30, -30, -24, -20, -20, -18, -10, -10, -8, -6, -6, -6, -4, 2, 10, 14, 24, 26, 30, 34, 36, 44, 52, 54, 64, 76, 78, 82, 86, 86, 86, 86, 86, 88, 88, 92, 94], [-98, -94, -86, -82, -80, -76, -74, -74, -72, -70, -70, -68, -66, -62, -50, -50, -48, -42, -34, -24, -22, -22, 2, 8, 8, 10, 12, 22, 22, 26, 26, 26, 30, 38, 44, 54, 56, 58, 68, 68, 72, 78, 80, 80, 84, 88, 92, 94, 98], [-92, -88, -84, -84, -82, -78, -78, -66, -60, -48, -48, -46, -42, -40, -40, -38, -36, -34, -30, -30, -26, -26, -22, -22, -20, -14, -12, 6, 28, 36, 38, 44, 46, 46, 48, 50, 52, 52, 56, 58, 60, 70, 80, 80, 80, 86, 92, 96, 98], [-98, -94, -80, -76, -72, -70, -70, -70, -68, -64, -64, -62, -60, -56, -54, -52, -50, -48, -46, -42, -40, -30, -28, -28, -24, -22, -6, -4, 0, 2, 10, 12, 18, 18, 32, 36, 58, 60, 68, 70, 72, 74, 80, 84, 86, 88, 88, 94, 98], [-96, -96, -86, -84, -84, -72, -72, -70, -70, -66, -64, -60, -58, -58, -46, -38, -38, -28, -22, -18, -14, 16, 18, 20, 20, 24, 24, 26, 32, 32, 34, 40, 42, 42, 44, 44, 46, 56, 58, 60, 62, 64, 66, 68, 68, 68, 74, 78, 86], [-98, -92, -70, -58, -54, -50, -50, -50, -46, -40, -40, -36, -34, -24, -22, -22, -18, -8, -6, -6, -2, 2, 2, 10, 16, 16, 20, 22, 24, 26, 28, 28, 30, 32, 38, 40, 42, 48, 56, 56, 58, 60, 66, 66, 72, 84, 90, 94, 96], [-98, -90, -82, -80, -78, -78, -70, -66, -60, -54, -48, -48, -38, -28, -18, -16, -14, -12, -12, -10, -8, -4, -4, -4, -2, 0, 2, 6, 6, 12, 16, 18, 20, 24, 36, 46, 52, 54, 60, 62, 66, 66, 70, 70, 82, 82, 86, 86, 88], [-98, -90, -88, -86, -78, -76, -76, -70, -66, -60, -56, -56, -56, -54, -52, -46, -40, -28, -26, -22, -20, -20, -18, -14, -12, -8, 0, 18, 18, 28, 34, 36, 36, 36, 38, 46, 50, 54, 56, 56, 60, 66, 70, 72, 74, 74, 80, 80, 82], [-98, -92, -90, -86, -84, -82, -78, -70, -66, -60, -58, -44, -42, -34, -32, -30, -24, -20, -16, -8, -4, 8, 8, 14, 14, 14, 14, 20, 20, 32, 38, 42, 52, 62, 62, 66, 68, 70, 72, 72, 78, 78, 78, 78, 84, 96, 98, 98, 98], [-90, -88, -82, -82, -82, -80, -74, -68, -68, -64, -58, -56, -54, -50, -42, -36, -32, -28, -20, -20, -20, -18, -16, -14, -6, -6, -2, 6, 8, 10, 20, 24, 26, 32, 38, 44, 46, 48, 56, 56, 58, 60, 64, 68, 74, 80, 88, 92, 96], [-96, -94, -88, -72, -72, -72, -70, -70, -64, -52, -46, -46, -44, -38, -34, -34, -28, -26, -20, -16, -14, -10, -8, -2, -2, 2, 6, 8, 10, 30, 34, 34, 36, 44, 52, 58, 60, 70, 72, 72, 74, 76, 76, 80, 90, 92, 92, 94, 98], [-98, -98, -96, -96, -84, -82, -80, -76, -62, -52, -46, -44, -44, -40, -38, -38, -36, -30, -22, -8, -4, -2, 0, 2, 4, 8, 12, 20, 22, 26, 26, 30, 34, 46, 46, 52, 54, 56, 58, 60, 62, 66, 72, 74, 78, 80, 90, 92, 96], [-94, -94, -92, -92, -80, -80, -74, -64, -56, -54, -52, -50, -50, -42, -42, -42, -40, -36, -36, -32, -24, -16, -14, -4, 0, 2, 4, 10, 12, 16, 22, 24, 26, 28, 28, 30, 40, 46, 48, 56, 58, 62, 62, 62, 80, 88, 88, 96, 98], [-96, -94, -94, -92, -84, -82, -80, -74, -70, -58, -54, -52, -52, -48, -44, -34, -34, -30, -28, -24, -14, -12, -4, -2, 2, 2, 4, 10, 12, 14, 24, 28, 38, 40, 46, 58, 62, 68, 72, 72, 74, 76, 82, 84, 84, 84, 84, 90, 98], [-98, -90, -84, -82, -76, -70, -66, -62, -60, -60, -58, -56, -54, -54, -50, -50, -46, -40, -40, -38, -32, -24, -22, -22, -20, -12, -12, -8, 6, 6, 8, 8, 8, 22, 26, 40, 42, 50, 50, 50, 50, 56, 64, 86, 92, 92, 94, 94, 96], [-92, -78, -74, -68, -66, -62, -62, -62, -60, -60, -54, -40, -36, -34, -34, -32, -22, -22, -18, -14, -12, -10, -6, -4, -2, 0, 12, 14, 18, 28, 32, 32, 38, 44, 48, 50, 52, 52, 60, 64, 66, 66, 82, 86, 90, 90, 94, 94, 96], [-96, -94, -92, -90, -88, -86, -84, -76, -74, -72, -72, -68, -66, -66, -58, -52, -50, -46, -42, -34, -32, -32, -30, -14, -10, -6, -6, -2, -2, 10, 14, 20, 30, 30, 34, 36, 36, 38, 38, 42, 44, 50, 52, 64, 68, 82, 90, 90, 98], [-98, -88, -82, -80, -80, -78, -76, -72, -70, -66, -66, -58, -56, -52, -52, -50, -50, -44, -42, -42, -32, -32, -30, -26, -22, -20, -20, -2, 0, 10, 12, 18, 20, 24, 24, 26, 36, 38, 42, 56, 66, 74, 76, 78, 78, 84, 86, 96, 98], [-94, -94, -94, -80, -76, -74, -68, -56, -52, -50, -44, -42, -38, -36, -34, -28, -26, -24, -16, -2, 0, 4, 8, 14, 16, 20, 22, 32, 34, 38, 46, 46, 48, 50, 52, 54, 62, 64, 66, 66, 72, 76, 78, 78, 80, 82, 82, 84, 94], [-98, -98, -90, -86, -80, -78, -76, -74, -74, -72, -72, -60, -58, -54, -50, -46, -32, -24, -22, -18, -18, -14, -12, -12, -10, -8, 8, 14, 24, 30, 36, 46, 48, 50, 58, 58, 62, 66, 66, 74, 74, 74, 78, 78, 80, 84, 86, 90, 92], [-98, -94, -82, -80, -72, -64, -60, -58, -48, -46, -46, -40, -32, -26, -24, -16, -14, -12, -10, -8, -6, -4, -4, 2, 4, 4, 12, 12, 14, 26, 34, 36, 40, 46, 48, 54, 66, 66, 66, 66, 66, 72, 78, 80, 80, 80, 94, 96, 98], [-96, -92, -86, -72, -70, -70, -68, -68, -66, -64, -62, -56, -50, -44, -32, -30, -28, -24, -12, -4, -4, -4, 2, 10, 16, 18, 18, 22, 32, 32, 36, 36, 40, 42, 46, 46, 50, 50, 50, 50, 52, 54, 64, 68, 70, 72, 74, 90, 96], [-98, -98, -98, -90, -86, -82, -64, -60, -58, -54, -48, -36, -36, -32, -30, -28, -18, -16, -14, -6, -2, 4, 6, 6, 10, 12, 14, 18, 24, 32, 34, 46, 48, 50, 52, 58, 66, 68, 70, 80, 80, 82, 84, 84, 86, 92, 94, 96, 98], [-98, -96, -88, -86, -86, -86, -86, -86, -84, -78, -78, -74, -72, -72, -70, -70, -70, -66, -64, -56, -42, -40, -38, -36, -34, -32, -30, -28, -26, -20, -8, -6, 0, 2, 2, 14, 24, 30, 34, 36, 44, 50, 52, 60, 66, 68, 74, 78, 86], [-96, -86, -72, -72, -70, -70, -68, -68, -64, -58, -58, -58, -54, -54, -52, -48, -46, -40, -38, -28, -14, -10, -6, -4, 0, 10, 10, 12, 16, 18, 18, 20, 20, 22, 34, 34, 40, 40, 46, 46, 58, 58, 62, 66, 68, 68, 72, 84, 92], [-96, -90, -88, -88, -82, -82, -76, -74, -70, -68, -62, -56, -52, -48, -46, -38, -22, -22, -16, -12, -8, 0, 4, 8, 14, 20, 22, 24, 28, 34, 36, 38, 44, 46, 48, 58, 66, 68, 68, 76, 84, 84, 86, 86, 88, 88, 90, 92, 94], [-96, -96, -96, -94, -90, -88, -88, -84, -76, -72, -72, -58, -54, -52, -52, -50, -40, -38, -32, -12, -12, -6, -4, -2, 0, 2, 2, 10, 12, 22, 28, 28, 30, 34, 42, 42, 54, 56, 58, 64, 70, 70, 74, 74, 84, 86, 88, 88, 90], [-94, -92, -84, -82, -82, -70, -66, -64, -60, -60, -58, -58, -54, -52, -52, -42, -36, -32, -30, -28, -26, -24, -22, -20, -16, -12, 0, 4, 6, 8, 14, 20, 30, 32, 46, 54, 60, 62, 62, 64, 66, 68, 68, 70, 70, 72, 72, 76, 88], [-90, -90, -90, -88, -88, -86, -78, -68, -62, -62, -60, -54, -54, -48, -48, -36, -36, -32, -28, -28, -22, -20, -6, -2, 4, 6, 8, 10, 14, 24, 28, 28, 28, 34, 34, 36, 44, 52, 54, 54, 66, 70, 70, 72, 78, 80, 84, 88, 88], [-98, -94, -94, -90, -84, -76, -72, -70, -68, -68, -60, -54, -54, -48, -46, -46, -44, -34, -28, -28, -26, -12, -8, -4, 2, 6, 6, 8, 14, 32, 32, 38, 38, 40, 44, 46, 46, 50, 50, 52, 54, 58, 60, 62, 70, 78, 86, 92, 92], [-98, -94, -94, -92, -90, -86, -82, -76, -74, -74, -66, -66, -66, -60, -60, -60, -56, -54, -50, -38, -30, -28, -18, -16, -16, -2, 0, 6, 14, 16, 16, 18, 28, 30, 30, 32, 34, 40, 46, 52, 52, 54, 60, 70, 82, 84, 88, 90, 94], [-96, -88, -84, -80, -78, -78, -78, -68, -62, -60, -52, -44, -36, -36, -36, -34, -32, -32, -30, -26, -22, -14, -10, -6, -4, -4, 0, 0, 0, 10, 12, 14, 14, 16, 24, 34, 38, 44, 52, 54, 54, 56, 58, 60, 64, 66, 66, 92, 98], [-98, -88, -80, -80, -74, -72, -70, -68, -64, -62, -62, -62, -58, -56, -52, -50, -50, -46, -34, -30, -30, -26, -18, -12, 4, 10, 14, 22, 24, 30, 32, 38, 42, 42, 46, 56, 56, 58, 68, 72, 80, 82, 86, 90, 90, 92, 96, 98, 98], [-96, -92, -92, -90, -90, -90, -88, -82, -82, -82, -80, -68, -64, -60, -50, -34, -30, -16, -10, -10, -8, -4, -4, -2, 0, 18, 20, 24, 24, 24, 30, 30, 36, 38, 38, 40, 42, 42, 44, 48, 52, 52, 56, 76, 84, 88, 92, 94, 98], [-98, -90, -82, -80, -74, -74, -72, -72, -72, -72, -64, -60, -56, -56, -56, -52, -40, -38, -24, -20, -18, -18, -12, -10, -6, 10, 18, 22, 24, 24, 26, 26, 30, 34, 40, 40, 44, 50, 58, 60, 62, 64, 70, 76, 80, 80, 86, 88, 96], [-96, -94, -86, -82, -72, -68, -68, -64, -62, -56, -54, -50, -50, -48, -44, -26, -20, -16, -10, -8, -6, 6, 8, 10, 10, 10, 16, 20, 28, 28, 32, 40, 42, 44, 44, 46, 46, 48, 58, 62, 72, 76, 80, 84, 86, 88, 92, 96, 98], [-96, -94, -94, -94, -92, -92, -90, -84, -82, -78, -76, -74, -74, -62, -58, -58, -58, -42, -42, -22, -20, -14, -14, -12, -4, -2, 4, 4, 4, 8, 16, 20, 24, 26, 32, 40, 42, 46, 52, 54, 56, 56, 60, 60, 62, 62, 82, 90, 96], [-98, -96, -96, -76, -70, -66, -54, -54, -52, -50, -46, -40, -36, -34, -32, -30, -28, -28, -26, -26, -22, -20, -18, -6, 6, 10, 20, 22, 28, 30, 30, 32, 32, 34, 38, 42, 46, 54, 58, 70, 76, 76, 84, 90, 94, 94, 98, 98, 98], [-90, -86, -82, -72, -70, -70, -66, -62, -60, -58, -54, -54, -40, -36, -32, -30, -28, -26, -26, -24, -16, -14, -10, -8, -8, -8, -8, 4, 6, 8, 14, 16, 18, 18, 22, 26, 30, 58, 66, 82, 84, 92, 92, 94, 96, 96, 96, 96, 98], [-92, -86, -80, -74, -68, -66, -64, -64, -52, -44, -36, -34, -32, -30, -26, -22, -20, -18, -14, -12, -8, 2, 10, 10, 12, 16, 24, 32, 32, 44, 46, 48, 52, 52, 54, 66, 68, 70, 72, 74, 82, 84, 88, 90, 94, 94, 96, 96, 96], [-92, -90, -80, -78, -78, -78, -74, -66, -50, -50, -46, -46, -44, -44, -40, -38, -34, -32, -32, -30, -18, -18, -16, -14, -12, 4, 10, 10, 10, 18, 20, 20, 22, 24, 24, 26, 26, 46, 46, 48, 48, 52, 58, 62, 64, 72, 80, 96, 96], [-98, -96, -94, -92, -88, -86, -84, -82, -76, -76, -60, -58, -58, -58, -56, -50, -48, -38, -34, -30, -20, -16, -16, -10, -4, -2, 10, 12, 18, 26, 32, 34, 48, 48, 52, 64, 64, 68, 70, 74, 76, 78, 80, 90, 92, 92, 92, 94, 96], [-96, -88, -88, -82, -76, -70, -62, -58, -56, -48, -48, -38, -36, -30, -18, -18, -16, -16, -14, -12, -6, 4, 8, 10, 10, 12, 14, 24, 28, 28, 34, 38, 44, 50, 58, 60, 62, 66, 66, 72, 74, 76, 76, 78, 78, 84, 86, 88, 96], [-98, -94, -94, -94, -90, -86, -78, -74, -68, -66, -62, -58, -56, -54, -52, -52, -48, -44, -44, -44, -30, -26, -26, -12, -4, 2, 4, 4, 6, 6, 12, 12, 14, 16, 16, 22, 22, 30, 30, 34, 36, 42, 50, 50, 64, 70, 80, 88, 98], [-98, -96, -96, -94, -88, -84, -58, -56, -52, -48, -44, -30, -26, -26, -20, -18, -16, -8, -8, -8, -6, -6, -4, -4, -2, 0, 6, 12, 12, 14, 24, 34, 42, 46, 48, 56, 60, 62, 62, 72, 72, 80, 84, 88, 88, 90, 90, 94, 96], [-98, -90, -82, -78, -70, -68, -64, -62, -56, -52, -50, -44, -44, -42, -36, -26, -24, -22, -12, -10, -6, -4, 0, 2, 6, 10, 18, 32, 32, 36, 38, 42, 48, 52, 54, 56, 62, 64, 66, 66, 66, 66, 70, 72, 74, 74, 78, 86, 92], [-96, -90, -88, -78, -74, -72, -70, -68, -66, -60, -58, -56, -56, -50, -50, -44, -36, -26, -24, -18, -16, -16, -12, -6, 2, 6, 8, 10, 10, 18, 18, 22, 24, 26, 42, 46, 64, 64, 66, 72, 74, 74, 76, 88, 94, 94, 96, 98, 98], [-94, -82, -78, -78, -76, -64, -64, -58, -58, -56, -56, -52, -44, -42, -38, -36, -22, -16, -14, -6, -2, 4, 4, 8, 8, 12, 14, 14, 14, 16, 16, 22, 30, 34, 38, 42, 44, 58, 62, 66, 66, 68, 76, 78, 80, 80, 84, 90, 98]], [[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0], [0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0], [0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0], [0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0], [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0], [1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0], [0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1], [0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0], [1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], [1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0], [0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1], [1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1], [1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0], [1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1], [0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0], [1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0], [1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0], [1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0], [0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0], [0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0], [1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1], [1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0], [1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1], [0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1], [1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1], [0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0], [0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], [1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1], [1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1], [0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0], [1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0], [0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1], [0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1], [0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], [0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1], [0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1]], [[13, 16, 26, 38, 44, 71, 73], [16, 28, 39, 47, 48, 59, 61], [15, 30, 50, 59, 60, 89, 90], [24, 61, 63, 71, 72, 76, 83], [14, 36, 39, 42, 64, 76, 77], [4, 6, 11, 24, 34, 36, 58], [22, 35, 63, 70, 81, 91, 98]], [[-48, -22, -52, -86, -22], [-54, -6, -16, -84, -34], [-46, -16, -80, -82, -38], [-44, 98, -54, -32, -88], [42, 52, 38, -20, -36]], [[0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1]], [[62, 15, 2, 68, 63, 42, 57, 46, 37, 30, 1, 51, 47, 75, 50, 24, 48, 56, 93, 9, 50, 79, 58, 74, 81, 64, 63, 60, 49, 24, 46, 55, 89, 10, 49, 46, 17, 86, 24, 51, 69, 21, 16, 97, 66, 14], [95, 91, 93, 6, 64, 52, 1, 29, 77, 42, 16, 76, 40, 30, 32, 7, 36, 72, 1, 94, 12, 25, 11, 75, 52, 95, 64, 4, 54, 78, 40, 67, 81, 92, 5, 42, 65, 94, 59, 12, 35, 75, 82, 83, 72, 47], [69, 96, 79, 34, 12, 8, 27, 58, 49, 56, 43, 17, 26, 87, 1, 19, 99, 48, 80, 25, 56, 40, 42, 63, 92, 27, 76, 55, 15, 2, 30, 81, 79, 4, 15, 52, 21, 94, 80, 27, 93, 33, 44, 20, 45, 34], [18, 47, 49, 73, 19, 87, 86, 72, 52, 21, 36, 27, 96, 2, 87, 35, 22, 20, 97, 92, 69, 13, 15, 95, 80, 58, 84, 66, 56, 12, 57, 36, 90, 25, 14, 43, 43, 80, 2, 53, 42, 65, 52, 42, 5, 48], [85, 40, 51, 5, 9, 71, 80, 70, 2, 18, 87, 36, 78, 90, 57, 60, 27, 92, 15, 64, 47, 22, 99, 53, 87, 28, 97, 94, 28, 83, 64, 10, 10, 34, 30, 90, 17, 87, 31, 7, 29, 68, 29, 69, 47, 35], [15, 32, 84, 9, 45, 6, 37, 97, 12, 69, 91, 45, 39, 58, 49, 85, 76, 2, 48, 71, 81, 88, 16, 71, 49, 32, 68, 5, 23, 65, 93, 47, 88, 59, 43, 43, 36, 59, 52, 77, 1, 25, 36, 86, 26, 42], [39, 15, 66, 15, 13, 29, 80, 10, 75, 3, 21, 65, 41, 19, 76, 82, 64, 55, 63, 46, 24, 94, 40, 75, 24, 20, 2, 86, 90, 24, 53, 70, 65, 90, 45, 70, 96, 98, 68, 60, 12, 31, 27, 57, 63, 17], [79, 58, 4, 37, 50, 72, 71, 69, 45, 86, 47, 25, 98, 59, 63, 16, 13, 97, 66, 2, 8, 13, 4, 54, 96, 1, 80, 3, 35, 15, 62, 20, 74, 58, 80, 65, 85, 37, 74, 6, 93, 29, 10, 19, 80, 61], [53, 59, 23, 20, 92, 20, 65, 17, 71, 81, 41, 50, 37, 86, 75, 62, 21, 49, 59, 34, 56, 94, 41, 71, 70, 94, 44, 6, 25, 19, 37, 3, 13, 39, 86, 98, 19, 30, 52, 26, 35, 25, 65, 74, 9, 69], [15, 92, 20, 89, 35, 8, 50, 32, 17, 2, 21, 64, 76, 26, 9, 49, 25, 63, 17, 51, 58, 1, 97, 3, 28, 80, 11, 89, 23, 86, 9, 27, 5, 52, 31, 62, 77, 63, 86, 41, 59, 19, 28, 78, 6, 63], [76, 97, 67, 74, 17, 13, 95, 60, 16, 63, 87, 95, 84, 66, 82, 69, 80, 44, 54, 32, 29, 37, 47, 62, 78, 79, 45, 10, 63, 11, 20, 53, 95, 72, 40, 75, 89, 81, 1, 37, 56, 15, 85, 93, 84, 9], [72, 60, 72, 79, 28, 8, 48, 76, 89, 84, 89, 46, 42, 83, 65, 90, 71, 93, 64, 50, 55, 88, 66, 29, 6, 6, 47, 99, 61, 98, 24, 57, 4, 83, 56, 56, 46, 21, 46, 33, 78, 85, 15, 28, 80, 33], [49, 8, 68, 50, 35, 16, 35, 44, 22, 80, 94, 48, 98, 13, 43, 79, 28, 68, 15, 99, 5, 27, 62, 63, 85, 66, 55, 31, 44, 48, 73, 58, 71, 50, 94, 22, 19, 79, 76, 13, 97, 27, 91, 19, 47, 12], [52, 75, 69, 55, 13, 16, 39, 7, 82, 28, 77, 88, 84, 98, 47, 21, 21, 43, 40, 92, 82, 92, 33, 94, 3, 21, 42, 47, 89, 40, 59, 78, 13, 97, 62, 96, 74, 69, 95, 73, 90, 11, 67, 10, 48, 47], [37, 21, 84, 6, 27, 11, 42, 18, 62, 58, 81, 7, 9, 71, 77, 38, 69, 12, 16, 61, 2, 44, 81, 71, 2, 99, 22, 38, 30, 51, 39, 11, 62, 73, 95, 74, 13, 87, 33, 17, 23, 8, 90, 45, 36, 73], [80, 14, 37, 80, 75, 12, 38, 69, 25, 91, 72, 14, 3, 36, 97, 93, 61, 20, 22, 9, 56, 89, 37, 99, 9, 50, 59, 95, 67, 25, 48, 36, 91, 66, 48, 61, 71, 13, 50, 54, 51, 29, 58, 48, 14, 19], [64, 64, 97, 27, 3, 7, 54, 36, 57, 24, 82, 5, 83, 49, 78, 87, 87, 93, 70, 62, 68, 26, 40, 84, 82, 76, 98, 27, 41, 71, 23, 56, 3, 46, 85, 39, 62, 92, 73, 74, 16, 79, 40, 24, 91, 63], [88, 29, 39, 88, 15, 76, 44, 40, 66, 67, 26, 9, 61, 5, 24, 71, 8, 56, 35, 89, 71, 12, 72, 54, 26, 84, 57, 58, 46, 73, 92, 24, 20, 59, 70, 86, 84, 15, 98, 51, 29, 15, 74, 7, 19, 64], [14, 46, 80, 84, 53, 57, 50, 32, 23, 48, 35, 83, 89, 10, 67, 51, 96, 63, 84, 18, 6, 41, 48, 79, 66, 17, 17, 45, 51, 7, 65, 79, 29, 34, 92, 17, 45, 36, 2, 36, 66, 30, 65, 4, 55, 61], [23, 37, 69, 52, 89, 17, 78, 39, 81, 83, 94, 61, 33, 11, 46, 34, 27, 35, 55, 1, 22, 99, 91, 24, 56, 28, 70, 88, 23, 48, 77, 57, 57, 72, 69, 79, 95, 58, 37, 68, 17, 66, 11, 82, 97, 20], [24, 46, 12, 76, 76, 15, 6, 97, 22, 95, 83, 52, 69, 59, 17, 24, 54, 85, 60, 41, 2, 84, 71, 76, 71, 27, 36, 54, 79, 32, 66, 65, 27, 15, 39, 30, 38, 58, 6, 66, 73, 31, 73, 74, 64, 51], [71, 37, 75, 62, 93, 88, 55, 77, 22, 54, 67, 34, 50, 89, 66, 77, 17, 54, 1, 53, 83, 3, 74, 37, 41, 38, 48, 39, 25, 46, 72, 61, 70, 77, 7, 58, 5, 77, 60, 64, 95, 22, 81, 95, 53, 14], [52, 25, 79, 20, 16, 26, 40, 49, 23, 82, 56, 61, 40, 89, 99, 58, 90, 17, 22, 20, 1, 14, 5, 99, 34, 63, 71, 7, 51, 56, 8, 3, 8, 39, 45, 90, 97, 24, 45, 77, 51, 57, 41, 59, 47, 15], [98, 5, 15, 87, 54, 20, 2, 88, 73, 98, 90, 4, 79, 94, 74, 26, 3, 91, 65, 28, 25, 93, 61, 63, 3, 97, 15, 40, 1, 79, 88, 71, 15, 55, 94, 93, 38, 56, 10, 41, 68, 28, 85, 74, 71, 19], [10, 27, 56, 25, 36, 22, 54, 74, 28, 72, 53, 19, 66, 49, 49, 56, 94, 55, 24, 82, 54, 66, 1, 7, 37, 45, 49, 85, 34, 51, 91, 74, 64, 28, 87, 81, 39, 42, 93, 60, 43, 10, 85, 12, 7, 62], [73, 51, 16, 10, 70, 67, 50, 75, 37, 60, 45, 31, 57, 94, 44, 51, 23, 74, 16, 79, 78, 57, 63, 90, 28, 24, 63, 5, 61, 2, 20, 86, 57, 46, 42, 5, 34, 72, 35, 68, 37, 6, 19, 15, 48, 93], [70, 43, 61, 32, 77, 46, 11, 98, 66, 70, 44, 73, 51, 53, 55, 69, 54, 3, 65, 25, 75, 37, 47, 44, 78, 78, 3, 98, 73, 71, 34, 54, 80, 69, 20, 35, 1, 27, 42, 18, 93, 96, 60, 9, 80, 57], [2, 31, 55, 74, 66, 86, 59, 31, 40, 18, 55, 86, 79, 74, 45, 19, 83, 26, 24, 28, 15, 34, 34, 28, 66, 68, 94, 87, 19, 66, 67, 48, 38, 39, 67, 75, 23, 28, 23, 10, 65, 75, 50, 23, 85, 55], [91, 22, 56, 89, 33, 23, 8, 81, 56, 97, 2, 88, 94, 38, 61, 8, 56, 85, 68, 31, 99, 30, 75, 61, 23, 68, 10, 95, 53, 57, 55, 42, 48, 97, 23, 40, 61, 99, 30, 54, 18, 66, 83, 58, 6, 35], [46, 84, 95, 99, 63, 16, 14, 13, 55, 83, 6, 77, 77, 40, 1, 85, 53, 14, 66, 46, 99, 67, 42, 55, 11, 27, 40, 38, 81, 54, 80, 3, 52, 77, 5, 22, 75, 50, 95, 54, 88, 27, 1, 85, 6, 60], [38, 32, 53, 70, 13, 71, 48, 20, 37, 38, 25, 23, 58, 93, 34, 66, 47, 71, 50, 64, 11, 60, 45, 49, 57, 25, 42, 75, 78, 97, 58, 31, 83, 60, 53, 72, 45, 71, 22, 43, 79, 1, 81, 8, 62, 39], [53, 8, 61, 2, 80, 52, 70, 9, 47, 23, 87, 99, 41, 89, 23, 54, 5, 50, 50, 96, 51, 30, 41, 93, 90, 77, 30, 4, 63, 52, 89, 30, 72, 96, 75, 55, 74, 12, 67, 62, 3, 38, 53, 62, 80, 80], [88, 65, 51, 42, 27, 28, 91, 20, 8, 18, 46, 12, 36, 12, 41, 29, 31, 18, 27, 84, 84, 83, 96, 70, 2, 3, 40, 53, 1, 39, 16, 29, 8, 23, 38, 71, 89, 87, 92, 83, 83, 57, 3, 64, 62, 51], [76, 38, 28, 18, 53, 19, 90, 48, 7, 74, 89, 6, 10, 5, 29, 51, 59, 32, 33, 66, 4, 90, 39, 9, 90, 77, 35, 48, 29, 58, 35, 14, 72, 89, 17, 75, 45, 8, 54, 58, 40, 65, 6, 90, 26, 47], [93, 31, 76, 38, 69, 20, 19, 44, 28, 53, 95, 64, 50, 11, 27, 64, 77, 18, 24, 1, 46, 8, 77, 72, 48, 14, 87, 28, 54, 9, 63, 68, 67, 59, 37, 20, 17, 74, 6, 30, 49, 65, 50, 80, 75, 77], [76, 40, 73, 71, 21, 7, 8, 38, 60, 4, 40, 32, 18, 36, 82, 31, 29, 74, 73, 19, 51, 98, 46, 74, 98, 53, 24, 66, 7, 14, 71, 95, 4, 86, 60, 14, 80, 28, 34, 18, 49, 68, 76, 55, 72, 35], [66, 6, 48, 50, 62, 34, 10, 41, 14, 93, 60, 58, 8, 51, 31, 89, 42, 67, 29, 75, 90, 98, 58, 4, 87, 82, 29, 27, 38, 13, 70, 4, 40, 30, 81, 29, 57, 61, 90, 10, 82, 36, 9, 32, 45, 87], [76, 45, 58, 23, 90, 81, 1, 48, 12, 36, 90, 35, 36, 83, 19, 6, 17, 6, 90, 88, 26, 12, 53, 49, 23, 13, 52, 17, 30, 92, 22, 83, 64, 1, 82, 71, 67, 30, 54, 67, 64, 93, 93, 8, 45, 71], [65, 37, 45, 41, 91, 59, 22, 56, 29, 22, 12, 44, 56, 7, 73, 87, 77, 98, 9, 38, 37, 62, 86, 66, 53, 64, 73, 86, 8, 20, 8, 3, 46, 51, 11, 53, 50, 57, 26, 93, 80, 41, 34, 70, 82, 82], [77, 1, 52, 73, 66, 59, 96, 50, 60, 63, 38, 44, 26, 95, 62, 99, 37, 34, 8, 44, 31, 10, 82, 75, 82, 92, 54, 61, 3, 52, 55, 7, 48, 22, 43, 71, 50, 96, 27, 56, 44, 66, 48, 25, 27, 22], [5, 86, 67, 70, 46, 7, 43, 52, 7, 19, 85, 27, 99, 55, 1, 48, 16, 41, 2, 47, 59, 51, 21, 19, 80, 80, 8, 41, 51, 75, 74, 49, 54, 48, 73, 15, 69, 24, 96, 19, 97, 23, 28, 90, 60, 50], [76, 65, 97, 12, 56, 95, 81, 27, 85, 46, 42, 56, 77, 90, 55, 6, 91, 41, 81, 93, 62, 83, 56, 21, 31, 28, 10, 28, 47, 92, 29, 85, 9, 30, 94, 62, 88, 86, 52, 16, 30, 50, 47, 1, 51, 11], [83, 14, 96, 9, 59, 84, 27, 94, 5, 20, 93, 58, 99, 71, 9, 5, 78, 38, 97, 97, 42, 88, 50, 51, 28, 64, 62, 32, 22, 50, 18, 57, 12, 61, 86, 72, 35, 53, 64, 42, 90, 32, 46, 84, 82, 65], [28, 99, 16, 15, 46, 15, 57, 32, 82, 90, 2, 29, 28, 8, 41, 33, 74, 61, 87, 64, 7, 51, 79, 30, 70, 33, 88, 9, 24, 7, 61, 22, 5, 12, 37, 19, 91, 38, 55, 23, 54, 62, 82, 8, 44, 73], [30, 77, 76, 3, 41, 88, 95, 36, 78, 76, 33, 86, 54, 38, 92, 36, 65, 99, 67, 8, 72, 33, 71, 88, 8, 63, 43, 89, 57, 6, 20, 74, 52, 50, 61, 66, 52, 3, 3, 60, 28, 6, 90, 51, 60, 15], [32, 86, 94, 46, 87, 40, 20, 75, 67, 86, 63, 63, 48, 42, 81, 69, 30, 11, 45, 18, 58, 68, 58, 79, 95, 51, 81, 1, 88, 58, 49, 75, 89, 60, 52, 24, 80, 70, 47, 17, 45, 94, 69, 17, 11, 97]]];
int [] [] param1 = [[31, 50, 50, 68, 69, 80, 87], [-74, -50, -90, -52, 96, 78, -16, 14, -14, 66, -50, 74, -34, -88, 84, 80, 34, 18, -38, 62, 56, -48, -22, 94, 94, 94, 92, -46, -32, 10, -48, 46, 20, 80, 32, 30, 88, 60], [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], [23, 36, 42, 49, 50, 88, 97, 51, 1, 27, 4, 72, 11, 61, 24, 49, 75, 29, 96, 16, 11, 65, 13, 22, 13, 23, 84, 23, 20, 63, 35, 76, 22], [-96, -90, -90, -86, -86, -86, -84, -76, -76, -74, -72, -70, -52, -50, -34, -32, -26, -20, -16, -14, -10, -8, -8, -6, 4, 12, 14, 16, 18, 24, 26, 32, 34, 38, 42, 42, 48, 48, 48, 48, 64, 66, 70, 76, 76, 82, 86, 86, 96], [0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0], [3, 9, 32, 55, 78, 85, 90], [48, -68, 0, -54, -80], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [19, 39, 31, 50, 61, 70, 43, 64, 45, 82, 49, 80, 21, 37, 96, 30, 42, 82, 96, 30, 22, 26, 42, 88, 57, 12, 59, 58, 83, 64, 66, 2, 37, 60, 5, 76, 20, 81, 10, 57, 70, 74, 65, 72, 15, 84]];
int [] param2 = [6, 25, 28, 25, 37, 43, 5, 4, 7, 34];
int [] param3 = [5, 20, 28, 30, 38, 32, 3, 4, 10, 25];
int [] param4 = [4, 25, 32, 19, 26, 35, 3, 3, 9, 32];
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_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [3, 0, 0, 0, 0, 0, 1, 1, 0, 0];
int [] [] param0 = [[5, 5, 7, 10, 14, 14, 17, 21, 32, 34, 37, 40, 40, 40, 46, 46, 50, 50, 51, 55, 57, 62, 65, 67, 67, 69, 70, 70, 72, 73, 76, 77, 77, 78, 84, 85, 85, 86, 87, 88, 88, 89, 89, 90, 93, 99], [-84, 52, -34, 96, 16, 92, -64, -74], [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], [60, 92, 42, 83, 55, 76, 29, 62], [-94, -94, -58, -40, -40, -26, -24, -22, -22, -22, -2, 0, 4, 8, 12, 16, 16, 18, 22, 32, 42, 44, 50, 58, 64, 78, 80, 90], [0, 0, 1, 1, 1, 0, 0, 1, 1, 1], [1, 5, 7, 7, 7, 14, 15, 16, 17, 18, 18, 19, 20, 25, 27, 31, 36, 42, 47, 51, 56, 56, 56, 58, 58, 59, 63, 63, 63, 65, 66, 67, 76, 83, 93, 94, 97], [78, -74, 52, 56, -8, 92, 14, 56, -72, -92, 32, -94, -26, -8, -66, 72, -24, 36, -84, -4, -68, 14, 78, 40, -82, -10, 16, 56, 6, -16, 30, 24, -32], [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], [17, 50, 65, 4, 19, 10, 45, 70, 76, 81, 28, 97, 55, 70, 38, 2, 40, 67, 36, 33, 6, 85, 25]];
int [] [] param1 = [[2, 5, 8, 8, 10, 12, 13, 15, 17, 18, 20, 20, 21, 27, 28, 31, 34, 37, 40, 46, 48, 52, 53, 54, 54, 58, 59, 60, 66, 68, 68, 69, 70, 71, 72, 73, 77, 77, 80, 84, 84, 92, 92, 95, 97, 97], [-22, 26, -12, -54, 66, 86, 38, 76], [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, 1, 1, 1], [71, 2, 74, 42, 80, 71, 26, 76], [-86, -84, -78, -76, -72, -70, -62, -58, -54, -54, -50, -46, -44, -40, -30, -28, -16, -10, 10, 36, 36, 48, 70, 84, 84, 90, 94, 98], [1, 1, 1, 0, 1, 1, 0, 0, 0, 0], [2, 3, 7, 8, 9, 10, 17, 18, 21, 28, 29, 29, 33, 35, 46, 47, 47, 49, 49, 49, 53, 56, 58, 59, 59, 60, 65, 67, 70, 78, 81, 85, 85, 87, 90, 92, 96], [-74, 22, -14, -2, 36, 86, -70, -20, -76, -84, -40, -36, 42, 22, -60, -94, -18, 8, -14, -42, -68, 62, -60, 2, 40, -66, 68, 96, 70, 98, -38, -74, -92], [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], [78, 92, 65, 23, 7, 94, 18, 4, 2, 53, 31, 58, 98, 18, 46, 16, 17, 92, 80, 92, 43, 70, 50]];
int [] param2 = [28, 6, 37, 4, 17, 5, 28, 16, 25, 16];
int [] param3 = [29, 5, 26, 7, 27, 8, 34, 30, 33, 22];
int [] param4 = [23, 7, 42, 7, 17, 9, 31, 24, 33, 22];
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);
}
|
FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
string [] results = ["21", "12", "321", "123", "21435", "126543", "321654798", "7654321", "21", "7654321"];
string [] param0 = ["d", "i", "dd", "ii", "didi", "iiddd", "ddiddiid", "176297", "1", "xhkhzq"];
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_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [313679521, 45765225, 2550409, 974169, 54289, 20736, 1156, 441, 25, 9];
int [] param0 = [20, 18, 15, 14, 11, 10, 7, 6, 3, 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);
}
|
TEMPLE_OFFERINGS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [78, 92, 17, 15, 0, 50, 106, 16, 19, 64];
int [] param0 = [12, 46, 16, 9, 0, 38, 28, 9, 18, 29];
int [] [] param1 = [[3, 11, 12, 15, 16, 21, 24, 29, 32, 39, 42, 44, 51, 68, 79, 81, 81, 85, 92, 94], [76, 48, 88, 70, -64, 66, -6, -58, 26, -28, -42, -94, 80, -4, -56, -46, 4, 90, -12, -78, 64, 18, -38, 26, 56, -24, 66, -18, -12, 0, -94, 12, -10, 4, -68, -20, 88, 2, -58, 16, 46, -80, -42, 44, -86, 96, -44], [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], [2, 95, 20, 50, 2, 58, 20, 14, 65, 69, 78, 7], [-88], [0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0], [2, 3, 6, 8, 9, 10, 14, 17, 17, 22, 25, 27, 29, 29, 30, 32, 33, 35, 38, 42, 50, 51, 51, 57, 59, 59, 59, 60, 62, 62, 63, 67, 70, 75, 76, 77, 81, 81, 83, 84], [-52, 62, 74, -62, -58, 62, 38, 42, -50, 20], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [96, 15, 9, 9, 40, 34, 17, 4, 51, 49, 34, 66, 97, 28, 64, 65, 92, 56, 74, 48, 43, 17, 82, 8, 21, 39, 83, 35, 42, 37, 64, 34, 42, 59, 45, 61, 55, 93, 94, 29, 20, 96, 77, 66]];
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);
}
|
HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [110592, 5308416, 21233664, 82944, 1811939328, 5, 196608, 150994944, 1024, 84934656];
int [] param0 = [41, 55, 60, 40, 76, 5, 43, 67, 24, 65];
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_OCCURRENCES_CHARACTER_APPEAR_TOGETHER
|
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, true, true];
string [] param0 = ["gilrzlims", "307471222", "110", "gcab", "113", "011110010", "wcwob", "74571582216153", "100000011", "ryperkzy"];
char [] param1 = ['m', '2', '0', 'v', '3', '0', 'w', '1', '0', 'q'];
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_LARGEST_PRIME_FACTOR_NUMBER
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
long [] results = [7, 2, 13, 13, 11, 5, 5, 37, 13, 5];
long [] param0 = [98, 8, 78, 65, 55, 10, 10, 37, 39, 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);
}
|
CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
bool [] results = [true, true, false, true, true, true, false, false, false, false];
int [] param0 = [57, 3, 10, 10, 6, 2, 1, 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);
}
|
SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [23, 55, 29, 9, 22, 42, 26, 51, 1, 44];
int [] param0 = [23, 87, 35, 25, 93, 52, 95, 91, 75, 96];
int [] param1 = [98, 55, 90, 9, 22, 42, 88, 64, 1, 44];
int [] param2 = [25, 94, 29, 41, 39, 96, 26, 51, 6, 76];
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);
}
|
C_PROGRAM_FIND_LARGEST_ELEMENT_ARRAY_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [97, 84, 1, 92, 86, 1, 99, 86, 1, 98];
int [] [] param0 = [[10, 12, 14, 16, 17, 17, 20, 24, 26, 28, 37, 38, 41, 45, 49, 50, 59, 61, 63, 65, 65, 66, 69, 70, 70, 73, 73, 74, 81, 81, 83, 87, 94, 97], [-56, 38, -22, 84, -60, 2, 68, -78, 62, -98, 24, 26, 48, 62, -80, -14, -84, 12, -54, -12, -20, -82, 10, -34, -50, -72, 78, 16, 30, -76, 72, 34, 6, 52, 44, 18, -38, 48, -14], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [92, 5, 40, 65, 86, 51, 14, 29, 66, 6, 62, 92, 29, 13, 88, 54, 15, 60, 45, 2, 51, 9, 33, 51, 31, 11, 62, 61, 77, 38, 11, 4, 27, 54, 72, 64, 85, 46, 24, 44, 39, 73, 82, 85], [-92, -90, -84, -80, -80, -76, -70, -70, -48, -44, -38, -28, -14, -14, -12, -2, 2, 4, 6, 10, 16, 16, 20, 22, 24, 26, 50, 52, 56, 56, 58, 58, 74, 80, 82, 84, 86], [0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0], [5, 19, 20, 26, 31, 32, 34, 37, 39, 40, 46, 46, 50, 53, 58, 58, 59, 65, 72, 72, 75, 76, 77, 78, 81, 83, 83, 95, 98, 99], [32, -84, -84, 86, -24, 36, -12, 82, 48, -12, 82, -76, 84, -20, -12, -18, 46, -74, -14, -86], [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], [95, 73, 74, 14, 73, 74, 19, 93, 34, 53, 85, 75, 80, 15, 36, 57, 15, 98, 51, 37, 8, 9, 62, 71, 28, 24, 37, 53, 84, 76, 22, 48, 15, 19, 43, 88, 58, 38, 63, 68, 27, 22, 37, 76, 59, 66, 22]];
int [] param1 = [34, 39, 17, 44, 37, 37, 30, 20, 38, 47];
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_SUBARRAYS_EQUAL_NUMBER_1S_0S_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 2, 14, 0, 0, 32, 0, 6, 7, 0];
int [] [] param0 = [[1, 6, 6, 9, 9, 9, 16, 18, 19, 20, 21, 22, 23, 26, 26, 28, 39, 40, 41, 43, 43, 44, 44, 45, 51, 51, 55, 59, 60, 62, 67, 67, 68, 69, 70, 71, 71, 72, 82, 84, 88, 88, 89, 89, 91, 92, 92], [-44, 74, -52, -96, 46, 92, 54, 56, -38, 88, 40, 34, -72, 8, 58, -14, 36, 94, 34, -90, -42, 80, -12, -42, -6, 78, -98, 34, -88, -1, -76, 90, 40, 64, 26, 18, -84, 72, 80], [-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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [60, 48, 42, 95, 30, 22, 80, 15, 62, 38, 63, 42, 39, 28, 69, 71, 30, 48, 67, 9, 33, 74, 95, 95, 72, 35, 9], [-96, -94, -94, -86, -66, -66, -62, -58, -36, -36, -22, -18, -10, 2, 4, 6, 10, 16, 20, 24, 26, 28, 28, 28, 40, 42, 44, 58, 76, 78, 78, 80, 90, 92], [-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, 0, 1, 1], [4, 5, 5, 6, 7, 11, 16, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 29, 31, 34, 36, 37, 40, 41, 45, 45, 55, 65, 69, 70, 71, 71, 71, 73, 73, 76, 79, 80, 85, 85, 88, 90, 97, 98, 98, 99, 99], [34, -20, 38, -94, 2, 32, -26, 90, 94, -36, -94, 6, -24, 12, 4, 60, 68, 64, -60, -72, -54, -10, -64, -48, -88, 60, 48, 64, -1, -26, 26, 74, 32, -92, 4, 84, 6, -16, 30, -56, -28, -86, -68], [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 99, 97, 63, 65, 57, 69, 39, 29, 91, 68, 25, 84, 82, 84, 89, 59, 18, 77, 29, 57, 40, 78, 35, 23, 91, 26, 71, 19, 99, 12, 91, 49, 71, 49, 77, 67]];
int [] param1 = [44, 37, 32, 18, 24, 28, 31, 37, 19, 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);
}
|
DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1162261467, 86093442, 6377292, 531441, 39366, 2916, 243, 18, 1];
int [] param0 = [57, 50, 43, 36, 29, 22, 15, 8, 1];
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);
}
|
AREA_SQUARE_CIRCUMSCRIBED_CIRCLE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [392, 12168, 4050, 8712, 648, 2048, 7200, 512, 19602, 8450];
int [] param0 = [14, 78, 45, 66, 18, 32, 60, 16, 99, 65];
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);
}
|
GOOGLE_CASE_GIVEN_SENTENCE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
string [] results = ["teyndweqza", "01865", "11001100", "czwznjmqet", "318305446", "0000001111110", "yzt", "38630230", "01101", "zoizi"];
string [] param0 = ["teyndweqza", "01865", "11001100", "czwznjmqet", "318305446", "0000001111110", "yzt", "38630230", "01101", "zoizi"];
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);
}
|
NEXT_POWER_OF_2_2
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [64, 128, 16, 8, 64, 128, 64, 128, 128, 32];
int [] param0 = [63, 78, 13, 5, 34, 69, 63, 78, 80, 19];
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
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [2, 4, 1, 3, 10, 2, 2, 6, 0, 9];
string [] param0 = ["ydydv", "4446057", "0111", "keej", "642861576557", "11111000101", "ram", "09773261", "1", "avbekclfdj"];
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);
}
|
LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [0, 1, 1, 1, 1, 3, 4, 1, 2, 2];
int [] [] param0 = [[78], [-6, -18, -48, 58, -54, 76, 80, -56, 86, 58, -86, -86, -88, 32, 12, 58, 58, -16, 86, -24, 84, 86, 36, 18, 30, -32, -4, -36, -72, -4, 42, 94], [0, 1], [92, 26, 72, 8, 66, 28, 34, 61, 28], [-86, -82, -76, -68, -66, -64, -62, -56, -48, -42, -38, -30, -22, -18, -10, -10, -4, -2, 4, 28, 42, 44, 50, 50, 56, 58, 60, 76, 82, 86, 86, 98], [0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0], [3, 4, 8, 9, 12, 13, 16, 19, 23, 25, 29, 31, 34, 36, 38, 41, 42, 47, 49, 50, 51, 51, 58, 63, 66, 70, 73, 74, 75, 75, 75, 76, 76, 80, 82, 83, 83, 84, 86, 89, 90, 91, 91, 95, 96], [4, -76, 60, 48, -14, 72], [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], [66, 80, 79, 72, 1, 67, 20, 67, 32, 40, 22, 64, 58, 67, 10, 21, 37, 49]];
int [] param1 = [0, 18, 1, 5, 25, 17, 44, 3, 17, 15];
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);
}
|
POSITION_OF_RIGHTMOST_SET_BIT
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [1, 2, 2, 5, 2, 1, 5, 1, 1, 1];
int [] param0 = [45, 26, 74, 80, 46, 67, 16, 87, 27, 17];
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);
}
|
LOWER_INSERTION_POINT
|
import std.stdio;
import std.math;
import std.conv;
import std.algorithm;
//TOFILL//
void main(){
int [] results = [8, 14, 8, 0, 19, 12, 8, 2, 3, 0];
int [] [] param0 = [[1, 2, 5, 5, 16, 16, 20, 26, 32, 35, 39, 39, 41, 44, 48, 48, 51, 59, 59, 62, 66, 66, 70, 74, 75, 78, 80, 86, 86, 96], [-76, 80, -6, -2, 50, 72, 84, -56, 70, 8, 48, 6, -24, -50, -72], [0, 0, 0, 0, 0, 1, 1, 1, 1], [74, 65, 84, 71], [-96, -92, -90, -86, -84, -76, -76, -62, -58, -54, -50, -50, -44, -42, -38, -34, -14, -8, 6, 12, 24, 38, 40, 50, 62, 84, 86, 92], [1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1], [6, 10, 14, 14, 16, 19, 23, 23, 25, 26, 29, 34, 42, 42, 43, 45, 47, 49, 50, 51, 51, 56, 59, 65, 69, 72, 75, 78, 79, 80, 82, 82, 82, 84, 85, 91, 98], [-90, -2, 22, -2, 58, -2, 96, 38, 36, -66, -98, 22, -80, -32, 22, 0, -34, -16, 82, 76, 12, 84, 66, 8, 32, 18, -98, -10], [0, 0, 0, 1, 1, 1, 1], [85, 59, 22, 52, 93, 14, 42, 71, 69, 15, 52, 78, 35, 61, 92, 90, 70, 48, 47, 72, 74, 46, 22, 74, 83, 32, 14, 24, 18, 27, 18, 68, 29, 31]];
int [] param1 = [17, 14, 8, 2, 19, 12, 31, 22, 3, 19];
int [] param2 = [29, 9, 4, 3, 19, 17, 24, 16, 5, 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);
}
|
End of preview. Expand
in Data Studio
No dataset card yet
- Downloads last month
- 5
Size of downloaded dataset files:
1.34 MB
Size of the auto-converted Parquet files:
527 kB
Number of rows:
600