id,function_java,d_with_params ADD_1_TO_A_GIVEN_NUMBER,"static int f_filled ( int x ) { int m = 1 ; while ( ( int ) ( x & m ) >= 1 ) { x = x ^ m ; m <<= 1 ; } x = x ^ m ; return x ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [97, 67, 68, 14, 76, 79, 2, 84, 28, 66]; int [] param0 = [96, 66, 67, 13, 75, 78, 1, 83, 27, 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); } " PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD,"static boolean f_filled ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; }","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); } " ADD_1_TO_A_GIVEN_NUMBER_1,"static int f_filled ( int x ) { return ( - ( ~ x ) ) ; }","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); } " COUNT_SORTED_ROWS_MATRIX,"static int f_filled ( int mat [ ] [ ] , int r , int c ) { int result = 0 ; for ( int i = 0 ; i < r ; i ++ ) { int j ; for ( j = 0 ; j < c - 1 ; j ++ ) if ( mat [ i ] [ j + 1 ] <= mat [ i ] [ j ] ) break ; if ( j == c - 1 ) result ++ ; } for ( int i = 0 ; i < r ; i ++ ) { int j ; for ( j = c - 1 ; j > 0 ; j -- ) if ( mat [ i ] [ j - 1 ] <= mat [ i ] [ j ] ) break ; if ( c > 1 && j == 0 ) result ++ ; } return result ; }","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); } " ADD_TWO_NUMBERS_WITHOUT_USING_ARITHMETIC_OPERATORS,"static int f_filled ( int x , int y ) { while ( y != 0 ) { int carry = x & y ; x = x ^ y ; y = carry << 1 ; } return x ; }","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); } " FIND_MINIMUM_NUMBER_DIVIDED_MAKE_NUMBER_PERFECT_SQUARE,"static int f_filled ( int n ) { int count = 0 , ans = 1 ; while ( n % 2 == 0 ) { count ++ ; n /= 2 ; } if ( count % 2 == 1 ) ans *= 2 ; for ( int i = 3 ; i <= Math . sqrt ( n ) ; i += 2 ) { count = 0 ; while ( n % i == 0 ) { count ++ ; n /= i ; } if ( count % 2 == 1 ) ans *= i ; } if ( n > 2 ) ans *= n ; return ans ; }","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); } " ANALYSIS_OF_ALGORITHMS_SET_2_ASYMPTOTIC_ANALYSIS,"static int f_filled ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == x ) { return i ; } } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, -1, 0, 2, -1, -1, 1, -1, -1, -1]; int [] [] param0 = [[4, 5, 5, 11, 13, 14, 15, 19, 22, 22, 23, 26, 29, 29, 36, 44, 48, 49, 65, 65, 67, 68, 70, 76, 79, 79, 81, 85, 88, 91, 91, 92, 92, 97], [-24, -78, -32, -48, 0, 4, -42], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [38, 14, 75, 16, 91, 11, 98, 43, 67, 9, 21, 10, 82, 72, 32, 81, 48, 60, 2, 91, 10, 90, 12, 83], [-92, -92, -82, -80, -76, -66, -64, -64, -56, -48, -38, -38, -34, -32, -32, -10, -8, -6, -2, 0, 8, 10, 18, 20, 22, 22, 30, 34, 38, 38, 38, 44, 50, 52, 56, 64, 64, 66, 70, 76, 88], [0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], [1, 4, 4, 4, 4, 8, 12, 13, 14, 14, 22, 25, 25, 27, 29, 33, 36, 38, 40, 40, 40, 41, 47, 47, 47, 48, 48, 50, 51, 52, 52, 52, 55, 56, 59, 59, 62, 64, 66, 77, 82, 84, 90, 91, 91, 93], [-90, -60, -58, -72, 92, 54, -32, -70, -94, 18, 64, -90, -90, -56, 82, -14, -74, -96, -90, -8, -48, 76, -28, 10, -52, -8, -46, -32, 82, 46, 58, 92, 4, 48, -96, -66, 60, 60, 62, -68], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [42, 17, 77, 96, 72, 36, 74, 97, 7, 94, 80, 7, 27, 58, 49, 81, 51, 9]]; int [] param1 = [17, 4, 6, 17, 25, 11, 38, 22, 8, 16]; int [] param2 = [5, 0, 0, 75, 25, -1, 4, 22, 8, 11]; 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_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2,"static int f_filled ( int n ) { int res = 0 ; for ( int x = 0 ; x * x < n ; x ++ ) for ( int y = 0 ; x * x + y * y < n ; y ++ ) res ++ ; return res ; }","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); } " AREA_OF_A_HEXAGON,"static double f_filled ( double s ) { return ( ( 3 * Math . sqrt ( 3 ) * ( s * s ) ) / 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [8163986.207300422, 934487.9989101035, 2997804.1448343466, 3632345.696441302, 169746524.38794258, 97513471.98905805, 74922068.46663411, 125386010.4299519, 11572495.990484647, 108379966.88267714]; double [] param0 = [1772.6589509256596, -599.737107809315, 1074.1765931782, -1182.4087746714795, 8083.035797247716, -6126.414356565494, 5370.057504189614, -6947.020794285176, 2110.5107873533325, -6458.751326919488]; 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); } " DISTRIBUTING_M_ITEMS_CIRCLE_SIZE_N_STARTING_K_TH_POSITION,"static int f_filled ( int n , int m , int k ) { if ( m <= n - k + 1 ) return m + k - 1 ; m = m - ( n - k + 1 ) ; return ( m % n == 0 ) ? n : ( m % n ) ; }","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); } " AREA_OF_THE_CIRCLE_THAT_HAS_A_SQUARE_AND_A_CIRCLE_INSCRIBED_IN_IT,"static float f_filled ( int a ) { float area = ( float ) ( Math . PI * a * a ) / 4 ; return area ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [4656.625710783471, 254.46900494077323, 5410.607947645021, 1194.5906065275187, 3631.6811075498013, 615.7521601035994, 3959.192141686537, 153.93804002589985, 346.36059005827474, 4185.386812745001]; int [] param0 = [77, 18, 83, 39, 68, 28, 71, 14, 21, 73]; 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); } " DOUBLE_FACTORIAL_1,"static int f_filled ( int n ) { int res = 1 ; for ( int i = n ; i >= 0 ; i = i - 2 ) { if ( i == 0 || i == 1 ) return res ; else res *= i ; } return res ; }","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); } " AREA_SQUARE_CIRCUMSCRIBED_CIRCLE,"static int f_filled ( int r ) { return ( 2 * r * r ) ; }","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); } " EFFICIENT_SEARCH_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_IS_1,"static int f_filled ( int arr [ ] , int n , int x ) { int i = 0 ; while ( i <= n - 1 ) { if ( arr [ i ] == x ) return i ; i += Math . abs ( arr [ i ] - x ) ; } return - 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); } " ARRAY_ELEMENT_MOVED_K_USING_SINGLE_MOVES,"static int f_filled ( int a [ ] , int n , int k ) { if ( k >= n - 1 ) return n ; int best = 0 , times = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] > best ) { best = a [ i ] ; if ( i == 1 ) times = 1 ; } else times += 1 ; if ( times >= k ) return best ; } return best ; }","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); } " N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_1,"static int f_filled ( int n ) { int count = 0 ; for ( int curr = 19 ; ; curr += 9 ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / 10 ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } }","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); } " ARRAY_RANGE_QUERIES_ELEMENTS_FREQUENCY_VALUE,"static int f_filled ( int start , int end , int arr [ ] ) { Map < Integer , Integer > mp = new HashMap < > ( ) ; for ( int i = start ; i <= end ; i ++ ) mp . put ( arr [ i ] , mp . get ( arr [ i ] ) == null ? 1 : mp . get ( arr [ i ] ) + 1 ) ; int count = 0 ; for ( Map . Entry < Integer , Integer > entry : mp . entrySet ( ) ) if ( entry . getKey ( ) == entry . getValue ( ) ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 2, 1, 0, 0, 1, 0, 0, 0, 0]; int [] param0 = [0, 1, 3, 10, 2, 0, 14, 29, 31, 21]; int [] param1 = [31, 25, 4, 15, 3, 6, 18, 33, 19, 32]; int [] [] param2 = [[1, 2, 2, 3, 3, 3, 12, 13, 18, 18, 26, 28, 29, 36, 37, 39, 40, 49, 55, 57, 63, 69, 69, 73, 85, 86, 87, 87, 89, 89, 90, 91, 92, 93, 93, 93, 95, 99], [24, -62, 2, 1, 94, 56, -22, -70, -22, -34, -92, -18, 56, 2, 60, 38, -88, 16, -28, 30, -30, 58, -80, 94, 6, 56], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [84, 13, 81, 40, 87, 82, 50, 30, 90, 80, 81, 70, 14, 54, 72, 93, 78, 27, 61], [-20, 20, 34, 60, 90], [1, 0, 0, 0, 0, 0, 0, 0, 0, 0], [11, 18, 18, 19, 25, 30, 42, 42, 56, 58, 63, 66, 67, 68, 69, 75, 78, 83, 83], [-24, -82, 24, -84, 94, 2, -30, 86, 58, -56, -96, 60, -38, 76, 94, 74, -98, -84, -38, 46, 4, -84, -90, -28, -50, 46, 16, 28, -14, -82, -64, 42, 64, -2, -40, 96, 60, 2, -86, 32, 38, -66], [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], [2, 91, 42, 85, 97, 92, 24, 39, 63, 89, 31, 59, 51, 89, 72, 62, 26, 92, 75, 4, 6, 13, 20, 95, 22, 30, 52, 60, 37, 27, 49, 15, 67, 26]]; 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); } " BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS,"static int f_filled ( int a , int b ) { if ( a == 0 ) return b ; return f_filled ( b % a , a ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 2, 4, 2, 1, 1, 1, 3, 2, 1]; int [] param0 = [46, 26, 40, 58, 25, 2, 8, 21, 82, 17]; int [] param1 = [89, 82, 12, 4, 44, 87, 65, 87, 10, 61]; 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_POSSIBLE_SUM_WINDOW_ARRAY_ELEMENTS_WINDOW_ARRAY_UNIQUE,"static int f_filled ( int A [ ] , int B [ ] , int n ) { Set < Integer > mp = new HashSet < Integer > ( ) ; int result = 0 ; int curr_sum = 0 , curr_begin = 0 ; for ( int i = 0 ; i < n ; ++ i ) { while ( mp . contains ( A [ i ] ) ) { mp . remove ( A [ curr_begin ] ) ; curr_sum -= B [ curr_begin ] ; curr_begin ++ ; } mp . add ( A [ i ] ) ; curr_sum += B [ i ] ; result = Integer . max ( result , curr_sum ) ; } return result ; }","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); } " BASIC_AND_EXTENDED_EUCLIDEAN_ALGORITHMS_1,"static int f_filled ( int a , int b , int x , int y ) { if ( a == 0 ) { x = 0 ; y = 1 ; return b ; } int x1 = 1 , y1 = 1 ; int gcd = f_filled ( b % a , a , x1 , y1 ) ; x = y1 - ( b / a ) * x1 ; y = x1 ; return gcd ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 3, 1, 4, 16, 1, 1, 1, 1, 1]; int [] param0 = [44, 33, 39, 52, 64, 45, 53, 86, 57, 11]; int [] param1 = [17, 81, 77, 96, 48, 32, 88, 19, 67, 86]; int [] param2 = [10, 67, 21, 23, 17, 89, 24, 29, 30, 96]; int [] param3 = [65, 20, 34, 97, 33, 3, 74, 21, 32, 81]; 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); } " DYNAMIC_PROGRAMMING_SET_37_BOOLEAN_PARENTHESIZATION_PROBLEM,"static int f_filled ( char symb [ ] , char oper [ ] , int n ) { int F [ ] [ ] = new int [ n ] [ n ] ; int T [ ] [ ] = new int [ n ] [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { F [ i ] [ i ] = ( symb [ i ] == 'F' ) ? 1 : 0 ; T [ i ] [ i ] = ( symb [ i ] == 'T' ) ? 1 : 0 ; } for ( int gap = 1 ; gap < n ; ++ gap ) { for ( int i = 0 , j = gap ; j < n ; ++ i , ++ j ) { T [ i ] [ j ] = F [ i ] [ j ] = 0 ; for ( int g = 0 ; g < gap ; g ++ ) { int k = i + g ; int tik = T [ i ] [ k ] + F [ i ] [ k ] ; int tkj = T [ k + 1 ] [ j ] + F [ k + 1 ] [ j ] ; if ( oper [ k ] == '&' ) { T [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] ; F [ i ] [ j ] += ( tik * tkj - T [ i ] [ k ] * T [ k + 1 ] [ j ] ) ; } if ( oper [ k ] == '|' ) { F [ i ] [ j ] += F [ i ] [ k ] * F [ k + 1 ] [ j ] ; T [ i ] [ j ] += ( tik * tkj - F [ i ] [ k ] * F [ k + 1 ] [ j ] ) ; } if ( oper [ k ] == '^' ) { T [ i ] [ j ] += F [ i ] [ k ] * T [ k + 1 ] [ j ] + T [ i ] [ k ] * F [ k + 1 ] [ j ] ; F [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] + F [ i ] [ k ] * F [ k + 1 ] [ j ] ; } } } } return T [ 0 ] [ n - 1 ] ; }","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); } " BELL_NUMBERS_NUMBER_OF_WAYS_TO_PARTITION_A_SET,"static int f_filled ( int n ) { int [ ] [ ] bell = new int [ n + 1 ] [ n + 1 ] ; bell [ 0 ] [ 0 ] = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { bell [ i ] [ 0 ] = bell [ i - 1 ] [ i - 1 ] ; for ( int j = 1 ; j <= i ; j ++ ) bell [ i ] [ j ] = bell [ i - 1 ] [ j - 1 ] + bell [ i ] [ j - 1 ] ; } return bell [ n ] [ 0 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, 27644437, 190899322, 1382958545]; int [] param0 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 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_GIVEN_CIRCLE_LIES_COMPLETELY_INSIDE_RING_FORMED_TWO_CONCENTRIC_CIRCLES,"static boolean f_filled ( int r , int R , int r1 , int x1 , int y1 ) { int dis = ( int ) Math . sqrt ( x1 * x1 + y1 * y1 ) ; return ( dis - r1 >= R && dis + r1 <= r ) ; }","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); } " BINARY_REPRESENTATION_OF_NEXT_NUMBER,"static String f_filled ( String num ) { int l = num . length ( ) ; int i ; for ( i = l - 1 ; i >= 0 ; i -- ) { if ( num . charAt ( i ) == '0' ) { num = num . substring ( 0 , i ) + '1' + num . substring ( i + 1 ) ; break ; } else { num = num . substring ( 0 , i ) + '0' + num . substring ( i + 1 ) ; } } if ( i < 0 ) { num = ""1"" + num ; } return num ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""1000"", ""48710000000000"", ""0010"", ""10000000000"", ""8410000000"", ""10"", ""10000000000"", ""100000000"", ""001110"", ""1000000000""]; string [] param0 = [""dxh"", ""48703586411816"", ""0001"", ""ywg wvjnks"", ""8408568459"", ""01"", ""dfecz cwtn"", ""37742236"", ""001101"", ""ldxerlmyn""]; 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_SUBSEQUENCES_FORM_AI_BJ_CK,"static int f_filled ( String s ) { int aCount = 0 ; int bCount = 0 ; int cCount = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == 'a' ) aCount = ( 1 + 2 * aCount ) ; else if ( s . charAt ( i ) == 'b' ) bCount = ( aCount + 2 * bCount ) ; else if ( s . charAt ( i ) == 'c' ) cCount = ( bCount + 2 * cCount ) ; } return cCount ; }","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); } " BINARY_SEARCH,"static int f_filled ( int arr [ ] , int l , int r , int x ) { if ( r >= l ) { int mid = l + ( r - l ) / 2 ; if ( arr [ mid ] == x ) return mid ; if ( arr [ mid ] > x ) return f_filled ( arr , l , mid - 1 , x ) ; return f_filled ( arr , mid + 1 , r , x ) ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, 1, -1, -1, -1, -1, -1, -1, -1]; int [] [] param0 = [[3, 4, 4, 8, 9, 13, 13, 15, 18, 27, 30, 32, 42, 48, 50, 52, 56, 66, 69, 69, 77, 84, 84, 93], [52, -58, -22, -80, 44, -52, -34, 94, -34, -74, 42, 60, -62, 70, 98, 32, 10, 94, 26, 56, -48, -50, 42, 2, 46, 28, -68, -16, -96, -12, 66, -46, 74, -60, -52, 28, -92, -78, 32, 28, 16, 34, 30, -60, -14], [0, 1], [28, 84, 40, 81], [-66, -62, -60, -56, -56, -2, 40, 44, 50, 74, 82, 94], [1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1], [15, 26, 31, 36, 36, 61, 68, 72, 75, 79, 82, 98], [0, -82, -94, 48, 48, -96, 14, 66, 76, -30, 86, 28, -28, -66, -64, 92, -94, -66, 86, 26, 8, 94, -82, -80, 4, -26, 76, -46, 72, 88, -6, 8, -30, 40, -88, 2, -40, -98, -22, -20, 4, -12, 54, -20, -36, 12], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [81, 47]]; int [] param1 = [19, 40, 1, 2, 8, 7, 6, 38, 12, 1]; int [] param2 = [12, 35, 1, 2, 6, 7, 7, 33, 10, 1]; int [] param3 = [22, 44, 1, 2, 8, 10, 8, 39, 6, 1]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_REPETITIVE_ELEMENT_1_N_1,"static int f_filled ( int [ ] arr , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += arr [ i ] ; return sum - ( ( ( n - 1 ) * n ) / 2 ) ; }","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); } " BREAKING_NUMBER_FIRST_PART_INTEGRAL_DIVISION_SECOND_POWER_10,"static int f_filled ( String N ) { int len = N . length ( ) ; int l = ( len ) / 2 ; int count = 0 ; for ( int i = 1 ; i <= l ; i ++ ) { String s = N . substring ( 0 , i ) ; int l1 = s . length ( ) ; String t = N . substring ( i , l1 + i ) ; if ( s . charAt ( 0 ) == '0' || t . charAt ( 0 ) == '0' ) continue ; if ( s . compareTo ( t ) == 0 ) count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 1, 0, 0, 2, 0, 0, 1, 2]; string [] param0 = [""zcoqhum"", ""2674377254"", ""11"", ""lbuglvrywapbpo"", ""26382426486138"", ""111010111010"", ""huinqjxndbfp"", ""5191"", ""1110101101"", ""2202200""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FRIENDS_PAIRING_PROBLEM,"static int f_filled ( int n ) { int dp [ ] = new int [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) { if ( i <= 2 ) dp [ i ] = i ; else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ] ; } return dp [ n ] ; }","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); } " BREAK_NUMBER_THREE_PARTS,"static long f_filled ( long n ) { long count = 0 ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n ; j ++ ) for ( int k = 0 ; k <= n ; k ++ ) if ( i + j + k == n ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [1431, 1176, 2926, 703, 2415, 153, 5050, 780, 3655, 1081]; long [] param0 = [52, 47, 75, 36, 68, 16, 99, 38, 84, 45]; 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,"static boolean f_filled ( int arr [ ] , int n ) { int remainder = 0 ; for ( int i = 0 ; i < n ; i ++ ) remainder = ( remainder + arr [ i ] ) % 3 ; return ( remainder == 0 ) ; }","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); } " BREAK_NUMBER_THREE_PARTS_1,"static long f_filled ( long n ) { long count = 0 ; count = ( n + 1 ) * ( n + 2 ) / 2 ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [2628, 2628, 703, 10, 4851, 2485, 136, 1225, 3081, 28]; long [] param0 = [71, 71, 36, 3, 97, 69, 15, 48, 77, 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); } " NUMBER_JUMP_REQUIRED_GIVEN_LENGTH_REACH_POINT_FORM_D_0_ORIGIN_2D_PLANE,"static int f_filled ( int a , int b , int d ) { int temp = a ; a = Math . min ( a , b ) ; b = Math . max ( temp , b ) ; if ( d >= b ) return ( d + b - 1 ) / b ; if ( d == 0 ) return 0 ; if ( d == a ) return 1 ; return 2 ; }","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); } " CALCULATE_ANGLE_HOUR_HAND_MINUTE_HAND,"static int f_filled ( double h , double m ) { if ( h < 0 || m < 0 || h > 12 || m > 60 ) System . out . println ( ""Wrong input"" ) ; if ( h == 12 ) h = 0 ; if ( m == 60 ) m = 0 ; int hour_angle = ( int ) ( 0.5 * ( h * 60 + m ) ) ; int minute_angle = ( int ) ( 6 * m ) ; int angle = Math . abs ( hour_angle - minute_angle ) ; angle = Math . min ( 360 - angle , angle ) ; return angle ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-180831, -15630, -251193, -111919, -208740, -268510, -287700, -138167, -10289, -32987]; double [] param0 = [7322.337365895532, -0.5025472034247969, 8735.336068205026, -5478.862697905712, 8264.126919165505, -9671.311773842834, 9995.328351000411, -5274.574323066984, 1310.8711644223736, -2829.678131972794]; double [] param1 = [6996.326968156217, -2910.070017192333, 1910.3752934680874, -9470.18148108585, 7058.937313484608, -3867.070379361206, 2145.339179488316, -3583.7503371694124, 5214.059687285893, -9371.556600288217]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MULTIPLY_LARGE_INTEGERS_UNDER_LARGE_MODULO,"static long f_filled ( long a , long b , long mod ) { long res = 0 ; a %= mod ; while ( b > 0 ) { if ( ( b & 1 ) > 0 ) { res = ( res + a ) % mod ; } a = ( 2 * a ) % mod ; b >>= 1 ; } return res ; }","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); } " CALCULATE_AREA_TETRAHEDRON,"static double f_filled ( int side ) { double volume = ( Math . pow ( side , 3 ) / ( 6 * Math . sqrt ( 2 ) ) ) ; return volume ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [22994.17, 20696.54, 5052.87, 114350.83, 258.92, 10739.18, 7542.47, 91769.26, 40.42, 258.92]; int [] param0 = [58, 56, 35, 99, 13, 45, 40, 92, 7, 13]; 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_SUBARRAY_SUM_USING_PREFIX_SUM,"static int f_filled ( int arr [ ] , int n ) { int min_prefix_sum = 0 ; int res = Integer . MIN_VALUE ; int prefix_sum [ ] = new int [ n ] ; prefix_sum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) prefix_sum [ i ] = prefix_sum [ i - 1 ] + arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) { res = Math . max ( res , prefix_sum [ i ] - min_prefix_sum ) ; min_prefix_sum = Math . min ( min_prefix_sum , prefix_sum [ i ] ) ; } return res ; }","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); } " CALCULATE_MAXIMUM_VALUE_USING_SIGN_TWO_NUMBERS_STRING,"static int f_filled ( String str ) { int res = str . charAt ( 0 ) - '0' ; for ( int i = 1 ; i < str . length ( ) ; i ++ ) { if ( str . charAt ( i ) == '0' || str . charAt ( i ) == '1' || res < 2 ) res += ( str . charAt ( i ) - '0' ) ; else res *= ( str . charAt ( i ) - '0' ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2176, 368, 1, 25621500, 6272, 4, -303, 5670, 0, 66]; string [] param0 = [""pr"", ""9518"", ""1"", ""nnmci"", ""3170487"", ""0100101010"", ""z roncuqwb"", ""00419297"", ""00"", ""r""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUM_BITONIC_SUBARRAY,"static int f_filled ( int arr [ ] , int n ) { int [ ] msis = new int [ n ] ; int [ ] msds = new int [ n ] ; int max_sum = Integer . MIN_VALUE ; msis [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i ] > arr [ i - 1 ] ) msis [ i ] = msis [ i - 1 ] + arr [ i ] ; else msis [ i ] = arr [ i ] ; msds [ n - 1 ] = arr [ n - 1 ] ; for ( int i = n - 2 ; i >= 0 ; i -- ) if ( arr [ i ] > arr [ i + 1 ] ) msds [ i ] = msds [ i + 1 ] + arr [ i ] ; else msds [ i ] = arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) if ( max_sum < ( msis [ i ] + msds [ i ] - arr [ i ] ) ) max_sum = msis [ i ] + msds [ i ] - arr [ i ] ; return max_sum ; }","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); } " CALCULATE_VOLUME_DODECAHEDRON,"static double f_filled ( int side ) { return ( ( ( 15 + ( 7 * ( Math . sqrt ( 5 ) ) ) ) / 4 ) * ( Math . pow ( side , 3 ) ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [1345766.2993890555, 2981083.5487053124, 81596.89069273109, 7663.118960624633, 4541961.260438062, 61304.95168499706, 1016520.3932458181, 5774704.218276865, 7663.118960624633, 4381671.801138677]; int [] param0 = [56, 73, 22, 10, 84, 20, 51, 91, 10, 83]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " NEXT_HIGHER_NUMBER_WITH_SAME_NUMBER_OF_SET_BITS,"static int f_filled ( int x ) { int rightOne , nextHigherOneBit , rightOnesPattern , next = 0 ; if ( x > 0 ) { rightOne = x & - x ; nextHigherOneBit = x + rightOne ; rightOnesPattern = x ^ nextHigherOneBit ; rightOnesPattern = ( rightOnesPattern ) / rightOne ; rightOnesPattern >>= 2 ; next = nextHigherOneBit | rightOnesPattern ; } return next ; }","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,"static boolean f_filled ( int arr [ ] , int n ) { if ( n == 0 || n == 1 ) return true ; for ( int i = 1 ; i < n ; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false ; return true ; }","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); } " CASSINIS_IDENTITY,"static int f_filled ( int n ) { return ( n & 1 ) != 0 ? - 1 : 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 1, 1, 1, 1, -1, -1, 1, -1, 1]; int [] param0 = [67, 2, 58, 6, 42, 17, 37, 44, 23, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " NUMBER_OF_TRIANGLES_IN_A_PLANE_IF_NO_MORE_THAN_TWO_POINTS_ARE_COLLINEAR,"static int f_filled ( int n ) { return n * ( n - 1 ) * ( n - 2 ) / 6 ; }","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); } " CEILING_IN_A_SORTED_ARRAY,"static int f_filled ( int arr [ ] , int low , int high , int x ) { int i ; if ( x <= arr [ low ] ) return low ; for ( i = low ; i < high ; i ++ ) { if ( arr [ i ] == x ) return i ; if ( arr [ i ] < x && arr [ i + 1 ] >= x ) return i + 1 ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [28, 36, -1, 23, 9, -1, 9, -1, -1, 46]; int [] [] param0 = [[2, 3, 4, 6, 8, 9, 9, 10, 11, 16, 19, 20, 21, 21, 21, 24, 24, 25, 28, 30, 30, 30, 32, 34, 35, 39, 41, 42, 49, 52, 57, 59, 61, 62, 66, 68, 71, 73, 76, 79, 83, 84, 85, 86, 87, 87], [92, 50, -84, 60, 32, -54, 84, -82, -42, -72, -64, -28, -48, 66, 92, -42, 42, -66, 52, -30, 48, 42, 36, -4, 64, 62, -16, 0, 20, 26, 78, 78, 12, -6, -30, -14, 76, 72, 70, -34, 98, 32], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [26, 68, 73, 76, 14, 19, 56, 80, 17, 7, 15, 64, 99, 98, 21, 21, 72, 12, 14, 10, 44, 82, 25, 42, 46, 86, 79, 43, 91], [-90, -86, -84, -50, -30, -24, -12, -2, 8, 22, 30, 44, 58, 58, 60, 60, 62, 90], [0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1], [2, 2, 29, 31, 34, 39, 48, 50, 56, 61, 66, 66, 69, 73, 88], [-98, 48, -58, 8, 70, 62, 92, 84, -58, -46, -26, -92, 18, -88, 40, -12, 60, 14, 54, -64, 88, 52, -44, 88, -46, -8, 36, -22, 28, -20, -50, 58, -82, -44, -44, 54, -86, 40, 10, 0, -24, -84, -10, 62, 58, 0, -88], [0, 0, 0, 0, 1, 1], [56, 30, 33, 5, 67, 35, 22, 54, 36, 55, 94, 89, 40, 65, 29, 76, 17, 14, 14, 49, 40, 44, 35, 69, 63, 2, 81, 78, 19, 67, 12, 14, 68, 30, 82, 85, 12, 2, 94, 33, 85, 75, 97, 31, 69, 31, 85, 26]]; int [] param1 = [23, 36, 11, 23, 9, 12, 9, 40, 5, 46]; int [] param2 = [37, 35, 9, 27, 16, 15, 12, 29, 5, 47]; int [] param3 = [44, 34, 13, 26, 10, 18, 10, 24, 5, 47]; 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_MAXIMUM_DOT_PRODUCT_TWO_ARRAYS_INSERTION_0S,"static int f_filled ( int A [ ] , int B [ ] , int m , int n ) { int dp [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ; for ( int [ ] row : dp ) Arrays . fill ( row , 0 ) ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = i ; j <= m ; j ++ ) dp [ i ] [ j ] = Math . max ( ( dp [ i - 1 ] [ j - 1 ] + ( A [ j - 1 ] * B [ i - 1 ] ) ) , dp [ i ] [ j - 1 ] ) ; return dp [ n ] [ m ] ; }","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); } " CEILING_IN_A_SORTED_ARRAY_1,"static int f_filled ( int arr [ ] , int low , int high , int x ) { int mid ; if ( x <= arr [ low ] ) return low ; if ( x > arr [ high ] ) return - 1 ; mid = ( low + high ) / 2 ; if ( arr [ mid ] == x ) return mid ; else if ( arr [ mid ] < x ) { if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) return mid + 1 ; else return f_filled ( arr , mid + 1 , high , x ) ; } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid ; else return f_filled ( arr , low , mid - 1 , x ) ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [13, 11, 1, -1, 20, -1, 12, 23, -1, 2]; int [] [] param0 = [[2, 6, 13, 16, 23, 24, 24, 27, 30, 32, 34, 34, 55, 56, 56, 63, 66, 81, 83, 96], [-28, -96, 48, 22, -12, 72, 48, -70, -96, -84, -62, 22, 18, -92, -74, 14, 28, 52, 64, 72, 16, -76, 46], [0, 1], [51, 98, 25, 10, 43, 91, 33, 25, 85, 51, 94, 6, 35, 48, 11, 97, 67, 21, 50, 9, 11, 51, 86, 61, 22, 88, 89, 11], [-94, -92, -88, -74, -52, -50, -48, -44, -40, -36, -32, -26, 20, 22, 30, 32, 46, 56, 56, 60, 62, 64, 80, 84, 86, 94, 96, 96], [1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], [4, 5, 5, 13, 26, 40, 46, 51, 58, 60, 64, 66, 68, 69, 71, 74, 78, 81, 83, 88, 88, 90, 98, 99], [92, 6, -54, 84, -10, 32, 50, 40, -38, 64, -64, -10, 70, -68, -6, -16, 68, 34, -66, -82, 84, 98, 50, 82, 78, 4, 34, -34, 78, 64, 32, 58, -94, 40, 50, 0, -92, -36, 10, -54, 58, -78, -88, 32, 6], [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], [80, 67, 30, 35, 9]]; int [] param1 = [13, 11, 1, 20, 20, 15, 12, 23, 24, 2]; int [] param2 = [11, 18, 1, 20, 15, 17, 17, 28, 17, 3]; int [] param3 = [18, 21, 1, 15, 15, 22, 14, 28, 22, 2]; 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,"static int f_filled ( int arr [ ] , int n ) { int ones = 0 , twos = 0 ; int common_bit_mask ; for ( int i = 0 ; i < n ; i ++ ) { twos = twos | ( ones & arr [ i ] ) ; ones = ones ^ arr [ i ] ; common_bit_mask = ~ ( ones & twos ) ; ones &= common_bit_mask ; twos &= common_bit_mask ; } return ones ; }","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); } " CENTER_ELEMENT_OF_MATRIX_EQUALS_SUMS_OF_HALF_DIAGONALS,"static boolean f_filled ( int mat [ ] [ ] , int n ) { int diag1_left = 0 , diag1_right = 0 ; int diag2_left = 0 , diag2_right = 0 ; for ( int i = 0 , j = n - 1 ; i < n ; i ++ , j -- ) { if ( i < n / 2 ) { diag1_left += mat [ i ] [ i ] ; diag2_left += mat [ j ] [ i ] ; } else if ( i > n / 2 ) { diag1_right += mat [ i ] [ i ] ; diag2_right += mat [ j ] [ i ] ; } } return ( diag1_left == diag2_right && diag2_right == diag2_left && diag1_right == diag2_left && diag2_right == mat [ n / 2 ] [ n / 2 ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, false, false, false, false, false]; int [] [] [] param0 = [[[2, 9, 1, 4, -2], [6, 7, 2, 11, 4], [4, 2, 9, 2, 4], [1, 9, 2, 4, 4], [0, 2, 4, 2, 5]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 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]], [[52, 88, 22, 69, 1, 83, 30, 39, 79, 35, 69, 70, 89, 11, 51, 63, 86, 34, 55, 78, 73, 20, 80, 58, 81, 17, 34, 75, 99, 62, 34, 72, 19, 97, 87, 66, 72, 93, 42, 51, 71, 49, 29, 95], [30, 99, 25, 68, 62, 38, 17, 74, 1, 18, 63, 46, 19, 50, 96, 54, 31, 97, 86, 65, 46, 35, 49, 81, 34, 29, 6, 1, 55, 27, 12, 4, 80, 52, 11, 52, 84, 26, 28, 72, 66, 90, 27, 97], [55, 71, 54, 46, 36, 21, 49, 34, 87, 34, 40, 7, 90, 52, 49, 81, 95, 89, 37, 62, 15, 2, 11, 96, 94, 17, 88, 45, 68, 61, 46, 32, 19, 67, 4, 25, 73, 21, 87, 93, 94, 89, 93, 98], [14, 22, 48, 51, 80, 11, 59, 14, 7, 69, 58, 40, 93, 81, 94, 25, 78, 42, 86, 44, 5, 28, 76, 60, 77, 21, 96, 49, 56, 57, 85, 61, 38, 73, 2, 3, 43, 74, 35, 73, 40, 96, 85, 58], [34, 25, 56, 32, 22, 89, 65, 21, 80, 96, 21, 28, 19, 14, 87, 24, 20, 32, 74, 52, 65, 95, 52, 58, 79, 95, 92, 10, 70, 15, 47, 91, 10, 21, 19, 68, 22, 63, 38, 15, 70, 75, 44, 30], [24, 86, 94, 46, 4, 6, 38, 26, 19, 2, 68, 69, 47, 99, 29, 64, 80, 12, 85, 73, 11, 8, 60, 26, 32, 39, 4, 98, 92, 89, 44, 99, 83, 35, 51, 51, 29, 78, 85, 36, 78, 60, 15, 51], [50, 94, 55, 12, 50, 62, 5, 27, 79, 90, 9, 35, 13, 44, 46, 97, 98, 68, 77, 74, 53, 1, 11, 50, 9, 38, 87, 13, 5, 25, 10, 5, 22, 42, 89, 20, 28, 21, 11, 93, 69, 37, 49, 69], [33, 45, 8, 6, 15, 15, 9, 61, 56, 5, 26, 87, 80, 57, 35, 10, 91, 80, 21, 12, 9, 16, 73, 93, 54, 23, 39, 88, 22, 55, 31, 74, 47, 27, 98, 48, 39, 88, 21, 15, 81, 45, 19, 53], [89, 55, 86, 49, 78, 61, 60, 92, 76, 91, 24, 86, 39, 61, 23, 72, 92, 93, 79, 39, 72, 92, 97, 11, 42, 25, 34, 22, 2, 51, 16, 11, 78, 96, 86, 69, 87, 62, 19, 29, 42, 23, 60, 73], [18, 95, 81, 55, 18, 27, 85, 1, 96, 14, 59, 78, 33, 36, 39, 76, 45, 25, 15, 20, 34, 58, 60, 78, 30, 13, 78, 93, 90, 67, 89, 91, 45, 40, 80, 38, 75, 93, 47, 88, 29, 34, 11, 20], [20, 73, 56, 23, 91, 88, 25, 89, 33, 31, 74, 79, 1, 54, 16, 85, 59, 66, 3, 15, 32, 50, 91, 99, 60, 88, 8, 7, 4, 94, 10, 60, 25, 42, 47, 96, 96, 32, 74, 73, 25, 89, 16, 49], [16, 94, 38, 5, 7, 77, 8, 33, 62, 74, 84, 32, 93, 1, 91, 20, 55, 63, 78, 79, 6, 52, 2, 93, 39, 32, 51, 69, 86, 92, 32, 93, 3, 62, 95, 13, 70, 21, 61, 14, 89, 71, 22, 32], [41, 32, 42, 52, 94, 81, 54, 62, 85, 90, 43, 3, 38, 81, 39, 70, 85, 45, 46, 13, 52, 9, 57, 69, 43, 7, 44, 44, 95, 68, 77, 44, 79, 40, 77, 43, 62, 43, 90, 19, 49, 65, 77, 25], [84, 41, 23, 58, 88, 43, 40, 30, 34, 10, 60, 1, 12, 46, 93, 75, 17, 84, 58, 38, 6, 62, 84, 74, 10, 95, 26, 58, 17, 53, 78, 5, 67, 20, 51, 46, 79, 67, 3, 23, 9, 11, 47, 49], [44, 13, 8, 63, 22, 38, 27, 26, 23, 95, 93, 65, 74, 47, 61, 46, 4, 31, 4, 29, 73, 79, 44, 3, 59, 79, 53, 11, 6, 47, 7, 68, 85, 1, 56, 87, 77, 43, 28, 29, 18, 87, 92, 73], [62, 6, 16, 1, 22, 46, 62, 23, 21, 51, 95, 38, 28, 44, 91, 39, 42, 42, 60, 57, 77, 96, 7, 51, 97, 77, 32, 7, 76, 40, 15, 59, 85, 12, 77, 42, 39, 63, 2, 29, 61, 29, 38, 7], [30, 87, 92, 56, 87, 36, 42, 93, 4, 84, 5, 46, 75, 2, 54, 88, 59, 33, 22, 47, 6, 24, 93, 49, 96, 94, 51, 41, 67, 89, 92, 79, 81, 2, 91, 78, 43, 32, 12, 23, 16, 44, 2, 7], [21, 58, 95, 23, 60, 25, 35, 99, 45, 7, 69, 32, 53, 69, 25, 95, 84, 86, 77, 2, 86, 61, 9, 51, 2, 45, 32, 72, 80, 97, 75, 32, 8, 96, 85, 89, 20, 65, 21, 7, 89, 9, 86, 2], [19, 60, 70, 59, 69, 45, 62, 10, 65, 26, 90, 60, 18, 59, 21, 46, 12, 78, 32, 39, 99, 81, 55, 55, 10, 35, 80, 6, 68, 62, 9, 29, 71, 80, 6, 44, 64, 67, 44, 78, 14, 9, 23, 57], [57, 15, 64, 7, 20, 64, 19, 6, 51, 39, 65, 71, 99, 25, 23, 89, 58, 11, 34, 31, 38, 46, 12, 9, 13, 64, 20, 59, 85, 22, 65, 60, 41, 81, 45, 4, 70, 45, 58, 83, 94, 23, 32, 63], [93, 8, 85, 81, 81, 85, 79, 91, 25, 33, 66, 16, 55, 36, 72, 80, 7, 69, 87, 8, 3, 35, 36, 79, 30, 15, 93, 68, 98, 87, 58, 99, 28, 95, 42, 97, 18, 5, 9, 84, 9, 18, 56, 15], [79, 78, 62, 35, 40, 51, 60, 56, 84, 75, 41, 54, 17, 25, 93, 87, 9, 56, 89, 23, 2, 45, 65, 38, 6, 48, 44, 79, 7, 66, 62, 30, 93, 76, 52, 98, 94, 36, 35, 66, 50, 3, 76, 4], [55, 52, 59, 71, 20, 19, 8, 67, 27, 79, 8, 18, 29, 46, 36, 3, 9, 10, 84, 66, 1, 91, 4, 48, 96, 18, 78, 45, 15, 51, 61, 4, 19, 88, 94, 77, 11, 28, 57, 75, 54, 65, 47, 4], [34, 76, 54, 88, 61, 96, 83, 93, 93, 83, 20, 3, 40, 69, 23, 69, 94, 32, 24, 51, 58, 42, 35, 32, 54, 45, 48, 86, 85, 92, 49, 34, 16, 11, 97, 19, 92, 29, 54, 53, 67, 82, 82, 76], [82, 32, 83, 56, 63, 4, 11, 3, 27, 80, 44, 18, 30, 88, 70, 47, 34, 76, 42, 23, 40, 15, 80, 57, 14, 79, 12, 35, 25, 78, 2, 18, 35, 9, 11, 90, 67, 69, 96, 74, 38, 70, 75, 81], [59, 66, 41, 24, 50, 5, 21, 6, 4, 9, 69, 68, 9, 18, 59, 43, 80, 66, 29, 48, 51, 42, 36, 76, 45, 98, 35, 6, 37, 36, 84, 16, 72, 22, 69, 69, 63, 75, 19, 81, 18, 73, 17, 41], [33, 84, 55, 82, 24, 77, 40, 28, 67, 75, 39, 21, 37, 2, 6, 52, 5, 47, 43, 96, 40, 11, 81, 14, 2, 39, 63, 63, 18, 97, 94, 79, 93, 90, 1, 17, 54, 39, 48, 66, 15, 22, 20, 93], [89, 43, 56, 24, 98, 43, 21, 48, 66, 16, 40, 21, 52, 8, 78, 55, 86, 82, 58, 5, 42, 30, 95, 9, 95, 95, 41, 51, 57, 73, 61, 6, 26, 74, 6, 53, 61, 33, 45, 94, 40, 24, 92, 45], [38, 29, 79, 8, 64, 87, 73, 51, 75, 6, 47, 49, 76, 98, 85, 32, 54, 36, 89, 99, 98, 19, 37, 17, 80, 16, 58, 44, 68, 49, 94, 51, 98, 5, 97, 58, 46, 55, 73, 17, 12, 24, 56, 55], [76, 79, 16, 87, 82, 22, 44, 95, 43, 79, 21, 8, 49, 6, 81, 47, 36, 92, 23, 31, 75, 62, 84, 96, 81, 57, 70, 65, 37, 68, 95, 75, 17, 7, 52, 35, 2, 40, 37, 57, 10, 76, 81, 46], [90, 5, 5, 27, 5, 61, 8, 31, 97, 21, 99, 21, 51, 79, 59, 2, 30, 58, 92, 81, 20, 40, 29, 5, 89, 10, 83, 61, 1, 47, 98, 57, 14, 25, 90, 21, 16, 74, 32, 45, 64, 84, 73, 60], [98, 95, 19, 47, 95, 64, 30, 47, 88, 33, 82, 21, 95, 63, 42, 61, 43, 68, 26, 33, 33, 49, 84, 41, 72, 36, 72, 95, 22, 47, 83, 20, 87, 24, 43, 88, 73, 16, 27, 45, 37, 13, 51, 2], [76, 97, 87, 59, 14, 49, 30, 98, 9, 79, 24, 41, 60, 89, 32, 47, 21, 42, 70, 89, 2, 31, 56, 30, 63, 15, 18, 32, 14, 62, 82, 99, 52, 22, 14, 78, 34, 86, 80, 56, 53, 49, 63, 16], [80, 40, 38, 18, 23, 48, 82, 46, 22, 54, 40, 30, 55, 56, 42, 42, 62, 82, 53, 82, 53, 64, 1, 79, 69, 27, 17, 63, 41, 58, 57, 96, 38, 90, 66, 92, 45, 23, 20, 36, 42, 22, 60, 11], [28, 45, 22, 81, 63, 31, 11, 36, 78, 35, 23, 29, 23, 16, 84, 89, 19, 90, 96, 63, 50, 85, 73, 43, 19, 85, 18, 6, 35, 14, 64, 9, 35, 2, 6, 99, 25, 73, 50, 95, 7, 63, 28, 2], [65, 59, 24, 62, 99, 71, 38, 93, 62, 65, 51, 94, 52, 96, 74, 98, 63, 11, 48, 54, 91, 50, 74, 38, 86, 88, 8, 6, 68, 69, 6, 32, 38, 57, 84, 64, 54, 14, 64, 50, 47, 54, 19, 75], [39, 65, 99, 83, 60, 33, 32, 36, 24, 43, 71, 71, 46, 47, 69, 14, 45, 52, 90, 50, 65, 77, 64, 23, 84, 71, 70, 59, 73, 92, 74, 54, 99, 71, 89, 94, 26, 44, 76, 13, 54, 40, 4, 53], [1, 6, 55, 66, 91, 18, 29, 53, 33, 3, 20, 4, 82, 8, 86, 86, 83, 28, 66, 73, 99, 86, 26, 34, 71, 94, 49, 89, 49, 73, 27, 65, 33, 72, 49, 63, 32, 19, 50, 22, 90, 67, 9, 35], [71, 79, 4, 37, 28, 9, 35, 25, 9, 61, 52, 97, 17, 76, 9, 54, 5, 63, 47, 90, 19, 99, 66, 45, 71, 73, 86, 33, 80, 43, 88, 72, 94, 26, 45, 35, 81, 53, 10, 41, 17, 71, 66, 11], [63, 67, 46, 20, 13, 87, 17, 93, 32, 99, 99, 98, 85, 16, 23, 11, 14, 67, 71, 45, 75, 33, 83, 45, 54, 51, 87, 23, 29, 6, 39, 5, 96, 40, 90, 78, 82, 21, 59, 89, 20, 24, 3, 86], [72, 57, 93, 71, 70, 70, 76, 63, 86, 47, 90, 89, 19, 99, 13, 89, 45, 32, 30, 85, 42, 72, 42, 7, 3, 37, 3, 18, 42, 9, 57, 24, 7, 97, 89, 42, 98, 58, 85, 56, 58, 18, 39, 50], [33, 28, 56, 25, 14, 55, 84, 84, 7, 4, 95, 30, 62, 57, 37, 55, 85, 65, 52, 3, 77, 7, 70, 70, 34, 96, 16, 8, 21, 11, 50, 87, 6, 15, 11, 27, 79, 45, 38, 4, 78, 45, 10, 54], [29, 12, 56, 40, 84, 37, 66, 20, 12, 38, 30, 47, 82, 74, 71, 42, 5, 48, 93, 99, 51, 12, 10, 37, 66, 67, 14, 47, 20, 52, 68, 26, 47, 79, 73, 3, 2, 41, 30, 37, 81, 3, 9, 8], [9, 17, 24, 72, 14, 54, 80, 18, 88, 39, 47, 27, 92, 71, 98, 91, 34, 19, 6, 30, 92, 12, 15, 39, 64, 64, 15, 58, 67, 1, 7, 9, 1, 5, 47, 10, 2, 23, 93, 56, 19, 38, 47, 84]], [[99, 52, 49, 71, 23, 50, 17, 48, 2, 69, 62], [85, 13, 61, 11, 88, 97, 27, 35, 18, 85, 68], [61, 41, 96, 43, 49, 11, 67, 51, 52, 85, 43], [58, 78, 70, 29, 31, 28, 50, 36, 92, 19, 67], [12, 88, 76, 24, 65, 92, 80, 21, 94, 98, 26], [35, 95, 80, 58, 42, 29, 29, 9, 78, 72, 2], [75, 2, 18, 69, 57, 71, 23, 19, 19, 58, 83], [49, 45, 28, 75, 50, 11, 55, 9, 14, 98, 93], [21, 48, 58, 69, 97, 9, 67, 78, 18, 12, 87], [78, 16, 37, 20, 20, 15, 25, 17, 12, 42, 39], [56, 53, 71, 72, 88, 47, 25, 85, 50, 33, 74]], [[29, 3, 39, 4, 37, 95, 6, 92, 10, 12, 66, 3, 65, 64, 35, 24, 47, 52, 34], [84, 80, 94, 25, 69, 29, 92, 64, 53, 58, 41, 87, 96, 51, 18, 41, 99, 61, 24], [47, 28, 36, 21, 56, 69, 26, 54, 87, 44, 33, 26, 22, 20, 2, 41, 54, 57, 18], [5, 96, 46, 75, 21, 22, 3, 9, 2, 28, 34, 53, 59, 10, 83, 93, 2, 48, 6], [44, 54, 71, 36, 8, 83, 10, 33, 91, 93, 19, 18, 51, 23, 1, 59, 3, 10, 71], [49, 56, 90, 16, 39, 96, 76, 44, 8, 8, 45, 11, 97, 25, 17, 95, 83, 55, 79], [56, 44, 53, 35, 39, 2, 98, 25, 38, 68, 80, 32, 79, 78, 41, 79, 71, 7, 72], [83, 18, 17, 82, 83, 77, 59, 11, 51, 7, 27, 59, 37, 5, 62, 72, 74, 90, 79], [55, 16, 93, 92, 74, 56, 51, 68, 46, 61, 78, 33, 55, 18, 12, 74, 21, 97, 78], [73, 26, 79, 21, 22, 55, 46, 41, 5, 44, 16, 35, 5, 62, 90, 26, 61, 51, 69], [56, 50, 36, 24, 79, 30, 69, 48, 22, 33, 69, 96, 50, 23, 10, 36, 17, 53, 91], [8, 44, 61, 6, 71, 90, 81, 37, 54, 23, 91, 57, 51, 58, 19, 27, 89, 25, 21], [25, 51, 71, 35, 70, 50, 15, 24, 49, 68, 7, 94, 81, 54, 38, 94, 45, 9, 55], [83, 52, 77, 49, 55, 83, 70, 76, 79, 3, 68, 38, 70, 49, 92, 8, 95, 85, 45], [29, 79, 49, 24, 21, 23, 95, 98, 28, 32, 22, 62, 67, 73, 6, 65, 22, 51, 68], [57, 72, 55, 42, 52, 61, 19, 1, 41, 63, 88, 48, 81, 32, 50, 14, 17, 96, 97], [30, 51, 98, 92, 62, 24, 63, 14, 34, 59, 65, 86, 33, 58, 18, 12, 74, 66, 2], [70, 84, 28, 42, 3, 48, 89, 87, 13, 57, 88, 3, 63, 38, 59, 28, 26, 84, 91], [65, 74, 74, 61, 57, 1, 32, 32, 27, 13, 17, 28, 89, 52, 36, 47, 66, 32, 32]], [[55, 73, 80, 89, 40, 28, 81, 31, 87, 31, 26, 4, 58, 79, 23, 69, 60, 43, 89, 94, 26, 67, 68, 55, 47, 82, 59, 75, 75, 16, 58], [89, 1, 90, 45, 94, 6, 91, 52, 19, 43, 19, 39, 32, 65, 89, 47, 13, 74, 82, 36, 86, 70, 27, 72, 24, 20, 86, 9, 39, 83, 1], [11, 74, 1, 91, 81, 44, 51, 17, 66, 23, 41, 59, 74, 94, 99, 25, 17, 19, 82, 82, 46, 35, 74, 23, 86, 44, 9, 32, 90, 93, 59], [42, 62, 19, 93, 35, 76, 8, 89, 91, 43, 45, 6, 13, 11, 70, 69, 7, 55, 55, 19, 6, 89, 9, 20, 25, 50, 72, 50, 38, 66, 57], [22, 56, 36, 51, 68, 1, 48, 33, 24, 49, 69, 58, 48, 57, 64, 99, 53, 60, 90, 43, 41, 26, 59, 49, 64, 5, 44, 18, 57, 89, 40], [46, 58, 85, 24, 28, 46, 68, 72, 54, 33, 67, 84, 35, 39, 47, 71, 91, 5, 37, 1, 86, 56, 7, 64, 8, 94, 64, 57, 28, 26, 34], [96, 22, 20, 14, 23, 67, 19, 78, 39, 37, 99, 1, 19, 15, 89, 1, 31, 52, 43, 46, 86, 50, 20, 62, 43, 5, 79, 66, 12, 57, 60], [55, 71, 66, 72, 73, 27, 28, 37, 79, 19, 94, 51, 13, 45, 6, 94, 1, 25, 99, 26, 13, 19, 10, 45, 71, 15, 87, 31, 8, 30, 98], [97, 1, 16, 11, 27, 86, 40, 83, 44, 70, 57, 48, 40, 39, 84, 3, 55, 1, 23, 67, 62, 34, 17, 48, 91, 53, 61, 87, 11, 15, 90], [11, 7, 47, 8, 5, 81, 87, 66, 91, 63, 21, 71, 90, 94, 12, 11, 54, 81, 10, 16, 15, 58, 79, 84, 4, 96, 22, 35, 14, 94, 31], [74, 70, 91, 11, 36, 74, 80, 24, 85, 40, 42, 87, 21, 96, 81, 51, 81, 55, 85, 4, 62, 87, 25, 96, 70, 14, 41, 57, 38, 62, 41], [45, 80, 96, 16, 19, 37, 85, 79, 61, 26, 94, 79, 64, 13, 91, 87, 34, 98, 23, 20, 54, 73, 58, 59, 20, 39, 78, 90, 91, 98, 93], [32, 41, 69, 68, 87, 21, 97, 24, 16, 32, 83, 26, 3, 99, 82, 7, 96, 88, 16, 53, 88, 4, 45, 32, 98, 83, 78, 58, 13, 22, 95], [44, 44, 30, 23, 12, 14, 36, 45, 72, 24, 3, 78, 51, 75, 55, 38, 92, 87, 82, 20, 97, 2, 26, 2, 67, 84, 74, 42, 85, 40, 9], [2, 28, 3, 16, 4, 23, 94, 77, 6, 74, 55, 81, 8, 73, 98, 81, 86, 64, 67, 41, 40, 93, 27, 39, 53, 40, 52, 37, 67, 19, 34], [78, 85, 66, 10, 52, 42, 60, 81, 2, 91, 1, 50, 36, 97, 22, 99, 98, 82, 36, 3, 44, 16, 11, 10, 51, 42, 85, 25, 99, 6, 44], [8, 34, 41, 1, 3, 52, 91, 77, 43, 47, 83, 19, 70, 47, 78, 5, 64, 45, 64, 45, 36, 9, 23, 32, 93, 45, 28, 52, 11, 19, 64], [65, 73, 57, 66, 4, 29, 4, 1, 92, 18, 13, 70, 49, 47, 86, 30, 27, 72, 28, 2, 20, 75, 78, 24, 77, 72, 44, 21, 22, 73, 58], [11, 80, 53, 9, 67, 52, 13, 1, 44, 75, 24, 5, 66, 81, 81, 20, 64, 15, 68, 54, 11, 23, 1, 42, 47, 68, 38, 2, 45, 27, 98], [77, 61, 82, 11, 69, 29, 25, 78, 54, 48, 46, 41, 41, 61, 11, 44, 32, 49, 6, 57, 6, 47, 63, 49, 22, 67, 19, 55, 34, 41, 7], [57, 16, 59, 38, 9, 77, 34, 46, 37, 43, 47, 6, 38, 61, 4, 5, 70, 60, 77, 88, 92, 77, 56, 82, 59, 7, 68, 31, 88, 86, 85], [48, 42, 90, 30, 51, 35, 62, 51, 87, 50, 30, 19, 96, 50, 54, 83, 86, 4, 12, 15, 15, 10, 61, 19, 53, 72, 57, 95, 9, 29, 7], [72, 17, 79, 16, 71, 83, 38, 89, 76, 96, 47, 10, 24, 50, 68, 43, 37, 45, 54, 43, 68, 37, 89, 41, 94, 1, 93, 16, 37, 37, 7], [40, 51, 64, 97, 22, 43, 62, 54, 27, 29, 16, 85, 11, 21, 9, 27, 86, 79, 23, 51, 93, 80, 3, 16, 8, 90, 42, 73, 35, 71, 72], [99, 48, 54, 36, 6, 71, 12, 59, 65, 50, 43, 43, 49, 89, 76, 55, 91, 87, 83, 85, 50, 21, 88, 13, 42, 15, 50, 1, 51, 34, 42], [62, 95, 32, 61, 93, 54, 74, 58, 85, 24, 27, 21, 18, 55, 68, 47, 54, 18, 73, 64, 49, 94, 35, 94, 39, 58, 57, 6, 78, 93, 96], [78, 20, 50, 9, 76, 14, 23, 48, 98, 80, 82, 56, 40, 97, 69, 39, 74, 86, 43, 97, 31, 70, 3, 4, 27, 89, 27, 47, 60, 36, 46], [61, 42, 7, 30, 50, 47, 93, 40, 5, 70, 58, 44, 71, 32, 79, 77, 82, 74, 40, 57, 11, 40, 47, 2, 91, 52, 72, 49, 59, 38, 16], [88, 87, 78, 27, 74, 28, 89, 66, 45, 33, 60, 50, 46, 35, 41, 58, 77, 55, 5, 5, 22, 34, 65, 59, 17, 51, 49, 9, 74, 15, 29], [53, 25, 85, 81, 91, 28, 23, 3, 33, 71, 69, 90, 17, 81, 67, 67, 34, 8, 45, 60, 56, 70, 22, 33, 50, 71, 83, 46, 52, 74, 87], [66, 21, 24, 48, 13, 64, 5, 18, 75, 37, 54, 32, 28, 86, 45, 28, 65, 70, 75, 42, 33, 16, 13, 21, 59, 47, 39, 88, 43, 27, 37]], [[76, 7, 58], [20, 79, 65], [74, 14, 79]], [[89, 95, 74, 37, 6, 6, 28, 78, 13, 13, 10, 80, 39, 99, 79, 23, 37, 8, 90, 60, 86, 5, 98, 27, 19, 43, 43, 35, 84, 55, 61, 47, 77, 56, 82, 18, 65, 96, 53, 89, 85, 91, 11, 1, 83, 96, 8, 19, 55], [16, 99, 66, 12, 93, 74, 62, 86, 98, 58, 21, 37, 5, 70, 32, 67, 10, 69, 88, 84, 62, 37, 95, 47, 81, 49, 24, 82, 26, 55, 7, 78, 41, 2, 30, 81, 20, 56, 74, 24, 12, 91, 15, 73, 82, 48, 61, 71, 28], [3, 16, 36, 4, 99, 9, 12, 74, 44, 66, 19, 13, 55, 97, 65, 92, 70, 3, 25, 52, 16, 43, 56, 68, 8, 80, 44, 38, 23, 6, 43, 44, 80, 80, 23, 16, 76, 9, 82, 9, 85, 58, 65, 59, 23, 69, 19, 35, 97], [55, 82, 40, 14, 84, 13, 53, 80, 95, 39, 99, 84, 65, 56, 40, 46, 77, 7, 45, 22, 7, 84, 52, 68, 70, 67, 3, 58, 67, 54, 9, 54, 80, 51, 16, 12, 20, 53, 31, 94, 21, 3, 21, 92, 28, 5, 71, 69, 73], [47, 85, 20, 38, 37, 58, 17, 42, 92, 95, 97, 32, 62, 96, 87, 21, 89, 33, 67, 6, 92, 66, 32, 64, 26, 62, 5, 11, 74, 79, 82, 49, 78, 92, 94, 62, 60, 77, 84, 2, 89, 59, 76, 25, 68, 42, 76, 71, 55], [38, 96, 43, 70, 53, 91, 99, 21, 20, 19, 33, 63, 68, 60, 19, 28, 22, 51, 88, 63, 62, 94, 29, 74, 32, 73, 25, 16, 15, 59, 48, 18, 23, 55, 42, 3, 71, 52, 11, 55, 88, 99, 25, 92, 76, 87, 81, 41, 37], [82, 55, 9, 99, 36, 57, 63, 82, 20, 85, 47, 20, 6, 73, 93, 29, 77, 91, 49, 6, 39, 32, 49, 43, 28, 45, 65, 50, 54, 51, 43, 64, 95, 30, 82, 93, 42, 38, 87, 86, 66, 69, 15, 61, 96, 6, 78, 24, 85], [14, 12, 55, 68, 44, 85, 81, 93, 51, 80, 82, 38, 41, 44, 75, 96, 92, 16, 98, 50, 94, 38, 86, 5, 9, 77, 39, 87, 27, 32, 64, 95, 33, 90, 18, 76, 67, 5, 78, 59, 76, 4, 16, 75, 48, 66, 77, 8, 44], [21, 26, 35, 15, 40, 30, 66, 80, 13, 1, 43, 28, 1, 40, 34, 13, 61, 66, 4, 89, 98, 13, 36, 96, 61, 58, 85, 90, 15, 93, 90, 85, 12, 76, 69, 61, 42, 90, 32, 2, 8, 91, 54, 8, 88, 13, 29, 13, 58], [63, 87, 47, 79, 88, 87, 74, 38, 69, 69, 95, 40, 1, 2, 29, 7, 93, 57, 55, 73, 36, 7, 92, 10, 80, 74, 39, 58, 90, 98, 98, 40, 14, 82, 1, 17, 49, 86, 16, 7, 15, 21, 66, 59, 48, 89, 73, 84, 50], [10, 52, 85, 68, 30, 34, 94, 78, 86, 65, 60, 8, 75, 65, 69, 57, 45, 49, 74, 62, 39, 77, 21, 53, 45, 97, 28, 53, 9, 75, 93, 71, 61, 27, 22, 95, 30, 92, 84, 15, 15, 53, 76, 81, 23, 70, 16, 91, 87], [65, 45, 7, 45, 39, 50, 49, 48, 49, 40, 39, 57, 82, 63, 56, 86, 2, 26, 96, 23, 18, 83, 88, 68, 60, 2, 94, 49, 38, 31, 40, 80, 53, 64, 33, 58, 50, 64, 3, 61, 82, 10, 66, 51, 94, 30, 25, 43, 88], [64, 59, 62, 99, 10, 64, 94, 60, 90, 99, 88, 20, 49, 99, 74, 27, 51, 57, 79, 79, 37, 99, 3, 29, 68, 47, 80, 69, 21, 42, 21, 2, 78, 69, 7, 75, 35, 30, 44, 46, 55, 1, 54, 80, 1, 63, 55, 86, 77], [27, 15, 81, 9, 69, 59, 23, 11, 24, 72, 98, 54, 31, 22, 14, 5, 17, 82, 83, 71, 90, 89, 82, 44, 79, 93, 49, 65, 4, 9, 36, 51, 32, 88, 18, 15, 20, 58, 40, 66, 89, 13, 91, 13, 62, 28, 46, 15, 93], [85, 44, 95, 23, 67, 99, 78, 66, 50, 13, 2, 76, 91, 34, 40, 69, 61, 25, 75, 77, 63, 28, 85, 56, 26, 27, 26, 15, 50, 6, 68, 4, 30, 77, 9, 42, 14, 92, 40, 3, 41, 93, 33, 79, 60, 64, 62, 79, 7], [76, 50, 39, 71, 47, 70, 26, 58, 73, 51, 88, 52, 94, 16, 48, 27, 33, 23, 45, 83, 83, 22, 42, 33, 10, 47, 96, 79, 39, 46, 72, 51, 25, 82, 15, 58, 59, 26, 41, 44, 85, 22, 98, 37, 14, 4, 24, 66, 63], [65, 66, 13, 27, 81, 17, 69, 88, 57, 72, 73, 18, 16, 51, 96, 40, 39, 56, 54, 44, 46, 32, 48, 61, 66, 38, 43, 4, 5, 58, 37, 26, 9, 15, 88, 88, 99, 89, 26, 63, 87, 70, 27, 54, 83, 31, 32, 2, 18], [28, 71, 87, 88, 92, 25, 39, 49, 4, 52, 83, 68, 57, 13, 65, 63, 98, 71, 25, 23, 30, 61, 7, 54, 17, 97, 60, 66, 38, 13, 52, 52, 32, 86, 9, 17, 82, 40, 91, 75, 54, 54, 28, 72, 50, 18, 13, 33, 15], [86, 38, 94, 6, 45, 59, 98, 83, 97, 78, 48, 41, 83, 79, 74, 55, 61, 2, 2, 85, 76, 10, 76, 39, 2, 65, 66, 87, 92, 81, 52, 85, 44, 34, 73, 81, 45, 32, 5, 78, 89, 86, 63, 69, 54, 38, 9, 61, 95], [21, 36, 1, 22, 87, 87, 15, 46, 65, 6, 40, 35, 81, 61, 23, 20, 28, 37, 82, 7, 49, 84, 24, 80, 13, 92, 7, 15, 87, 23, 95, 69, 91, 60, 10, 51, 64, 71, 56, 32, 23, 54, 73, 93, 91, 85, 70, 90, 84], [61, 79, 20, 53, 15, 29, 70, 80, 65, 62, 70, 16, 54, 97, 7, 60, 10, 53, 8, 85, 90, 37, 82, 4, 84, 83, 97, 23, 9, 38, 45, 45, 18, 46, 2, 48, 17, 16, 45, 48, 24, 95, 65, 92, 33, 4, 1, 33, 74], [62, 3, 45, 21, 64, 73, 57, 40, 62, 43, 88, 46, 72, 24, 24, 10, 99, 68, 57, 44, 73, 75, 48, 77, 27, 30, 46, 12, 60, 19, 68, 54, 34, 87, 90, 7, 82, 42, 68, 53, 8, 22, 26, 77, 63, 46, 81, 44, 62], [36, 41, 79, 82, 27, 70, 98, 41, 5, 57, 76, 29, 12, 25, 34, 75, 87, 24, 82, 63, 63, 10, 5, 95, 89, 53, 81, 28, 65, 45, 66, 49, 40, 66, 91, 8, 27, 17, 68, 44, 31, 5, 60, 89, 92, 19, 42, 23, 77], [17, 94, 58, 87, 49, 3, 77, 96, 45, 35, 2, 47, 3, 29, 74, 20, 34, 79, 40, 65, 90, 63, 56, 32, 66, 96, 41, 29, 84, 87, 51, 12, 44, 10, 83, 74, 83, 90, 88, 9, 29, 29, 92, 61, 64, 3, 87, 4, 55], [14, 77, 28, 63, 39, 64, 60, 20, 28, 96, 14, 77, 75, 58, 39, 58, 15, 73, 3, 5, 92, 42, 15, 3, 35, 7, 94, 24, 31, 78, 80, 4, 3, 99, 9, 68, 83, 88, 60, 11, 79, 36, 95, 72, 2, 50, 3, 67, 85], [62, 76, 14, 23, 77, 16, 81, 18, 13, 56, 90, 45, 40, 31, 81, 32, 1, 35, 36, 83, 92, 66, 29, 43, 29, 43, 19, 64, 92, 98, 31, 19, 96, 29, 73, 7, 58, 76, 60, 51, 95, 82, 92, 50, 21, 9, 34, 34, 47], [24, 80, 28, 46, 51, 99, 6, 63, 53, 64, 52, 60, 41, 11, 4, 14, 13, 15, 8, 88, 11, 99, 89, 23, 7, 69, 32, 92, 44, 3, 94, 44, 69, 51, 61, 51, 33, 20, 30, 44, 86, 86, 29, 21, 82, 53, 11, 10, 35], [26, 44, 4, 74, 57, 39, 80, 41, 94, 67, 98, 89, 36, 4, 74, 13, 70, 7, 28, 59, 37, 15, 30, 74, 12, 81, 30, 1, 36, 88, 21, 32, 63, 82, 13, 37, 44, 21, 18, 46, 47, 26, 5, 5, 31, 28, 77, 75, 65], [88, 13, 18, 24, 29, 28, 45, 86, 84, 11, 51, 59, 84, 13, 47, 88, 43, 24, 48, 63, 17, 69, 54, 94, 14, 15, 73, 78, 10, 22, 95, 13, 81, 65, 14, 44, 39, 35, 65, 27, 45, 57, 22, 34, 9, 50, 54, 58, 96], [62, 38, 84, 27, 64, 3, 11, 24, 29, 69, 97, 8, 19, 68, 99, 94, 69, 48, 40, 67, 16, 64, 8, 5, 99, 72, 25, 53, 49, 72, 21, 51, 46, 9, 64, 96, 77, 23, 60, 59, 8, 64, 99, 54, 92, 15, 52, 93, 51], [4, 34, 24, 21, 2, 7, 56, 75, 76, 68, 35, 26, 18, 64, 56, 80, 55, 12, 37, 52, 19, 15, 86, 84, 52, 77, 87, 95, 26, 45, 96, 21, 81, 93, 53, 29, 48, 86, 19, 54, 78, 87, 2, 32, 62, 97, 7, 98, 68], [87, 84, 22, 29, 3, 22, 84, 89, 98, 53, 93, 57, 10, 40, 20, 87, 11, 8, 93, 36, 25, 39, 98, 96, 62, 87, 21, 19, 25, 87, 83, 5, 83, 99, 12, 25, 5, 76, 27, 4, 83, 45, 47, 88, 28, 97, 35, 16, 12], [80, 75, 43, 28, 87, 81, 19, 75, 68, 74, 55, 83, 36, 62, 39, 41, 60, 86, 66, 59, 97, 40, 91, 19, 55, 46, 4, 83, 62, 25, 63, 70, 13, 86, 4, 2, 67, 30, 4, 48, 43, 93, 45, 97, 13, 47, 96, 28, 37], [28, 27, 89, 30, 6, 94, 9, 6, 29, 87, 70, 86, 66, 95, 53, 70, 5, 20, 12, 8, 58, 49, 64, 50, 97, 39, 40, 31, 3, 83, 72, 30, 95, 29, 70, 56, 66, 87, 63, 30, 53, 46, 9, 7, 63, 47, 44, 49, 79], [79, 85, 62, 59, 78, 75, 75, 84, 13, 30, 84, 43, 51, 8, 37, 97, 90, 64, 39, 8, 62, 82, 39, 14, 52, 82, 57, 21, 23, 4, 74, 43, 11, 84, 19, 65, 95, 2, 49, 69, 34, 4, 91, 39, 49, 3, 26, 41, 65], [16, 58, 35, 83, 16, 33, 31, 22, 61, 84, 64, 70, 35, 39, 3, 96, 13, 14, 41, 8, 19, 14, 75, 50, 99, 61, 36, 67, 89, 77, 80, 92, 45, 91, 74, 82, 72, 7, 22, 9, 60, 42, 59, 40, 29, 55, 64, 42, 29], [92, 21, 97, 63, 63, 90, 38, 79, 66, 12, 33, 79, 1, 97, 68, 28, 62, 78, 59, 49, 45, 76, 6, 20, 85, 16, 12, 52, 20, 58, 45, 97, 2, 34, 26, 33, 42, 94, 65, 8, 65, 10, 32, 51, 57, 40, 66, 31, 63], [68, 56, 12, 31, 23, 33, 8, 62, 80, 15, 41, 52, 26, 78, 12, 27, 95, 68, 30, 4, 54, 95, 34, 68, 84, 56, 18, 47, 72, 60, 59, 2, 73, 16, 86, 58, 12, 5, 39, 15, 72, 88, 19, 82, 85, 49, 39, 78, 15], [55, 67, 56, 45, 75, 57, 67, 94, 6, 70, 31, 22, 85, 38, 58, 70, 29, 56, 11, 48, 86, 60, 51, 39, 6, 30, 89, 1, 86, 9, 45, 8, 34, 80, 83, 8, 12, 43, 56, 31, 42, 33, 19, 91, 88, 92, 55, 4, 12], [87, 84, 28, 58, 48, 1, 75, 44, 63, 95, 38, 9, 6, 70, 52, 67, 96, 99, 16, 2, 36, 71, 35, 30, 45, 46, 93, 65, 1, 57, 71, 67, 31, 25, 47, 56, 88, 1, 95, 37, 75, 67, 12, 20, 30, 74, 64, 79, 85], [64, 18, 32, 19, 94, 33, 62, 22, 29, 88, 4, 50, 76, 4, 5, 83, 39, 57, 31, 7, 12, 10, 29, 85, 13, 87, 70, 31, 9, 51, 88, 16, 59, 58, 11, 36, 1, 21, 44, 37, 6, 14, 93, 1, 8, 44, 83, 87, 75], [27, 36, 42, 20, 8, 46, 52, 26, 35, 60, 3, 4, 93, 62, 64, 50, 92, 19, 43, 92, 82, 14, 14, 54, 29, 3, 98, 73, 5, 93, 5, 45, 64, 64, 43, 43, 51, 13, 90, 73, 68, 95, 69, 7, 92, 78, 88, 42, 5], [47, 48, 98, 92, 47, 8, 21, 88, 24, 13, 15, 89, 53, 92, 72, 31, 71, 51, 47, 39, 81, 57, 50, 57, 35, 86, 7, 53, 10, 92, 39, 58, 93, 35, 59, 22, 9, 8, 94, 94, 58, 95, 22, 95, 40, 28, 46, 69, 81], [52, 11, 22, 47, 89, 13, 45, 75, 69, 78, 22, 67, 35, 32, 38, 58, 40, 88, 92, 21, 49, 97, 92, 39, 61, 10, 40, 58, 89, 45, 17, 68, 10, 62, 89, 32, 72, 42, 45, 76, 21, 27, 30, 74, 85, 1, 9, 3, 53], [42, 19, 6, 7, 43, 80, 36, 68, 82, 96, 96, 82, 39, 43, 37, 28, 50, 39, 2, 37, 66, 19, 69, 44, 13, 22, 7, 2, 62, 78, 89, 90, 5, 20, 54, 76, 63, 36, 95, 81, 16, 57, 64, 10, 99, 97, 99, 51, 27], [7, 91, 41, 76, 97, 13, 66, 3, 11, 5, 60, 2, 92, 77, 99, 64, 13, 54, 12, 18, 18, 17, 39, 86, 13, 45, 19, 88, 19, 21, 24, 30, 92, 48, 35, 59, 17, 48, 98, 55, 9, 77, 14, 26, 52, 85, 44, 84, 11], [51, 42, 62, 35, 64, 95, 18, 14, 49, 69, 17, 21, 14, 3, 31, 89, 47, 44, 17, 90, 81, 56, 83, 27, 71, 90, 69, 2, 80, 62, 75, 87, 99, 6, 65, 97, 18, 55, 67, 57, 19, 74, 84, 11, 96, 84, 55, 96, 37], [86, 4, 13, 70, 93, 58, 2, 60, 89, 32, 63, 60, 26, 90, 22, 74, 87, 4, 16, 63, 42, 33, 13, 46, 13, 33, 14, 8, 90, 86, 46, 1, 59, 60, 49, 80, 93, 61, 23, 5, 85, 50, 36, 20, 43, 8, 90, 41, 25], [7, 86, 61, 33, 69, 38, 12, 44, 53, 14, 71, 92, 52, 52, 46, 80, 41, 2, 49, 95, 78, 28, 32, 92, 76, 77, 22, 42, 29, 94, 79, 68, 33, 46, 9, 38, 80, 26, 43, 53, 27, 11, 26, 78, 57, 1, 11, 30, 88]], [[4, 86, 72, 80, 33, 33, 74, 66, 4, 87, 51, 27, 33, 97, 84, 77, 75, 83, 32, 67, 77, 28, 86, 57, 19, 31, 84, 53, 88, 32, 9, 51, 83, 23, 25, 97, 46, 44, 66, 67, 28, 99, 78, 24, 56, 50, 3, 23, 34], [9, 82, 59, 66, 22, 35, 31, 90, 78, 48, 53, 92, 75, 32, 85, 87, 88, 12, 62, 3, 6, 12, 53, 20, 6, 84, 14, 56, 41, 49, 65, 84, 86, 95, 31, 28, 12, 16, 97, 35, 44, 68, 10, 98, 3, 31, 52, 95, 65], [5, 5, 66, 15, 65, 21, 71, 11, 90, 42, 66, 94, 61, 60, 14, 5, 31, 48, 32, 57, 34, 74, 95, 27, 82, 5, 17, 75, 69, 56, 38, 54, 48, 85, 88, 94, 80, 49, 41, 22, 57, 66, 19, 2, 75, 33, 73, 59, 89], [6, 11, 27, 72, 45, 31, 91, 63, 44, 41, 47, 69, 79, 2, 15, 95, 20, 3, 39, 74, 90, 10, 40, 13, 85, 98, 44, 32, 73, 30, 1, 53, 76, 44, 35, 88, 40, 45, 60, 63, 10, 47, 24, 57, 18, 57, 72, 46, 43], [77, 16, 14, 9, 73, 69, 61, 11, 19, 64, 38, 10, 16, 93, 69, 82, 42, 44, 53, 35, 36, 22, 24, 76, 12, 35, 50, 83, 78, 87, 40, 22, 47, 75, 66, 10, 43, 69, 94, 85, 97, 25, 47, 7, 28, 80, 45, 67, 83], [12, 83, 11, 3, 61, 66, 56, 26, 86, 81, 34, 55, 79, 76, 16, 80, 39, 6, 72, 52, 25, 56, 83, 19, 76, 73, 93, 27, 5, 26, 30, 78, 97, 35, 75, 53, 68, 33, 70, 28, 74, 36, 49, 90, 94, 86, 53, 69, 2], [97, 80, 71, 64, 21, 35, 46, 86, 48, 22, 6, 33, 39, 43, 25, 18, 41, 35, 24, 55, 40, 87, 97, 29, 10, 79, 10, 90, 64, 29, 98, 18, 2, 25, 85, 51, 95, 22, 9, 91, 89, 89, 91, 74, 94, 4, 21, 30, 33], [43, 90, 2, 87, 31, 4, 47, 84, 89, 45, 65, 66, 6, 7, 51, 68, 18, 41, 69, 25, 56, 1, 98, 55, 3, 54, 81, 32, 88, 2, 65, 98, 8, 58, 53, 44, 73, 28, 19, 56, 20, 71, 56, 35, 19, 81, 63, 82, 7], [27, 39, 30, 23, 84, 23, 90, 47, 78, 48, 95, 91, 63, 9, 23, 63, 74, 47, 87, 74, 66, 37, 38, 1, 48, 82, 35, 71, 86, 53, 25, 42, 23, 9, 27, 75, 51, 91, 92, 57, 82, 36, 34, 13, 55, 46, 52, 94, 28], [86, 88, 30, 45, 38, 20, 70, 97, 47, 59, 79, 79, 96, 14, 42, 61, 59, 8, 57, 22, 84, 88, 21, 28, 49, 23, 88, 54, 23, 68, 46, 68, 94, 28, 95, 97, 50, 83, 63, 10, 89, 37, 13, 70, 30, 87, 80, 72, 80], [11, 1, 86, 18, 11, 84, 10, 48, 61, 10, 60, 22, 75, 99, 9, 15, 83, 37, 70, 44, 69, 3, 10, 77, 4, 56, 40, 33, 98, 33, 60, 21, 69, 45, 57, 77, 40, 81, 64, 10, 74, 66, 85, 65, 30, 82, 35, 53, 39], [22, 67, 70, 80, 67, 75, 17, 19, 60, 72, 78, 90, 89, 51, 48, 57, 10, 32, 79, 68, 28, 4, 61, 77, 12, 15, 29, 87, 13, 38, 58, 35, 40, 76, 94, 5, 2, 30, 99, 10, 73, 81, 38, 59, 94, 35, 71, 12, 42], [98, 49, 67, 33, 13, 75, 20, 95, 33, 34, 50, 50, 9, 7, 9, 26, 2, 5, 66, 10, 31, 33, 6, 14, 78, 15, 97, 95, 81, 43, 79, 20, 21, 64, 29, 59, 73, 64, 93, 44, 34, 47, 9, 60, 30, 17, 52, 59, 4], [40, 96, 96, 7, 38, 32, 69, 67, 56, 20, 64, 17, 16, 11, 13, 18, 14, 34, 76, 86, 85, 26, 42, 61, 39, 2, 57, 50, 16, 62, 98, 11, 83, 63, 30, 54, 71, 27, 86, 64, 81, 79, 9, 76, 72, 2, 49, 48, 55], [80, 67, 31, 26, 66, 30, 77, 78, 1, 96, 70, 22, 75, 87, 54, 14, 14, 84, 71, 19, 26, 59, 22, 6, 63, 77, 74, 54, 19, 95, 10, 37, 77, 17, 55, 5, 21, 39, 20, 71, 15, 79, 53, 87, 33, 44, 66, 50, 32], [79, 71, 73, 55, 28, 86, 3, 53, 42, 2, 22, 25, 89, 32, 7, 62, 31, 63, 37, 68, 97, 79, 9, 70, 46, 95, 34, 60, 13, 36, 96, 86, 48, 93, 75, 6, 5, 65, 50, 74, 74, 24, 7, 86, 58, 21, 86, 33, 44], [25, 95, 80, 15, 29, 83, 52, 17, 90, 36, 35, 40, 23, 73, 34, 58, 82, 80, 61, 96, 28, 60, 32, 58, 82, 44, 34, 93, 21, 1, 55, 80, 49, 97, 21, 99, 55, 27, 20, 95, 16, 78, 48, 32, 32, 53, 53, 2, 57], [22, 52, 81, 96, 81, 58, 34, 71, 93, 17, 88, 72, 23, 33, 29, 19, 69, 37, 87, 26, 24, 54, 21, 97, 90, 10, 42, 29, 57, 35, 28, 12, 58, 44, 7, 16, 84, 93, 35, 92, 7, 86, 14, 59, 62, 74, 66, 22, 16], [99, 75, 43, 97, 98, 97, 83, 20, 10, 19, 12, 10, 71, 56, 11, 80, 97, 61, 38, 17, 54, 45, 25, 31, 65, 39, 20, 73, 43, 66, 1, 55, 51, 5, 12, 14, 60, 96, 40, 9, 42, 42, 33, 25, 78, 9, 91, 44, 83], [58, 25, 32, 22, 93, 55, 92, 61, 57, 77, 61, 92, 67, 94, 75, 2, 57, 73, 33, 90, 63, 16, 89, 1, 85, 64, 84, 69, 17, 40, 1, 13, 18, 68, 14, 5, 62, 33, 26, 61, 68, 30, 62, 62, 81, 92, 70, 57, 91], [36, 7, 65, 74, 77, 41, 32, 14, 33, 30, 73, 6, 10, 75, 20, 89, 12, 22, 76, 14, 48, 54, 36, 61, 55, 14, 2, 2, 61, 6, 25, 67, 23, 73, 95, 28, 25, 99, 65, 66, 79, 43, 40, 80, 23, 49, 99, 8, 7], [21, 35, 97, 99, 82, 61, 83, 74, 68, 30, 97, 68, 9, 17, 43, 88, 57, 13, 57, 26, 61, 62, 19, 81, 30, 90, 13, 49, 82, 85, 98, 51, 9, 94, 29, 93, 83, 8, 81, 76, 15, 69, 34, 52, 50, 67, 5, 98, 9], [88, 5, 27, 84, 47, 62, 45, 66, 23, 98, 61, 93, 43, 35, 30, 67, 10, 56, 34, 65, 6, 70, 43, 16, 63, 65, 5, 25, 27, 42, 55, 26, 16, 90, 28, 92, 30, 77, 89, 45, 19, 13, 75, 23, 14, 74, 98, 23, 40], [64, 85, 59, 20, 32, 78, 24, 46, 18, 94, 92, 48, 14, 54, 21, 98, 5, 31, 67, 87, 59, 44, 64, 94, 42, 94, 38, 7, 59, 69, 70, 49, 78, 11, 2, 95, 27, 16, 64, 66, 49, 90, 16, 73, 52, 73, 5, 36, 7], [61, 96, 29, 67, 30, 40, 31, 48, 91, 6, 62, 29, 9, 54, 84, 11, 19, 74, 5, 87, 70, 95, 18, 21, 15, 59, 95, 74, 6, 24, 97, 60, 28, 92, 74, 23, 79, 46, 37, 14, 48, 78, 71, 36, 82, 60, 54, 79, 63], [97, 48, 22, 43, 41, 17, 63, 90, 79, 18, 72, 3, 54, 14, 34, 97, 1, 48, 99, 10, 83, 11, 99, 66, 3, 15, 59, 64, 47, 92, 2, 30, 38, 5, 6, 5, 12, 4, 24, 25, 26, 55, 46, 46, 43, 60, 33, 21, 87], [37, 12, 21, 13, 33, 70, 76, 61, 30, 37, 82, 16, 45, 71, 1, 53, 28, 53, 44, 67, 39, 10, 51, 14, 79, 6, 39, 80, 82, 99, 48, 25, 97, 33, 83, 75, 67, 65, 40, 25, 57, 32, 46, 4, 23, 80, 75, 22, 33], [41, 62, 38, 56, 63, 77, 85, 76, 55, 51, 90, 65, 57, 86, 27, 57, 55, 96, 72, 98, 82, 4, 65, 56, 53, 44, 16, 94, 23, 31, 28, 50, 16, 41, 9, 2, 43, 66, 96, 80, 77, 49, 91, 95, 97, 21, 19, 57, 77], [60, 19, 99, 64, 35, 33, 67, 85, 87, 48, 60, 45, 75, 68, 68, 15, 92, 72, 88, 98, 15, 23, 60, 91, 14, 2, 99, 43, 71, 16, 86, 28, 32, 71, 86, 2, 72, 7, 38, 48, 85, 86, 99, 82, 73, 2, 42, 42, 81], [20, 6, 11, 69, 74, 87, 97, 40, 36, 51, 47, 98, 17, 26, 53, 48, 27, 46, 67, 19, 72, 81, 65, 71, 36, 67, 83, 42, 91, 67, 98, 69, 49, 37, 46, 80, 56, 63, 78, 30, 96, 63, 76, 91, 26, 93, 23, 86, 20], [46, 80, 31, 67, 21, 51, 39, 63, 69, 20, 23, 96, 42, 73, 3, 27, 91, 74, 80, 24, 87, 9, 2, 6, 99, 71, 79, 21, 87, 29, 13, 69, 42, 1, 20, 43, 1, 99, 40, 7, 35, 52, 34, 50, 69, 29, 91, 71, 1], [73, 58, 65, 91, 17, 62, 96, 94, 79, 42, 28, 3, 92, 5, 66, 54, 38, 80, 44, 81, 76, 90, 57, 71, 24, 80, 82, 59, 8, 91, 90, 95, 82, 2, 41, 87, 56, 48, 22, 97, 18, 79, 41, 67, 48, 23, 2, 4, 26], [19, 49, 74, 86, 53, 6, 62, 1, 16, 52, 7, 88, 35, 78, 68, 15, 57, 23, 83, 78, 91, 86, 11, 4, 58, 96, 40, 58, 88, 98, 67, 38, 2, 87, 40, 84, 56, 72, 35, 49, 67, 96, 95, 44, 31, 65, 76, 18, 88], [36, 62, 29, 89, 23, 3, 30, 81, 45, 49, 94, 19, 64, 5, 56, 34, 73, 48, 26, 5, 88, 31, 24, 85, 22, 22, 85, 57, 30, 47, 74, 67, 39, 93, 89, 66, 77, 91, 29, 14, 4, 72, 5, 44, 91, 24, 98, 28, 24], [5, 13, 82, 55, 81, 30, 83, 86, 49, 82, 90, 15, 92, 30, 28, 84, 4, 68, 15, 34, 75, 87, 99, 43, 99, 75, 61, 63, 2, 52, 52, 15, 40, 28, 95, 96, 98, 55, 50, 22, 29, 72, 86, 12, 87, 38, 2, 12, 55], [85, 12, 95, 9, 79, 32, 73, 88, 8, 28, 56, 82, 36, 37, 32, 85, 39, 49, 93, 18, 23, 33, 73, 51, 43, 4, 80, 67, 72, 80, 2, 45, 83, 88, 80, 40, 2, 32, 1, 18, 64, 32, 9, 55, 67, 24, 11, 28, 16], [93, 12, 68, 90, 4, 75, 66, 31, 56, 50, 67, 89, 98, 1, 69, 39, 52, 95, 36, 67, 12, 61, 80, 72, 11, 14, 91, 82, 54, 8, 33, 4, 30, 84, 94, 91, 89, 54, 6, 5, 78, 51, 14, 34, 41, 89, 39, 18, 20], [8, 26, 85, 27, 32, 42, 50, 81, 49, 65, 63, 27, 75, 35, 38, 38, 42, 42, 49, 57, 54, 10, 60, 40, 1, 86, 64, 81, 12, 57, 77, 89, 26, 40, 43, 97, 72, 13, 90, 56, 17, 88, 24, 76, 95, 58, 80, 61, 80], [94, 28, 67, 97, 51, 88, 94, 92, 39, 66, 77, 74, 40, 13, 19, 6, 18, 9, 81, 68, 54, 50, 70, 11, 55, 42, 90, 11, 72, 67, 2, 82, 66, 26, 76, 37, 90, 36, 16, 78, 66, 21, 7, 11, 56, 44, 54, 93, 57], [58, 37, 48, 62, 39, 92, 64, 68, 68, 27, 70, 98, 82, 60, 44, 30, 97, 58, 84, 36, 5, 99, 19, 12, 90, 60, 83, 11, 53, 20, 73, 84, 27, 58, 5, 74, 9, 89, 77, 32, 72, 54, 45, 27, 86, 28, 18, 87, 31], [41, 34, 7, 5, 21, 6, 45, 35, 87, 3, 33, 38, 87, 80, 89, 16, 89, 71, 8, 3, 69, 19, 7, 86, 90, 50, 89, 6, 5, 61, 86, 95, 58, 22, 57, 75, 32, 17, 58, 41, 22, 80, 42, 79, 8, 46, 48, 3, 77], [30, 28, 73, 76, 25, 37, 85, 51, 39, 83, 72, 67, 86, 1, 38, 52, 63, 52, 83, 85, 60, 13, 91, 17, 84, 30, 38, 11, 27, 38, 28, 26, 33, 32, 54, 25, 24, 40, 27, 46, 86, 84, 97, 69, 93, 69, 39, 81, 29], [75, 86, 31, 65, 15, 83, 74, 9, 13, 45, 90, 6, 44, 2, 29, 48, 12, 87, 67, 50, 11, 5, 45, 74, 47, 6, 80, 95, 87, 94, 84, 89, 99, 69, 63, 67, 47, 34, 12, 27, 69, 86, 68, 28, 71, 45, 98, 2, 9], [79, 31, 36, 15, 97, 62, 31, 27, 2, 73, 43, 1, 83, 9, 60, 2, 58, 65, 12, 55, 90, 10, 65, 65, 61, 95, 75, 69, 35, 11, 68, 38, 39, 21, 36, 92, 72, 20, 43, 21, 35, 64, 32, 36, 69, 52, 4, 7, 98], [84, 71, 24, 21, 57, 73, 19, 84, 28, 32, 34, 16, 38, 81, 75, 4, 56, 40, 50, 40, 82, 49, 48, 6, 96, 5, 79, 45, 16, 17, 59, 56, 79, 35, 8, 99, 61, 27, 78, 87, 20, 57, 70, 88, 23, 76, 2, 27, 32], [93, 50, 64, 40, 33, 29, 33, 17, 74," CHANGE_BITS_CAN_MADE_ONE_FLIP,"static boolean f_filled ( String str ) { int zeros = 0 , ones = 0 ; for ( int i = 0 ; i < str . length ( ) ; i ++ ) { char ch = str . charAt ( i ) ; if ( ch == '0' ) ++ zeros ; else ++ ones ; } return ( zeros == 1 || ones == 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, true, true, false, false, false, false, false]; string [] param0 = [""00001"", ""0000"", ""11"", ""111110"", ""1"", ""111010111010"", ""huinqjxndbfp"", ""5191"", ""1110101101"", ""nupsru xz""]; 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,"static int f_filled ( int a , int b ) { int count = 0 ; int p = Math . abs ( a * b ) ; if ( p == 0 ) return 1 ; while ( p > 0 ) { count ++ ; p = p / 10 ; } return count ; }","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); } " CHECK_ARRAY_CONTAINS_CONTIGUOUS_INTEGERS_DUPLICATES_ALLOWED,"static boolean f_filled ( int arr [ ] , int n ) { int max = Integer . MIN_VALUE ; int min = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { max = Math . max ( max , arr [ i ] ) ; min = Math . min ( min , arr [ i ] ) ; } int m = max - min + 1 ; if ( m > n ) return false ; boolean visited [ ] = new boolean [ n ] ; for ( int i = 0 ; i < n ; i ++ ) visited [ arr [ i ] - min ] = true ; for ( int i = 0 ; i < m ; i ++ ) if ( visited [ i ] == false ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, false, false, true, false, false, true, false]; int [] [] param0 = [[2, 4, 19, 25, 65, 72, 75, 83, 90, 92], [46, 2, 28, -44, 74, -36, -8, 30, -96, 60, 52, -58, 16, -38, 78, 38, -28, 16, 26, -42, 48, 40, 6, 72], [0, 1, 1, 1], [50, 21, 9, 29, 86, 2, 82, 49, 34, 18, 77, 83, 44, 67, 85, 58, 15, 85, 22, 3, 39, 67, 42, 37, 6, 35, 18, 57, 41, 32, 39, 30, 41, 68, 84, 36, 64, 36], [-92, -82, -80, -78, -66, -66, -62, -58, -54, -52, -48, -30, -26, -22, -20, -20, -18, -14, -2, 12, 20, 24, 26, 26, 28, 28, 32, 36, 42, 48, 50, 52, 56, 64, 70, 72, 72, 80, 82, 84, 86, 92], [1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0], [18, 19, 21, 23, 30, 33, 38, 40, 45, 56, 63, 68, 93, 96], [20, -90, -42, 48, 18, -46, 82, -12, -88, 82, 62, 24, 20, 64, -68, -34, -38, 8, -54, -20, -92, 34, -90, 78, 18, 8, -6, 10, 98, -24, 72, -92, 76, -22, 12, -44, 2, 68, -72, 42, 34, 20, -48], [0, 0, 0, 0, 0, 1, 1, 1, 1], [81, 25, 50, 48, 35, 38, 49, 21, 47, 94, 94, 55, 23, 45, 92, 23, 93, 33, 64, 9, 90, 64, 81, 17, 2, 73, 8, 7, 35, 36, 72]]; int [] param1 = [8, 14, 2, 23, 26, 43, 8, 34, 8, 27]; 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); } " RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM_1,"static int f_filled ( int n ) { int dp [ ] = new int [ n + 1 ] ; dp [ 0 ] = 0 ; dp [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) dp [ i ] = Math . max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ] , i ) ; return dp [ n ] ; }","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,"static boolean f_filled ( Integer a [ ] , int b [ ] , int n , int k ) { Arrays . sort ( a , Collections . reverseOrder ( ) ) ; Arrays . sort ( b ) ; for ( int i = 0 ; i < n ; i ++ ) if ( a [ i ] + b [ i ] < k ) return false ; return true ; }","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); } " CHECK_ARRAY_REPRESENTS_INORDER_BINARY_SEARCH_TREE_NOT,"static boolean f_filled ( int [ ] arr , int n ) { if ( n == 0 || n == 1 ) { return true ; } for ( int i = 1 ; i < n ; i ++ ) { if ( arr [ i - 1 ] > arr [ i ] ) { return false ; } } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, true, true, false, true, false, true, false]; int [] [] param0 = [[2, 3, 4, 10, 11, 13, 17, 19, 23, 26, 28, 29, 30, 34, 35, 37, 38, 38, 43, 49, 49, 50, 52, 53, 55, 55, 57, 58, 58, 59, 64, 66, 67, 70, 72, 72, 75, 77, 77, 87, 89, 89, 90, 91, 98, 99, 99, 99], [56, -94, -26, -52, 58, -66, -52, -66, -94, 44, 38, -66, 70, -70, -80, -78, -72, -60, -76, 68, -50, 32, -16, 84, 74, -42, 98, -8, 72, 26, 24, 6, 24, 86, 86, 78, -92, 80, 32, -74, 26, 50, 92, 4, 2, -34, -2, -18, -10], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [38, 79, 76, 92, 92], [-42, -28, 2, 32, 50, 56, 86, 96, 98], [1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 9, 12, 21, 21, 24, 34, 55, 60, 63, 67, 68, 88, 89, 91, 94, 98, 99], [-96, 96, -98, -42, -74, 40, 42, 50, -46, -52, 8, -46, 48, 88, -78, -72, -10, -20, 98, -40, -18, 36, 4, 46, 52, 28, -88, -28, -28, -86], [0, 0, 0, 0, 1, 1], [66, 12, 48, 82, 33, 77, 99, 98, 14, 92]]; int [] param1 = [46, 30, 13, 2, 7, 11, 9, 29, 3, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " GIVEN_A_SORTED_AND_ROTATED_ARRAY_FIND_IF_THERE_IS_A_PAIR_WITH_A_GIVEN_SUM,"static boolean f_filled ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i ] > arr [ i + 1 ] ) break ; int l = ( i + 1 ) % n ; int r = i ; while ( l != r ) { if ( arr [ l ] + arr [ r ] == x ) return true ; if ( arr [ l ] + arr [ r ] < x ) l = ( l + 1 ) % n ; else r = ( n + r - 1 ) % n ; } return false ; }","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,"static int f_filled ( String tree , int k ) { int level = - 1 ; int product = 1 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) product *= ( tree . charAt ( i ) - '0' ) ; } } return product ; }","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,"static int f_filled ( String s ) { int n = s . length ( ) ; int [ ] auxArr = new int [ n ] ; if ( s . charAt ( 0 ) == '1' ) auxArr [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1 ; else auxArr [ i ] = auxArr [ i - 1 ] ; } int count = 0 ; for ( int i = n - 1 ; i >= 0 ; i -- ) if ( s . charAt ( i ) == '1' ) count += auxArr [ i ] ; return count ; }","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_EXIST_TWO_ELEMENTS_ARRAY_WHOSE_SUM_EQUAL_SUM_REST_ARRAY,"static boolean f_filled ( int arr [ ] , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] ; } if ( sum % 2 != 0 ) { return false ; } sum = sum / 2 ; HashSet < Integer > s = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int val = sum - arr [ i ] ; if ( s . contains ( val ) && val == ( int ) s . toArray ( ) [ s . size ( ) - 1 ] ) { System . out . printf ( ""Pair elements are %d and %d\n"" , arr [ i ] , val ) ; return true ; } s . add ( arr [ i ] ) ; } return false ; }","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, true, false]; int [] [] param0 = [[2, 11, 5, 1, 4, 7], [2, 4, 2, 1, 11, 15], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [69, 6, 24, 30, 75, 37, 61, 76, 19, 18, 90, 9, 49, 24, 58, 97, 18, 85, 24, 93, 71, 98, 92, 59, 75, 75, 75, 70, 35, 58, 50, 1, 64, 66, 33], [-94, -94, -92, -74, -60, -58, -56, -44, -42, -40, -28, -14, 2, 4, 14, 20, 24, 28, 40, 42, 42, 66, 78, 78, 80, 82, 96], [1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1], [21, 26, 26, 27, 61, 62, 96], [-54, 86, 20, 26], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [44, 35, 26, 15, 56, 6, 36, 53, 15, 66, 20, 53, 99, 96, 51, 12, 61, 19, 79, 40, 99, 42, 86, 8, 11, 54, 93, 46, 23, 47, 41, 26, 66, 5, 86, 52, 64, 51, 4, 21, 63, 14, 7, 53, 31, 8, 9, 63]]; int [] param1 = [6, 6, 13, 18, 26, 10, 6, 3, 4, 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); } " CHECK_IF_STRING_REMAINS_PALINDROME_AFTER_REMOVING_GIVEN_NUMBER_OF_CHARACTERS,"static boolean f_filled ( String str , int n ) { int len = str . length ( ) ; if ( len >= n ) return true ; return false ; }","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,"static int f_filled ( int n ) { return ( 1 << ( n - 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); } " CHECK_GIVEN_MATRIX_SPARSE_NOT,"static boolean f_filled ( int array [ ] [ ] , int m , int n ) { int counter = 0 ; for ( int i = 0 ; i < m ; ++ i ) for ( int j = 0 ; j < n ; ++ j ) if ( array [ i ] [ j ] == 0 ) ++ counter ; return ( counter > ( ( m * n ) / 2 ) ) ; }","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 = [[[79, 0, 59, 0, 0, 0, 0, 47, 0, 0, 35, 0, 0, 0, 0, 0, 0, 0, 0, 83, 67, 0, 0, 0, 47, 0], [95, 0, 0, 19, 0, 0, 0, 0, 0, 55, 5, 0, 0, 97, 0, 61, 0, 0, 49, 0, 0, 0, 0, 0, 0, 0], [0, 83, 0, 0, 55, 85, 23, 83, 0, 0, 5, 0, 0, 59, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 65, 73], [0, 0, 97, 0, 65, 0, 11, 0, 0, 0, 0, 47, 0, 0, 0, 0, 0, 55, 0, 0, 0, 0, 11, 0, 1, 0], [0, 83, 0, 0, 0, 0, 0, 23, 0, 1, 0, 97, 0, 0, 47, 41, 23, 0, 1, 0, 0, 0, 71, 0, 0, 0], [0, 0, 71, 85, 0, 0, 0, 0, 0, 0, 0, 25, 0, 97, 13, 0, 0, 0, 37, 0, 37, 0, 0, 23, 31, 53], [37, 67, 0, 0, 0, 0, 0, 0, 65, 0, 0, 49, 91, 0, 13, 0, 0, 0, 0, 0, 0, 41, 91, 59, 0, 85], [65, 0, 25, 0, 0, 0, 0, 0, 0, 43, 67, 97, 0, 91, 0, 0, 71, 0, 95, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 71, 0, 0, 0, 43, 37, 0, 71, 37, 89, 0, 85, 0, 7, 0, 0, 0, 0, 0, 0, 0, 0], [77, 5, 0, 0, 0, 0, 0, 0, 49, 0, 0, 97, 0, 53, 83, 0, 0, 0, 0, 11, 0, 0, 11, 0, 0, 0], [0, 83, 0, 0, 0, 13, 85, 41, 0, 0, 67, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31, 0, 71, 0], [0, 0, 1, 67, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 67, 0, 0, 0, 0, 5, 0, 0], [0, 43, 0, 0, 0, 0, 79, 41, 0, 0, 0, 73, 0, 65, 0, 0, 85, 0, 77, 37, 89, 0, 0, 0, 0, 0], [53, 0, 0, 0, 61, 0, 0, 0, 0, 0, 65, 59, 0, 0, 0, 31, 0, 0, 13, 61, 31, 0, 43, 0, 0, 0], [53, 0, 0, 0, 0, 67, 0, 53, 0, 37, 85, 0, 29, 0, 59, 0, 0, 0, 0, 0, 0, 0, 0, 0, 97, 0], [0, 0, 0, 0, 0, 25, 13, 0, 0, 0, 0, 0, 37, 0, 0, 0, 0, 89, 0, 0, 0, 0, 0, 0, 0, 0], [0, 79, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0, 0, 31, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 11], [0, 0, 0, 73, 0, 0, 0, 97, 0, 7, 0, 59, 91, 17, 0, 0, 0, 0, 0, 0, 0, 47, 0, 0, 17, 17], [67, 0, 0, 0, 0, 29, 0, 0, 0, 25, 25, 79, 47, 31, 0, 55, 0, 0, 59, 0, 89, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 71, 11, 0, 79, 37, 0, 0, 0, 0, 0, 0, 0, 85, 0, 0, 0, 89], [0, 0, 0, 0, 35, 0, 13, 49, 0, 0, 0, 41, 91, 0, 29, 0, 0, 0, 73, 0, 95, 61, 0, 0, 91, 0], [0, 0, 0, 0, 37, 85, 0, 0, 0, 17, 0, 0, 61, 89, 79, 55, 5, 0, 0, 0, 0, 0, 0, 0, 0, 0], [95, 0, 0, 0, 67, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 47, 0, 0, 0, 0, 0, 0, 77], [89, 0, 0, 0, 0, 0, 0, 0, 0, 0, 85, 67, 0, 0, 0, 0, 19, 0, 0, 89, 91, 7, 1, 0, 37, 0], [0, 0, 0, 29, 0, 11, 0, 0, 11, 65, 13, 97, 0, 0, 1, 37, 25, 0, 0, 0, 95, 0, 0, 47, 0, 91], [0, 0, 0, 79, 0, 0, 0, 0, 7, 31, 0, 0, 0, 83, 0, 0, 0, 0, 0, 0, 0, 1, 95, 0, 0, 0]], [[67, 41, 95, 96, 46, 82, 5, 44, 41, 3, 55, 19, 1, 18, 59, 62, 56, 37, 60, 49, 5, 79, 68], [85, 12, 82, 41, 38, 52, 33, 75, 11, 46, 3, 21, 13, 93, 20, 42, 52, 95, 74, 69, 93, 1, 81], [95, 24, 13, 91, 41, 41, 85, 4, 98, 89, 97, 25, 13, 33, 18, 51, 54, 58, 24, 7, 33, 7, 65], [60, 17, 53, 18, 95, 76, 49, 84, 61, 35, 53, 48, 45, 88, 73, 51, 51, 8, 61, 97, 76, 15, 38], [30, 58, 80, 23, 72, 21, 10, 98, 40, 36, 54, 67, 79, 97, 94, 59, 86, 77, 93, 36, 77, 84, 5], [89, 42, 17, 26, 96, 26, 88, 89, 86, 21, 97, 39, 96, 57, 83, 24, 6, 85, 68, 12, 15, 92, 16], [45, 85, 17, 37, 50, 90, 60, 57, 3, 31, 32, 44, 66, 61, 32, 47, 2, 49, 38, 99, 21, 43, 95], [46, 50, 98, 39, 76, 81, 51, 16, 48, 63, 37, 54, 73, 30, 3, 41, 74, 61, 13, 4, 66, 92, 49], [25, 60, 8, 35, 12, 70, 77, 66, 35, 88, 40, 57, 38, 97, 31, 44, 6, 13, 3, 68, 28, 58, 72], [68, 78, 45, 66, 58, 8, 25, 90, 77, 1, 55, 60, 98, 54, 71, 60, 18, 86, 29, 48, 78, 75, 4], [56, 95, 41, 62, 43, 81, 32, 55, 95, 35, 61, 11, 34, 70, 27, 99, 59, 90, 27, 33, 71, 16, 35], [68, 16, 57, 90, 76, 38, 11, 75, 31, 81, 12, 62, 9, 3, 58, 51, 88, 25, 80, 72, 44, 14, 15], [99, 24, 44, 97, 54, 95, 80, 78, 12, 1, 86, 77, 27, 55, 54, 40, 65, 87, 6, 16, 14, 36, 87], [53, 8, 42, 68, 29, 57, 22, 34, 4, 87, 69, 56, 6, 81, 15, 83, 81, 31, 61, 7, 18, 2, 81], [26, 43, 12, 57, 23, 79, 80, 26, 70, 36, 33, 28, 27, 72, 97, 52, 13, 90, 45, 1, 44, 81, 38], [43, 82, 40, 76, 62, 67, 88, 72, 93, 2, 18, 87, 14, 1, 15, 88, 32, 39, 68, 31, 44, 54, 16], [99, 50, 21, 42, 96, 76, 40, 78, 48, 32, 66, 65, 10, 62, 39, 16, 41, 78, 59, 50, 50, 5, 83], [92, 92, 66, 22, 29, 40, 40, 16, 41, 61, 64, 13, 63, 76, 63, 10, 91, 12, 20, 88, 79, 54, 47], [61, 68, 76, 59, 98, 25, 18, 44, 3, 95, 61, 77, 12, 39, 79, 83, 92, 13, 75, 39, 6, 5, 65], [49, 12, 1, 19, 6, 19, 8, 86, 44, 61, 23, 88, 6, 52, 85, 67, 13, 74, 64, 46, 54, 96, 86], [2, 39, 65, 66, 43, 54, 6, 96, 27, 88, 90, 65, 26, 65, 23, 89, 26, 78, 76, 94, 37, 83, 3], [46, 32, 63, 18, 68, 16, 40, 27, 77, 56, 92, 52, 14, 6, 15, 3, 22, 48, 40, 51, 13, 95, 21], [28, 13, 95, 35, 18, 71, 3, 37, 46, 77, 61, 89, 52, 94, 46, 90, 59, 3, 19, 49, 79, 14, 49]], [[0, 0, 0, 13, 0, 0, 0, 0, 35, 0, 0, 77, 0, 67, 0, 17, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0], [91, 0, 0, 0, 0, 71, 0, 65, 0, 0, 0, 0, 0, 1, 0, 0, 0, 41, 0, 0, 0, 0, 5, 0, 0, 0, 89, 85], [47, 0, 0, 0, 0, 0, 0, 35, 7, 0, 0, 0, 97, 0, 0, 41, 0, 0, 0, 0, 0, 73, 79, 73, 73, 0, 17, 0], [7, 0, 59, 11, 0, 0, 79, 0, 0, 0, 0, 0, 0, 91, 0, 0, 5, 35, 0, 73, 0, 0, 0, 0, 0, 0, 73, 0], [0, 35, 37, 0, 0, 55, 13, 47, 47, 0, 0, 0, 0, 0, 0, 0, 0, 0, 77, 0, 0, 0, 61, 0, 0, 0, 0, 65], [71, 0, 0, 0, 73, 49, 79, 0, 0, 73, 0, 0, 0, 35, 47, 0, 73, 19, 0, 37, 95, 73, 0, 0, 29, 19, 0, 0], [0, 0, 0, 35, 0, 13, 0, 0, 0, 0, 95, 0, 0, 0, 0, 0, 49, 0, 0, 31, 0, 95, 65, 0, 0, 0, 59, 0], [55, 0, 65, 0, 0, 0, 0, 0, 71, 0, 35, 0, 0, 19, 25, 0, 0, 77, 0, 0, 0, 55, 35, 0, 0, 0, 0, 0], [7, 7, 61, 0, 0, 0, 0, 91, 47, 37, 0, 23, 0, 0, 65, 85, 1, 85, 0, 61, 61, 0, 0, 0, 0, 0, 85, 35], [0, 0, 0, 0, 0, 7, 0, 0, 49, 0, 49, 0, 67, 0, 0, 0, 0, 71, 1, 0, 0, 0, 0, 0, 0, 0, 0, 47], [0, 5, 47, 13, 0, 79, 0, 0, 0, 41, 0, 0, 0, 43, 0, 0, 0, 0, 29, 83, 59, 23, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 53, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 89, 0, 0, 79, 55, 0], [0, 0, 0, 0, 89, 97, 0, 0, 0, 0, 19, 25, 0, 0, 0, 0, 0, 0, 0, 23, 0, 0, 61, 0, 0, 5, 83, 91], [0, 0, 0, 19, 0, 7, 0, 0, 29, 0, 35, 11, 0, 41, 0, 65, 41, 0, 0, 0, 0, 11, 0, 0, 0, 71, 0, 0], [0, 0, 49, 0, 0, 31, 67, 0, 91, 0, 23, 0, 43, 5, 47, 0, 0, 0, 0, 19, 0, 0, 77, 0, 31, 0, 7, 0], [0, 55, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 11, 55, 67, 0, 61, 29, 0, 0, 0, 0, 0, 0], [17, 23, 25, 0, 0, 0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 0, 43, 17, 0, 0, 0, 0, 47, 0, 11, 0, 0, 0], [0, 0, 0, 41, 65, 0, 49, 0, 0, 0, 49, 0, 19, 0, 5, 47, 47, 71, 23, 13, 0, 0, 43, 0, 49, 61, 83, 97], [0, 97, 29, 0, 77, 0, 0, 71, 0, 0, 0, 0, 0, 0, 41, 0, 0, 0, 0, 13, 0, 37, 49, 0, 0, 0, 43, 0], [23, 0, 73, 0, 0, 0, 0, 61, 0, 0, 31, 73, 97, 0, 0, 0, 31, 55, 0, 0, 0, 0, 0, 0, 0, 35, 47, 0], [0, 0, 0, 0, 7, 0, 17, 77, 0, 0, 0, 0, 0, 73, 17, 29, 0, 0, 19, 0, 71, 0, 0, 0, 55, 0, 85, 0], [0, 0, 0, 49, 0, 0, 0, 0, 61, 0, 0, 0, 0, 19, 0, 49, 0, 0, 0, 0, 19, 0, 0, 59, 0, 0, 0, 0], [13, 0, 0, 0, 0, 0, 0, 77, 0, 0, 97, 0, 0, 71, 0, 0, 11, 71, 0, 0, 0, 0, 0, 0, 19, 0, 0, 0], [0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 31, 0, 23, 0, 0, 0, 0, 91, 43, 97, 0, 0, 65, 0, 0, 5, 0, 0], [17, 29, 0, 0, 95, 0, 0, 37, 0, 0, 0, 0, 0, 83, 0, 0, 0, 0, 0, 0, 0, 29, 0, 0, 0, 0, 0, 49], [79, 0, 0, 43, 95, 0, 13, 0, 0, 0, 0, 65, 59, 0, 0, 0, 0, 0, 0, 0, 0, 19, 0, 0, 19, 0, 0, 5], [0, 0, 0, 89, 77, 0, 0, 0, 73, 0, 5, 0, 0, 0, 0, 0, 7, 49, 0, 0, 0, 0, 0, 59, 0, 49, 0, 0], [0, 79, 0, 65, 95, 0, 0, 59, 0, 0, 0, 5, 47, 0, 0, 17, 0, 17, 0, 0, 0, 35, 0, 1, 0, 13, 0, 0]], [[39, 82, 13, 38, 88, 30, 51, 34, 53, 58, 54, 87, 30, 72, 77, 48, 55, 34, 87], [70, 86, 28, 68, 52, 48, 78, 42, 68, 21, 27, 35, 41, 53, 76, 18, 39, 24, 61], [16, 38, 21, 46, 59, 52, 95, 97, 88, 90, 43, 83, 11, 25, 40, 18, 37, 47, 3], [53, 9, 6, 43, 54, 79, 86, 88, 68, 7, 79, 21, 70, 88, 77, 63, 90, 45, 64], [99, 16, 85, 5, 92, 38, 81, 26, 48, 18, 1, 43, 8, 59, 28, 47, 51, 31, 90], [4, 87, 14, 14, 97, 51, 81, 65, 25, 1, 22, 32, 46, 85, 90, 21, 85, 42, 44], [8, 96, 27, 63, 63, 65, 73, 66, 9, 54, 89, 93, 26, 72, 58, 71, 25, 67, 22], [76, 76, 64, 6, 24, 23, 29, 82, 7, 76, 93, 28, 54, 79, 47, 45, 53, 93, 24], [13, 30, 78, 6, 4, 21, 75, 30, 78, 42, 11, 19, 36, 4, 40, 35, 64, 19, 56], [61, 15, 99, 3, 59, 34, 15, 16, 3, 74, 70, 81, 11, 56, 24, 79, 31, 95, 30], [86, 49, 28, 58, 35, 14, 20, 83, 59, 88, 68, 16, 29, 74, 54, 64, 39, 89, 34], [79, 40, 23, 60, 79, 43, 88, 1, 21, 5, 51, 30, 20, 72, 63, 28, 56, 80, 2], [46, 70, 71, 17, 9, 12, 98, 70, 89, 72, 99, 25, 10, 9, 58, 67, 91, 97, 55], [84, 89, 11, 89, 91, 37, 34, 88, 35, 68, 92, 53, 90, 40, 12, 56, 16, 51, 32], [18, 89, 27, 59, 9, 86, 56, 35, 70, 5, 30, 5, 53, 42, 75, 63, 28, 14, 20], [21, 83, 86, 48, 24, 16, 5, 97, 65, 79, 51, 42, 2, 36, 2, 70, 64, 31, 19], [94, 81, 22, 39, 33, 76, 10, 41, 94, 25, 33, 15, 78, 17, 42, 53, 46, 69, 50], [45, 90, 30, 89, 62, 86, 37, 35, 8, 38, 64, 17, 6, 20, 92, 83, 84, 28, 41], [51, 97, 5, 17, 16, 93, 15, 74, 74, 98, 24, 25, 66, 71, 95, 44, 47, 39, 41]], [[0, 0, 0, 0, 0, 0, 11, 67, 0, 0, 0, 47, 0, 0, 0, 55, 85, 0, 0, 0], [49, 0, 79, 0, 0, 0, 91, 0, 91, 0, 0, 11, 0, 0, 0, 0, 31, 73, 0, 0], [0, 0, 0, 0, 85, 0, 0, 0, 47, 67, 0, 13, 29, 0, 53, 71, 0, 0, 0, 0], [0, 0, 0, 0, 71, 83, 0, 0, 0, 0, 31, 0, 0, 89, 0, 0, 59, 0, 19, 91], [23, 0, 17, 0, 0, 0, 79, 0, 0, 37, 91, 0, 0, 0, 0, 0, 0, 1, 0, 0], [0, 83, 0, 0, 25, 0, 0, 0, 0, 41, 0, 1, 17, 0, 0, 0, 0, 0, 0, 1], [0, 0, 59, 97, 5, 0, 41, 0, 95, 0, 0, 0, 0, 0, 83, 0, 0, 83, 0, 0], [0, 55, 0, 85, 0, 11, 0, 0, 71, 61, 97, 0, 0, 0, 0, 0, 0, 0, 0, 37], [0, 25, 0, 41, 31, 0, 0, 1, 0, 0, 0, 0, 19, 23, 5, 0, 0, 0, 0, 0], [37, 17, 0, 0, 0, 0, 49, 0, 89, 0, 23, 0, 0, 47, 0, 0, 77, 11, 67, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 89, 0, 0, 13, 0], [0, 11, 25, 0, 65, 0, 0, 73, 67, 0, 0, 43, 0, 55, 0, 0, 49, 0, 97, 41], [0, 0, 0, 0, 59, 0, 1, 35, 0, 0, 0, 29, 0, 0, 0, 0, 41, 83, 0, 0], [0, 35, 0, 0, 0, 53, 11, 0, 43, 67, 0, 95, 0, 0, 29, 0, 0, 0, 83, 0], [0, 0, 0, 0, 0, 0, 0, 0, 23, 0, 29, 13, 0, 95, 0, 0, 0, 31, 0, 0], [0, 0, 0, 0, 95, 0, 19, 0, 0, 53, 0, 55, 0, 73, 85, 47, 85, 0, 0, 0], [67, 79, 0, 0, 0, 0, 0, 1, 0, 13, 0, 0, 0, 7, 85, 0, 0, 0, 0, 55], [55, 0, 0, 0, 43, 0, 0, 0, 0, 0, 0, 71, 0, 0, 0, 49, 0, 79, 0, 7], [0, 0, 47, 0, 0, 83, 0, 31, 91, 83, 0, 0, 43, 91, 0, 23, 0, 0, 0, 0], [0, 65, 0, 13, 0, 0, 0, 0, 79, 29, 0, 0, 77, 95, 47, 0, 0, 17, 0, 0]], [[42, 12, 11, 27, 59, 79, 58, 6, 82, 98, 65, 11, 95, 88, 36, 77, 61, 28, 50, 28, 70, 14, 95, 80, 20, 65, 34, 20, 88, 46, 82], [1, 96, 71, 86, 2, 9, 74, 20, 86, 87, 24, 96, 26, 21, 1, 69, 81, 31, 10, 37, 36, 39, 1, 27, 75, 69, 30, 36, 72, 28, 98], [18, 65, 21, 19, 89, 33, 81, 88, 43, 82, 73, 24, 95, 93, 47, 28, 17, 84, 14, 83, 26, 60, 11, 59, 10, 88, 15, 56, 70, 87, 6], [66, 16, 52, 35, 8, 58, 36, 40, 75, 53, 58, 99, 56, 22, 72, 14, 68, 44, 41, 64, 8, 50, 37, 36, 15, 19, 45, 15, 43, 53, 88], [73, 21, 71, 14, 86, 73, 13, 23, 69, 2, 31, 46, 92, 48, 21, 1, 90, 16, 38, 69, 86, 43, 49, 64, 6, 67, 78, 26, 55, 14, 57], [82, 84, 40, 95, 26, 69, 81, 37, 37, 83, 31, 49, 24, 25, 55, 95, 60, 16, 31, 51, 68, 54, 21, 67, 88, 72, 67, 88, 60, 43, 52], [44, 44, 36, 89, 17, 72, 6, 53, 12, 96, 46, 89, 63, 84, 33, 17, 61, 24, 53, 7, 51, 32, 98, 74, 86, 38, 31, 72, 95, 97, 81], [85, 45, 94, 87, 79, 71, 68, 12, 22, 58, 22, 85, 14, 7, 37, 88, 36, 92, 47, 34, 5, 72, 97, 54, 65, 46, 12, 66, 25, 46, 8], [58, 48, 97, 83, 67, 99, 28, 41, 80, 28, 94, 82, 76, 16, 59, 78, 65, 11, 28, 7, 95, 29, 58, 68, 14, 38, 47, 12, 69, 66, 18], [53, 14, 30, 70, 31, 44, 10, 1, 79, 76, 33, 79, 65, 54, 25, 96, 51, 80, 53, 66, 10, 42, 46, 57, 41, 39, 51, 13, 4, 28, 44], [54, 45, 31, 12, 11, 54, 5, 58, 36, 27, 84, 18, 78, 61, 49, 31, 31, 88, 10, 13, 19, 43, 28, 9, 34, 51, 17, 83, 15, 49, 62], [71, 83, 64, 18, 74, 48, 19, 52, 99, 50, 98, 49, 8, 73, 43, 85, 52, 19, 77, 83, 81, 43, 73, 63, 80, 45, 43, 80, 63, 6, 52], [47, 20, 16, 17, 59, 58, 56, 14, 39, 1, 66, 15, 76, 22, 23, 53, 97, 17, 76, 24, 66, 62, 46, 63, 87, 9, 31, 72, 14, 68, 50], [64, 94, 13, 2, 45, 48, 57, 13, 11, 31, 34, 7, 24, 90, 24, 66, 26, 61, 9, 15, 8, 28, 86, 76, 37, 4, 92, 35, 72, 93, 93], [58, 80, 95, 77, 7, 36, 55, 28, 37, 2, 85, 62, 43, 9, 46, 14, 29, 63, 16, 14, 40, 80, 94, 86, 32, 1, 45, 48, 43, 44, 47], [94, 14, 6, 63, 92, 78, 80, 77, 40, 19, 74, 67, 13, 14, 25, 74, 76, 76, 62, 25, 55, 23, 61, 98, 32, 39, 61, 86, 4, 47, 69], [20, 46, 96, 16, 79, 16, 86, 10, 30, 20, 25, 69, 74, 88, 15, 91, 74, 97, 2, 5, 13, 37, 92, 8, 99, 14, 46, 19, 19, 74, 67], [26, 34, 34, 85, 1, 51, 34, 55, 91, 6, 24, 45, 7, 94, 21, 77, 88, 14, 36, 59, 10, 26, 6, 33, 18, 40, 9, 13, 53, 42, 24], [46, 40, 59, 19, 6, 86, 68, 5, 55, 32, 75, 24, 8, 90, 1, 58, 83, 20, 23, 33, 5, 76, 13, 52, 87, 6, 35, 28, 2, 1, 94], [42, 82, 23, 86, 81, 20, 39, 5, 51, 50, 92, 87, 74, 50, 40, 87, 39, 9, 82, 71, 15, 81, 8, 99, 36, 16, 40, 8, 10, 74, 96], [5, 36, 89, 45, 15, 98, 24, 17, 30, 40, 27, 73, 31, 71, 56, 30, 92, 84, 18, 29, 22, 32, 41, 22, 54, 94, 87, 93, 78, 87, 75], [59, 94, 45, 80, 53, 46, 25, 43, 26, 66, 24, 35, 93, 77, 76, 88, 48, 63, 86, 59, 84, 12, 50, 91, 30, 51, 33, 95, 56, 91, 73], [90, 74, 86, 27, 96, 47, 7, 33, 42, 67, 94, 71, 10, 49, 19, 46, 49, 12, 91, 86, 43, 34, 87, 35, 71, 24, 10, 89, 6, 19, 48], [50, 66, 60, 59, 81, 36, 45, 77, 60, 2, 24, 89, 58, 34, 38, 90, 92, 63, 80, 85, 47, 1, 1, 35, 21, 11, 78, 39, 42, 65, 74], [1, 87, 40, 86, 74, 21, 38, 82, 16, 26, 8, 16, 44, 92, 83, 64, 79, 2, 75, 95, 40, 35, 57, 56, 55, 12, 59, 94, 94, 35, 94], [35, 64, 13, 52, 28, 88, 14, 55, 63, 81, 51, 1, 98, 97, 42, 13, 24, 33, 40, 85, 88, 4, 86, 63, 34, 82, 70, 42, 76, 57, 36], [82, 10, 12, 74, 92, 50, 4, 74, 42, 91, 76, 86, 97, 6, 92, 64, 83, 2, 64, 15, 59, 43, 24, 48, 95, 16, 36, 69, 21, 11, 88], [23, 19, 93, 9, 85, 70, 28, 44, 28, 79, 48, 78, 38, 24, 77, 41, 46, 73, 97, 50, 81, 7, 44, 66, 98, 7, 17, 99, 27, 98, 16], [98, 24, 28, 57, 76, 91, 95, 14, 27, 87, 68, 78, 75, 5, 61, 43, 86, 36, 1, 48, 11, 36, 92, 5, 4, 44, 32, 72, 18, 61, 82], [74, 52, 92, 80, 86, 94, 3, 63, 40, 42, 69, 93, 95, 57, 55, 88, 47, 23, 92, 24, 92, 16, 35, 73, 40, 76, 98, 25, 29, 18, 99], [54, 18, 49, 72, 31, 41, 51, 75, 72, 54, 76, 74, 42, 72, 63, 89, 4, 3, 19, 34, 63, 25, 93, 77, 45, 46, 5, 85, 30, 93, 18]], [[31, 83, 0, 0, 5, 89, 29, 61, 0, 0, 0, 11, 0, 0, 0, 11, 0, 0, 0, 0, 0, 0, 0, 0, 55, 0, 0, 89], [0, 0, 0, 0, 0, 95, 49, 0, 65, 0, 0, 71, 0, 0, 95, 0, 1, 0, 0, 65, 17, 35, 5, 0, 0, 53, 79, 0], [0, 89, 0, 91, 97, 0, 0, 0, 43, 0, 0, 41, 0, 41, 0, 0, 0, 0, 0, 0, 53, 0, 0, 0, 55, 0, 0, 79], [0, 71, 53, 0, 0, 0, 97, 5, 0, 0, 91, 0, 0, 0, 0, 67, 0, 83, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 71, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 0, 0, 0, 29, 0, 0, 0, 35, 0, 0, 0], [41, 71, 71, 83, 67, 0, 0, 0, 0, 65, 0, 0, 19, 11, 19, 0, 0, 0, 0, 19, 67, 0, 0, 41, 17, 29, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 89, 29, 59, 71, 53, 0, 0, 0, 17, 0, 0, 0, 97, 95, 0, 89, 0, 1, 0], [65, 0, 7, 0, 73, 61, 0, 0, 0, 55, 0, 0, 19, 0, 47, 61, 0, 0, 0, 0, 91, 0, 0, 0, 0, 77, 0, 53], [0, 19, 71, 37, 53, 0, 29, 0, 0, 0, 0, 0, 0, 59, 97, 0, 0, 83, 0, 0, 0, 0, 0, 83, 43, 53, 49, 0], [83, 71, 91, 0, 0, 91, 19, 23, 0, 0, 77, 0, 0, 67, 0, 0, 0, 0, 5, 1, 0, 0, 0, 73, 0, 0, 85, 0], [0, 0, 0, 0, 19, 0, 0, 17, 23, 0, 83, 0, 0, 0, 0, 0, 91, 0, 0, 0, 53, 0, 0, 0, 0, 0, 13, 25], [83, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 37, 0, 0, 0, 0, 0, 25, 0, 83, 53, 95, 0, 0, 0], [37, 59, 5, 5, 0, 95, 23, 0, 55, 77, 0, 0, 23, 0, 0, 83, 89, 11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 19, 11, 23, 73, 83, 23, 53, 0, 0, 0, 0, 95, 0, 0, 0, 0, 0, 23, 83, 65, 0, 0, 0, 0, 0], [79, 0, 79, 55, 0, 0, 0, 0, 55, 31, 83, 17, 0, 0, 0, 55, 0, 49, 0, 0, 0, 5, 0, 0, 0, 0, 0, 0], [0, 29, 0, 29, 91, 23, 0, 41, 0, 1, 0, 43, 0, 43, 0, 0, 0, 53, 0, 85, 25, 0, 95, 0, 0, 0, 71, 0], [0, 0, 0, 83, 0, 0, 0, 0, 0, 0, 0, 0, 0, 89, 0, 0, 0, 0, 59, 71, 0, 0, 0, 0, 71, 95, 0, 0], [0, 0, 77, 0, 0, 0, 0, 0, 0, 83, 0, 0, 0, 0, 0, 0, 59, 0, 23, 0, 89, 0, 0, 0, 0, 0, 97, 0], [85, 0, 0, 0, 0, 41, 0, 0, 0, 31, 41, 79, 0, 49, 0, 0, 0, 0, 37, 0, 77, 0, 0, 77, 0, 41, 0, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 41, 0, 0, 0, 0, 0, 0, 0, 0, 0, 89, 0, 0, 0, 0, 0, 0, 89, 0], [0, 0, 29, 0, 59, 89, 83, 0, 0, 11, 0, 0, 0, 91, 0, 0, 0, 73, 91, 89, 89, 1, 95, 61, 19, 65, 0, 0], [0, 0, 79, 0, 0, 53, 77, 49, 0, 1, 0, 0, 71, 77, 0, 25, 0, 91, 0, 0, 0, 0, 0, 65, 19, 0, 95, 43], [0, 0, 31, 83, 0, 97, 0, 0, 0, 73, 0, 47, 47, 19, 0, 0, 85, 61, 0, 0, 83, 0, 0, 29, 0, 0, 0, 0], [0, 0, 0, 0, 55, 0, 0, 0, 71, 29, 83, 95, 0, 5, 0, 0, 61, 0, 55, 47, 0, 0, 79, 1, 49, 0, 11, 0], [19, 0, 0, 25, 29, 0, 41, 0, 13, 0, 5, 0, 97, 0, 71, 89, 0, 89, 0, 0, 0, 31, 0, 53, 0, 1, 0, 0], [0, 47, 0, 0, 0, 11, 0, 0, 0, 25, 0, 0, 0, 0, 0, 19, 31, 0, 0, 0, 0, 0, 0, 0, 0, 97, 25, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 61, 25, 0, 0, 35, 23, 0, 19, 0, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 17, 0, 0, 0, 0, 0, 37, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0, 0, 0, 0, 19, 0, 19, 0, 0, 0]], [[86, 39, 88, 64, 64, 37, 73, 80, 25, 79, 52, 51, 19, 48, 70, 73, 48, 63, 88, 16, 65, 48, 18, 28, 86, 68, 39, 5, 55, 72, 32, 80, 36, 99, 34], [48, 65, 65, 73, 63, 75, 55, 30, 69, 9, 72, 86, 91, 97, 40, 82, 5, 27, 81, 60, 14, 1, 26, 40, 66, 25, 90, 67, 99, 91, 72, 58, 90, 15, 32], [23, 80, 72, 57, 90, 2, 90, 95, 85, 57, 31, 8, 50, 43, 82, 6, 52, 75, 80, 62, 45, 2, 12, 63, 85, 70, 26, 16, 70, 81, 7, 32, 37, 94, 98], [15, 21, 54, 26, 33, 81, 87, 40, 92, 3, 85, 11, 78, 60, 22, 41, 52, 56, 59, 35, 32, 46, 52, 94, 7, 87, 37, 97, 93, 62, 28, 5, 49, 82, 22], [76, 57, 20, 20, 21, 61, 42, 5, 77, 98, 55, 66, 19, 93, 10, 63, 95, 65, 56, 79, 97, 53, 34, 6, 10, 40, 40, 31, 85, 64, 41, 69, 13, 87, 53], [6, 47, 51, 40, 50, 99, 74, 22, 81, 41, 4, 80, 4, 43, 91, 22, 21, 15, 63, 17, 34, 66, 39, 55, 36, 66, 97, 38, 55, 87, 18, 97, 31, 89, 65], [75, 45, 99, 54, 56, 42, 4, 40, 26, 96, 88, 36, 81, 33, 95, 53, 81, 39, 28, 25, 75, 8, 69, 40, 16, 30, 37, 78, 71, 31, 87, 42, 22, 36, 17], [40, 19, 21, 62, 43, 32, 10, 82, 99, 29, 95, 44, 95, 94, 16, 14, 1, 50, 32, 96, 88, 83, 15, 1, 84, 6, 45, 63, 14, 11, 83, 74, 76, 96, 53], [78, 42, 30, 64, 97, 13, 16, 42, 44, 61, 2, 67, 81, 11, 51, 80, 99, 2, 42, 54, 51, 51, 96, 3, 16, 49, 5, 44, 75, 56, 74, 48, 72, 43, 7], [30, 13, 90, 78, 1, 17, 42, 50, 87, 19, 86, 72, 78, 4, 86, 39, 8, 43, 49, 48, 19, 60, 27, 24, 74, 73, 13, 59, 32, 34, 55, 93, 24, 84, 56], [71, 81, 10, 4, 78, 71, 76, 75, 47, 17, 8, 27, 67, 21, 59, 79, 47, 26, 30, 40, 80, 44, 54, 37, 11, 9, 94, 73, 42, 82, 49, 19, 47, 75, 59], [59, 76, 5, 83, 49, 4, 17, 80, 90, 96, 52, 83, 24, 8, 81, 92, 32, 77, 76, 70, 34, 47, 63, 68, 15, 66, 20, 92, 55, 81, 77, 17, 8, 81, 73], [42, 41, 17, 73, 48, 41, 60, 14, 37, 36, 68, 95, 62, 2, 48, 41, 85, 76, 85, 91, 11, 4, 18, 24, 71, 25, 27, 57, 81, 80, 62, 4, 18, 72, 8], [38, 10, 4, 2, 15, 22, 30, 4, 70, 25, 43, 60, 74, 55, 1, 50, 1, 20, 99, 52, 27, 42, 12, 51, 10, 3, 91, 27, 69, 82, 98, 21, 70, 1, 36], [11, 38, 88, 76, 14, 36, 99, 12, 60, 88, 12, 30, 57, 95, 77, 4, 74, 43, 20, 3, 15, 30, 26, 91, 88, 21, 96, 31, 22, 65, 79, 32, 38, 97, 20], [91, 68, 2, 42, 32, 36, 69, 28, 59, 46, 34, 14, 94, 2, 13, 60, 38, 54, 14, 30, 2, 83, 99, 20, 65, 77, 61, 1, 27, 14, 15, 26, 38, 65, 4], [94, 68, 94, 65, 13, 26, 89, 89, 27, 10, 22, 34, 32, 84, 91, 6, 97, 95, 53, 88, 53, 77, 54, 35, 61, 52, 29, 25, 88, 35, 73, 83, 95, 13, 11], [12, 14, 83, 83, 42, 39, 88, 9, 99, 11, 13, 11, 78, 75, 96, 30, 3, 76, 68, 78, 15, 98, 46, 92, 71, 64, 45, 22, 71, 80, 4, 91, 60, 66, 22], [10, 29, 19, 7, 13, 42, 4, 98, 67, 72, 47, 42, 54, 72, 3, 6, 58, 55, 12, 96, 62, 46, 83, 78, 22, 16, 98, 36, 25, 92, 67, 32, 11, 15, 2], [39, 67, 9, 76, 60, 65, 51, 86, 92, 15, 34, 71, 79, 34, 76, 71, 69, 38, 88, 26, 17, 85, 91, 85, 6, 18, 96, 7, 6, 71, 95, 49, 98, 78, 5], [89, 10, 38, 46, 2, 86, 85, 95, 58, 25, 7, 14, 61, 61, 82, 75, 78, 32, 28, 84, 74, 64, 1, 2, 99, 54, 29, 8, 67, 29, 96, 95, 76, 83, 94], [16, 74, 25, 21, 88, 17, 42, 20, 7, 10, 85, 58, 88, 82, 14, 47, 87, 59, 23, 53, 34, 50, 51, 84, 32, 98, 50, 40, 25, 31, 74, 35, 58, 43, 89], [5, 35, 15, 66, 10, 31, 80, 97, 78, 68, 70, 1, 30, 19, 73, 2, 61, 77, 37, 72, 59, 3, 97, 99, 16, 68, 24, 35, 33, 60, 28, 17, 11, 27, 92], [39, 7, 84, 66, 13, 77, 85, 75, 47, 93, 22, 38, 11, 24, 13, 88, 42, 29, 14, 23, 68, 95, 41, 30, 43, 73, 91, 16, 37, 18, 14, 51, 46, 22, 39], [23, 80, 42, 44, 50, 99, 71, 76, 57, 68, 10, 39, 4, 25, 24, 53, 15, 31, 64, 84, 50, 87, 61, 3, 34, 82, 81, 4, 59, 35, 7, 46, 32, 20, 56], [81, 91, 69, 77, 25, 97, 84, 86, 33, 18, 24, 71, 98, 70, 66, 41, 36, 92, 65, 4, 12, 25, 19, 19, 49, 30, 20, 90, 30, 67, 11, 12, 5, 27, 54], [36, 75, 39, 62, 33, 96, 58, 29, 40, 24, 58, 25, 78, 3, 30, 99, 26, 82, 62, 77, 62, 81, 14, 34, 26, 29, 13, 34, 65, 21, 99, 61, 33, 24, 12], [23, 36, 37, 10, 68, 81, 51, 93, 63, 32, 8, 2, 58, 68, 39, 59, 54, 45, 31, 52, 95, 18, 61, 50, 4, 42, 2, 48, 84, 51, 62, 36, 1, 75, 16], [51, 30, 65, 41, 21, 92, 69, 37, 82, 90, 94, 83, 58, 69, 15, 70, 76, 53, 26, 33, 68, 21, 7, 29, 57, 75, 23, 49, 54, 14, 85, 93, 45, 3, 66], [11, 77, 15, 97, 25, 31, 51, 21, 51, 45, 28, 85, 69, 24, 81, 54, 14, 30, 37, 83, 59, 40, 15, 29, 49, 61, 90, 47, 81, 46, 86, 36, 50, 69, 87], [37, 31, 92, 34, 89, 71, 27, 44, 82, 49, 16, 10, 66, 50, 66, 83, 61, 7, 16, 13, 56, 84, 87, 71, 84, 25, 92, 2, 24, 53, 44, 14, 30, 58, 51], [44, 46, 26, 61, 98, 73, 52, 50, 29, 62, 67, 4, 16, 14, 96, 64, 58, 51, 62, 45, 90, 59, 59, 76, 17, 94, 65, 69, 7, 98, 36, 79, 6, 88, 79], [31, 74, 85, 47, 10, 66, 82, 98, 24, 16, 63, 86, 6, 15, 96, 33, 45, 6, 39, 8, 23, 83, 46, 11, 35, 26, 1, 41, 10, 11, 45, 65, 49, 49, 14], [38, 49, 34, 11, 77, 96, 90, 2, 3, 18, 14, 32, 14, 86, 13, 55, 66, 86, 28, 47, 88, 40, 8, 51, 28, 76, 95, 22, 9, 70, 99, 98, 71, 78, 25], [59, 83, 92, 82, 62, 79, 88, 91, 65, 45, 82, 96, 99, 72, 63, 35, 89, 96, 93, 83, 11, 89, 33, 3, 54, 62, 71, 65, 67, 71, 69, 30, 79, 6, 16]], [[0, 31, 0, 23, 0, 0, 0, 83, 0, 47, 0], [79, 0, 0, 0, 0, 0, 0, 0, 41, 97, 0], [11, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 0, 0, 0, 0, 7, 0, 0, 0, 0], [53, 5, 0, 0, 85, 29, 0, 0, 0, 0, 0], [41, 43, 0, 0, 0, 0, 0, 0, 35, 97, 0], [0, 0, 0, 61, 11, 0, 47, 0, 0, 85, 0], [0, 0, 0, 55, 0, 0, 67, 0, 0, 0, 11], [0, 47, 0, 0, 0, 0, 71, 0, 0, 0, 0], [0, 0, 53, 67, 0, 0, 0, 0, 73, 0, 0], [0, 0, 0, 0, 17, 0, 73, 0, 0, 0, 0]], [[65]]]; int [] param1 = [25, 22, 27, 11, 14, 22, 24, 20, 10, 0]; int [] param2 = [16, 12, 20, 9, 14, 20, 19, 22, 8, 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); } " NEXT_POWER_OF_2_1,"static int f_filled ( int n ) { int p = 1 ; if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ; while ( p < n ) p <<= 1 ; return p ; }","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); } " CHECK_GIVEN_SENTENCE_GIVEN_SET_SIMPLE_GRAMMER_RULES,"static boolean f_filled ( char [ ] str ) { int len = str . length ; if ( str [ 0 ] < 'A' || str [ 0 ] > 'Z' ) return false ; if ( str [ len - 1 ] != '.' ) return false ; int prev_state = 0 , curr_state = 0 ; int index = 1 ; while ( index <= str . length ) { if ( str [ index ] >= 'A' && str [ index ] <= 'Z' ) curr_state = 0 ; else if ( str [ index ] == ' ' ) curr_state = 1 ; else if ( str [ index ] >= 'a' && str [ index ] <= 'z' ) curr_state = 2 ; else if ( str [ index ] == '.' ) curr_state = 3 ; if ( prev_state == curr_state && curr_state != 2 ) return false ; if ( prev_state == 2 && curr_state == 0 ) return false ; if ( curr_state == 3 && prev_state != 1 ) return ( index + 1 == str . length ) ; index ++ ; prev_state = curr_state ; } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, false, false, false, true, false, false, false]; char [] [] param0 = [['i', ' ', 'l', 'o', 'v', 'e', ' ', 'c', 'i', 'n', 'e', 'm', 'a', '.'], ['t', 'h', 'e', ' ', 'v', 'e', 'r', 't', 'e', 'x', ' ', 'i', 's', ' ', 's', '.'], ['i', ' ', 'a', 'm', ' ', 's', 'i', 'n', 'g', 'l', 'e', '.'], ['m', 'y', ' ', 'n', 'a', 'm', 'e', ' ', 'i', 's', ' ', 'k', 'g', '.'], ['i', ' ', 'l', 'o', 'v', 'e', ' ', 'c', 'i', 'n', 'e', 'm', 'a', '.'], ['g', 'e', 'e', 'k', 's', 'q', 'u', 'i', 'z', '.', ' ', 'i', 's', ' ', 'a', ' ', 'q', 'u', 'i', 'z', ' ', 's', 'i', 't', 'e', '.'], ['i', ' ', 'l', 'o', 'v', 'e', ' ', 'g', 'e', 'e', 'k', 's', 'q', 'u', 'i', 'z', ' ', 'a', 'n', 'd', ' ', 'g', 'e', 'e', 'k', 's', 'f', 'o', 'r', 'g', 'e', 'e', 'k', 's', '.'], [' ', ' ', 'y', 'o', 'u', ' ', 'a', 'r', 'e', ' ', 'm', 'y', ' ', 'f', 'r', 'i', 'e', 'n', 'd', '.'], ['i', ' ', 'l', 'o', 'v', 'e', ' ', 'c', 'i', 'n', 'e', 'm', 'a'], ['h', 'e', 'l', 'l', 'o', ' ', 'w', 'o', 'r', 'l', 'd', ' ', '!']]; 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,"static int f_filled ( int [ ] arr , int n ) { HashMap < Integer , Integer > map = new HashMap < > ( ) ; int max_dist = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ! map . containsKey ( arr [ i ] ) ) map . put ( arr [ i ] , i ) ; else max_dist = Math . max ( max_dist , i - map . get ( arr [ i ] ) ) ; } return max_dist ; }","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); } " CHECK_GIVEN_STRING_ROTATION_PALINDROME,"static boolean f_filled ( String str ) { int l = 0 ; int h = str . length ( ) - 1 ; while ( h > l ) if ( str . charAt ( l ++ ) != str . charAt ( h -- ) ) return false ; return true ; }","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); } " MINIMUM_OPERATIONS_MAKE_GCD_ARRAY_MULTIPLE_K,"static int f_filled ( int a [ ] , int n , int k ) { int result = 0 ; for ( int i = 0 ; i < n ; ++ i ) { if ( a [ i ] != 1 && a [ i ] > k ) { result = result + Math . min ( a [ i ] % k , k - a [ i ] % k ) ; } else { result = result + k - a [ i ] ; } } return result ; }","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); } " CHECK_IF_ALL_THE_ELEMENTS_CAN_BE_MADE_OF_SAME_PARITY_BY_INVERTING_ADJACENT_ELEMENTS,"static boolean f_filled ( int [ ] a , int n ) { int count_odd = 0 , count_even = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ( a [ i ] & 1 ) == 1 ) count_odd ++ ; else count_even ++ ; } if ( count_odd % 2 == 1 && count_even % 2 == 1 ) return false ; else return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, true, true, true, true, true, true, true]; int [] [] param0 = [[1, 1, 1, 7, 7, 8, 10, 10, 10, 14, 15, 18, 20, 23, 24, 24, 26, 30, 32, 32, 33, 36, 42, 43, 46, 48, 51, 51, 52, 53, 58, 58, 59, 59, 59, 60, 67, 71, 72, 74, 76, 77, 83, 84, 86, 90, 91], [-90, -20, -60, -64, -24, 84, -2, -32, 28, -54, 44, -96, 52, 88, 20, -56, -2], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [98, 70, 24, 18, 7, 4, 78, 19, 70, 56, 99, 54, 69, 15, 88, 20, 40, 13, 19, 56, 62], [-72, -66, -58, -20, 36, 80, 92], [0, 1], [6, 13, 14, 16, 21, 26, 26, 28, 29, 35, 38, 42, 47, 47, 62, 67, 77, 81, 81, 83, 84, 88, 90, 96, 97, 98], [-48, -8, 20, 32, -90, -42, -6, -88, -72, 42, 66, -62, 82, -4, 8, 12, -22, 82, 56, 96, -54, 92, -42, 30, -18, 14, -6, -66, 34, 16, -84, -94, 48, -48, 52, -60, -92, -16], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [45, 86, 53, 80, 27, 45, 1, 85, 91, 93, 92, 43, 75, 86, 81, 48, 21, 34, 5, 10, 88, 42, 7, 15, 96, 85, 62, 86, 52, 37]]; int [] param1 = [30, 12, 36, 19, 6, 1, 17, 35, 14, 29]; 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_DIGITS_FACTORIAL_SET_1,"static int f_filled ( int n ) { if ( n < 0 ) return 0 ; if ( n <= 1 ) return 1 ; double digits = 0 ; for ( int i = 2 ; i <= n ; i ++ ) digits += Math . log10 ( i ) ; return ( int ) ( Math . floor ( digits ) ) + 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,"static int f_filled ( int arr [ ] , int n ) { if ( n <= 0 ) return 0 ; int incl = arr [ 0 ] ; int excl = 0 ; for ( int i = 1 ; i < n ; i ++ ) { int incl_new = arr [ i ] + Math . min ( excl , incl ) ; int excl_new = incl ; incl = incl_new ; excl = excl_new ; } return Math . min ( incl , excl ) ; }","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); } " CHECK_IF_A_NUMBER_IS_JUMBLED_OR_NOT,"static boolean f_filled ( int num ) { if ( num / 10 == 0 ) return true ; while ( num != 0 ) { if ( num / 10 == 0 ) return true ; int digit1 = num % 10 ; int digit2 = ( num / 10 ) % 10 ; if ( Math . abs ( digit2 - digit1 ) > 1 ) return false ; num = num / 10 ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, true, true, false, false, true, false]; int [] param0 = [67, 77, 35, 79, 45, 22, 68, 17, 5, 85]; 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,"static boolean f_filled ( int x , int y ) { if ( x == 1 ) return ( y == 1 ) ; int pow = 1 ; while ( pow < y ) pow = pow * x ; return ( pow == y ) ; }","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); } " COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW,"static int f_filled ( int a , int b ) { return ( a + b ) / 2 ; }","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); } " CHECK_IF_A_NUMBER_IS_POWER_OF_ANOTHER_NUMBER_1,"static boolean f_filled ( int x , int y ) { int res1 = ( int ) Math . log ( y ) / ( int ) Math . log ( x ) ; double res2 = Math . log ( y ) / Math . log ( x ) ; return ( res1 == res2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, true, false, false, false, false, false, false]; int [] param0 = [57, 3, 10, 10, 6, 3, 3, 20, 96, 25]; int [] param1 = [1, 9, 101, 10000, 46656, 2048, 40, 79, 98, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_PAIRS_N_B_N_GCD_B_B,"static int f_filled ( int n ) { int k = n ; int imin = 1 ; int ans = 0 ; while ( imin <= n ) { int imax = n / k ; ans += k * ( imax - imin + 1 ) ; imin = imax + 1 ; k = n / imin ; } return ans ; }","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); } " CHECK_IF_X_CAN_GIVE_CHANGE_TO_EVERY_PERSON_IN_THE_QUEUE,"static int f_filled ( int notes [ ] , int n ) { int fiveCount = 0 ; int tenCount = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( notes [ i ] == 5 ) fiveCount ++ ; else if ( notes [ i ] == 10 ) { if ( fiveCount > 0 ) { fiveCount -- ; tenCount ++ ; } else return 0 ; } else { if ( fiveCount > 0 && tenCount > 0 ) { fiveCount -- ; tenCount -- ; } else if ( fiveCount >= 3 ) { fiveCount -= 3 ; } else return 0 ; } } return 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 0, 1, 0, 1, 0, 0, 0, 0, 0]; int [] [] param0 = [[5, 5, 5, 10, 20], [5, 5, 5, 20, 10], [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10], [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 18], [5, 5, 20], [10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [5, 10, 20, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [-82, -10, -78, -84, 68, 62, 10, 20, -86, -98, 92, 70, 40, -12, -20, -36, 8, -70, 6, 8, 44, -24, 8, -18, 76, -54, -14, -94, -68, -62, -24, -36, -74, 92, 92, -80, 48, 56, 94], [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5], [46, 46, 93, 57, 82, 34, 83, 80, 77, 36, 80, 85, 69, 28, 9, 56, 49, 27, 83, 25, 1, 80, 99, 14, 69, 82, 79, 71, 74, 34]]; int [] param1 = [4, 5, 27, 12, 2, 17, 7, 31, 25, 20]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " C_PROGRAM_FACTORIAL_NUMBER,"static int f_filled ( int n ) { if ( n == 0 ) return 1 ; return n * f_filled ( n - 1 ) ; }","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); } " CHECK_INTEGER_OVERFLOW_MULTIPLICATION,"static Boolean f_filled ( long a , long b ) { if ( a == 0 || b == 0 ) return false ; long result = a * b ; if ( a == result / b ) return false ; else return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, true, false, false, false, false, false, false, false]; long [] param0 = [37, 10000000000, 10000000000, 999999999, 39, 92, 14, 19, 14, 88]; long [] param1 = [80, -10000000000, 10000000000, 999999999, 36, 56, 21, 38, 82, 41]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_OF_WAYS_TO_COVER_A_DISTANCE_1,"static int f_filled ( int dist ) { int [ ] count = new int [ dist + 1 ] ; count [ 0 ] = 1 ; count [ 1 ] = 1 ; count [ 2 ] = 2 ; for ( int i = 3 ; i <= dist ; i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ] ; return count [ dist ] ; }","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,"static int f_filled ( int arr [ ] , int n ) { int res = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ] ; res = res ^ arr [ n - 1 ] ; return res ; }","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); } " CHECK_LARGE_NUMBER_DIVISIBLE_13_NOT,"static boolean f_filled ( String num ) { int length = num . length ( ) ; if ( length == 1 && num . charAt ( 0 ) == '0' ) return true ; if ( length % 3 == 1 ) { num += ""00"" ; length += 2 ; } else if ( length % 3 == 2 ) { num += ""0"" ; length += 1 ; } int sum = 0 , p = 1 ; for ( int i = length - 1 ; i >= 0 ; i -- ) { int group = 0 ; group += num . charAt ( i -- ) - '0' ; group += ( num . charAt ( i -- ) - '0' ) * 10 ; group += ( num . charAt ( i ) - '0' ) * 100 ; sum = sum + group * p ; p *= ( - 1 ) ; } sum = Math . abs ( sum ) ; return ( sum % 13 == 0 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, false, true, true, false, false, false, false]; string [] param0 = [""vztuaitpcplnjy"", ""33855"", ""0011110101011"", ""mmq"", ""439340517954"", ""000000000"", ""uugaurrjbjegl"", ""6406553695441"", ""011001"", ""yjfqeevginjex""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " LONGEST_REPEATED_SUBSEQUENCE_1,"static String f_filled ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= n ; j ++ ) if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; String res = """" ; int i = n , j = n ; while ( i > 0 && j > 0 ) { if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j - 1 ] + 1 ) { res = res + str . charAt ( i - 1 ) ; i -- ; j -- ; } else if ( dp [ i ] [ j ] == dp [ i - 1 ] [ j ] ) i -- ; else j -- ; } String reverse = """" ; for ( int k = res . length ( ) - 1 ; k >= 0 ; k -- ) { reverse = reverse + res . charAt ( k ) ; } return reverse ; }","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,"static boolean f_filled ( int arr1 [ ] , int arr2 [ ] , int m , int n ) { int i = 0 , j = 0 ; if ( m < n ) return false ; Arrays . sort ( arr1 ) ; Arrays . sort ( arr2 ) ; while ( i < n && j < m ) { if ( arr1 [ j ] < arr2 [ i ] ) j ++ ; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++ ; i ++ ; } else if ( arr1 [ j ] > arr2 [ i ] ) return false ; } if ( i < n ) return false ; else return true ; }","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,"static long f_filled ( int n ) { int dp [ ] [ ] = new int [ n + 1 ] [ 10 ] ; if ( n == 1 ) return 10 ; for ( int j = 0 ; j <= 9 ; j ++ ) dp [ 1 ] [ j ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= 9 ; j ++ ) { if ( j == 0 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ] ; else if ( j == 9 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] ; } } long sum = 0 ; for ( int j = 1 ; j <= 9 ; j ++ ) sum += dp [ n ] [ j ] ; return sum ; }","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,"static int f_filled ( int arr [ ] , int n , int x ) { int i ; for ( i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i ] > arr [ i + 1 ] ) break ; int l = ( i + 1 ) % n ; int r = i ; int cnt = 0 ; while ( l != r ) { if ( arr [ l ] + arr [ r ] == x ) { cnt ++ ; if ( l == ( r - 1 + n ) % n ) { return cnt ; } l = ( l + 1 ) % n ; r = ( r - 1 + n ) % n ; } else if ( arr [ l ] + arr [ r ] < x ) l = ( l + 1 ) % n ; else r = ( n + r - 1 ) % n ; } return cnt ; }","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); } " CHECK_LINE_PASSES_ORIGIN,"static boolean f_filled ( int x1 , int y1 , int x2 , int y2 ) { return ( x1 * ( y2 - y1 ) == y1 * ( x2 - x1 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, false, false, false, false, false, false]; int [] param0 = [1, 10, 0, 1, 82, 78, 13, 18, 42, 29]; int [] param1 = [28, 0, 1, 1, 86, 86, 46, 29, 35, 17]; int [] param2 = [2, 20, 0, 10, 19, 11, 33, 95, 25, 45]; int [] param3 = [56, 0, 17, 10, 4, 6, 33, 12, 36, 35]; 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); } " PROGRAM_TO_FIND_THE_VOLUME_OF_A_TRIANGULAR_PRISM,"static float f_filled ( float l , float b , float h ) { float volume = ( l * b * h ) / 2 ; return volume ; }","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); } " CHECK_NUMBER_IS_PERFECT_SQUARE_USING_ADDITIONSUBTRACTION,"static boolean f_filled ( int n ) { for ( int sum = 0 , i = 1 ; sum < n ; i += 2 ) { sum += i ; if ( sum == n ) return true ; } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, false, true, false, false, false]; int [] param0 = [1, 4, 9, 25, 36, 3, 121, 14, 17, 80]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MINIMUM_COST_CUT_BOARD_SQUARES,"static int f_filled ( Integer X [ ] , Integer Y [ ] , int m , int n ) { int res = 0 ; Arrays . sort ( X , Collections . reverseOrder ( ) ) ; Arrays . sort ( Y , Collections . reverseOrder ( ) ) ; int hzntl = 1 , vert = 1 ; int i = 0 , j = 0 ; while ( i < m && j < n ) { if ( X [ i ] > Y [ j ] ) { res += X [ i ] * vert ; hzntl ++ ; i ++ ; } else { res += Y [ j ] * hzntl ; vert ++ ; j ++ ; } } int total = 0 ; while ( i < m ) total += X [ i ++ ] ; res += total * vert ; total = 0 ; while ( j < n ) total += Y [ j ++ ] ; res += total * hzntl ; return res ; }","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_NUMBER_POWER_K_USING_BASE_CHANGING_METHOD,"static boolean f_filled ( int n , int k ) { boolean oneSeen = false ; while ( n > 0 ) { int digit = n % k ; if ( digit > 1 ) return false ; if ( digit == 1 ) { if ( oneSeen ) return false ; oneSeen = true ; } n /= k ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, false, true, false, false, false, false, false]; int [] param0 = [64, 16, 27, 81, 1, 69, 8, 31, 43, 54]; int [] param1 = [4, 2, 3, 72, 9, 17, 20, 79, 81, 89]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " CHECK_OCCURRENCES_CHARACTER_APPEAR_TOGETHER,"static boolean f_filled ( String s , char c ) { boolean oneSeen = false ; int i = 0 , n = s . length ( ) ; while ( i < n ) { if ( s . charAt ( i ) == c ) { if ( oneSeen == true ) return false ; while ( i < n && s . charAt ( i ) == c ) i ++ ; oneSeen = true ; } else i ++ ; } return true ; }","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); } " MEDIAN_OF_TWO_SORTED_ARRAYS,"static int f_filled ( int ar1 [ ] , int ar2 [ ] , int n ) { int i = 0 ; int j = 0 ; int count ; int m1 = - 1 , m2 = - 1 ; for ( count = 0 ; count <= n ; count ++ ) { if ( i == n ) { m1 = m2 ; m2 = ar2 [ 0 ] ; break ; } else if ( j == n ) { m1 = m2 ; m2 = ar1 [ 0 ] ; break ; } if ( ar1 [ i ] < ar2 [ j ] ) { m1 = m2 ; m2 = ar1 [ i ] ; i ++ ; } else { m1 = m2 ; m2 = ar2 [ j ] ; j ++ ; } } return ( m1 + m2 ) / 2 ; }","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); } " CHECK_POSSIBLE_SORT_ARRAY_CONDITIONAL_SWAPPING_ADJACENT_ALLOWED,"static boolean f_filled ( int arr [ ] , int n ) { for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( arr [ i ] > arr [ i + 1 ] ) { if ( arr [ i ] - arr [ i + 1 ] == 1 ) { int temp = arr [ i ] ; arr [ i ] = arr [ i + 1 ] ; arr [ i + 1 ] = temp ; } else return false ; } } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, false, true, true, true, false, true, false]; int [] [] param0 = [[1, 4, 12, 16, 37, 44, 47, 51, 55, 57, 57, 62, 62, 62, 64, 69, 69, 70, 72, 81, 81, 88, 89, 97], [-86, 0, 14, -16, -12, -72, 62, -34, -72, 30, 84, -60, 84, -64, 50, 74, 18, -82, -64, -64, -74, -56, 86, 84, -32, -10, 20, 4, 8, 96, 82, 26, 42], [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], [48, 66, 83, 12, 77, 98, 18, 33, 21, 16, 28, 24, 46, 43], [-92, -58, -36, -28, -6, 2, 4, 26, 48, 58, 60, 62, 62, 98], [0, 0, 0, 1, 0, 1], [22, 38, 41, 41, 42, 51, 54, 58, 68, 76, 80, 85], [84, -38, 52, -72, -24, 82, 54, 74, 0], [0, 1, 1], [63, 31, 14, 19, 77, 64, 62, 23, 22, 19, 39, 9, 79, 1, 87, 29, 58, 3, 3, 39, 1, 39, 35, 64, 64]]; int [] param1 = [15, 18, 31, 13, 10, 4, 9, 8, 2, 13]; 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); } " K_TH_DIGIT_RAISED_POWER_B,"static int f_filled ( int a , int b , int k ) { int p = ( int ) Math . pow ( a , b ) ; int count = 0 ; while ( p > 0 && count < k ) { int rem = p % 10 ; count ++ ; if ( count == k ) return rem ; p = p / 10 ; } return 0 ; }","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); } " CHECK_POSSIBLE_TRANSFORM_ONE_STRING_ANOTHER,"static boolean f_filled ( String s1 , String s2 ) { int n = s1 . length ( ) ; int m = s2 . length ( ) ; boolean dp [ ] [ ] = new boolean [ n + 1 ] [ m + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= m ; j ++ ) { dp [ i ] [ j ] = false ; } } dp [ 0 ] [ 0 ] = true ; for ( int i = 0 ; i < s1 . length ( ) ; i ++ ) { for ( int j = 0 ; j <= s2 . length ( ) ; j ++ ) { if ( dp [ i ] [ j ] ) { if ( j < s2 . length ( ) && ( Character . toUpperCase ( s1 . charAt ( i ) ) == s2 . charAt ( j ) ) ) dp [ i + 1 ] [ j + 1 ] = true ; if ( ! Character . isUpperCase ( s1 . charAt ( i ) ) ) dp [ i + 1 ] [ j ] = true ; } } } return ( dp [ n ] [ m ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, false, true, false, false, false, true, false]; string [] param0 = [""dabcd"", ""417514"", ""010000"", ""zckyguimrdyn"", ""argaju"", ""1110101101"", ""ysocosaygi"", ""204"", ""10011100000010"", ""nmaioozpmy""]; string [] param1 = [""abc"", ""9"", ""1111011010"", ""iz"", ""raj"", ""110101001"", ""arhxkyqh"", ""6986871066"", ""0"", ""wzfddkw""]; 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_OF_PAIRS_SATISFYING_THE_GIVEN_CONDITION,"static int f_filled ( int a , int b ) { String s = String . valueOf ( b ) ; int i ; for ( i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) != '9' ) break ; } int result ; if ( i == s . length ( ) ) result = a * s . length ( ) ; else result = a * ( s . length ( ) - 1 ) ; return result ; }","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); } " CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED,"static boolean f_filled ( int arr [ ] , int n ) { int temp [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) { temp [ i ] = arr [ i ] ; } Arrays . sort ( temp ) ; int front ; for ( front = 0 ; front < n ; front ++ ) { if ( temp [ front ] != arr [ front ] ) { break ; } } int back ; for ( back = n - 1 ; back >= 0 ; back -- ) { if ( temp [ back ] != arr [ back ] ) { break ; } } if ( front >= back ) { return true ; } do { front ++ ; if ( arr [ front - 1 ] < arr [ front ] ) { return false ; } } while ( front != back ) ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, true, true, false, true, false, true, false]; int [] [] param0 = [[5, 9, 9, 16, 17, 22, 32, 40, 45, 53, 57, 58, 66, 69, 76, 80, 91, 93, 94], [52, -76, -18, 86, 56], [0, 0, 1], [66, 44, 98, 44], [-96, -62, -56, -46, -44, -38, -38, -26, -22, -22, -16, -12, -6, 12, 22, 34, 36, 44, 44, 68, 70, 74, 94], [1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1], [5, 9, 11, 12, 13, 16, 19, 23, 23, 23, 25, 27, 27, 28, 31, 36, 40, 44, 48, 59, 60, 63, 66, 66, 67, 67, 69, 69, 70, 71, 73, 76, 76, 79, 86, 86, 92, 92, 93, 93], [6, 82, -88, -46, -60, 70, -54, -96, -94, 46, -52, 48, -26, -50, -92, -92, 6, -6, 42, 0, -66, -96, 66, 6, -68, -30, -54, 76, 60, 30, 72, -66, -12, -74], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [62, 54, 36, 35, 36, 91, 45, 87, 74, 49, 15, 15, 73, 77, 63, 70, 74, 65, 11, 18]]; int [] param1 = [10, 3, 1, 2, 14, 27, 34, 28, 13, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " CHECK_REVERSING_SUB_ARRAY_MAKE_ARRAY_SORTED_1,"static boolean f_filled ( int arr [ ] , int n ) { if ( n == 1 ) { return true ; } int i ; for ( i = 1 ; arr [ i - 1 ] < arr [ i ] && i < n ; i ++ ) ; if ( i == n ) { return true ; } int j = i ++ ; while ( arr [ j ] < arr [ j - 1 ] ) { if ( i > 1 && arr [ j ] < arr [ i - 2 ] ) { return false ; } j ++ ; } if ( j == n ) { return true ; } int k = j ; if ( arr [ k ] < arr [ i - 1 ] ) { return false ; } while ( k > 1 && k < n ) { if ( arr [ k ] < arr [ k - 1 ] ) { return false ; } k ++ ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, false, true, true, true, false, true, false]; int [] [] param0 = [[1, 2, 5, 4, 3], [1, 2, 4, 5, 3], [1, 1, 0, 0], [5, 99, 40, 33, 61, 4, 64, 92, 28, 27, 21, 35, 40, 79, 10, 20, 76, 87, 80, 15, 57, 39, 96, 98, 99, 72, 72, 50, 61, 39, 35, 70, 27], [-98, -92, -86, -58, -22, -12, 0, 26], [0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0], [6, 10, 27, 30, 40, 47, 49, 55, 59, 60, 68, 82, 91], [36, 56, -56, 94, 52, -82, 88, -62, 70, -94, 38, 10, -78, 66, -94, -72, 18, 96, -72, 88, -6, 48, 6, -88, 64, -96, -40, 8, 36, 36, -90, -68, -20, -76, 22, -92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 5, 42, 28, 47, 26, 88, 16, 30, 30, 36, 49, 21, 95, 99, 21, 41, 52, 57, 39, 69, 2, 42, 22, 55, 92, 64, 27, 95, 71, 19, 38, 40, 65, 7, 21, 29, 38, 13, 11, 41, 54, 38, 40, 35, 51, 88]]; int [] param1 = [5, 5, 4, 32, 6, 24, 8, 30, 31, 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); } " COUNT_NUMBER_OF_OCCURRENCES_OR_FREQUENCY_IN_A_SORTED_ARRAY,"static int f_filled ( int arr [ ] , int n , int x ) { int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( x == arr [ i ] ) res ++ ; return res ; }","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); } " CHECK_STRING_CAN_OBTAINED_ROTATING_ANOTHER_STRING_2_PLACES,"static boolean f_filled ( String str1 , String str2 ) { if ( str1 . length ( ) != str2 . length ( ) ) return false ; String clock_rot = """" ; String anticlock_rot = """" ; int len = str2 . length ( ) ; anticlock_rot = anticlock_rot + str2 . substring ( len - 2 , len ) + str2 . substring ( 0 , len - 2 ) ; clock_rot = clock_rot + str2 . substring ( 2 ) + str2 . substring ( 0 , 2 ) ; return ( str1 . equals ( clock_rot ) || str1 . equals ( anticlock_rot ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, true, false, false, false, false, false, false]; string [] param0 = [""amazon"", ""onamaz"", ""amazon"", ""ab"", ""737009"", ""000110"", ""l"", ""4420318628"", ""11011111000000"", "" pvfhanc""]; string [] param1 = [""azonam"", ""amazon"", ""azoman"", ""ab"", ""239119"", ""01111"", ""yvo hqvngxow"", ""52856"", ""10"", ""xbidfbigb""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " CHECK_STRING_FOLLOWS_ANBN_PATTERN_NOT,"static boolean f_filled ( String s ) { int l = s . length ( ) ; if ( l % 2 == 1 ) { return false ; } int i = 0 ; int j = l - 1 ; while ( i < j ) { if ( s . charAt ( i ) != 'a' || s . charAt ( j ) != 'b' ) { return false ; } i ++ ; j -- ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, false, false, false, false, false, false, false]; string [] param0 = [""ba"", ""aabb"", ""abab"", ""aaabb"", ""aabbb"", ""abaabbaa"", ""abaababb"", ""bbaa"", ""11001000"", ""zwxv te""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " LONGEST_REPEATING_SUBSEQUENCE,"static int f_filled ( String str ) { int n = str . length ( ) ; int [ ] [ ] dp = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= n ; j ++ ) { if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = Math . max ( dp [ i ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; } } return dp [ n ] [ n ] ; }","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); } " CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT,"static int f_filled ( int x1 , int y1 , int x2 , int y2 , int r1 , int r2 ) { int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ) ; int radSumSq = ( r1 + r2 ) * ( r1 + r2 ) ; if ( distSq == radSumSq ) return 1 ; else if ( distSq > radSumSq ) return - 1 ; else return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 0, -1, 0, 0, 0, 0, 0, 0, -1]; int [] param0 = [11, 87, 51, 89, 64, 57, 65, 32, 73, 3]; int [] param1 = [36, 1, 1, 67, 10, 86, 90, 23, 61, 99]; int [] param2 = [62, 62, 47, 9, 79, 99, 42, 28, 63, 6]; int [] param3 = [64, 64, 90, 52, 45, 43, 82, 26, 77, 19]; int [] param4 = [50, 54, 14, 94, 67, 83, 77, 60, 92, 21]; int [] param5 = [4, 41, 71, 21, 78, 63, 32, 45, 76, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " REMOVE_ARRAY_END_ELEMENT_MAXIMIZE_SUM_PRODUCT,"static int f_filled ( int dp [ ] [ ] , int a [ ] , int low , int high , int turn ) { if ( low == high ) { return a [ low ] * turn ; } if ( dp [ low ] [ high ] != 0 ) { return dp [ low ] [ high ] ; } dp [ low ] [ high ] = Math . max ( a [ low ] * turn + f_filled ( dp , a , low + 1 , high , turn + 1 ) , a [ high ] * turn + f_filled ( dp , a , low , high - 1 , turn + 1 ) ) ; return dp [ low ] [ high ] ; }","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" CHECK_VALID_SEQUENCE_DIVISIBLE_M_1,"static int f_filled ( int n , int index , int modulo , int M , int arr [ ] , int dp [ ] [ ] ) { modulo = ( ( modulo % M ) + M ) % M ; if ( index == n ) { if ( modulo == 0 ) { return 1 ; } return 0 ; } if ( dp [ index ] [ modulo ] != - 1 ) { return dp [ index ] [ modulo ] ; } int placeAdd = f_filled ( n , index + 1 , modulo + arr [ index ] , M , arr , dp ) ; int placeMinus = f_filled ( n , index + 1 , modulo - arr [ index ] , M , arr , dp ) ; int res = placeAdd ; dp [ index ] [ modulo ] = res ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, -80, 1, 26, 16, 1, 25, 1, 0, 47]; int [] param0 = [19, 14, 5, 8, 14, 16, 24, 7, 35, 8]; int [] param1 = [29, 17, 7, 10, 12, 21, 26, 7, 35, 5]; int [] param2 = [20, 13, 6, 10, 16, 17, 24, 7, 33, 8]; int [] param3 = [19, 17, 8, 8, 19, 18, 21, 7, 22, 6]; int [] [] param4 = [[1, 2, 2, 3, 6, 15, 16, 17, 20, 21, 27, 28, 28, 29, 44, 47, 53, 53, 54, 59, 60, 60, 66, 68, 78, 79, 80, 84, 87, 91, 92, 97], [68, -86, -98, 40, -6, -16, -98, 50, 46, -34, 74, -8, -70, -18, -58, 92, 12, 98, 34, 6, 54, 70], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [8, 8, 80, 15, 73, 51, 44, 98, 99, 59, 73, 42], [-88, -82, -78, -72, -70, -54, -32, -32, -10, -8, 8, 14, 16, 22, 26, 26, 28, 30, 34, 34, 62, 62, 76, 88], [0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1], [4, 8, 8, 16, 22, 23, 28, 32, 38, 45, 48, 50, 52, 54, 55, 64, 70, 75, 75, 76, 83, 87, 88, 89, 94, 94, 95], [-56, -66, -60, 94, 44, -92, 18, -26, -88, 46, -24, -8, -46, 78], [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], [80, 95, 34, 51, 95, 68, 55, 65, 60]]; int [] [] [] param5 = [[[4, 7, 9, 11, 16, 22, 22, 24, 31, 35, 36, 37, 44, 46, 47, 50, 52, 56, 59, 62, 62, 63, 65, 65, 67, 67, 72, 74, 74, 79, 92, 92], [6, 10, 12, 16, 17, 21, 23, 25, 25, 25, 27, 30, 32, 39, 39, 40, 46, 47, 47, 62, 78, 79, 79, 84, 86, 87, 88, 88, 90, 91, 93, 95], [2, 3, 8, 9, 12, 12, 27, 28, 32, 33, 33, 38, 39, 40, 43, 43, 46, 47, 48, 48, 56, 58, 62, 72, 77, 77, 78, 89, 93, 94, 97, 98], [2, 3, 3, 6, 12, 13, 14, 14, 17, 19, 19, 19, 20, 23, 27, 43, 48, 52, 53, 54, 60, 65, 65, 67, 67, 67, 68, 74, 75, 78, 88, 90], [1, 3, 13, 16, 21, 23, 30, 30, 35, 37, 37, 42, 43, 47, 47, 49, 50, 52, 60, 61, 67, 68, 73, 78, 78, 79, 80, 82, 83, 89, 95, 97], [2, 4, 6, 10, 11, 16, 24, 33, 34, 35, 40, 40, 47, 50, 51, 55, 62, 64, 68, 70, 70, 73, 75, 81, 85, 85, 89, 91, 92, 93, 93, 94], [3, 5, 11, 11, 15, 19, 20, 25, 26, 27, 27, 36, 37, 44, 56, 60, 64, 64, 68, 74, 76, 76, 77, 78, 80, 84, 87, 91, 92, 94, 95, 96], [2, 2, 9, 14, 16, 20, 20, 27, 28, 29, 32, 33, 35, 46, 53, 54, 55, 57, 61, 62, 63, 63, 69, 74, 84, 87, 88, 90, 93, 93, 98, 98], [4, 5, 9, 12, 14, 20, 21, 22, 25, 26, 32, 33, 33, 35, 36, 38, 45, 51, 54, 58, 60, 61, 67, 69, 70, 75, 75, 77, 80, 89, 90, 94], [2, 8, 18, 18, 20, 23, 24, 29, 31, 32, 33, 34, 35, 41, 41, 47, 48, 49, 52, 55, 61, 65, 65, 66, 69, 69, 76, 85, 89, 91, 94, 94], [6, 10, 12, 14, 14, 32, 32, 34, 35, 39, 39, 44, 44, 50, 52, 52, 54, 56, 58, 60, 60, 62, 65, 69, 69, 71, 77, 83, 83, 86, 92, 92], [2, 8, 15, 19, 21, 27, 32, 41, 46, 47, 48, 49, 51, 51, 63, 65, 67, 72, 73, 76, 77, 77, 82, 82, 83, 85, 87, 88, 91, 92, 94, 98], [6, 7, 13, 14, 14, 14, 15, 21, 23, 29, 30, 30, 37, 44, 45, 45, 48, 48, 57, 67, 67, 68, 70, 71, 71, 72, 78, 86, 86, 91, 97, 99], [4, 5, 12, 12, 13, 14, 14, 16, 18, 20, 21, 24, 24, 25, 25, 26, 33, 40, 47, 49, 51, 61, 64, 64, 68, 74, 81, 83, 83, 87, 89, 94], [3, 8, 9, 14, 16, 17, 30, 33, 39, 40, 40, 43, 45, 46, 47, 49, 51, 54, 55, 56, 59, 60, 63, 79, 79, 83, 94, 94, 95, 98, 99, 99], [4, 6, 7, 9, 9, 10, 16, 17, 18, 21, 30, 33, 36, 37, 37, 39, 42, 53, 57, 66, 69, 70, 73, 77, 81, 82, 82, 84, 87, 88, 92, 99], [2, 2, 5, 6, 6, 7, 12, 13, 13, 17, 22, 24, 24, 27, 27, 29, 35, 36, 39, 39, 43, 44, 45, 64, 71, 72, 73, 82, 82, 85, 93, 98], [1, 5, 8, 9, 12, 13, 22, 29, 30, 31, 36, 36, 40, 40, 41, 42, 52, 55, 57, 58, 61, 61, 61, 65, 76, 78, 82, 86, 86, 89, 94, 96], [1, 3, 3, 5, 9, 10, 19, 19, 20, 24, 34, 40, 42, 42, 46, 46, 48, 53, 53, 58, 64, 68, 72, 73, 81, 86, 88, 89, 90, 92, 93, 95], [1, 1, 5, 5, 15, 19, 22, 23, 27, 29, 33, 41, 44, 44, 48, 51, 56, 56, 71, 77, 79, 79, 82, 82, 84, 86, 87, 90, 90, 91, 93, 98], [2, 4, 8, 13, 14, 22, 23, 27, 28, 29, 37, 37, 38, 41, 47, 47, 48, 50, 51, 53, 54, 55, 57, 63, 65, 69, 75, 77, 77, 79, 82, 97], [4, 9, 10, 18, 20, 23, 24, 27, 39, 40, 41, 41, 42, 43, 45, 58, 58, 64, 66, 67, 68, 69, 74, 81, 83, 83, 84, 84, 86, 87, 90, 98], [1, 8, 9, 11, 15, 15, 18, 24, 25, 31, 31, 33, 34, 35, 35, 43, 47, 52, 56, 58, 58, 67, 69, 70, 71, 74, 77, 82, 85, 89, 89, 90], [1, 3, 8, 8, 12, 12, 16, 21, 22, 25, 25, 25, 29, 31, 31, 31, 34, 34, 35, 35, 36, 37, 37, 42, 43, 55, 55, 59, 67, 72, 74, 85], [2, 4, 6, 9, 12, 14, 18, 22, 23, 23, 26, 36, 36, 41, 44, 51, 51, 53, 56, 59, 59, 59, 60, 61, 68, 68, 74, 77, 93, 94, 94, 96], [1, 2, 5, 11, 12, 14, 19, 28, 33, 34, 37, 37, 38, 38, 38, 47, 49, 59, 62, 67, 71, 73, 73, 74, 80, 83, 84, 85, 89, 90, 92, 99], [1, 5, 10, 19, 24, 36, 41, 47, 48, 57, 59, 59, 60, 62, 65, 65, 67, 70, 71, 77, 79, 79, 81, 81, 82, 83, 87, 89, 91, 91, 95, 97], [7, 10, 10, 10, 17, 18, 29, 29, 30, 31, 32, 32, 37, 38, 44, 50, 59, 59, 62, 63, 63, 73, 74, 80, 80, 81, 84, 85, 85, 89, 98, 99], [1, 7, 9, 14, 19, 22, 26, 29, 30, 34, 40, 43, 44, 45, 45, 46, 49, 58, 62, 63, 67, 76, 78, 79, 82, 84, 93, 94, 95, 97, 98, 98], [5, 6, 8, 9, 12, 14, 22, 31, 34, 36, 38, 43, 46, 47, 48, 48, 50, 52, 54, 57, 67, 68, 68, 72, 75, 77, 79, 80, 92, 96, 97, 98], [8, 10, 15, 15, 15, 19, 21, 24, 25, 27, 30, 34, 36, 43, 44, 45, 50, 51, 54, 55, 57, 58, 59, 63, 69, 69, 73, 75, 87, 94, 96, 96], [3, 4, 12, 13, 13, 16, 16, 19, 29, 32, 40, 43, 48, 49, 55, 58, 61, 64, 65, 66, 66, 69, 71, 72, 75, 83, 85, 88, 89, 90, 94, 96]], [[-30, 10, -22, 92, -46, 58, -12, -42, 64, 12, 6, 12, -34, -20, 6, -90, -60, 78, 90, -72, -30, 2], [-72, -60, 22, -22, -12, 6, 80, -34, 8, -66, 20, -72, -34, -30, 14, -54, 86, 96, -20, -76, 34, -64], [52, 8, 28, -74, 78, -92, -78, 6, 56, -76, 98, 4, -46, 80, 36, 54, -70, 68, -88, 68, -84, -94], [94, 84, 60, 44, -46, -44, 94, 60, 14, 76, 82, 84, 56, 68, 54, 46, -42, 16, -46, 32, -76, -6], [-8, -88, 70, -48, 62, 4, 70, -62, 34, -48, 48, -82, -16, 60, 14, -10, -56, 4, -22, -96, 44, 22], [-34, -70, -16, -94, -22, 2, -20, 10, -42, 52, 18, -74, -84, -56, 72, -24, 64, -90, 68, -90, 60, -70], [28, -86, -52, -58, -2, -96, 32, -90, 88, 98, -66, 78, -44, -6, -44, 46, -16, -76, 48, -20, -68, -70], [-88, -88, -16, 24, -96, -32, 20, -92, -50, 40, 26, 12, -76, 50, -90, -96, 6, 8, -56, 74, 30, -46], [40, -74, -18, -36, -50, 82, -72, -74, -38, 16, 86, 56, 58, 80, 74, 4, -16, -14, -78, 36, -8, -16], [-44, -18, -14, 94, -4, -98, -4, -32, -84, -54, 38, 78, -74, 62, 76, 30, 22, 24, 34, 42, 94, -84], [60, -26, -12, 14, -26, 42, 60, 12, 74, -26, 66, 60, 32, 32, -70, 22, 50, 84, -14, -2, 62, 50], [-38, -28, -8, 62, 10, 18, -78, -68, 70, 88, -4, 24, 88, -32, 44, -46, 58, -90, 18, -32, 42, 32], [2, -14, 62, 84, -18, 76, -94, -66, -64, -58, -54, 40, 74, 32, -78, -46, 44, -16, -40, 32, -66, -82], [-46, 26, 92, 96, -34, -88, -84, 82, 20, -12, 62, 92, 32, 66, 38, 66, 38, -50, 68, -56, -44, 72], [-30, -40, -56, 46, 36, 12, -58, -36, -36, 66, -80, -24, 34, -96, 0, -46, -38, 88, 36, 92, -74, -40], [-10, -54, 96, -58, 80, -64, -88, 60, 24, 14, -58, 30, 74, 64, 66, 96, -66, 86, 66, 76, -90, -28], [34, 6, 60, 62, -10, -34, 58, -38, 92, -28, -88, -36, 84, 94, 2, 36, 22, -38, 66, 36, 36, 22], [92, 64, 64, -8, 14, 88, -64, 34, -26, 44, 44, 10, -2, -80, -50, -90, 70, 36, -50, 32, 18, 72], [26, 52, -88, -72, -52, 78, 64, -34, -96, -68, 76, -50, -28, -84, 22, 16, 40, 84, -16, 80, -48, 38], [16, -94, -74, 30, -82, 24, 38, 8, -68, 26, -96, -36, 90, 56, 20, 24, -42, -76, -20, 24, 76, 10], [74, 56, -46, 84, -84, 80, -26, 90, -42, 22, 78, 26, 56, -12, 62, -12, -30, -20, -52, 42, 52, -56], [34, -86, -18, -60, -64, 60, -98, 78, 34, -40, 10, -36, 48, 98, 94, 38, -32, 46, -52, 34, -74, 60]], [[0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1]], [[89, 45, 59, 5, 12, 1, 54, 1, 25, 40, 25, 45], [94, 83, 22, 94, 13, 16, 98, 46, 37, 94, 99, 59], [7, 92, 73, 68, 63, 10, 45, 75, 56, 77, 66, 79], [37, 91, 18, 45, 35, 35, 66, 75, 82, 14, 88, 88], [16, 44, 53, 11, 41, 41, 44, 53, 19, 11, 3, 99], [80, 89, 67, 90, 58, 65, 9, 15, 76, 4, 43, 8], [39, 51, 95, 87, 68, 88, 84, 27, 15, 77, 95, 84], [54, 67, 79, 17, 81, 4, 18, 10, 37, 96, 15, 42], [19, 49, 6, 4, 37, 50, 43, 83, 89, 44, 74, 21], [75, 19, 30, 32, 20, 67, 1, 85, 3, 31, 76, 78], [94, 25, 26, 97, 28, 74, 96, 81, 36, 33, 21, 25], [19, 72, 42, 88, 41, 20, 1, 18, 92, 5, 82, 18]], [[-96, -74, -68, -56, -40, -26, -22, -18, -6, -2, 6, 6, 18, 18, 20, 22, 26, 30, 32, 40, 52, 52, 70, 70], [-96, -92, -90, -90, -72, -70, -64, -52, -50, -44, -40, -32, -30, -28, -24, -18, -16, -4, 14, 18, 28, 36, 50, 70], [-96, -62, -60, -54, -52, -40, -36, -2, 6, 6, 6, 8, 12, 14, 18, 34, 36, 44, 62, 66, 66, 78, 86, 88], [-90, -78, -64, -58, -56, -50, -40, -32, -32, -12, 0, 0, 16, 18, 26, 28, 30, 38, 40, 44, 48, 72, 84, 98], [-88, -46, -34, 0, 10, 12, 16, 20, 26, 38, 48, 48, 50, 60, 60, 62, 66, 72, 72, 74, 84, 88, 94, 98], [-96, -94, -88, -80, -76, -66, -62, -36, -20, -16, -6, -6, -2, 0, 0, 18, 20, 24, 36, 40, 72, 76, 86, 98], [-66, -52, -44, -32, -28, -20, -6, -4, 10, 18, 22, 24, 26, 38, 40, 44, 44, 48, 48, 58, 84, 90, 94, 94], [-86, -78, -54, -52, -46, -38, -34, 14, 24, 26, 34, 34, 40, 46, 50, 50, 62, 72, 72, 82, 84, 86, 92, 94], [-98, -84, -70, -68, -66, -60, -28, -10, 4, 10, 16, 34, 34, 44, 46, 48, 52, 56, 56, 56, 60, 84, 84, 88], [-96, -92, -82, -80, -76, -54, -52, -46, -46, -30, -26, -26, -20, -16, -10, -10, -4, 26, 30, 32, 34, 78, 78, 86], [-92, -90, -76, -64, -50, -48, -46, -42, -36, -30, -24, -20, -14, -4, 12, 16, 22, 30, 40, 40, 48, 60, 86, 92], [-86, -82, -72, -46, -46, -42, -34, -34, -22, -20, -20, -14, -10, -2, -2, 28, 50, 50, 52, 58, 78, 80, 84, 94], [-92, -90, -74, -64, -64, -56, -52, -50, -46, -46, -32, -26, -22, -4, -2, 10, 16, 32, 34, 38, 58, 58, 60, 86], [-94, -88, -66, -58, -56, -50, -42, -30, -28, -24, -22, -12, -10, -8, 0, 16, 24, 26, 30, 38, 44, 52, 80, 98], [-98, -82, -74, -64, -60, -52, -48, -38, -36, -24, -20, -20, -18, 26, 26, 36, 44, 44, 50, 50, 54, 78, 80, 96], [-84, -68, -66, -62, -60, -52, -50, -40, -36, -28, -8, -6, 2, 18, 26, 32, 42, 50, 62, 66, 68, 72, 80, 98], [-92, -90, -82, -72, -72, -58, -54, -40, -38, -34, -28, -22, -6, -6, 0, 0, 2, 6, 18, 44, 68, 70, 72, 74], [-92, -64, -64, -60, -58, -52, -50, -12, -8, -8, -4, -2, 14, 14, 16, 18, 22, 28, 38, 38, 42, 66, 90, 90], [-72, -70, -68, -56, -42, -40, -38, -32, -32, -22, -20, -20, -10, -10, 0, 24, 24, 34, 72, 80, 88, 92, 94, 96], [-84, -80, -58, -38, -32, -30, -16, -14, 4, 10, 10, 14, 18, 20, 24, 26, 30, 34, 36, 40, 58, 70, 72, 92], [-88, -78, -68, -66, -50, -42, -36, -36, -18, -14, -10, -6, -6, -2, 2, 6, 16, 18, 40, 68, 72, 76, 86, 94], [-82, -70, -64, -56, -52, -32, -10, -4, 8, 16, 28, 40, 46, 56, 56, 58, 66, 68, 70, 74, 76, 80, 80, 86], [-98, -90, -80, -78, -76, -74, -72, -64, -62, -42, -30, -14, -8, 2, 12, 24, 42, 44, 72, 74, 76, 94, 94, 98], [-94, -90, -86, -82, -58, -50, -44, -20, -18, 0, 18, 26, 36, 38, 44, 50, 52, 54, 56, 64, 68, 78, 82, 86]], [[0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0], [0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0], [0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0], [0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1], [1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1], [1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0], [0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1], [1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1], [0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1], [0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0], [0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0], [1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1], [1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1], [1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1], [0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1], [0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1], [0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1], [1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0]], [[1, 3, 5, 8, 8, 16, 16, 18, 19, 26, 28, 33, 33, 35, 35, 41, 42, 43, 47, 51, 65, 66, 73, 84, 87, 95, 99], [1, 3, 3, 21, 26, 29, 31, 40, 40, 43, 51, 53, 54, 62, 62, 65, 74, 75, 77, 77, 79, 81, 81, 84, 84, 92, 95], [7, 9, 10, 12, 13, 14, 19, 27, 30, 44, 46, 47, 51, 53, 58, 59, 65, 73, 78, 84, 84, 86, 88, 91, 92, 98, 99], [5, 15, 15, 21, 24, 25, 31, 34, 47, 53, 53, 58, 60, 60, 69, 74, 75, 75, 76, 78, 79, 81, 86, 87, 88, 91, 97], [5, 16, 19, 20, 22, 25, 32, 37, 37, 40, 43, 46, 50, 55, 56, 58, 59, 60, 61, 64, 67, 72, 85, 88, 91, 91, 96], [5, 6, 10, 14, 16, 19, 22, 25, 26, 31, 38, 41, 43, 45, 52, 56, 59, 66, 69, 78, 82, 87, 87, 88, 89, 92, 99], [3, 11, 15, 18, 22, 25, 31, 37, 37, 38, 38, 44, 47, 50, 51, 52, 68, 70, 78, 81, 83, 84, 89, 90, 95, 95, 98], [3, 6, 8, 10, 13, 21, 22, 22, 22, 22, 23, 26, 33, 42, 49, 49, 50, 66, 72, 73, 75, 78, 83, 84, 92, 93, 99], [8, 10, 11, 16, 17, 26, 32, 45, 52, 53, 53, 63, 64, 65, 69, 71, 72, 72, 74, 77, 81, 82, 87, 94, 96, 96, 96], [3, 4, 8, 11, 21, 25, 26, 31, 33, 35, 35, 38, 42, 43, 48, 50, 50, 61, 62, 63, 67, 67, 70, 79, 80, 84, 97], [2, 14, 15, 16, 21, 30, 30, 32, 32, 40, 41, 41, 42, 45, 45, 46, 46, 52, 61, 63, 78, 79, 80, 81, 86, 93, 97], [4, 5, 5, 6, 7, 16, 16, 18, 20, 22, 23, 28, 30, 35, 38, 43, 63, 67, 72, 77, 82, 85, 85, 87, 87, 91, 92], [4, 8, 10, 11, 27, 30, 31, 39, 47, 49, 52, 62, 67, 69, 71, 71, 72, 75, 79, 79, 80, 84, 84, 87, 95, 95, 99], [16, 17, 21, 24, 26, 32, 43, 43, 46, 49, 53, 56, 64, 72, 81, 82, 85, 85, 90, 90, 92, 92, 93, 95, 95, 97, 99], [4, 4, 6, 12, 12, 13, 16, 26, 31, 31, 35, 40, 40, 50, 51, 54, 56, 57, 60, 62, 64, 64, 86, 90, 91, 99, 99], [13, 13, 16, 17, 18, 20, 21, 21, 23, 24, 25, 25, 27, 32, 33, 34, 45, 45, 64, 76, 77, 78, 78, 83, 88, 90, 97], [2, 4, 5, 6, 6, 11, 17, 18, 35, 36, 42, 52, 52, 54, 55, 57, 58, 70, 70, 72, 81, 86, 87, 87, 89, 97, 99], [2, 5, 5, 10, 10, 13, 25, 27, 29, 29, 29, 30, 42, 48, 48, 52, 56, 57, 62, 64, 65, 66, 68, 76, 85, 89, 91], [7, 15, 27, 32, 40, 44, 49, 49, 63, 65, 67, 69, 70, 70, 71, 71, 73, 74, 80, 84, 84, 85, 88, 89, 92, 95, 97], [4, 9, 10, 14, 27, 30, 30, 36, 37, 38, 39, 41, 44, 45, 46, 50, 52, 60, 62, 63, 68, 76, 77, 81, 82, 88, 94], [5, 6, 9, 10, 11, 19, 24, 26, 30, 31, 34, 46, 47, 54, 56, 56, 59, 62, 66, 71, 79, 87, 89, 90, 92, 99, 99], [3, 5, 6, 6, 15, 21, 23, 28, 32, 50, 50, 56, 65, 66, 75, 76, 82, 85, 85, 87, 88, 90, 93, 94, 97, 97, 99], [10, 13, 13, 15, 16, 19, 21, 26, 30, 51, 55, 59, 60, 61, 63, 66, 67, 77, 77, 83, 87, 89, 89, 90, 92, 97, 99], [8, 10, 10, 11, 12, 13, 16, 25, 31, 33, 34, 36, 36, 44, 48, 58, 62, 67, 73, 75, 76, 80, 84, 89, 91, 96, 98], [10, 12, 22, 25, 28, 29, 40, 41, 42, 47, 48, 50, 55, 58, 62, 72, 72, 72, 76, 79, 81, 82, 85, 94, 95, 98, 99], [4, 5, 6, 7, 9, 15, 22, 23, 26, 27, 31, 33, 34, 37, 47, 52, 52, 54, 54, 56, 63, 72, 84, 91, 92, 99, 99], [17, 18, 22, 25, 31, 36, 36, 36, 36, 37, 42, 45, 46, 51, 51, 62, 68, 73, 83, 87, 88, 90, 91, 92, 95, 96, 97]], [[32, -72, -76, -6, 4, -42, -82, -6, -52, 24, 88, 8, 78, 82], [-20, 18, -68, 48, -64, 40, -26, 22, 80, -52, -98, -28, -6, -76], [-68, 20, -52, -90, -78, 96, -20, 56, -28, -88, -80, 60, 30, 38], [-12, 58, 48, 58, -78, 14, -36, 82, -66, -52, 36, -26, 90, -90], [-76, 24, -46, -2, -76, -62, -50, -64, 72, -52, -62, 84, -20, 12], [-66, -8, 40, 20, -56, -42, 90, 32, 40, -8, -28, 78, 76, -78], [-82, 38, 28, -26, -72, -96, -60, -66, 28, 94, 10, -30, 24, -90], [66, -14, 24, 80, -38, -4, 52, -94, -40, 26, 6, 58, 40, -74], [72, 78, 62, -40, -30, -4, -82, 66, -32, 6, -72, 0, 56, 42], [74, 62, 16, -4, 36, -38, -30, -18, 32, -76, 12, -52, 40, 98], [-88, 52, -10, 96, 12, 68, -12, 86, 4, -84, -54, -90, 92, 54], [68, 44, -30, -90, 52, -96, -44, 48, -80, 2, 12, 24, 58, -74], [-78, -24, 86, 14, -76, 46, 82, 14, 6, -10, 56, -70, 20, 80], [80, 38, 10, -76, -82, 26, 32, 74, 6, 76, 14, 88, 24, 90]], [[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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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]], [[32, 76, 68, 57, 32, 74, 11, 94, 55], [53, 76, 86, 95, 82, 62, 51, 37, 84], [73, 35, 43, 64, 94, 53, 79, 61, 20], [25, 5, 34, 35, 84, 44, 76, 20, 21], [18, 60, 47, 2, 26, 24, 80, 29, 63], [76, 15, 47, 88, 50, 90, 57, 10, 14], [84, 17, 77, 25, 28, 1, 6, 19, 15], [22, 10, 30, 53, 32, 83, 28, 49, 62], [73, 75, 57, 84, 1, 93, 80, 44, 55]]]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X_2,"static int f_filled ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) { int count = 0 ; int l = 0 , r = n - 1 ; while ( l < m && r >= 0 ) { if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) { l ++ ; r -- ; count ++ ; } else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++ ; else r -- ; } return count ; }","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); } " CHECK_WHETHER_ARITHMETIC_PROGRESSION_CAN_FORMED_GIVEN_ARRAY,"static boolean f_filled ( int arr [ ] , int n ) { if ( n == 1 ) return true ; Arrays . sort ( arr ) ; int d = arr [ 1 ] - arr [ 0 ] ; for ( int i = 2 ; i < n ; i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, true, true, true, false, false, false, false, false]; int [] [] param0 = [[1, 4, 16, 64], [0, 4, 8, 12], [-2, 0, 2, 4, 6], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [46, 56, 66, 76, 86], [46, 56, 56, 66, 76, 86], [7, 9, 11, 21, 44, 45, 61, 67, 78, 97, 98, 99], [-96, -84, -74, -70, -68, -62, -50, -50, -38, -36, -36, -36, -34, -34, -28, -28, -26, -18, -12, -4, -4, -2, -2, 6, 6, 14, 24, 34, 36, 44, 50, 54, 54, 62, 64, 66, 70, 74, 74, 78, 84, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 3, 5, 11, 14, 15, 15, 17, 18, 19, 20, 20, 22, 32, 33, 35, 36, 37, 39, 44, 45, 46, 51, 54, 57, 58, 61, 61, 63, 64, 67, 69, 70, 70, 79, 82, 86, 89, 92, 93, 95, 99]]; int [] param1 = [4, 4, 5, 7, 5, 6, 11, 33, 33, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FORM_MINIMUM_NUMBER_FROM_GIVEN_SEQUENCE_1,"static String f_filled ( String seq ) { int n = seq . length ( ) ; if ( n >= 9 ) return ""-1"" ; char result [ ] = new char [ n + 1 ] ; int count = 1 ; for ( int i = 0 ; i <= n ; i ++ ) { if ( i == n || seq . charAt ( i ) == 'I' ) { for ( int j = i - 1 ; j >= - 1 ; j -- ) { result [ j + 1 ] = ( char ) ( ( int ) '0' + count ++ ) ; if ( j >= 0 && seq . charAt ( j ) == 'I' ) break ; } } } return new String ( result ) ; }","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); } " CHECK_WHETHER_GIVEN_DEGREES_VERTICES_REPRESENT_GRAPH_TREE,"static boolean f_filled ( int degree [ ] , int n ) { int deg_sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { deg_sum += degree [ i ] ; } return ( 2 * ( n - 1 ) == deg_sum ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, true, true, false, false, false, false, false]; int [] [] param0 = [[2, 3, 1, 1, 1], [2, 2, 1, 1, 2], [2, 2, 1, 1, 1], [0, 0, 0, 3, 3, 4], [-10, 12, 2], [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0], [1, 6, 10, 13, 15, 17, 18, 23, 26, 28, 30, 32, 32, 33, 36, 39, 39, 41, 43, 50, 50, 51, 53, 54, 59, 59, 63, 63, 63, 66, 66, 71, 71, 74, 78, 89, 89, 93], [66, -96, -14, 74, -20], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [97, 73, 87, 45, 64, 30, 53, 50, 62, 42, 28, 58, 31, 90]]; int [] param1 = [5, 5, 5, 6, 3, 19, 30, 4, 31, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_POSSIBLE_WAYS_TO_CONSTRUCT_BUILDINGS,"static int f_filled ( int N ) { if ( N == 1 ) return 4 ; int countB = 1 , countS = 1 , prev_countB , prev_countS ; for ( int i = 2 ; i <= N ; i ++ ) { prev_countB = countB ; prev_countS = countS ; countS = prev_countB + prev_countS ; countB = prev_countS ; } int result = countS + countB ; return ( result * result ) ; }","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); } " CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD,"static boolean f_filled ( int n ) { return ( n % 2 == 0 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, true, false, true, true, true, false, false]; int [] param0 = [67, 90, 55, 90, 83, 32, 58, 38, 87, 87]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " CHECK_WHETHER_GIVEN_NUMBER_EVEN_ODD_1,"static boolean f_filled ( int n ) { if ( ( n & 1 ) == 0 ) return true ; else return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, true, false, false, false, true, true, true]; int [] param0 = [57, 73, 79, 36, 71, 23, 41, 66, 46, 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); } " HOW_TO_PRINT_MAXIMUM_NUMBER_OF_A_USING_GIVEN_FOUR_KEYS,"static int f_filled ( int N ) { if ( N <= 6 ) return N ; int [ ] screen = new int [ N ] ; int b ; int n ; for ( n = 1 ; n <= 6 ; n ++ ) screen [ n - 1 ] = n ; for ( n = 7 ; n <= N ; n ++ ) { screen [ n - 1 ] = Math . max ( 2 * screen [ n - 4 ] , Math . max ( 3 * screen [ n - 5 ] , 4 * screen [ n - 6 ] ) ) ; } return screen [ N - 1 ] ; }","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_WHETHER_NUMBER_DUCK_NUMBER_NOT,"static int f_filled ( String num ) { int len = num . length ( ) ; int count_zero = 0 ; char ch ; for ( int i = 1 ; i < len ; i ++ ) { ch = num . charAt ( i ) ; if ( ch == '0' ) count_zero ++ ; } return count_zero ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 8, 0, 2, 5, 0, 0, 1, 0]; string [] param0 = [""hllqwsphzcic"", ""080287724"", ""0000100000"", "" q"", ""4247040983"", ""00001011101"", ""lbnsnythmlbcf"", ""24"", ""110"", ""ie""]; 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_LARGEST_PRIME_FACTOR_NUMBER,"static long f_filled ( long n ) { long maxPrime = - 1 ; while ( n % 2 == 0 ) { maxPrime = 2 ; n >>= 1 ; } for ( int i = 3 ; i <= Math . sqrt ( n ) ; i += 2 ) { while ( n % i == 0 ) { maxPrime = i ; n = n / i ; } } if ( n > 2 ) maxPrime = n ; return maxPrime ; }","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_WHETHER_TRIANGLE_VALID_NOT_SIDES_GIVEN,"static int f_filled ( int a , int b , int c ) { if ( a + b <= c || a + c <= b || b + c <= a ) return 0 ; else return 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 1, 0, 1, 0, 0, 0]; int [] param0 = [29, 83, 48, 59, 56, 68, 63, 95, 2, 11]; int [] param1 = [19, 34, 14, 12, 39, 85, 36, 34, 90, 16]; int [] param2 = [52, 49, 65, 94, 22, 9, 41, 37, 27, 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); } " CHECK_WHETHER_TWO_STRINGS_ARE_ANAGRAM_OF_EACH_OTHER,"static boolean f_filled ( char [ ] str1 , char [ ] str2 ) { int n1 = str1 . length ; int n2 = str2 . length ; if ( n1 != n2 ) return false ; Arrays . sort ( str1 ) ; Arrays . sort ( str2 ) ; for ( int i = 0 ; i < n1 ; i ++ ) if ( str1 [ i ] != str2 [ i ] ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, true, false, false, false, false, false, false]; char [] [] param0 = [['l', 'i', 's', 't', 'e', 'n'], ['t', 'r', 'i', 'a', 'n', 'g', 'l', 'e'], ['t', 'e', 's', 't'], ['n', 'i', 'g', 'h', 't'], ['i', 'n', 'c', 'h'], ['d', 'u', 's', 't', 'y'], ['g', 'j', 'l', 'm', 'o', 'o', 's', 't', 't', 'x', 'a', 'a', 'b', 'c', 'e', 'e', 'f', 'g', 'l', 'l', 'p', 'w', 'z'], ['4', '1', '6', '5', '8', '6', '9', '9', '1', '2', '2', '7', '7', '2', '7', '4', '3', '3', '3', '0'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['e', 'r', 'i', 'o', 'p', 'y', 'd', 'q', 'g', 't', 's', 'z', ' ', 'b', 'v', 'c', 'w']]; char [] [] param1 = [['s', 'i', 'l', 'e', 'n', 't'], ['i', 'n', 't', 'e', 'g', 'r', 'a', 'l'], ['t', 't', 'e', 'w'], ['t', 'h', 'i', 'n', 'g'], ['s', 't', 'u', 'd', 'y'], ['1'], ['e', 'j', 'r', 'x', 'y', 'a', 'j', 'o', 'y'], ['9', '9', '3', '1', '0', '2', '0'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['g', 'l', 'a', 'j', 'z', 'e']]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " CHOCOLATE_DISTRIBUTION_PROBLEM,"static int f_filled ( int arr [ ] , int n , int m ) { if ( m == 0 || n == 0 ) return 0 ; Arrays . sort ( arr ) ; if ( n < m ) return - 1 ; int min_diff = Integer . MAX_VALUE ; int first = 0 , last = 0 ; for ( int i = 0 ; i + m - 1 < n ; i ++ ) { int diff = arr [ i + m - 1 ] - arr [ i ] ; if ( diff < min_diff ) { min_diff = diff ; first = i ; last = i + m - 1 ; } } return ( arr [ last ] - arr [ first ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [60, 178, 1, 43, 60, 1, 52, 90, 0, 35]; int [] [] param0 = [[2, 5, 11, 23, 33, 35, 39, 51, 52, 56, 74, 76, 76, 79, 85, 88, 93, 98], [-94, -94, -88, -84, -74, -70, -56, -50, -48, -42, -34, -24, -18, -14, 0, 4, 4, 16, 16, 30, 36, 42, 52, 56, 72, 74, 76, 84, 88], [0, 0, 1, 1, 1, 1], [3, 4, 5, 5, 12, 16, 16, 16, 18, 29, 37, 38, 40, 43, 44, 49, 57, 60, 62, 63, 67, 69, 73, 74, 75, 76, 78, 84, 85, 86, 88, 89, 92], [-98, -80, -50, -44, -42, -36, -36, -28, -10, -8, -4, -2, 2, 10, 18, 18, 26, 32, 36, 56, 80, 86, 88, 90], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [13, 15, 62, 65, 87], [-92, -88, -88, -80, -76, -62, -60, -60, -50, -48, -36, -36, -32, -26, -14, -8, 4, 18, 18, 22, 28, 30, 30, 32, 48, 48, 58, 60, 64, 72, 78, 82, 94], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [17, 23, 25, 38, 40, 53, 58, 73, 77]]; int [] param1 = [18, 29, 6, 33, 24, 16, 5, 33, 11, 9]; int [] param2 = [13, 28, 5, 18, 12, 14, 4, 17, 6, 6]; 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,"static int f_filled ( int [ ] arr , int n ) { Arrays . sort ( arr ) ; return arr [ n - 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); } " CIRCLE_LATTICE_POINTS,"static int f_filled ( int r ) { if ( r <= 0 ) return 0 ; int result = 4 ; for ( int x = 1 ; x < r ; x ++ ) { int ySquare = r * r - x * x ; int y = ( int ) Math . sqrt ( ySquare ) ; if ( y * y == ySquare ) result += 4 ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [12, 4, 12, 4, 4, 4, 4, 4, 4, 20]; int [] param0 = [34, 56, 90, 47, 36, 63, 21, 76, 18, 75]; 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_SUBARRAYS_EQUAL_NUMBER_1S_0S_1,"static int f_filled ( int [ ] arr , int n ) { Map < Integer , Integer > myMap = new HashMap < > ( ) ; int sum = 0 ; int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) arr [ i ] = - 1 ; sum += arr [ i ] ; if ( sum == 0 ) count ++ ; if ( myMap . containsKey ( sum ) ) count += myMap . get ( sum ) ; if ( ! myMap . containsKey ( sum ) ) myMap . put ( sum , 1 ) ; else myMap . put ( sum , myMap . get ( sum ) + 1 ) ; } return count ; }","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); } " COIN_GAME_WINNER_EVERY_PLAYER_THREE_CHOICES,"static boolean f_filled ( int x , int y , int n ) { boolean [ ] dp = new boolean [ n + 1 ] ; Arrays . fill ( dp , false ) ; dp [ 0 ] = false ; dp [ 1 ] = true ; for ( int i = 2 ; i <= n ; i ++ ) { if ( i - 1 >= 0 && dp [ i - 1 ] == false ) dp [ i ] = true ; else if ( i - x >= 0 && dp [ i - x ] == false ) dp [ i ] = true ; else if ( i - y >= 0 && dp [ i - y ] == false ) dp [ i ] = true ; else dp [ i ] = false ; } return dp [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, true, false, true, true, false, true, true]; int [] param0 = [6, 32, 99, 22, 26, 67, 69, 39, 7, 91]; int [] param1 = [27, 88, 18, 1, 78, 51, 57, 8, 82, 56]; int [] param2 = [51, 69, 48, 74, 95, 27, 91, 9, 41, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DYNAMIC_PROGRAMMING_SET_36_CUT_A_ROPE_TO_MAXIMIZE_PRODUCT_1,"static int f_filled ( int n ) { if ( n == 2 || n == 3 ) return ( n - 1 ) ; int res = 1 ; while ( n > 4 ) { n -= 3 ; res *= 3 ; } return ( n * res ) ; }","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); } " COMPOSITE_NUMBER,"static boolean f_filled ( int n ) { if ( n <= 1 ) System . out . println ( ""False"" ) ; if ( n <= 3 ) System . out . println ( ""False"" ) ; if ( n % 2 == 0 || n % 3 == 0 ) return true ; for ( int i = 5 ; i * i <= n ; i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, true, true, true, true, false, true, true]; int [] param0 = [62, 13, 29, 72, 30, 20, 10, 47, 91, 52]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " GOOGLE_CASE_GIVEN_SENTENCE,"static String f_filled ( String s ) { int n = s . length ( ) ; String s1 = """" ; s1 = s1 + Character . toLowerCase ( s . charAt ( 0 ) ) ; for ( int i = 1 ; i < n ; i ++ ) { if ( s . charAt ( i ) == ' ' && i < n ) { s1 = s1 + "" "" + Character . toLowerCase ( s . charAt ( i + 1 ) ) ; i ++ ; } else s1 = s1 + Character . toUpperCase ( s . charAt ( i ) ) ; } return s1 ; }","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); } " COMPUTE_AVERAGE_TWO_NUMBERS_WITHOUT_OVERFLOW_1,"static int f_filled ( int a , int b ) { return ( a / 2 ) + ( b / 2 ) + ( ( a % 2 + b % 2 ) / 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [45, 73, 26, 40, 12, 41, 32, 71, 74, 78]; int [] param0 = [9, 68, 51, 31, 14, 73, 51, 75, 98, 83]; int [] param1 = [81, 79, 2, 49, 10, 9, 13, 67, 51, 74]; 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_POWER_OF_2_2,"static int f_filled ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; }","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); } " COMPUTE_MODULUS_DIVISION_BY_A_POWER_OF_2_NUMBER,"static int f_filled ( int n , int d ) { return ( n & ( d - 1 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [50, 3, 0, 9, 2, 0, 93, 32, 37, 15]; int [] param0 = [54, 39, 35, 9, 62, 16, 93, 32, 39, 63]; int [] param1 = [59, 84, 81, 60, 68, 16, 96, 38, 62, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DYNAMIC_PROGRAMMING_SET_17_PALINDROME_PARTITIONING,"static int f_filled ( String str ) { int n = str . length ( ) ; int [ ] [ ] C = new int [ n ] [ n ] ; boolean [ ] [ ] P = new boolean [ n ] [ n ] ; int i , j , k , L ; for ( i = 0 ; i < n ; i ++ ) { P [ i ] [ i ] = true ; C [ i ] [ i ] = 0 ; } for ( L = 2 ; L <= n ; L ++ ) { for ( i = 0 ; i < n - L + 1 ; i ++ ) { j = i + L - 1 ; if ( L == 2 ) P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) ; else P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) && P [ i + 1 ] [ j - 1 ] ; if ( P [ i ] [ j ] == true ) C [ i ] [ j ] = 0 ; else { C [ i ] [ j ] = Integer . MAX_VALUE ; for ( k = i ; k <= j - 1 ; k ++ ) C [ i ] [ j ] = Integer . min ( C [ i ] [ j ] , C [ i ] [ k ] + C [ k + 1 ] [ j ] + 1 ) ; } } } return C [ 0 ] [ n - 1 ] ; }","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); } " COMPUTE_NCR_P_SET_1_INTRODUCTION_AND_DYNAMIC_PROGRAMMING_SOLUTION,"static int f_filled ( int n , int r , int p ) { int C [ ] = new int [ r + 1 ] ; Arrays . fill ( C , 0 ) ; C [ 0 ] = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = Math . min ( i , r ) ; j > 0 ; j -- ) C [ j ] = ( C [ j ] + C [ j - 1 ] ) % p ; } return C [ r ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [50, 80, 0, 0, 0, 2, 0, 0, 0, 12]; int [] param0 = [82, 45, 44, 88, 90, 98, 80, 60, 52, 71]; int [] param1 = [5, 24, 68, 24, 75, 55, 54, 75, 73, 26]; int [] param2 = [94, 95, 61, 43, 57, 43, 88, 65, 86, 45]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " LENGTH_LONGEST_STRICT_BITONIC_SUBSEQUENCE,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > inc = new HashMap < Integer , Integer > ( ) ; HashMap < Integer , Integer > dcr = new HashMap < Integer , Integer > ( ) ; int len_inc [ ] = new int [ n ] ; int len_dcr [ ] = new int [ n ] ; int longLen = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int len = 0 ; if ( inc . containsKey ( arr [ i ] - 1 ) ) len = inc . get ( arr [ i ] - 1 ) ; len_inc [ i ] = len + 1 ; inc . put ( arr [ i ] , len_inc [ i ] ) ; } for ( int i = n - 1 ; i >= 0 ; i -- ) { int len = 0 ; if ( dcr . containsKey ( arr [ i ] - 1 ) ) len = dcr . get ( arr [ i ] - 1 ) ; len_dcr [ i ] = len + 1 ; dcr . put ( arr [ i ] , len_dcr [ i ] ) ; } for ( int i = 0 ; i < n ; i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1 ; return longLen ; }","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); } " COMPUTE_N_UNDER_MODULO_P,"static int f_filled ( int n , int p ) { if ( n >= p ) return 0 ; int result = 1 ; for ( int i = 1 ; i <= n ; i ++ ) result = ( result * i ) % p ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 0, 44, 0, 67]; int [] param0 = [85, 14, 83, 30, 96, 55, 82, 12, 38, 46]; int [] param1 = [18, 13, 21, 35, 51, 58, 71, 74, 3, 73]; 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,"static int f_filled ( int n ) { return ( int ) ( ( Math . log10 ( n & - n ) ) / Math . log10 ( 2 ) ) + 1 ; }","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); } " CONSTRUCT_LEXICOGRAPHICALLY_SMALLEST_PALINDROME,"static String f_filled ( char [ ] str , int len ) { int i = 0 , j = len - 1 ; for ( ; i < j ; i ++ , j -- ) { if ( str [ i ] == str [ j ] && str [ i ] != '*' ) continue ; else if ( str [ i ] == str [ j ] && str [ i ] == '*' ) { str [ i ] = 'a' ; str [ j ] = 'a' ; continue ; } else if ( str [ i ] == '*' ) { str [ i ] = str [ j ] ; continue ; } else if ( str [ j ] == '*' ) { str [ j ] = str [ i ] ; continue ; } System . out . println ( ""Not Possible"" ) ; return """" ; } return String . valueOf ( str ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = ["""", """", """", """", """", """", ""dnr"", """", """", """"]; char [] [] param0 = [['a', 'b', 'c', 'g', 'i', 'l', 'l', 'o', 'o', 'p', 'q', 's', 'w', 'y', 'c', 'd', 'e', 'f', 'f', 'i', 'm', 'm', 'o', 'q', 'v', 'w', 'x', 'x', 'y', 'z'], ['3', '2', '3', '6', '8', '9', '0', '5', '0', '5', '8', '7', '9', '0', '3', '6', '9', '6', '2', '4', '2', '3', '1', '2', '7', '9', '1', '8', '8', '7', '1', '1', '6', '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'], ['z', 'v', 'b', 'y', 'n', 'k', 'h', 'c', 't', 'l', 'g'], ['1', '2', '5', '6', '7'], ['0', '0', '1', '0'], ['d', 'n', 'r'], ['0', '9', '9', '1', '2', '1', '5', '3', '7', '5', '9', '2', '4', '4', '8', '9', '6', '4', '2', '8', '8', '5', '5', '7', '1', '7', '6', '2', '2', '2', '3', '3', '7', '9'], ['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'], ['e', 's', 'i', 's', 'h', 'h', 'i', 'm', 'v', 'b']]; int [] param1 = [27, 30, 27, 7, 4, 3, 1, 24, 21, 6]; 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); } " LOWER_INSERTION_POINT,"static int f_filled ( int arr [ ] , int n , int X ) { if ( X < arr [ 0 ] ) return 0 ; else if ( X > arr [ n - 1 ] ) return n ; int lowerPnt = 0 ; int i = 1 ; while ( i < n && arr [ i ] < X ) { lowerPnt = i ; i = i * 2 ; } while ( lowerPnt < n && arr [ lowerPnt ] < X ) lowerPnt ++ ; return lowerPnt ; }","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); } " CONVERTING_ONE_STRING_USING_APPEND_DELETE_LAST_OPERATIONS,"static boolean f_filled ( String str1 , String str2 , int k ) { if ( ( str1 . length ( ) + str2 . length ( ) ) < k ) return true ; int commonLength = 0 ; for ( int i = 0 ; i < Math . min ( str1 . length ( ) , str2 . length ( ) ) ; i ++ ) { if ( str1 == str2 ) commonLength ++ ; else break ; } if ( ( k - str1 . length ( ) - str2 . length ( ) + 2 * commonLength ) % 2 == 0 ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, true, true, true, false, false, true, true]; string [] param0 = [""znhgro"", ""382880806774"", ""0"", ""lxhtrfctsq"", ""6399914758"", ""01100011100000"", ""wkgqlob"", ""46974006151"", ""1001001"", ""ijq""]; string [] param1 = [""jadbtduyqu"", ""65565"", ""00100010100"", ""svixye"", ""780990121"", ""0100"", ""npqvdxzetuzy"", ""74438"", ""1000010"", ""nfohaeyeap""]; int [] param2 = [3, 10, 2, 89, 9, 0, 6, 11, 15, 42]; 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_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS,"static int f_filled ( int arr [ ] [ ] , int n ) { int d1 = 0 , d2 = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( i == j ) d1 += arr [ i ] [ j ] ; if ( i == n - j - 1 ) d2 += arr [ i ] [ j ] ; } } return Math . abs ( d1 - d2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [12, 36, 3, 51, 6, 2, 59, 370, 0, 89]; int [] [] [] param0 = [[[1, 7, 17, 19, 22, 25, 27, 29, 41, 60, 67, 73, 79, 85, 94], [2, 6, 16, 21, 30, 42, 43, 48, 50, 52, 60, 61, 68, 92, 95], [4, 8, 10, 14, 15, 20, 22, 23, 23, 39, 40, 63, 70, 75, 87], [7, 21, 24, 36, 39, 43, 50, 58, 58, 67, 70, 89, 94, 98, 99], [4, 13, 17, 20, 21, 24, 30, 45, 57, 58, 59, 65, 66, 91, 97], [15, 15, 18, 33, 38, 43, 51, 57, 64, 68, 70, 75, 85, 94, 97], [2, 5, 6, 6, 12, 41, 43, 44, 48, 48, 53, 53, 60, 69, 99], [1, 13, 14, 24, 24, 25, 35, 36, 40, 67, 74, 75, 87, 88, 96], [6, 13, 23, 28, 29, 39, 40, 50, 50, 63, 63, 81, 85, 88, 96], [4, 13, 26, 27, 36, 40, 42, 42, 46, 48, 57, 62, 67, 67, 70], [20, 25, 29, 61, 69, 70, 73, 75, 78, 80, 84, 85, 88, 95, 97], [2, 2, 6, 11, 11, 31, 39, 48, 50, 52, 54, 64, 77, 89, 97], [1, 14, 25, 26, 29, 41, 46, 55, 67, 68, 77, 77, 83, 84, 88], [6, 9, 11, 25, 29, 33, 36, 44, 63, 65, 67, 68, 78, 89, 91], [12, 13, 13, 15, 43, 45, 50, 60, 62, 62, 64, 86, 91, 96, 96]], [[74, -94, 42, 56, -64, -46, -34, 54, -2, -92, 0, -38, -76, -16, 42, 20, -58, 36, 66, -88, 6, -82, 46, 2, 2, -62, -76, -10, -26, -44, -38, 70, 46, 16, 12, 84, 4, -72, -84, 66, -6, -92, 46, -94, -46, 74, 64], [20, -22, -40, -22, -40, 56, 0, -84, -96, 32, -36, -16, 56, 36, -24, 20, 50, 28, 52, -44, -36, -18, 14, 42, 28, 24, -88, 90, 76, -72, -80, -80, 48, 56, -28, -18, -56, 32, -72, 30, -46, -60, 8, -90, 52, -10, 86], [-82, 60, 60, 72, -68, 2, 40, -56, -38, -80, 10, 54, -22, 34, 62, -78, 10, 28, -8, 28, -22, -34, 12, 14, -18, 38, 88, -10, -70, 44, -70, 10, 70, -58, 36, -70, -32, -60, -98, 32, 32, 6, 58, -78, -58, -66, 74], [58, -16, 66, -26, 18, 46, 92, 14, 62, -8, 62, 12, 72, 8, 36, 22, -24, -2, 80, 88, -16, 46, 16, -70, 22, -58, -46, -66, 4, 86, 54, -86, -6, -36, -54, 14, -38, 16, -12, -68, -18, 96, 54, 70, -22, 78, 40], [-38, -50, -20, -58, 80, -42, -64, -12, 64, -56, 50, 36, 18, 58, 12, 12, 12, -22, -72, -44, 28, 48, -2, 34, -78, -36, -60, -34, 28, 8, 30, -98, 4, 0, 6, 70, -90, -4, 38, -88, -84, 86, 24, -18, 96, -72, 76], [-78, 18, -82, -18, 32, -26, -54, -18, 84, 68, -94, 42, 26, 88, 34, 18, -22, 20, 44, -60, 54, -60, 14, 86, 18, 10, -48, 96, -36, -98, 96, -6, -96, -2, -92, -78, -24, 40, -82, -74, 0, 18, 0, 28, 16, 78, -76], [32, 46, -30, 98, -92, 24, 42, -2, -92, 12, -24, 84, 80, -74, -80, -48, 54, 30, -4, 28, 0, -56, 78, 76, -96, -32, -52, 82, -78, 46, -92, -16, 58, 78, -14, -82, 78, -44, -34, 34, 2, 76, 72, -34, -80, 88, 20], [-66, 6, 70, 82, -86, -16, 38, 22, 42, 76, 58, 2, -12, 0, 14, -8, -8, 62, 46, -38, -90, 8, 36, -68, 56, 26, 40, -36, 76, -54, 44, 88, 46, -62, 34, -26, 90, -94, 52, 40, 24, -86, 36, 28, -12, -48, 6], [-12, 14, -96, -4, -96, -18, -60, -52, 86, 22, -44, -22, -68, 66, -66, 72, -42, -14, -98, 56, 82, -52, -84, 82, 98, -36, -14, 20, -48, 90, -20, 80, -18, 6, -82, -4, 88, 88, 82, 78, 88, -34, 22, 6, -16, 4, 32], [18, 24, 52, -50, -82, -66, 58, 42, -60, 66, 86, 82, -66, -72, -6, 80, 78, 68, -30, -76, -64, 98, -62, 80, -96, 32, 60, -52, -26, -66, 52, -8, 42, 74, -72, 94, -94, -56, -14, 74, 72, -82, -86, -80, -4, -64, -52], [-82, 2, -16, 56, -14, 70, -60, 16, 82, 62, -52, 12, -74, -22, 50, -82, -14, -48, -88, 52, -12, 92, -40, 16, -66, -92, 30, -80, -10, 48, -4, 16, 50, 66, 44, -40, -52, 48, 18, -16, -56, 58, 28, -42, -80, 22, -58], [42, 38, 28, 30, 16, 66, -92, 36, -40, 28, 12, 2, -50, -42, -96, -56, 6, -16, 10, 96, -62, 64, -8, 82, 46, 94, 6, 30, 84, 64, -58, 88, 42, 88, 0, 16, -30, 48, -10, 30, 94, -42, 56, -82, -60, -84, -34], [60, -50, -90, 24, -8, 40, -92, -28, 28, 84, -36, -62, -24, -54, 98, -90, 50, -26, -18, 8, -74, -20, 54, -22, -44, -84, 64, 66, -20, 56, 96, 54, 94, -60, 96, -46, -66, 66, -48, 2, -90, -94, -86, -80, -36, -66, 36], [82, -38, 10, 18, 8, -12, -92, -96, -50, -34, 18, -54, 8, -36, 56, -32, 80, -84, 96, 76, 6, 72, 62, 24, 58, 20, -56, -94, -92, 16, 22, -68, -18, -26, -56, 80, -52, 50, 56, 78, -6, 54, -58, 16, 78, 52, 80], [-34, -56, -86, 42, 26, -78, 8, 92, 2, 10, -56, -14, 84, -20, 14, -76, 2, 82, 90, 28, 18, 16, 94, -96, -40, 22, -52, -90, -28, -64, 38, -68, -62, -94, 76, -78, -48, 70, -60, -98, 84, -38, -12, -20, 8, 84, -52], [-74, -94, 42, 80, 12, 56, -90, 58, 4, -58, 20, 14, 80, -88, 22, 94, -18, -96, 76, 88, 72, -98, -80, 88, -8, 6, -10, 50, -78, 16, -40, 28, 14, -98, -90, -4, 30, 56, 28, 56, 32, 12, 68, 2, 2, 18, 96], [70, 24, -78, -52, -10, -54, -4, 22, -96, -60, -16, 90, 70, 64, 78, 90, -74, 98, 80, 84, -84, -22, 58, -12, -84, -2, -72, 24, -96, 52, -62, 58, 72, -24, -54, -38, -12, 34, 42, -50, -14, -16, 62, -72, 14, -34, 50], [76, 48, -66, 12, -92, 36, 64, -86, -18, 2, 16, 2, 88, 70, -8, 4, -62, -34, -6, 54, 10, -8, -54, 32, 12, 94, -12, -68, 74, 84, -38, -4, -32, 20, 14, -8, 82, -66, 48, -26, -74, 10, -20, -74, -46, 78, -96], [28, 24, 16, 40, 12, -68, -42, 94, 18, 98, 68, -56, 2, -92, -10, -54, -2, -82, 86, -64, -38, -12, 48, -32, 16, 30, -36, -94, 84, -74, -30, -54, 62, -38, -74, -6, 70, -64, -26, -58, 30, 2, 96, 64, -86, -24, -12], [-30, -78, 84, 58, 20, 2, 10, -24, 62, -56, -80, 76, -40, -20, -66, -2, -62, 48, -74, -48, -82, 88, 64, -72, 74, -42, 30, -60, -88, -46, -72, 36, -98, 70, -84, -52, 68, -18, -90, -20, 44, -40, -92, 20, -98, -80, -84], [-90, 44, -30, 84, -10, 36, 28, 46, -96, -42, -60, 2, -14, 78, 80, 44, -54, -10, -12, -30, 80, -80, 94, 72, 50, -98, 74, 14, -28, -84, 60, 62, -72, -90, -46, -90, 56, -36, 98, 64, -26, 64, -68, -58, -10, -12, -18], [84, -86, 90, -90, -42, 38, 6, 8, -90, -6, -52, 18, -62, 96, 42, -26, -86, -24, 54, 10, 94, -66, 58, -82, 84, -42, -6, 48, 72, 54, 94, -36, -56, -66, 0, 28, 80, -22, 92, 44, 64, -86, -96, 6, 56, -62, -88], [32, -90, 68, 72, -74, -70, -4, 58, -78, -18, -50, -10, -84, 26, 38, -84, 72, 44, -52, 44, -26, 42, -84, 2, -42, 76, -16, -46, 0, -46, -26, -28, -10, 56, -84, -92, 84, 32, -80, -46, -10, -30, 52, -78, -50, 56, -22], [-78, 12, -90, -90, -74, 48, -46, 32, 4, 24, -6, 40, 80, -26, -68, -20, 70, 86, 60, -60, 84, 30, 34, -60, -42, 50, 38, 64, 30, -18, -50, -48, 66, -2, -20, 86, 26, -96, 96, -68, 38, 64, -40, -94, -52, 74, 52], [-40, 88, 72, -56, -26, -48, -48, -20, 46, 88, 14, 86, 4, 46, 6, -54, -86, 34, 58, -72, 92, -18, -88, 8, 0, -28, -78, -4, 40, 0, 28, -38, -60, -28, -44, 48, -56, -52, 2, 20, 72, -98, 6, 22, 64, 36, -60], [90, -8, 0, -42, -58, -96, 80, 52, -78, 24, -24, -92, -70, 42, -46, 96, -10, -32, -18, 22, 24, 86, -4, -86, -70, -70, -96, -98, -34, 0, 16, -84, 28, -70, 94, -72, -52, -78, 62, -56, -12, -88, 76, 74, 12, 12, -28], [-42, -94, 96, 74, 70, -40, 50, -40, -26, 2, -76, -88, -54, 80, 66, 38, -8, 42, 94, -12, -88, 38, -44, -26, -98, 80, -56, -40, 48, -48, -8, 50, 6, 74, 94, -50, -70, -30, 70, -2, 60, -92, 38, -28, -64, -62, -54], [-40, 70, -60, -38, -70, 6, 24, -72, 22, -58, -2, 70, 58, 28, 90, -68, -12, 18, -66, -56, 66, 32, 4, 98, 64, -34, 10, -78, -88, -38, 36, -76, -96, 94, -38, -18, -40, 94, -18, -66, -34, 66, 82, -94, 76, -38, 14], [-98, -72, 14, 10, -30, 56, -56, 30, 20, 60, 52, 46, -16, -60, 60, 0, -70, 50, -64, 90, -62, -10, -94, 74, -92, 98, 86, 42, -18, -66, 34, 40, 36, -44, -44, -86, -22, -50, 50, -28, -34, -40, -30, 44, -54, 74, 54], [16, -12, -44, 82, -60, 36, -24, -12, 78, -74, -82, 66, -48, 74, -2, -4, -4, 10, -4, 18, 8, -84, -56, 64, 66, -46, -56, -60, -60, -72, 92, -82, 44, 28, 30, 84, 68, 34, -36, -58, 60, -26, 10, 74, 50, -70, -40], [-94, -12, -34, -82, -22, 22, -14, -66, 76, -42, -94, 24, 40, 10, -24, 60, 80, -52, 62, 76, 96, 92, 46, -44, -20, -92, -36, -6, -90, -64, -64, 44, 54, -60, -30, 80, 32, 32, -76, -10, 48, 88, -84, -32, -94, -50, 80], [86, 56, -50, -48, 74, 36, 2, 6, -64, 24, 86, 58, -92, -66, -32, -4, -74, -94, 16, -18, 10, -66, 82, -96, -96, 56, 18, 78, -12, 32, 48, 70, 42, 20, 0, -80, 78, -28, 80, 0, -94, -56, -28, 48, -30, -50, -20], [46, -94, -6, 60, -94, -18, 80, -58, -62, -70, -20, -8, -60, 92, 32, 78, 4, -26, -32, 98, 40, 98, -92, -96, 2, -96, 42, 30, 2, -4, 20, -84, -8, -40, 42, 8, 92, 32, -12, 44, -60, 32, 14, -56, -68, -72, -18], [2, 50, 48, 44, -24, 68, 16, 88, -66, -48, -82, -50, -24, -50, -56, 40, 30, -58, 38, 24, 44, 42, 52, 18, -86, 26, -4, -64, 70, -12, 6, -90, 78, 12, -82, 52, 70, 32, 74, 66, -98, -62, 76, 20, 74, -48, -46], [90, 66, -62, 86, 76, -54, 78, 98, 66, -16, 16, 32, 48, -42, 50, 16, -86, 66, 12, 88, -92, -78, -84, 74, 10, 0, -86, -34, 14, -74, -88, 86, -48, -34, 44, -58, 26, -48, -70, -96, -26, 84, 82, -90, -14, 30, -20], [-26, 58, -32, 22, -82, 50, -50, 42, 14, 60, -28, -12, 34, 94, -68, -48, -6, -98, 66, 94, -60, 26, 72, 10, -58, -66, -50, -92, -34, 66, 36, 44, 94, -34, -76, 22, -94, 14, 56, -2, 38, 42, 16, 20, -90, -36, -34], [-90, 98, 34, 26, 58, 70, -86, 46, -40, 70, 94, 40, -36, 2, -82, 0, -4, -18, 70, 40, 92, -38, -46, -74, -82, -54, 44, -34, 24, -46, 60, -36, -86, 92, -32, -38, 76, 46, -42, -56, -42, -8, 48, -64, 88, -50, 24], [70, -26, -72, -18, -88, -58, 76, -96, 62, -12, -56, 74, 62, 68, -86, 82, 34, -98, -52, 22, -16, -48, -14, -8, -56, 10, 48, 98, -70, 82, 2, -86, 76, 72, -70, -6, 58, -18, -48, 52, -48, -76, 68, -64, -34, -56, -88], [34, -80, -50, 74, -26, 2, 40, -66, -16, 56, 22, 10, -72, 86, 54, 34, 30, 38, -86, -22, -38, -28, -86, 28, 96, 6, -86, 54, 4, -84, 34, -58, -6, 40, 54, -60, -22, 84, 74, -92, -58, -86, -76, -66, -36, 90, -30], [26, 74, 84, -60, 52, -14, 98, -74, 24, 16, -96, -86, 18, -82, -34, -82, -56, -86, -8, -50, -32, -44, 8, 50, -12, 82, -10, 80, -28, -28, 2, -34, -88, 28, -44, -94, -42, 2, -48, 54, 90, 16, -38, 14, 82, 42, 58], [-22, 14, 26, -60, -18, -38, -60, 54, -48, 60, 50, -70, 24, -50, 18, 48, 98, 42, -52, -68, 24, 94, 60, 74, 76, 6, -76, -70, -86, -22, 76, 16, -4, 48, 20, -60, 82, 38, 32, 36, -56, -58, 40, 12, 46, 18, -96], [-92, 44, 94, -42, -84, -78, -72, -62, -32, 4, -12, -42, 4, 12, 20, -12, 6, 38, -92, -64, 64, 92, -62, 64, 54, -60, -42, -54, -14, -28, 26, -6, -14, 0, 80, 10, -64, -54, 2, 82, -8, 98, -20, 72, -94, -78, -64], [50, 44, -64, -36, 60, -44, 64, -64, 40, -66, 60, -44, 6, -8, -80, 36, 2, 30, -26, 82, -82, 26, -92, -40, -66, -62, 76, -34, -46, -36, 36, -92, 36, -74, -78, 50, -80, 16, -88, 92, -50, -80, 12, -92, 8, -18, -84], [20, -24, 94, -62, 40, -16, -24, -36, 62, -88, 98, -28, -80, 96, -96, 18, 60, -92, 22, 96, 98, -48, -82, 62, -28, -74, -84, -56, 88, -82, 38, 42, -82, -76, -16, -12, 46, -46, 48, 96, 12, 66, 74, -58, -2, -84, 16], [-4, 18, -28, 22, 70, -70, -70, 66, 46, -68, 72, -60, -54, 2, -82, 60, 86, -92, 36, -44, 98, 88, -88, 86, 24, 88, -80, -12, -18, -8, 0, -26, 2, 56, 94, 90, 30, -96, 32, 48, 2, -72, -36, 10, -52, 0, 98], [46, -62, -78, -50, 98, 26, 42, 6, 26, -28, -56, 60, -36, -54, -84, 90, 68, 94, -28, 60, 52, 54, 28, 12, 58, -42, 86, -74, -84, -88, 54, -18, 54, 38, -96, 84, -78, -26, 50, 86, 58, 24, -2, -78, 40, -68, 6], [2, 26, -82, -84, 46, 46, 0, 18, 90, -92, 24, -34, -70, -84, 18, 32, -36, -84, -36, 20, 26, -72, -12, 36, 72, 42, 58, -34, 30, 40, -6, -18, -52, 20, -52, 4, -64, -64, -2, 36, 64, -86, -70, -38, -50, -34, 60]], [[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, 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, 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], [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, 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], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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], [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, 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], [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, 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, 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]], [[49, 76, 85, 2, 48, 20], [13, 2, 84, 21, 44, 17], [70, 85, 58, 75, 89, 16], [86, 45, 19, 97, 95, 63], [62, 44, 26, 75, 73, 95], [93, 35, 62, 88, 6, 33]], [[-80, -72, -68, -62, -56, -40, -28, 4, 22, 24, 34, 58, 60, 60, 78], [-88, -68, -48, -28, -24, -4, 0, 2, 12, 30, 42, 48, 52, 64, 68], [-92, -86, -82, -44, -38, -20, -18, -16, 2, 4, 12, 32, 42, 54, 96], [-82, -74, -64, -48, -30, -10, 16, 20, 28, 46, 46, 54, 60, 74, 96], [-84, -78, -70, -30, -28, -18, -10, -2, 2, 14, 30, 44, 50, 92, 98], [-92, -74, -64, -48, -46, -8, 20, 22, 28, 30, 30, 32, 46, 62, 84], [-92, -82, -82, -66, -64, -60, -40, -2, 2, 40, 44, 46, 66, 68, 74], [-70, -58, -54, -46, -34, -18, 14, 20, 22, 32, 48, 62, 84, 86, 90], [-92, -62, -58, -48, -30, -28, 0, 8, 16, 20, 26, 38, 70, 92, 98], [-90, -80, -46, 0, 14, 36, 42, 48, 48, 50, 50, 50, 52, 76, 98], [-80, -78, -58, -58, -54, -44, -42, 6, 20, 24, 28, 34, 40, 58, 78], [-90, -80, -60, -40, 4, 6, 10, 26, 28, 34, 36, 38, 42, 44, 56], [-96, -96, -72, -58, -54, -40, -34, -34, -28, -26, -22, -18, -2, 18, 54], [-98, -90, -76, -64, -62, -58, -54, -30, -16, 14, 36, 54, 54, 72, 92], [-86, -70, -58, -48, -46, -38, -32, 2, 20, 44, 54, 56, 66, 82, 84]], [[0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0], [0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], [0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1], [1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0], [1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0], [1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0], [0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1], [1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1], [1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0], [0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0], [1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1], [1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1], [1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1], [1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1], [1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1], [0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0], [0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0], [0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1], [0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0], [1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0], [0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0], [1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0], [1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0], [0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0], [0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1], [0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1], [0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0], [0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0]], [[1, 2, 2, 2, 3, 3, 10, 11, 11, 19, 27, 30, 31, 36, 38, 51, 55, 64, 64, 68, 72, 78, 79, 83, 87, 98], [1, 3, 5, 6, 19, 25, 31, 32, 39, 40, 51, 51, 52, 54, 57, 58, 64, 65, 66, 73, 76, 83, 87, 90, 92, 97], [1, 6, 7, 26, 29, 33, 35, 42, 44, 46, 47, 50, 61, 64, 65, 67, 73, 75, 81, 81, 86, 87, 88, 88, 95, 95], [1, 3, 6, 19, 19, 21, 29, 34, 36, 36, 43, 44, 52, 53, 53, 63, 64, 67, 68, 75, 75, 75, 76, 78, 81, 83], [9, 10, 18, 18, 20, 22, 28, 31, 35, 42, 47, 48, 48, 62, 63, 65, 65, 70, 73, 75, 75, 82, 92, 95, 95, 97], [10, 14, 16, 17, 27, 30, 33, 36, 37, 37, 39, 47, 48, 48, 56, 57, 62, 74, 78, 81, 82, 84, 87, 88, 95, 95], [2, 16, 16, 18, 21, 21, 25, 26, 33, 38, 51, 51, 57, 59, 66, 68, 68, 69, 70, 74, 74, 74, 84, 86, 96, 98], [3, 5, 14, 14, 17, 23, 26, 26, 27, 31, 33, 36, 37, 51, 63, 64, 70, 70, 72, 75, 79, 86, 90, 90, 97, 97], [15, 15, 16, 19, 23, 29, 31, 33, 35, 35, 37, 38, 44, 49, 56, 68, 73, 74, 75, 76, 80, 84, 87, 89, 95, 99], [2, 3, 7, 13, 14, 16, 19, 19, 21, 28, 32, 39, 43, 47, 58, 64, 66, 80, 80, 82, 83, 84, 91, 91, 95, 98], [2, 3, 11, 21, 22, 24, 26, 34, 39, 41, 41, 47, 49, 50, 50, 59, 61, 67, 78, 79, 80, 85, 87, 87, 90, 96], [6, 9, 11, 15, 20, 27, 27, 27, 28, 42, 47, 47, 58, 61, 67, 70, 70, 71, 76, 77, 78, 80, 83, 91, 97, 98], [4, 8, 12, 13, 14, 14, 15, 20, 21, 22, 24, 25, 29, 51, 51, 57, 60, 68, 73, 76, 76, 81, 92, 93, 94, 98], [1, 8, 23, 26, 26, 26, 31, 40, 41, 45, 46, 49, 50, 53, 55, 58, 62, 65, 66, 68, 71, 77, 87, 87, 97, 98], [3, 9, 11, 17, 26, 28, 31, 32, 32, 33, 35, 41, 41, 41, 44, 48, 48, 63, 72, 74, 82, 84, 85, 91, 92, 94], [3, 5, 6, 8, 10, 17, 36, 41, 42, 45, 50, 51, 52, 53, 56, 58, 63, 64, 69, 72, 73, 74, 78, 87, 90, 92], [2, 6, 12, 19, 20, 25, 27, 30, 35, 38, 42, 45, 45, 50, 53, 54, 56, 59, 62, 62, 66, 74, 78, 81, 91, 94], [6, 8, 9, 15, 18, 20, 23, 23, 29, 30, 39, 41, 49, 62, 65, 69, 76, 79, 83, 84, 85, 86, 90, 94, 98, 98], [5, 6, 7, 11, 12, 16, 19, 19, 20, 20, 26, 44, 46, 53, 56, 60, 61, 74, 75, 75, 76, 80, 93, 95, 96, 99], [7, 15, 19, 22, 23, 24, 31, 34, 35, 37, 40, 42, 44, 52, 57, 67, 73, 74, 76, 77, 78, 83, 84, 95, 96, 97], [2, 4, 15, 16, 16, 23, 26, 32, 34, 39, 40, 41, 46, 52, 56, 61, 62, 65, 76, 80, 81, 82, 84, 85, 86, 87], [9, 13, 22, 41, 42, 42, 42, 45, 48, 49, 51, 51, 54, 58, 59, 60, 73, 74, 75, 83, 83, 86, 91, 94, 98, 98], [5, 9, 9, 16, 21, 21, 22, 27, 28, 31, 31, 32, 38, 38, 49, 51, 61, 62, 65, 69, 73, 75, 85, 91, 91, 96], [4, 4, 7, 7, 7, 9, 11, 21, 31, 36, 43, 43, 57, 58, 63, 63, 64, 66, 70, 71, 73, 77, 82, 83, 92, 97], [1, 6, 9, 9, 12, 14, 15, 16, 20, 24, 25, 29, 30, 37, 43, 44, 45, 53, 58, 63, 69, 70, 72, 78, 83, 88], [1, 15, 16, 17, 19, 24, 25, 35, 43, 44, 44, 46, 48, 49, 50, 53, 54, 61, 61, 67, 70, 74, 74, 83, 87, 88]], [[-62, -26, -90, -96, 66, 8, 88, 98, 26, -4, -62, 38, 24, 18, -88, -78, 22, -80, 80, 8, 62, 22, -20, 42, 78, -96, 38, 22, 44, 18, -98, 4, 66, -58, 50, -98, 42, 48, -52, 98, -72, 72, 60, -66, -78, -92], [24, 94, 24, 64, 78, -82, 12, -96, -80, 32, -18, -8, -98, -32, -8, -40, -98, -52, -86, -50, -16, -36, 6, 6, 70, -78, 10, -34, -98, 24, -62, 4, -8, -86, 60, -52, -48, -44, 82, 68, 98, 30, 6, -58, 94, -52], [-20, 84, -82, 42, 42, 86, 38, 64, 84, 88, 46, -48, -8, -60, -94, -74, -72, -74, -52, -96, 46, 68, 84, -64, 22, -44, 78, -62, 64, 14, -80, 90, -26, 84, 92, -82, 36, -56, -46, 28, 86, -58, 50, -78, -36, -50], [-26, -94, -38, -38, -10, 58, -42, 36, 12, 22, 52, 48, 40, 22, 84, -56, -76, 48, -42, -58, 50, 98, -46, -30, 16, 30, 66, -2, 68, 44, -60, -4, 40, 16, 68, -40, 96, -40, -6, 60, 62, 90, 90, -20, 98, 94], [80, 36, 26, 86, 76, 38, 88, 80, -90, -60, -52, 92, 48, -32, -18, 4, -44, 52, 14, 2, 92, 2, -70, -16, 92, 12, -66, 62, 52, -92, -98, -80, -46, -50, 72, 98, 64, -32, 52, -10, 20, -20, -54, -12, 64, -64], [38, 94, 60, 44, -26, -46, 92, 60, -18, -10, -60, -78, -96, 54, -88, -20, 60, 66, -62, 40, 98, -50, 86, -56, -52, -60, 52, 26, 62, 62, -4, 54, -60, 52, -50, -2, 92, -38, -98, -66, 60, 70, 76, 64, -80, -88], [94, 84, 38, -60, -72, 50, -42, -52, -4, 16, -40, 90, -18, -20, 34, -28, -4, -66, -82, -30, -36, 94, -38, -56, -22, 62, -2, 30, -58, 70, -80, 0, -98, 14, 40, -28, 76, 30, 18, 6, -72, -28, 24, 26, 66, -56], [38, 52, 34, -60, 78, 64, 2, 64, -50, 14, -66, -2, -10, 10, 98, 36, 96, 96, -76, -58, -52, 22, 40, -28, 18, -34, -72, -98, -54, 82, 30, 90, 0, -22, 6, -36, -34, 44, -60, -40, 70, -26, 14, 14, -72, 98], [38, -88, 26, 34, 32, -78, 38, 12, -16, -76, 28, -74, 6, -54, 96, 8, -34, 72, 84, -70, -26, 16, -86, -14, 46, -24, -24, -96, -82, -66, 78, 20, -94, -76, -76, 90, -32, -24, -36, -62, -88, -26, -36, 0, -92, 40], [0, 66, 60, 82, -14, 92, 88, 30, 60, 36, 80, -54, 28, -10, -96, -4, -68, 46, 98, 42, 38, 30, -74, -2, 30, 6, -78, 74, -56, -6, -48, 32, 88, -40, 18, 36, -34, -28, 30, -54, -82, 98, 34, -56, 50, 40], [18, -96, 54, -6, 94, -68, -28, -18, -90, -64, -88, 60, 60, -72, 82, 48, 6, -44, -22, -82, 62, 52, -32, 0, 2, -12, -78, 92, 22, 2, 84, -64, 50, -6, -2, 90, 76, -48, -28, 22, -30, 14, 68, 26, 80, 20], [-94, -26, -52, 4, -44, 12, 74, -26, 28, 64, 84, -62, -10, -12, 74, 68, 94, -80, 32, -26, 80, 44, -80, -74, -82, -86, 98, -12, 30, 60, 90, 16, -58, -28, 18, 14, -86, -46, -62, -88, -84, 74, -48, -8, -26, 60], [10, 64, 58, -92, -48, 38, -30, -64, -58, -68, -26, -68, 52, 48, -72, 96, 32, -48, -60, 54, -6, -72, -22, 74, 4, 14, 80, 52, -50, 22, 74, -14, -92, -96, 54, -90, -18, 18, -16, -82, 26, 98, -68, 8, -78, -48], [-78, 12, 70, -42, 34, -52, 86, 64, -32, -96, -22, -8, 84, 36, -38, -80, 84, 72, 58, 34, -86, -84, 30, -40, -90, 10, 0, -74, 14, 76, -22, -2, 86, 86, -60, 32, -62, -34, 4, 14, 68, -38, 86, 94, 18, 30], [66, 16, 82, -70, -24, -90, -70, 82, 32, -42, -82, 74, -24, -16, 68, -92, 32, -58, -58, -14, -34, 68, -24, 20, 68, 54, 78, -72, -14, -46, 74, -90, -98, -64, -2, -58, -6, -20, 54, -70, -46, -56, 50, -62, 0, -14], [4, 50, 66, 84, -44, 50, -22, 36, 20, 94, -2, 66, -16, -82, -90, -74, 88, 42, 16, 42, -76, 0, 28, -42, -44, 48, -12, 78, -40, 54, 34, -86, -26, -46, 78, -68, -80, -94, -2, -48, -42, 62, 48, -24, -20, 60], [-16, 20, 16, -10, -96, -32, 42, -52, -72, 2, -66, -40, 32, 86, 96, -46, 88, 64, 90, 68, -22, 0, -18, 82, 22, 62, -82, -44, 76, -62, -26, 8, 82, 84, 96, 8, 76, 66, -56, 96, 96, -54, -70, 66, 60, 40], [64, -58, -76, 94, -4, -48, -40, 96, 46, -16, 2, -52, 42, -80, -44, 10, -60, 28, -52, -54, -88, 72, -40, -2, 78, 86, -26, -86, -90, -4, -14, 46, -84, -36, -88, 4, -4, -92, -42, 36, -94, -10, -38, -82, -50, 4], [-72, 22, -40, 24, 10, 26, 72, 14, -90, -66, -88, -30, 40, 40, -80, -56, -4, -88, 32, -98, 22, 10, 58, 62, -10, 24, -80, -90, 28, -64, -26, 30, -32, -44, 90, -12, 16, -48, 98, 88, -58, -54, -10, 48, -12, -40], [70, -36, -30, -26, -48, 86, -12, -78, 62, -8, -80, -14, -48, 52, -38, 38, -54, -40, -24, -80, -94, -50, -46, 64, 12, 62, -8, 12, -22, 24, -30, 20, -8, -76, -18, -76, 52, -74, 38, -26, -98, 58, 76, 38, 44, -14], [32, -62, 24, -58, -50, 32, -84, 0, -62, -12, 28, 72, 0, 42, 82, 32, -20, -96, -20, 92, -32, 86, -70, 74, -76, 64, 48, 66, 94, 52, 48, 6, -78, -88, 24, 74, 32, 38, 38, 92, 50, 24, 34, 46, -14, 18], [-42, 86, -48, -96, -72, 52, -28, 8, -92, -28, -56, -16, -48, -88, 90, 42, 30, 62, -50, 78, -20, 26, 10, -14, -40, 22, -34, -98, -48, -56, 54, 0, -54, -68, 52, 70, 78, -20, 60, -88, -26, 40, -80, -6, 66, -86], [18, -68, -46, 24, -62, -8, 14, -46, -60, -48, 0, -46, 50, 98, -86, 2, 92, -94, 66, -90, -74, -34, -80, 14, -42, -72, -54, 36, 70, 38, -92, 64, -86, -64, 6, -22, 92, -60, 38, 94, -74, 46, 96, -32, -10, 22], [2, 44, 44, -16, -96, 26, -32, -66, -22, 30, 68, -12, -94, 32, -48, 16, -80, -94, 2, -4, -56, -22, -22, 36, 16, 50, -2, 46, 56, -68, -72, -34, -54, -76, -84, 74, 22, -38, 26, 36, 30, -56, -82, 54, 92, -50], [-12, 2, -28, 98, -94, -52, 18, -30, -50, 36, 46, -22, -54, -70, 64, -30, 32, -14, 38, -56, -34, 84, 24, 10, 26, 32, 52, -16, -48, 4, -24, -70, -94, -10, -76, -36, 46, 88, 18, 48, -64, -12, -8, -70, -4, -80], [90, -8, 30, -44, -64, 42, 8, -14, -6, -70, -42, -98, -48, 34, -88, -22, 48, -98, 0, -16, 32, -36, 78, 84, 60, 80, 90, 58, -72, 80, -96, -98, -96, 58, -62, 86, -6, -14, -50, -96, 8, 18, -84, -34, -72, -18], [-42, 36, 86, 26, 10, -20, -22, 46, 28, 88, -34, -84, 60, 8, -22, 38, -40, -36, 18, -76, 40, -22, 14, 86, 22, 24, 98, 88, -90, 58, -58, 30, 70, 84, -32, 2, 20, 80, 28, -44, -98, -6, -64, 90, 42, -92], [0, -38, 82, 46, -24, 34, 34, -82, 2, -86, -30, 64, 16, -6, 22, -88, -26, -88, -74, -20, 82, 94, -16, 64, 26, 76, 58, -92, 28, -16, 44, 56, 20, 40, 20, 78, -96, -86, -54, -46, 54, -76, 82, -50, -54, -40], [-66, -18, 2, 98, 6, 70, 32, -6, 66, 4, 88, 64, 20, -24, 68, 2, -86, 66, -46, 18, 70, -90, 6, -44, -28, -86, 16, -38, -34, 2, 96, 80, 80, 34, -34, -66, 68, -20, 32, 36, 8, -40, -34, 8, 80, -94], [54, -28, -22, -26, 96, -34, 96, -92, 20, -24, 26, 24, 18, 96, 14, 96, 48, -96, 38, 86, 88, -66, 26, -22, 54, 72, 42, 0, -10, -42, -54, 78, -42, -2, -30, -60, -20, -84, -14, 98, 24, 96, -62, -28, -52, 34], [-96, 78, -66, -94, 2, 36, -62, -14, 70, -22, -92, -58, -58, -2, 40, 80, 86, -84, -98, -66, -44, -58, 56, -90, 88, 34, 76, 82, -2, 38, -26, 92, -94, 62, -56, -10, 14, -50, -92, 80, 8, -36, -96, -10, 42, -84], [50, -14, 12, 78, 50, -54, -22, -34, -70, -58, -18, 38, 8, -88, -88, -86, 58, -42, -28, -42, -26, 26, 90, 14, -40, 98, 94, 58, 68, 14, 36, 20, 58, 14, -22, -34, -48, -64, 38, -12, -12, 30, 24, 6, 38, 50], [-48, 6, 82, 94, 30, 58, -30, -54, -26, -32, 48, 40, 20, -68, -28, -50, -4, 88, -58, -46, -70, 48, -30, 76, -58, -96, -56, 36, 10, 56, 14, -6, 38, 12, -52, -78, -56, -36, 48, -56, -78, 98, -56, -92, -50, 46], [-30, -64, -90, -38, -28, 74, 70, -44, 56, -38, 64, 98, 62, -50, -68, 82, -6, 36, -16, -60, -44, -34, 92, -56, 12, 12, 88, 30, -72, 98, -86, -64, 82, -56, 58, 28, 24, -72, -98, -68, -54, -52, 50, 8, 44, 18], [-92, -86, -68, -18, 56, 26, 68, -84, 60, -68, 20, -2, -86, -76, -92, -86, -96, 50, 84, -44, 62, 24, -20, 88, -94, -66, 32, 50, -32, -96, 18, 56, 48, 18, -40, 50, -18, -10, 84, -48, 8, -50, 86, 88, 90, -70], [60, 46, 46, 96, 44, -38, -66, -56, 12, -28, -36, -32, -98, 50, 16, -8, 58, -94, 20, -94, 88, 82, 30, -32, -6, -50, 6, 44, -98, -16, -96, -68, 54, 0, 68, 44, 58, -72, -96, -84, -70, -14, -12, -52, -78, -76], [-8, 72, 32, -90, -68, 60, -10, -34, -38, -88, 22, 82, -46, -76, 96, 54, 0, -52, 94, -66, 34, 28, -50, -32, -80, 0, 98, 18, 96, 28, 72, 64, -52, 98, 14, 28, 46, 48, 34, -34, -96, -24, -48, -86, -26, -74], [36, 26, 22, 18, 4, 78, 72, 28, -24, -64, 28, 2, -4, 46, 82, -70, 36, 66, 22, -32, -48, 24, -20, 66, 80, -22, 88, 26, 68, 22, 84, -44, -28, 76, -10, 90, -46, -40, -94, 22, 14, 96, -66, 66, -4, 40], [-44, -22, 52, 30, 70, 22, 22, 74, 56, -14, 66, -34, 34, -2, -96, -90, -38, 32, -4, -74, 16, -34, -6, 14, 38, -66, 68, -2, -28, -66, -8, -22, 80, -70, -62, -66, -18, -84, 82, -8, 34, -42, 16, 10, -64, 34], [-10, 92, -78, -80, 18, 54, 8, 16, -98, 14, 8, 14, -6, -72, -30, 68, -76, 40, 92, -94, 20, 90, 68, 28, 38, -8, -94, 50, 56, -92, -46, -54, -12, -48, 18, 76, 10, 58, 24, -32, 6, 94, 64, 66, 96, 90], [88, 62, -84, 24, 76, -24, -22, 26, 42, -56, -56, -26, -40, 88, 74, 32, 54, -96, -24, -44, 90, 66, 56, -68, 34, 18, 44, -38, 82, -12, -8, 80, 70, 92, 6, -50, 40, -62, 60, -98, 54, 36, -4, 84, 48, 84], [86, -98, -60, 26, -58, -26, 92, -80, -56, -30, 60, -10, 96, 92, -76, -28, 88, 4, -88, -82, -22, 96, -18, -8, -88, 16, 12, -30, -66, -26, 38, -76, 68, -22, -78, 56, -70, -42, 76, 92, 8, -76, 0, 70, -70, 32], [42, -88, -52, -12, -58, 78, 4, 98, -92, 96, 70, 96, 96, 86, -6, -58, -14, -92, -6, 16, -28, 88, 28, 14, -14, 22, -46, -30, -6, -34, -12, -70, 82, 68, 34, 58, 20, 90, -58, -66, -12, -20, -76, -86, 56, 32], [-62, -58, -60, 26, 38, 68, -18, 26, -42, 30, -52, -28, -98, -58, -2, 86, -38, -58, -58, -82, -52, 80, 42, -4, -92, 32, -90, 60, 70, -96, 96, -36, -16, 40, -24, 44, -34, 48, -54, 80, -86, 14, 34, 52, 50, 38], [68, -46, -50, 64, -32, -94, 14, -66, 90, -54, 60, 20, 52, 36, -26, -92, 38, 10, 84, -18, -38, -98, 92, -50, -58, 40, -56, -44, -46, -50, -2, 52, 22, -80, -20, 86, 8, 64, 48, -8, 14, -86, -56, -26, -6, 28], [-58, -40, -82, 8, 26, -46, -14, -62, -28, -28, 90, 76, 62, -18, -34, 18, -78, 14, 24, 2, 62, 62, -88, -84, -54, 66, 96, 44, -46, -18, -44, 32, -12, -94, -54, -18, 62, 12, 4, 8, -66, 72, 12, -32, 48, 68]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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, 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], [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, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [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, 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]], [[94, 55, 14, 44, 30, 47, 19, 87, 68, 17, 34, 15, 93, 98, 10, 27, 43, 51, 83, 24, 19, 45, 91, 59, 84, 82, 80, 51], [4, 37, 73, 13, 56, 1, 10, 52, 62, 6, 71, 18, 21, 24, 48, 82, 41, 86, 45, 79, 74, 42, 49, 92, 73, 40, 57, 28], [63, 27, 3, 18, 66, 35, 77, 76, 77, 17, 69, 56, 34, 48, 83, 96, 57, 6, 7, 20, 41, 11, 14, 78, 10, 10, 24, 76], [75, 75, 93, 9, 27, 21, 26, 8" CONVERT_STRICTLY_INCREASING_ARRAY_MINIMUM_CHANGES,"static int f_filled ( int arr [ ] , int n ) { int LIS [ ] = new int [ n ] ; int len = 0 ; for ( int i = 0 ; i < n ; i ++ ) LIS [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { for ( int j = 0 ; j < i ; j ++ ) { if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) LIS [ i ] = Math . max ( LIS [ i ] , LIS [ j ] + 1 ) ; } len = Math . max ( len , LIS [ i ] ) ; } return n - len ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 15, 5, 10, 4, 2, 0, 2, 1, 9]; int [] [] param0 = [[1, 4, 12, 14, 15, 18, 20, 24, 25, 25, 27, 33, 34, 42, 46, 48, 49, 50, 50, 52, 55, 56, 57, 58, 64, 65, 66, 69, 72, 75, 78, 80, 84, 90, 92, 95, 99], [-56, 6, -74, -30, 34, 40, -76, -10, -12, -86, -76, 36, -72, 82, 38, 68, 28, 84, 98, -84, 6, 16, -46, 8, 2, -18, -50, 4, -96, 88, -84, -38, -82, -54], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [68, 79, 87, 44, 3, 99, 80, 6, 46, 67, 72, 40, 11, 18, 73, 48, 18, 72, 10, 38, 3, 39, 26, 76, 47, 15, 85, 69], [-96, -94, -94, -74, -68, -60, -58, -56, -56, -52, -52, -50, -44, -40, -26, -24, -10, -8, -6, -2, 2, 2, 12, 14, 20, 24, 26, 30, 38, 40, 52, 52, 62, 62, 68, 70, 74, 76, 80, 82, 90, 92], [1, 1, 1, 0, 1], [1, 5, 11, 20, 24, 28, 29, 31, 54, 58, 63, 65, 66, 71, 77, 80, 83, 92, 93, 93], [-50, -46, -44, -90, 2, -38, 88, -26, 60], [1, 1], [2, 1, 19, 26, 65, 47, 3, 65, 9, 12, 84, 59, 74, 59, 30, 83, 73, 67, 13, 5, 64, 83, 81, 92, 80, 14, 58, 84, 92]]; int [] param1 = [21, 22, 6, 15, 31, 3, 12, 7, 1, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MODULAR_EXPONENTIATION_POWER_IN_MODULAR_ARITHMETIC,"static int f_filled ( int x , int y , int p ) { int res = 1 ; x = x % p ; while ( y > 0 ) { if ( ( y & 1 ) == 1 ) res = ( res * x ) % p ; y = y >> 1 ; x = ( x * x ) % p ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [61, 18, 4, 0, 3, 3, 16, 5, 19, 29]; int [] param0 = [45, 67, 26, 33, 35, 68, 14, 5, 23, 37]; int [] param1 = [5, 25, 91, 61, 8, 41, 76, 89, 42, 63]; int [] param2 = [68, 49, 44, 9, 13, 5, 20, 13, 45, 56]; 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); } " COST_BALANCE_PARANTHESES,"static int f_filled ( String s ) { if ( s . length ( ) == 0 ) System . out . println ( 0 ) ; int ans = 0 ; int o = 0 , c = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == '(' ) o ++ ; if ( s . charAt ( i ) == ')' ) c ++ ; } if ( o != c ) return - 1 ; int [ ] a = new int [ s . length ( ) ] ; if ( s . charAt ( 0 ) == '(' ) a [ 0 ] = 1 ; else a [ 0 ] = - 1 ; if ( a [ 0 ] < 0 ) ans += Math . abs ( a [ 0 ] ) ; for ( int i = 1 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == '(' ) a [ i ] = a [ i - 1 ] + 1 ; else a [ i ] = a [ i - 1 ] - 1 ; if ( a [ i ] < 0 ) ans += Math . abs ( a [ i ] ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 4, -1, -1, 0, -1, 8, 3, 36, 36]; string [] param0 = [""()"", ""))(("", ""())"", ""(()"", ""(()()())"", ""))())(()(())"", ""))(())(("", ""49"", ""00001111"", ""kdahbyg ""]; 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); } " LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S,"static int f_filled ( int arr [ ] , int n ) { int sum = 0 ; int maxsize = - 1 , startindex = 0 ; int endindex = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { sum = ( arr [ i ] == 0 ) ? - 1 : 1 ; for ( int j = i + 1 ; j < n ; j ++ ) { if ( arr [ j ] == 0 ) sum += - 1 ; else sum += 1 ; if ( sum == 0 && maxsize < j - i + 1 ) { maxsize = j - i + 1 ; startindex = i ; } } } endindex = startindex + maxsize - 1 ; if ( maxsize == - 1 ) System . out . println ( ""No such subarray"" ) ; else System . out . println ( startindex + "" to "" + endindex ) ; return maxsize ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]; int [] [] param0 = [[56, 8, 67, 35, 19, 82, 81, 66, 10, 24, 82, 2, 42, 48, 18, 63, 48, 74, 60, 64, 64, 95, 95, 20, 95, 55, 63, 96, 54], [78, 67, 1, 78, 48, 83, 17, 19, 21, 44, 99, 68, 16, 54, 9], [3, 69, 97, 21, 12, 67, 45, 53, 77, 70, 26, 43], [21, 80, 29, 22, 77, 64, 42, 4, 71, 75, 62, 27, 30, 36, 66, 37, 49, 97], [18, 66, 9, 90, 21, 95, 74, 48, 44, 9, 43, 17], [42, 41, 87, 3, 64, 25, 96, 55, 99, 57, 32, 64, 10, 75, 69, 95, 11, 36, 15, 2, 78, 70, 14, 54, 11, 28, 55, 47, 27, 85, 47, 62, 97, 68, 44, 70, 12, 27, 36, 85, 76, 91, 17, 75, 83, 34, 32, 89, 55], [44], [1, 43, 28, 17, 30, 46, 89, 51, 15, 70, 96, 79, 65, 55, 8], [25, 91, 68, 4, 35, 49, 33], [14, 86, 22, 42, 94, 54, 28, 41, 48, 8, 82, 84, 99, 92, 33, 75, 38, 31, 59, 86, 21, 6, 77, 89, 79, 83, 57, 26, 89, 45, 60, 55, 60, 76, 76, 6, 40, 57, 38, 44, 7, 98, 64, 65, 88, 73, 88, 99]]; int [] param1 = [26, 8, 9, 10, 10, 41, 0, 9, 4, 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); } " MULTIPLY_AN_INTEGER_WITH_3_5,"static int f_filled ( int x ) { return ( x << 1 ) + x + ( x >> 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [203, 56, 287, 115, 308, 178, 283, 133, 276, 311]; int [] param0 = [58, 16, 82, 33, 88, 51, 81, 38, 79, 89]; 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_SWAPS_REQUIRED_BRING_ELEMENTS_LESS_EQUAL_K_TOGETHER,"static int f_filled ( int arr [ ] , int n , int k ) { int count = 0 ; for ( int i = 0 ; i < n ; ++ i ) if ( arr [ i ] <= k ) ++ count ; int bad = 0 ; for ( int i = 0 ; i < count ; ++ i ) if ( arr [ i ] > k ) ++ bad ; int ans = bad ; for ( int i = 0 , j = count ; j < n ; ++ i , ++ j ) { if ( arr [ i ] > k ) -- bad ; if ( arr [ j ] > k ) ++ bad ; ans = Math . min ( ans , bad ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 4, 0, 5, 0, 0, 0, 3, 0, 0]; int [] [] param0 = [[7, 12, 15, 30, 33, 34, 53, 66, 73, 74, 76, 77, 85, 90], [-62, -20, -26, -24, 92, 66, -74, -4, 18, -82, -36, 92, -4, 92, -80, 56, -24, 4, -48, -10, -14, -46, -16, -58, -58, -6, -68, -22, -82, -16, 76, -30, -86, -38, -66, 28, 58, 30, -44, -56], [0, 0, 0, 0, 0, 1, 1], [8, 48, 64, 77, 61, 60, 96, 95, 41, 68, 9, 67, 10, 66, 16, 59, 83, 21, 47, 16, 13, 85, 52, 11, 48, 31, 99, 57, 57, 44, 66, 93, 80, 69, 23, 2, 55, 90], [-80, -58, -40, -34, 14, 36, 48, 56, 58, 60, 84, 90, 92, 92], [1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1], [4, 4, 8, 9, 13, 17, 18, 19, 21, 22, 22, 23, 27, 28, 30, 44, 46, 48, 53, 53, 55, 60, 61, 62, 68, 70, 70, 71, 73, 80, 82, 82, 85, 88, 90, 93, 99], [-28, 50, 82, -32, 32, -78, 12, 50, 38, 34, -10, 6, 86, -56, -2], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [37, 88, 83, 91, 11, 39, 98, 70, 93, 74, 24, 90, 66, 3, 6, 28]]; int [] param1 = [9, 24, 5, 36, 7, 26, 28, 13, 9, 12]; int [] param2 = [8, 28, 6, 24, 8, 23, 36, 9, 8, 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); } " PROGRAM_CALCULATE_VOLUME_OCTAHEDRON,"static double f_filled ( double side ) { return ( ( side * side * side ) * ( Math . sqrt ( 2 ) / 3 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [17807230335.375374, -333508958.9649689, 263998930936.71603, -374202387762.81836, 216287285897.3415, -58885228987.99368, 439772223071.1617, -74883158892.28471, 141830229.25431916, -166494655500.3635]; double [] param0 = [3355.322051344013, -891.0551553192736, 8242.699647177868, -9259.146104439229, 7712.806145993083, -4998.858862079315, 9771.127582524628, -5415.8106399098115, 670.0774772280249, -7068.634369272122]; 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_ARRAYS_CONSECUTIVE_ELEMENT_DIFFERENT_VALUES,"static int f_filled ( int n , int k , int x ) { int [ ] dp = new int [ 109 ] ; dp [ 0 ] = 0 ; dp [ 1 ] = 1 ; for ( int i = 2 ; i < n ; i ++ ) dp [ i ] = ( k - 2 ) * dp [ i - 1 ] + ( k - 1 ) * dp [ i - 2 ] ; return ( x == 1 ? ( k - 1 ) * dp [ n - 2 ] : dp [ n - 1 ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 57, 14706, 1439671, 40690104, 214748365, 96855122, 699051, 0, 1]; int [] param0 = [1, 4, 7, 10, 13, 16, 19, 22, 25, 28]; int [] param1 = [10, 9, 8, 7, 6, 5, 4, 3, 2, 1]; int [] param2 = [2, 5, 8, 11, 14, 17, 20, 23, 26, 29]; 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_NUMBER_WAYS_REACH_GIVEN_SCORE_GAME,"static int f_filled ( int n ) { int table [ ] = new int [ n + 1 ] , i ; Arrays . fill ( table , 0 ) ; table [ 0 ] = 1 ; for ( i = 3 ; i <= n ; i ++ ) table [ i ] += table [ i - 3 ] ; for ( i = 5 ; i <= n ; i ++ ) table [ i ] += table [ i - 5 ] ; for ( i = 10 ; i <= n ; i ++ ) table [ i ] += table [ i - 10 ] ; return table [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [30, 4, 1, 1, 37, 16, 33, 27, 2, 10]; int [] param0 = [83, 29, 17, 12, 93, 55, 97, 75, 22, 52]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " POSITION_OF_RIGHTMOST_SET_BIT_1,"static int f_filled ( int n ) { int position = 1 ; int m = 1 ; while ( ( n & m ) == 0 ) { m = m << 1 ; position ++ ; } return position ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 1, 3, 2, 3, 4, 2, 1, 1]; int [] param0 = [17, 97, 73, 68, 6, 84, 72, 66, 57, 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); } " COUNT_BINARY_STRINGS_K_TIMES_APPEARING_ADJACENT_TWO_SET_BITS,"static int f_filled ( int n , int k ) { int dp [ ] [ ] [ ] = new int [ n + 1 ] [ k + 1 ] [ 2 ] ; dp [ 1 ] [ 0 ] [ 0 ] = 1 ; dp [ 1 ] [ 0 ] [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { for ( int j = 0 ; j < i && j < k + 1 ; j ++ ) { dp [ i ] [ j ] [ 0 ] = dp [ i - 1 ] [ j ] [ 0 ] + dp [ i - 1 ] [ j ] [ 1 ] ; dp [ i ] [ j ] [ 1 ] = dp [ i - 1 ] [ j ] [ 0 ] ; if ( j - 1 >= 0 ) { dp [ i ] [ j ] [ 1 ] += dp [ i - 1 ] [ j - 1 ] [ 1 ] ; } } } return dp [ n ] [ k ] [ 0 ] + dp [ n ] [ k ] [ 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 72495581, 0, 0, 0, 4221018, 0, 0, 0, 0]; int [] param0 = [29, 40, 77, 9, 29, 94, 51, 46, 18, 86]; int [] param1 = [85, 25, 96, 91, 80, 85, 87, 62, 96, 86]; 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_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE_2,"static boolean f_filled ( int A [ ] , int arr_size , int sum ) { for ( int i = 0 ; i < arr_size - 2 ; i ++ ) { HashSet < Integer > s = new HashSet < Integer > ( ) ; int curr_sum = sum - A [ i ] ; for ( int j = i + 1 ; j < arr_size ; j ++ ) { if ( s . contains ( curr_sum - A [ j ] )) { System . out . printf ( ""Triplet is %d, %d, %d\n"" , A [ i ] , A [ j ] , curr_sum - A [ j ] ) ; return true ; } s . add ( A [ j ] ) ; } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, true, false, true, false, false]; int [] [] param0 = [[1, 6, 8, 8, 9, 11, 13, 13, 15, 17, 21, 24, 38, 38, 42, 43, 46, 46, 47, 54, 55, 56, 57, 58, 60, 60, 60, 62, 63, 63, 65, 66, 67, 67, 69, 81, 84, 84, 85, 86, 95, 99], [20, -86, -24, 38, -32, -64, -72, 72, 68, 94, 18, -60, -4, -18, -18, -70, 6, -86, 46, -16, 46, -28], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [13, 96, 31, 39, 23, 39, 50, 10, 21, 64, 41, 54, 44, 97, 24, 91, 79, 86, 38, 49, 77, 71, 8, 98, 85, 36, 37, 65, 42, 48], [-86, -68, -58, -56, -54, -54, -48, -40, -36, -32, -26, -16, -14, -12, -12, -4, -4, -4, 0, 10, 22, 22, 30, 54, 62, 68, 88, 88], [0, 1, 1, 1, 1, 0, 0], [8, 8, 9, 13, 20, 24, 29, 52, 53, 96], [18, -92, -10, 26, 58, -48, 38, 66, -98, -72, 4, 76, -52, 20, 60, -56, 96, 60, -10, -26, -64, -66, -22, -86, 74, 82, 2, -14, 76, 82, 40, 70, -40, -2, -46, -38, 22, 98, 58], [1, 1, 1, 1], [72]]; int [] param1 = [27, 21, 17, 17, 21, 5, 9, 30, 2, 0]; int [] param2 = [24, 20, 13, 18, 25, 3, 8, 30, 2, 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); } " COUNT_CHARACTERS_POSITION_ENGLISH_ALPHABETS,"static int f_filled ( String str ) { int result = 0 ; for ( int i = 0 ; i < str . length ( ) ; i ++ ) { if ( i == ( str . charAt ( i ) - 'a' ) || i == ( str . charAt ( i ) - 'A' ) ) { result ++ ; } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 3, 1, 3, 2, 0, 1, 3, 0, 0]; string [] param0 = [""llkhfezgcb"", ""abced"", ""geeksforgeeks"", ""alphabetical"", ""abababab"", ""bcdefgxyz"", ""cbzaqx l"", "" bcd"", ""11"", ""mqqky""]; 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_NUMBER_SUBSETS_DISTINCT_ELEMENTS,"static int f_filled ( int ar [ ] , int n ) { int res = 0 ; Arrays . sort ( ar ) ; for ( int i = 0 ; i < n ; i ++ ) { int count = 1 ; for ( ; i < n - 1 ; i ++ ) { if ( ar [ i ] == ar [ i + 1 ] ) count ++ ; else break ; } res = Math . max ( res , count ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 3, 27, 3, 2, 22, 1, 3, 3, 2]; int [] [] param0 = [[1, 2, 5, 8, 16, 21, 21, 22, 23, 26, 26, 27, 27, 29, 31, 33, 36, 37, 37, 38, 42, 45, 47, 50, 57, 58, 60, 60, 62, 63, 66, 66, 76, 84, 84, 88, 96, 99], [-96, -96, -94, -94, -82, -82, -62, -60, -46, -46, -38, -36, -36, -30, -24, -22, -18, -14, -10, 2, 4, 4, 4, 8, 8, 12, 24, 34, 46, 50, 52, 70, 78, 78, 80, 80, 82, 82, 82, 86, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [16, 38, 38, 41, 47, 48, 48, 48, 49, 62, 84, 92, 99], [-88, -64, -40, -38, -38, -16, 16, 20, 28, 40, 56, 58, 60, 68, 74, 92], [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], [14, 24, 82, 87, 95], [-90, -88, -84, -80, -80, -76, -68, -64, -58, -58, -58, -46, -40, -34, -18, -14, -10, 2, 2, 4, 8, 12, 14, 22, 40, 40, 46, 50, 52, 62, 62, 64, 68, 76, 90, 94], [0, 1, 1, 1], [5, 6, 17, 41, 43, 68, 68, 86, 89, 90]]; int [] param1 = [38, 42, 45, 13, 16, 43, 5, 36, 4, 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); } " COUNT_CHARACTERS_STRING_DISTANCE_ENGLISH_ALPHABETS,"static int f_filled ( String str ) { int result = 0 ; int n = str . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( str . charAt ( i ) - str . charAt ( j ) ) == Math . abs ( i - j ) ) result ++ ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 3, 0, 0, 7, 1, 3, 1, 1, 2]; string [] param0 = [""smnkl"", ""270083"", ""0"", ""kczdsz"", ""483544224"", ""000011"", ""wysgcirmwkbzp"", ""3366"", ""110"", ""nlamkpcjugg""]; 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_DERANGEMENTS_PERMUTATION_SUCH_THAT_NO_ELEMENT_APPEARS_IN_ITS_ORIGINAL_POSITION_1,"static int f_filled ( int n ) { int der [ ] = new int [ n + 1 ] ; der [ 0 ] = 1 ; der [ 1 ] = 0 ; der [ 2 ] = 1 ; for ( int i = 3 ; i <= n ; ++ i ) der [ i ] = ( i - 1 ) * ( der [ i - 1 ] + der [ i - 2 ] ) ; return der [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 9, 44, 265, 1854, 14833, 133496, 1334961, 14684570, 176214841]; int [] param0 = [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); } " NUMBER_WAYS_NODE_MAKE_LOOP_SIZE_K_UNDIRECTED_COMPLETE_CONNECTED_GRAPH_N_NODES,"static int f_filled ( int n , int k ) { int p = 1 ; if ( k % 2 != 0 ) p = - 1 ; return ( int ) ( Math . pow ( n - 1 , k ) + p * ( n - 1 ) ) / n ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1439670, 1, 456, 14707, 5, 0, 11, 6, 8138020, 657]; int [] param0 = [7, 2, 9, 8, 6, 10, 12, 4, 6, 10]; int [] param1 = [9, 8, 4, 6, 2, 1, 2, 3, 11, 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_SUBARRAY_WITH_GIVEN_SUM,"static int f_filled ( int arr [ ] , int n , int sum ) { int curr_sum , i , j ; for ( i = 0 ; i < n ; i ++ ) { curr_sum = arr [ i ] ; for ( j = i + 1 ; j <= n ; j ++ ) { if ( curr_sum == sum ) { int p = j - 1 ; System . out . println ( ""Sum found between indexes "" + i + "" and "" + p) ; return 1 ; } if ( curr_sum > sum || j == n ) break ; curr_sum = curr_sum + arr [ j ] ; } } System . out . println ( ""No subarray found"" ) ; return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 1, 0, 0, 0]; int [] [] param0 = [[4, 8, 8, 10, 15, 18, 19, 22, 25, 26, 30, 32, 35, 36, 40, 41, 43, 48, 53, 57, 59, 63, 64, 68, 71, 76, 76, 77, 78, 89, 96, 97], [-78, 16, -16, -10, -2, -38, 58, -72, -78, 50, -68, -16, -96, 82, 70, 2, -20], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [16, 10, 55, 43, 46, 74, 57, 65, 86, 60, 28, 6, 92], [-98, -98, -90, -84, -84, -80, -76, -76, -70, -54, -48, -46, -44, -42, -38, -14, -12, -4, 6, 8, 24, 28, 32, 40, 40, 42, 64, 84, 98], [0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1], [2, 10, 40, 45, 56, 66, 66, 70, 75, 83, 93, 98], [-20, 30, 56, -68, 54, -6, 78, -86, 88, -66, 76, -66, 62, 78, 22, 46, -94, -10, 18, 16, -36, 34, -98, -84, -40, 98, 82, 10, 12, 54, -88], [0, 0, 1, 1], [38, 24, 12]]; int [] param1 = [26, 9, 9, 10, 23, 12, 10, 30, 2, 1]; int [] param2 = [23, 12, 11, 6, 19, 8, 10, 17, 2, 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_DISTINCT_NON_NEGATIVE_PAIRS_X_Y_SATISFY_INEQUALITY_XX_YY_N_2_1,"static int f_filled ( int n ) { int x = 0 , yCount , res = 0 ; for ( yCount = 0 ; yCount * yCount < n ; yCount ++ ) ; while ( yCount != 0 ) { res += yCount ; x ++ ; while ( yCount != 0 && ( x * x + ( yCount - 1 ) * ( yCount - 1 ) >= n ) ) yCount -- ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [64, 69, 83, 30, 41, 37, 71, 17, 71, 86]; int [] param0 = [72, 75, 92, 30, 45, 40, 81, 17, 81, 99]; 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_SUM_NODES_GIVEN_PERFECT_BINARY_TREE_1,"static double f_filled ( int l ) { double leafNodeCount = Math . pow ( 2 , l - 1 ) ; double sumLastLevel = 0 ; sumLastLevel = ( leafNodeCount * ( leafNodeCount + 1 ) ) / 2 ; double sum = sumLastLevel * l ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [680.0, 8590196736.0, 66048.0, 4.0541453871439934e+37, 2.4507641172284386e+36, 1.0535906843452986e+54, 1.82391348669623e+41, 6.079859587547136e+16, 6.0230643559004e+35, 1.0154976884767503e+26]; int [] param0 = [5, 16, 8, 61, 59, 88, 67, 27, 58, 42]; 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_OCCURRENCES_AS_A_SUBSEQUENCE,"static int f_filled ( String S , String T ) { int m = T . length ( ) ; int n = S . length ( ) ; if ( m > n ) return 0 ; int mat [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ; for ( int i = 1 ; i <= m ; i ++ ) mat [ i ] [ 0 ] = 0 ; for ( int j = 0 ; j <= n ; j ++ ) mat [ 0 ] [ j ] = 1 ; for ( int i = 1 ; i <= m ; i ++ ) { for ( int j = 1 ; j <= n ; j ++ ) { if ( T . charAt ( i - 1 ) != S . charAt ( j - 1 ) ) mat [ i ] [ j ] = mat [ i ] [ j - 1 ] ; else mat [ i ] [ j ] = mat [ i ] [ j - 1 ] + mat [ i - 1 ] [ j - 1 ] ; } } return mat [ m ] [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 2, 20, 0, 2, 0, 1, 4, 6, 1]; string [] param0 = [""banana"", ""49597223"", ""1000010000011"", ""btlzufk"", ""3474007"", ""0010"", ""dkhhotd"", ""9123259723"", ""11001000111110"", ""iy wjliz""]; string [] param1 = [""ban"", ""42"", ""010"", ""epsvuzp lf"", ""370"", ""00000"", ""dot"", ""123"", ""0"", ""ii""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_ENTRIES_EQUAL_TO_X_IN_A_SPECIAL_MATRIX,"static int f_filled ( int n , int x ) { int f_filled = 0 ; for ( int i = 1 ; i <= n && i <= x ; i ++ ) { if ( x / i <= n && x % i == 0 ) f_filled ++ ; } return f_filled ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 5, 4, 0, 3, 5, 4, 6, 0, 5]; int [] param0 = [47, 57, 55, 11, 55, 63, 64, 28, 49, 48]; int [] param1 = [30, 16, 63, 23, 49, 64, 98, 30, 61, 64]; 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_EVEN_LENGTH_BINARY_SEQUENCES_WITH_SAME_SUM_OF_FIRST_AND_SECOND_HALF_BITS_1,"static int f_filled ( int n ) { int nCr = 1 , res = 1 ; for ( int r = 1 ; r <= n ; r ++ ) { nCr = ( nCr * ( n + 1 - r ) ) / r ; res += nCr * nCr ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 6, 20, 70, 252, 924, 3432, 12870, 48620, 184756, 705432, 2704156, 10400600, 40116600, 155117520, 601080390]; int [] param0 = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_NUMBER_SEGMENTS_LENGTHS_B_C,"static int f_filled ( int n , int a , int b , int c ) { int dp [ ] = new int [ n + 10 ] ; Arrays . fill ( dp , - 1 ) ; dp [ 0 ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( dp [ i ] != - 1 ) { if ( i + a <= n ) dp [ i + a ] = Math . max ( dp [ i ] + 1 , dp [ i + a ] ) ; if ( i + b <= n ) dp [ i + b ] = Math . max ( dp [ i ] + 1 , dp [ i + b ] ) ; if ( i + c <= n ) dp [ i + c ] = Math . max ( dp [ i ] + 1 , dp [ i + c ] ) ; } } return dp [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, -1, 32, -1, -1, -1, 2, 7, -1, -1]; int [] param0 = [23, 62, 32, 82, 94, 44, 4, 53, 9, 23]; int [] param1 = [16, 76, 46, 48, 99, 21, 57, 23, 55, 15]; int [] param2 = [23, 81, 1, 72, 62, 46, 2, 80, 26, 73]; int [] param3 = [18, 97, 78, 58, 38, 60, 77, 5, 85, 42]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_FACTORIAL_NUMBERS_IN_A_GIVEN_RANGE,"static int f_filled ( int low , int high ) { int fact = 1 , x = 1 ; while ( fact < low ) { fact = fact * x ; x ++ ; } int res = 0 ; while ( fact <= high ) { res ++ ; fact = fact * x ; x ++ ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 0, 2, 0, 0]; int [] param0 = [57, 57, 31, 62, 49, 82, 31, 5, 76, 55]; int [] param1 = [79, 21, 37, 87, 98, 76, 45, 52, 43, 6]; 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_FIBONACCI_NUMBERS_GIVEN_RANGE_LOG_TIME,"static int f_filled ( int low , int high ) { int f1 = 0 , f2 = 1 , f3 = 1 ; int result = 0 ; while ( f1 <= high ) { if ( f1 >= low ) result ++ ; f1 = f2 ; f2 = f3 ; f3 = f1 + f2 ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 3, 0, 0, 0, 0, 1, 6, 0]; int [] param0 = [76, 96, 19, 36, 60, 20, 76, 63, 2, 41]; int [] param1 = [43, 52, 79, 2, 11, 15, 4, 93, 25, 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); } " MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2,"static int f_filled ( int a [ ] , int n ) { Arrays . sort ( a ) ; int num1 = 0 ; int num2 = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ] ; else num2 = num2 * 10 + a [ i ] ; } return num2 + num1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [372, -1977127, 1, 95, -1149, 122222222, 108, -49, 12, 625]; int [] [] param0 = [[4, 1, 2, 3, 3, 8], [-9, -5, -8, 4, -1, -6, -8, -9, -8, -1, -2, -8], [0, 1], [7, 1, 7, 8], [-7, -4, -4, -2, 8, 3], [1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0], [9, 9, 9], [6, -6, 5], [0, 0, 0, 0, 0, 0, 1, 1, 1], [7, 5, 8, 6, 5]]; int [] param1 = [6, 12, 2, 4, 6, 30, 3, 3, 9, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_FREQUENCY_K_MATRIX_SIZE_N_MATRIXI_J_IJ,"static int f_filled ( int n , int k ) { if ( n + 1 >= k ) return ( k - 1 ) ; else return ( 2 * n + 1 - k ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [73, 35, 37, 70, -6, -30, 79, 74, 57, -19]; int [] param0 = [90, 86, 92, 72, 25, 11, 94, 91, 66, 34]; int [] param1 = [74, 36, 38, 71, 57, 53, 80, 75, 58, 88]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX_1,"static int f_filled ( int M [ ] [ ] , int n , int m ) { int count = 0 ; int i = 0 ; int j = m - 1 ; while ( j >= 0 && i < n ) { if ( M [ i ] [ j ] < 0 ) { count += j + 1 ; i += 1 ; } else j -= 1 ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [309, 1, 454, 0, 60, 20, 185, 63, 191, 295]; int [] [] [] param0 = [[[-43, -43, -39, -38, -36, -26, -25, -22, -12, -12, -11, -4, -3, 2, 3, 4, 18, 19, 25, 26, 27, 31, 31, 33, 33, 36, 42, 44, 47], [-48, -45, -40, -36, -35, -35, -29, -27, -25, -23, -13, -4, 5, 12, 13, 13, 18, 21, 22, 25, 32, 33, 34, 37, 43, 45, 46, 48, 48], [-48, -47, -46, -45, -36, -36, -30, -27, -27, -24, -22, -22, -18, -3, -3, -2, -1, 0, 0, 3, 4, 16, 19, 21, 28, 32, 34, 39, 49], [-46, -38, -36, -31, -30, -30, -29, -27, -21, -19, -14, -13, -12, -8, -7, -2, 1, 1, 3, 10, 11, 19, 19, 22, 28, 36, 47, 47, 49], [-45, -42, -29, -27, -25, -20, -17, -15, -12, -12, -10, -5, 1, 2, 3, 4, 11, 22, 29, 29, 31, 34, 36, 37, 42, 42, 44, 48, 48], [-49, -44, -43, -40, -39, -30, -30, -22, -22, -18, -15, -14, -12, -11, -7, -7, -3, -1, 0, 1, 13, 22, 40, 42, 42, 42, 44, 46, 48], [-49, -49, -42, -34, -29, -27, -24, -19, -14, -7, -3, -2, 1, 4, 5, 8, 12, 13, 18, 23, 24, 24, 29, 30, 36, 38, 44, 46, 48], [-47, -42, -38, -33, -28, -27, -26, -25, -24, -18, -15, -14, -14, -11, -6, -5, -3, -2, 1, 2, 6, 7, 17, 17, 20, 36, 37, 41, 41], [-47, -47, -43, -41, -39, -38, -27, -25, -23, -22, -21, -18, -14, -13, -12, -10, -8, 3, 13, 25, 27, 28, 30, 33, 33, 35, 38, 42, 45], [-49, -48, -47, -47, -45, -39, -36, -35, -28, -28, -26, -9, 0, 3, 9, 16, 19, 19, 20, 22, 24, 25, 27, 33, 35, 43, 47, 48, 49], [-49, -41, -36, -36, -35, -34, -34, -32, -28, -27, -23, -18, -4, 2, 4, 10, 16, 16, 18, 21, 25, 25, 27, 34, 36, 42, 42, 43, 44], [-48, -35, -32, -28, -23, -22, -21, -17, -10, -10, -2, 3, 6, 7, 9, 12, 20, 21, 22, 22, 23, 24, 25, 28, 33, 37, 41, 42, 44], [-48, -47, -45, -44, -44, -41, -37, -32, -32, -28, -26, -25, -21, -8, 2, 2, 5, 7, 9, 12, 13, 14, 17, 25, 26, 32, 33, 35, 39], [-44, -40, -39, -39, -37, -27, -27, -16, -13, -11, -4, -3, 4, 8, 16, 19, 22, 24, 25, 27, 31, 32, 35, 36, 40, 45, 45, 47, 48], [-41, -39, -37, -30, -29, -27, -23, -21, -21, -16, -15, -15, -11, -11, -10, -9, -7, 2, 2, 5, 6, 8, 8, 8, 17, 30, 32, 42, 45], [-45, -42, -39, -32, -28, -25, -24, -23, -18, -16, -15, -12, -7, 3, 4, 8, 11, 12, 15, 17, 20, 21, 30, 32, 35, 38, 43, 44, 45], [-42, -41, -40, -37, -35, -33, -32, -21, -18, -16, -11, -8, -8, -3, -3, -2, 4, 13, 15, 22, 24, 31, 32, 34, 37, 38, 43, 45, 48], [-49, -43, -39, -38, -25, -22, -20, -17, -14, -13, -13, -4, 1, 7, 7, 10, 14, 16, 20, 24, 27, 30, 37, 38, 39, 40, 43, 48, 49], [-49, -49, -48, -48, -46, -43, -43, -35, -34, -28, -24, -8, -8, -2, 11, 11, 18, 19, 20, 22, 26, 30, 30, 33, 38, 38, 41, 48, 49], [-44, -43, -36, -36, -32, -29, -26, -23, -21, -16, -15, -5, -5, -4, -3, -2, 4, 5, 5, 10, 13, 19, 21, 22, 24, 26, 35, 39, 47], [-49, -48, -44, -40, -32, -25, -23, -7, -4, -3, -2, -1, 4, 4, 11, 19, 20, 20, 22, 24, 24, 27, 30, 31, 39, 42, 44, 45, 45], [-43, -42, -38, -37, -30, -27, -20, -18, -16, -15, -14, -12, -7, 7, 12, 13, 14, 16, 17, 18, 22, 22, 23, 31, 37, 38, 43, 44, 48], [-43, -36, -33, -31, -30, -23, -17, -15, -14, -14, -13, -12, -11, -10, -9, -7, -5, -2, 0, 12, 14, 23, 24, 24, 28, 33, 37, 42, 44], [-49, -47, -47, -46, -44, -43, -34, -31, -19, -18, -16, -9, -8, -7, -6, -3, 0, 7, 14, 16, 16, 18, 28, 33, 36, 36, 37, 47, 49], [-48, -45, -45, -40, -38, -35, -34, -32, -27, -27, -18, -17, -17, -9, -6, -3, 2, 6, 6, 7, 11, 12, 13, 16, 29, 35, 37, 40, 42], [-49, -46, -46, -46, -42, -40, -39, -39, -36, -30, -26, -26, -25, -20, -18, -17, -15, -9, -5, -5, 0, 6, 10, 11, 13, 14, 14, 26, 31], [-49, -46, -43, -41, -35, -34, -33, -32, -28, -19, -12, -11, -7, -5, -1, 10, 11, 11, 12, 12, 13, 18, 18, 22, 26, 32, 42, 43, 43], [-47, -40, -35, -34, -32, -31, -29, -18, -17, -13, -8, -8, -6, -6, 5, 6, 11, 18, 22, 23, 24, 27, 28, 30, 33, 34, 45, 47, 49], [-46, -44, -41, -38, -37, -34, -30, -19, -17, -14, -14, -13, -12, -7, 1, 9, 10, 11, 11, 12, 15, 17, 20, 20, 23, 29, 29, 32, 42]], [[-33, 6], [-16, 18]], [[-48, -48, -45, -44, -43, -41, -39, -37, -36, -35, -34, -32, -29, -29, -27, -27, -27, -26, -16, -13, -11, -10, -8, -5, -3, -3, 5, 6, 13, 14, 16, 24, 26, 32, 44, 49], [-48, -45, -45, -39, -39, -30, -25, -23, -21, -21, -20, -16, -15, -13, -10, -1, 0, 2, 3, 3, 8, 8, 11, 19, 22, 22, 27, 31, 34, 35, 36, 38, 40, 40, 44, 48], [-43, -43, -42, -41, -40, -34, -32, -28, -26, -24, -23, -23, -21, -19, -18, -18, -8, -8, -8, -7, -4, -3, 5, 5, 9, 18, 20, 24, 25, 28, 28, 32, 32, 33, 36, 46], [-49, -48, -46, -42, -39, -33, -32, -30, -26, -19, -17, -16, -16, -13, -12, -11, -4, -3, 0, 6, 8, 19, 26, 26, 32, 33, 37, 39, 39, 39, 41, 42, 42, 47, 47, 48], [-46, -46, -44, -42, -40, -40, -38, -38, -33, -31, -24, -23, -22, -21, -21, -15, -6, -3, -2, 7, 9, 10, 14, 15, 17, 17, 20, 20, 24, 25, 29, 31, 32, 33, 46, 47], [-48, -44, -43, -43, -40, -35, -25, -13, -13, -12, -9, -5, -3, 0, 4, 5, 5, 7, 10, 18, 19, 22, 23, 27, 27, 27, 29, 30, 30, 30, 36, 40, 42, 43, 44, 45], [-48, -45, -44, -43, -36, -34, -31, -28, -28, -27, -26, -26, -24, -18, -15, -15, -14, -7, -3, -2, 2, 3, 6, 13, 13, 15, 19, 22, 26, 35, 36, 37, 40, 40, 47, 49], [-49, -49, -46, -46, -44, -44, -44, -34, -28, -24, -21, -20, -19, -19, -11, -10, -4, 1, 1, 8, 8, 11, 18, 21, 24, 29, 31, 32, 35, 39, 39, 43, 43, 43, 44, 46], [-48, -42, -36, -34, -30, -29, -27, -23, -15, -11, -11, -5, -5, -5, -4, -1, -1, 0, 1, 5, 5, 7, 14, 17, 23, 23, 23, 23, 26, 36, 37, 39, 41, 42, 46, 49], [-46, -43, -43, -42, -42, -42, -41, -39, -38, -29, -24, -24, -22, -22, -21, -14, -11, -9, -3, 1, 2, 6, 9, 10, 12, 13, 15, 15, 25, 26, 27, 36, 37, 40, 43, 49], [-45, -41, -41, -37, -36, -32, -31, -31, -31, -23, -21, -14, -9, -8, -6, -3, -2, 2, 4, 13, 13, 14, 20, 21, 24, 26, 27, 28, 31, 32, 32, 37, 38, 43, 44, 44], [-49, -47, -38, -37, -36, -31, -25, -24, -15, -15, -14, -8, -6, -4, -3, -1, 0, 0, 3, 5, 5, 11, 11, 23, 24, 25, 26, 27, 27, 31, 37, 39, 40, 48, 49, 49], [-49, -44, -41, -31, -31, -28, -21, -20, -17, -9, -4, -1, 0, 4, 6, 7, 12, 15, 15, 16, 16, 16, 17, 17, 21, 22, 22, 23, 25, 27, 31, 32, 33, 39, 40, 44], [-49, -48, -48, -38, -29, -26, -25, -25, -18, -16, -15, -15, -15, -14, -1, 0, 2, 7, 11, 13, 18, 19, 24, 24, 25, 29, 31, 31, 32, 33, 35, 38, 48, 48, 48, 49], [-44, -43, -43, -31, -31, -30, -21, -20, -20, -19, -15, -9, -6, -5, -2, 3, 3, 3, 6, 8, 8, 13, 13, 19, 20, 23, 24, 25, 31, 34, 35, 43, 43, 43, 47, 48], [-48, -45, -45, -35, -27, -24, -21, -16, -15, -15, -13, -11, -10, -5, 0, 0, 1, 2, 6, 6, 9, 9, 10, 12, 12, 13, 14, 17, 20, 26, 28, 28, 29, 30, 33, 35], [-48, -47, -45, -37, -35, -32, -32, -31, -29, -25, -24, -20, -19, -15, -10, -7, -1, 2, 2, 2, 4, 7, 8, 10, 14, 17, 17, 19, 19, 24, 31, 35, 41, 46, 47, 47], [-47, -45, -43, -39, -37, -37, -36, -27, -27, -27, -26, -13, -12, -10, -8, -2, -1, 1, 3, 4, 4, 8, 10, 18, 25, 29, 30, 31, 31, 33, 36, 41, 43, 46, 46, 49], [-49, -42, -37, -33, -27, -20, -19, -19, -17, -13, -12, -12, -10, -9, -9, -6, -6, -1, 14, 16, 20, 21, 24, 25, 25, 26, 27, 30, 30, 31, 33, 40, 43, 43, 46, 46], [-48, -43, -42, -41, -38, -36, -27, -26, -13, -11, -11, -8, -3, 2, 2, 4, 5, 6, 10, 14, 15, 16, 22, 25, 26, 28, 29, 30, 30, 35, 37, 41, 41, 45, 48, 49], [-47, -39, -35, -27, -19, -14, -14, -12, -7, -7, -6, -2, -2, 1, 3, 6, 12, 13, 13, 14, 14, 14, 15, 17, 19, 20, 22, 24, 25, 29, 33, 34, 34, 39, 42, 49], [-47, -47, -42, -37, -36, -36, -34, -26, -22, -21, -16, -15, -14, -13, -11, 0, 0, 0, 5, 10, 14, 18, 18, 21, 22, 25, 26, 26, 29, 30, 32, 33, 37, 38, 41, 45], [-48, -47, -44, -41, -38, -28, -27, -21, -21, -17, -16, -16, -16, -15, -14, -7, -3, 2, 4, 4, 4, 5, 6, 11, 15, 16, 18, 19, 22, 26, 28, 30, 32, 36, 39, 47], [-49, -42, -41, -39, -38, -32, -30, -28, -23, -22, -17, -15, -14, -12, -7, -4, -2, 0, 1, 6, 7, 9, 13, 13, 13, 16, 19, 20, 21, 24, 25, 26, 27, 29, 31, 31], [-49, -48, -47, -46, -41, -41, -39, -39, -38, -34, -33, -27, -26, -20, -19, -16, -13, -12, -12, -9, -8, -2, -2, -1, 0, 8, 10, 15, 20, 21, 22, 32, 32, 36, 38, 40], [-43, -42, -41, -37, -35, -33, -30, -25, -24, -24, -22, -22, -21, -15, -14, -10, -9, -7, -4, -1, 9, 11, 11, 12, 16, 17, 23, 23, 24, 26, 33, 35, 36, 39, 39, 45], [-41, -40, -39, -34, -32, -30, -29, -26, -25, -23, -22, -20, -19, -19, -13, -12, -8, -7, -7, -6, -6, -6, 0, 0, 0, 4, 7, 8, 13, 18, 34, 39, 41, 44, 48, 48], [-49, -49, -47, -45, -38, -34, -27, -23, -23, -23, -21, -20, -20, -19, -10, -5, -4, 1, 9, 11, 16, 19, 19, 19, 21, 21, 24, 25, 27, 29, 32, 33, 34, 43, 47, 49], [-46, -42, -36, -35, -35, -32, -29, -27, -27, -26, -23, -23, -23, -22, -18, -14, -12, -9, -7, -4, -4, 11, 16, 17, 17, 19, 19, 19, 21, 23, 27, 32, 38, 38, 45, 49], [-48, -42, -42, -42, -40, -39, -34, -34, -32, -25, -18, -12, -11, -9, -8, -8, 0, 2, 4, 9, 12, 13, 13, 14, 19, 22, 25, 25, 27, 28, 31, 32, 38, 38, 39, 39], [-46, -46, -45, -42, -41, -41, -41, -31, -31, -31, -29, -27, -25, -18, -9, -9, -8, -3, -2, -2, 4, 5, 9, 14, 14, 20, 25, 29, 30, 34, 40, 42, 44, 48, 49, 49], [-49, -49, -45, -44, -43, -43, -39, -36, -28, -20, -19, -18, -16, -14, -8, -7, -7, -6, -1, 1, 1, 3, 3, 4, 5, 16, 18, 19, 22, 30, 35, 38, 40, 46, 46, 47], [-48, -37, -36, -35, -32, -29, -27, -23, -22, -22, -16, -15, -14, -14, -9, -8, -6, 3, 5, 8, 9, 9, 12, 14, 15, 16, 22, 26, 29, 29, 37, 38, 44, 48, 48, 49], [-47, -46, -46, -42, -42, -41, -40, -39, -34, -33, -32, -30, -23, -23, -21, -20, -16, -14, -13, -12, -7, -1, 0, 6, 7, 7, 13, 17, 17, 18, 25, 25, 27, 28, 40, 45], [-47, -47, -47, -34, -33, -33, -28, -8, -5, 0, 1, 1, 1, 8, 9, 11, 12, 15, 15, 17, 17, 18, 23, 26, 28, 29, 30, 32, 35, 35, 39, 40, 40, 41, 43, 49], [-49, -46, -42, -35, -35, -35, -33, -33, -30, -17, -16, -14, -14, -13, -11, -4, -4, -3, 7, 7, 12, 13, 16, 16, 16, 18, 28, 30, 36, 37, 38, 41, 41, 43, 47, 49]], [[5, 11, 41, 46], [-32, -25, -2, 10], [4, 22, 34, 44], [-40, -27, 12, 29]], [[-43, -38, -33, -18, -1, 7, 7, 9, 11, 14, 15, 18, 27, 45], [-43, -29, -27, -23, -14, -13, -12, -7, -3, 2, 19, 26, 29, 32], [-46, -43, -42, -27, -13, 2, 5, 7, 23, 25, 28, 38, 45, 49], [-49, -45, -23, -20, -5, -1, 21, 25, 28, 36, 39, 39, 41, 46], [-45, -42, -31, -29, -17, 3, 14, 15, 24, 36, 38, 40, 40, 45], [-36, -31, -27, -21, -11, -2, 10, 16, 18, 18, 33, 46, 47, 47], [-49, -44, -32, -14, -10, 3, 13, 22, 25, 35, 37, 42, 44, 48], [-48, -26, -26, -19, -16, -12, -5, -4, 0, 9, 26, 26, 40, 40], [-49, -47, -46, -40, 8, 15, 15, 18, 19, 23, 32, 35, 45, 48], [-31, -31, -29, -11, -6, 2, 14, 20, 23, 33, 35, 43, 46, 47], [-46, -37, -36, -36, -13, -2, -1, 4, 7, 14, 26, 27, 32, 43], [-48, -43, -38, -31, -31, -27, -20, -17, -9, 16, 17, 34, 35, 45], [-44, -38, -25, -15, -12, -1, 3, 11, 21, 27, 30, 36, 44, 47], [-48, -43, -43, -37, -37, -31, -26, -24, -18, -11, -3, -2, -2, 29]], [[-37, -29, -26, -3, 2, 6, 8, 14, 28, 42], [-44, -43, -36, -27, -11, 0, 18, 25, 38, 47], [-33, -3, 2, 11, 13, 15, 16, 17, 24, 28], [-39, -34, -5, -3, 0, 11, 32, 33, 44, 44], [-47, -23, 2, 8, 12, 31, 32, 33, 35, 41], [-45, -34, -10, -3, 15, 26, 38, 40, 41, 44], [-45, -36, -32, -12, -11, -8, 13, 22, 33, 39], [-42, -36, -32, -27, -27, -15, 17, 19, 30, 39], [-42, -24, -23, -12, -10, -5, 23, 33, 33, 40], [-49, -39, -26, -14, 0, 2, 28, 32, 37, 40]], [[-47, -44, -44, -33, -32, -28, -26, -22, -21, -21, -20, -15, -13, -11, -7, -5, 3, 6, 22, 25, 27, 31, 39, 42, 47, 48], [-44, -39, -29, -23, -21, -16, -15, -13, -7, -7, -6, -4, -3, -1, 0, 2, 3, 6, 10, 13, 13, 28, 32, 33, 34, 39], [-48, -43, -42, -40, -33, -33, -33, -23, -22, -16, -14, -13, -12, -11, -9, -9, -3, 4, 8, 9, 15, 20, 24, 36, 42, 45], [-41, -40, -34, -34, -31, -31, -31, -29, -22, -18, -16, -12, -8, -5, -3, 3, 7, 16, 16, 18, 18, 20, 25, 29, 30, 45], [-48, -47, -43, -41, -37, -36, -34, -34, -23, -6, -1, 2, 5, 9, 9, 17, 20, 21, 23, 30, 31, 34, 38, 43, 44, 46], [-44, -41, -39, -36, -32, -29, -20, -12, -7, 2, 2, 4, 4, 5, 11, 13, 14, 18, 22, 23, 24, 27, 32, 34, 44, 49], [-47, -34, -33, -29, -28, -27, -22, -9, -8, -3, 3, 4, 6, 7, 10, 11, 13, 15, 19, 27, 37, 42, 43, 45, 46, 47], [-43, -37, -31, -31, -29, -27, -25, -24, -14, -12, -6, -2, -2, 1, 8, 21, 23, 26, 26, 28, 30, 31, 39, 39, 49, 49], [-48, -40, -37, -34, -34, -26, -21, -19, -17, -15, -12, -4, 3, 5, 5, 6, 15, 23, 27, 28, 29, 36, 42, 45, 47, 49], [-47, -46, -45, -38, -37, -37, -36, -26, -25, -12, -8, -1, 0, 4, 9, 9, 19, 24, 26, 28, 29, 30, 36, 39, 43, 44], [-48, -48, -46, -43, -33, -25, -22, -21, -21, -17, -15, -13, -13, -11, -5, -3, 1, 4, 11, 13, 16, 16, 24, 30, 38, 41], [-48, -41, -40, -38, -38, -27, -27, -24, -15, -13, -11, -2, 4, 7, 11, 16, 17, 18, 27, 28, 28, 30, 32, 36, 45, 48], [-47, -42, -41, -32, -31, -24, -24, -22, -18, -16, -14, -14, -11, -8, 3, 4, 10, 12, 20, 21, 22, 25, 29, 34, 37, 47], [-49, -49, -44, -42, -38, -34, -29, -26, -24, -24, -19, -14, -7, -4, -1, 3, 8, 12, 14, 15, 24, 28, 34, 36, 42, 46], [-46, -38, -34, -32, -30, -29, -28, -19, -14, -8, -3, 8, 14, 17, 20, 20, 20, 22, 23, 24, 24, 29, 36, 42, 45, 46], [-49, -47, -46, -35, -32, -28, -28, -24, -24, -23, -14, -11, -10, -9, -8, -7, -5, 4, 14, 22, 24, 29, 31, 37, 46, 48], [-49, -47, -45, -43, -41, -38, -38, -35, -32, -29, -27, -15, -14, -13, -2, 2, 12, 13, 13, 19, 21, 22, 25, 26, 30, 30], [-47, -47, -38, -35, -35, -34, -33, -30, -29, -22, -21, -15, -14, -10, -8, -4, 4, 10, 15, 25, 26, 27, 31, 32, 36, 48], [-45, -43, -42, -41, -40, -30, -25, -24, -18, -18, -16, -10, -10, -8, -6, -1, 9, 15, 23, 25, 26, 28, 32, 34, 42, 43], [-48, -38, -34, -32, -31, -27, -27, -26, -23, -16, -11, -10, -9, -7, -6, -1, -1, 2, 12, 13, 17, 19, 23, 31, 37, 45], [-42, -25, -19, -18, -12, -12, -10, 0, 2, 4, 6, 6, 19, 28, 31, 37, 37, 38, 39, 40, 40, 40, 41, 42, 48, 49], [-48, -45, -41, -37, -36, -35, -34, -33, -29, -18, -18, -13, -11, -10, 4, 5, 5, 14, 23, 28, 29, 29, 29, 31, 32, 35], [-47, -42, -31, -22, -19, -14, -12, -8, -8, 1, 2, 3, 8, 13, 18, 19, 27, 29, 31, 39, 42, 43, 48, 49, 49, 49], [-45, -43, -22, -20, -16, -16, -3, 0, 0, 4, 6, 13, 13, 14, 19, 23, 23, 32, 34, 37, 37, 39, 40, 43, 44, 47], [-49, -36, -29, -27, -26, -25, -19, -14, -12, -11, -10, -7, -6, -3, -1, 0, 1, 6, 10, 16, 18, 23, 24, 38, 46, 48], [-47, -45, -39, -34, -29, -23, -17, -11, -10, -8, -7, -7, -5, 2, 2, 7, 14, 17, 17, 26, 29, 31, 31, 33, 34, 49]], [[-48, -47, -44, -39, -37, -35, -28, -12, -7, -7, -5, 2, 8, 9, 15, 27], [-34, -25, -25, -23, -17, -9, -6, 4, 8, 16, 19, 36, 36, 44, 45, 46], [-47, -26, -20, -12, -6, 0, 8, 9, 13, 17, 22, 24, 29, 29, 38, 38], [-44, -36, -34, -32, -30, -27, -26, -21, -10, 9, 16, 27, 28, 31, 36, 40], [-23, -20, -16, -15, -9, -2, 0, 0, 4, 12, 14, 20, 22, 33, 35, 41], [-44, -43, -41, -39, -36, -27, -20, -13, -13, -5, 3, 28, 30, 31, 36, 40], [-47, -37, -33, -33, -2, -1, 10, 16, 20, 25, 25, 35, 40, 44, 45, 46], [-49, -47, -45, -42, -41, -37, -32, -31, -15, -14, 0, 21, 26, 27, 34, 47], [-43, -43, -34, -33, -31, -25, -24, -17, -5, -1, 15, 23, 24, 34, 40, 46], [-48, -42, -34, -34, -27, -26, -19, -11, -7, 8, 19, 22, 23, 34, 35, 42], [-49, -43, -39, -15, -8, -4, -3, -2, 16, 20, 21, 22, 22, 30, 32, 34], [-49, -46, -40, -31, -28, -19, -15, -12, -10, -8, 5, 8, 37, 42, 42, 43], [-48, -35, -22, -20, -16, -15, -11, -9, -6, 2, 17, 18, 29, 38, 46, 49], [-39, -34, -25, -24, -11, -9, 2, 9, 14, 18, 21, 26, 29, 34, 39, 47], [-41, -31, -19, -12, -9, -6, 1, 10, 11, 16, 22, 24, 26, 27, 35, 43], [-42, -32, -32, -31, -18, -13, -5, 3, 5, 13, 20, 26, 28, 42, 43, 47]], [[-47, -46, -43, -40, -39, -36, -31, -30, -28, -26, -23, -9, -5, -5, -4, 4, 5, 9, 15, 34, 35, 38, 38, 39, 42, 42, 45, 47, 48], [-47, -46, -46, -43, -34, -31, -31, -29, -27, -24, -23, -19, -15, -12, -11, -11, -2, 0, 4, 10, 19, 19, 28, 28, 40, 42, 45, 45, 47], [-48, -47, -42, -41, -41, -27, -26, -23, -21, -19, -16, -13, -2, 0, 1, 6, 18, 20, 20, 24, 28, 29, 29, 36, 42, 46, 48, 49, 49], [-48, -43, -43, -37, -33, -33, -25, -20, -19, -19, -18, -8, -5, -4, -3, -2, 3, 4, 5, 9, 9, 9, 12, 13, 13, 23, 39, 43, 45], [-45, -43, -42, -34, -34, -26, -24, -17, -15, -12, -7, -4, -3, -1, 3, 12, 14, 16, 20, 21, 21, 23, 27, 33, 37, 46, 46, 47, 47], [-48, -44, -41, -38, -23, -18, -14, -14, -7, -7, -5, -4, 1, 3, 4, 4, 9, 14, 15, 16, 23, 25, 28, 29, 30, 34, 35, 38, 38], [-47, -46, -45, -44, -40, -38, -34, -33, -12, -9, -6, 2, 6, 9, 10, 11, 11, 13, 14, 28, 30, 30, 31, 33, 35, 36, 41, 41, 41], [-45, -44, -42, -39, -38, -37, -33, -29, -29, -25, -18, -8, 1, 8, 8, 9, 10, 10, 10, 13, 18, 19, 20, 25, 29, 33, 42, 42, 43], [-49, -47, -47, -46, -41, -39, -36, -36, -32, -29, -29, -15, -8, -7, 2, 4, 6, 10, 14, 16, 21, 26, 27, 27, 34, 42, 42, 47, 49], [-49, -48, -42, -41, -34, -33, -25, -24, -22, -20, -14, -14, -13, -10, -8, -6, -5, -5, -4, -2, 0, 3, 6, 11, 23, 35, 40, 44, 45], [-44, -40, -33, -28, -28, -24, -22, -22, -21, -18, -18, -13, -10, -10, -8, -7, -5, 1, 3, 3, 6, 8, 20, 20, 25, 31, 33, 40, 40], [-47, -47, -45, -44, -38, -33, -33, -30, -28, -15, -14, -13, -8, -5, -4, -3, 1, 2, 9, 9, 13, 20, 25, 36, 37, 38, 43, 43, 48], [-48, -45, -44, -38, -37, -37, -34, -30, -28, -23, -23, -17, -16, -15, -6, 1, 3, 5, 9, 10, 10, 16, 16, 26, 28, 31, 32, 44, 47], [-44, -43, -41, -33, -30, -27, -27, -26, -23, -22, -22, -16, -15, -9, -3, -2, -1, 5, 9, 9, 13, 16, 21, 29, 33, 39, 39, 47, 47], [-48, -38, -36, -32, -28, -28, -27, -23, -21, -21, -16, -6, -4, -2, 4, 10, 13, 15, 19, 21, 25, 26, 26, 30, 31, 38, 40, 48, 48], [-48, -46, -43, -41, -37, -36, -32, -31, -25, -12, -11, -11, -7, -7, -5, 1, 12, 16, 19, 21, 27, 31, 32, 33, 34, 41, 44, 46, 48], [-42, -42, -41, -31, -27, -24, -22, -21, -8, -7, -1, 0, 2, 2, 4, 6, 8, 13, 20, 21, 21, 24, 28, 31, 36, 39, 41, 45, 46], [-48, -47, -46, -41, -34, -26, -25, -24, -23, -18, -13, -8, -4, -4, -2, 5, 5, 11, 12, 13, 14, 20, 23, 25, 29, 34, 36, 38, 39], [-45, -45, -40, -38, -38, -36, -33, -27, -25, -24, -24, -22, -16, -14, -13, -8, -5, -3, 3, 12, 13, 14, 17, 20, 38, 41, 46, 47, 48], [-44, -43, -37, -34, -33, -21, -20, -20, -19, -19, -18, -17, -15, -11, -10, -6, -5, -4, 0, 2, 4, 6, 23, 24, 31, 32, 35, 44, 49], [-47, -43, -39, -34, -24, -17, -17, -12, -10, -10, -5, -1, 2, 7, 11, 12, 13, 16, 19, 24, 24, 25, 26, 26, 33, 38, 40, 45, 46], [-42, -40, -38, -37, -35, -35, -34, -26, -24, -22, -10, -6, -2, 2, 3, 10, 11, 12, 16, 17, 27, 28, 29, 31, 32, 33, 34, 44, 49], [-47, -43, -42, -30, -26, -26, -26, -24, -22, -22, -18, -13, -9, -8, -7, -2, -2, 1, 5, 6, 14, 15, 18, 19, 24, 26, 46, 48, 48], [-48, -45, -41, -30, -23, -22, -21, -17, -16, -14, -13, -7, -5, -2, -1, 4, 6, 8, 14, 19, 30, 31, 33, 34, 34, 40, 43, 49, 49], [-49, -46, -45, -44, -38, -37, -36, -35, -31, -30, -28, -28, -26, -25, -15, -13, -8, -4, 4, 4, 10, 20, 24, 27, 30, 30, 30, 37, 48], [-47, -46, -44, -44, -42, -41, -40, -30, -29, -29, -27, -23, -17, -12, -10, -9, 7, 12, 19, 22, 30, 38, 40, 41, 43, 43, 46, 49, 49], [-47, -44, -37, -37, -29, -27, -25, -20, -17, -14, -14, -13, -6, -1, -1, 1, 6, 7, 8, 8, 12, 18, 18, 22, 28, 29, 37, 42, 45], [-46, -45, -43, -42, -41, -34, -31, -23, -20, -15, -15, -11, -7, -2, 1, 1, 9, 10, 12, 21, 22, 27, 29, 29, 33, 34, 41, 42, 49], [-47, -45, -41, -39, -31, -29, -28, -23, -22, -15, -14, -14, -8, -8, -3, 5, 5, 8, 9, 11, 12, 16, 20, 25, 32, 32, 36, 38, 49]], [[-43, -41, -38, -35, -34, -32, -30, -30, -30, -25, -25, -18, -16, -12, -9, -7, -5, -2, -1, 1, 2, 5, 10, 12, 12, 17, 22, 23, 23, 28, 33, 37, 40, 43, 47, 48], [-48, -46, -41, -40, -36, -28, -27, -18, -16, -12, -12, -7, -7, -7, -6, -5, 5, 6, 7, 13, 13, 14, 14, 22, 24, 26, 26, 27, 29, 46, 46, 46, 47, 47, 48, 49], [-47, -47, -46, -44, -40, -38, -37, -35, -35, -34, -30, -16, -7, -6, -6, -3, -2, -1, 3, 4, 8, 13, 13, 16, 17, 20, 21, 21, 31, 31, 33, 33, 42, 43, 44, 47], [-48, -45, -39, -30, -29, -29, -29, -24, -21, -20, -16, -14, -13, -13, -10, -10, -4, -4, -3, -1, 6, 9, 10, 11, 11, 13, 14, 14, 16, 17, 24, 25, 34, 35, 41, 48], [-45, -39, -36, -33, -32, -31, -30, -26, -26, -17, -17, -15, -14, -13, -11, -11, -6, -5, 1, 2, 5, 6, 13, 15, 18, 23, 26, 32, 35, 35, 36, 42, 44, 47, 47, 49], [-44, -43, -40, -39, -38, -37, -35, -30, -24, -24, -15, -15, -15, -14, -11, -4, -4, 1, 1, 4, 4, 10, 13, 16, 17, 17, 23, 29, 35, 35, 37, 38, 41, 44, 45, 47], [-46, -46, -46, -43, -43, -38, -35, -30, -26, -23, -21, -18, -16, -6, -6, -6, -5, -4, -3, -1, -1, 4, 8, 10, 13, 18, 20, 22, 27, 27, 28, 39, 42, 43, 46, 49], [-48, -41, -34, -31, -26, -21, -21, -2, -1, 3, 5, 5, 5, 10, 12, 14, 15, 15, 18, 19, 21, 29, 31, 33, 35, 37, 38, 38, 39, 43, 43, 45, 45, 47, 48, 49], [-44, -43, -41, -35, -30, -28, -28, -28, -19, -18, -15, -12, -5, -4, -2, 2, 2, 4, 4, 6, 10, 12, 14, 16, 16, 21, 26, 26, 27, 27, 30, 31, 32, 38, 39, 39], [-43, -42, -40, -39, -39, -37, -36, -31, -30, -28, -28, -27, -27, -24, -23, -20, -15, -5, 1, 1, 10, 12, 14, 14, 16, 16, 28, 30, 31, 32, 37, 42, 44, 44, 45, 49], [-45, -39, -36, -36, -36, -35, -33, -33, -22, -19, -17, -14, -14, -4, -3, -1, 10, 12, 14, 16, 17, 19, 22, 22, 24, 26, 27, 28, 31, 38, 39, 40, 48, 48, 49, 49], [-43, -39, -38, -34, -32, -29, -28, -25, -24, -15, -12, -10, -9, -7, -2, -2, 0, 3, 3, 5, 5, 11, 11, 18, 19, 20, 20, 20, 27, 28, 36, 39, 40, 41, 43, 45], [-49, -43, -41, -36, -34, -33, -30, -26, -23, -23, -23, -22, -13, -8, -4, -3, -1, 2, 6, 13, 17, 18, 20, 23, 23, 31, 31, 33, 34, 36, 37, 39, 41, 43, 44, 46], [-46, -46, -45, -44, -42, -38, -35, -32, -28, -28, -26, -21, -20, -16, -13, -12, -12, -8, -3, 1, 2, 4, 5, 5, 13, 16, 18, 18, 19, 22, 25, 33, 34, 38, 41, 44], [-49, -49, -49, -47, -46, -37, -34, -31, -30, -25, -22, -18, -17, -13, -13, -12, -7, -5, -4, -3, -2, -2, 1, 4, 12, 12, 24, 30, 30, 30, 33, 38, 43, 44, 45, 49], [-44, -43, -39, -39, -38, -37, -35, -34, -34, -26, -17, -14, -12, -8, -6, -2, 1, 6, 6, 8, 13, 16, 16, 19, 22, 22, 26, 26, 30, 34, 38, 39, 42, 43, 45, 49], [-48, -46, -44, -42, -36, -35, -32, -31, -28, -25, -23, -22, -18, -18, -18, -16, -15, -1, 1, 2, 2, 4, 4, 6, 9, 9, 10, 13, 14, 14, 18, 23, 43, 45, 47, 49], [-48, -43, -41, -41, -36, -35, -34, -16, -14, -13, -7, -5, -5, -3, 2, 2, 3, 8, 9, 9, 10, 20, 20, 22, 22, 24, 25, 26, 33, 36, 38, 42, 43, 43, 44, 44], [-48, -46, -45, -40, -36, -33, -30, -29, -29, -28, -27, -26, -24, -24, -24, -22, -17, -16, -11, -6, -1, 1, 3, 8, 9, 11, 14, 14, 23, 24, 25, 26, 27, 41, 45, 49], [-49, -42, -31, -30, -30, -30, -28, -27, -26, -18, -14, -13, -10, -7, -6, 3, 4, 7, 12, 14, 16, 19, 20, 22, 25, 26, 27, 28, 30, 30, 32, 39, 43, 44, 44, 45], [-49, -48, -46, -44, -44, -43, -40, -40, -40, -37, -33, -27, -23, -17, -14, -7, -5, -2, 8, 9, 11, 13, 13, 15, 20, 26, 30, 30, 33, 35, 35, 39, 40, 41, 42, 43], [-38, -36, -36, -35, -35, -28, -26, -22, -20, -18, -18, -16, -16, -15, -14, -14, -13, -12, -11, -7, -6, -4, 1, 3, 6, 8, 12, 16, 18, 22, 22, 36, 37, 40, 45, 49], [-49, -46, -43, -43, -40, -38, -32, -32, -31, -30, -28, -26, -25, -16, -16, -15, -14, -14, -13, -11, -6, -5, -4, 0, 3, 6, 21, 37, 37, 38, 39, 40, 42, 45, 45, 47], [-49, -40, -37, -35, -34, -34, -33, -31, -28, -22, -19, -19, -18, -18, -16, -12, -12, -11, -8, -8, -2, -1, 8, 10, 18, 21, 23, 25, 26, 34, 38, 42, 42, 44, 44, 47], [-48, -46, -39, -38, -34, -22, -19, -14, -10, -9, -5, 2, 3, 7, 7, 7, 7, 9, 11, 15, 20, 24, 26, 27, 28, 28, 28, 29, 30, 30, 30, 33, 37, 38, 38, 47], [-49, -44, -43, -42, -37, -36, -31, -31, -20, -19, -17, -14, -11, -10, -9, -7, -3, -3, -2, -2, -1, 5, 7, 14, 14, 16, 18, 20, 23, 23, 30, 31, 38, 43, 45, 47], [-49, -44, -44, -38, -37, -32, -32, -31, -31, -29, -29, -22, -20, -19, -19, -16, -9, -7, 1, 3, 4, 5, 5, 13, 15, 17, 21, 21, 29, 35, 35, 39, 40, 41, 44, 45], [-48, -46, -43, -43, -40, -40, -38, -38, -32, -29, -26, -19, -18, -17, -14, -13, -9, -7, -5, -2, 1, 3, 4, 8, 10, 15, 17, 18, 26, 27, 30, 32, 33, 36, 43, 46], [-47, -45, -41, -40, -39, -39, -38, -29, -26, -24, -21, -21, -17, -15, -9, -8, -7, -3, -2, 6, 6, 7, 8, 10, 11, 11, 17, 23, 26, 27, 28, 29, 33, 34, 36, 42], [-49, -49, -49, -42, -41, -33, -33, -32, -29, -26, -24, -23, -21, -20, -17, -17, -13, -13, -9, -2, -2, -1, 1, 4, 7, 11, 11, 12, 22, 24, 24, 36, 37, 41, 41, 43], [-45, -39, -36, -33, -33, -31, -29, -24, -23, -23, -21, -20, -8, -8, -7, -5, -2, 1, 4, 8, 8, 11, 13, 14, 14, 14, 16, 16, 17, 19, 22, 27, 28, 34, 37, 38], [-49, -48, -47, -41, -41, -38, -38, -35, -34, -27, -26, -26, -19, -17, -5, -2, -2, -1, 1, 4, 5, 5, 6, 9, 11, 12, 16, 29, 33, 34, 36, 42, 42, 43, 43, 47], [-46, -45, -44, -41, -35, -35, -28, -25, -24, -14, -13, -11, -11, -7, -4, -4, 2, 4, 5, 6, 7, 7, 8, 11, 13, 16, 16, 20, 25, 27, 35, 36, 37, 39, 43, 48], [-48, -41, -40, -38, -37, -32, -24, -20, -19, -15, -7, -5, -1, 0, 3, 7, 8, 15, 18, 25, 25, 26, 27, 28, 31, 33, 37, 38, 38, 39, 43, 43, 47, 48, 48, 49], [-49, -39, -37, -35, -28, -23, -22, -21, -20, -17, -16, -11, -8, -2, -1, 2, 3, 3, 7, 8, 9, 10, 14, 19, 23, 23, 26, 28, 28, 35, 40, 41, 44, 45, 47, 48], [-48, -44, -40, -38, -37, -30, -27, -26, -24, -23, -23, -22, -22, -20, -16, -16, -12, 0, 0, 1, 2, 5, 8, 16, 22, 22, 27, 27, 32, 35, 39, 39, 44, 46, 46, 49]]]; int [] param1 = [27, 1, 35, 3, 13, 8, 18, 11, 16, 27]; int [] param2 = [27, 1, 28, 2, 13, 8, 15, 11, 15, 25]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] == arr [ j ] ) ans ++ ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 0, 0, 0, 0, 16, 0, 0, 61, 3]; int [] [] param0 = [[4, 6, 9, 16, 16, 21, 36, 41, 58, 60, 62, 73, 77, 81, 95], [-86, -72, -26, -34, 18, -62, -66], [1], [16], [-88, -80, -72, -68, -64, -26, 4, 14, 16, 22, 30, 32, 60, 74, 82], [0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1], [3, 9, 10, 12, 17, 23, 27, 29, 42, 44, 59, 61, 71, 76, 78, 82, 84, 84, 89, 90, 93, 93, 97, 97], [68, -40, -46, -20, -64, 90], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [99, 17, 94, 43, 97, 17, 11, 58, 75, 94, 37, 22, 54, 31, 41, 4, 55, 69, 92, 80, 45, 97, 16, 33, 36, 17, 43, 82, 81, 64, 22, 65, 85, 44, 47, 14]]; int [] param1 = [12, 3, 0, 0, 11, 9, 15, 5, 15, 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); } " PROGRAM_BINARY_DECIMAL_CONVERSION_1,"static int f_filled ( String n ) { String num = n ; int dec_value = 0 ; int base = 1 ; int len = num . length ( ) ; for ( int i = len - 1 ; i >= 0 ; i -- ) { if ( num . charAt ( i ) == '1' ) dec_value += base ; base = base * 2 ; } return dec_value ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 20, 154, 0, 130, 61, 0, 0, 1, 0]; string [] param0 = [""uemiagf"", ""753310137"", ""010011010"", ""kni"", ""04562016903312"", ""000111101"", ""bk"", ""9"", ""1"", ""xxt nxllk""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_INDEX_PAIRS_EQUAL_ELEMENTS_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > hm = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hm . containsKey ( arr [ i ] ) ) hm . put ( arr [ i ] , hm . get ( arr [ i ] ) + 1 ) ; else hm . put ( arr [ i ] , 1 ) ; } int ans = 0 ; for ( Map . Entry < Integer , Integer > it : hm . entrySet ( ) ) { int count = it . getValue ( ) ; ans += ( count * ( count - 1 ) ) / 2 ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 2, 56, 0, 4, 0, 2, 2, 211, 0]; int [] [] param0 = [[5, 11, 18, 22, 40, 46, 50, 51, 53, 55, 64, 67, 73, 78, 86], [14, -98, 98, 58, -82, 90, -80, -56, -30, -36, -56, -30, -58, 68, 72, -76, 38, -90, -72, 4, -32, 32, -28, 2, 12, -72, 54, 2, 0, -74, 8, 12, 46, 72, -84, -66, 70, 18, 26, 72, -26, 44, -8, 20, -32, -56, 28], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [93, 23, 62, 64, 31, 78, 99], [-94, -94, -92, -86, -84, -76, -76, -68, -66, -56, -56, -54, -50, -46, -38, -34, -34, -30, -26, -18, -16, 2, 8, 42, 52, 54, 56, 64, 68, 82, 82, 82, 94, 96, 98], [0], [3, 18, 18, 20, 21, 23, 24, 27, 35, 36, 38, 40, 46, 50, 50, 51, 52, 53, 59, 61, 63, 63, 65, 66, 68, 68, 70, 71, 74, 75, 96, 98], [-68, 40, 16, 50, 36, 42, -20, -46, -92, 4, -18, -12, 48, 0, -46, 64, -74, -50, 42, 44, -56, 28, -10, 78, 62, 70, -60, 12, -44, -78], [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], [31, 5]]; int [] param1 = [14, 24, 13, 4, 19, 0, 19, 23, 30, 1]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_WHETHER_GIVEN_INTEGER_POWER_3_NOT,"static boolean f_filled ( int n ) { return 1162261467 % n == 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, false, false, false, false, false]; int [] param0 = [1, 3, 27, 9, -9, 11, 57, 21, 60, 44]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PIZZA_CUT_PROBLEM_CIRCLE_DIVISION_LINES,"static int f_filled ( int n ) { return 1 + n * ( n + 1 ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1082, 2347, 11, 79, 1597, 106, 3322, 436, 352, 821]; int [] param0 = [46, 68, 4, 12, 56, 14, 81, 29, 26, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_INVERSIONS_OF_SIZE_THREE_IN_A_GIVE_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { int invcount = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { int small = 0 ; for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] > arr [ j ] ) small ++ ; int great = 0 ; for ( int j = i - 1 ; j >= 0 ; j -- ) if ( arr [ i ] < arr [ j ] ) great ++ ; invcount += great * small ; } return invcount ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 404, 0, 37, 0, 0, 0, 20, 0, 43]; int [] [] param0 = [[4, 75, 89], [84, -66, -52, 34, -28, -6, 20, 22, -78, -26, 14, 24, -92, -18, 32, -94, -64, -38, 56, 4, -10, 58, -66, -58, -10, -8, -62, -60, -26], [0, 0, 0, 1, 1, 1, 1, 1], [18, 7, 43, 57, 94, 37, 38, 41, 59, 64, 97, 29, 51, 37, 64, 91, 42, 83, 13, 22, 68], [-94, -86, -84, -84, -82, -66, -62, -58, -52, -48, -44, -40, -38, -32, -22, -22, -22, -14, -8, -6, -6, 0, 2, 20, 20, 26, 32, 32, 52, 56, 66, 74, 76, 80, 80, 86, 88, 94], [0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0], [4, 8, 15, 19, 24, 31, 33, 36, 38, 45, 45, 52, 54, 65, 73, 75, 83, 84, 90, 92, 93], [80, -30, -44, 76, -96, 2, 22, -30, 36, -6, 88, -60, -90, -52, 78, 90, -52], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [74, 71, 28, 45, 14, 31, 17, 10, 82, 27, 45, 73, 93, 87, 57, 58]]; int [] param1 = [1, 26, 7, 17, 34, 9, 19, 10, 7, 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); } " COUNT_MINIMUM_NUMBER_SUBSETS_SUBSEQUENCES_CONSECUTIVE_NUMBERS,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int count = 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [37, 31, 2, 35, 45, 44, 32, 44, 30, 37]; int [] [] param0 = [[3, 7, 7, 11, 14, 14, 14, 16, 17, 17, 21, 22, 24, 27, 27, 27, 31, 33, 35, 36, 36, 37, 38, 43, 45, 49, 52, 54, 57, 59, 59, 60, 67, 73, 74, 74, 74, 75, 75, 79, 83, 87, 90, 93, 97], [-28, 72, 60, 62, 40, 64, 50, -36, -24, 40, -6, 78, -80, -82, 2, -30, 70, 94, -2, -30, 92, 12, -46, 32, -96, -2, 36, -40, -42, 66, 98], [1, 1], [96, 89, 24, 28, 70, 78, 78, 35, 98, 65, 18, 81, 35, 91, 33, 88, 69, 52, 66, 17, 73, 79, 30, 33, 78, 60, 42, 8, 36, 6, 47, 87, 8, 98, 9, 77, 78, 24, 86, 91, 13, 79, 50, 85, 3, 7, 61, 94, 86], [-92, -92, -90, -84, -78, -66, -60, -60, -46, -42, -38, -32, -24, -20, -18, -16, -14, -10, 0, 4, 6, 12, 24, 32, 34, 44, 48, 50, 50, 64, 66, 68, 80, 84, 86, 86, 88, 90, 90, 90, 92, 94, 96, 98, 98], [0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0], [8, 12, 13, 14, 16, 20, 20, 21, 23, 23, 24, 27, 29, 29, 29, 29, 35, 35, 38, 39, 40, 46, 50, 52, 60, 62, 62, 65, 65, 65, 70, 71, 72, 73, 75, 76, 80, 81, 82, 83, 85, 91, 95, 97, 98, 98], [-84, 92, 70, -46, 26, -94, -82, -26, -90, -62, 52, 62, -58, 44, -14, -6, 58, 2, 10, 76, -34, 42, -26, 80, 26, 32, -82, 38, 2, 72, 68, 44, 24, 84, -32, 54, -96, -8, 36, 80, -82, 32, 98, -68], [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], [64, 10, 6, 3, 67, 95, 72, 96, 72, 30, 99, 21, 46, 23, 48, 38, 48, 50, 53, 91, 59, 58, 27, 95, 63, 20, 27, 22, 58, 3, 11, 75, 77, 64, 46, 1, 67, 79, 6, 46, 57, 79, 49, 83, 21, 36, 44]]; int [] param1 = [45, 31, 2, 49, 45, 45, 46, 44, 31, 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); } " FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT,"static int f_filled ( int n ) { if ( n == 0 ) return 0 ; while ( n != 1 ) { if ( n % 4 != 0 ) return 0 ; n = n / 4 ; } return 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 0, 0, 0, 0, 0, 0, 0, 0]; int [] param0 = [45, 16, 15, 91, 82, 18, 31, 6, 93, 35]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NATURAL_NUMBERS_WHOSE_PERMUTATION_GREATER_NUMBER,"static int f_filled ( int n ) { int result = 0 ; for ( int i = 1 ; i <= 9 ; i ++ ) { Stack < Integer > s = new Stack < > ( ) ; if ( i <= n ) { s . push ( i ) ; result ++ ; } while ( ! s . empty ( ) ) { int tp = s . peek ( ) ; s . pop ( ) ; for ( int j = tp % 10 ; j <= 9 ; j ++ ) { int x = tp * 10 + j ; if ( x <= n ) { s . push ( x ) ; result ++ ; } } } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [48, 48, 52, 7, 45, 28, 20, 31, 27, 18]; int [] param0 = [69, 72, 88, 7, 66, 34, 23, 37, 33, 21]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MINIMUM_COST_FOR_ACQUIRING_ALL_COINS_WITH_K_EXTRA_COINS_ALLOWED_WITH_EVERY_COIN,"static int f_filled ( int coin [ ] , int n , int k ) { Arrays . sort ( coin ) ; int coins_needed = ( int ) Math . ceil ( 1.0 * n / ( k + 1 ) ) ; int ans = 0 ; for ( int i = 0 ; i <= coins_needed - 1 ; i ++ ) ans += coin [ i ] ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, -98, 0, 1, -98, 0, 5, -160, 0, 23]; int [] [] param0 = [[2, 4, 5, 9, 10, 10, 11, 14, 15, 19, 21, 22, 29, 36, 36, 38, 39, 39, 39, 41, 41, 42, 45, 45, 48, 55, 56, 57, 64, 66, 66, 66, 66, 69, 74, 76, 80, 81, 82, 82, 85, 87, 95, 95], [-98, -88, -52, -10, -6, 16, 20, 36, 48, 66, 68, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 4, 5, 6, 10, 11, 15, 24, 29, 32, 35, 43, 48, 49, 62, 71, 78, 91], [-98, -92, -88, -84, -82, -78, -74, -74, -68, -62, -62, -56, -56, -50, -46, -44, -26, -18, -14, -8, -8, -6, 8, 16, 20, 20, 22, 26, 36, 42, 44, 44, 52, 60, 66, 68, 68, 70, 76, 84], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 12, 38, 39, 52, 54, 62, 81, 87, 93], [-84, -76, -74, -70, -40, -32, -32, -26, -24, -18, -18, -12, -10, -8, 0, 4, 8, 16, 40, 40, 44, 60, 70, 86, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [23, 31, 44, 56, 58, 61, 62, 63, 72, 74, 86, 97, 97, 98]]; int [] param1 = [33, 6, 16, 13, 25, 32, 6, 25, 37, 12]; int [] param2 = [27, 10, 16, 17, 34, 32, 8, 20, 29, 13]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NEGATIVE_NUMBERS_IN_A_COLUMN_WISE_ROW_WISE_SORTED_MATRIX,"static int f_filled ( int M [ ] [ ] , int n , int m ) { int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < m ; j ++ ) { if ( M [ i ] [ j ] < 0 ) count += 1 ; else break ; } } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [383, 121, 84, 186, 258, 277, 643, 143, 130, 825]; int [] [] [] param0 = [[[-46, -39, -32, -31, -25, -24, -22, -21, -19, -19, -9, -4, -4, 5, 7, 10, 10, 17, 19, 20, 21, 26, 29, 29, 29, 30, 32, 32, 34, 35, 41, 42, 42, 42, 44], [-49, -49, -48, -46, -44, -37, -36, -36, -26, -17, -12, -8, -8, -5, -5, -3, -1, 0, 2, 5, 6, 8, 10, 10, 18, 19, 19, 20, 21, 30, 31, 31, 32, 34, 48], [-47, -43, -41, -41, -25, -22, -20, -18, -13, -13, -12, -9, -7, -1, 5, 5, 5, 6, 21, 21, 21, 23, 25, 26, 26, 26, 34, 39, 39, 41, 42, 44, 44, 47, 49], [-48, -38, -38, -36, -35, -34, -32, -32, -24, -22, -22, -19, -18, -16, -12, -9, -4, -4, -2, -1, 1, 4, 7, 14, 14, 16, 21, 27, 30, 31, 32, 37, 38, 38, 44], [-49, -40, -39, -38, -22, -22, -19, -17, -15, -15, -13, -8, -7, -1, -1, 0, 1, 2, 11, 12, 14, 15, 16, 27, 30, 31, 33, 34, 36, 39, 41, 42, 42, 43, 48], [-49, -48, -43, -43, -40, -39, -37, -36, -28, -23, -22, -22, -20, -13, -12, -12, -10, -7, -2, 0, 2, 5, 8, 9, 16, 23, 26, 30, 30, 32, 32, 33, 43, 47, 48], [-48, -45, -45, -35, -34, -32, -26, -22, -20, -20, -19, -19, -15, -13, -10, -4, 0, 0, 1, 4, 6, 7, 12, 16, 22, 23, 26, 31, 32, 33, 35, 36, 48, 49, 49], [-49, -48, -47, -42, -36, -29, -22, -21, -19, -17, -16, -13, -13, -7, -4, -4, 2, 6, 6, 8, 10, 12, 13, 16, 16, 21, 26, 29, 34, 35, 42, 42, 43, 48, 48], [-48, -44, -34, -34, -34, -33, -32, -31, -26, -25, -24, -23, -22, -20, -17, -15, -11, -8, -7, -6, -5, 2, 8, 10, 19, 20, 26, 27, 27, 29, 30, 30, 38, 43, 46], [-49, -45, -44, -41, -39, -36, -30, -30, -28, -27, -25, -25, -25, -24, -22, -19, -11, -5, -4, -2, -1, 10, 14, 15, 22, 25, 27, 28, 28, 30, 33, 36, 38, 40, 45], [-45, -45, -40, -40, -37, -36, -35, -33, -27, -18, -15, -11, -8, -8, -6, -3, 2, 7, 10, 12, 15, 17, 18, 19, 31, 34, 37, 38, 40, 44, 46, 46, 48, 48, 49], [-46, -45, -41, -35, -33, -28, -28, -28, -27, -25, -24, -24, -24, -23, -21, -20, -18, -15, -11, -11, -10, -6, -4, -1, 1, 13, 14, 17, 18, 22, 24, 26, 34, 41, 44], [-43, -40, -39, -35, -34, -31, -23, -21, -18, -18, -17, -11, -7, -7, -3, -3, 1, 3, 4, 12, 12, 12, 24, 24, 25, 29, 29, 33, 35, 37, 37, 41, 46, 46, 47], [-45, -44, -43, -41, -40, -39, -37, -35, -34, -29, -11, -10, -4, -2, -1, 0, 3, 6, 7, 8, 9, 9, 10, 13, 14, 17, 21, 28, 33, 36, 39, 48, 48, 49, 49], [-49, -49, -49, -45, -45, -45, -42, -41, -35, -35, -22, -20, -18, -12, -10, -10, -7, -7, 4, 6, 7, 11, 14, 14, 14, 19, 20, 24, 27, 30, 32, 42, 44, 45, 47], [-49, -44, -36, -34, -28, -18, -17, -15, -14, -5, -2, -1, 7, 8, 8, 9, 10, 11, 15, 19, 21, 24, 27, 29, 29, 36, 36, 37, 39, 45, 46, 47, 47, 48, 49], [-42, -35, -34, -31, -30, -29, -28, -23, -22, -13, -13, -12, -12, -8, -7, -5, -5, -4, -3, -2, -2, 4, 8, 10, 11, 15, 16, 32, 33, 33, 34, 35, 40, 41, 46], [-49, -46, -43, -43, -43, -36, -36, -31, -26, -22, -18, -16, -12, -11, -3, -2, -1, 0, 5, 6, 14, 17, 23, 31, 32, 33, 33, 34, 35, 36, 36, 37, 40, 46, 47], [-47, -43, -40, -37, -32, -32, -31, -28, -26, -24, -21, -20, -9, -8, -6, -3, -1, 2, 3, 4, 5, 9, 12, 14, 18, 19, 20, 20, 22, 22, 22, 32, 35, 43, 45], [-49, -39, -39, -32, -31, -28, -27, -27, -24, -23, -21, -18, -11, -10, -9, -6, -3, -2, -1, -1, 4, 9, 10, 12, 22, 26, 36, 37, 38, 40, 44, 44, 46, 46, 48], [-48, -48, -45, -43, -39, -37, -36, -28, -26, -17, -14, -14, -6, -6, -5, -1, -1, 2, 3, 6, 7, 8, 12, 15, 17, 17, 17, 24, 30, 34, 39, 41, 42, 47, 49], [-49, -47, -43, -39, -33, -31, -31, -28, -24, -22, -22, -17, -16, -10, -8, -8, -5, -1, 2, 2, 6, 9, 10, 10, 12, 15, 19, 22, 27, 28, 31, 33, 40, 42, 45], [-49, -47, -45, -44, -41, -39, -37, -35, -34, -33, -30, -29, -29, -27, -27, -26, -23, -19, -18, -13, 4, 4, 12, 15, 15, 20, 23, 31, 34, 36, 39, 40, 41, 42, 48], [-37, -36, -36, -35, -23, -22, -17, -16, -15, -9, -8, -7, -5, -2, 2, 2, 2, 3, 5, 5, 5, 9, 15, 17, 17, 21, 23, 24, 28, 33, 33, 35, 36, 37, 49], [-49, -48, -46, -44, -41, -41, -40, -39, -33, -32, -32, -24, -21, -16, -15, -9, -7, -7, -5, -1, 3, 4, 5, 5, 8, 13, 17, 21, 25, 29, 31, 32, 34, 37, 45], [-48, -47, -39, -32, -32, -30, -29, -26, -20, -18, -18, -18, -17, -17, -15, -12, -7, 6, 10, 12, 12, 21, 30, 30, 33, 35, 35, 36, 39, 40, 43, 43, 44, 47, 48], [-49, -49, -46, -44, -41, -40, -34, -32, -26, -22, -19, -19, -18, -15, -12, -11, -10, -10, -5, -4, -3, -1, 1, 13, 14, 16, 17, 21, 27, 28, 32, 33, 34, 36, 48], [-49, -46, -45, -44, -39, -33, -33, -33, -32, -23, -21, -12, -3, -3, -2, -1, 0, 1, 2, 9, 14, 23, 24, 25, 25, 25, 27, 28, 32, 35, 37, 46, 48, 48, 49], [-47, -46, -45, -44, -35, -35, -34, -17, -15, -14, -14, -14, -14, -13, -12, -5, -2, 2, 5, 12, 15, 17, 18, 19, 19, 21, 21, 26, 27, 30, 34, 34, 47, 48, 49], [-49, -48, -46, -45, -44, -27, -25, -21, -18, -18, -12, -6, 0, 1, 2, 7, 8, 10, 11, 16, 16, 16, 17, 17, 17, 21, 23, 25, 25, 33, 34, 36, 41, 41, 49], [-49, -47, -41, -40, -37, -36, -34, -31, -31, -31, -28, -28, -26, -25, -22, -14, -13, -11, -4, 0, 4, 6, 7, 10, 13, 20, 23, 23, 26, 28, 37, 44, 46, 47, 49], [-49, -39, -38, -32, -28, -28, -21, -20, -18, -9, -4, -2, 0, 6, 7, 8, 8, 11, 11, 16, 17, 18, 19, 22, 26, 28, 30, 32, 36, 41, 41, 42, 44, 48, 49], [-41, -40, -40, -39, -39, -38, -34, -29, -23, -21, -20, -18, -17, -15, -15, -15, -10, -1, 5, 11, 11, 13, 14, 17, 21, 28, 32, 33, 41, 41, 46, 47, 47, 47, 48], [-49, -48, -46, -45, -39, -36, -28, -27, -25, -25, -22, -21, -21, -20, -14, -6, -5, 5, 7, 8, 12, 15, 17, 20, 25, 29, 30, 32, 33, 34, 37, 38, 39, 44, 46], [-44, -41, -38, -37, -33, -29, -28, -27, -26, -26, -25, -24, -23, -22, -13, -9, -8, -6, -1, -1, 0, 1, 8, 10, 18, 20, 20, 20, 25, 28, 28, 33, 34, 44, 47]], [[-49, -47, -43, -40, -32, -32, -28, -23, -14, -6, -2, -1, -1, 5, 7, 12, 17, 19, 26, 34, 39, 43], [-48, -48, -44, -38, -34, -30, -18, -17, -13, 7, 9, 10, 12, 14, 18, 19, 20, 42, 42, 42, 48, 49], [-42, -27, -21, -18, -18, -13, -12, -9, -6, 2, 3, 4, 12, 18, 19, 20, 27, 30, 37, 37, 38, 39], [-49, -48, -43, -42, -38, -32, -30, -24, -10, -6, 0, 2, 6, 11, 12, 13, 18, 21, 26, 27, 32, 47], [-43, -43, -39, -27, -23, -20, -17, -12, -6, -3, 3, 3, 5, 7, 7, 8, 17, 24, 30, 36, 36, 47], [-41, -35, -33, -28, -20, -14, -9, -2, 0, 1, 1, 3, 10, 13, 14, 22, 27, 28, 34, 39, 40, 49], [-47, -36, -36, -36, -28, -24, -20, -4, 6, 9, 13, 14, 14, 22, 27, 27, 30, 31, 31, 36, 38, 42], [-40, -39, -26, -23, -20, -17, -16, -14, -13, -9, -9, -2, -2, 9, 10, 14, 16, 26, 40, 40, 47, 48], [-46, -38, -38, -37, -29, -22, -19, -17, -16, -15, -12, -10, -1, 1, 4, 22, 26, 28, 33, 35, 36, 49], [-48, -40, -37, -35, -34, -33, -32, -17, -13, -6, -6, 2, 11, 21, 25, 31, 32, 34, 38, 40, 42, 49], [-48, -39, -25, -19, -19, -13, -11, -10, -1, -1, 1, 2, 2, 12, 16, 16, 17, 27, 38, 42, 47, 48], [-49, -44, -41, -35, -35, -31, -17, 1, 4, 8, 9, 9, 11, 12, 15, 16, 28, 29, 30, 33, 47, 49], [-48, -47, -45, -32, -23, -16, -6, -4, -3, -2, 5, 12, 16, 17, 21, 26, 29, 32, 36, 37, 38, 44], [-48, -47, -44, -43, -42, -42, -40, -36, -29, -24, -12, -10, -2, 6, 8, 16, 28, 32, 33, 35, 40, 43], [-48, -38, -26, -20, -20, -9, -8, -8, -7, -1, 4, 7, 10, 16, 17, 20, 26, 28, 36, 37, 40, 43], [-45, -40, -38, -33, -30, -29, -17, -4, -2, -1, 1, 5, 9, 12, 20, 25, 29, 37, 38, 41, 44, 47], [-48, -41, -36, -36, -29, -11, -10, -2, -1, -1, 3, 3, 7, 8, 17, 18, 25, 30, 34, 42, 42, 47], [-48, -45, -28, -27, -26, -22, -12, -11, -7, -7, -5, -4, 12, 12, 14, 17, 20, 22, 24, 34, 36, 39], [-49, -43, -36, -35, -27, -26, -22, -19, -6, -4, -3, 2, 11, 11, 12, 12, 13, 16, 36, 43, 47, 48], [-33, -31, -28, -20, -8, -8, 3, 5, 6, 8, 10, 10, 23, 26, 28, 33, 34, 34, 36, 41, 41, 49], [-46, -40, -32, -27, -19, -13, -11, -2, 3, 4, 6, 11, 14, 17, 17, 22, 38, 38, 42, 43, 44, 45], [-42, -41, -37, -32, -16, -15, -14, -7, -7, -5, 4, 4, 6, 20, 20, 21, 23, 31, 35, 39, 44, 47]], [[-42, -36, -31, -28, -12, -3, 4, 4, 6, 11, 12, 19, 28, 31, 32, 41], [-49, -43, -28, -27, -26, -26, -26, -25, -17, -8, 24, 28, 33, 35, 39, 39], [-48, -46, -41, -34, -6, -5, -1, 0, 1, 17, 21, 21, 29, 31, 37, 41], [-47, -26, -11, -10, -10, -9, -5, 4, 19, 27, 31, 34, 35, 38, 40, 49], [-41, -34, -32, -26, -17, -15, -13, -8, -5, 1, 6, 14, 34, 47, 47, 47], [-49, -45, -41, -41, -29, -27, -23, 3, 5, 9, 11, 21, 21, 27, 33, 37], [-40, -33, -12, -12, -12, -8, 4, 10, 10, 14, 19, 21, 33, 44, 45, 48], [-48, -46, -41, -31, -19, -19, -17, -12, -5, -3, -2, 5, 10, 29, 31, 42], [-48, -40, -40, -34, -23, -13, -7, -5, -3, 18, 24, 29, 35, 38, 43, 49], [-35, -18, -15, 10, 15, 16, 18, 19, 20, 22, 22, 24, 25, 37, 38, 40], [-45, -45, -42, -15, -14, -11, -4, -1, 3, 15, 23, 28, 31, 38, 42, 48], [-45, -45, -39, -35, -34, -31, -24, -16, -14, -11, -11, -5, 9, 19, 30, 45], [-42, -36, -31, -24, -13, -5, -1, 2, 11, 19, 21, 21, 24, 25, 40, 45], [-46, -41, -35, -28, -2, 3, 4, 18, 21, 25, 32, 45, 45, 45, 46, 49], [-46, -43, -39, -28, -24, -9, -3, 15, 24, 27, 31, 39, 44, 44, 48, 48], [-40, -29, -18, -13, -8, -3, -3, -1, 1, 2, 10, 11, 18, 20, 33, 43]], [[-34, -33, -31, -19, -11, -9, -8, -5, -3, 1, 9, 18, 18, 18, 28, 29, 29, 37, 41, 42, 49], [-47, -42, -39, -38, -32, -30, -8, -7, -4, 0, 2, 4, 10, 12, 16, 20, 26, 29, 31, 37, 38], [-48, -41, -18, -12, -8, -8, -3, -1, 1, 2, 22, 24, 28, 36, 39, 39, 41, 41, 42, 48, 48], [-48, -47, -43, -41, -34, -34, -18, -11, -10, -5, -5, 5, 6, 8, 9, 14, 19, 26, 28, 37, 38], [-49, -48, -46, -45, -41, -37, -23, -17, -10, -10, -5, -4, -3, 0, 15, 21, 25, 30, 31, 40, 42], [-49, -46, -45, -45, -33, -23, -23, -23, -17, -10, -6, -4, 7, 15, 28, 29, 32, 37, 45, 49, 49], [-47, -44, -34, -26, -26, -4, -2, -1, -1, 2, 8, 16, 16, 19, 31, 33, 34, 41, 42, 46, 49], [-48, -48, -47, -47, -40, -34, -33, -9, -8, -6, -6, -5, 5, 13, 14, 19, 32, 36, 43, 45, 48], [-49, -48, -46, -36, -36, -29, -23, -19, -8, -3, -3, -1, 8, 14, 20, 32, 34, 36, 40, 45, 47], [-47, -43, -31, -26, -25, -20, -19, -7, 0, 2, 2, 5, 7, 9, 20, 22, 24, 27, 36, 39, 39], [-47, -41, -27, -25, -24, -12, -5, -3, -1, 7, 7, 24, 26, 27, 35, 39, 39, 39, 40, 40, 40], [-49, -44, -40, -39, -36, -28, -23, -22, -21, -21, -19, -18, -17, -11, -3, 3, 5, 26, 27, 43, 45], [-47, -42, -29, -28, -27, -25, -20, -10, -9, 3, 6, 13, 24, 25, 26, 29, 37, 42, 45, 46, 48], [-45, -44, -38, -36, -15, -8, -5, 2, 6, 9, 11, 13, 23, 24, 29, 30, 31, 38, 41, 42, 47], [-49, -47, -46, -39, -38, -36, -33, -32, -30, -22, -19, -15, -13, -3, 10, 11, 23, 32, 36, 36, 49], [-47, -43, -38, -37, -36, -21, -18, -13, -8, -7, -4, -2, 3, 8, 8, 17, 25, 27, 28, 35, 36], [-41, -39, -39, -31, -30, -28, -26, -21, -13, -12, -7, -6, 1, 1, 3, 7, 13, 13, 26, 43, 44], [-43, -41, -40, -31, -30, -28, -27, -21, -21, -13, -12, 3, 5, 11, 21, 31, 38, 39, 41, 41, 49], [-49, -46, -41, -28, -17, 0, 12, 13, 14, 17, 19, 21, 27, 29, 30, 31, 31, 34, 45, 48, 48], [-49, -47, -45, -41, -34, -30, -22, -19, -18, -5, 2, 4, 5, 10, 15, 19, 27, 45, 47, 47, 48], [-43, -40, -35, -30, -30, -28, -20, -20, -19, -19, -11, 4, 5, 12, 18, 21, 24, 30, 43, 47, 49]], [[-42, -42, -41, -35, -34, -31, -30, -28, -24, -24, -17, -14, -2, 4, 7, 16, 16, 22, 25, 36, 39, 43, 46, 49], [-49, -35, -32, -29, -27, -24, -23, -17, -17, -15, -7, -4, 3, 4, 10, 11, 17, 18, 22, 32, 32, 37, 39, 43], [-49, -49, -47, -43, -43, -34, -34, -22, -22, -19, -9, -6, -6, -4, -3, -1, 1, 2, 11, 18, 28, 42, 45, 45], [-49, -48, -48, -46, -45, -40, -39, -30, -26, -23, -19, -16, -10, -5, 0, 9, 11, 17, 18, 25, 38, 40, 43, 48], [-48, -44, -43, -37, -33, -30, -23, -20, -18, -13, -10, -10, -9, -7, 4, 8, 9, 18, 31, 34, 40, 45, 47, 49], [-41, -41, -38, -34, -32, -30, -25, -25, -23, -15, -14, -13, -11, -5, -5, 0, 16, 19, 24, 25, 32, 33, 39, 44], [-42, -38, -37, -35, -34, -30, -20, -13, -11, -9, -2, -2, 1, 15, 20, 26, 29, 31, 34, 35, 37, 39, 43, 46], [-46, -41, -36, -35, -35, -34, -33, -28, -25, -21, -14, -11, -7, -5, -4, 4, 4, 11, 19, 20, 24, 28, 30, 31], [-48, -48, -47, -45, -36, -34, -31, -26, -18, -18, -13, -9, -8, -4, 0, 6, 12, 16, 22, 31, 33, 37, 37, 40], [-43, -41, -39, -39, -38, -35, -33, -33, -30, -29, -22, -18, -16, -12, -4, -3, 0, 11, 16, 22, 30, 36, 47, 48], [-44, -44, -40, -34, -29, -29, -19, -18, -18, -17, -16, -16, -13, -6, 0, 2, 8, 14, 16, 20, 22, 32, 32, 49], [-49, -44, -41, -38, -34, -26, -18, -16, -15, -9, -8, 8, 16, 21, 24, 24, 28, 31, 34, 36, 39, 40, 42, 48], [-49, -43, -39, -39, -35, -34, -26, -26, -23, -17, -14, -13, 2, 12, 16, 16, 18, 19, 19, 22, 29, 35, 40, 48], [-49, -48, -43, -31, -31, -31, -29, -26, -25, -19, -14, -6, -4, -4, 9, 10, 11, 20, 34, 41, 43, 43, 44, 47], [-49, -48, -46, -42, -35, -26, -21, -15, -11, -6, -2, 3, 3, 9, 17, 19, 22, 24, 25, 25, 38, 40, 42, 47], [-49, -44, -43, -36, -27, -25, -22, -19, -18, -17, -16, -12, 0, 5, 6, 21, 22, 31, 31, 34, 37, 37, 38, 39], [-37, -36, -19, -16, -14, -12, -3, 3, 9, 12, 14, 16, 18, 21, 21, 24, 30, 31, 35, 35, 36, 37, 45, 49], [-36, -29, -28, -27, -25, -24, -21, -21, -10, -3, -3, 4, 7, 11, 11, 14, 18, 18, 20, 25, 28, 33, 34, 42], [-42, -42, -38, -38, -37, -34, -28, -22, -20, -19, -11, -7, -6, -5, 4, 6, 8, 10, 14, 24, 26, 30, 30, 46], [-46, -38, -26, -23, -20, -19, -17, -10, -8, -6, -6, 0, 4, 7, 14, 16, 18, 24, 27, 28, 29, 29, 32, 44], [-49, -48, -47, -47, -42, -39, -37, -32, -24, -17, -16, -1, 1, 5, 15, 20, 23, 30, 38, 42, 42, 43, 47, 47], [-42, -42, -34, -34, -29, -28, -22, -16, -4, 2, 4, 7, 8, 9, 10, 13, 25, 33, 34, 34, 36, 44, 45, 46], [-48, -39, -37, -36, -32, -32, -30, -24, -11, -4, -2, -1, 4, 8, 13, 19, 25, 26, 27, 31, 36, 37, 47, 48], [-33, -29, -27, -23, -16, -14, -11, -11, -11, -10, -9, -2, -2, 2, 5, 13, 22, 26, 35, 35, 40, 44, 46, 47]], [[-41, -40, -34, -28, -27, -26, -25, -18, -14, -12, -11, -10, -9, -8, -8, -5, -4, 1, 3, 20, 22, 29, 37, 39, 44], [-46, -31, -31, -29, -25, -25, -21, -19, -13, -12, 1, 7, 7, 19, 23, 25, 26, 28, 30, 31, 32, 33, 43, 47, 48], [-41, -40, -35, -31, -25, -20, -20, -14, 2, 3, 3, 4, 7, 10, 11, 18, 18, 20, 22, 25, 30, 33, 41, 42, 46], [-49, -47, -44, -41, -38, -32, -30, -30, -29, -29, -21, -21, -19, -15, -9, -8, 3, 17, 18, 26, 30, 33, 36, 39, 47], [-47, -45, -43, -34, -31, -29, -25, -22, -18, -10, -10, -5, -4, 1, 3, 3, 4, 5, 5, 12, 31, 34, 39, 43, 43], [-48, -40, -39, -37, -24, -21, -20, -13, -5, -3, 5, 8, 12, 16, 20, 20, 21, 27, 31, 32, 36, 39, 40, 41, 49], [-43, -39, -31, -23, -22, -14, -13, -11, -7, -2, 3, 16, 18, 18, 19, 20, 24, 27, 29, 30, 36, 38, 38, 47, 49], [-49, -48, -38, -26, -23, -23, -23, -21, -10, -8, -3, -2, -1, 0, 7, 8, 8, 17, 19, 26, 26, 27, 31, 33, 43], [-42, -32, -29, -17, 0, 1, 3, 4, 6, 8, 12, 16, 17, 21, 27, 27, 28, 32, 33, 37, 37, 44, 46, 47, 48], [-38, -31, -29, -28, -23, -21, -19, -15, -12, -5, -3, 0, 1, 2, 8, 12, 15, 16, 16, 18, 30, 30, 44, 45, 46], [-35, -33, -27, -27, -25, -23, -21, -21, -20, -12, 0, 1, 2, 14, 17, 17, 21, 24, 29, 30, 31, 35, 40, 41, 42], [-44, -43, -43, -32, -25, -23, -13, 12, 17, 19, 20, 26, 29, 32, 32, 34, 35, 37, 43, 43, 43, 44, 44, 48, 48], [-42, -37, -37, -35, -30, -27, -19, -16, -15, -15, -6, -5, -2, 0, 4, 7, 8, 12, 14, 15, 19, 28, 31, 36, 44], [-49, -45, -33, -31, -30, -30, -25, -24, -22, -21, -9, -5, 1, 1, 3, 4, 5, 13, 25, 26, 36, 39, 39, 40, 48], [-42, -41, -41, -35, -33, -24, -22, -17, -15, -14, -10, 3, 5, 6, 7, 8, 13, 13, 13, 16, 18, 24, 42, 45, 47], [-45, -37, -35, -33, -33, -31, -30, -22, -17, -10, -3, -3, 13, 16, 21, 21, 23, 24, 28, 33, 34, 36, 42, 47, 49], [-45, -39, -39, -36, -33, -33, -31, -18, -18, -17, -11, -11, -1, 0, 9, 9, 11, 11, 12, 15, 25, 37, 38, 45, 45], [-48, -42, -40, -39, -37, -30, -26, -24, -22, -16, -13, -11, -8, 5, 10, 14, 16, 31, 31, 33, 33, 38, 44, 48, 49], [-49, -42, -36, -33, -32, -28, -24, -13, -11, -9, -8, -5, -4, -3, 2, 2, 3, 27, 28, 33, 37, 41, 42, 47, 49], [-45, -44, -41, -35, -20, -20, -18, -18, -17, -17, -15, -10, -4, -3, -2, 1, 1, 6, 8, 9, 16, 24, 30, 40, 47], [-46, -45, -44, -43, -38, -36, -31, -22, -15, -15, -8, -6, -1, 9, 10, 10, 10, 16, 22, 26, 30, 30, 44, 48, 49], [-48, -46, -42, -38, -38, -29, -25, -20, -2, 2, 15, 17, 20, 21, 23, 24, 29, 30, 32, 33, 35, 38, 38, 41, 43], [-47, -41, -40, -35, -33, -30, -30, -30, -30, -16, -15, -14, -13, 2, 2, 8, 10, 12, 14, 21, 25, 30, 38, 38, 44], [-45, -41, -37, -33, -31, -29, -25, -17, -13, -10, -7, -3, -2, 0, 15, 18, 20, 22, 24, 30, 32, 35, 37, 44, 46], [-48, -47, -41, -34, -29, -17, -14, -13, -13, -12, -12, -5, -2, 0, 6, 8, 11, 11, 16, 21, 34, 38, 42, 43, 47]], [[-47, -40, -36, -33, -33, -31, -30, -30, -30, -28, -27, -27, -25, -25, -22, -19, -18, -12, -9, -9, -7, 0, 8, 9, 11, 11, 13, 13, 13, 14, 14, 17, 17, 17, 18, 21, 38, 39, 40, 42, 42, 44, 48, 48], [-49, -47, -46, -39, -36, -29, -26, -26, -25, -23, -20, -19, -19, -16, -13, -8, -4, -2, 0, 0, 1, 2, 3, 6, 7, 12, 14, 16, 20, 20, 21, 25, 27, 31, 32, 33, 34, 36, 38, 38, 38, 45, 48, 49], [-47, -46, -44, -43, -37, -36, -30, -28, -27, -20, -18, -14, -13, -13, -9, -8, -6, -6, -2, -1, 4, 7, 8, 8, 10, 11, 16, 18, 19, 19, 23, 24, 26, 28, 29, 30, 32, 32, 34, 37, 39, 43, 48, 49], [-46, -41, -39, -34, -34, -30, -29, -28, -28, -27, -26, -23, -19, -18, -16, -15, -14, -11, -9, -8, -7, -4, 3, 8, 14, 15, 16, 20, 20, 21, 21, 22, 27, 27, 29, 30, 35, 36, 37, 38, 41, 41, 44, 44], [-48, -47, -47, -45, -44, -43, -42, -41, -37, -33, -32, -29, -24, -17, -10, -7, -6, -5, -4, -3, -3, -2, 1, 4, 6, 8, 10, 12, 13, 13, 19, 19, 21, 22, 23, 24, 27, 27, 27, 35, 40, 43, 45, 46], [-46, -46, -44, -40, -39, -38, -38, -37, -35, -29, -29, -25, -24, -23, -16, -16, -16, -8, -7, -7, -5, -3, -1, 0, 1, 2, 5, 7, 9, 9, 13, 15, 16, 22, 22, 24, 24, 25, 29, 40, 41, 43, 44, 46], [-47, -45, -44, -43, -41, -39, -37, -34, -26, -15, -14, -14, -12, -10, -8, -7, -5, -3, 4, 4, 4, 7, 7, 8, 9, 10, 11, 14, 15, 20, 20, 22, 28, 29, 30, 32, 33, 34, 40, 43, 44, 46, 48, 48], [-41, -40, -40, -38, -38, -37, -32, -25, -20, -19, -13, -9, -7, -3, -3, -1, 1, 5, 8, 11, 12, 16, 16, 16, 16, 17, 19, 19, 23, 24, 27, 31, 35, 35, 36, 36, 41, 41, 45, 45, 46, 47, 47, 48], [-49, -46, -45, -42, -40, -40, -33, -26, -25, -20, -16, -13, -12, -10, -8, -6, -3, -2, 0, 4, 4, 5, 5, 7, 10, 15, 19, 22, 22, 24, 26, 27, 31, 34, 37, 38, 38, 39, 45, 46, 46, 46, 47, 47], [-47, -47, -43, -41, -39, -37, -37, -36, -34, -32, -31, -28, -24, -19, -14, -11, -10, -8, 2, 4, 5, 8, 11, 16, 17, 17, 22, 24, 24, 25, 27, 29, 30, 30, 31, 32, 33, 34, 37, 43, 45, 45, 48, 49], [-49, -46, -44, -43, -40, -40, -40, -38, -37, -36, -35, -33, -32, -31, -27, -26, -25, -23, -20, -17, -4, 2, 3, 3, 5, 7, 7, 8, 9, 13, 18, 21, 22, 27, 30, 33, 34, 35, 36, 38, 44, 46, 47, 47], [-43, -43, -43, -40, -38, -32, -28, -26, -23, -22, -22, -18, -12, -11, -8, -7, 0, 0, 2, 2, 6, 8, 8, 8, 10, 11, 14, 18, 26, 27, 31, 32, 33, 34, 35, 35, 38, 39, 41, 43, 44, 46, 47, 47], [-48, -47, -46, -46, -44, -44, -43, -42, -42, -41, -41, -40, -35, -30, -29, -26, -21, -17, -11, -11, -10, -6, -3, -1, -1, 0, 1, 2, 12, 14, 14, 22, 22, 28, 33, 34, 34, 35, 36, 37, 38, 39, 44, 47], [-48, -43, -43, -42, -41, -37, -34, -31, -30, -28, -26, -25, -25, -24, -21, -20, -6, -3, 6, 9, 13, 15, 21, 24, 26, 26, 26, 28, 29, 30, 33, 35, 35, 35, 36, 37, 37, 38, 42, 42, 43, 43, 44, 48], [-48, -45, -42, -39, -39, -34, -34, -32, -28, -26, -20, -20, -19, -18, -18, -15, -15, -15, -13, -10, -8, -8, -3, 0, 2, 3, 10, 14, 17, 17, 19, 20, 23, 31, 31, 32, 33, 36, 37, 39, 39, 47, 48, 49], [-48, -42, -42, -41, -37, -35, -31, -31, -29, -28, -28, -24, -23, -23, -23, -23, -13, -11, -8, -6, -4, -3, -2, -2, -2, -1, 6, 7, 11, 11, 15, 17, 24, 25, 26, 28, 31, 35, 39, 41, 44, 44, 45, 47], [-49, -47, -42, -40, -37, -35, -35, -34, -28, -27, -27, -26, -14, -14, -13, -13, -10, -7, -7, -4, -3, 1, 2, 8, 9, 12, 16, 17, 19, 21, 23, 23, 29, 34, 34, 35, 37, 38, 40, 41, 42, 43, 49, 49], [-48, -48, -47, -35, -32, -31, -26, -26, -26, -24, -20, -18, -15, -13, -10, -9, -7, -4, -4, -3, -2, -2, 3, 3, 7, 8, 15, 15, 18, 19, 25, 27, 31, 32, 35, 36, 37, 38, 39, 40, 41, 42, 44, 45], [-48, -47, -44, -44, -43, -40, -39, -38, -35, -35, -34, -32, -32, -28, -28, -28, -27, -26, -26, -25, -24, -24, -18, -14, -8, -6, -6, -3, -1, 1, 1, 3, 9, 16, 17, 20, 27, 32, 33, 35, 36, 40, 48, 49], [-47, -45, -44, -44, -42, -39, -39, -37, -36, -35, -34, -32, -26, -25, -25, -23, -21, -14, -14, -11, -8, -7, -3, 10, 10, 16, 23, 24, 28, 29, 29, 29, 29, 31, 31, 31, 34, 34, 35, 35, 38, 42, 45, 49], [-45, -44, -43, -43, -43, -41, -41, -41, -39, -37, -36, -35, -35, -33, -32, -31, -30, -30, -28, -24, -24, -20, -19, -18, -16, -15, -12, -2, -1, 0, 1, 3, 3, 4, 13, 13, 16, 32, 33, 35, 38, 40, 41, 44], [-49, -48, -45, -37, -33, -31, -30, -23, -21, -19, -18, -16, -16, -16, -8, -7, -4, -3, -1, 0, 0, 1, 4, 4, 9, 14, 19, 20, 23, 25, 25, 26, 26, 30, 34, 37, 38, 40, 41, 41, 45, 45, 45, 46], [-49, -49, -48, -44, -43, -43, -38, -33, -32, -32, -27, -26, -18, -18, -13, -11, -9, -8, -6, -1, 0, 0, 0, 2, 4, 5, 6, 9, 10, 15, 17, 20, 22, 24, 25, 26, 27, 33, 34, 35, 39, 46, 47, 48], [-49, -47, -47, -46, -41, -39, -36, -36, -31, -29, -29, -28, -23, -23, -23, -22, -19, -18, -15, -7, -6, -6, -5, -5, -5, -4, -4, -1, 0, 0, 1, 7, 15, 15, 16, 17, 19, 22, 24, 24, 26, 34, 43, 47], [-48, -48, -47, -45, -41, -40, -33, -31, -30, -27, -26, -26, -26, -25, -24, -24, -23, -22, -17, -6, -4, -1, 0, 1, 6, 7, 9, 18, 18, 19, 19, 19, 28, 29, 32, 35, 36, 38, 39, 40, 44, 45, 49, 49], [-49, -46, -45, -42, -31, -26, -21, -21, -19, -18, -17, -17, -14, -13, -13, -8, -7, -3, -2, 0, 3, 4, 7, 8, 8, 8, 14, 14, 15, 20, 20, 22, 30, 33, 34, 34, 34, 38, 38, 39, 40, 46, 46, 47], [-47, -46, -45, -36, -36, -35, -28, -28, -26, -24, -23, -18, -17, -13, -12, -12, -4, -3, 2, 3, 7, 7, 9, 13, 15, 16, 17, 18, 18, 19, 20, 23, 25, 27, 27, 29, 30, 32, 37, 39, 40, 41, 44, 47], [-48, -47, -44, -43, -40, -34, -31, -30, -28, -26, -24, -23, -18, -16, -14, -14, -11, -5, -4, -4, -3, 1, 8, 9, 9, 11, 18, 18, 21, 21, 24, 24, 24, 25, 29, 31, 32, 33, 36, 36, 38, 39, 48, 48], [-49, -47, -46, -45, -43, -39, -39, -39, -38, -35, -32, -31, -27, -27, -22, -22, -18, -14, -13, -13, -9, -1, 0, 0, 2, 3, 9, 12, 16, 21, 27, 28, 29, 30, 31, 33, 34, 41, 42, 42, 45, 47, 48, 48], [-48, -48, -44, -43, -42, -42, -40, -36, -34, -33, -32, -31, -30, -29, -26, -23, -22, -21, -17, -15, -13, -11, -5, -4, -1, 4, 5, 7, 8, 13, 13, 16, 17, 20, 25, 28, 33, 33, 33, 34, 35, 36, 37, 43], [-46, -45, -43, -41, -39, -39, -36, -34, -30, -29, -28, -28, -28, -27, -24, -17, -11, -10, -3, -1, -1, 1, 2, 3, 4, 7, 10, 12, 22, 24, 26, 29, 30, 30, 33, 39, 39, 39, 40, 40, 43, 45, 49, 49], [-48, -48, -47, -46, -45, -38, -38, -37, -30, -29, -28, -27, -20, -18, -17, -15, -10, -9, -6, -6, -5, -5, -5, -4, -4, 1, 7, 14, 16, 23, 24, 25, 25, 26, 26, 27, 35, 36, 36, 39, 40, 40, 44, 47], [-49, -45, -45, -39, -35, -28, -27, -22, -22, -18, -16, -15, -15, -14, -13, -12, -10, -8, -8, -6, -5, -5, -3, -3, -2, -2, 0, 1, 1, 1, 4, 4, 13, 19, 22, 23, 28, 31, 33, 40, 44, 47, 48, 49], [-49, -48, -45, -43, -42, -42, -36, -35, -33, -32, -27, -26, -26, -24, -20, -18, -16, -15, -11, -11, -4, 0, 2, 3, 4, 5, 8, 9, 11, 11, 13, 14, 19, 25, 27, 27, 30, 30, 30, 36, 41, 47, 49, 49], [-47, -45, -43, -42, -41, -40, -39, -38, -37, -35, -33, -32, -31, -29, -27, -27, -26, -19, -19, -18, -13, -12, -11, -8, -3, -2, -1, -1, 0, 4, 5, 6, 10, 12, 12, 13, 14, 16, 17, 24, 29, 39, 41, 46], [-44, -43, -42, -41, -39, -39, -38, -36, -35, -35, -34, -33, -25, -24, -23, -21, -19, -16, -16, -15, -9, -6, -4, -3, -3, 0, 4, 10, 11, 12, 16, 19, 21, 22, 26, 32, 35, 35, 38, 40, 41, 44, 46, 49], [-48, -47, -46, -43, -43, -43, -43, -42, -40, -40, -39, -39, -36, -36, -35, -35, -31, -27, -25, -25, -25, -21, -17, -12, -9, -5, 0, 14, 14, 16, 20, 22, 23, 28, 31, 34, 34, 36, 38, 44, 46, 47, 47, 48], [-49, -43, -40, -40, -38, -37, -34, -31, -31, -30, -22, -20, -19, -19, -19, -11, -11, -7, -6, 2, 4, 6, 12, 15, 15, 16, 21, 24, 24, 29, 30, 31, 32, 38, 39, 40, 40, 40, 41, 41, 42, 44, 45, 48], [-48, -48, -48, -47, -43, -41, -34, -34, -33, -33, -33, -25, -25, -25, -25, -22, -18, -18, -16, -15, -13, -13, -9, -1, 12, 13, 14, 16, 17, 19, 21, 22, 26, 27, 28, 29, 30, 32, 33, 37, 40, 45, 47, 49], [-49, -44, -42, -41, -38, -35, -31, -30, -28, -25, -25, -24, -22, -22, -22, -21, -17, -16, -16, -12, -12, -7, -6, -6, -2, -1, 0, 2, 3, 16, 19, 21, 26, 27, 27, 28, 28, 29, 32, 33, 38, 41, 45, 46], [-47, -43, -42, -40, -39, -39, -36, -32, -31, -31, -29, -28, -27, -26, -20, -18, -16, -13, -13, -10, -10, -8, -7, -6, -2, 2, 2, 11, 14, 15, 22, 23, 25, 34, 36, 37, 40, 40, 41, 43, 45, 48, 49, 49], [-49, -47, -46, -45, -44, -43, -42, -38, -34, -32, -30, -25, -24, -12, -12, -10, -10, -10, -10, -9, 1, 1, 2, 4, 5, 6, 6, 15, 18, 21, 23, 24, 29, 31, 32, 32, 34, 36, 36, 38, 39, 43, 45, 48], [-46, -43, -38, -35, -34, -28, -27, -27, -25, -24, -22, -18, -16, -15, -11, -10, -9, -8, -6, -6, -1, 1, 1, 2, 6, 7, 12, 13, 13, 19, 19, 21, 22, 23, 26, 27, 28, 31, 36, 38, 42, 42, 45, 49], [-46, -40, -40, -36, -35, -34, -34, -33, -29, -26, -25, -21, -21, -20, -13, -13, -11, -8, -4, -4, -3, -1, 0, 0, 4, 5, 6, 10, 10, 10, 11, 20, 21, 22, 22, 23, 28, 30, 32, 35, 46, 48, 49, 49]], [[-40, -26, -24, -14, -4, 3, 4, 8, 10, 12, 13, 17, 23, 32, 34, 39, 42, 46, 46, 47], [-49, -35, -32, -25, -25, -24, -21, -14, -9, -7, -2, 3, 20, 26, 35, 36, 36, 40, 45, 46], [-49, -40, -24, -24, -21, -20, -13, -13, -13, 2, 5, 12, 14, 16, 20, 23, 25, 27, 40, 41], [-44, -42, -42, -41, -40, -38, -38, -33, -25, -23, -19, -15, -13, -12, 4, 6, 9, 18, 27, 30], [-44, -36, -30, -29, -21, -20, -15, -14, -9, -7, 3, 8, 13, 13, 26, 31, 32, 34, 38, 45], [-44, -38, -37, -34, -31, -30, 2, 4, 6, 7, 11, 12, 13, 17, 31, 36, 39, 41, 45, 47], [-48, -47, -45, -36, -31, -5, -4, -1, 4, 5, 7, 14, 15, 17, 27, 36, 38, 39, 40, 44], [-46, -44, -34, -32, -32, -30, -17, -16, -10, -8, -4, 1, 3, 11, 31, 36, 37, 40, 45, 49], [-35, -34, -31, -27, -27, -7, -5, 10, 10, 20, 28, 29, 29, 32, 36, 41, 44, 44, 44, 44], [-38, -28, -21, -15, -13, -7, -5, -2, 4, 6, 17, 21, 25, 26, 27, 43, 47, 48, 48, 49], [-46, -46, -42, -39, -33, -32, -29, -22, -17, -15, -12, -9, -7, -2, 8, 12, 13, 17, 30, 44], [-49, -36, -29, -27, -18, -14, -12, -9, -9, -7, -2, 0, 2, 3, 15, 22, 28, 28, 34, 41], [-48, -46, -45, -45, -39, -28, -9, -2, -1, 1, 4, 5, 5, 11, 14, 15, 25, 27, 30, 48], [-39, -32, -32, -29, -28, -27, -17, -17, -14, -11, -3, -3, 3, 8, 22, 26, 26, 37, 43, 47], [-45, -45, -43, -41, -19, -14, -11, -7, 4, 11, 13, 16, 24, 27, 28, 37, 41, 42, 44, 44], [-40, -37, -34, -34, -27, -24, -13, -9, -4, -2, 0, 0, 6, 23, 30, 35, 36, 43, 43, 44], [-49, -42, -42, -38, -21, -6, -3, -1, 3, 9, 10, 11, 12, 22, 26, 29, 31, 37, 37, 40], [-46, -41, -41, -37, -24, -22, -15, -13, -10, 2, 7, 13, 26, 26, 28, 30, 43, 44, 45, 46], [-49, -45, -41, -41, -39, -27, -14, -11, -2, 1, 3, 9, 12, 12, 14, 16, 23, 27, 29, 41], [-45, -40, -36, -35, -31, -16, -14, -12, 15, 16, 27, 28, 29, 33, 34, 36, 37, 37, 43, 48]], [[-47, -46, -41, -39, -34, -29, -17, -16, 6, 16, 22, 24, 26, 27, 35, 39, 44, 49], [-46, -44, -39, -36, -31, -27, -22, -19, -19, 2, 3, 6, 14, 18, 24, 40, 42, 47], [-46, -33, -32, -28, -15, -1, 0, 2, 3, 7, 11, 13, 13, 17, 27, 29, 32, 34], [-49, -45, -44, -36, -35, -29, -7, -4, 1, 3, 4, 9, 20, 40, 41, 42, 44, 47], [-49, -34, -34, -21, -11, -8, -2, 2, 4, 10, 10, 19, 20, 21, 39, 41, 44, 45], [-49, -46, -45, -36, -35, -18, -15, -14, -5, 1, 5, 17, 24, 26, 26, 31, 36, 36], [-49, -44, -33, -24, -18, -13, -10, -6, 5, 18, 27, 29, 33, 37, 40, 41, 44, 49], [-48, -46, -36, -35, -35, -34, -32, -24, -15, -15, -3, -1, 3, 7, 13, 35, 42, 49], [-46, -44, -39, -32, -28, -17, -11, -5, 2, 4, 11, 18, 22, 22, 44, 44, 44, 48], [-46, -39, -35, -30, -22, -9, -3, 6, 12, 17, 23, 23, 33, 38, 38, 41, 45, 46], [-40, -33, -21, -20, -20, -18, -6, -4, -3, -2, -1, 1, 8, 9, 11, 14, 25, 26], [-44, -37, -7, -6, -4, 1, 8, 18, 19, 22, 32, 33, 36, 38, 41, 43, 46, 46], [-45, -39, -32, -23, -20, -20, -18, -10, -8, 0, 5, 6, 7, 8, 33, 34, 38, 49], [-47, -46, -36, -14, -14, -12, -12, -4, 4, 10, 12, 12, 30, 33, 41, 43, 44, 47], [-45, -43, -40, -38, -27, -26, -13, -7, -5, -1, 7, 9, 20, 21, 32, 33, 34, 36], [-49, -38, -34, -25, -25, -19, -4, -3, 0, 2, 5, 7, 11, 16, 25, 29, 34, 46], [-44, -42, -21, -15, -14, -2, -1, 4, 8, 18, 22, 26, 27, 32, 35, 36, 48, 49], [-43, -34, -33, -20, -19, -17, -9, -3, -2, 1, 3, 6, 9, 25, 37, 40, 41, 45]], [[-49, -46, -46, -44, -44, -42, -38, -37, -36, -34, -33, -32, -26, -24, -19, -16, -16, -15, -13, -11, -9, -8, -1, -1, 0, 5, 8, 8, 9, 10, 16, 18, 24, 25, 26, 26, 26, 26, 31, 37, 37, 39, 41, 42, 44, 47, 47, 48], [-49, -48, -45, -42, -39, -37, -36, -36, -36, -32, -31, -28, -26, -25, -24, -19, -18, -2, -1, -1, 4, 5, 6, 7, 9, 9, 10, 10, 12, 12, 12, 14, 14, 16, 20, 21, 25, 28, 29, 29, 39, 40, 40, 40, 42, 43, 48, 49], [-46, -45, -45, -44, -42, -41, -40, -39, -37, -34, -34, -33, -23, -23, -20, -17, -16, -12, -11, -10, -9, -8, -6, -5, -3, -1, 3, 5, 9, 15, 17, 20, 21, 23, 23, 25, 25, 27, 27, 30, 34, 36, 36, 37, 40, 40, 41, 44], [-49, -45, -44, -44, -44, -42, -41, -41, -38, -36, -31, -29, -28, -26, -25, -25, -16, -16, -12, -9, -8, -8, -5, -1, 2, 2, 3, 3, 3, 4, 7, 8, 8, 8, 11, 17, 18, 19, 26, 27, 27, 29, 30, 36, 36, 38, 44, 46], [-47, -46, -41, -40, -39, -38, -35, -34, -34, -34, -33, -32, -29, -25, -23, -19, -17, -16, -11, -10, -10, -7, -4, 3, 6, 7, 9, 12, 14, 19, 20, 20, 21, 27, 32, 32, 33, 35, 38, 38, 39, 40, 41, 43, 47, 48, 49, 49], [-46, -43, -43, -42, -40, -36, -35, -33, -32, -25, -23, -22, -21, -21, -16, -15, -13, -12, -7, -7, -1, 1, 3, 4, 7, 9, 9, 11, 12, 13, 17, 17, 19, 21, 22, 22, 23, 23, 26, 26, 28, 31, 35, 36, 36, 39, 39, 49], [-49, -46, -44, -41, -37, -33, -31, -30, -28, -25, -24, -22, -21, -19, -16, -11, -8, -7, -6, -4, -2, 0, 2, 4, 5, 7, 7, 8, 11, 15, 16, 17, 18, 23, 24, 25, 26, 28, 29, 29, 30, 31, 33, 39, 40, 45, 47, 47], [-45, -42, -35, -34, -33, -32, -32, -30, -30, -29, -28, -26, -24, -20, -16, -14, -14, -13, -8, -7, -5, -4, -4, -4, -1, 2, 4, 7, 7, 8, 15, 15, 20, 22, 22, 26, 29, 30, 31, 34, 38, 39, 39, 40, 42, 43, 45, 45], [-47, -45, -43, -40, -33, -31, -28, -27, -27, -25, -20, -17, -16, -14, -11, -8, -8, -7, -3, 4, 6, 10, 11, 13, 17, 18, 18, 19, 19, 20, 21, 21, 22, 23, 25, 25, 26, 27, 33, 35, 38, 39, 40, 43, 45, 46, 46, 49], [-49, -48, -48, -47, -43, -43, -35, -34, -32, -27, -17, -16, -16, -16, -15, -15, -14, -11, -11, -9, -8, -8, -6, -5, -4, -1, -1, 1, 7, 7, 10, 10, 12, 25, 28, 28, 28, 28, 29, 30, 34, 34, 36, 40, 41, 41, 49, 49], [-48, -47, -47, -47, -43, -41, -40, -39, -39, -35, -33, -32, -29, -28, -25, -24, -18, -17, -17, -9, -4, 2, 2, 2, 11, 14, 15, 16, 19, 20, 20, 20, 22, 27, 28, 29, 34, 34, 35, 36, 40, 40, 40, 42, 43, 45, 47, 49], [-40, -39, -38, -34, -33, -30, -28, -26, -26, -24, -23, -21, -20, -20, -17, -16, -13, -12, -10, -8, -5, -3, -2, -1, 0, 2, 4, 7, 7, 7, 9, 10, 12, 13, 13, 14, 16, 19, 20, 22, 24, 26, 29, 32, 33, 39, 39, 40], [-49, -47, -47, -46, -43, -39, -35, -32, -29, -29, -28, -28, -28, -27, -27, -25, -20, -13, -11, -7, -6, -6, -5, -4, -3, 0, 3, 4, 5, 11, 12, 12, 14, 14, 16, 18, 23, 27, 27, 27, 28, 31, 36, 41, 42, 42, 46, 48], [-46, -45, -44, -38, -37, -35, -31, -31, -25, -22, -14, -14, -13, -12, -11, -10, -10, -8, -8, -4, -1, 1, 2, 2, 3, 4, 5, 8, 10, 10, 16, 22, 22, 25, 27, 30, 30, 33, 35, 36, 38, 38, 39, 39, 42, 42, 44, 44], [-49, -46, -42, -42, -42, -38, -36, -36, -32, -32, -30, -28, -25, -22, -22, -21, -21, -19, -17, -13, -9, -5, -4, 1, 2, 2, 3, 4, 10, 11, 11, 13, 19, 19, 19, 20, 24, 26, 27, 27, 33, 33, 37, 38, 39, 48, 48, 49], [-49, -49, -47, -46, -45, -44, -39, -39, -39, -38, -27, -27, -25, -21, -19, -17, -14, -13, -10, -8, -7, -4, 1, 4, 9, 11, 12, 12, 13, 28, 29, 29, 31, 32, 33, 33, 37, 37, 37, 39, 40, 40, 41, 43, 46, 48, 48, 48], [-42, -41, -40, -37, -35, -28, -24, -24, -23, -21, -21, -20, -18, -18, -17, -14, -14, -14, -9, -9, -7, -7, -4, -4, -1, -1, 0, 2, 4, 5, 7, 11, 12, 12, 19, 19, 24, 27, 32, 34, 36, 38, 39, 41, 45, 46, 46, 48], [-48, -44, -43, -43, -42, -39, -38, -37, -36, -34, -33, -32, -30, -28, -27, -15, -15, -12, -12, -11, -10, -10, -9, -8, -4, -1, 0, 1, 1, 3, 3, 3, 7, 7, 8, 12, 19, 21, 21, 22, 22, 33, 34, 39, 43, 46, 49, 49], [-49, -48, -45, -43, -42, -40, -39, -38, -37, -36, -31, -31, -25, -25, -23, -19, -19, -14, -14, -9, -7, -3, 1, 2, 3, 11, 17, 19, 20, 25, 25, 27, 27, 28, 30, 34, 37, 39, 43, 44, 44, 46, 46, 48, 48, 48, 49, 49], [-46, -43, -42, -42, -41, -41, -37, -35, -31, -27, -22, -19, -19, -18, -18, -18, -16, -14, -13, -11, -9, -5, -2, -2, -2, -2, 0, 0, 2, 4, 6, 11, 23, 27, 28, 29, 30, 30, 33, 34, 36, 36, 37, 37, 40, 41, 43, 49], [-46, -45, -45, -43, -40, -34, -25, -24, -23, -23, -21, -20, -17, -15, -14, -7, -6, -3, -2, -2, 8, 9, 9, 10, 11, 11, 11, 14, 15, 19, 23, 23, 24, 25, 26, 27, 27, 30, 35, 38, 38, 41, 43, 45, 47, 48, 49, 49], [-46, -45, -45, -42, -37, -37, -34, -29, -29, -24, -22, -20, -19, -18, -16, -14, -14, -13, -11, -11, -10, -9, -9, -6, -5, -3, -2, 0, 3, 4, 6, 8, 13, 15, 20, 21, 25, 25, 26, 31, 34, 35, 36, 37, 42, 45, 48, 48], [-49, -47, -46, -42, -38, -35, -27, -24, -21, -18, -8, -7, -6, -5, -5, -1, -1, 0, 1, 1, 2, 2, 2, 3, 5, 8, 9, 12, 12, 13, 13, 13, 25, 28, 29, 31, 31, 34, 36, 37, 38, 39, 39, 40, 42, 46, 49, 49], [-49, -48, -48, -46, -44, -42, -41, -40, -39, -37, -35, -35, -32, -29, -28, -25, -24, -19, -18, -15, -14, -13, -6, -4, -2, 7, 8, 11, 14, 17, 17, 20, 27, 27, 31, 31, 34, 36, 40, 40, 40, 42, 42, 44, 45, 47, 47, 49], [-47, -45, -43, -42, -39, -39, -34, -33, -30, -26, -26, -19, -19, -17, -15, -14, -13, -11, -9, -8, -7, -1, 5, 8, 10, 10, 11, 11, 12, 16, 17, 18, 19, 25, 25, 25, 26, 28, 28, 29, 29, 30, 35, 35, 39, 41, 44, 47" POLICEMEN_CATCH_THIEVES,"static int f_filled ( char arr [ ] , int n , int k ) { int res = 0 ; ArrayList < Integer > thi = new ArrayList < Integer > ( ) ; ArrayList < Integer > pol = new ArrayList < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 'P' ) pol . add ( i ) ; else if ( arr [ i ] == 'T' ) thi . add ( i ) ; } int l = 0 , r = 0 ; while ( l < thi . size ( ) && r < pol . size ( ) ) { if ( Math . abs ( thi . get ( l ) - pol . get ( r ) ) <= k ) { res ++ ; l ++ ; r ++ ; } else if ( thi . get ( l ) < pol . get ( r ) ) l ++ ; else r ++ ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 0, 0, 0, 1]; char [] [] param0 = [['a', 'b', 'b', 'd', 'e', 'e', 'f', 'g', 'g', 'g', 'i', 'j', 'o', 'p', 'q', 'q', 'q', 'q', 'r', 'r', 's', 'u', 'x', 'y', 'y', 'c', 'd', 'h', 'i', 'i', 'i', 'i', 'k', 'k', 'l', 'l', 'l', 'l', 'm', 'p', 'r', 'r', 's', 't', 't', 'u', 'x', 'z'], ['7', '6', '0', '1', '0', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['y', 'k', 's', 'i', 's', 'r', 'i', 'z', 'y', 'f', 'e', 'u', 'y', 'g', 'f', 'f', 's', 'v', 'v', 'd', 'v', 'v', 's', 'd', 'k', 's', 'f', 'v', 'g', 'i', 'j', 'p', 'j', 'k', 'r', 'n', 'm', 'o', 'l', 'x', 'y', 'u', 'y', 'k', 'w'], ['1', '1', '5', '8', '8'], ['0', '1', '0', '0', '1', '1', '1', '0', '0', '0', '1', '0', '1', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '0', '0', '1', '1', '1', '0', '0', '0', '0', '0', '0'], ['a', 'i', 'k', 'q', 'q', 'x', 'z', 'f', 'g'], ['7', '0', '6', '9', '7', '5', '1', '3', '9', '8', '0', '0', '1', '3', '9', '2', '5', '5', '2', '7', '9', '3', '3', '9', '3', '8', '5', '5', '0', '4', '6', '2', '7', '4', '0', '4', '6', '4', '2', '3'], ['0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1'], ['d', 'c', 'p', 'h', 'g', 'o', 'u', 'p', 't', 'g', 'e', 'u', 'n', 'e', 'u']]; int [] param1 = [33, 3, 9, 24, 2, 23, 5, 35, 8, 11]; int [] param2 = [45, 3, 10, 44, 2, 18, 8, 28, 10, 12]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PALINDROMIC_SUBSEQUENCE_GIVEN_STRING,"static int f_filled ( String str ) { int N = str . length ( ) ; int [ ] [ ] cps = new int [ N + 1 ] [ N + 1 ] ; for ( int i = 0 ; i < N ; i ++ ) cps [ i ] [ i ] = 1 ; for ( int L = 2 ; L <= N ; L ++ ) { for ( int i = 0 ; i < N ; i ++ ) { int k = L + i - 1 ; if ( k < N ) { if ( str . charAt ( i ) == str . charAt ( k ) ) cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] + 1 ; else cps [ i ] [ k ] = cps [ i ] [ k - 1 ] + cps [ i + 1 ] [ k ] - cps [ i + 1 ] [ k - 1 ] ; } } } return cps [ 0 ] [ N - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 10, 2798, 20, 2, 270, 8, 2, 563, 3]; string [] param0 = [""r"", ""2956350"", ""11100111110101"", ""tztdliifad"", ""98"", ""1100100001"", ""okwgeatf"", ""19"", ""00010110100"", ""cyq""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBERS_CAN_CONSTRUCTED_USING_TWO_NUMBERS,"static int f_filled ( int n , int x , int y ) { boolean [ ] arr = new boolean [ n + 1 ] ; if ( x <= n ) arr [ x ] = true ; if ( y <= n ) arr [ y ] = true ; int result = 0 ; for ( int i = Math . min ( x , y ) ; i <= n ; i ++ ) { if ( arr [ i ] ) { if ( i + x <= n ) arr [ i + x ] = true ; if ( i + y <= n ) arr [ i + y ] = true ; result ++ ; } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 9, 30, 1, 0, 2, 0, 4, 13, 1]; int [] param0 = [23, 56, 30, 51, 21, 69, 12, 44, 99, 46]; int [] param1 = [16, 95, 63, 89, 99, 63, 69, 52, 65, 58]; int [] param2 = [16, 6, 1, 46, 38, 50, 73, 9, 10, 37]; 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); } " HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_1,"static int f_filled ( int n ) { int sum ; for ( sum = 0 ; n > 0 ; sum += n % 10 , n /= 10 ) ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 11, 13, 13, 7, 3, 16, 17, 13, 5]; int [] param0 = [50, 92, 49, 94, 7, 30, 88, 98, 94, 23]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBERS_THAT_DONT_CONTAIN_3,"static int f_filled ( int n ) { if ( n < 3 ) return n ; if ( n >= 3 && n < 10 ) return n - 1 ; int po = 1 ; while ( n / po > 9 ) po = po * 10 ; int msd = n / po ; if ( msd != 3 ) return f_filled ( msd ) * f_filled ( po - 1 ) + f_filled ( msd ) + f_filled ( n % po ) ; else return f_filled ( msd * po - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [67, 68, 2, 26, 44, 26, 26, 13, 58, 57]; int [] param0 = [85, 86, 3, 35, 59, 38, 33, 15, 75, 74]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_BINARY_STRINGS_WITHOUT_CONSECUTIVE_1S,"static int f_filled ( int n ) { int a [ ] = new int [ n ] ; int b [ ] = new int [ n ] ; a [ 0 ] = b [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { a [ i ] = a [ i - 1 ] + b [ i - 1 ] ; b [ i ] = a [ i - 1 ] ; } return a [ n - 1 ] + b [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 13, 144, 1597, 17711, 196418, 2178309, 24157817, 267914296, 433494437, 1134903170]; int [] param0 = [3, 5, 10, 15, 20, 25, 30, 35, 40, 41, 43]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " HOW_TO_TURN_OFF_A_PARTICULAR_BIT_IN_A_NUMBER,"static int f_filled ( int n , int k ) { if ( k <= 0 ) return n ; return ( n & ~ ( 1 << ( k - 1 ) ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [49, 59, 76, 27, 61, 67, 63, 85, 26, 16]; int [] param0 = [49, 59, 76, 27, 61, 67, 63, 85, 90, 24]; int [] param1 = [31, 28, 25, 22, 19, 16, 13, 10, 7, 4]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_OF_SOLUTIONS_OF_X2_1_MOD_P_IN_GIVEN_RANGE,"static int f_filled ( int n , int p ) { int ans = 0 ; for ( int x = 1 ; x < p ; x ++ ) { if ( ( x * x ) % p == 1 ) { int last = x + p * ( n / p ) ; if ( last > n ) last -= p ; ans += ( ( last - x ) / p + 1 ) ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [11, 1, 6, 4, 1, 11, 3, 17, 1, 9]; int [] param0 = [94, 11, 88, 85, 74, 96, 49, 50, 21, 81]; int [] param1 = [36, 79, 63, 43, 89, 33, 51, 24, 26, 19]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES_1,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > hmap = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( hmap . containsKey ( arr [ i ] ) ) { int val = hmap . get ( arr [ i ] ) ; hmap . put ( arr [ i ] , val + 1 ) ; } else hmap . put ( arr [ i ] , 1 ) ; } for ( Integer a : hmap . keySet ( ) ) { if ( hmap . get ( a ) % 2 != 0 ) return a ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [49, -96, 0, 79, -90, 1, 2, 86, 0, 11]; int [] [] param0 = [[49, 90], [-96, 94, 92, -24, 48, 54, -30, -86, 28, -18, 12, -64, -36, 68, 68, -78, -6, 30, -84, 20, 52, -36, 40, -62, 90, -48, 86, 98, 12, 44, 98, -66, 52, 34, 36, 76, -50, -20, -20, -20], [0, 1], [79, 55, 18, 99, 38, 93, 19, 49, 21, 74, 16, 76, 82, 52, 86, 17, 42, 9, 6, 63, 1, 40, 75, 59, 41, 81], [-90, -84, -82, -68, -66, -66, -60, -60, -48, -44, -36, -34, -30, -16, -14, -12, -10, -6, 2, 10, 10, 14, 22, 26, 30, 34, 46, 50, 52, 62, 64, 64, 66, 72, 74, 78, 78, 82, 84, 88, 92], [1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1], [2, 4, 5, 7, 7, 18, 18, 23, 23, 25, 25, 31, 41, 43, 45, 46, 52, 52, 55, 64, 69, 69, 80, 81, 84, 90, 91, 93, 94, 94, 94, 94, 96, 98, 99], [86, 66, -8, 2, -18, -22, 38, 4, -38, -54, 78, 64, 78, 20, -32, 84, -70, 66, -46, 12, -12, 8, 44, 14, 20], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [11, 4, 98, 38, 20, 41, 1, 8]]; int [] param1 = [2, 40, 2, 26, 41, 26, 35, 25, 30, 8]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_OF_WAYS_TO_FILL_A_N_X_4_GRID_USING_1_X_4_TILES,"static int f_filled ( int n ) { int [ ] dp = new int [ n + 1 ] ; dp [ 0 ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { if ( i >= 1 && i <= 3 ) dp [ i ] = 1 ; else if ( i == 4 ) dp [ i ] = 2 ; else { dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ] ; } } return dp [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [188941273, 657, 685792227, 52054840, 59864, 1728, 95, 2385, 5453761, 3]; int [] param0 = [61, 22, 65, 57, 36, 25, 16, 26, 50, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY,"static int f_filled ( int [ ] arr , int n ) { int count = 0 ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i ] != arr [ i + 1 ] && arr [ i ] != arr [ i + 1 ] - 1 ) count += arr [ i + 1 ] - arr [ i ] - 1 ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [62, 168, 0, 69, 146, 0, 54, 161, 0, 33]; int [] [] param0 = [[4, 4, 5, 7, 7, 9, 13, 15, 18, 19, 25, 27, 27, 29, 32, 36, 48, 51, 53, 53, 55, 65, 66, 67, 72, 74, 74, 76, 77, 79, 80, 81, 82, 83, 83, 86, 87, 97, 98, 98, 99], [-90, -90, -88, -84, -84, -84, -80, -74, -52, -26, -26, -16, -8, 6, 14, 16, 34, 64, 72, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [10, 12, 12, 13, 13, 23, 25, 26, 29, 32, 39, 43, 43, 54, 62, 79, 92], [-94, -86, -72, -64, -64, -58, -56, -56, -56, -56, -54, -54, -52, -42, -42, -40, -36, -32, -28, -22, -20, -18, -12, -8, -6, -4, 0, 2, 4, 10, 16, 30, 32, 48, 48, 60, 70, 74, 76, 84], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 5, 8, 12, 16, 16, 17, 20, 20, 23, 26, 26, 27, 28, 32, 34, 40, 40, 41, 41, 44, 45, 47, 49, 51, 52, 54, 57, 60, 62, 63, 64, 66, 68, 69, 70, 71, 76, 77, 80, 80, 80, 90, 91, 92, 94, 96, 98, 99], [-98, -92, -92, -92, -92, -86, -78, -74, -72, -68, -60, -52, -48, -48, -46, -46, -44, -40, -38, -26, -18, 2, 4, 4, 10, 14, 14, 16, 20, 38, 48, 48, 50, 56, 60, 66, 74, 76, 80, 84, 88, 96, 96, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [49, 66, 84]]; int [] param1 = [41, 21, 26, 17, 40, 34, 49, 44, 34, 3]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_OF_WAYS_TO_PARTITION_A_SET_INTO_K_SUBSETS_1,"static int f_filled ( int n , int k ) { int [ ] [ ] dp = new int [ n + 1 ] [ k + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) dp [ i ] [ 0 ] = 0 ; for ( int i = 0 ; i <= k ; i ++ ) dp [ 0 ] [ k ] = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= k ; j ++ ) if ( j == 1 || i == j ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = j * dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] ; return dp [ n ] [ k ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [171798901, 9330, 1, 0, 512060978, 78, 1]; int [] param0 = [16, 10, 6, 9, 17, 13, 14]; int [] param1 = [4, 3, 1, 10, 11, 12, 14]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PERFECT_REVERSIBLE_STRING,"static boolean f_filled ( String str ) { int i = 0 , j = str . length ( ) - 1 ; while ( i < j ) { if ( str . charAt ( i ) != str . charAt ( j ) ) return false ; i ++ ; j -- ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, true, true, true, false, false, false, true]; string [] param0 = [""ab"", ""303"", ""11110000"", ""aba"", ""404"", ""10101"", ""abab"", ""6366"", ""001"", """"]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K,"static boolean f_filled ( int a1 [ ] , int a2 [ ] , int a3 [ ] , int n1 , int n2 , int n3 , int sum ) { for ( int i = 0 ; i < n1 ; i ++ ) for ( int j = 0 ; j < n2 ; j ++ ) for ( int k = 0 ; k < n3 ; k ++ ) if ( a1 [ i ] + a2 [ j ] + a3 [ k ] == sum ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, true, true, true, false, false, false, false]; int [] [] param0 = [[4, 9, 10, 19, 24, 25, 26, 30, 36, 43, 44, 49, 52, 62, 66, 69, 72, 77, 80, 80, 82, 84, 90, 93, 94, 98], [-24, -80, -72, 80, -96, -94, 64, 18, 12, 16, 74, 16, 54, 66, -96, -90, 54, 72, -32, -2, 90, -18, -98, 12, -42, -30, -82, -56, -86, 40], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [28, 15, 21, 28, 85, 68, 24], [-86, -82, -66, -44, -44, -38, -22, -6, -2, 14, 26, 40, 54, 58, 60, 66, 72, 80, 94, 96, 98], [1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1], [44, 53, 85, 85, 86, 88, 93], [70, -38, 62, -34, 74, -32, -58, -34, -54], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [41, 64, 39, 96, 54, 54, 57, 4, 82, 43, 44, 56, 1]]; int [] [] param1 = [[4, 8, 17, 20, 22, 25, 27, 30, 31, 33, 35, 35, 38, 41, 49, 51, 60, 61, 66, 67, 69, 82, 84, 85, 86, 88], [30, -60, -24, 18, 40, 44, -40, 62, 66, -38, 50, -74, -42, -86, -82, -8, 50, -72, -2, -48, -38, -20, -8, 56, -32, 68, 94, 80, -48, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [57, 46, 47, 49, 16, 81, 60], [-96, -86, -74, -56, -52, -42, -32, -22, -16, -10, -4, -4, 10, 42, 48, 52, 58, 62, 84, 90, 96], [0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1], [4, 5, 8, 15, 29, 40, 91], [48, -86, -18, 14, 88, 92, -56, -8, -74], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [44, 58, 40, 87, 22, 82, 8, 81, 88, 42, 15, 14, 81]]; int [] [] param2 = [[12, 14, 17, 20, 22, 27, 29, 31, 32, 38, 41, 43, 56, 59, 59, 64, 66, 67, 68, 69, 71, 76, 83, 83, 85, 99], [-24, 80, 50, -56, -92, 20, 86, -42, -30, 96, 40, -32, -64, 54, -38, -72, -70, 54, -28, 98, 60, 98, -12, -30, -30, 68, -66, 68, -58, 52], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [76, 49, 6, 44, 71, 24, 57], [-92, -92, -90, -82, -62, -44, -42, -40, -38, -36, -22, -20, -8, 12, 22, 26, 30, 44, 54, 64, 86], [1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0], [30, 53, 71, 75, 76, 82, 84], [8, 8, 32, 76, 76, 94, 22, -60, -42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [64, 20, 24, 42, 37, 46, 6, 47, 12, 93, 8, 5, 11]]; int [] param3 = [25, 26, 14, 6, 13, 25, 5, 6, 15, 7]; int [] param4 = [18, 22, 14, 5, 20, 25, 3, 6, 14, 8]; int [] param5 = [16, 20, 14, 5, 17, 23, 4, 6, 10, 6]; int [] param6 = [222, 21, 2, 73, 6, 0, 3, 7, 13, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i], param6[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_NUMBER_WAYS_TILE_FLOOR_SIZE_N_X_M_USING_1_X_M_SIZE_TILES,"static int f_filled ( int n , int m ) { int count [ ] = new int [ n + 1 ] ; count [ 0 ] = 0 ; int i ; for ( i = 1 ; i <= n ; i ++ ) { if ( i > m ) count [ i ] = count [ i - 1 ] + count [ i - m ] ; else if ( i < m ) count [ i ] = 1 ; else count [ i ] = 2 ; } return count [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [41, 131, 1, 1, 90, 1, 89625, 6, 11, 1578]; int [] param0 = [93, 17, 38, 33, 78, 40, 95, 12, 69, 78]; int [] param1 = [54, 4, 39, 64, 35, 61, 16, 8, 60, 21]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_OFDIFFERENT_WAYS_EXPRESS_N_SUM_1_3_4,"static int f_filled ( int n ) { int DP [ ] = new int [ n + 1 ] ; DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1 ; DP [ 3 ] = 2 ; for ( int i = 4 ; i <= n ; i ++ ) DP [ i ] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ] ; return DP [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [821223649, 119814916, 6677056, 974169, 54289, 7921, 441, 64, 4]; int [] param0 = [44, 40, 34, 30, 24, 20, 14, 10, 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); } " COUNT_OF_OCCURRENCES_OF_A_101_PATTERN_IN_A_STRING,"static int f_filled ( String str ) { int len = str . length ( ) ; boolean oneSeen = false ; int count = 0 ; for ( int i = 0 ; i < len ; i ++ ) { char getChar = str . charAt ( i ) ; if ( getChar == '1' && oneSeen == true ) { if ( str . charAt ( i - 1 ) == '0' ) count ++ ; } if ( getChar == '1' && oneSeen == false ) oneSeen = true ; if ( getChar != '0' && str . charAt ( i ) != '1' ) oneSeen = false ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 3, 3, 0, 0, 0, 0, 0, 0, 0]; string [] param0 = [""1001ab010abc01001"", ""1001010001"", ""010100010100"", ""dlcu"", ""7072430592"", ""011"", ""pnjpypyoza"", ""1037"", ""111"", ""hxk""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_REMOVAL_FROM_ARRAY_WHEN_REMOVAL_TIME_WAITING_TIME,"static int f_filled ( int arr [ ] , int n ) { int count = 0 ; int cummulative_sum = 0 ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] >= cummulative_sum ) { count ++ ; cummulative_sum += arr [ i ] ; } } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 5, 5, 3, 6, 11, 5, 6, 13, 5]; int [] [] param0 = [[7, 33, 34, 42, 42, 45, 73], [-98, -90, -80, -66, -64, -62, -48, -30, -20, -10, 4, 6, 12, 14, 32, 42, 44, 44, 52, 64, 86, 92, 94], [0, 0, 0, 0, 1], [11, 44, 71, 82, 85, 89], [-96, -92, -78, -72, -68, -58, -52, -50, -50, -48, -42, -32, -20, -18, -4, 0, 0, 2, 18, 18, 20, 24, 32, 34, 36, 38, 38, 60, 66, 68, 70, 72, 72, 74, 76, 96, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8, 9, 10, 11, 12, 15, 17, 19, 20, 21, 24, 30, 33, 35, 36, 39, 41, 41, 42, 54, 62, 63, 68, 70, 71, 72, 77, 85, 86, 86, 94, 95, 97, 97], [-94, -90, -72, -70, -66, -60, -24, -16, 4, 4, 10, 22, 28, 36, 46, 60, 70, 72, 76, 92, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [7, 10, 12, 16, 20, 28, 31, 40, 42, 47, 53, 57, 59, 63, 63, 67, 69, 84, 90, 97]]; int [] param1 = [5, 23, 5, 6, 37, 21, 34, 21, 24, 20]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_PAGE_REPLACEMENT_ALGORITHMS_SET_2_FIFO,"static int f_filled ( int pages [ ] , int n , int capacity ) { HashSet < Integer > s = new HashSet < > ( capacity ) ; Queue < Integer > indexes = new LinkedList < > ( ) ; int page_faults = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( s . size ( ) < capacity ) { if ( ! s . contains ( pages [ i ] ) ) { s . add ( pages [ i ] ) ; page_faults ++ ; indexes . add ( pages [ i ] ) ; } } else { if ( ! s . contains ( pages [ i ] ) ) { int val = indexes . peek ( ) ; indexes . poll ( ) ; s . remove ( val ) ; s . add ( pages [ i ] ) ; indexes . add ( pages [ i ] ) ; page_faults ++ ; } } } return page_faults ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 30, 2, 13, 9, 2, 16, 25, 2, 15]; int [] [] param0 = [[4, 4, 6, 7, 8, 11, 13, 18, 26, 35, 36, 37, 45, 46, 46, 47, 48, 49, 51, 52, 53, 56, 61, 74, 75, 77, 80, 83, 85, 86, 87, 90, 93, 95, 97, 98, 99, 99], [78, -48, 50, -20, -6, 58, -8, 66, 72, 68, 4, 80, 58, -26, -82, -56, 92, 76, 20, 82, -46, 86, 38, 60, -62, -48, 76, 8, -66, -4, -98, -96, -52, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [98, 78, 94, 42, 62, 83, 7, 62, 60, 94, 16, 28, 50, 15, 18, 71, 86, 47, 62, 89], [-82, -70, -68, -56, -50, -44, 4, 18, 28, 30, 30, 42, 66, 78, 80], [1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0], [4, 5, 13, 15, 18, 28, 32, 40, 46, 46, 55, 57, 61, 63, 65, 68, 77, 79, 79, 96], [-2, 82, 2, -74, -6, -24, 54, -74, -98, 8, -94, -60, -42, -38, 36, -38, -58, -70, -28, -34, 70, -6, -2, -76, -40, -4, 0, -4, 76, 48, -34, -26, -48, -58, -88, -44, 20, -22, 78], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 90, 28, 71, 69, 45, 92, 63, 72, 76, 47, 85, 36, 59, 88, 46, 28, 19, 50, 31, 63, 13]]; int [] param1 = [36, 33, 19, 15, 9, 25, 17, 31, 26, 15]; int [] param2 = [37, 23, 13, 11, 11, 25, 18, 24, 24, 12]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_OPERATIONS_MAKE_STRINGAB_FREE,"static int f_filled ( char [ ] s ) { int b_count = 0 ; int res = 0 ; for ( int i = 0 ; i < s . length ; i ++ ) { if ( s [ s . length - i - 1 ] == 'a' ) { res = ( res + b_count ) ; b_count = ( b_count * 2 ) ; } else { b_count += 1 ; } } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 5, 0, 0, 0, 0, 0, 9]; char [] [] param0 = [['l', 'k', 'y'], ['1', '0', '9', '5', '7', '4', '6', '0', '4', '8', '0', '1', '4', '1', '8', '9', '1', '5', '4', '4', '8', '0', '5', '8', '9', '8', '1', '9', '7', '0', '4', '2', '5', '2', '4', '6', '6', '5', '3', '1', '1', '0', '6'], ['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'], ['a', 'l', 'a', 'l', 'g', ' ', 'p', 'b'], ['0', '1', '1', '1', '2', '2', '4', '5', '5', '5', '6', '6', '6', '7', '9'], ['0'], [' ', 'a', 'b', 'b', 'b', 'b', 'd', 'g', 'g', 'h', 'h', 'h', 'i', 'i', 'j', 'j', 'j', 'l', 'm', 'n', 'o', 'q', 'u', 'u', 'x', 'y', 'y', 'z', 'z', 'c', 'c', 'e', 'f', 'h', 'k', 'o', 'p', 'q', 'q', 's', 'v', 'z'], ['2', '5', '7', '5', '2', '3', '9'], ['0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['a', 'z', 'm', ' ', 'l', 'x', 'x', 'b', 'i', 'j']]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_DIFFERENCE_EQUAL_K,"static int f_filled ( int arr [ ] , int n , int k ) { int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 0, 0, 3, 0, 0, 2, 0, 0, 3]; int [] [] param0 = [[9, 14, 17, 19, 22, 23, 23, 27, 30, 31, 34, 37, 37, 39, 39, 42, 57, 61, 68, 73, 77, 79, 91, 96, 97], [-78, -42, 28, -88, 18, -52], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [8, 46, 57, 28, 80, 2, 75, 57, 83, 45, 32, 49, 77, 30, 94, 33, 23, 29, 35, 81, 85], [-90, -72, -72, -62, -62, -54, -54, -52, -48, -38, -22, -22, -22, -12, -12, -8, -8, -8, -6, -6, -2, 6, 12, 26, 26, 28, 28, 38, 40, 48, 52, 52, 58, 60, 68, 70, 72, 76, 76, 76, 92], [0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1], [3, 13, 19, 23, 27, 32, 49, 52, 54, 57, 58, 58, 63, 67, 68, 68, 69, 70, 75, 80, 86, 90, 91, 95], [-56, 40, -66, 42, 8, -40, -8, -42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [99, 12, 90, 10, 86, 86, 81, 19, 1, 1, 98, 82, 34, 39, 34, 1, 54, 47, 39, 82, 21, 50, 82, 41, 98, 47, 88, 46, 72, 28, 28, 29, 60, 87, 92, 53, 93, 29, 74, 75, 11, 32, 48, 47, 85, 16, 20]]; int [] param1 = [19, 3, 16, 15, 22, 45, 19, 7, 16, 24]; int [] param2 = [19, 4, 14, 11, 25, 39, 21, 6, 28, 45]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_DIFFERENCE_EQUAL_K_1,"static int f_filled ( int arr [ ] , int n , int k ) { int count = 0 ; Arrays . sort ( arr ) ; int l = 0 ; int r = 0 ; while ( r < n ) { if ( arr [ r ] - arr [ l ] == k ) { count ++ ; l ++ ; r ++ ; } else if ( arr [ r ] - arr [ l ] > k ) l ++ ; else r ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 14, 1, 3, 4, 1, 0, 0, 0, 0]; int [] [] param0 = [[5, 5, 10, 19, 29, 32, 40, 60, 65, 70, 72, 89, 92], [-98, -90, -88, -82, -80, -78, -74, -74, -72, -62, -58, -58, -56, -52, -48, -46, -38, -38, -30, -12, -10, 4, 8, 8, 14, 22, 24, 26, 36, 40, 40, 48, 56, 58, 58, 58, 60, 62, 64, 68, 68, 74, 84], [0, 0, 1], [1, 7, 13, 14, 16, 29, 34, 42, 44, 49, 59, 62, 65, 66, 70, 71, 73, 73, 76, 80, 96, 96], [-98, -88, -58, -56, -48, -34, -22, -18, -14, -14, -8, -4, -2, 2, 18, 38, 42, 46, 54, 68, 70, 90, 94, 96, 98], [0, 1, 1], [11, 43, 50, 58, 60, 68, 75], [-80, -56, -10, 0, 6, 8, 24, 42, 52, 86, 88, 94], [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], [4, 7, 9, 9, 14, 34, 34, 36, 50, 54, 80, 81, 99]]; int [] param1 = [13, 43, 3, 22, 25, 3, 7, 12, 31, 13]; int [] param2 = [12, 36, 1, 16, 22, 1, 4, 9, 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])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_NUMBER_TIMES_STRING_OCCURS_GIVEN_STRING_1,"static int f_filled ( String a , String b ) { int m = a . length ( ) ; int n = b . length ( ) ; int lookup [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; ++ i ) lookup [ 0 ] [ i ] = 0 ; for ( int i = 0 ; i <= m ; ++ i ) lookup [ i ] [ 0 ] = 1 ; for ( int i = 1 ; i <= m ; i ++ ) { for ( int j = 1 ; j <= n ; j ++ ) { if ( a . charAt ( i - 1 ) == b . charAt ( j - 1 ) ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ] ; else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ] ; } } return lookup [ m ] [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 6, 0, 2, 0, 1, 6, 35, 0]; string [] param0 = [""fzokcdz lav"", ""2"", ""1000001110"", ""iaoybzgiwho"", ""211806"", ""1"", ""cvaqtg"", ""6265187228"", ""10111101101000"", ""vei""]; string [] param1 = [""fka"", ""187012"", ""0"", ""oa"", ""10"", ""001011100"", ""ct"", ""628"", ""01111"", ""bigsvkqg""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_TWO_SORTED_ARRAYS_WHOSE_SUM_EQUAL_GIVEN_VALUE_X,"static int f_filled ( int [ ] arr1 , int [ ] arr2 , int m , int n , int x ) { int count = 0 ; for ( int i = 0 ; i < m ; i ++ ) for ( int j = 0 ; j < n ; j ++ ) if ( ( arr1 [ i ] + arr2 [ j ] ) == x ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 5, 0, 0, 0, 0, 0, 0, 0, 0]; int [] [] param0 = [[11, 13, 16, 23, 26, 28, 31, 34, 37, 39, 44, 48, 56, 59, 79, 91, 96, 98], [50, 14, -98, 14, 90, 36, 66, 44, 10, -98, -24, -36, -32, -50], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [88, 14, 29, 87, 86, 58], [-98, -92, -88, -86, -82, -76, -72, -66, -56, -48, -34, -28, -28, -26, -20, -18, -18, -16, -16, -12, -4, 0, 6, 12, 16, 20, 22, 30, 34, 34, 36, 56, 58, 62, 64, 80, 82, 94], [1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0], [70, 70, 74], [-20, -12, -50, 76, 24, 64, -22, -4, -68], [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], [68, 75, 51, 45, 73, 95, 48, 53, 70, 41, 65, 47, 46, 43, 79, 29, 50]]; int [] [] param1 = [[1, 1, 9, 14, 17, 23, 26, 31, 33, 36, 53, 60, 71, 75, 76, 84, 87, 88], [34, -6, -66, 0, -6, 82, 60, -98, -8, 60, -2, 4, 22, 76], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [91, 95, 64, 4, 63, 35], [-94, -90, -88, -84, -82, -78, -76, -72, -70, -58, -58, -46, -42, -40, -40, -32, -22, -20, -18, -12, -8, -6, 6, 6, 18, 20, 34, 46, 60, 62, 66, 72, 72, 76, 76, 78, 92, 98], [1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0], [15, 55, 84], [18, 98, -88, 86, 72, -44, 82, 94, 58], [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], [4, 6, 76, 65, 16, 13, 85, 43, 31, 14, 81, 90, 24, 87, 40, 25, 88]]; int [] param2 = [9, 11, 14, 3, 34, 39, 1, 5, 27, 10]; int [] param3 = [15, 12, 9, 5, 32, 26, 1, 4, 26, 10]; int [] param4 = [11, 8, 12, 5, 23, 34, 1, 7, 37, 9]; 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_1,"static int f_filled ( int arr1 [ ] , int arr2 [ ] , int m , int n , int x ) { int count = 0 ; HashSet < Integer > us = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < m ; i ++ ) us . add ( arr1 [ i ] ) ; for ( int j = 0 ; j < n ; j ++ ) if ( us . contains ( x - arr2 [ j ] ) ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 0, 0, 0, 0, 0, 0, 0, 0, 2]; int [] [] param0 = [[1, 2, 5, 5, 9, 11, 12, 14, 16, 18, 35, 36, 39, 44, 50, 52, 52, 59, 69, 81, 82, 84, 85, 87, 87, 87, 88, 88, 89, 90, 90, 92, 97], [52, 28, -38, 78, -86, 78, -48, -70, -80, 28, -8, 60, -28, 90, 6, 76, 32, -54, 30, 30, -32, -24, -36, 62, 36, -66, 56, 92, -20, 90, 32], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [91, 95, 13, 13, 76, 18, 36, 86, 26, 13, 17, 68, 58, 42, 38, 9, 42, 90, 14, 74, 38, 64, 15], [-96, -94, -94, -92, -74, -70, -66, -54, -48, -20, -18, -10, -6, -2, 2, 18, 36, 48, 52, 58, 68, 74, 88, 90, 94], [1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0], [7, 18, 19, 20, 24, 25, 25, 27, 30, 35, 39, 42, 58, 59, 63, 64, 64, 66, 66, 68, 69, 77, 86, 93], [86, 44, 10, 80, 12, 52, -92, 2, 42, -32, -14, 2, -42, 40, 96, 22, 58, -90, -20, 22, 96, 10, -92, -28, -28, 80, 36, 72, -2, 32, -46, 62, -58, 20, 22, 32, -98, -2, -42, -90, 10, 70, 54, -32], [0, 0, 1, 1, 1, 1], [43, 2, 4, 99, 45, 80, 27, 8, 64, 77, 57, 55, 71, 67, 51, 42, 58, 70, 5, 62, 55, 20, 61, 47, 66, 80, 70, 24, 56, 22, 58, 63, 61, 41, 20, 97, 47]]; int [] [] param1 = [[5, 5, 8, 20, 20, 24, 25, 29, 34, 37, 43, 45, 48, 49, 59, 60, 68, 70, 70, 72, 72, 75, 76, 77, 79, 81, 84, 85, 86, 88, 95, 96, 96], [-88, -32, 30, 32, -46, 62, -92, -90, -18, -18, 10, 16, 60, -40, 32, -88, 60, -82, 76, 50, 86, -82, -48, -68, -42, 34, 4, 0, 98, 92, -78], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [16, 96, 8, 35, 12, 27, 81, 21, 32, 82, 95, 81, 53, 76, 72, 16, 9, 16, 61, 1, 36, 71, 28], [-92, -72, -72, -64, -58, -52, -30, -28, -24, -24, -16, -10, -2, 4, 12, 22, 30, 38, 44, 62, 64, 68, 86, 88, 90], [1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0], [2, 2, 18, 20, 22, 22, 31, 35, 36, 40, 41, 41, 41, 42, 42, 43, 45, 61, 79, 83, 87, 91, 95, 96], [-4, -76, -98, 14, 30, -10, -10, 62, 88, -94, -74, -82, 84, 44, 58, 8, -42, -66, -18, 68, -78, 42, -32, 38, -98, 38, -78, 42, 86, -38, -6, -72, -44, 8, -6, -48, -62, 82, 94, -92, -56, 28, -54, 34], [0, 0, 1, 1, 1, 1], [11, 66, 41, 17, 93, 25, 24, 17, 12, 33, 62, 86, 48, 68, 36, 36, 39, 82, 7, 66, 5, 48, 27, 9, 56, 6, 61, 91, 98, 74, 61, 63, 98, 96, 57, 63, 85]]; int [] param2 = [17, 30, 13, 11, 19, 18, 22, 26, 5, 24]; int [] param3 = [29, 27, 11, 12, 14, 19, 18, 36, 3, 29]; int [] param4 = [32, 17, 8, 15, 21, 29, 18, 31, 5, 21]; 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); } " FIND_MAXIMUM_AVERAGE_SUBARRAY_OF_K_LENGTH,"static int f_filled ( int [ ] arr , int n , int k ) { if ( k > n ) return - 1 ; int [ ] csum = new int [ n ] ; csum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ] ; int max_sum = csum [ k - 1 ] , max_end = k - 1 ; for ( int i = k ; i < n ; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ] ; if ( curr_sum > max_sum ) { max_sum = curr_sum ; max_end = i ; } } return max_end - k + 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [9, -1, 1, 0, 15, 4, -1, 4, 2, -1]; int [] [] param0 = [[2, 4, 6, 19, 21, 23, 32, 34, 47, 51, 56, 57, 57, 65, 68, 68, 69, 70, 71, 73, 74, 74, 77, 77, 79, 82, 82, 86, 87, 87, 88, 89, 90, 91, 92], [24, 62, -32, -28, 42, -46, -96, -70, -68, 60, 44, 34, -30, 96, -26, 92, 62, 42, -46, -38, 44, 54, -94, 52, 66, 68, -96, -58, 84, -2, 66, 30, 42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [94, 6, 48, 34, 31], [-98, -88, -82, -80, -76, -70, -70, -60, -60, -52, -50, -46, -44, -44, -44, -20, -18, -12, -12, -12, -10, -8, -6, -4, 4, 4, 18, 28, 32, 34, 42, 42, 44, 46, 48, 54, 60, 70, 70, 72, 78, 78, 78, 78, 84, 86, 90, 96, 98], [0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0], [1, 5, 13, 17, 26, 26, 32, 35, 38, 38, 39, 45, 52, 58, 60, 61, 62, 63, 82, 83, 85, 89, 89, 91], [-68, -52, 4, -90, 90, 88, 38, -18, 86, 4, 14, -32, -14, -44, -88, -50, -12, -26, -68, -20, -30, 22, 0, 14, -40, 58, -6, 28, -44, 8, 28, 96, -46, -12], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [17, 33, 36, 34, 32, 10, 37, 48, 47, 32, 21, 18, 75, 8, 18, 52, 21, 73, 25, 25, 80, 32, 10, 24, 1, 89, 7, 42, 86, 85, 73, 12, 20, 20, 1, 74, 77, 4, 24, 74, 8]]; int [] param1 = [29, 23, 32, 4, 45, 15, 13, 32, 13, 20]; int [] param2 = [20, 31, 31, 3, 30, 8, 22, 22, 11, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int result = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) { int product = arr [ i ] * arr [ j ] ; for ( int k = 0 ; k < n ; k ++ ) { if ( arr [ k ] == product ) { result ++ ; break ; } } } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 6, 946, 18, 15, 153, 0, 0, 496, 0]; int [] [] param0 = [[3, 7, 26, 40, 46, 89, 99], [98, 42, -24, -60, 74, 86, 6, 8, 72, -58, 38, -20, 6, -6, 8, 48, -34, 30, 60, 66, 38, -54, 8, -94, -8, 0, -64, -94, -94, -72, -84, -36, 88, -62, -88, 46, -4, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [37, 97, 57, 82, 29, 68, 94, 38, 81, 48, 13, 84, 57, 5, 27, 87, 11, 35, 82, 53, 67, 31, 15, 99, 6, 93, 91, 92, 3, 23, 90, 27, 6, 33, 78, 3, 19, 19, 27], [-80, -74, -72, -72, -66, -66, -62, -50, -44, -44, -28, -24, -24, -22, -16, -10, -6, -4, -2, 2, 2, 4, 12, 16, 16, 28, 30, 32, 32, 38, 38, 72, 84, 86, 88, 90, 96], [0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1], [25, 67], [82, 74, -82, 22, -28, -78, -22, -86, -74, 42, -6, 54, -88, -92, -14, -50, 68, 46, -50, 46, -18, 66, -76, -30, 36, 12, 66], [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], [50, 23, 56, 9]]; int [] param1 = [5, 24, 44, 36, 34, 18, 1, 14, 32, 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); } " MAXIMUM_BINOMIAL_COEFFICIENT_TERM_VALUE,"static int f_filled ( int n ) { int [ ] [ ] C = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= Math . min ( i , n ) ; j ++ ) { if ( j == 0 || j == i ) C [ i ] [ j ] = 1 ; else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ] ; } } int maxvalue = 0 ; for ( int i = 0 ; i <= n ; i ++ ) maxvalue = Math . max ( maxvalue , C [ n ] [ i ] ) ; return maxvalue ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1352078, 10, 252, 352716, 24310, 924, 10400600, 126, 35, 2704156]; int [] param0 = [23, 5, 10, 21, 17, 12, 26, 9, 7, 24]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { int result = 0 ; HashSet < Integer > Hash = new HashSet < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { Hash . add ( arr [ i ] ) ; } for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) { int product = arr [ i ] * arr [ j ] ; if ( Hash . contains ( product ) ) { result ++ ; } } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 36, 0, 2, 861, 9, 0, 66, 0]; int [] [] param0 = [[7, 10, 17, 17, 18, 20, 27, 28, 29, 29, 31, 32, 41, 43, 45, 46, 63, 66, 69, 69, 70, 75, 87, 95], [-60], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [52, 83, 36, 57, 93, 11, 32, 91, 52], [-98, -94, -90, -88, -76, -76, -64, -62, -60, -50, -46, -32, -24, -22, -20, -16, -4, -2, 6, 10, 20, 28, 30, 32, 34, 38, 40, 42, 54, 64, 72, 76, 82, 82, 86, 92, 92, 98, 98], [0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0], [2, 3, 10, 12, 15, 23, 26, 28, 29, 30, 31, 31, 33, 33, 35, 41, 45, 48, 50, 50, 53, 53, 56, 65, 66, 67, 68, 68, 72, 72, 75, 76, 79, 82, 90, 94, 94, 95, 97, 99], [14, 36, -54, -54], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [5, 69, 37, 80, 21, 98, 70, 70, 74, 95, 6, 67, 44, 55, 52, 89, 84, 99, 65, 52]]; int [] param1 = [17, 0, 9, 8, 22, 42, 35, 3, 12, 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); } " FIND_EQUAL_POINT_STRING_BRACKETS,"static int f_filled ( String str ) { int len = str . length ( ) ; int open [ ] = new int [ len + 1 ] ; int close [ ] = new int [ len + 1 ] ; int index = - 1 ; open [ 0 ] = 0 ; close [ len ] = 0 ; if ( str . charAt ( 0 ) == '(' ) open [ 1 ] = 1 ; if ( str . charAt ( len - 1 ) == ')' ) close [ len - 1 ] = 1 ; for ( int i = 1 ; i < len ; i ++ ) { if ( str . charAt ( i ) == '(' ) open [ i + 1 ] = open [ i ] + 1 ; else open [ i + 1 ] = open [ i ] ; } for ( int i = len - 2 ; i >= 0 ; i -- ) { if ( str . charAt ( i ) == ')' ) close [ i ] = close [ i + 1 ] + 1 ; else close [ i ] = close [ i + 1 ] ; } if ( open [ len ] == 0 ) return len ; if ( close [ 0 ] == 0 ) return 0 ; for ( int i = 0 ; i <= len ; i ++ ) if ( open [ i ] == close [ i ] ) index = i ; return index ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 2, 0, 5, 3, 3, 3, 1, 7, 8]; string [] param0 = [""(())))("", ""))"", ""(("", ""))(()(()()("", "")((()(()"", ""))(()"", ""()))"", ""()"", ""1100110"", ""dhfsnebd""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_PALINDROME_SUB_STRINGS_STRING,"static int f_filled ( char str [ ] , int n ) { int dp [ ] [ ] = new int [ n ] [ n ] ; boolean P [ ] [ ] = new boolean [ n ] [ n ] ; for ( int i = 0 ; i < n ; i ++ ) P [ i ] [ i ] = true ; for ( int i = 0 ; i < n - 1 ; i ++ ) { if ( str [ i ] == str [ i + 1 ] ) { P [ i ] [ i + 1 ] = true ; dp [ i ] [ i + 1 ] = 1 ; } } for ( int gap = 2 ; gap < n ; gap ++ ) { for ( int i = 0 ; i < n - gap ; i ++ ) { int j = gap + i ; if ( str [ i ] == str [ j ] && P [ i + 1 ] [ j - 1 ] ) P [ i ] [ j ] = true ; if ( P [ i ] [ j ] == true ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i + 1 ] [ j ] + 1 - dp [ i + 1 ] [ j - 1 ] ; else dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i + 1 ] [ j ] - dp [ i + 1 ] [ j - 1 ] ; } } return dp [ 0 ] [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 3, 211, 1, 60, 72, 1, 1, 289, 0]; char [] [] param0 = [['e', 'e', 'j', 'p', 't', 'u', 'x', 'y', 'z', 'e', 'f', 'h', 'l', 'm', 'n', 'o', 'z'], ['8', '7', '3', '4', '9', '5', '3', '1', '4', '0', '6', '8', '2', '5', '8', '3', '5', '2', '8', '6', '6', '3', '5', '7', '5', '5', '3', '7'], ['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'], ['f', 'e', 'e', 'z', 'b', 'o', 'i', 'v', 'k', 'u', 'p', 'c', 'z', 'f', 'k', 'j', 't', 'r', 't', 'a', 'f', 'g', 'd', 'x', 'h', 'e', 'p', 'l', 'l', 'k', 'z', 'y', 'u', 'g', 'h', 'c', 'f', 'j', 'h', 'w'], ['0', '0', '0', '1', '1', '1', '1', '1', '1', '2', '2', '2', '3', '3', '3', '3', '3', '4', '4', '4', '4', '4', '4', '5', '5', '5', '5', '6', '6', '7', '7', '9', '9', '9', '9', '9', '9'], ['1', '0', '1', '1', '0', '0', '1', '1', '1', '0', '1', '0', '1', '1', '0', '1', '0', '1', '1', '1', '1', '1', '0', '1', '1', '0', '1', '0', '1', '1', '0', '0', '1', '0', '1', '0', '0', '0', '0', '0', '1', '1', '0', '1', '0', '1'], ['c', 'c', 'd', 'f', 'l', 'm', 'p', 'x', 'a', 'f', 'i', 'j', 'w'], ['7', '9', '0', '2', '8', '0', '7', '5', '9', '4', '5', '4', '8', '1', '9', '5', '3', '2', '4', '1', '2'], ['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'], ['m', 'x', 'n', 'm']]; int [] param1 = [11, 27, 23, 27, 35, 43, 9, 16, 32, 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); } " FUNCTION_COPY_STRING_ITERATIVE_RECURSIVE_1,"static String f_filled ( char s1 [ ] , char s2 [ ] , int index ) { s2 [ index ] = s1 [ index ] ; if ( index == s1 . length - 1 ) { return new String(s2); } return f_filled ( s1 , s2 , index + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""v"", ""86028087054621937"", ""00000000000000000111111111111111111"", ""smdawnfhbehmzhcxlareddqvuwokunbkymlhlxhrditay"", ""00000111222334445555667777788889989999"", ""11000101100010011000011"", ""ggjklnqrrsuwxyyabbbcdeeffhjjkklmmnosttwzxz"", ""4"", ""00000000111111111"", ""nhmnnfyzdyspyr""]; char [] [] param0 = [['v'], ['6', '8', '3', '3', '5', '2', '5', '6', '9', '9', '2', '6', '2', '1', '9', '3', '7'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['e', 'g', 'a', 'r', 'f', 'u', 'w', 'k', 'u', 'z', 'y', 'v', 'a', 'w', 'm', 'g', 'h', 'o', 'i', 'a', 'u', 'v', 'f', 'b', 'q', 'e', 'e', 'e', 'l', 'c', ' ', 'w', 'k', ' ', 'k', 'j', 'j', 's', 'q', 'u', 'n', 'i', 't', 'a', 'y'], ['0', '0', '0', '0', '1', '1', '1', '2', '2', '2', '2', '2', '2', '3', '3', '3', '3', '4', '4', '4', '4', '5', '5', '6', '6', '6', '7', '7', '7', '7', '7', '7', '8', '8', '9', '9', '9', '9'], ['1', '0', '0', '1', '0', '1', '1', '1', '0', '0', '0', '1', '0', '0', '0', '1', '1', '0', '0', '0', '0', '1', '1'], [' ', 'b', 'd', 'd', 'd', 'e', 'e', 'e', 'g', 'h', 'j', 'k', 'k', 'k', 'l', 'n', 'o', 's', 'v', 'w', 'y', 'z', 'b', 'c', 'd', 'd', 'f', 'f', 'f', 'f', 'f', 'f', 'i', 'k', 'k', 'o', 't', 'u', 'v', 'x', 'x', 'z'], ['4'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1'], ['d', 'i', 'u', 'k', 'e', 's', 'n', 'z', 'd', 'y', 's', 'p', 'y', 'r']]; char [] [] param1 = [['v'], ['8', '6', '0', '2', '8', '0', '8', '7', '0', '5', '4', '6', '2', '1', '9', '3', '7'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['s', 'm', 'd', 'a', 'w', 'n', 'f', 'h', 'b', 'e', 'h', 'm', 'z', 'h', 'c', 'x', 'l', 'a', 'r', 'e', 'd', 'd', 'q', 'v', 'u', 'w', 'o', 'k', 'u', 'n', 'b', 'k', 'y', 'm', 'l', 'h', 'l', 'x', 'h', 'r', 'd', 'i', 't', 'a', 'y'], ['0', '0', '0', '0', '0', '1', '1', '1', '2', '2', '2', '3', '3', '4', '4', '4', '5', '5', '5', '5', '6', '6', '7', '7', '7', '7', '7', '8', '8', '8', '8', '9', '9', '8', '9', '9', '9', '9'], ['1', '1', '0', '0', '0', '1', '0', '1', '1', '0', '0', '0', '1', '0', '0', '1', '1', '0', '0', '0', '0', '1', '1'], ['g', 'g', 'j', 'k', 'l', 'n', 'q', 'r', 'r', 's', 'u', 'w', 'x', 'y', 'y', 'a', 'b', 'b', 'b', 'c', 'd', 'e', 'e', 'f', 'f', 'h', 'j', 'j', 'k', 'k', 'l', 'm', 'm', 'n', 'o', 's', 't', 't', 'w', 'z', 'x', 'z'], ['4'], ['0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['n', 'h', 'm', 'n', 'n', 'f', 'y', 'z', 'd', 'y', 's', 'p', 'y', 'r']]; int [] param2 = [0, 11, 34, 41, 33, 13, 40, 0, 12, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME,"static int f_filled ( int n ) { if ( n <= 1 ) return n ; int a = 0 , b = 1 , c = 1 ; int res = 1 ; while ( c < n ) { c = a + b ; res ++ ; a = b ; b = c ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 8, 6, 12, 11, 11, 11, 12, 11, 8]; int [] param0 = [5, 19, 7, 94, 58, 65, 69, 96, 80, 14]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_POSSIBLE_DECODINGS_GIVEN_DIGIT_SEQUENCE_1,"static int f_filled ( char digits [ ] , int n ) { int count [ ] = new int [ n + 1 ] ; count [ 0 ] = 1 ; count [ 1 ] = 1 ; if ( digits [ 0 ] == '0' ) return 0 ; for ( int i = 2 ; i <= n ; i ++ ) { count [ i ] = 0 ; if ( digits [ i - 1 ] > '0' ) count [ i ] = count [ i - 1 ] ; if ( digits [ i - 2 ] == '1' || ( digits [ i - 2 ] == '2' && digits [ i - 1 ] < '7' ) ) count [ i ] += count [ i - 2 ] ; } return count [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 0, 0, 1, 0, 13, 0, 0, 0, 1]; char [] [] param0 = [['b', 'c', 'e', 'e', 'f', 'f', 'g', 'j', 'k', 'k', 'l', 'l', 'm', 'o', 'o', 'p', 'q', 'r', 'v', 'x', 'z', 'a', 'a', 'a', 'c', 'c', 'c', 'd', 'e', 'g', 'g', 'k', 'k', 'k', 'l', 'm', 'm', 'n', 'p', 't', 'y', 'z'], ['0', '9', '5', '0', '2', '6', '5', '4', '4', '5', '2', '6', '8', '2', '0', '3', '1', '9', '0', '1', '5'], ['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'], ['x', 'a', 'r', 'o', 's', 'r', 'g', 'e', 'y', 'z', 't'], ['0', '1', '1', '1', '2', '2', '2', '2', '2', '2', '2', '3', '3', '4', '4', '5', '5', '5', '5', '5', '6', '6', '7', '7', '7', '7', '8', '8'], ['1', '1', '1', '1', '1', '1'], [' ', ' ', ' ', 'b', 'b', 'c', 'd', 'f', 'h', 'i', 'j', 'k', 'l', 'o', 'p', 'v', 'w', 'w', 'z', 'z', 'a', 'c', 'h', 'i', 'q', 's', 'x'], ['0', '9', '1', '5', '2', '4', '9', '3'], ['0', '0', '0', '1', '1', '1'], ['w', 't', 'u', 'r', 'a', 'c', 'g']]; int [] param1 = [42, 21, 26, 11, 28, 6, 27, 8, 6, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_POSSIBLE_PATHS_TOP_LEFT_BOTTOM_RIGHT_NXM_MATRIX_2,"static int f_filled ( int m , int n ) { int [ ] dp = new int [ n ] ; dp [ 0 ] = 1 ; for ( int i = 0 ; i < m ; i ++ ) { for ( int j = 1 ; j < n ; j ++ ) { dp [ j ] += dp [ j - 1 ] ; } } return dp [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 465, 847660528, 84672315, 155117520, 84672315, 847660528, 465, 1]; int [] param0 = [1, 3, 11, 12, 16, 21, 31, 30, 50]; int [] param1 = [50, 30, 31, 21, 16, 12, 11, 3, 1]; 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_A_ROTATION_WITH_MAXIMUM_HAMMING_DISTANCE,"static int f_filled ( int arr [ ] , int n ) { int brr [ ] = new int [ 2 * n + 1 ] ; for ( int i = 0 ; i < n ; i ++ ) brr [ i ] = arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) brr [ n + i ] = arr [ i ] ; int maxHam = 0 ; for ( int i = 1 ; i < n ; i ++ ) { int currHam = 0 ; for ( int j = i , k = 0 ; j < ( i + n ) ; j ++ , k ++ ) if ( brr [ j ] != arr [ k ] ) currHam ++ ; if ( currHam == n ) return n ; maxHam = Math . max ( maxHam , currHam ) ; } return maxHam ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [12, 0, 2, 0, 2, 8, 15, 14, 4, 2]; int [] [] param0 = [[1, 4, 18, 22, 28, 34, 35, 39, 44, 45, 67, 73, 75, 79, 81, 83, 89, 93, 96], [52, -28], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [24], [-68, 14, 36, 62], [1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0], [7, 10, 19, 22, 24, 28, 29, 39, 46, 55, 62, 66, 68, 73, 74, 76, 83, 84, 85, 99], [-38, 56, 86, 12, 24, -90, -20, -46, 38, 92, -44, -74, 54, 50, 46, 50, -94, 64, 32, -84, 70], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [61, 89, 8]]; int [] param1 = [12, 1, 21, 0, 2, 12, 15, 14, 8, 2]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DETECT_IF_TWO_INTEGERS_HAVE_OPPOSITE_SIGNS,"static boolean f_filled ( int x , int y ) { return ( ( x ^ y ) < 0 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, true, true, false, false, true, true, false]; int [] param0 = [59, -20, -100, 54, -16, -23, 93, 24, -8, 29]; int [] param1 = [-99, -21, 79, -49, 16, -68, 37, -61, 69, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SET_BITS_IN_AN_INTEGER,"static int f_filled ( int n ) { int count = 0 ; while ( n > 0 ) { count += n & 1 ; n >>= 1 ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 4, 3, 3, 2, 3, 4, 3, 1, 3]; int [] param0 = [58, 92, 73, 52, 24, 14, 58, 11, 8, 52]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING,"static char f_filled ( String str ) { int len = str . length ( ) ; int count = 0 ; char res = str . charAt ( 0 ) ; for ( int i = 0 ; i < len ; i ++ ) { int cur_count = 1 ; for ( int j = i + 1 ; j < len ; j ++ ) { if ( str . charAt ( i ) != str . charAt ( j ) ) break ; cur_count ++ ; } if ( cur_count > count ) { count = cur_count ; res = str . charAt ( i ) ; } } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ char [] results = ['e', '3', '1', 'a', '1', '1', 'w', '1', '1', 'a']; string [] param0 = [""geeekk"", ""3786868"", ""110"", ""aaaabbcbbb"", ""11"", ""011101"", ""wohnyjylc"", ""3141711779"", ""10111101101"", ""aabbabababcc""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SET_BITS_IN_AN_INTEGER_1,"static int f_filled ( int n ) { if ( n == 0 ) return 0 ; else return ( n & 1 ) + f_filled ( n >> 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 5, 2, 4, 3, 2, 1, 3, 4, 2]; int [] param0 = [43, 94, 72, 86, 42, 33, 8, 74, 29, 34]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SET_BITS_IN_AN_INTEGER_2,"static int f_filled ( int n ) { int count = 0 ; while ( n > 0 ) { n &= ( n - 1 ) ; count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 5, 2, 4, 2, 1, 2, 3, 2, 4]; int [] param0 = [32, 94, 33, 99, 17, 64, 80, 42, 12, 86]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " C_PROGRAM_FACTORIAL_NUMBER_2,"static int f_filled ( int n ) { return ( n == 1 || n == 0 ) ? 1 : n * f_filled ( n - 1 ) ; }","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_SET_BITS_IN_AN_INTEGER_3,"static int f_filled ( int n ) { if ( n == 0 ) return 0 ; else return 1 + f_filled ( n & ( n - 1 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 4, 4, 3, 4, 4, 4, 4, 4, 5]; int [] param0 = [6, 58, 90, 69, 15, 54, 60, 51, 46, 91]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_NUMBER_CHARACTERS_TWO_CHARACTER_STRING,"static int f_filled ( String str ) { int n = str . length ( ) ; int res = - 1 ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( str . charAt ( i ) == str . charAt ( j ) ) res = Math . max ( res , Math . abs ( j - i - 1 ) ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 2, -1, -1, -1, -1, -1, 10, 0, -1]; string [] param0 = [""ci"", ""76478"", ""1"", ""tr"", ""10"", ""01"", ""rmhzp"", ""5784080133917"", ""1100"", ""ok""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_HARMONIC_MEAN_USING_ARITHMETIC_MEAN_GEOMETRIC_MEAN,"static double f_filled ( int a , int b ) { double AM , GM , HM ; AM = ( a + b ) / 2 ; GM = Math . sqrt ( a * b ) ; HM = ( GM * GM ) / AM ; return HM ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [65.91176470588235, 48.0, 20.43243243243243, 30.72340425531915, 45.555555555555564, 11.375, 40.949999999999996, 19.027027027027028, 88.36363636363636, 23.823529411764707]; int [] param0 = [54, 42, 63, 19, 41, 7, 39, 11, 96, 15]; int [] param1 = [83, 56, 12, 76, 50, 26, 42, 64, 81, 54]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_STRINGS_ADJACENT_CHARACTERS_DIFFERENCE_ONE,"static long f_filled ( int n ) { long [ ] [ ] dp = new long [ n + 1 ] [ 27 ] ; for ( int i = 0 ; i < n + 1 ; i ++ ) { for ( int j = 0 ; j < 27 ; j ++ ) { dp [ i ] [ j ] = 0 ; } } for ( int i = 0 ; i <= 25 ; i ++ ) { dp [ 1 ] [ i ] = 1 ; } for ( int i = 2 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= 25 ; j ++ ) { if ( j == 0 ) { dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ] ; } else { dp [ i ] [ j ] = ( dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] ) ; } } } long sum = 0 ; for ( int i = 0 ; i <= 25 ; i ++ ) { sum = ( sum + dp [ n ] [ i ] ) ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [50, 98, 744, 2896, 22356, 87492, 1344762, 20736556, 81501768, 320481188]; int [] param0 = [2, 3, 6, 8, 11, 13, 17, 21, 23, 25]; 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_LAST_DIGIT_FACTORIAL_DIVIDES_FACTORIAL_B,"static int f_filled ( long A , long B ) { int variable = 1 ; if ( A == B ) return 1 ; else if ( ( B - A ) >= 5 ) return 0 ; else { for ( long i = A + 1 ; i <= B ; i ++ ) variable = ( int ) ( variable * ( i % 10 ) ) % 10 ; return variable % 10 ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 0, 0, 0, 1, 0, 1, 1, 1]; long [] param0 = [79, 61, 39, 39, 61, 86, 7, 86, 86, 11]; long [] param1 = [84, 29, 77, 65, 78, 73, 92, 50, 63, 2]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_STRINGS_CAN_FORMED_USING_B_C_GIVEN_CONSTRAINTS_1,"static int f_filled ( int n ) { return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [83271, 23383, 164359, 389483, 194619, 2073, 340869, 3459, 143848, 157319]; int [] param0 = [55, 36, 69, 92, 73, 16, 88, 19, 66, 68]; 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); } " FINDING_POWER_PRIME_NUMBER_P_N_1,"static int f_filled ( int n , int p ) { int ans = 0 ; int temp = p ; while ( temp <= n ) { ans += n / temp ; temp = temp * p ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 0, 0, 0, 0, 13, 3, 0, 1, 2]; int [] param0 = [76, 77, 9, 59, 8, 97, 78, 41, 72, 71]; int [] param1 = [43, 91, 42, 67, 52, 8, 24, 88, 61, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SUBARRAYS_EQUAL_NUMBER_1S_0S,"static int f_filled ( int arr [ ] , int n ) { Map < Integer , Integer > um = new HashMap < > ( ) ; int curr_sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { curr_sum += ( arr [ i ] == 0 ) ? - 1 : arr [ i ] ; um . put ( curr_sum , um . get ( curr_sum ) == null ? 1 : um . get ( curr_sum ) + 1 ) ; } int count = 0 ; for ( Map . Entry < Integer , Integer > itr : um . entrySet ( ) ) { if ( itr . getValue ( ) > 1 ) count += ( ( itr . getValue ( ) * ( itr . getValue ( ) - 1 ) ) / 2 ) ; } if ( um . containsKey ( 0 ) ) count += um . get ( 0 ) ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 3, 0, 0, 1, 0, 2, 0, 0]; int [] [] param0 = [[2, 12, 18, 19, 19, 20, 20, 21, 25, 29, 38, 54, 54, 71, 72, 72, 74, 75, 77, 78, 80, 80, 81, 84, 97, 97], [10, 70, 24, -38, 32, -68, 88, -28, -24, -70, -64, 50, -30, 64, 54, -6, 18, -30, -30, -62, -10, 94, -54, -22, -88, 96, 22, 26, -92, -40, -76, 46, 36, 30, 24, -52, 0], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [66, 50, 17, 15, 86, 84, 87, 24, 81, 23, 71, 31, 13, 72, 58, 19, 29, 28, 40, 14, 48, 48, 81, 4, 52, 88, 54, 56, 10, 12, 58, 55, 7, 66, 15, 73, 22, 2, 20, 27, 57, 56, 56, 31, 9, 55], [-98, -62, -60, 16, 78, 82], [1, 0, 1], [2, 31, 34, 64], [-70, 90, -10, -64, -76, -74, -12, -44, -48, -54, 76, -78, 8, 0, 0, 78, -28, 6, 98, -84, 60, 60, 2, 48, -96, -28, -78, -76, -56, -26, -60, 50, 44, 34, -90, 80, -30, -98, 62, 36, -46, -72], [1, 1, 1], [37, 70, 80, 61, 86, 10, 17, 98, 54, 89, 87, 84, 11, 55, 3, 52, 4, 90, 98, 31, 20, 62, 71, 58, 58, 6, 92, 5, 99, 99, 72, 40, 82, 54, 23, 19, 85, 91, 62, 98, 62, 72, 93, 74]]; int [] param1 = [24, 24, 11, 40, 5, 2, 2, 25, 1, 27]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " GCD_ELEMENTS_GIVEN_RANGE,"static int f_filled ( int n , int m ) { return ( n == m ) ? n : 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [57, 22, 17, 74, 1, 1, 1, 1, 1, 1]; int [] param0 = [57, 22, 17, 74, 93, 56, 5, 5, 9, 98]; int [] param1 = [57, 22, 17, 74, 22, 54, 33, 68, 75, 21]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SUBARRAYS_TOTAL_DISTINCT_ELEMENTS_ORIGINAL_ARRAY,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > vis = new HashMap < Integer , Integer > ( ) { @ Override public Integer get ( Object key ) { if ( ! containsKey ( key ) ) return 0 ; return super . get ( key ) ; } }; for ( int i = 0 ; i < n ; ++ i ) vis . put ( arr [ i ] , 1 ) ; int k = vis . size ( ) ; vis . clear ( ) ; int ans = 0 , right = 0 , window = 0 ; for ( int left = 0 ; left < n ; ++ left ) { while ( right < n && window < k ) { vis . put ( arr [ right ] , vis . get ( arr [ right ] ) + 1 ) ; if ( vis . get ( arr [ right ] ) == 1 ) ++ window ; ++ right ; } if ( window == k ) ans += ( n - right + 1 ) ; vis . put ( arr [ left ] , vis . get ( arr [ left ] ) - 1 ) ; if ( vis . get ( arr [ left ] ) == 0 ) -- window ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 4, 160, 1, 1, 609, 1, 1, 91, 1]; int [] [] param0 = [[13, 39, 49, 52, 53, 69, 72, 79, 83, 96], [-98, -98, 22, -10, -28, 0, 56, 72, 36, 88, 96, 22, 90, 74, -60, -64, 0, 2, -42, 0, 94, -82, -74], [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], [35, 23, 41, 58, 66, 92, 3, 33, 78, 70, 80, 86, 21, 21, 74, 19], [-98, -80, -52, -10, 4, 76], [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1], [2, 7, 10, 17, 26, 36, 37, 85, 87, 88], [64, -2, -94, -84, -48, 86], [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], [91, 49, 94, 81, 64, 5, 13, 70, 82, 9, 80, 82]]; int [] param1 = [5, 20, 26, 12, 3, 36, 8, 5, 20, 9]; 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_WITH_SAME_EVEN_AND_ODD_ELEMENTS,"static int f_filled ( int [ ] arr , int n ) { int difference = 0 ; int ans = 0 ; int [ ] hash_positive = new int [ n + 1 ] ; int [ ] hash_negative = new int [ n + 1 ] ; hash_positive [ 0 ] = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ( arr [ i ] & 1 ) == 1 ) { difference ++ ; } else { difference -- ; } if ( difference < 0 ) { ans += hash_negative [ - difference ] ; hash_negative [ - difference ] ++ ; } else { ans += hash_positive [ difference ] ; hash_positive [ difference ] ++ ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [50, 0, 11, 43, 0, 68, 5, 0, 4, 7]; int [] [] param0 = [[7, 8, 12, 13, 14, 19, 20, 22, 28, 30, 31, 31, 32, 34, 34, 39, 39, 43, 45, 46, 47, 62, 63, 63, 65, 66, 69, 69, 71, 76, 79, 82, 83, 88, 89, 92, 93, 95, 97, 97], [20, -98, -44, -82, 28, 20, -76, -16, 42, 0, -88, 74, 56, 6, -68, -30, 28, 88, 58, -78, 46, 2], [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], [44, 4, 29, 83, 28, 75, 58, 89, 40, 38, 29, 45, 21, 87, 97, 42, 95, 20, 48, 38, 15, 67, 23, 81, 50, 53, 64, 67, 30, 13, 52, 56, 87, 10, 80, 38, 31, 19], [-94, -94, -94, -90, -88, -86, -86, -82, -78, -76, -74, -68, -64, -62, -62, -60, -52, -48, -48, -46, -44, -44, -32, -28, -22, -12, -12, -8, -8, -4, 4, 6, 10, 14, 28, 40, 42, 52, 56, 60, 60, 60, 64, 68, 70, 82, 82, 84, 96], [1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1], [6, 16, 21, 26, 34, 35, 44, 46, 46, 86], [86, 12, 80, 46, -12, 6], [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], [71, 94, 91, 19, 85, 5, 87, 96, 66, 17, 95, 5, 32, 17, 93, 48, 46, 24]]; int [] param1 = [26, 15, 24, 23, 48, 27, 7, 4, 15, 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); } " MINIMUM_PERIMETER_N_BLOCKS,"static long f_filled ( int n ) { int l = ( int ) Math . sqrt ( n ) ; int sq = l * l ; if ( sq == n ) return l * 4 ; else { long row = n / l ; long perimeter = 2 * ( l + row ) ; if ( n % l != 0 ) perimeter += 2 ; return perimeter ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [28, 36, 30, 28, 38, 34, 24, 18, 34, 34]; int [] param0 = [45, 80, 54, 48, 83, 68, 32, 20, 68, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_CONSECUTIVE_NUMBERS_PRESENT_ARRAY,"static int f_filled ( int arr [ ] , int n ) { HashSet < Integer > S = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) S . add ( arr [ i ] ) ; int ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( S . contains ( arr [ i ] ) ) { int j = arr [ i ] ; while ( S . contains ( j ) ) j ++ ; ans = Math . max ( ans , j - arr [ i ] ) ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 1, 2, 2, 1, 2, 2, 1, 1, 3]; int [] [] param0 = [[3, 5, 9, 24, 28, 31, 49, 54, 67, 85, 86, 94, 97, 97], [-34, 16, -80, -10, 80, 2, 50, -74, -76, 36, -84, -24, 74, -54, -22, 46, 80, 58, -8, 70, 24, -88, 52, 62, 30, 42, 48, 16, 78, -82, 64, -36, 84, -72], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [49, 61, 68, 4, 90, 89, 71, 74, 45, 61, 35, 41, 59], [-42, -8, 28, 56, 80, 96], [1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1], [3, 4, 6, 6, 13, 27, 27, 29, 32, 36, 46, 50, 52, 65, 69, 70, 71, 83, 87, 91], [64, -76, 28, 6, 56, 18, 32, -50, -20, 18, -26, -90, 32, 50, -18, 98, 84, 40, 50, 88, -70, -6, -24, -44, -96, -58, 48, -78, -14], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [50, 48, 61, 87, 7, 78, 93, 44, 16, 88, 98, 15, 73, 93, 43, 46, 42, 34, 1, 35, 79, 35, 84, 60, 18, 79, 17, 4, 78, 1, 20, 64]]; int [] param1 = [11, 29, 13, 11, 4, 17, 10, 15, 15, 25]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SUBSTRINGS_WITH_SAME_FIRST_AND_LAST_CHARACTERS,"static int f_filled ( String s ) { int result = 0 ; int n = s . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i ; j < n ; j ++ ) if ( s . charAt ( i ) == s . charAt ( j ) ) result ++ ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 16, 12, 6, 19, 9, 6, 15, 4, 9]; string [] param0 = [""lzika"", ""0556979952"", ""110010"", ""kgayfd"", ""413567670657"", ""01001"", ""eqpufa"", ""48848378"", ""110"", ""plehnep""]; 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_SUBARRAY_COUNT_1S_ONE_COUNT_0S,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ; int sum = 0 , maxLen = 0 ; for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] == 0 ? - 1 : 1 ; if ( sum == 1 ) maxLen = i + 1 ; else if ( ! um . containsKey ( sum ) ) um . put ( sum , i ) ; if ( um . containsKey ( sum - 1 ) ) { if ( maxLen < ( i - um . get ( sum - 1 ) ) ) maxLen = i - um . get ( sum - 1 ) ; } } return maxLen ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 1, 1, 3, 7, 1, 3, 3, 1]; int [] [] param0 = [[6, 10, 31, 35], [4, 88, -72, 28, -54, 32, -34], [0, 0, 0, 1, 1, 1, 1, 1, 1], [39, 22, 15, 10, 34, 87, 46, 83, 74, 77, 61, 90, 43, 67, 64, 72, 92, 52, 68, 53, 67, 32, 82, 76, 76, 47, 74, 47, 8, 80, 85, 58, 75], [-82, -58, -50, -30, -14, -4, -2, -2, 0, 22, 36, 58, 70, 80, 80, 82, 84, 90], [1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1], [4, 11, 17, 21, 21, 22, 30, 31, 36, 37, 39, 40, 45, 46, 47, 48, 52, 53, 53, 60, 60, 65, 66, 66, 67, 67, 87, 88, 91, 97], [-4, -60, -78, -50, 64, 18, 0, 76, 12, 86, -22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 39, 50, 37, 71, 66, 55, 34, 1, 41, 34, 99, 69, 31]]; int [] param1 = [2, 6, 4, 26, 14, 7, 29, 7, 17, 11]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_SUM_OF_DIGITS_IN_NUMBERS_FROM_1_TO_N,"static int f_filled ( int n ) { if ( n < 10 ) return ( n * ( n + 1 ) / 2 ) ; int d = ( int ) ( Math . log10 ( n ) ) ; int a [ ] = new int [ d + 1 ] ; a [ 0 ] = 0 ; a [ 1 ] = 45 ; for ( int i = 2 ; i <= d ; i ++ ) a [ i ] = a [ i - 1 ] * 10 + 45 * ( int ) ( Math . ceil ( Math . pow ( 10 , i - 1 ) ) ) ; int p = ( int ) ( Math . ceil ( Math . pow ( 10 , d ) ) ) ; int msd = n / p ; return ( msd * a [ d ] + ( msd * ( msd - 1 ) / 2 ) * p + msd * ( 1 + n % p ) + f_filled ( n % p ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [165, 865, 540, 667, 525, 168, 667, 177, 609, 240]; int [] param0 = [29, 97, 71, 82, 69, 30, 82, 32, 77, 39]; 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_CALCULATE_VOLUME_ELLIPSOID,"static float f_filled ( float r1 , float r2 , float r3 ) { float pi = ( float ) 3.14 ; return ( float ) 1.33 * pi * r1 * r2 * r3 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [522232.74089280004, -283737.6598056, 379381.2427776, -112115.51806000002, 1639671.7048656002, -1938016.9772600005, 306019.63709100004, -238081.08602880003, 192599.16093600003, -1561484.5209600003]; float [] param0 = [32.4, -37.4, 89.6, -26.0, 86.1, -73.3, 78.3, -65.6, 44.4, -72.8]; float [] param1 = [45.3, -66.3, 35.7, -10.7, 95.2, -65.0, 36.7, -14.2, 22.1, -80.0]; float [] param2 = [85.2, -27.4, 28.4, -96.5, 47.9, -97.4, 25.5, -61.2, 47.0, -64.2]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_TOTAL_SET_BITS_IN_ALL_NUMBERS_FROM_1_TO_N,"static int f_filled ( int n ) { int i = 0 ; int ans = 0 ; while ( ( 1 << i ) <= n ) { boolean k = false ; int change = 1 << i ; for ( int j = 0 ; j <= n ; j ++ ) { if ( k == true ) ans += 1 ; else ans += 0 ; if ( change == 1 ) { k = ! k ; change = 1 << i ; } else { change -- ; } } i ++ ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [279, 159, 112, 80, 231, 88, 112, 197, 32, 304]; int [] param0 = [90, 56, 43, 31, 77, 35, 43, 66, 15, 95]; 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_TRAILING_ZEROES_FACTORIAL_NUMBER,"static int f_filled ( int n ) { int count = 0 ; for ( int i = 5 ; n / i >= 1 ; i *= 5 ) count += n / i ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 9, 12, 7, 8, 12, 7, 10, 0, 18]; int [] param0 = [9, 43, 50, 32, 37, 51, 33, 49, 1, 75]; 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_TRIPLET_SUM_ARRAY_2,"static int f_filled ( int arr [ ] , int n ) { int maxA = - 100000000 , maxB = - 100000000 ; int maxC = - 100000000 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] > maxA ) { maxC = maxB ; maxB = maxA ; maxA = arr [ i ] ; } else if ( arr [ i ] > maxB ) { maxC = maxB ; maxB = arr [ i ] ; } else if ( arr [ i ] > maxC ) maxC = arr [ i ] ; } return ( maxA + maxB + maxC ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [265, -100000026, 3, 218, 52, 3, -99999966, 286, 2, 292]; int [] [] param0 = [[4, 7, 12, 21, 22, 25, 27, 28, 28, 31, 32, 32, 41, 45, 47, 51, 53, 60, 61, 61, 63, 71, 74, 82, 83, 85, 88, 92, 96, 96], [-52, 26, 74, -62, -76], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [63, 71, 15, 28, 31, 84, 8, 17, 24, 42, 66, 95, 30], [-94, -92, -92, -90, -88, -88, -86, -82, -80, -78, -66, -54, -52, -52, -46, -46, -42, -36, -32, -24, -24, -14, -14, -14, -12, -10, 0, 6, 8, 20, 24, 24, 28, 38, 38, 52, 54, 56, 64, 74, 74, 76, 82, 94, 94], [0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0], [15, 19, 80], [4, 80, 18, 74, 36, -30, -72, -28, -32, -16, -8, 38, 78, -48, 98, -64, 86, -60, -44, 84, -98, 40, 14, 30, 44, 90, -30, -42, 24, -28, 24, 40, -96, 98, 90, -68, -54, -52, 62, 34, -98, 68, -56, -94, -78, -12, 28], [0, 1, 1, 1, 1, 1], [2, 18, 96, 7, 99, 83, 3, 88, 23, 77, 6, 28, 55, 49, 69, 55, 48, 76, 43, 11, 43, 44, 17, 74, 27, 64, 76, 77, 53, 26, 73, 12, 19, 62, 18, 34, 13, 31, 97, 96, 85, 27, 30, 97, 89, 25]]; int [] param1 = [28, 2, 11, 6, 31, 30, 2, 41, 3, 41]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_WAYS_BUILD_STREET_GIVEN_CONSTRAINTS,"static long f_filled ( int n ) { long dp [ ] [ ] = new long [ 2 ] [ n + 1 ] ; dp [ 0 ] [ 1 ] = 1 ; dp [ 1 ] [ 1 ] = 2 ; for ( int i = 2 ; i <= n ; i ++ ) { dp [ 0 ] [ i ] = dp [ 0 ] [ i - 1 ] + dp [ 1 ] [ i - 1 ] ; dp [ 1 ] [ i ] = dp [ 0 ] [ i - 1 ] * 2 + dp [ 1 ] [ i - 1 ] ; } return dp [ 0 ] [ n ] + dp [ 1 ] [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [4478554083, 318281039, 3880899, 114243, 3363, 577, 17, 7]; int [] param0 = [25, 22, 17, 13, 9, 7, 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); } " NUMBER_INDEXES_EQUAL_ELEMENTS_GIVEN_RANGE,"static int f_filled ( int a [ ] , int n , int l , int r ) { int count = 0 ; for ( int i = l ; i < r ; i ++ ) if ( a [ i ] == a [ i + 1 ] ) count += 1 ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 4, 0, 0, 0]; int [] [] param0 = [[4, 13, 13, 16, 16, 19, 39, 41, 48, 52, 57, 62, 65, 67, 76, 84, 88, 91, 95, 96, 97, 98], [62, 76, 86, -8, 84, -6, 72, 84, 6, -50, -18, -94, 54, 90, -74, -64, -26, -14, -32, 62, 10, 4, 70, -28, 8, 18, 4, -62, -76, 84, -78, -4, 84, 98, 58, -68, 42, -6, 34, -38, 52, -84, 78], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [11, 75, 98, 29, 62, 53, 48, 91, 86, 66, 48, 94], [-94, -84, -70, -70, -40, -40, -36, -24, 10, 48, 62, 74], [1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0], [1, 2, 6, 7, 10, 11, 13, 19, 19, 25, 29, 30, 32, 34, 35, 45, 45, 46, 47, 48, 48, 53, 58, 61, 64, 65, 67, 75, 76, 81, 81, 84, 84, 85, 86, 94, 94, 96, 99], [-56, 42, -34, -12, -86, 82, -96, -66, 30, 16, -40, 72, 84, 94, -48, -30, 26, 50, 42, -44, -50, 22, -38, 8, 34, 94, 2, 16, -32, 18, -58, 12, -26, 28, -62], [0, 0, 0, 0, 1, 1, 1], [6, 29]]; int [] param1 = [18, 32, 10, 8, 11, 36, 25, 21, 4, 1]; int [] param2 = [12, 38, 6, 6, 7, 40, 19, 30, 5, 1]; int [] param3 = [17, 23, 6, 6, 8, 37, 37, 26, 5, 1]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " COUNT_WAYS_DIVIDE_CIRCLE_USING_N_NON_INTERSECTING_CHORDS,"static int f_filled ( int A ) { int n = 2 * A ; int [ ] dpArray = new int [ n + 1 ] ; dpArray [ 0 ] = 1 ; dpArray [ 2 ] = 1 ; for ( int i = 4 ; i <= n ; i += 2 ) { for ( int j = 0 ; j < i - 1 ; j += 2 ) { dpArray [ i ] += ( dpArray [ j ] * dpArray [ i - 2 - j ] ) ; } } return dpArray [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [477638700, 129644790, 2674440, 58786, 1430, 42, 2]; int [] param0 = [18, 17, 14, 11, 8, 5, 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); } " COUNT_WORDS_APPEAR_EXACTLY_TWO_TIMES_ARRAY_WORDS,"static int f_filled ( String str [ ] , int n ) { HashMap < String , Integer > m = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( m . containsKey ( str [ i ] ) ) { int get = m . get ( str [ i ] ) ; m . put ( str [ i ] , get + 1 ) ; } else { m . put ( str [ i ] , 1 ) ; } } int res = 0 ; for ( Map . Entry < String , Integer > it : m . entrySet ( ) ) { if ( it . getValue ( ) == 2 ) res ++ ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 3, 1, 2, 1, 2, 1, 0, 1, 2]; string [] [] param0 = [[""hate"", ""love"", ""peace"", ""love"", ""peace"", ""hate"", ""love"", ""peace"", ""love"", ""peace""], [""16"", ""946613197072"", ""532052"", ""42780833"", ""511552"", ""1241934"", ""4"", ""3444540"", ""47487223670074"", ""23753"", ""14158"", ""4"", ""95420017116714"", ""16"", ""0845"", ""689000748"", ""976403809728"", ""8922"", ""487784120896"", ""329"", ""611"", ""59101"", ""611"", ""2131059721"", ""53952148295020"", ""445948587"", ""3905249775372"", ""4683180907"", ""7169093"", ""01413852276627"", ""63"", ""5864"", ""40862536595"", ""2280304422294"", ""930028582"", ""05"", ""33447""], [""001000100000"", ""1010"", ""01011"", ""11"", ""011"", ""1010""], [""om"", ""om"", ""shankar"", ""tripathi"", ""tom"", ""jerry"", ""jerry""], [""2"", ""644"", ""2"", ""42484637089"", ""81578664"", ""0778""], [""001000101"", ""011010"", ""1"", ""101010011"", ""011010"", ""01"", ""10111000101"", ""0"", ""1"", ""00101101"", ""0"", ""0""], [""kl"", ""p sh"", ""pwcpmpu"", ""tqoigppk"", ""wtsnp wjs"", ""kl "", ""txsfwgu"", ""kl"", ""ad"", ""njjtyfgwnwzcb"", ""jpfqslbgbdi"", ""cepgagvpk"", ""emadkmom"", ""yzunzgfwdijg"", ""k"", ""hjx jhmgpqywqp"", ""ciete"", ""rh"", ""pj"", ""h"", ""dinr"", ""aesqovliqtz"", ""nwzhtaltt ls"", ""lwlr"", ""wvdczlqf"", ""sojb"", ""wktoldcbwyto"", ""pidrjxy"", ""bmpwxjowtxkjjl"", ""zmtciq"", ""g"", ""ybmdw"", ""qhabzrqnojaaj"", ""u"", ""mgtwckve"", ""uxyqronag"", ""xsgsz"", ""dqnptt"", ""u w"", ""ygjkvcekdclby"", ""m"", ""yxjqhxjydqdlkt"", ""ojmareoek ya"", ""zuwiwhsmdic"", ""jygzektcdgld"", ""fwytaaw"", ""genttdzegy ""], [""938"", ""074209"", ""0949093096"", ""218622476"", ""71692175"", ""0714"", ""81217924991"", ""74016430795374"", ""52213147"", ""338"", ""939"", ""798161500954"", ""90528060774015"", ""68715"", ""75810"", ""43450"", ""8017"", ""0193164"", ""5945740"", ""212"", ""4589289"", ""2912211026"", ""0"", ""49"", ""8230114"", ""0733435391403"", ""5429"", ""10070""], [""00"", ""0"", ""00"", ""0101111010100"", ""110""], [""g"", ""h"", ""ok"", ""h"", ""ok"", ""sqozuc"", ""ut"", ""zwrcg"", ""ok"", ""mr"", ""jhrwyy"", ""qajlrokgrhuzh"", ""ljpnzdukszymcq"", ""g"", ""zgjlfmnyagl"", ""kezosxomewsfpw"", ""iftqnadvng"", ""ijojxl"", ""vjrqmywor"", ""ftehzqbhglmhph"", ""qesdzm"", ""npostkhkigyjt"", ""mosekk""]]; int [] param1 = [10, 32, 6, 7, 6, 12, 43, 20, 4, 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); } " NUMBER_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N,"static int f_filled ( int n ) { int result = 0 ; for ( int i = 0 ; i <= n ; i ++ ) for ( int j = 0 ; j <= n - i ; j ++ ) for ( int k = 0 ; k <= ( n - i - j ) ; k ++ ) if ( i + j + k == n ) result ++ ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2016, 1035, 741, 3403, 120, 231, 3003, 2701, 4753, 1431]; int [] param0 = [62, 44, 37, 81, 14, 20, 76, 72, 96, 52]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " C_PROGRAM_CONCATENATE_STRING_GIVEN_NUMBER_TIMES,"static String f_filled ( String s , int n ) { String s1 = s ; for ( int i = 1 ; i < n ; i ++ ) s += s1 ; return s ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""lpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsailpwsai"", ""903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104903751510490375151049037515104"", ""0010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111001000100101110010001001011100100010010111"", ""sbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipuesbwipue"", ""574314109574314109574314109574314109574314109"", ""1101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101110111011101"", ""fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff"", ""068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068068"", ""000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001000011001"", ""bwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikcbwbutikc""]; string [] param0 = [""lpwsai"", ""9037515104"", ""00100010010111"", ""sbwipue"", ""574314109"", ""1101"", ""f"", ""068"", ""000011001"", ""bwbutikc""]; int [] param1 = [41, 72, 95, 27, 5, 70, 91, 50, 38, 79]; 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_17_PALINDROME_PARTITIONING_1,"static int f_filled ( String str ) { int n = str . length ( ) ; int [ ] C = new int [ n ] ; boolean [ ] [ ] P = new boolean [ n ] [ n ] ; int i , j , k , L ; for ( i = 0 ; i < n ; i ++ ) { P [ i ] [ i ] = true ; } for ( L = 2 ; L <= n ; L ++ ) { for ( i = 0 ; i < n - L + 1 ; i ++ ) { j = i + L - 1 ; if ( L == 2 ) P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) ; else P [ i ] [ j ] = ( str . charAt ( i ) == str . charAt ( j ) ) && P [ i + 1 ] [ j - 1 ] ; } } for ( i = 0 ; i < n ; i ++ ) { if ( P [ 0 ] [ i ] == true ) C [ i ] = 0 ; else { C [ i ] = Integer . MAX_VALUE ; for ( j = 0 ; j < i ; j ++ ) { if ( P [ j + 1 ] [ i ] == true && 1 + C [ j ] < C [ i ] ) C [ i ] = 1 + C [ j ] ; } } } return C [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [10, 6, 0, 2, 6, 1, 8, 4, 2, 4]; string [] param0 = [""yygwgyrovdsh"", ""56109778"", ""101"", ""rxm"", ""187546405"", ""0110010"", ""wvodamgvi"", ""56719"", ""10100011001100"", ""wtpai""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " C_PROGRAM_FACTORIAL_NUMBER_1,"static int f_filled ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; }","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); } " MINIMUM_NUMBER_PLATFORMS_REQUIRED_RAILWAYBUS_STATION,"static int f_filled ( int arr [ ] , int dep [ ] , int n ) { int plat_needed = 1, result = 1; for (int i = 0; i < n; i++) { plat_needed = 1; for (int j = 0; j < n; j++) { if (i != j) { if (arr[i] >= arr[j] && dep[j] >= arr[i]) plat_needed++; } } result = Math.max(result, plat_needed); } return result; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 11, 6, 5, 1, 13, 1, 8, 26, 3]; int [] [] param0 = [[8, 24, 28, 64, 75, 86, 93, 95], [2, -30, -8, -78, 58, -42, -94, 84, -58, 14, 78, 34, 30, 6, -18, -92, 0, 94, -54, 58, 0, -86, 66, 86, 8, -26, 50, 16, -30, -68, 98, -28, -4, -6], [0, 0, 0, 0, 0, 0, 1], [51, 5, 48, 61, 71, 2, 4, 35, 50, 76, 59, 64, 81, 5, 21, 95], [-64, -52, 44, 52, 90], [0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1], [2, 15, 25, 55, 72, 96, 98], [-60, 30, -58, 52, 40, 74, 74, 76, -72, -48, 8, -56, -24, -40, -98, -76, -56, -20, 30, -30, -34, 4, -34], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [37, 84, 20, 34, 56, 1, 87, 72]]; int [] [] param1 = [[19, 30, 41, 51, 62, 68, 85, 96], [40, 22, -24, 80, -76, -4, -8, -34, 96, -98, 16, 28, 14, 52, 10, -10, -62, 64, -48, 10, -64, -90, -52, 46, 34, 50, 50, -84, 68, -12, -44, 28, -22, 78], [0, 0, 0, 0, 0, 1, 1], [67, 84, 86, 43, 50, 90, 49, 8, 40, 67, 5, 51, 40, 28, 31, 47], [-62, -16, 22, 26, 58], [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], [3, 6, 11, 19, 26, 37, 39], [-96, -40, -76, 52, -20, -28, -64, -72, 36, 56, 52, 34, 14, 8, -50, 6, -82, -98, -8, 18, -76, -66, -22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [68, 62, 84, 54, 15, 29, 70, 96]]; int [] param2 = [8, 34, 7, 16, 5, 30, 7, 23, 42, 8]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_CHECK_PLUS_PERFECT_NUMBER,"static boolean f_filled ( int x ) { int temp = x ; int n = 0 ; while ( x != 0 ) { x /= 10 ; n ++ ; } x = temp ; int sum = 0 ; while ( x != 0 ) { sum += Math . pow ( x % 10 , n ) ; x /= 10 ; } return ( sum == temp ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, false, false, false, false, false]; int [] param0 = [371, 9474, 85, 35, 54, 17, 97, 63, 12, 43]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DECIMAL_BINARY_CONVERSION_WITHOUT_USING_ARITHMETIC_OPERATORS,"static String f_filled ( int n ) { if ( n == 0 ) return ""0"" ; String bin = """" ; while ( n > 0 ) { bin = ( ( n & 1 ) == 0 ? '0' : '1' ) + bin ; n >>= 1 ; } return bin ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""100011"", ""10001"", ""1000"", ""1100011"", ""111001"", ""100111"", ""1100011"", ""1110"", ""10110"", ""111""]; int [] param0 = [35, 17, 8, 99, 57, 39, 99, 14, 22, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS,"static int f_filled ( int a , int b , int c ) { if ( ( a < b && b < c ) || ( c < b && b < a ) ) return b ; else if ( ( b < a && a < c ) || ( c < a && a < b ) ) return a ; else return c ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [56, 56, 51, 54, 70, 57, 80, 54, 70, 5]; int [] param0 = [56, 56, 36, 71, 3, 84, 30, 82, 90, 38]; int [] param1 = [5, 60, 56, 54, 70, 57, 80, 54, 70, 4]; int [] param2 = [82, 17, 51, 6, 81, 47, 85, 32, 55, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DECIMAL_REPRESENTATION_GIVEN_BINARY_STRING_DIVISIBLE_10_NOT,"static boolean f_filled ( String bin ) { int n = bin . length ( ) ; if ( bin . charAt ( n - 1 ) == '1' ) return false ; int sum = 0 ; for ( int i = n - 2 ; i >= 0 ; i -- ) { if ( bin . charAt ( i ) == '1' ) { int posFromRight = n - i - 1 ; if ( posFromRight % 4 == 1 ) sum = sum + 2 ; else if ( posFromRight % 4 == 2 ) sum = sum + 4 ; else if ( posFromRight % 4 == 3 ) sum = sum + 8 ; else if ( posFromRight % 4 == 0 ) sum = sum + 6 ; } } if ( sum % 10 == 0 ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, true, true, false, true, false, false, true]; string [] param0 = [""101000"", ""39613456759141"", ""11"", ""poihjo"", ""2"", ""0000101"", ""t s dzkedx gk"", ""3944713969"", ""1000"", ""ifyugdpmt""]; 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); } " FIBONACCI_MODULO_P,"static int f_filled ( int p ) { int first = 1 , second = 1 , number = 2 , next = 1 ; while ( next > 0 ) { next = ( first + second ) % p ; first = second ; second = next ; number ++ ; } return number ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [36, 30, 18, 8, 6, 24, 60, 100, 70, 20]; int [] param0 = [51, 40, 68, 7, 8, 32, 93, 75, 71, 15]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DECODE_MEDIAN_STRING_ORIGINAL_STRING,"static String f_filled ( String s ) { int l = s . length ( ) ; String s1 = """" ; boolean isEven = ( l % 2 == 0 ) ? true : false ; for ( int i = 0 ; i < l ; i += 2 ) { if ( isEven ) { s1 = s . charAt ( i ) + s1 ; s1 += s . charAt ( i + 1 ) ; } else { if ( l - i > 1 ) { s1 += s . charAt ( i ) ; s1 = s . charAt ( i + 1 ) + s1 ; } else { s1 += s . charAt ( i ) ; } } } return s1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""tpqcve gqeyzv"", ""484850"", ""1000000011111"", ""ysw"", ""524035"", ""0"", ""tlhwmmaq"", ""6792"", ""111111"", ""oqggubrdup""]; string [] param0 = ["" egvqceqypztv"", ""488540"", ""0000101010111"", ""syw"", ""402355"", ""0"", ""wmhmlatq"", ""7962"", ""111111"", ""ubgrgdquop""]; 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); } " DIAGONALLY_DOMINANT_MATRIX,"static boolean f_filled ( int m [ ] [ ] , int n ) { for ( int i = 0 ; i < n ; i ++ ) { int sum = 0 ; for ( int j = 0 ; j < n ; j ++ ) sum += Math . abs ( m [ i ] [ j ] ) ; sum -= Math . abs ( m [ i ] [ i ] ) ; if ( Math . abs ( m [ i ] [ i ] ) < sum ) return false ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, true, false, false, false, false, false, false]; int [] [] [] param0 = [[[3, -2, 1], [1, -3, 2], [-1, 2, 4]], [[2, -2, 1], [1, -3, 2], [-1, 2, 4]], [[78, 46, 33, 58, 79, 94, 94, 31, 69], [83, 48, 11, 74, 33, 61, 88, 15, 29], [27, 20, 36, 14, 37, 88, 49, 36, 58], [93, 15, 39, 5, 97, 45, 1, 47, 34], [8, 88, 54, 87, 60, 77, 37, 46, 18], [10, 68, 71, 86, 76, 24, 47, 37, 72], [84, 43, 82, 25, 87, 18, 51, 46, 75], [59, 39, 78, 86, 38, 55, 79, 5, 5], [50, 42, 19, 34, 53, 80, 21, 45, 96]], [[88, 35, 82, 14, 86, 94, 12, 49, 76, 94, 3, 96, 27, 92, 82, 25, 15, 27, 15], [30, 75, 59, 45, 53, 78, 45, 92, 72, 61, 11, 78, 51, 86, 89, 74, 39, 24, 6], [33, 22, 60, 20, 11, 35, 35, 65, 90, 78, 49, 66, 46, 5, 39, 79, 85, 93, 51], [21, 38, 36, 14, 33, 23, 72, 84, 38, 47, 64, 47, 1, 42, 68, 78, 86, 76, 25], [57, 52, 7, 7, 56, 39, 70, 83, 58, 23, 10, 72, 36, 71, 3, 72, 77, 95, 13], [90, 48, 66, 3, 63, 15, 2, 61, 59, 17, 11, 5, 70, 67, 23, 96, 63, 4, 29], [17, 95, 35, 48, 85, 87, 48, 95, 53, 65, 75, 1, 7, 77, 84, 70, 30, 70, 98], [99, 84, 38, 30, 97, 54, 88, 95, 16, 16, 27, 22, 15, 46, 1, 28, 33, 15, 95], [57, 70, 68, 58, 20, 4, 10, 7, 91, 57, 6, 55, 31, 64, 36, 91, 13, 75, 73], [72, 61, 10, 66, 24, 99, 34, 50, 75, 1, 5, 27, 7, 1, 32, 17, 18, 68, 49], [13, 69, 22, 26, 68, 87, 5, 9, 77, 62, 73, 68, 90, 78, 2, 95, 50, 51, 90], [2, 41, 64, 44, 52, 37, 66, 92, 56, 23, 71, 39, 86, 60, 56, 36, 1, 98, 4], [41, 99, 53, 31, 33, 5, 43, 11, 32, 1, 43, 6, 92, 81, 11, 41, 27, 61, 76], [13, 95, 35, 25, 94, 36, 21, 55, 36, 28, 27, 12, 74, 26, 93, 45, 6, 89, 8], [75, 17, 38, 77, 41, 15, 83, 83, 74, 28, 25, 79, 35, 80, 37, 27, 5, 59, 88], [66, 99, 57, 61, 97, 96, 60, 64, 32, 16, 44, 87, 90, 69, 61, 71, 34, 74, 86], [21, 19, 52, 42, 39, 45, 89, 13, 43, 83, 71, 95, 66, 45, 4, 1, 60, 50, 87], [47, 17, 86, 35, 8, 56, 60, 55, 7, 65, 25, 24, 97, 75, 96, 93, 65, 47, 8], [45, 29, 31, 57, 99, 7, 31, 60, 56, 32, 94, 61, 61, 76, 99, 64, 10, 26, 69]], [[97, 37, 30, 97, 2, 42, 68, 90, 94], [35, 10, 31, 79, 85, 6, 65, 74, 2], [9, 81, 80, 66, 80, 99, 59, 92, 13], [6, 25, 63, 59, 90, 46, 15, 66, 86], [42, 92, 17, 23, 15, 38, 56, 34, 94], [65, 80, 89, 87, 97, 34, 73, 16, 50], [69, 42, 62, 12, 69, 87, 72, 99, 80], [84, 28, 30, 75, 50, 17, 10, 88, 95], [11, 47, 8, 31, 37, 33, 9, 46, 3]], [[28, 52, 61, 24, 10, 42, 37, 15, 28, 37, 65, 13, 59], [68, 56, 30, 64, 67, 20, 99, 27, 12, 41, 80, 96, 51], [97, 80, 29, 91, 95, 51, 59, 88, 31, 9, 70, 30, 90], [40, 7, 72, 59, 11, 3, 4, 97, 20, 5, 34, 14, 13], [61, 49, 45, 53, 24, 94, 63, 75, 9, 63, 56, 77, 77], [96, 71, 75, 42, 1, 64, 92, 72, 15, 69, 22, 20, 68], [45, 89, 80, 40, 46, 91, 63, 93, 12, 52, 7, 88, 55], [5, 47, 97, 38, 43, 70, 8, 86, 50, 78, 9, 13, 50], [96, 78, 35, 25, 61, 31, 49, 43, 45, 84, 7, 74, 6], [89, 50, 70, 45, 54, 17, 86, 87, 29, 64, 71, 99, 20], [26, 93, 29, 7, 34, 5, 77, 6, 96, 33, 43, 59, 33], [83, 61, 18, 14, 21, 39, 34, 31, 81, 7, 85, 71, 1], [86, 22, 87, 92, 63, 62, 46, 57, 94, 45, 74, 76, 80]], [[68, 37, 94, 90, 14, 37, 89, 91, 14, 66, 66, 33, 2], [98, 53, 89, 55, 45, 37, 27, 90, 52, 86, 47, 58, 7], [13, 48, 28, 45, 56, 92, 88, 35, 55, 97, 37, 9, 3], [2, 58, 22, 85, 24, 78, 54, 97, 17, 58, 58, 21, 77], [63, 63, 44, 40, 75, 66, 92, 67, 79, 46, 24, 72, 70], [96, 51, 99, 77, 92, 4, 31, 65, 30, 72, 40, 14, 44], [92, 34, 39, 4, 88, 27, 42, 11, 87, 32, 50, 53, 4], [19, 71, 33, 78, 77, 70, 83, 55, 9, 62, 99, 62, 48], [90, 68, 48, 92, 27, 55, 44, 71, 52, 57, 9, 98, 8], [56, 10, 65, 72, 45, 39, 46, 17, 82, 98, 99, 67, 76], [62, 68, 36, 9, 35, 67, 89, 52, 90, 91, 28, 58, 83], [24, 59, 37, 38, 25, 98, 15, 16, 55, 4, 26, 39, 57], [47, 90, 48, 92, 49, 37, 38, 62, 61, 74, 97, 8, 38]], [[85, 56, 45, 50, 20, 63, 55, 34, 92, 32, 76, 73, 43, 79, 13, 2, 61, 84, 14, 42, 15, 93, 85, 10, 56, 53, 58, 85, 99, 81, 62, 57, 63, 4, 78, 96], [82, 34, 32, 78, 34, 70, 40, 35, 15, 51, 20, 92, 37, 38, 21, 88, 10, 54, 9, 86, 42, 16, 24, 4, 44, 23, 42, 86, 66, 92, 19, 20, 28, 24, 91, 2], [7, 1, 11, 51, 60, 31, 30, 77, 24, 18, 58, 77, 17, 46, 94, 19, 12, 90, 82, 12, 50, 66, 20, 6, 1, 90, 7, 96, 55, 97, 74, 15, 95, 24, 29, 82], [71, 34, 78, 84, 93, 37, 42, 64, 95, 19, 23, 71, 6, 99, 93, 55, 77, 39, 25, 98, 83, 4, 88, 33, 66, 2, 14, 50, 11, 34, 38, 92, 39, 22, 42, 97], [95, 57, 78, 38, 9, 88, 29, 69, 42, 60, 39, 91, 72, 93, 60, 53, 76, 8, 21, 56, 48, 47, 9, 78, 1, 55, 31, 80, 91, 11, 66, 60, 31, 50, 60, 88], [62, 39, 3, 58, 68, 30, 67, 68, 58, 77, 53, 14, 10, 78, 81, 22, 63, 61, 46, 37, 21, 89, 3, 19, 32, 79, 24, 73, 74, 48, 96, 58, 40, 7, 46, 91], [15, 85, 74, 87, 5, 59, 70, 22, 28, 54, 19, 14, 48, 7, 79, 32, 22, 46, 85, 83, 13, 22, 10, 44, 24, 59, 62, 72, 72, 55, 49, 50, 19, 82, 58, 97], [48, 93, 96, 72, 96, 12, 86, 20, 45, 26, 81, 98, 31, 82, 59, 3, 18, 84, 21, 57, 99, 42, 62, 30, 61, 36, 55, 4, 15, 71, 96, 97, 57, 63, 77, 64], [17, 53, 40, 70, 50, 68, 15, 72, 34, 30, 87, 73, 24, 8, 57, 70, 25, 77, 34, 25, 18, 73, 97, 70, 14, 6, 82, 90, 36, 36, 75, 18, 15, 94, 89, 16], [76, 14, 47, 54, 58, 77, 30, 46, 16, 1, 41, 93, 27, 77, 62, 81, 28, 20, 55, 51, 69, 88, 73, 97, 34, 27, 97, 38, 29, 35, 20, 19, 5, 25, 93, 26], [51, 66, 61, 15, 45, 6, 58, 1, 73, 43, 16, 14, 74, 19, 51, 8, 48, 12, 70, 35, 70, 6, 99, 11, 38, 91, 26, 28, 72, 89, 83, 80, 50, 58, 26, 44], [15, 76, 24, 77, 59, 57, 17, 77, 81, 1, 11, 20, 31, 99, 39, 63, 6, 99, 28, 51, 53, 44, 65, 80, 12, 28, 79, 72, 68, 95, 30, 35, 6, 85, 30, 80], [63, 8, 91, 33, 43, 76, 43, 45, 87, 54, 65, 7, 36, 25, 85, 37, 12, 32, 49, 38, 56, 80, 65, 26, 57, 14, 56, 70, 41, 51, 84, 67, 12, 97, 49, 1], [19, 66, 58, 87, 72, 98, 4, 8, 27, 26, 97, 43, 40, 50, 67, 73, 74, 29, 85, 42, 18, 81, 21, 67, 62, 27, 96, 93, 47, 93, 26, 9, 91, 12, 16, 47], [56, 66, 51, 27, 73, 66, 62, 71, 8, 38, 6, 59, 19, 79, 56, 28, 94, 91, 10, 45, 95, 65, 50, 32, 61, 16, 6, 66, 62, 66, 67, 19, 4, 43, 18, 82], [46, 46, 85, 21, 30, 64, 41, 17, 5, 5, 73, 75, 48, 78, 38, 6, 58, 14, 72, 94, 59, 65, 89, 13, 27, 25, 56, 68, 59, 95, 49, 18, 81, 75, 76, 3], [79, 57, 6, 69, 31, 8, 10, 3, 12, 92, 76, 94, 19, 21, 81, 14, 75, 29, 7, 49, 65, 7, 14, 16, 99, 16, 85, 13, 82, 29, 85, 73, 95, 61, 37, 17], [31, 59, 88, 47, 6, 32, 31, 18, 9, 3, 71, 26, 13, 34, 43, 93, 33, 69, 36, 79, 74, 68, 47, 61, 45, 96, 88, 84, 48, 41, 38, 68, 75, 11, 16, 65], [97, 71, 67, 71, 1, 97, 71, 4, 82, 37, 14, 79, 25, 82, 4, 66, 43, 26, 84, 15, 6, 37, 43, 42, 13, 16, 42, 38, 66, 65, 5, 30, 95, 43, 32, 67], [67, 42, 5, 99, 86, 96, 59, 23, 8, 68, 70, 91, 19, 44, 93, 38, 44, 6, 3, 96, 80, 33, 66, 58, 26, 99, 28, 43, 75, 88, 16, 89, 23, 59, 35, 89], [41, 97, 22, 74, 1, 46, 22, 32, 87, 30, 87, 43, 12, 83, 71, 27, 26, 18, 92, 75, 66, 81, 61, 46, 29, 32, 15, 60, 82, 28, 27, 41, 47, 33, 44, 50], [10, 24, 34, 91, 20, 25, 55, 90, 43, 53, 85, 50, 55, 13, 49, 97, 10, 92, 97, 11, 78, 84, 20, 72, 79, 97, 83, 48, 76, 17, 33, 20, 46, 31, 51, 83], [19, 62, 44, 77, 38, 49, 65, 11, 27, 58, 64, 65, 15, 82, 89, 1, 19, 56, 64, 34, 64, 10, 76, 60, 39, 66, 32, 51, 26, 57, 84, 60, 55, 6, 7, 66], [81, 26, 95, 98, 82, 78, 5, 87, 1, 84, 2, 65, 10, 50, 51, 69, 41, 58, 77, 68, 24, 91, 56, 36, 2, 96, 56, 81, 12, 12, 85, 72, 22, 74, 84, 62], [64, 28, 89, 28, 4, 45, 90, 13, 83, 98, 80, 4, 61, 84, 26, 94, 6, 77, 56, 81, 27, 35, 97, 82, 58, 84, 63, 33, 95, 83, 97, 81, 33, 69, 40, 47], [45, 27, 7, 58, 14, 4, 82, 34, 80, 91, 38, 20, 46, 19, 1, 23, 62, 73, 28, 84, 80, 77, 33, 3, 79, 16, 30, 25, 78, 1, 33, 37, 29, 37, 61, 8], [1, 63, 88, 65, 46, 43, 10, 82, 85, 10, 62, 86, 51, 45, 73, 73, 45, 85, 58, 95, 66, 24, 97, 75, 65, 55, 51, 72, 73, 21, 47, 22, 29, 40, 3, 49], [25, 82, 11, 94, 89, 75, 98, 88, 48, 32, 3, 45, 89, 20, 20, 51, 81, 20, 82, 14, 98, 80, 32, 72, 42, 80, 39, 38, 64, 4, 99, 92, 63, 61, 78, 5], [66, 45, 50, 88, 3, 23, 11, 38, 56, 35, 65, 6, 70, 40, 90, 35, 13, 25, 86, 81, 78, 67, 68, 99, 47, 55, 92, 43, 2, 45, 48, 62, 38, 47, 4, 60], [49, 76, 34, 44, 94, 85, 56, 92, 42, 50, 69, 33, 98, 96, 91, 67, 42, 44, 68, 57, 36, 41, 56, 3, 56, 56, 65, 39, 40, 39, 27, 67, 94, 65, 74, 3], [3, 37, 98, 20, 11, 83, 91, 24, 70, 65, 83, 74, 32, 62, 55, 36, 66, 37, 14, 46, 77, 56, 50, 61, 17, 27, 54, 29, 13, 49, 25, 88, 23, 26, 48, 36], [6, 80, 74, 39, 57, 91, 66, 10, 72, 9, 77, 72, 27, 46, 63, 42, 85, 41, 34, 93, 30, 44, 80, 1, 45, 47, 93, 30, 22, 15, 84, 38, 23, 31, 57, 81], [35, 66, 53, 31, 26, 31, 72, 80, 12, 53, 56, 83, 62, 44, 58, 77, 65, 13, 61, 68, 51, 62, 48, 95, 63, 72, 91, 72, 51, 24, 86, 40, 29, 73, 17, 1], [96, 84, 1, 25, 41, 91, 23, 18, 95, 28, 85, 12, 88, 49, 97, 81, 97, 16, 27, 53, 92, 36, 7, 34, 65, 4, 26, 20, 51, 77, 99, 10, 8, 18, 17, 69], [30, 95, 39, 61, 24, 81, 98, 35, 79, 61, 75, 98, 72, 15, 36, 55, 37, 87, 62, 64, 39, 90, 98, 75, 12, 72, 8, 41, 69, 74, 3, 43, 37, 86, 57, 25], [4, 58, 37, 8, 94, 9, 79, 1, 13, 68, 16, 44, 65, 14, 91, 26, 32, 2, 16, 92, 49, 90, 75, 23, 94, 60, 95, 66, 20, 93, 74, 18, 59, 31, 4, 27]], [[95, 71, 19, 39, 66, 78, 46, 92, 38, 67, 29, 91, 57, 48, 52, 48, 61, 67, 48, 94, 82, 8, 74, 86, 88, 67, 14, 47, 24, 91, 62, 58, 34, 31, 48, 91, 45, 29, 29, 63, 48, 12, 78, 27], [47, 66, 37, 45, 57, 18, 13, 73, 29, 56, 74, 20, 29, 6, 26, 61, 86, 43, 47, 26, 81, 1, 95, 73, 26, 64, 62, 6, 62, 66, 42, 27, 65, 30, 82, 98, 85, 65, 47, 32, 34, 47, 14, 5], [36, 96, 9, 35, 25, 75, 46, 13, 61, 30, 98, 32, 30, 82, 56, 67, 71, 55, 98, 8, 43, 48, 58, 32, 78, 69, 7, 74, 20, 62, 21, 92, 29, 70, 38, 42, 3, 37, 17, 33, 10, 37, 33, 28], [87, 42, 58, 48, 51, 10, 8, 16, 96, 62, 49, 89, 15, 16, 81, 27, 47, 26, 72, 41, 11, 91, 9, 54, 11, 7, 28, 94, 62, 55, 36, 73, 99, 63, 51, 77, 48, 68, 10, 26, 67, 53, 43, 17], [27, 22, 36, 72, 33, 90, 95, 53, 11, 93, 29, 38, 58, 15, 54, 62, 57, 79, 71, 58, 49, 53, 29, 33, 46, 54, 80, 98, 85, 7, 29, 9, 49, 71, 78, 94, 88, 51, 98, 8, 55, 65, 98, 84], [95, 79, 15, 51, 34, 69, 86, 12, 45, 31, 54, 93, 22, 72, 64, 60, 28, 21, 75, 75, 87, 77, 43, 27, 23, 97, 90, 36, 97, 38, 16, 74, 43, 41, 44, 52, 17, 52, 43, 23, 1, 93, 25, 6], [74, 54, 78, 23, 19, 56, 53, 31, 38, 19, 1, 77, 50, 98, 58, 81, 32, 49, 98, 97, 92, 44, 29, 88, 48, 80, 77, 26, 7, 44, 14, 52, 32, 75, 32, 75, 84, 57, 52, 34, 61, 62, 86, 87], [93, 76, 31, 29, 31, 12, 35, 57, 41, 27, 15, 94, 71, 36, 24, 82, 24, 96, 76, 28, 75, 3, 3, 29, 32, 54, 38, 95, 56, 65, 21, 41, 20, 60, 75, 59, 74, 55, 3, 14, 45, 95, 99, 60], [49, 9, 54, 70, 93, 52, 63, 52, 22, 55, 3, 2, 59, 28, 37, 69, 9, 62, 32, 81, 75, 35, 47, 18, 36, 19, 25, 46, 60, 95, 23, 78, 27, 35, 77, 55, 36, 88, 97, 71, 9, 21, 32, 66], [44, 89, 65, 75, 80, 87, 15, 27, 16, 46, 97, 72, 48, 65, 19, 90, 37, 58, 55, 53, 47, 3, 88, 86, 62, 1, 39, 73, 33, 23, 34, 49, 49, 99, 49, 10, 96, 66, 71, 88, 67, 76, 39, 42], [91, 1, 46, 36, 96, 91, 44, 31, 97, 58, 96, 4, 53, 89, 93, 57, 73, 78, 50, 5, 52, 17, 32, 6, 69, 93, 92, 61, 10, 23, 53, 61, 19, 4, 46, 32, 84, 46, 62, 92, 54, 87, 67, 24], [66, 18, 96, 48, 46, 48, 62, 94, 27, 62, 78, 65, 52, 1, 50, 40, 72, 17, 1, 78, 77, 30, 77, 67, 22, 35, 56, 14, 45, 86, 33, 12, 24, 69, 57, 9, 2, 59, 95, 29, 93, 55, 94, 22], [85, 49, 12, 71, 89, 8, 97, 16, 40, 45, 64, 63, 51, 10, 76, 86, 71, 45, 85, 56, 86, 73, 84, 13, 64, 88, 30, 52, 54, 57, 18, 25, 53, 20, 11, 40, 98, 23, 90, 87, 42, 47, 56, 33], [89, 98, 26, 69, 29, 94, 60, 91, 37, 25, 74, 44, 34, 12, 93, 39, 19, 19, 29, 66, 90, 98, 94, 76, 20, 57, 97, 9, 2, 28, 34, 21, 83, 78, 81, 56, 5, 85, 22, 59, 40, 84, 92, 63], [32, 45, 83, 92, 87, 33, 82, 35, 46, 36, 62, 83, 90, 26, 7, 87, 5, 87, 32, 79, 91, 81, 84, 57, 80, 62, 28, 95, 80, 78, 74, 66, 97, 41, 86, 66, 64, 7, 41, 45, 44, 30, 38, 39], [19, 47, 38, 17, 74, 79, 69, 99, 4, 35, 1, 81, 85, 58, 22, 5, 60, 36, 9, 84, 57, 78, 84, 90, 4, 51, 39, 84, 52, 75, 71, 55, 31, 50, 8, 87, 15, 65, 10, 41, 88, 79, 48, 21], [86, 24, 74, 23, 80, 69, 33, 36, 25, 58, 90, 66, 98, 31, 44, 63, 45, 83, 82, 50, 67, 71, 87, 1, 71, 86, 67, 83, 94, 9, 99, 35, 13, 26, 45, 51, 92, 25, 56, 39, 3, 75, 94, 53], [33, 62, 98, 67, 69, 95, 4, 72, 59, 17, 22, 38, 88, 31, 49, 52, 89, 38, 96, 49, 90, 27, 23, 84, 27, 81, 14, 3, 27, 62, 14, 92, 44, 25, 61, 75, 52, 12, 97, 84, 34, 23, 19, 1], [74, 65, 5, 57, 22, 43, 2, 73, 7, 21, 71, 59, 9, 40, 73, 49, 12, 73, 10, 74, 17, 4, 64, 16, 49, 27, 6, 9, 58, 32, 38, 30, 78, 45, 29, 92, 22, 31, 81, 17, 54, 79, 47, 32], [28, 11, 39, 17, 76, 39, 73, 25, 26, 68, 62, 19, 13, 29, 54, 73, 42, 62, 71, 71, 21, 9, 45, 27, 48, 85, 69, 5, 72, 15, 77, 97, 44, 47, 32, 36, 49, 53, 23, 34, 18, 12, 87, 2], [27, 50, 31, 48, 86, 69, 17, 43, 71, 18, 66, 31, 63, 28, 67, 9, 97, 28, 92, 18, 15, 75, 89, 5, 41, 91, 76, 74, 73, 66, 73, 51, 16, 65, 85, 57, 37, 39, 65, 49, 47, 40, 14, 40], [48, 32, 88, 39, 33, 30, 26, 43, 55, 44, 78, 76, 3, 7, 85, 58, 91, 10, 10, 81, 42, 34, 82, 26, 60, 2, 73, 45, 5, 26, 79, 25, 26, 92, 87, 85, 22, 19, 10, 42, 31, 31, 99, 75], [81, 97, 86, 90, 36, 66, 32, 67, 63, 23, 50, 65, 69, 44, 58, 57, 37, 65, 18, 5, 82, 99, 96, 26, 33, 42, 88, 27, 54, 83, 82, 79, 91, 75, 24, 3, 39, 71, 12, 33, 22, 35, 14, 26], [83, 85, 54, 41, 45, 31, 69, 99, 17, 60, 96, 4, 10, 94, 9, 61, 90, 22, 21, 23, 61, 12, 95, 17, 55, 21, 54, 47, 41, 97, 15, 96, 59, 99, 15, 29, 11, 29, 86, 90, 82, 89, 85, 88], [56, 92, 53, 3, 13, 38, 70, 11, 23, 73, 56, 17, 9, 83, 99, 96, 92, 28, 79, 19, 97, 87, 92, 4, 47, 47, 31, 99, 5, 33, 48, 32, 79, 59, 98, 64, 47, 9, 35, 47, 88, 82, 17, 1], [55, 11, 33, 70, 56, 64, 93, 58, 20, 18, 78, 45, 43, 20, 57, 82, 27, 18, 17, 60, 89, 5, 6, 97, 15, 39, 80, 39, 88, 21, 13, 29, 98, 5, 67, 21, 9, 67, 44, 62, 94, 67, 62, 62], [60, 49, 39, 41, 50, 98, 17, 53, 55, 78, 75, 56, 1, 65, 64, 52, 15, 2, 12, 45, 57, 42, 2, 87, 62, 34, 17, 41, 78, 75, 84, 71, 65, 15, 38, 98, 73, 65, 9, 42, 66, 86, 89, 51], [78, 99, 80, 19, 31, 66, 32, 75, 8, 69, 98, 32, 47, 70, 8, 34, 4, 36, 44, 25, 26, 33, 9, 47, 72, 17, 15, 42, 54, 13, 50, 44, 3, 53, 56, 54, 57, 12, 93, 59, 65, 96, 37, 20], [72, 37, 31, 95, 25, 50, 49, 8, 94, 94, 91, 35, 13, 21, 73, 24, 48, 33, 1, 72, 3, 14, 14, 49, 33, 4, 38, 25, 47, 13, 39, 25, 73, 43, 38, 35, 93, 55, 50, 78, 34, 25, 42, 92], [51, 94, 37, 66, 85, 34, 83, 38, 31, 26, 76, 94, 26, 63, 48, 95, 79, 10, 36, 40, 26, 9, 53, 81, 70, 86, 80, 86, 53, 39, 61, 52, 68, 68, 73, 78, 42, 90, 67, 96, 75, 51, 3, 13], [13, 61, 24, 20, 74, 87, 97, 55, 35, 78, 80, 30, 83, 33, 41, 66, 49, 8, 84, 3, 85, 65, 85, 72, 2, 87, 41, 53, 75, 16, 9, 96, 39, 64, 36, 23, 47, 49, 55, 94, 10, 63, 95, 26], [48, 30, 2, 29, 54, 32, 38, 21, 27, 88, 34, 23, 78, 39, 69, 73, 45, 63, 8, 7, 30, 12, 20, 64, 29, 55, 12, 84, 22, 23, 48, 45, 26, 28, 55, 73, 69, 2, 28, 77, 79, 53, 14, 46], [78, 67, 74, 70, 20, 35, 48, 43, 20, 56, 3, 68, 11, 62, 61, 95, 58, 29, 38, 84, 88, 87, 22, 86, 41, 84, 63, 38, 50, 7, 24, 46, 25, 78, 29, 67, 93, 80, 85, 22, 85, 86, 9, 87], [49, 73, 96, 36, 5, 90, 4, 24, 41, 14, 91, 12, 82, 44, 9, 66, 38, 96, 77, 57, 47, 55, 88, 2, 83, 18, 66, 90, 57, 64, 88, 27, 53, 59, 29, 72, 95, 98, 14, 68, 43, 29, 57, 33], [21, 41, 1, 27, 2, 64, 51, 54, 74, 74, 30, 1, 95, 99, 29, 13, 73, 43, 41, 75, 88, 89, 58, 77, 14, 41, 67, 54, 6, 46, 77, 1, 29, 78, 76, 26, 58, 87, 3, 60, 14, 98, 23, 62], [10, 4, 39, 74, 88, 34, 88, 25, 52, 15, 12, 1, 9, 59, 14, 31, 88, 53, 63, 10, 43, 18, 67, 59, 76, 99, 23, 86, 75, 46, 49, 23, 12, 29, 89, 88, 59, 53, 68, 63, 29, 3, 95, 89], [37, 63, 23, 49, 86, 93, 77, 3, 22, 36, 10, 9, 56, 55, 19, 72, 33, 20, 94, 35, 31, 83, 50, 46, 78, 10, 67, 34, 51, 92, 83, 39, 90, 68, 12, 26, 71, 67, 90, 2, 12, 59, 32, 51], [11, 32, 64, 45, 79, 54, 6, 26, 8, 8, 38, 8, 17, 83, 3, 41, 73, 53, 97, 96, 96, 70, 62, 53, 59, 93, 81, 83, 95, 83, 23, 47, 35, 14, 65, 97, 49, 36, 1, 84, 22, 35, 3, 12], [37, 58, 77, 12, 2, 84, 65, 58, 60, 41, 35, 88, 90, 11, 52, 52, 62, 63, 15, 70, 40, 9, 70, 17, 23, 58, 95, 80, 51, 57, 86, 16, 45, 61, 12, 73, 6, 4, 81, 74, 35, 47, 85, 19], [27, 11, 70, 59, 41, 43, 28, 63, 67, 45, 24, 77, 64, 79, 73, 39, 99, 45, 61, 82, 43, 67, 92, 80, 42, 41, 47, 43, 23, 32, 74, 57, 38, 77, 15, 28, 13, 35, 2, 61, 65, 41, 96, 94], [86, 4, 53, 88, 14, 17, 14, 41, 62, 52, 27, 85, 40, 35, 90, 95, 59, 97, 49, 63, 11, 80, 6, 98, 41, 32, 21, 93, 75, 57, 5, 91, 28, 95, 75, 77, 70, 27, 94, 53, 48, 83, 78, 58], [9, 55, 45, 28, 28, 46, 25, 26, 62, 68, 67, 34, 21, 81, 34, 44, 76, 89, 21, 18, 36, 70, 84, 53, 20, 96, 95, 84, 94, 3, 84, 8, 85, 48, 23, 1, 2, 74, 37, 94, 51, 44, 24, 32], [56, 50, 64, 30, 38, 78, 55, 3, 25, 45, 62, 7, 81, 27, 23, 32, 2, 75, 34, 52, 61, 34, 7, 10, 89, 2, 30, 81, 29, 82, 60, 99, 17, 56, 86, 51, 25, 84, 16, 25, 15, 79, 57, 15], [56, 82, 37, 65, 33, 3, 49, 22, 54, 21, 27, 4, 99, 1, 4, 55, 24, 29, 22, 23, 85, 78, 8, 58, 80, 99, 88, 59, 90, 7, 25, 45, 90, 26, 30, 66, 53, 73, 39, 11, 79, 12, 99, 50]], [[16, 49, 32, 82, 45, 85, 80, 71, 5, 44, 41, 97, 95, 85, 67, 74, 75, 22, 17, 89, 92, 50, 84, 94, 31, 13, 74, 51, 33, 20, 48, 78, 72, 72, 92, 74, 14, 62, 51, 78, 70, 98, 81, 21, 92, 38, 15], [36, 9, 99, 59, 82, 54, 17, 82, 4, 84, 13, 75, 43, 97, 92, 8, 20, 82, 71, 61, 44, 97, 51, 58, 75, 30, 99, 84, 10, 94, 18, 25, 96, 34, 44, 39, 95, 92, 90, 68, 43, 20, 72, 2, 27, 34, 55], [36, 85, 72, 87, 72, 69, 65, 85, 44, 43, 74, 66, 21, 61, 13, 28, 30, 82, 2, 58, 83, 21, 90, 46, 89, 83, 25, 57, 20, 6, 18, 49, 82, 20, 34, 10, 33, 55, 19, 66, 47, 49, 67, 30, 83, 85, 59], [78, 31, 21, 17, 53, 51, 24, 40, 98, 47, 20, 16, 58, 49, 42, 12, 41, 58, 60, 24, 13, 34, 61, 27, 85, 67, 14, 41, 57, 30, 45, 74, 1, 92, 83, 94, 84, 52, 20, 23, 95, 96, 90, 78, 6, 33, 8], [63, 4, 13, 35, 93, 89, 34, 56, 11, 38, 93, 45, 86, 58, 34, 75, 92, 72, 24, 74, 79, 63, 39, 21, 36, 48, 84, 13, 2, 27, 7, 90, 94, 19, 40, 21, 58, 26, 74, 36, 44, 64, 27, 8, 90, 1, 23], [73, 31, 7, 9, 71, 92, 98, 53, 16, 74, 24, 74, 46, 29, 89, 30, 51, 83, 31, 30, 34, 92, 19, 75, 28, 6, 17, 91, 36, 1, 16, 68, 47, 23, 96, 67, 62, 85, 88, 15, 75, 67, 83, 43, 8, 98, 98], [44, 26, 67, 32, 64, 43, 74, 74, 62, 11, 78, 95, 9, 48, 6, 54, 62, 54, 99, 98, 56, 82, 87, 30, 3, 61, 15, 3, 15, 67, 29, 31, 71, 71, 55, 75, 92, 43, 25, 81, 55, 50, 38, 60, 85, 52, 84], [74, 70, 76, 81, 45, 97, 19, 5, 42, 93, 30, 65, 76, 79, 5, 38, 11, 84, 29, 14, 90, 98, 74, 91, 89, 10, 39, 60, 96, 98, 23, 97, 96, 22, 86, 87, 83, 23, 22, 62, 94, 19, 22, 1, 34, 26, 4], [48, 45, 12, 92, 37, 3, 28, 93, 84, 2, 56, 65, 46, 44, 18, 73, 37, 54, 25, 83, 62, 25, 52, 63, 15, 46, 56, 26, 64, 20, 67, 25, 21, 34, 88, 25, 65, 29, 32, 1, 35, 56, 16, 32, 79, 5, 10], [86, 72, 79, 20, 89, 12, 90, 68, 63, 26, 60, 74, 61, 15, 5, 32, 96, 22, 22, 12, 64, 75, 88, 80, 16, 65, 51, 87, 92, 32, 53, 3, 13, 92, 92, 58, 45, 24, 51, 13, 24, 5, 81, 50, 76, 49, 18], [33, 58, 31, 34, 94, 96, 74, 31, 99, 79, 27, 59, 27, 1, 76, 68, 23, 98, 52, 57, 87, 51, 83, 84, 63, 84, 93, 77, 28, 24, 22, 86, 40, 75, 8, 96, 88, 12, 49, 21, 67, 39, 62, 82, 58, 62, 70], [36, 45, 79, 15, 62, 38, 64, 88, 71, 9, 75, 80, 71, 25, 78, 65, 20, 28, 49, 34, 73, 20, 95, 85, 22, 77, 44, 47, 25, 22, 61, 52, 20, 96, 80, 20, 86, 45, 37, 15, 76, 9, 44, 15, 44, 86, 12], [27, 19, 25, 74, 99, 64, 12, 50, 72, 11, 83, 23, 88, 15, 63, 20, 89, 78, 10, 61, 93, 47, 49, 49, 76, 33, 87, 78, 23, 53, 37, 22, 93, 2, 20, 5, 91, 3, 82, 77, 86, 77, 12, 32, 58, 71, 70], [40, 6, 63, 25, 91, 69, 83, 73, 50, 40, 1, 46, 73, 39, 10, 49, 14, 46, 40, 89, 19, 17, 82, 46, 73, 65, 70, 38, 17, 73, 11, 53, 18, 7, 35, 44, 71, 39, 11, 10, 98, 88, 76, 9, 86, 96, 8], [48, 21, 80, 97, 89, 6, 59, 68, 23, 73, 75, 35, 12, 99, 71, 57, 29, 85, 67, 61, 61, 88, 30, 27, 93, 30, 55, 23, 37, 26, 36, 92, 63, 37, 51, 68, 93, 78, 63, 37, 97, 31, 78, 25, 73, 25, 46], [89, 30, 20, 23, 1, 15, 21, 30, 11, 90, 52, 30, 9, 69, 47, 34, 33, 98, 65, 51, 79, 31, 56, 76, 71, 45, 33, 96, 51, 5, 38, 5, 56, 81, 71, 89, 25, 67, 52, 36, 92, 23, 8, 31, 63, 21, 99], [50, 29, 60, 67, 44, 89, 2, 98, 15, 39, 40, 47, 76, 52, 88, 6, 70, 48, 58, 90, 3, 96, 46, 18, 56, 92, 33, 17, 32, 76, 85, 2, 26, 39, 63, 17, 34, 19, 62, 32, 50, 86, 45, 54, 82, 88, 1], [66, 40, 24, 52, 2, 61, 27, 66, 87, 33, 34, 62, 32, 3, 55, 27, 76, 8, 20, 52, 17, 33, 55, 75, 73, 98, 71, 16, 91, 79, 64, 88, 40, 58, 83, 23, 95, 94, 7, 59, 59, 3, 30, 10, 98, 13, 39], [77, 64, 25, 41, 98, 40, 62, 40, 34, 79, 3, 52, 46, 86, 98, 69, 41, 86, 60, 29, 8, 98, 4, 25, 50, 23, 25, 98, 70, 98, 21, 94, 56, 3, 79, 21, 83, 83, 49, 46, 98, 78, 68, 31, 46, 75, 44], [45, 75, 49, 4, 80, 57, 56, 38, 6, 82, 89, 24, 52, 39, 73, 37, 98, 34, 40, 40, 37, 92, 50, 11, 78, 59, 26, 60, 8, 28, 84, 60, 89, 10, 63, 61, 75, 26, 23, 63, 19, 18, 50, 19, 15, 16, 20], [19, 75, 71, 19, 88, 31, 52, 48, 8, 50, 61, 88, 8, 13, 74, 19, 50, 23, 57, 97, 30, 94, 29, 61, 35, 9, 72, 25, 64, 37, 38, 8, 90, 75, 40, 23, 96, 45, 1, 49, 9, 40, 28, 97, 96, 8, 37], [82, 71, 18, 76, 68, 77, 75, 80, 44, 78, 16, 52, 53, 86, 18, 40, 61, 25, 35, 71, 84, 27, 93, 10, 75, 20, 33, 77, 80, 11, 69, 67, 59, 66, 53, 38, 10, 6, 85, 95, 34, 49, 32, 29, 65, 33, 17], [98, 49, 16, 7, 13, 84, 4, 63, 69, 80, 73, 76, 78, 15, 5, 42, 18, 72, 8, 89, 68, 26, 75, 70, 33, 22, 93, 69, 1, 86, 35, 56, 95, 67, 3, 71, 1, 42, 58, 88, 94, 96, 96, 85, 64, 80, 4], [17, 77, 99, 40, 34, 56, 11, 89, 40, 94, 13, 24, 34, 8, 82, 7, 62, 46, 86, 71, 13, 2, 2, 29, 91, 82, 58, 2, 59, 53, 68, 61, 49, 46, 72, 59, 48, 9, 18, 50, 86, 75, 27, 32, 66, 66, 94], [22, 86, 24, 91, 75, 13, 91, 15, 49, 17, 39, 73, 87, 4, 57, 15, 43, 31, 6, 90, 59, 65, 86, 30, 58, 86, 97, 56, 69, 36, 46, 74, 1, 12, 67, 10, 1, 19, 82, 95, 55, 49, 55, 86, 68, 41, 55], [74, 74, 79, 69, 43, 81, 82, 57, 48, 50, 69, 8, 56, 91, 89, 26, 23, 41, 87, 93, 97, 59, 18, 71, 96, 71, 8, 58, 85, 17, 51, 33, 30, 66, 60, 46, 22, 32, 25, 8, 97, 63, 29, 81, 40, 45, 2], [49, 31, 68, 90, 9, 95, 10, 51, 70, 44, 26, 75, 79, 84, 78, 21, 91, 30, 71, 15, 80, 59, 84, 84, 86, 70, 20, 69, 53, 75, 2, 30, 8, 40, 8, 17, 99, 30, 1, 69, 64, 80, 36, 79, 49, 81, 77], [24, 4, 77, 62, 9, 26, 47, 16, 37, 70, 11, 2, 94, 83, 23, 47, 62, 76, 39, 6, 36, 62, 60, 79, 36, 77, 72, 89, 88, 31, 40, 60, 13, 93, 96, 37, 61, 18, 90, 18, 34, 54, 31, 79, 37, 84, 92], [68, 72, 58, 82, 96, 53, 87, 62, 79, 7, 31, 96, 40, 78, 83, 50, 80, 9, 65, 25, 8, 39, 32, 8, 13, 67, 66, 28, 4, 23, 34, 55, 71, 94, 58, 73, 19, 9, 23, 75, 13, 93, 31, 72, 19, 5, 91], [39, 14, 22, 22, 5, 62, 52, 80, 39, 26, 80, 56, 12, 80, 49, 12, 96, 5, 92, 51, 4, 93, 83, 25, 99, 24, 56, 19, 23, 95, 83, 96, 77, 46, 18, 61, 71, 45, 88, 46, 17, 15, 73, 34, 99, 8, 50], [11, 88, 42, 94, 85, 43, 35, 59, 12, 73, 12, 28, 93, 46, 40, 99, 29, 70, 16, 46, 92, 65, 29, 52, 40, 6, 27, 37, 22, 7, 1, 77, 48, 51, 14, 79, 12, 49, 41, 68, 85, 2, 85, 62, 57, 14, 44], [66, 75, 37, 78, 47, 61, 84, 99, 27, 49, 60, 70, 71, 45, 1, 13, 38, 17, 38, 1, 1, 83, 30, 77, 7, 20, 44, 73, 13, 39, 20, 89, 5, 52, 25, 12, 90, 56, 86, 1, 72, 49, 67, 22, 85, 85, 31], [1, 27, 2, 93, 1, 42, 8, 35, 35, 7, 23, 23, 46, 19, 79, 72, 97, 99, 13, 50, 31, 71, 84, 38, 57, 8, 14, 94, 51, 9, 13, 76, 66, 38, 21, 29, 84, 50, 64, 9, 15, 53, 97, 53, 71, 3, 87], [22, 39, 77, 9, 34, 12, 34, 45, 97, 50, 99, 28, 39, 3, 47, 12, 43, 77, 67, 18, 90, 10, 4, 12, 53, 51, 16, 17, 95, 26, 2, 29, 94, 47, 11, 34, 71, 29, 97, 49, 91, 16, 81, 75, 14, 13, 35], [90, 52, 25, 59, 76, 68, 42, 48, 91, 45, 72, 72, 29, 3, 21, 31, 13, 95, 81, 48, 96, 24, 2, 3, 26, 2, 33, 34, 90, 98, 38, 78, 95, 20, 10, 84, 33, 45, 60, 66, 61, 51, 12, 80, 9, 11, 21], [76, 68, 26, 63, 19, 17, 44, 61, 1, 72, 58, 94, 41, 24, 43, 81, 94, 9, 66, 90, 32, 91, 41, 11, 65, 18, 8, 27, 82, 9, 2, 81, 75, 46, 70, 5, 12, 44, 42, 99, 88, 30, 52, 81, 47, 36, 70], [32, 98, 44, 16, 71, 96, 17, 32, 14, 26, 73, 13, 89, 12, 45, 16, 94, 52, 21, 24, 43, 5, 33, 31, 9, 35, 8, 75, 17, 80, 20, 91, 78, 22, 54, 71, 75, 81, 77, 81, 75, 68, 80, 31, 85, 97, 13], [29, 79, 10, 33, 15, 77, 35, 54, 21, 30, 46, 42, 71, 49, 24, 80, 69, 6, 2, 3, 53, 10, 24, 33, 84, 22, 61, 96, 94, 67, 4, 51, 4, 39, 31, 57, 73, 30, 93, 89, 39, 99, 25, 58, 36, 11, 90], [46, 89, 21, 2, 74, 39, 99, 33, 31, 4, 67, 69, 81, 13, 65, 45, 39, 87, 89, 53, 31, 13, 1, 98, 29, 61, 95, 72, 2, 12, 56, 97, 94, 41, 27, 89, 38, 97, 52, 80, 32, 88, 2, 66, 20, 57, 62], [91, 86, 48, 83, 7, 67, 50, 34, 87, 69, 67, 88, 91, 34, 43, 21, 12, 32, 47, 86, 98, 87, 55, 65, 68, 17, 26, 95, 33, 64, 92, 10, 46, 73, 90, 51, 34, 14, 41, 90, 95, 38, 48, 43, 28, 41, 56], [81, 76, 91, 65, 60, 97, 13, 69, 52, 43, 92, 88, 84, 40, 42, 37, 84, 23, 67, 69, 79, 69, 98, 58, 46, 87, 47, 17, 9, 68, 94, 78, 30, 95, 61, 65, 58, 27, 66, 45, 40, 61, 41, 74, 88, 84, 42], [62, 80, 38, 60, 49, 18, 99, 94, 5, 11, 4, 61, 75, 12, 49, 28, 90, 34, 56, 65, 6, 33, 47, 24, 34, 72, 16, 80, 16, 98, 84, 14, 59, 62, 90, 66, 19, 61, 66, 26, 89, 49, 19, 49, 81, 30, 76], [57, 85, 36, 40, 28, 97, 46, 73, 82, 88, 32, 87, 58, 76, 98, 26, 70, 69, 87, 50, 79, 32, 58, 64, 77, 28, 97, 72, 80, 39, 96, 80, 45, 13, 20, 58, 19, 75, 91, 80, 9, 77, 19, 94, 55, 39, 17], [62, 94, 93, 60, 42, 2, 50, 67, 20, 1, 5, 97, 39, 87, 18, 68, 97, 90, 22, 30, 90, 1, 70, 81, 95, 51, 68, 74, 61, 48, 53, 34, 86, 86, 7, 39, 37, 63, 55, 15, 83, 74, 62, 68, 50, 41, 61], [25, 28, 82, 35, 83, 53, 84, 39, 97, 59, 65, 1, 45, 19, 48, 49, 73, 14, 67, 30, 65, 69, 87, 6, 84, 46, 42, 72, 61, 31, 79, 26, 58, 33, 52, 32, 54, 1, 5, 22, 95, 5, 8, 70, 63, 10, 62], [40, 47, 80, 56, 28, 56, 1, 52, 82, 62, 42, 47, 37, 11, 67, 29, 4, 95, 11, 30, 79, 79, 58, 32, 29, 43, 92, 85, 39, 11, 96, 27, 24, 37, 65, 32, 53, 1, 56, 34, 82, 29, 6, 57, 95, 14, 75], [69, 62, 86, 51, 13, 76, 4, 38, 4, 30, 54, 65, 61, 49, 31, 42, 50, 23, 78, 99, 81, 60, 32, 56, 56, 87, 34, 41, 39, 86, 42, 66, 20, 14, 38, 37, 37, 12, 92, 56, 8, 93, 21, 39, 48, 18, 63]]]; int [] param1 = [2, 3, 1, 2, 4, 10, 7, 35, 29, 41]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE_1,"static int f_filled ( int arr [ ] , int N , int k ) { int maxSum = 0 ; Arrays . sort ( arr ) ; for ( int i = N - 1 ; i > 0 ; -- i ) { if ( arr [ i ] - arr [ i - 1 ] < k ) { maxSum += arr [ i ] ; maxSum += arr [ i - 1 ] ; -- i ; } } return maxSum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1578, -338, 25, 0, 596, 24, 1866, 406, 20, 1153]; int [] [] param0 = [[2, 10, 11, 11, 12, 14, 15, 17, 27, 27, 28, 36, 36, 44, 47, 47, 54, 55, 62, 64, 68, 69, 70, 70, 75, 76, 78, 85, 85, 91, 95, 97], [-98, -92, -86, -84, -72, -70, -70, -66, -62, -50, -44, -40, -36, -34, -30, -14, -12, -8, -4, -2, 2, 2, 10, 10, 30, 30, 36, 40, 58, 78, 78, 82, 88, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 77, 78], [-88, -88, -88, -82, -58, -54, -48, -46, -46, -44, -20, -2, 10, 28, 28, 28, 42, 42, 44, 50, 50, 54, 56, 58, 62, 68, 70, 72, 74, 76, 78, 88, 90, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 7, 10, 11, 15, 17, 20, 20, 29, 29, 32, 37, 38, 39, 40, 41, 45, 51, 60, 64, 64, 68, 68, 70, 71, 71, 71, 75, 76, 82, 84, 87, 88, 88, 95, 98], [-98, -88, -74, -66, -60, -52, -46, -40, -36, -34, -32, -28, -28, -24, -22, -20, -16, -14, -4, -4, 4, 12, 18, 28, 32, 44, 52, 56, 60, 60, 64, 70, 74, 76, 76, 86, 94, 94, 94, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 2, 9, 9, 13, 14, 14, 15, 20, 22, 25, 25, 36, 39, 46, 47, 61, 63, 66, 73, 79, 91, 94, 95, 95, 99]]; int [] param1 = [32, 34, 48, 3, 34, 43, 36, 40, 45, 27]; int [] param2 = [18, 25, 26, 1, 24, 40, 21, 23, 41, 23]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DICE_THROW_PROBLEM,"static long f_filled ( int m , int n , int x ) { long [ ] [ ] table = new long [ n + 1 ] [ x + 1 ] ; for ( int j = 1 ; j <= m && j <= x ; j ++ ) table [ 1 ] [ j ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= x ; j ++ ) { for ( int k = 1 ; k < j && k <= m ; k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ] ; } } return table [ n ] [ x ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [50116, 77635844, 0, 0, 0, 0, 0, 1131, 0, 0]; int [] param0 = [94, 7, 20, 90, 50, 32, 46, 43, 43, 6]; int [] param1 = [4, 12, 44, 94, 58, 90, 25, 3, 82, 83]; int [] param2 = [69, 33, 24, 88, 27, 29, 6, 50, 70, 19]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THE_FIRST_MISSING_NUMBER,"static int f_filled ( int array [ ] , int start , int end ) { if ( start > end ) return end + 1 ; if ( start != array [ start ] ) return start ; int mid = ( start + end ) / 2 ; if ( array [ mid ] == mid ) return f_filled ( array , mid + 1 , end ) ; return f_filled ( array , start , mid ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [19, 19, 26, 20, 8, 24, 0, 32, 28, 0]; int [] [] param0 = [[3, 6, 7, 9, 11, 14, 18, 30, 30, 32, 32, 34, 37, 44, 45, 45, 48, 48, 48, 52, 58, 60, 63, 67, 69, 69, 81, 83, 87, 89, 97, 99], [88, -62, 16, 80, 66, 78, 88, 38, 52, -96, 48, 98, 96, -62, 18, 34, -58, 30, -10, 26, -98, 48, -96, 4, 92, 36, 36, -36, -32, -70, 62, -58, -58, -84, 86, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [79, 99, 79, 85, 61, 58, 62, 61, 39, 87, 39, 74, 36, 70, 30, 43, 20, 52, 54, 50, 81, 98, 42], [-98, -72, -46, -44, -42, -40, -16, -4, 62, 70, 74], [1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0], [58], [4, -84, -42, 12, -50, 42, -36, -38, -36, 98, -2, 20, 6, -96, -78, 24, 34, 88, 0, 74, 0, -8, -86, -68, -42, 98, -26, 86, -70, -32, -82, 78, 46, 58, 84, 4, -60, -90, -52, -78], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8]]; int [] param1 = [24, 19, 26, 20, 8, 26, 0, 37, 28, 0]; int [] param2 = [18, 26, 28, 20, 10, 23, 0, 31, 28, 0]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DICE_THROW_PROBLEM_1,"static long f_filled ( int f , int d , int s ) { long mem [ ] [ ] = new long [ d + 1 ] [ s + 1 ] ; mem [ 0 ] [ 0 ] = 1 ; for ( int i = 1 ; i <= d ; i ++ ) { for ( int j = i ; j <= s ; j ++ ) { mem [ i ] [ j ] = mem [ i ] [ j - 1 ] + mem [ i - 1 ] [ j - 1 ] ; if ( j - f - 1 >= 0 ) mem [ i ] [ j ] -= mem [ i - 1 ] [ j - f - 1 ] ; } } return mem [ d ] [ s ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [35960, 0, 0, 0, 0, 0, 77384340, 141120525, 1, 25]; int [] param0 = [57, 58, 38, 5, 91, 76, 10, 28, 97, 99]; int [] param1 = [5, 45, 89, 39, 90, 56, 15, 20, 90, 2]; int [] param2 = [33, 4, 9, 30, 47, 46, 30, 32, 90, 26]; 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); } " DIFFERENCE_BETWEEN_HIGHEST_AND_LEAST_FREQUENCIES_IN_AN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int count = 0 , max_count = 0 , min_count = n ; for ( int i = 0 ; i < ( n - 1 ) ; i ++ ) { if ( arr [ i ] == arr [ i + 1 ] ) { count += 1 ; continue ; } else { max_count = Math . max ( max_count , count ) ; min_count = Math . min ( min_count , count ) ; count = 0 ; } } return ( max_count - min_count ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 1, 0, 1, 0, 0, -1, 0, 0, 1]; int [] [] param0 = [[5, 15, 19, 22, 28, 29, 39, 46, 46, 49, 51, 55, 62, 69, 72, 72, 72, 74, 79, 92, 92, 93, 95, 96], [-92, -92, -78, -74, -70, -66, -60, -54, -50, -48, -34, -32, -26, -24, -22, -14, -10, -10, -6, 2, 4, 6, 12, 18, 34, 42, 52, 56, 76, 92, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 5, 13, 17, 21, 22, 25, 26, 29, 29, 31, 32, 35, 38, 40, 46, 48, 48, 49, 53, 54, 59, 61, 65, 65, 66, 73, 79, 81, 83, 92, 92, 93, 96, 97, 98], [-70, -34, -32, -30, -14, 80, 86, 90], [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], [9], [10, 42, 70, 94], [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], [3, 4, 7, 8, 10, 15, 15, 17, 22, 26, 49, 55, 60, 64, 76, 79, 80, 84, 90, 92, 95, 96]]; int [] param1 = [24, 31, 49, 36, 8, 36, 1, 4, 32, 22]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DISTRIBUTING_ITEMS_PERSON_CANNOT_TAKE_TWO_ITEMS_TYPE,"static boolean f_filled ( int [ ] arr , int n , int k ) { int count ; for ( int i = 0 ; i < n ; i ++ ) { count = 0 ; for ( int j = 0 ; j < n ; j ++ ) { if ( arr [ j ] == arr [ i ] ) count ++ ; if ( count > 2 * k ) return false ; } } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, false, true, true, false, true]; int [] [] param0 = [[1, 1, 2, 3, 1], [2, 3, 3, 5, 3, 3], [0, 0, 1, 1, 1], [7, 60, 78, 91, 80, 75, 85, 21, 41, 63, 1, 84, 69, 13, 94, 25, 54, 54, 52, 68, 53, 35, 17, 37, 98, 27, 2, 31], [-96, -94, -82, -80, -78, -66, -36, -24, -18, -12, -2, -2, 6, 8, 10, 12, 36, 38, 42, 58, 64, 68, 82, 84, 86, 88, 94], [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0], [16, 19, 25, 25, 32, 37, 48, 59, 60, 60, 71, 74, 77, 81, 91, 94], [-62, -94, 72, -22, 86, -80, 64, 98, -82, -50, 12, -4, 56, 46, -80, 2, -86, -44, -26, 68, -94, -82, 74, 26, 94, 40, 50, -40, -42, -10], [0, 0, 0, 0, 0, 1, 1, 1], [83, 57, 2, 47, 70, 22, 49, 51, 25, 57, 32, 7, 8, 99, 6, 86, 24, 79, 42, 43, 1, 24, 68, 11, 24, 12, 43, 40, 14, 45, 11, 46, 12, 80, 66]]; int [] param1 = [5, 6, 2, 24, 24, 34, 10, 20, 5, 21]; int [] param2 = [2, 2, 1, 2, 3, 2, 8, 4, 2, 33]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " K_TH_ELEMENT_TWO_SORTED_ARRAYS,"static int f_filled ( int arr1 [ ] , int arr2 [ ] , int m , int n , int k ) { int [ ] sorted1 = new int [ m + n ] ; int i = 0 , j = 0 , d = 0 ; while ( i < m && j < n ) { if ( arr1 [ i ] < arr2 [ j ] ) sorted1 [ d ++ ] = arr1 [ i ++ ] ; else sorted1 [ d ++ ] = arr2 [ j ++ ] ; } while ( i < m ) sorted1 [ d ++ ] = arr1 [ i ++ ] ; while ( j < n ) sorted1 [ d ++ ] = arr2 [ j ++ ] ; return sorted1 [ k - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [31, 20, 0, 71, -22, 0, 30, 86, 1, 70]; int [] [] param0 = [[2, 2, 4, 4, 9, 10, 14, 16, 16, 19, 20, 21, 25, 26, 29, 36, 36, 37, 38, 44, 44, 49, 53, 54, 56, 61, 62, 64, 72, 72, 73, 77, 80, 84, 84, 87, 93, 94], [2, 4, -90, 62, 22, -94, -74, -22, 44, -94, 20, -40, 20, 0, 32, 24, 78, 8, 4, 98, -74, -60], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [85, 44, 62, 2, 71, 88, 60, 78, 32, 46, 17, 47, 65, 78, 65, 94], [-94, -84, -82, -70, -70, -60, -54, -54, -52, -52, -46, -40, -40, -36, -34, -32, -30, -22, -18, -16, -10, -4, 8, 12, 18, 22, 32, 38, 38, 44, 50, 56, 64, 82, 84, 86, 88], [0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [53, 96, 99], [98, 86, 36, -68, 86, 22, 52, -20, -2, 74, -72, 86, 80, -78, 14, 62, 10, 94, -66, 78, 28, 92, -8, 46, -24, 66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [6, 21, 86, 58, 48, 27, 18, 73, 16, 79, 51, 33, 63, 26, 37, 88, 48, 58, 44, 32, 58, 23, 31]]; int [] [] param1 = [[6, 8, 10, 10, 12, 14, 24, 31, 33, 33, 35, 35, 35, 41, 46, 47, 49, 51, 52, 56, 57, 59, 62, 65, 72, 72, 73, 73, 79, 80, 82, 83, 83, 84, 87, 87, 93, 99], [58, 74, -46, 38, -58, -78, -32, -84, 84, -54, 84, -34, -26, 88, 74, 48, 26, -92, 68, -86, 74, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [18, 3, 15, 9, 61, 73, 3, 62, 87, 1, 54, 97, 61, 37, 23, 65], [-92, -68, -64, -62, -54, -52, -52, -34, -24, -22, -20, -12, -12, -10, 6, 10, 14, 22, 22, 24, 24, 30, 30, 36, 36, 48, 50, 56, 58, 64, 68, 80, 84, 88, 88, 92, 94], [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0], [30, 55, 56], [72, -72, -90, 24, -22, 60, 78, -68, 98, 26, -30, -20, 44, -96, 8, 90, 0, 98, -24, -68, -32, -62, 0, -60, 26, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [87, 77, 44, 15, 70, 89, 36, 79, 82, 3, 18, 76, 37, 79, 85, 97, 19, 53, 17, 74, 87, 58, 49]]; int [] param2 = [27, 18, 30, 11, 19, 24, 1, 22, 42, 14]; int [] param3 = [21, 11, 31, 11, 26, 17, 1, 19, 40, 22]; int [] param4 = [23, 12, 42, 13, 28, 23, 1, 24, 42, 19]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DIVISIBILITY_BY_7,"static boolean f_filled ( int num ) { if ( num < 0 ) return f_filled ( - num ) ; if ( num == 0 || num == 7 ) return true ; if ( num < 10 ) return false ; return f_filled ( num / 10 - 2 * ( num - num / 10 * 10 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, false, false, false, false, false]; int [] param0 = [0, -21, 7, 63, 84, 73, 81, -10, 47, 23]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUM_2_X_N_GRID_NO_TWO_ELEMENTS_ADJACENT,"static int f_filled ( int grid [ ] [ ] , int n ) { int incl = Math . max ( grid [ 0 ] [ 0 ] , grid [ 1 ] [ 0 ] ) ; int excl = 0 , excl_new ; for ( int i = 1 ; i < n ; i ++ ) { excl_new = Math . max ( excl , incl ) ; incl = excl + Math . max ( grid [ 0 ] [ i ] , grid [ 1 ] [ i ] ) ; excl = excl_new ; } return Math . max ( excl , incl ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 832, 0, 212, 58, 13, 47, 372, 3, 1000]; int [] [] [] param0 = [[[6, 10, 23, 28, 35, 55, 91], [11, 14, 15, 54, 55, 62, 81], [18, 26, 40, 43, 47, 89, 93], [3, 11, 19, 53, 65, 82, 92], [14, 32, 43, 44, 51, 77, 83], [6, 6, 30, 30, 33, 73, 74], [2, 2, 10, 61, 70, 81, 84]], [[-28, -20, -60, 92, 12, -66, 20, -22, 72, -90, 30, 90, -64, 38, 24, 78, 42, -72, -86, 88, -66, -74, -52, 26, -76, -64, -54, -56, -50, -12, -50, -58, -42, 20], [-84, -90, 32, 4, -54, -96, 72, 70, -2, 62, -20, 22, -38, 78, -86, -50, 64, 92, 16, 22, 44, -72, -88, -54, 58, 72, -28, 34, -10, -12, -82, 38, -76, 86], [30, 94, 12, -58, 24, -58, 82, -96, -84, -76, -56, -2, -82, -12, -24, 86, -94, 72, 36, 86, 54, 76, -96, -94, -70, 76, 0, -48, -84, 6, -90, 44, -8, -22], [-36, 90, 20, 44, -66, -54, 54, 14, -12, 58, -10, 84, -4, 88, -70, -24, -84, -8, 58, -22, 2, -32, -28, -60, -74, -12, -10, -6, -58, -54, -8, -94, 72, 86], [-20, 88, 28, 76, 78, 52, 0, -60, 94, -22, -56, -8, 66, -36, -48, -12, 42, -84, 22, -78, 18, -68, 46, 36, 50, -80, 18, 6, 86, -18, -90, -94, 54, 60], [44, -44, -52, -24, 32, 24, -88, -62, -64, 24, -24, 76, -22, -60, 76, 12, 10, -96, -68, 98, -86, 20, -40, -30, -22, -14, -68, -68, -52, -72, -68, -36, 4, 42], [78, 74, -96, 46, -36, -14, 72, -64, -16, 26, 74, -82, 82, 96, -82, 70, -66, -90, -72, 64, -52, 46, -38, 70, 98, 26, -48, -66, -92, -86, -94, -18, 90, -58], [20, 56, -12, 82, -24, -54, 48, 22, -58, -94, -4, -78, -74, -82, 58, 2, 32, 76, 54, 76, -54, -32, 34, 56, -48, 22, 30, 86, -76, -90, 20, 2, 4, 10], [42, 98, 42, -6, 78, 92, -44, -14, 80, 14, 48, 94, 46, -30, 40, -64, 36, 66, 40, 94, 36, 94, -2, -92, 70, -44, 28, -86, 44, 98, -76, 66, -16, -24], [-64, -44, 28, -24, 92, 18, 88, -36, 72, 0, 38, 42, 46, -94, 10, -62, -64, -40, 4, 44, -42, -66, -62, 12, -72, -68, 26, 58, -64, 90, -20, -74, 46, 28], [-2, 42, 94, -52, -46, -14, -80, -74, 22, -56, 8, -88, 0, -58, 82, -12, 96, 40, -86, -30, 88, 50, 28, -40, 16, 16, -58, -18, -78, 40, 66, -6, -50, -36], [-46, -8, -76, -74, 38, -76, -2, 80, -30, -64, 64, 34, 80, -14, -4, 58, -48, 30, 56, 2, 98, -82, 82, -36, 38, 14, 24, 92, -38, 40, 6, 12, 90, 90], [-12, 24, 20, -22, -86, 4, 48, 90, -10, -90, -36, 56, -18, -72, -84, 68, -18, 48, -80, -84, 62, 4, 4, 54, -26, -28, -58, -12, -6, 32, 88, -62, 58, -52], [54, 76, 2, -98, -64, 64, 2, -22, 18, -78, -44, -78, 6, 92, -32, 14, -98, -70, -52, -20, 14, 32, 40, 32, 62, 42, 34, -52, 2, 52, 64, 12, 44, -12], [22, -48, 30, -98, -94, 36, 76, 52, 56, 76, -40, -34, -58, -70, 26, 20, -6, 92, 90, 30, 2, -34, 96, 50, 96, -82, -38, -42, 54, -80, -82, -10, -94, 64], [-46, -36, -84, 54, -64, -48, 60, 70, 78, 20, -92, -34, 88, -38, -34, 40, -70, 58, -22, -38, 46, -36, 28, -24, -16, 70, 6, -76, -30, 58, 4, 84, 92, 80], [24, 48, -54, -98, 60, 18, 70, -6, 62, -60, 80, -66, 78, -50, 36, 84, 30, 56, -56, 56, -70, 38, -70, 26, -6, -32, 86, 72, -68, 42, 30, 2, -86, 72], [-84, -98, 74, -36, 78, -10, -84, 26, 76, 38, -6, -26, 76, 26, 18, 44, -96, 92, 74, -36, 34, 64, 98, 84, 68, -56, -98, -16, 44, -84, 68, -66, 58, -4], [72, -68, 94, 76, -60, -40, -34, 78, -8, -28, 44, 88, 60, -20, 58, -46, -10, 48, -52, -38, -62, 12, 30, -96, -22, -76, -40, -20, -74, 78, 94, 78, -64, 44], [92, -76, 8, 8, 66, 70, -12, 32, 6, 28, 20, 50, 2, 78, -98, 98, 94, 82, -58, 56, 10, -94, 26, 26, -42, -66, 16, -92, 24, 72, 56, 56, 14, 46], [32, -90, -64, -14, 92, -18, -82, 36, 34, -58, -22, -8, 88, 76, 30, -68, -44, 88, 66, 74, -32, -54, -68, -18, 92, 60, -30, 82, 34, 26, -60, 82, 32, 54], [-88, 56, 76, 82, -82, 0, 74, 98, 28, 2, -26, 56, 80, 44, -10, -38, 44, -28, 88, 18, -68, 6, 90, -38, -30, -26, 56, 24, -22, 12, 78, 30, 26, -42], [84, 86, 48, -84, 88, -40, -18, 40, -70, 10, 76, 54, -82, -60, -28, -2, -74, 82, -64, 14, -84, -16, -84, 20, 16, -52, -12, 26, 82, 2, 68, 98, -84, 76], [-20, 52, -34, 56, -58, -34, 10, 30, 14, 40, -72, 84, -50, -22, -54, -14, 12, -66, -38, 4, -44, -86, -64, 60, -88, 32, -60, 74, -96, -50, -88, -14, -42, -82], [46, -72, -10, -70, -8, 60, -10, 28, -12, -82, 84, 36, -76, 72, -98, -12, -20, -92, -16, -34, 68, 98, -96, -80, 44, -72, 22, -46, 54, 54, 8, -42, -84, 76], [38, 84, 32, 70, 82, 44, 52, 48, 0, 42, -18, -80, 86, -50, -48, -48, 40, 72, -76, 16, 42, -48, -74, 64, 38, -38, -66, -70, 96, -56, 38, -68, -34, -18], [-92, 94, 84, 50, 26, 38, -16, -18, -86, -52, -12, 36, -76, 10, -92, 78, -94, 62, -48, 18, -82, -8, -74, -90, 6, 22, -90, 52, 84, 48, -98, -30, -44, 2], [32, -54, 38, -34, 90, 58, 30, 86, -52, -82, 26, -30, 22, -68, 44, 44, -54, 24, -12, 18, 62, 82, 86, 26, -78, 74, 36, 62, 50, -84, 80, -2, 44, -84], [42, -32, -36, 54, 64, 54, 88, 30, 26, 6, 98, 34, -40, 18, -50, -34, -68, -2, -94, -42, -72, 38, 22, 62, -42, -58, -88, -52, -44, 14, 14, 62, -56, -52], [-64, -44, 14, 48, -98, -48, 80, -34, 10, 46, -64, 38, 72, -80, -72, 52, 92, -22, -28, 2, 0, -70, 18, -34, 60, 36, 8, 2, -94, 80, -32, -16, -82, -72], [94, -90, 84, -34, 62, 70, -86, -20, -30, 42, -84, 20, -16, 90, -90, 20, -90, 76, 72, -12, 54, 72, 80, 30, 62, 66, -96, 14, 0, 4, -78, -40, -8, 74], [-70, 20, 74, -76, 82, -88, 88, -90, -8, -24, -30, 10, 28, -88, -72, 4, 0, -66, -82, -20, 90, -28, 48, 82, -2, 4, 38, 62, -38, 14, 56, 74, 86, 58], [-6, 52, 94, 20, 88, -56, -40, -36, 68, -24, 68, -96, 90, 28, 0, 10, -44, -94, 18, -60, 98, 24, 26, -62, -88, 50, -10, 40, 64, 24, 56, -72, 30, 8], [62, 20, 56, -38, -10, 48, 94, 38, 60, -60, -4, -56, -20, 62, 0, 0, -82, 46, 58, 4, -8, 56, 46, -82, -34, 14, -38, 48, 48, -22, 38, 64, 6, 94]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[45, 7, 63, 28, 82, 79, 40, 94, 89, 61], [50, 94, 80, 10, 25, 12, 1, 73, 84, 38], [82, 93, 37, 59, 12, 37, 96, 12, 56, 39], [76, 56, 97, 56, 32, 33, 24, 31, 62, 94], [90, 2, 52, 81, 1, 52, 95, 93, 75, 4], [8, 47, 21, 75, 12, 90, 91, 34, 74, 73], [77, 76, 81, 68, 64, 28, 41, 84, 71, 72], [99, 93, 47, 15, 95, 76, 21, 48, 80, 39], [32, 6, 88, 96, 18, 56, 74, 93, 9, 13], [27, 8, 53, 66, 4, 74, 14, 25, 41, 78]], [[-90, -88, -58, -54, -26, -2, 6, 66], [-80, -78, -60, -4, -2, 58, 64, 68], [-98, -78, -22, -6, 28, 82, 86, 92], [-84, -4, 52, 64, 66, 84, 86, 98], [-62, 28, 32, 76, 92, 92, 96, 96], [-90, -54, -42, 6, 24, 42, 44, 46], [-94, -80, -36, -20, -20, -10, 24, 86], [-78, -8, 2, 48, 56, 66, 68, 78]], [[0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0], [1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0], [1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1], [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0], [1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0], [0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1], [1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0], [0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0], [1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1], [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0], [1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0], [1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0], [0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1], [0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0], [1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1], [1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1], [0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1], [1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0], [1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0], [1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1], [1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1], [0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0], [0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1]], [[13, 31, 35, 45, 73], [16, 47, 54, 84, 87], [8, 48, 50, 64, 81], [19, 43, 79, 88, 91], [38, 47, 53, 57, 69]], [[-70, -46, 18, -10, -88, -22, -68, 2, -42, 94, 64, -98, -74, -88, -60, 96, 64, 42, -26, 60, 56, 56, -92, -72, 30], [12, -34, 44, 82, 94, 88, -60, -88, -98, -82, 10, -36, 94, -64, -26, 26, -62, 94, -90, 12, -76, 30, 40, 62, -84], [-90, 98, -44, 58, 20, 84, 76, 80, 44, 98, 60, 42, -66, 2, 10, 98, 28, -38, 18, 42, 2, 34, -64, -46, 62], [-36, 50, 52, -8, -28, 52, -76, 18, 68, -16, 34, -38, -90, 68, -6, -16, -98, 12, -78, -18, -28, -38, 26, 76, 26], [-70, 14, -96, -42, 18, -18, 72, -18, -78, 90, 68, -22, 58, 98, 62, -92, -38, 86, -40, 22, 38, 86, -60, 46, -72], [-12, -64, -2, 62, 62, 16, 40, -58, 8, -16, -80, 84, -10, 10, -58, 30, -18, 36, 4, -88, -50, 30, -30, -94, -20], [28, 76, 74, 80, 38, -32, 4, 56, -52, -24, 94, 6, 12, -66, 94, -70, 98, -72, 22, 30, -8, -72, -26, 52, 98], [-36, -96, 94, -64, -68, 78, 80, -90, -68, 60, -78, -84, 34, 6, 20, 60, -86, 84, -96, 98, -38, -78, 50, 30, 22], [14, 88, 88, -34, -76, 48, 10, -14, 36, 94, 90, 90, -90, 26, 70, -64, 64, -92, 0, -60, 6, -60, 8, -44, 54], [-30, -64, -34, -26, -82, -48, -98, -50, 76, -40, -16, 52, -70, 68, 82, 86, 32, -70, 98, -80, 14, -48, -32, -84, 16], [30, -70, 36, 34, -16, -96, -62, -62, -8, 66, 68, -2, 16, -26, 32, -50, 72, -32, 72, 52, -22, -76, -4, 90, 20], [92, -72, -48, 84, -98, -80, 74, -30, 58, 6, -10, -84, -96, -60, -18, -42, 26, -96, -20, -18, -12, 2, 58, 6, 36], [-74, -44, -20, -58, 58, 24, -34, 6, 52, -40, 36, -22, -78, 82, 64, 56, -70, -2, -32, 74, 98, 38, 30, 80, -80], [58, 92, -16, 76, -28, -10, 60, -80, 96, -72, 38, -64, 8, -84, 90, 20, 64, -74, -78, -94, -68, 44, 62, 14, -74], [-2, -30, -10, -84, 66, -16, 58, 26, 42, -98, 18, 54, 22, -2, -62, 10, 14, 26, 32, -56, -84, -14, -50, -48, 52], [-94, -58, 38, -76, -46, -98, -14, 34, 8, 8, 4, 26, 48, -74, -62, 90, 54, 88, 56, 16, -36, -2, -72, -8, 84], [22, -60, -50, 50, 22, -46, -42, 38, 74, -2, -66, -94, 38, 12, 8, -84, 10, 94, 56, -16, -38, -84, 30, -90, -90], [-32, -98, 24, -80, -24, 56, -84, -50, 86, 0, 22, -26, 70, -38, -16, -52, 70, 34, 92, 24, -88, 42, 2, -70, -32], [28, -8, 52, 64, -50, -24, 24, 32, 70, -54, -34, 24, -46, 22, -42, -6, -24, 62, 44, 22, -58, -54, 16, 4, -64], [-12, 44, 4, 24, 76, -82, 86, 50, -10, -28, 44, 36, -8, 76, -2, -96, 52, 52, -48, 66, 80, 76, 26, -16, 20], [18, -50, -68, 30, -36, -4, 14, -52, -32, 0, 68, 74, 84, 4, 64, 92, 24, 12, -8, -22, -22, 14, -44, -26, 80], [82, 26, -46, -10, 62, -70, -74, 72, -14, 98, 8, -54, 30, 26, 44, 38, -22, 24, 98, 8, 56, -96, -94, -62, 48], [32, -10, -72, 66, -86, -94, -98, 4, 22, -54, -74, 22, -24, -12, -80, 98, -38, -34, -52, -74, 96, -62, 68, 24, 34], [66, -6, -38, -62, -16, 82, -78, -20, 50, 62, 96, 46, -22, 74, -84, 54, -32, -16, 62, -4, -70, -38, -6, -4, -94], [-10, 0, -30, -28, 38, -48, 80, 4, -52, -88, 42, 4, -44, -10, 56, -22, 70, -78, 52, 0, -32, -30, 42, -54, -98]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[65, 68, 77, 53, 21, 82, 84, 4, 96, 27, 89, 71, 45, 94, 87, 29, 57, 21, 97, 82, 27, 78, 40, 31, 8, 67, 35, 75, 98, 87, 69, 30, 37, 16, 14], [71, 97, 2, 46, 5, 45, 45, 60, 15, 42, 2, 88, 29, 93, 85, 25, 22, 83, 62, 13, 62, 38, 57, 33, 33, 56, 12, 87, 93, 29, 43, 60, 65, 24, 69], [57, 35, 45, 69, 13, 32, 55, 27, 88, 3, 1, 63, 93, 45, 86, 69, 43, 85, 12, 92, 75, 15, 38, 62, 35, 16, 64, 15, 96, 64, 58, 80, 97, 40, 57], [20, 37, 32, 74, 16, 5, 20, 56, 91, 43, 60, 50, 59, 84, 13, 19, 79, 38, 27, 81, 74, 36, 5, 51, 48, 27, 59, 54, 28, 68, 71, 8, 15, 29, 73], [20, 65, 7, 34, 10, 48, 70, 25, 76, 41, 78, 11, 12, 83, 42, 92, 53, 83, 29, 45, 99, 23, 60, 80, 60, 21, 59, 40, 1, 25, 16, 33, 89, 22, 67], [67, 75, 43, 52, 63, 5, 25, 38, 53, 16, 96, 93, 70, 86, 73, 10, 55, 14, 84, 69, 71, 54, 56, 78, 57, 15, 81, 84, 16, 21, 75, 68, 25, 66, 66], [91, 95, 47, 72, 72, 5, 22, 69, 40, 48, 70, 38, 71, 18, 25, 67, 89, 21, 95, 49, 42, 80, 52, 64, 86, 93, 76, 46, 43, 63, 1, 26, 74, 25, 89], [4, 82, 60, 43, 72, 7, 17, 6, 42, 44, 21, 2, 13, 32, 77, 29, 5, 90, 96, 82, 17, 84, 15, 60, 79, 68, 73, 44, 33, 10, 47, 1, 40, 73, 22], [26, 35, 33, 10, 61, 38, 19, 68, 83, 7, 12, 91, 32, 27, 57, 85, 54, 69, 83, 7, 78, 73, 37, 50, 9, 5, 54, 48, 9, 52, 30, 78, 60, 3, 52], [24, 28, 39, 55, 75, 81, 82, 81, 25, 14, 85, 11, 47, 27, 4, 51, 34, 40, 71, 18, 19, 82, 15, 75, 12, 35, 36, 12, 16, 92, 44, 44, 36, 59, 30], [16, 80, 84, 9, 46, 5, 95, 18, 44, 86, 39, 66, 58, 67, 47, 92, 75, 74, 84, 95, 53, 51, 45, 48, 22, 82, 12, 79, 55, 98, 45, 92, 63, 64, 44], [15, 99, 17, 75, 61, 26, 29, 89, 4, 27, 42, 86, 24, 19, 41, 91, 83, 13, 95, 66, 91, 64, 72, 12, 29, 29, 86, 30, 73, 69, 13, 2, 33, 4, 56], [74, 57, 97, 2, 63, 12, 16, 60, 99, 56, 73, 3, 92, 52, 16, 83, 75, 46, 31, 1, 55, 30, 85, 79, 16, 68, 88, 40, 87, 17, 99, 26, 35, 79, 15], [27, 72, 15, 72, 4, 65, 25, 99, 8, 49, 17, 28, 70, 6, 55, 1, 67, 52, 73, 79, 40, 84, 16, 74, 78, 16, 15, 41, 90, 10, 60, 12, 37, 14, 25], [94, 53, 30, 59, 63, 99, 79, 95, 18, 71, 67, 5, 89, 16, 79, 84, 41, 60, 86, 35, 27, 12, 33, 24, 26, 98, 13, 92, 20, 72, 50, 80, 34, 96, 30], [99, 16, 48, 9, 54, 31, 19, 34, 62, 80, 88, 16, 79, 31, 52, 56, 71, 44, 15, 66, 86, 24, 89, 61, 12, 14, 34, 20, 63, 78, 82, 35, 63, 81, 48], [45, 87, 86, 49, 31, 29, 25, 96, 95, 6, 37, 17, 31, 58, 21, 2, 7, 91, 22, 4, 91, 45, 96, 85, 99, 73, 92, 10, 87, 24, 57, 4, 81, 48, 88], [58, 1, 66, 40, 48, 53, 6, 14, 62, 36, 21, 25, 54, 72, 27, 78, 4, 8, 91, 83, 94, 92, 91, 61, 37, 44, 3, 49, 28, 83, 91, 87, 83, 57, 13], [94, 41, 72, 29, 43, 50, 50, 47, 70, 56, 17, 29, 56, 52, 48, 2, 33, 59, 39, 55, 35, 31, 76, 31, 26, 96, 49, 60, 50, 60, 3, 20, 56, 47, 2], [63, 77, 93, 63, 51, 70, 42, 8, 26, 54, 74, 38, 56, 65, 66, 43, 64, 35, 65, 68, 3, 88, 55, 81, 27, 25, 59, 84, 39, 54, 51, 30, 70, 71, 27], [5, 26, 36, 11, 56, 23, 3, 79, 58, 44, 89, 80, 96, 26, 69, 10, 75, 97, 92, 57, 80, 44, 2, 29, 2, 86, 75, 35, 96, 64, 5, 91, 51, 76, 8], [3, 96, 22, 63, 28, 90, 45, 21, 75, 27, 7, 73, 47, 48, 98, 43, 26, 70, 76, 37, 50, 44, 1, 35, 68, 40, 50, 72, 66, 12, 72, 41, 60, 31, 85], [95, 32, 20, 83, 47, 94, 73, 84, 18, 77, 60, 30, 29, 52, 51, 30, 69, 68, 50, 59, 31, 42, 33, 65, 19, 15, 66, 68, 3, 87, 60, 43, 53, 70, 94], [23, 49, 15, 47, 81, 9, 66, 50, 53, 93, 42, 46, 95, 96, 58, 1, 94, 92, 90, 82, 1, 41, 48, 83, 99, 33, 72, 91, 42, 8, 58, 96, 83, 30, 60], [10, 64, 36, 16, 3, 86, 86, 85, 94, 27, 66, 72, 43, 23, 39, 38, 36, 14, 95, 57, 47, 51, 19, 30, 16, 76, 64, 60, 88, 42, 38, 61, 96, 50, 19], [40, 47, 62, 69, 46, 63, 47, 2, 51, 96, 91, 2, 37, 37, 57, 22, 98, 64, 91, 81, 39, 87, 74, 22, 15, 61, 60, 50, 61, 62, 40, 36, 39, 16, 56], [28, 35, 32, 52, 47, 88, 63, 21, 83, 32, 34, 52, 82, 11, 75, 82, 1, 40, 1, 24, 41, 86, 71, 81, 49, 12, 65, 67, 94, 87, 59, 72, 17, 6, 60], [56, 12, 21, 75, 66, 20, 64, 20, 95, 36, 62, 24, 86, 9, 58, 49, 81, 98, 53, 11, 6, 59, 51, 49, 87, 47, 45, 49, 40, 90, 9, 8, 49, 52, 26], [12, 97, 64, 71, 80, 26, 89, 35, 93, 50, 92, 16, 83, 40, 6, 91, 67, 98, 17, 32, 24, 99, 35, 96, 53, 15, 37, 25, 85, 78, 23, 55, 7, 5, 78], [83, 71, 72, 68, 6, 10, 50, 14, 13, 71, 21, 97, 11, 6, 36, 75, 55, 34, 94, 73, 71, 46, 37, 60, 18, 49, 93, 85, 14, 16, 26, 95, 51, 75, 96], [90, 63, 33, 60, 37, 11, 20, 77, 34, 60, 97, 58, 43, 68, 54, 72, 60, 11, 66, 22, 4, 42, 89, 52, 44, 15, 76, 97, 32, 70, 1, 20, 69, 37, 51], [2, 78, 17, 50, 82, 17, 31, 56, 31, 36, 19, 61, 32, 81, 88, 4, 69, 47, 41, 1, 90, 42, 67, 23, 13, 86, 95, 61, 72, 30, 46, 76, 86, 43, 15], [30, 60, 24, 25, 53, 58, 2, 65, 84, 45, 44, 26, 8, 83, 31, 79, 52, 2, 66, 50, 93, 97, 10, 46, 58, 85, 85, 13, 51, 80, 83, 88, 58, 62, 23], [4, 31, 8, 25, 54, 87, 11, 92, 45, 87, 45, 60, 64, 43, 64, 47, 61, 98, 48, 75, 8, 34, 8, 52, 81, 86, 8, 62, 65, 14, 69, 91, 48, 87, 12], [64, 30, 8, 66, 69, 77, 81, 35, 79, 12, 99, 67, 10, 2, 15, 63, 7, 20, 60, 8, 90, 58, 8, 30, 84, 54, 54, 95, 29, 53, 94, 31, 4, 29, 44]]]; int [] param1 = [3, 33, 9, 6, 6, 27, 2, 15, 21, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DIVISIBILITY_9_USING_BITWISE_OPERATORS,"static boolean f_filled ( int n ) { if ( n == 0 || n == 9 ) return true ; if ( n < 9 ) return false ; return f_filled ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, false, false, false, false, true, false, false]; int [] param0 = [96, 85, 54, 14, 47, 11, 49, 99, 28, 82]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_TO_CHECK_IF_A_GIVEN_NUMBER_IS_LUCKY_ALL_DIGITS_ARE_DIFFERENT,"static boolean f_filled ( int n ) { boolean arr [ ] = new boolean [ 10 ] ; for ( int i = 0 ; i < 10 ; i ++ ) arr [ i ] = false ; while ( n > 0 ) { int digit = n % 10 ; if ( arr [ digit ] ) return false ; arr [ digit ] = true ; n = n / 10 ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, true, false, true, false, true, true, false]; int [] param0 = [474, 9445, 90, 30, 37453, 27, 2400, 98, 46, 722]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_POSSIBLE_DIFFERENCE_TWO_SUBSETS_ARRAY,"static int f_filled ( int [ ] arr , int n ) { int SubsetSum_1 = 0 , SubsetSum_2 = 0 ; for ( int i = 0 ; i <= n - 1 ; i ++ ) { boolean isSingleOccurance = true ; for ( int j = i + 1 ; j <= n - 1 ; j ++ ) { if ( arr [ i ] == arr [ j ] ) { isSingleOccurance = false ; arr [ i ] = arr [ j ] = 0 ; break ; } } if ( isSingleOccurance ) { if ( arr [ i ] > 0 ) SubsetSum_1 += arr [ i ] ; else SubsetSum_2 += arr [ i ] ; } } return Math . abs ( SubsetSum_1 - SubsetSum_2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [198, 1100, 0, 217, 468, 1, 671, 710, 0, 703]; int [] [] param0 = [[5, 14, 15, 21, 0, 0, 42, 0, 0, 0, 0, 48, 0, 0, 53, 60, 62, 69, 69, 79, 82, 86, 96], [-54, 0, -22, 94, 58, 0, -12, 84, 0, 0, -34, 16, -10, -32, 50, -78, 68, -52, -64, 66, 0, 0, -38, -18, -84, -66, -36, 64, -12, 44, 48, 8, 42], [0, 0, 0, 1], [63, 49, 18, 36, 21, 30, 45, 87], [-96, 0, 0, -72, -62, -56, -52, -44, 0, 0, -28, -22, -20, -12, 0, 0, -2, 2, 2, 4, 36, 44, 46, 50, 50, 54, 66, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0], [1, 2, 8, 12, 0, 0, 14, 17, 18, 27, 28, 31, 34, 37, 38, 42, 43, 45, 49, 52, 53, 0, 0, 58, 62, 66, 71, 74, 87, 93, 96, 99], [0, -28, -30, 86, 0, -80, 76, -2, 28, 0, 0, 84, 0, 0, -88, 0, 42, 16, 0, 0, 78, -8, -46, -6, 0, 0, 0, -12, -32, -72, 84, -82, 76, -84, 80, -50, 90, -50, -14, -82, 78, 48, -10, 86, 34, -20, -76, 58], [0, 1], [83, 86, 57, 18, 98, 52, 1, 37, 11, 49, 10, 67, 2, 60, 30, 42, 8, 97, 25, 55, 5, 75, 9, 67]]; int [] param1 = [15, 28, 2, 6, 18, 34, 25, 28, 1, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DOUBLE_FACTORIAL,"static long f_filled ( long n ) { if ( n == 0 || n == 1 ) return 1 ; return n * f_filled ( n - 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [1, 8, 105, 3840, 135135, 10321920, 654729075]; long [] 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); } " FIND_MAXIMUM_HEIGHT_PYRAMID_FROM_THE_GIVEN_ARRAY_OF_OBJECTS,"static int f_filled ( int [ ] boxes , int n ) { Arrays . sort ( boxes ) ; int ans = 1 ; int prev_width = boxes [ 0 ] ; int prev_count = 1 ; int curr_count = 0 ; int curr_width = 0 ; for ( int i = 1 ; i < n ; i ++ ) { curr_width += boxes [ i ] ; curr_count += 1 ; if ( curr_width > prev_width && curr_count > prev_count ) { prev_width = curr_width ; prev_count = curr_count ; curr_count = 0 ; curr_width = 0 ; ans ++ ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7, 2, 3, 8, 1, 3, 9, 1, 2, 7]; int [] [] param0 = [[7, 8, 11, 11, 14, 19, 25, 27, 41, 42, 46, 52, 53, 54, 55, 58, 59, 62, 63, 66, 67, 69, 74, 75, 77, 81, 83, 84, 88, 88, 93, 93, 94], [-96, -92, -78, -72, -60, -56, -28, -18, 12, 14, 16, 16, 20, 20, 30, 40, 72, 76, 76, 80, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 4, 6, 12, 13, 14, 15, 16, 19, 21, 22, 27, 33, 37, 37, 40, 43, 45, 48, 50, 59, 63, 64, 65, 66, 67, 67, 67, 73, 78, 80, 81, 84, 85, 85, 91, 95, 95, 97, 98], [-98, -92, -90, -88, -88, -74, -64, -64, -64, -62, -60, -52, -48, -46, -42, -42, -38, -34, -28, -26, -20, -20, -18, -4, 0, 2, 2, 6, 18, 18, 18, 20, 24, 24, 26, 32, 40, 46, 58, 66, 74, 78, 90, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [8, 12, 13, 13, 13, 16, 16, 17, 19, 20, 22, 23, 26, 29, 29, 30, 31, 37, 38, 39, 39, 41, 45, 45, 46, 49, 49, 53, 56, 62, 62, 66, 67, 68, 68, 69, 69, 73, 77, 78, 82, 85, 85, 88, 88, 97], [-98, -98, -88, -84, -78, -76, -76, -74, -70, -68, -64, -62, -58, -44, -42, -38, -30, -28, -26, -24, -22, -20, -8, -6, 2, 4, 8, 8, 16, 18, 20, 34, 36, 40, 46, 60, 72, 78, 82, 82, 86, 90, 94, 94, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 4, 21, 22, 23, 27, 27, 28, 28, 29, 30, 37, 39, 48, 50, 51, 54, 57, 61, 64, 64, 70, 71, 77, 85, 85, 88, 92, 93, 96, 97]]; int [] param1 = [33, 21, 37, 40, 44, 40, 46, 45, 28, 31]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_FIRST_NATURAL_NUMBER_WHOSE_FACTORIAL_DIVISIBLE_X,"static int f_filled ( int x ) { int i = 1 ; int fact = 1 ; for ( i = 1 ; i < x ; i ++ ) { fact = fact * i ; if ( fact % x == 0 ) break ; } return i ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 11, 5, 6, 4, 7, 3, 5, 4, 3]; int [] param0 = [12, 11, 10, 9, 8, 7, 6, 5, 4, 3]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DYCK_PATH,"static int f_filled ( int n ) { int res = 1 ; for ( int i = 0 ; i < n ; ++ i ) { res *= ( 2 * n - i ) ; res /= ( i + 1 ) ; } return res / ( n + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [742900, 208012, 58786, 16796, 429, 14, 1]; int [] param0 = [13, 12, 11, 10, 7, 4, 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); } " DYNAMIC_PROGRAMMING_HIGH_EFFORT_VS_LOW_EFFORT_TASKS_PROBLEM,"static int f_filled ( int high [ ] , int low [ ] , int n ) { if ( n <= 0 ) return 0 ; return Math . max ( high [ n - 1 ] + f_filled ( high , low , ( n - 2 ) ) , low [ n - 1 ] + f_filled ( high , low , ( n - 1 ) ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [537, 452, 0, 1261, -56, 15, 784, 268, 5, 453]; int [] [] param0 = [[1, 3, 9, 10, 13, 14, 15, 15, 17, 22, 23, 28, 30, 31, 37, 42, 45, 62, 62, 68, 68, 68, 78, 79, 82, 84, 87, 90, 99], [-78, -12, 26, 80, 50, 4, -80, 86, 12, -2, 18, -50, -90, 56, -50, 88, -62, 96, -44, -82, 56], [1], [21, 28, 13, 48, 26, 49, 16, 70, 81, 35, 74, 12, 97, 61, 10, 84, 94, 78, 40, 30, 30, 84, 41, 4, 95, 79, 38, 29, 9], [-80, -36, -32, -20, -14, -12, 10, 12, 72], [1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1], [1, 7, 9, 10, 13, 14, 15, 20, 23, 24, 24, 24, 26, 27, 29, 31, 32, 33, 34, 35, 46, 48, 49, 51, 51, 53, 53, 56, 56, 60, 62, 64, 64, 70, 73, 73, 73, 74, 77, 78, 79, 79, 79, 80, 86, 89, 89, 92, 98], [56, 48, 40, -56, 44, -86, -28, -32, -34, 4, -94, -14, 28, -74], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [85, 13, 35, 57, 8, 48, 65, 54, 88, 7, 66, 30, 47, 51]]; int [] [] param1 = [[5, 10, 11, 14, 16, 22, 24, 30, 34, 35, 37, 37, 39, 41, 42, 42, 43, 55, 57, 63, 71, 76, 83, 83, 85, 90, 91, 97, 99], [-44, -14, 14, 0, 30, 78, 40, -12, -44, -16, 60, -12, -50, -66, 70, -98, -56, 48, -82, 94, 14], [1], [49, 88, 25, 93, 24, 56, 47, 44, 33, 27, 86, 57, 21, 25, 64, 44, 37, 99, 36, 54, 17, 29, 37, 17, 26, 43, 61, 27, 21], [-76, -54, -50, -28, 0, 58, 70, 78, 90], [0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], [1, 3, 3, 4, 8, 8, 10, 10, 10, 12, 12, 15, 15, 22, 23, 28, 28, 30, 31, 33, 34, 35, 36, 36, 36, 42, 44, 44, 51, 54, 57, 58, 59, 59, 63, 65, 66, 68, 69, 71, 73, 76, 77, 78, 79, 79, 86, 87, 93], [82, -40, -16, -64, 12, -6, 60, 48, -58, -4, 42, -28, 24, -58], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [1, 42, 42, 89, 3, 21, 49, 98, 4, 59, 26, 85, 53, 34]]; int [] param2 = [18, 16, 0, 25, 4, 24, 31, 8, 16, 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); } " QUERIES_COUNTS_ARRAY_ELEMENTS_VALUES_GIVEN_RANGE,"static int f_filled ( int arr [ ] , int n , int x , int y ) { int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] >= x && arr [ i ] <= y ) count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 1, 0, 0, 0, 0, 0]; int [] [] param0 = [[9, 16, 19, 24, 36, 38, 42, 49, 51, 53, 53, 57, 57, 58, 71, 78, 78, 92, 92, 93], [28, -74, -18, 10, 26, 28, -96, -80, 82, 94, 22, 50, 72, -90, 76, 50, 20, -44, -80], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 8, 66, 90, 50, 65, 76, 90, 27], [-98, -96, -90, -82, -80, -78, -70, -66, -60, -60, -50, -48, -34, -26, -24, -16, -14, -8, -6, 4, 22, 24, 26, 30, 30, 48, 52, 56, 60, 62, 74, 76, 78, 86], [1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0], [4, 6, 17, 19, 24, 29, 30, 31, 32, 37, 37, 40, 43, 44, 44, 45, 57, 64, 69, 70, 73, 78, 86, 89, 91, 92, 94], [32, -88, 70, -6, 28, -48], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [37, 84, 97, 74, 12, 26, 47, 10, 14, 33]]; int [] param1 = [13, 18, 30, 4, 32, 15, 17, 4, 13, 5]; int [] param2 = [12, 13, 21, 8, 24, 16, 21, 3, 12, 9]; int [] param3 = [13, 13, 31, 5, 24, 12, 15, 4, 11, 8]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DYNAMIC_PROGRAMMING_SET_14_MAXIMUM_SUM_INCREASING_SUBSEQUENCE,"static int f_filled ( int arr [ ] , int n ) { int i , j , max = 0 ; int msis [ ] = new int [ n ] ; for ( i = 0 ; i < n ; i ++ ) msis [ i ] = arr [ i ] ; for ( i = 1 ; i < n ; i ++ ) for ( j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ] ; for ( i = 0 ; i < n ; i ++ ) if ( max < msis [ i ] ) max = msis [ i ] ; return max ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [301, 102, 1, 396, 582, 1, 0, 254, 0, 550]; int [] [] param0 = [[4, 5, 7, 12, 23, 31, 31, 45, 47, 60, 67, 70, 84, 85, 91, 96], [-88, -38, -50, -14, 36, -32, 0, -8, -12, -62, -46, 66, -46, -26, 6, -44, 14, -74, -84, 52, -28], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [85, 42, 7, 35, 35, 21, 97, 59, 88, 50, 12, 44, 85, 22, 38, 23, 42, 61, 44, 63, 23, 69, 28, 17, 73, 20, 71, 80, 15, 42, 28, 10, 56, 77, 43], [-92, -82, -82, -74, -72, -68, -68, -66, -60, -54, -42, -38, -36, -32, -30, -16, -14, -12, -10, 14, 24, 28, 34, 34, 38, 42, 44, 52, 70, 72, 80, 84, 86, 94], [0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0], [33], [76, 86, 46, -70, 92, 6, 70, -66, 64, 46, 86, -42, -46, -24, 8, 76, 4, -96, -86, 18, 70, -72, -56, -88, -96, 62, 22, 20, 42], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 46, 41, 61, 93, 29, 65, 24, 10, 89, 22, 51, 18, 65, 70, 59, 87, 82, 97, 99, 15, 64, 20, 97, 12, 23, 76]]; int [] param1 = [11, 18, 39, 26, 32, 8, 0, 21, 24, 20]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " HIGHWAY_BILLBOARD_PROBLEM,"static int f_filled ( int m , int [ ] x , int [ ] revenue , int n , int t ) { int [ ] maxRev = new int [ m + 1 ] ; for ( int i = 0 ; i < m + 1 ; i ++ ) maxRev [ i ] = 0 ; int nxtbb = 0 ; for ( int i = 1 ; i <= m ; i ++ ) { if ( nxtbb < n ) { if ( x [ nxtbb ] != i ) maxRev [ i ] = maxRev [ i - 1 ] ; else { if ( i <= t ) maxRev [ i ] = Math . max ( maxRev [ i - 1 ] , revenue [ nxtbb ] ) ; else maxRev [ i ] = Math . max ( maxRev [ i - t - 1 ] + revenue [ nxtbb ] , maxRev [ i - 1 ] ) ; nxtbb ++ ; } } else maxRev [ i ] = maxRev [ i - 1 ] ; } return maxRev [ m ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 0, 0, 0, 0, 0, 0, 0, 0, 0]; int [] param0 = [16, 39, 5, 10, 14, 32, 2, 22, 15, 8]; int [] [] param1 = [[6, 15, 15, 18, 23, 29, 32, 36, 37, 39, 40, 41, 44, 49, 51, 52, 53, 57, 66, 68, 82, 89, 96], [76, 60, 88, 46, -20, -78, -22, 54, -18, 92, -42, -66, -90, -72, -48, 22, -72, -42, -46, 94, 82, -78, 14, 86, 10, -64, -78, 66, 78, -36, 50, -20, -40, -12, 10, -46, 56, -18, 4, -76, -64, 74, 22, 34, 4, -2], [0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [21, 69, 30, 10, 71, 72, 71, 78, 30, 9, 72, 10, 7, 87, 30, 46, 56, 74, 73, 60, 86], [-76, -76, -66, -64, -62, -60, -52, -48, -42, -28, -14, -6, -6, 16, 20, 20, 38, 46, 58, 60, 70, 72, 86, 98], [1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1], [16, 38, 72, 82], [28, -76, 42, -2, 30, -10, 52, 66, 26, 96, 96, -72, 26, -86, -30, -78, 32, -32, 58, 12, -72, 8, 34, -68, -28, -66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [95, 12, 65, 97, 92, 49, 94, 32, 37, 97, 9, 35]]; int [] [] param2 = [[1, 2, 5, 5, 24, 26, 31, 32, 33, 41, 57, 59, 71, 75, 79, 87, 87, 88, 92, 94, 96, 96, 99], [28, 8, -60, 84, 68, -54, -56, 0, -68, -84, -6, 92, -80, -24, 86, -6, -44, 82, 74, 90, -46, 40, 62, 50, -42, 38, 78, 94, 46, -14, -48, 66, 70, 52, 10, -88, 54, -10, 98, 34, 16, -2, -62, -56, -40, 86], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [72, 45, 7, 30, 76, 35, 75, 72, 4, 7, 55, 56, 7, 52, 48, 27, 11, 76, 66, 48, 33], [-90, -82, -78, -76, -74, -52, -48, -44, -44, -40, -38, -14, -6, 10, 20, 38, 38, 40, 44, 48, 52, 54, 76, 78], [0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1], [15, 34, 56, 74], [68, -38, 34, 20, 40, 78, 52, 80, 58, -12, -18, 10, 40, 34, 20, -32, -8, -46, 8, 62, 94, -30, -94, 26, -40, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 32, 14, 49, 90, 37, 92, 1, 8, 75, 50, 9]]; int [] param3 = [12, 25, 9, 18, 15, 28, 2, 13, 25, 9]; int [] param4 = [12, 27, 6, 20, 17, 36, 3, 16, 15, 8]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " DYNAMIC_PROGRAMMING_SET_28_MINIMUM_INSERTIONS_TO_FORM_A_PALINDROME,"static int f_filled ( char str [ ] , int l , int h ) { if ( l > h ) return Integer . MAX_VALUE ; if ( l == h ) return 0 ; if ( l == h - 1 ) return ( str [ l ] == str [ h ] ) ? 0 : 1 ; return ( str [ l ] == str [ h ] ) ? f_filled ( str , l + 1 , h - 1 ) : ( Integer . min ( f_filled ( str , l , h - 1 ) , f_filled ( str , l + 1 , h ) ) + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 3, 0, 3, 0, 1, 2, 4, 0, 1]; char [] [] param0 = [['f', 'f', 'j', 'k', 'k', 'l', 'p', 's', 't', 'v', 'w', 'y', 'b', 'd', 'j', 'l', 't', 'u', 'x', 'y'], ['0', '1', '8', '8', '8', '4', '4', '3', '9', '6', '5', '2', '8', '2', '0', '2', '6', '0', '7', '7', '3', '2', '4', '5', '9', '7', '2', '4', '1', '8', '7', '9', '8', '0', '8', '5', '4', '2', '3'], ['1'], ['g', 'y', 'r', 'm', 'v', 'z', ' ', 'k', 's', 'p', 'x', 'p', 'e', 'z', 't', 'k', 'k', 'b', 's', 'p', 'p', 'e', 'g', 't', 'r', 'm', 'p', ' ', 'h', 'a'], ['0', '1', '1', '1', '1', '1', '1', '2', '2', '2', '2', '3', '3', '3', '3', '3', '4', '4', '4', '5', '5', '5', '5', '5', '6', '6', '6', '6', '6', '6', '6', '7', '8', '8', '8', '9', '9'], ['1', '1', '0', '1', '0', '1', '0', '1', '0', '1', '1', '1', '1', '1', '1', '0'], [' ', ' ', ' ', 'b', 'c', 'c', 'd', 'i', 'k', 'o', 'p', 'r', 't', 'v', 'w', 'a', 'b', 'd', 'j', 'y'], ['5', '0', '8', '6', '9', '3', '0', '3', '2', '0', '6', '2', '3', '7', '8', '9', '2', '0', '1', '9', '4', '1', '3', '1', '9', '2', '3', '4', '1', '2', '3', '8', '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', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['x', 'b', 'e', 'v', 'k', 't', 'k', 'k', 'q', 's', 'v', 'n', 'l', 'k', 't', 'n', 'j', 'z', 'f', 'p', 'j', 'g', 's', 'p', 'm', 'b', 'h', 'l', 'v', 'e', 'a', 'n', 'd', 'u', 'c', 's', 'm', 'q', 'p', 'g', 'g', ' ']]; int [] param1 = [11, 19, 0, 24, 33, 8, 14, 25, 35, 26]; int [] param2 = [11, 22, 0, 27, 34, 13, 16, 31, 37, 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); } " NUMBER_OF_BINARY_TREES_FOR_GIVEN_PREORDER_SEQUENCE_LENGTH,"static int f_filled ( int n ) { int BT [ ] = new int [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) BT [ i ] = 0 ; BT [ 0 ] = BT [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; ++ i ) for ( int j = 0 ; j < i ; j ++ ) BT [ i ] += BT [ j ] * BT [ i - j - 1 ] ; return BT [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [429, 42, 9694845, 58786, 16796, 5, 4862, 1430, 742900, 132]; int [] param0 = [7, 5, 15, 11, 10, 3, 9, 8, 13, 6]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_FIND_STRING_START_END_GEEKS,"static boolean f_filled ( String str , String corner ) { int n = str . length ( ) ; int cl = corner . length ( ) ; if ( n < cl ) return false ; return ( str . substring ( 0 , cl ) . equals ( corner ) && str . substring ( n - cl , n ) . equals ( corner ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, true, true, true, false, true, false, false, false]; string [] param0 = [""geeksmanishgeeks"", ""shreyadhatwalia"", ""10000100"", ""abaa"", ""30645530"", ""0000011011001"", ""dkqed"", ""48694119324654"", ""1101010010"", ""ks""]; string [] param1 = [""geeks"", ""abc"", ""100"", ""a"", ""30"", ""001"", ""d"", ""654"", ""11"", ""ksflmngggomhks""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MINIMIZE_THE_SUM_OF_DIGITS_OF_A_AND_B_SUCH_THAT_A_B_N,"static int f_filled ( int n ) { int sum = 0 ; while ( n > 0 ) { sum += ( n % 10 ) ; n /= 10 ; } if ( sum == 1 ) return 10 ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 12, 4, 9, 8, 13, 13, 5, 4, 9]; int [] param0 = [2, 39, 31, 45, 35, 94, 67, 50, 4, 63]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT_2,"static int f_filled ( int no ) { return no == 0 ? 0 : no % 10 + f_filled ( no / 10 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [10, 10, 9, 16, 4, 12, 14, 9, 13, 8]; int [] param0 = [73, 91, 27, 79, 31, 84, 68, 9, 85, 35]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUBSEQUENCE_SUM_SUCH_THAT_NO_THREE_ARE_CONSECUTIVE,"static int f_filled ( int arr [ ] , int n ) { int sum [ ] = new int [ n ] ; if ( n >= 1 ) sum [ 0 ] = arr [ 0 ] ; if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ] ; if ( n > 2 ) sum [ 2 ] = Math . max ( sum [ 1 ] , Math . max ( arr [ 1 ] + arr [ 2 ] , arr [ 0 ] + arr [ 2 ] ) ) ; for ( int i = 3 ; i < n ; i ++ ) sum [ i ] = Math . max ( Math . max ( sum [ i - 1 ] , sum [ i - 2 ] + arr [ i ] ) , arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] ) ; return sum [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [832, 308, 2, 419, -182, 7, 895, 450, 0, 895]; int [] [] param0 = [[5, 6, 8, 9, 10, 10, 16, 17, 17, 20, 21, 22, 23, 28, 29, 32, 36, 37, 40, 41, 42, 43, 47, 47, 48, 48, 49, 49, 52, 52, 53, 59, 61, 64, 65, 79, 79, 81, 87, 91, 92, 98], [98, 76, -80, -30, 82, 52, -14, 28, 98, 18, 82, 52, 26, -62, -8], [0, 0, 0, 0, 0, 1, 1, 1, 1], [21, 26, 85, 73, 47, 10, 54, 9, 11, 70, 42, 95, 44, 91], [-94, -92, -90, -84, -76, -68, -60, -50, -34, -34, -20, -16, -6, 18, 50, 54, 66, 70, 96], [1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1], [2, 3, 4, 4, 14, 14, 18, 21, 24, 26, 29, 31, 32, 34, 36, 37, 38, 40, 42, 44, 44, 54, 63, 69, 77, 77, 82, 82, 86, 87, 90, 93, 95], [-46, 64, -44, 88, -74, 54, 40, -2, -24, 94, 40, -44, 56, -54, -60, -86, -58, 48, -90, 12, -76, -30, 94, -34, 14, 12, 80, -40, 60], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [4, 32, 63, 23, 44, 57, 59, 69, 88, 61, 66, 61, 65, 33, 79, 58, 71, 2, 80, 41, 83, 12, 20, 9, 7, 40, 36, 97, 10, 98, 66, 78, 71, 37, 53]]; int [] param1 = [35, 7, 7, 12, 9, 16, 31, 22, 7, 26]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUM_SUBARRAY_REMOVING_ONE_ELEMENT,"static int f_filled ( int arr [ ] , int n ) { int fw [ ] = new int [ n ] ; int bw [ ] = new int [ n ] ; int cur_max = arr [ 0 ] , max_so_far = arr [ 0 ] ; fw [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) { cur_max = Math . max ( arr [ i ] , cur_max + arr [ i ] ) ; max_so_far = Math . max ( max_so_far , cur_max ) ; fw [ i ] = cur_max ; } cur_max = max_so_far = bw [ n - 1 ] = arr [ n - 1 ] ; for ( int i = n - 2 ; i >= 0 ; i -- ) { cur_max = Math . max ( arr [ i ] , cur_max + arr [ i ] ) ; max_so_far = Math . max ( max_so_far , cur_max ) ; bw [ i ] = cur_max ; } int fans = max_so_far ; for ( int i = 1 ; i < n - 1 ; i ++ ) fans = Math . max ( fans , fw [ i - 1 ] + bw [ i + 1 ] ) ; return fans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [764, 350, 3, 767, 570, 8, 2357, 662, 8, 833]; int [] [] param0 = [[2, 8, 14, 17, 19, 35, 38, 45, 50, 53, 55, 70, 82, 88, 92, 96], [-64, -56, -80, -82, 72, 62, -8, 48, -96, 34, 64, -38, -60, 80, 4, -64, -62, 34, 94, -16, 38, 62, -84, 48, 42, -40], [0, 0, 0, 0, 1, 1, 1], [3, 7, 50, 53, 72, 14, 18, 74, 27, 65, 41, 20, 54, 17, 87, 40, 63, 15, 47], [-96, -96, -94, -80, -74, -74, -74, -74, -70, -64, -60, -58, -52, -52, -44, -42, -40, -38, -36, -34, -30, -14, -12, -8, -2, 6, 12, 16, 24, 24, 48, 48, 66, 76, 76, 84, 90], [1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0], [4, 4, 5, 9, 11, 13, 13, 15, 16, 21, 23, 25, 27, 30, 31, 35, 35, 43, 43, 47, 49, 50, 52, 54, 55, 55, 57, 57, 57, 59, 62, 64, 66, 68, 69, 71, 73, 76, 80, 84, 88, 88, 90, 90, 97, 97, 99], [-86, -60, 4, 14, 6, -6, -50, 46, -50, -62, -56, 16, -76, 90, 40, 2, 36, 48, -26, 34, 78, 84, 2, -54, 94, 60, -26, 60, 84, 2, -98, 2, -74], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [36, 99, 27, 8, 90, 74, 67, 77, 49, 23, 43, 25, 68, 56, 85, 6]]; int [] param1 = [16, 26, 7, 19, 37, 15, 47, 33, 16, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " EFFICIENT_WAY_CHECK_WHETHER_N_TH_FIBONACCI_NUMBER_MULTIPLE_10,"static boolean f_filled ( int n ) { if ( n % 15 == 0 ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, false, false, false, false, false, false]; int [] param0 = [30, -30, 60, 90, 99, 32, 21, 65, 21, 99]; 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_AREA_SQUARE,"static int f_filled ( int side ) { int area = side * side ; return area ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2500, 4096, 8464, 529, 1444, 3025, 4489, 3136, 3600, 8100]; int [] param0 = [50, 64, 92, 23, 38, 55, 67, 56, 60, 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); } " EFFICIENT_WAY_TO_MULTIPLY_WITH_7,"static int f_filled ( int n ) { return ( ( n << 3 ) - n ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [287, 294, 434, 28, 217, 525, 35, 525, 595, 133]; int [] param0 = [41, 42, 62, 4, 31, 75, 5, 75, 85, 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); } " POSSIBLE_FORM_TRIANGLE_ARRAY_VALUES,"static boolean f_filled ( int [ ] arr , int N ) { if ( N < 3 ) return false ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < N - 2 ; i ++ ) if ( arr [ i ] + arr [ i + 1 ] > arr [ i + 2 ] ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, true, true, true, true, true]; int [] [] param0 = [[2, 6, 8, 10, 14, 15, 16, 19, 21, 26, 26, 26, 28, 29, 30, 33, 33, 35, 36, 36, 41, 44, 45, 45, 45, 49, 51, 54, 57, 59, 61, 64, 68, 70, 70, 72, 73, 74, 76, 78, 87, 89, 89, 91, 92, 93, 94, 95, 97], [-96, -94, -90, -86, -78, -78, -74, -72, -64, -64, -58, -56, -50, -46, -44, -36, -26, -14, -12, -10, -4, 4, 10, 16, 18, 22, 30, 32, 38, 46, 46, 50, 54, 56, 72, 74, 82, 86, 86, 88, 90, 96], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [24, 24, 41, 80, 90, 95], [-90, -88, -84, -82, -82, -80, -70, -66, -62, -60, -60, -48, -46, -44, -42, -20, -16, -4, 18, 26, 28, 32, 36, 46, 60, 62, 68, 72, 78, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 9, 14, 16, 16, 26, 30, 31, 32, 37, 42, 42, 43, 49, 51, 56, 64, 69, 76, 77, 77, 79, 85, 88, 89, 91, 94, 95], [-90, -84, -74, -68, -66, -60, -60, -60, -58, -52, -50, -42, -38, -34, -30, 6, 30, 42, 60, 80, 94, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [1, 3, 5, 8, 13, 15, 16, 22, 24, 26, 30, 31, 31, 33, 34, 39, 39, 40, 46, 49, 50, 51, 52, 59, 66, 69, 77, 80, 88, 90]]; int [] param1 = [49, 42, 21, 6, 30, 36, 28, 22, 23, 30]; 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); } " ELEMENTS_TO_BE_ADDED_SO_THAT_ALL_ELEMENTS_OF_A_RANGE_ARE_PRESENT_IN_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { HashSet < Integer > s = new HashSet < > ( ) ; int count = 0 , maxm = Integer . MIN_VALUE , minm = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { s . add ( arr [ i ] ) ; if ( arr [ i ] < minm ) minm = arr [ i ] ; if ( arr [ i ] > maxm ) maxm = arr [ i ] ; } for ( int i = minm ; i <= maxm ; i ++ ) if ( ! s . contains ( i ) ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [31, 141, 0, 60, 111, 0, 21, 174, 0, 73]; int [] [] param0 = [[1, 4, 5, 5, 11, 11, 12, 14, 16, 20, 23, 23, 25, 27, 29, 33, 33, 35, 37, 39, 39, 44, 44, 45, 47, 51, 51, 53, 55, 65, 73, 73, 75, 78, 79, 79, 80, 82, 86, 86, 87, 87, 88, 90, 91, 91, 94], [-38, 20, -94, -68, -96, 36, 48, 32, 44, -56, 72, -28, -6, 22, -54, -46, 58, -60, -80, 28, -34, 60, -12, -26, -32, 28, 72, -50, 66, -36, 28, 30, 10, 14, 0, -78, 94, -24, -42, -60, 66, -12, 92, 54, -34, -58, 56], [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], [73, 69, 12, 82, 65, 55, 93, 93, 88, 52, 33, 94, 62, 75, 61, 81, 48, 43, 29, 8, 28, 60, 60, 58, 54, 44, 25, 36, 46, 88, 54, 36, 83, 46, 34, 44, 71, 90, 68, 75, 42], [-98, -94, -88, -80, -74, -70, -70, -56, -50, -48, -40, -24, -22, -14, 0, 2, 2, 6, 12, 22, 30, 32, 32, 40, 48, 52, 52, 58, 64, 66, 66, 68, 70, 72, 74, 76, 78, 94, 98, 98], [1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1], [1, 2, 3, 4, 7, 11, 12, 13, 14, 15, 20, 21, 22, 25, 25, 28, 32, 32, 35, 36, 37, 38, 42, 42, 45, 48, 48, 48, 54, 67, 70, 70, 71, 74, 80, 81, 82, 82, 85, 94], [-90, 92, 28, -32, 76, 94, 48, 80, 52, -12, -6, 22, 40, 26, -18, -84, 90, 16, -76, 52, 10, -56, 6], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [4, 21, 34, 35, 71, 10, 88, 44, 82, 13, 79, 92, 35, 73, 28, 91, 33, 9, 12, 76, 40, 91, 4, 22, 90, 53, 98, 7, 30]]; int [] param1 = [26, 31, 20, 31, 22, 18, 24, 11, 14, 17]; 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); } " LARGEST_SUM_CONTIGUOUS_SUBARRAY_2,"static int f_filled ( int a [ ] , int size ) { int max_so_far = a [ 0 ] ; int curr_max = a [ 0 ] ; for ( int i = 1 ; i < size ; i ++ ) { curr_max = Math . max ( a [ i ] , curr_max + a [ i ] ) ; max_so_far = Math . max ( max_so_far , curr_max ) ; } return max_so_far ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1265, 90, 11, 1063, 348, 13, 1306, 172, 10, 1019]; int [] [] param0 = [[1, 3, 4, 7, 8, 8, 10, 12, 16, 19, 19, 20, 20, 21, 21, 22, 26, 27, 29, 34, 36, 38, 38, 39, 41, 43, 44, 47, 47, 49, 57, 57, 60, 62, 63, 65, 75, 77, 77, 78, 81, 82, 82, 83, 83, 84, 85, 98, 99], [-40, 14, 2, -70, 86, -90, -50, -54, -2, 90, 30], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [60, 69, 41, 7, 77, 36, 36, 26, 35, 30, 64, 75, 3, 35, 60, 71, 29, 47, 15, 29, 43, 88, 56, 22, 9, 45, 40, 50, 52], [-96, -88, -80, -72, -64, -64, -60, -60, -60, -58, -56, -54, -54, -50, -50, -26, -26, -24, -20, -8, -2, 0, 4, 4, 12, 14, 18, 18, 24, 32, 42, 44, 44, 44, 48, 50, 50, 56, 60, 60, 70, 80, 88, 88, 90, 98], [0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0], [2, 4, 4, 5, 6, 7, 11, 12, 14, 18, 23, 24, 27, 28, 33, 36, 37, 38, 39, 40, 41, 41, 48, 48, 52, 61, 64, 66, 66, 77, 79, 82, 85, 88, 91, 94, 99], [-56, 0, 16, 12, 20, 36, 32, -52, -68, -36, -96, -46, -34, 56, 2, 78, 6, 30, -68, -48, 2, 44, -26, -36, -30, -20, -90, -66, 4, 94, 8, 4, -4, -32, -24], [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], [39, 87, 27, 89, 26, 25, 80, 82, 21, 25, 55, 27, 20, 81, 47, 79, 26, 72, 10, 11, 90, 89]]; int [] param1 = [38, 10, 18, 25, 35, 22, 34, 20, 22, 21]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " EULERIAN_NUMBER_1,"static int f_filled ( int n , int m ) { int [ ] [ ] dp = new int [ n + 1 ] [ m + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= m ; j ++ ) { if ( i > j ) { if ( j == 0 ) dp [ i ] [ j ] = 1 ; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ) ; } } } return dp [ n ] [ m ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1505621508, 66318474, 455192, 1191, 57, 26, 1, 0]; int [] param0 = [13, 12, 10, 7, 6, 5, 4, 5]; int [] param1 = [7, 7, 6, 4, 4, 3, 3, 6]; 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); } " EULERS_CRITERION_CHECK_IF_SQUARE_ROOT_UNDER_MODULO_P_EXISTS,"static boolean f_filled ( int n , int p ) { n = n % p ; for ( int x = 2 ; x < p ; x ++ ) if ( ( x * x ) % p == n ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, false, true, false, true, false, false, false]; int [] param0 = [71, 85, 4, 20, 71, 72, 36, 95, 83, 72]; int [] param1 = [78, 75, 35, 99, 29, 88, 54, 52, 33, 13]; 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_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP_1,"static boolean f_filled ( int arr [ ] , int n ) { for ( int i = 0 ; i <= ( n - 2 ) / 2 ; i ++ ) { if ( arr [ 2 * i + 1 ] > arr [ i ] ) { return false ; } if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) { return false ; } } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, true, false, true, false, false, false, false]; int [] [] param0 = [[2, 2, 2, 7, 10, 14, 24, 38, 42, 50, 59, 60, 72, 73, 79, 83, 89], [-48, 98, 96, -56, -2, 58, 52, -50, 58, 50, 62, 86, -26, -98, 34, 20, -28, 56, -36], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [91, 50, 37], [-80, -26, 0, 0, 6, 14, 22, 76, 82, 88, 98], [1, 0], [9, 24, 24, 33, 48, 50, 55, 61, 69, 79, 83], [30, 32, -82, -48, 88, -24, 74, 2, 90, 98, 68, 82, 32, -60, 2, -94, 18, 14, 46, 50, -60, -74, -76, 66, -76, -34, -20, 82, -44, -62, 34, 48, -56, 2, 64, -78, -64, 98, -10, -28, 78, -42], [0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [38, 74, 99, 75, 44, 75, 24, 70, 78, 74, 60, 59, 34, 27, 7, 23, 19, 95, 4, 35, 38, 22, 46, 1, 44, 20, 52, 1, 96, 57, 5, 76, 49, 1, 37, 35]]; int [] param1 = [9, 9, 20, 2, 10, 1, 8, 27, 6, 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); } " EVEN_FIBONACCI_NUMBERS_SUM,"static int f_filled ( int limit ) { if ( limit < 2 ) return 0 ; long ef1 = 0 , ef2 = 2 ; long sum = ef1 + ef2 ; while ( ef2 <= limit ) { long ef3 = 4 * ef2 + ef1 ; if ( ef3 > limit ) break ; ef1 = ef2 ; ef2 = ef3 ; sum += ef2 ; } return ( int ) sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [44, 44, 10, 44, 44, 10, 44, 10, 10, 44]; int [] param0 = [67, 89, 12, 94, 96, 25, 49, 8, 33, 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); } " FAST_MULTIPLICATION_METHOD_WITHOUT_USING_MULTIPLICATION_OPERATOR_RUSSIAN_PEASANTS_ALGORITHM,"static int f_filled ( int a , int b ) { int res = 0 ; while ( b > 0 ) { if ( ( b & 1 ) != 0 ) res = res + a ; a = a << 1 ; b = b >> 1 ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [132, 2412, 3380, 2035, 2660, 6762, 5208, 400, 540, 5628]; int [] param0 = [4, 36, 65, 55, 35, 69, 84, 5, 15, 67]; int [] param1 = [33, 67, 52, 37, 76, 98, 62, 80, 36, 84]; 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_THREE_ELEMENT_FROM_DIFFERENT_THREE_ARRAYS_SUCH_THAT_THAT_A_B_C_K_1,"static boolean f_filled ( int a1 [ ] , int a2 [ ] , int a3 [ ] , int n1 , int n2 , int n3 , int sum ) { HashSet < Integer > s = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < n1 ; i ++ ) { s . add ( a1 [ i ] ) ; } ArrayList < Integer > al = new ArrayList < > ( s ) ; for ( int i = 0 ; i < n2 ; i ++ ) { for ( int j = 0 ; j < n3 ; j ++ ) { if ( al . contains ( sum - a2 [ i ] - a3 [ j ] ) & al . indexOf ( sum - a2 [ i ] - a3 [ j ] ) != al . get ( al . size ( ) - 1 ) ) { return true ; } } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, false, false, false, false, false, false, false]; int [] [] param0 = [[6, 7, 10, 15, 28, 30, 30, 35, 38, 43, 44, 44, 54, 55, 64, 68, 69, 73, 75, 75, 86, 87, 92, 93, 94], [-72, -90, -92, 4, 22, 14, -50, 16, -56, -66, 62, -32, 82, 8, 12, -24, 92, -98, -94, 56, -74, -66, 26, -98, 10, -74, -14, 2, 60, -88, -84, 34, 82, 28, -86, -90, -92, 52, 72, 90, 92, -20, -86, 74, -96, -46, 28], [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], [85, 34, 78, 64, 22, 94, 52, 71, 44, 48, 46, 88, 59, 95, 4, 55, 21, 83, 56, 19, 85, 6, 87, 13], [-98, -98, -96, -94, -90, -90, -84, -36, -34, -34, -32, 16, 26, 26, 56, 74, 80], [1, 1, 1, 0, 0, 0, 1, 1, 1, 1], [4, 4, 25, 27, 35, 39, 50, 60, 60, 63, 67, 73, 75, 81, 84, 85, 91, 98], [54, -64, 76, 78, 24, 40, 44, -56, 80, -10, -12, -8, -18, 42, 70, 14, -70, 48, -68, -98, -74, -40, -16, -90, 48, 92, -64, 58, -98, 60, -10, -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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [28, 88, 75, 86, 51, 82, 2, 20, 22, 18, 96, 11]]; int [] [] param1 = [[11, 17, 18, 24, 26, 26, 33, 35, 38, 41, 55, 60, 63, 63, 69, 73, 78, 81, 82, 87, 90, 91, 93, 94, 99], [50, -20, 26, 32, -46, 38, 36, 0, -96, 60, -70, -36, -12, 50, 64, -70, 22, -22, 32, 60, -94, 98, -58, -86, -16, 40, -68, 2, -50, 6, -36, -28, -68, 44, -98, -38, -46, 68, 4, 60, -36, 28, -38, 4, 50, -84, -12], [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], [58, 45, 14, 13, 73, 82, 34, 78, 83, 84, 39, 34, 65, 84, 84, 61, 26, 67, 48, 51, 41, 46, 89, 10], [-92, -70, -70, -56, -54, -48, -38, -14, -10, 0, 4, 30, 34, 70, 72, 76, 78], [0, 0, 1, 0, 0, 1, 0, 1, 0, 1], [20, 21, 23, 25, 37, 41, 51, 57, 62, 66, 74, 77, 77, 79, 80, 87, 88, 95], [88, -66, -50, 74, -44, -32, -58, -24, -40, 62, 52, 88, -48, -2, -46, 38, 30, -56, 76, 56, 60, 52, -32, 36, 90, 92, -74, 88, -36, -14, -16, -14], [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], [62, 54, 79, 88, 27, 13, 48, 94, 86, 28, 86, 60]]; int [] [] param2 = [[3, 3, 8, 22, 24, 24, 28, 30, 32, 32, 34, 39, 40, 45, 46, 50, 54, 59, 75, 78, 79, 90, 95, 95, 97], [-28, 20, -62, -84, 14, 10, 28, -10, 94, -2, 52, 66, 38, -50, 48, -88, -28, 92, -48, 86, 4, -16, 26, 26, -82, 44, 70, 72, -6, -98, 80, 56, 38, 42, -20, 64, 36, 80, 12, 4, -50, 54, 22, 98, -30, -52, 4], [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], [46, 1, 2, 90, 31, 49, 62, 10, 28, 4, 48, 84, 87, 51, 88, 74, 99, 15, 35, 24, 32, 66, 10, 66], [-92, -88, -70, -56, -50, -50, -48, -36, -20, -10, -8, 2, 16, 22, 48, 70, 78], [1, 1, 1, 1, 0, 1, 1, 1, 0, 1], [2, 3, 9, 10, 10, 18, 24, 40, 41, 47, 68, 69, 70, 86, 90, 95, 96, 98], [38, -96, 16, 38, -48, -22, -52, -78, 42, 94, -26, -20, 12, -10, 72, 16, -8, -2, -36, -76, -6, -92, 10, 34, -76, -54, -20, 20, -76, -46, 24, 44], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [49, 14, 18, 61, 94, 54, 12, 56, 97, 59, 85, 44]]; int [] param3 = [21, 41, 26, 15, 15, 5, 12, 23, 38, 6]; int [] param4 = [16, 42, 20, 16, 10, 7, 17, 18, 22, 6]; int [] param5 = [17, 34, 30, 23, 15, 9, 13, 29, 40, 8]; int [] param6 = [18, 32, 16, 15, 15, 6, 9, 19, 32, 9]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i], param6[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FINDING_POWER_PRIME_NUMBER_P_N,"static int f_filled ( int n , int p ) { int ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) { int count = 0 , temp = i ; while ( temp % p == 0 ) { count ++ ; temp = temp / p ; } ans += count ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 3, 1, 1, 2, 1, 0, 0, 1, 3]; int [] param0 = [49, 80, 10, 81, 11, 45, 86, 27, 80, 97]; int [] param1 = [30, 25, 9, 57, 4, 34, 90, 78, 60, 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); } " MAXIMUM_NUMBER_2X2_SQUARES_CAN_FIT_INSIDE_RIGHT_ISOSCELES_TRIANGLE,"static int f_filled ( int base ) { base = ( base - 2 ) ; base = base / 2 ; return base * ( base + 1 ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1081, 276, 10, 630, 666, 190, 10, 1081, 496, 28]; int [] param0 = [95, 49, 10, 73, 74, 40, 10, 94, 64, 16]; 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_A_FIXED_POINT_IN_A_GIVEN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int i ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == i ) return i ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, 0, -1, -1, 0, -1, -1, 0, -1]; int [] [] param0 = [[8, 16, 21, 26, 27, 29, 34, 35, 35, 37, 38, 40, 48, 52, 58, 59, 60, 61, 63, 63, 65, 66, 69, 75, 79, 83, 86, 88, 91, 91, 96], [22, -70, 34, -44, 84, 54, 14, -88], [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], [59, 67, 70, 34, 18, 22, 52, 95, 11, 66, 60, 24, 7, 71, 52, 88, 32, 52, 85, 81, 32, 44, 25, 51, 47, 97, 81, 33, 88, 38, 36, 54, 80, 25, 70, 27, 75, 29, 94], [-96, -96, -94, -88, -88, -82, -72, -72, -70, -70, -66, -64, -64, -62, -58, -54, -46, -44, -30, -26, -22, -8, -6, -2, 0, 26, 30, 30, 34, 42, 42, 48, 64, 76, 90, 96], [0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1], [2, 2, 4, 7, 10, 15, 16, 16, 23, 24, 27, 39, 42, 58, 60, 64, 72, 74, 78, 78, 78, 80, 80, 84, 85, 86, 88, 88, 90, 92, 93, 94, 95, 96], [-68, -48, 36, 22, -80, -48, -74, -14, 44, -46, -76, 18, -16, -36, -68, 0, -30, -56, 42, 92, 82, 64, -18, -6, -78, -86, 26, 86, 36, -66, -50, 18, -26, 48, 8], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 76, 99, 1, 1, 29, 9, 12, 57, 12, 74, 22, 83, 77, 39, 84, 50, 60, 36, 90, 88, 62, 79, 58, 58, 40, 44, 99, 84, 63, 23, 21, 16, 98, 68, 8, 46]]; int [] param1 = [23, 7, 31, 37, 34, 15, 22, 20, 23, 35]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THE_MAXIMUM_SUBARRAY_XOR_IN_A_GIVEN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int ans = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int curr_xor = 0 ; for ( int j = i ; j < n ; j ++ ) { curr_xor = curr_xor ^ arr [ j ] ; ans = Math . max ( ans , curr_xor ) ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [63, 126, 1, 33, 126, 1, 127, 126, 1, 127]; int [] [] param0 = [[1, 7, 7, 11, 12, 18, 20, 23, 27, 30, 44, 47, 53, 53, 55, 57, 57, 58, 61, 62, 67, 74, 76, 80, 86, 86], [-34, -4, 68, -82, 54, 20, 6, -18, -70, 98, -40, 80, -28, 78, 28, 56, 26, 2, 2, -56, -66, 44, 0, -72, 12, 54, -40, 18, 28, -48, -56, 72, 84, 60, 76, 26, -8, 62], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [33, 98], [-92, -80, -76, -76, -74, -58, -44, -38, -34, -32, -30, -24, -20, -18, -4, -2, 2, 8, 44, 52, 52, 56, 70, 72, 80, 80, 98], [0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0], [1, 2, 3, 6, 9, 15, 15, 18, 19, 25, 31, 31, 33, 37, 39, 47, 49, 51, 51, 52, 52, 54, 58, 59, 59, 61, 62, 62, 65, 66, 66, 66, 66, 67, 71, 76, 77, 78, 79, 80, 83, 86, 87, 92, 97, 97, 98, 99], [34, -90, 64, 88, -46, -4, -96, 76, -32, 10, -8, -24, 32, -4, 86, -20, -86, -88, -72, 64, 12, 66, -96, -84, 16, -58, -48, 80, -80, 70, -94, -84, 56, 8, -14, 86, 72, -16, -18, 74, 40, 34, 20, 80], [1, 1], [57, 76, 2, 30, 24, 12, 49, 12, 5, 75, 55, 17, 62, 87, 21, 91, 88, 10, 20, 49, 46, 79, 51, 33, 94, 59, 48, 97, 70, 49]]; int [] param1 = [13, 21, 12, 1, 15, 33, 38, 35, 1, 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); } " FIND_THE_MISSING_NUMBER_1,"static int f_filled ( int a [ ] , int n ) { int total = 1 ; for ( int i = 2 ; i <= ( n + 1 ) ; i ++ ) { total += i ; total -= a [ i - 2 ] ; } return total ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-261, 524, 131, -954, 694, 341, -506, 227, 463, -697]; int [] [] param0 = [[13, 27, 46, 59, 62, 82, 92], [22, 86, -64, -20, -56, -16, 86, 42, 72, -90, 10, 42, 56, 8, 50, 24, -34, 0, -78, 64, 18, 20, -84, -22, 90, -20, 86, 26, -54, 0, 90, -48, 4, 88, 18, -64, -22, -74, 48, -36, -86, -24, 88, -64, 68, 62, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [55, 89, 56, 85, 26, 4, 91, 91, 3, 77, 63, 59, 76, 90, 1, 94, 44, 70, 8, 54, 3, 91, 29, 95, 28, 75, 20], [-94, -84, -80, -78, -66, -62, -54, -52, -26, -8, -8, -6, 4, 4, 8, 14, 26, 58, 60, 62, 62, 76, 78, 86, 92], [1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 2, 7, 7, 9, 14, 23, 29, 31, 31, 35, 35, 38, 41, 44, 49, 49, 50, 51, 54, 55, 56, 57, 63, 67, 69, 73, 79, 79, 80, 86, 88, 93], [78, -48, 16, 22, -16, 34, 56, -20, -62, -82, -74, -40, 20, -24, -46, 64, 66, -76, 58, -84, 96, 76, 86, -32, 46], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [73, 76, 25, 59, 40, 85, 90, 38, 13, 97, 93, 99, 45, 7]]; int [] param1 = [6, 38, 15, 22, 18, 25, 24, 12, 29, 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); } " FIND_A_TRIPLET_THAT_SUM_TO_A_GIVEN_VALUE,"static boolean f_filled ( int A [ ] , int arr_size , int sum ) { int l , r ; for ( int i = 0 ; i < arr_size - 2 ; i ++ ) { for ( int j = i + 1 ; j < arr_size - 1 ; j ++ ) { for ( int k = j + 1 ; k < arr_size ; k ++ ) { if ( A [ i ] + A [ j ] + A [ k ] == sum ) { System . out . print ( ""Triplet is "" + A [ i ] + "", "" + A [ j ] + "", "" + A [ k ] + ""\n"" ) ; return true ; } } } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, true, false, false, false, true, false, false]; int [] [] param0 = [[15, 18, 38, 47, 75, 88], [28, -2, 62, 38, 86, -86, 56, 58, 96, 6, -28, 8, 68, -16, -80, -4, 98, -92, 4, -4, 58, -62, 46, 64], [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], [19, 77, 17, 91, 6, 35, 22, 4, 30, 23, 97, 56, 78, 16, 22, 23, 95, 57, 43, 27, 47, 44, 23, 10, 3, 94, 55, 22, 93, 32, 89, 28, 64, 22, 13, 24, 38, 44, 6, 1, 80], [-98, -98, -94, -88, -80, -74, -68, -68, -64, -44, -36, -24, -10, -8, -8, 0, 4, 6, 8, 8, 12, 14, 16, 38, 50, 52, 54, 56, 66, 68, 76, 88], [1, 1, 0, 0, 1, 0, 1, 1], [7, 22, 24, 30, 42, 44, 49, 49, 65, 70, 70, 74, 74, 75, 90, 95, 96], [40, -76, -68, -86, -14, 82, -20, 54, -26, 56, -24, -44, 44, 60, 52, -20, 80, -24, -90, -30, -2], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [33, 92, 6, 99, 83, 97, 49, 97, 85, 52]]; int [] param1 = [5, 22, 27, 22, 18, 4, 8, 11, 15, 6]; int [] param2 = [4, 18, 23, 29, 19, 5, 13, 18, 17, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_DIFFERENCE_BETWEEN_SUMS_OF_TWO_DIAGONALS_1,"static int f_filled ( int arr [ ] [ ] , int n ) { int d1 = 0 , d2 = 0 ; for ( int i = 0 ; i < n ; i ++ ) { d1 += arr [ i ] [ i ] ; d2 += arr [ i ] [ n - i - 1 ] ; } return Math . abs ( d1 - d2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [37, 362, 2, 95, 50, 1, 11, 362, 0, 59]; int [] [] [] param0 = [[[1, 2, 4, 8, 12, 15, 17, 17, 19, 19, 21, 26, 27, 28, 32, 33, 40, 41, 41, 46, 46, 47, 48, 56, 59, 62, 68, 68, 69, 76, 80, 81, 82, 83, 86, 88, 90, 91, 93, 96, 97], [3, 7, 8, 9, 10, 13, 16, 18, 20, 22, 22, 24, 26, 27, 31, 33, 33, 34, 37, 43, 45, 46, 46, 46, 47, 49, 50, 51, 55, 57, 67, 75, 75, 83, 87, 87, 90, 90, 92, 93, 97], [5, 5, 5, 8, 11, 14, 18, 24, 26, 28, 28, 31, 35, 36, 37, 43, 43, 50, 56, 56, 59, 61, 62, 62, 64, 66, 66, 67, 74, 76, 76, 79, 82, 83, 84, 87, 87, 87, 90, 96, 98], [4, 13, 13, 20, 21, 22, 22, 29, 30, 31, 35, 38, 38, 39, 41, 42, 43, 43, 51, 56, 56, 63, 65, 66, 74, 79, 80, 82, 84, 84, 86, 87, 87, 89, 91, 92, 92, 94, 94, 96, 99], [8, 11, 12, 17, 17, 18, 21, 24, 24, 26, 26, 26, 27, 28, 28, 28, 29, 32, 36, 36, 40, 51, 53, 59, 64, 65, 68, 72, 73, 73, 77, 81, 81, 82, 83, 85, 87, 89, 92, 95, 99], [1, 3, 6, 7, 7, 8, 9, 9, 12, 13, 13, 14, 15, 17, 20, 20, 21, 27, 36, 36, 40, 44, 51, 51, 55, 57, 62, 68, 68, 70, 81, 82, 87, 89, 90, 93, 94, 97, 97, 98, 99], [4, 6, 7, 11, 14, 21, 21, 22, 25, 25, 28, 30, 39, 40, 40, 43, 45, 46, 46, 51, 53, 57, 60, 62, 64, 65, 66, 68, 70, 72, 73, 80, 81, 81, 84, 84, 86, 91, 92, 95, 95], [1, 1, 3, 5, 5, 9, 11, 11, 11, 13, 16, 17, 20, 28, 31, 31, 36, 37, 38, 38, 41, 42, 44, 47, 49, 53, 54, 58, 60, 67, 68, 70, 72, 72, 76, 80, 81, 82, 87, 88, 99], [8, 8, 10, 16, 16, 17, 20, 26, 29, 29, 31, 36, 40, 42, 48, 50, 55, 56, 56, 59, 61, 64, 64, 70, 77, 77, 78, 78, 81, 84, 84, 87, 88, 93, 93, 93, 95, 95, 96, 97, 97], [2, 2, 5, 7, 9, 10, 11, 14, 15, 15, 16, 16, 22, 23, 26, 26, 31, 32, 33, 36, 42, 49, 51, 53, 56, 58, 61, 75, 76, 77, 77, 80, 80, 82, 82, 83, 84, 85, 90, 90, 94], [3, 6, 7, 9, 9, 10, 11, 12, 19, 22, 25, 30, 32, 32, 33, 34, 35, 36, 36, 37, 40, 41, 43, 43, 44, 44, 51, 58, 62, 62, 69, 69, 78, 78, 80, 83, 85, 91, 93, 97, 99], [1, 4, 5, 7, 7, 7, 15, 16, 17, 18, 21, 21, 26, 31, 36, 39, 39, 47, 49, 53, 56, 59, 60, 63, 63, 64, 64, 66, 69, 70, 77, 79, 80, 80, 82, 84, 86, 87, 89, 98, 98], [1, 6, 9, 11, 12, 14, 21, 22, 29, 31, 32, 32, 34, 37, 37, 37, 43, 44, 47, 52, 55, 57, 58, 61, 61, 63, 64, 65, 70, 71, 71, 74, 74, 77, 77, 80, 81, 86, 91, 91, 97], [1, 3, 4, 10, 10, 19, 20, 20, 21, 21, 23, 27, 27, 33, 35, 36, 36, 41, 41, 42, 49, 51, 51, 51, 54, 56, 59, 61, 61, 66, 67, 77, 81, 82, 82, 82, 85, 87, 93, 94, 95], [7, 9, 9, 12, 15, 19, 24, 28, 30, 32, 36, 39, 40, 41, 51, 55, 55, 55, 56, 56, 57, 58, 63, 64, 71, 73, 74, 76, 76, 77, 77, 80, 81, 89, 91, 91, 92, 94, 95, 97, 99], [2, 2, 6, 11, 13, 15, 16, 17, 18, 21, 24, 30, 30, 33, 34, 35, 36, 40, 41, 44, 46, 47, 51, 52, 53, 53, 55, 56, 60, 62, 68, 73, 77, 78, 79, 83, 85, 91, 94, 96, 96], [2, 3, 6, 7, 8, 8, 9, 15, 18, 24, 25, 30, 30, 38, 41, 44, 44, 47, 49, 53, 59, 60, 61, 65, 65, 71, 77, 78, 80, 84, 84, 86, 86, 87, 88, 88, 90, 91, 91, 95, 96], [1, 10, 11, 16, 16, 16, 25, 26, 28, 31, 31, 32, 33, 34, 34, 36, 37, 38, 46, 50, 52, 55, 56, 58, 61, 62, 67, 71, 72, 75, 77, 83, 84, 84, 85, 87, 88, 95, 96, 97, 99], [1, 3, 4, 5, 7, 8, 9, 12, 13, 13, 18, 20, 24, 27, 33, 35, 39, 44, 49, 56, 56, 61, 61, 67, 70, 70, 70, 70, 71, 71, 71, 76, 78, 78, 84, 88, 89, 91, 94, 95, 99], [1, 1, 4, 5, 6, 7, 11, 16, 20, 22, 23, 27, 35, 36, 39, 39, 44, 46, 46, 49, 51, 51, 52, 55, 56, 56, 58, 65, 70, 77, 78, 82, 82, 82, 84, 88, 89, 96, 98, 98, 99], [3, 3, 5, 5, 9, 12, 14, 17, 22, 31, 33, 34, 36, 36, 38, 38, 39, 45, 46, 47, 48, 48, 50, 55, 55, 56, 59, 63, 64, 67, 68, 70, 72, 74, 80, 80, 82, 84, 87, 93, 95], [4, 8, 16, 17, 17, 18, 18, 23, 24, 27, 28, 32, 36, 39, 40, 42, 45, 48, 48, 52, 52, 53, 55, 56, 57, 57, 66, 67, 68, 70, 71, 74, 74, 74, 75, 77, 80, 81, 84, 92, 92], [4, 4, 5, 8, 18, 18, 19, 20, 21, 21, 25, 25, 25, 28, 31, 38, 42, 48, 54, 56, 58, 59, 61, 61, 63, 66, 67, 67, 68, 71, 74, 75, 77, 77, 78, 84, 86, 88, 93, 94, 99], [3, 5, 5, 8, 10, 12, 13, 20, 21, 22, 25, 33, 38, 39, 41, 44, 47, 47, 48, 49, 50, 52, 59, 62, 64, 65, 67, 68, 69, 70, 70, 75, 78, 79, 80, 81, 83, 84, 87, 90, 99], [3, 7, 9, 9, 11, 13, 13, 13, 14, 15, 17, 24, 26, 29, 29, 33, 34, 35, 37, 40, 41, 45, 50, 50, 53, 56, 57, 59, 62, 62, 63, 65, 72, 72, 76, 78, 79, 86, 87, 94, 99], [2, 2, 6, 7, 12, 13, 13, 13, 15, 16, 17, 18, 22, 23, 24, 24, 27, 28, 34, 40, 40, 42, 43, 48, 49, 52, 53, 54, 55, 57, 60, 66, 71, 71, 71, 73, 74, 93, 96, 96, 97], [1, 1, 2, 2, 3, 3, 4, 4, 6, 18, 20, 25, 26, 26, 27, 30, 32, 38, 39, 41, 48, 50, 53, 57, 61, 63, 64, 65, 66, 67, 67, 68, 71, 73, 81, 84, 91, 91, 91, 94, 99], [2, 3, 3, 4, 5, 7, 10, 11, 12, 13, 14, 14, 14, 15, 16, 17, 17, 18, 26, 27, 40, 41, 42, 43, 47, 47, 48, 48, 55, 63, 64, 75, 78, 83, 83, 87, 88, 89, 92, 98, 98], [1, 2, 6, 6, 8, 13, 13, 22, 23, 25, 25, 26, 28, 28, 34, 37, 40, 44, 46, 50, 54, 58, 62, 62, 65, 67, 72, 79, 80, 81, 84, 85, 85, 87, 88, 89, 92, 95, 97, 97, 97], [3, 4, 6, 6, 11, 12, 12, 15, 19, 20, 22, 26, 34, 37, 41, 44, 52, 56, 56, 60, 69, 69, 70, 71, 72, 72, 73, 79, 79, 83, 85, 90, 90, 91, 93, 94, 95, 96, 97, 98, 99], [2, 4, 5, 6, 8, 9, 15, 17, 21, 21, 24, 24, 30, 32, 34, 34, 35, 37, 38, 39, 39, 41, 43, 43, 43, 47, 51, 51, 54, 55, 61, 63, 64, 71, 74, 78, 78, 80, 84, 85, 96], [2, 2, 7, 8, 9, 9, 9, 10, 14, 14, 14, 15, 20, 21, 26, 26, 27, 28, 29, 36, 37, 39, 40, 40, 41, 45, 48, 49, 61, 62, 66, 67, 69, 70, 71, 75, 75, 76, 80, 90, 97], [1, 3, 11, 11, 11, 12, 15, 17, 19, 20, 25, 27, 28, 40, 51, 52, 53, 53, 57, 58, 58, 62, 68, 72, 72, 73, 76, 76, 81, 83, 84, 86, 86, 87, 87, 89, 92, 94, 94, 95, 95], [7, 7, 8, 13, 16, 16, 23, 23, 24, 24, 30, 33, 37, 38, 39, 42, 48, 52, 53, 54, 56, 56, 64, 64, 65, 66, 66, 68, 70, 71, 72, 72, 78, 81, 83, 85, 86, 87, 90, 90, 92], [3, 4, 4, 5, 13, 17, 17, 21, 28, 33, 34, 34, 34, 35, 37, 38, 45, 50, 55, 60, 63, 64, 65, 67, 67, 68, 69, 70, 71, 79, 79, 80, 80, 84, 85, 93, 94, 94, 96, 97, 98], [10, 13, 15, 17, 19, 20, 21, 21, 22, 29, 29, 30, 35, 39, 39, 44, 44, 47, 49, 49, 50, 50, 52, 53, 55, 57, 57, 59, 60, 61, 64, 67, 69, 72, 75, 78, 80, 87, 88, 89, 98], [8, 9, 9, 13, 28, 29, 32, 32, 33, 34, 38, 40, 40, 42, 45, 51, 51, 54, 55, 57, 57, 59, 63, 69, 69, 69, 70, 73, 76, 77, 78, 78, 85, 85, 87, 88, 91, 95, 96, 97, 99], [2, 5, 7, 8, 14, 17, 19, 20, 21, 24, 25, 28, 29, 32, 33, 37, 44, 45, 52, 54, 58, 58, 62, 62, 63, 63, 65, 65, 71, 72, 74, 81, 86, 86, 91, 91, 91, 93, 93, 96, 98], [3, 8, 12, 13, 16, 21, 22, 23, 33, 40, 42, 42, 46, 48, 50, 50, 54, 57, 64, 64, 68, 68, 68, 73, 74, 74, 77, 77, 78, 79, 82, 85, 86, 88, 92, 92, 94, 97, 97, 98, 98], [5, 6, 7, 8, 9, 12, 13, 19, 19, 27, 29, 34, 36, 38, 39, 41, 43, 44, 47, 49, 50, 53, 57, 57, 59, 61, 62, 65, 65, 68, 75, 77, 80, 81, 82, 84, 85, 88, 89, 92, 94], [3, 3, 4, 8, 12, 20, 25, 26, 30, 32, 33, 41, 41, 43, 45, 46, 46, 47, 50, 54, 54, 57, 57, 62, 63, 65, 67, 68, 69, 70, 72, 73, 75, 77, 83, 85, 86, 93, 93, 97, 97]], [[52, -18, -36, -28, -14, 92, 80, -48, 28, -18, -46, 76, -96, 4, -50, -80, -40, 34, 36, -66, -66, 48, -8, -36, 10, 26, -46, 80, -22, -90, 66, 82, 22, 30, -32, 96, 30, -4, 70, -92, 90, -26, 18, -48, 72, -88], [14, -90, 60, 50, 54, 78, 46, 26, -46, 94, 46, 42, -48, 96, 18, -84, 42, 16, -58, -96, -80, -66, -50, -32, -48, -8, 34, 42, 40, 34, 12, -34, -94, 18, 60, 30, -48, 8, 30, -24, 10, -26, -12, -58, 62, 96], [-22, -24, -6, 16, 80, 86, -30, -66, 94, 10, -42, 0, -92, -28, 82, -16, -94, -40, 72, -76, 66, -70, 94, 68, -20, -30, 48, 80, -96, -56, -70, -82, -22, -78, 12, -20, -2, 80, -96, -10, 12, -10, 32, 66, 26, 22], [18, 72, 76, 82, -20, -64, 16, 70, 72, 32, -34, -98, -22, 24, -68, 0, -14, -60, -66, 16, -20, -40, -64, 42, 14, -70, -30, 48, 40, 12, -82, -30, -36, -36, 60, -48, 78, -66, 46, -52, 68, -60, 88, -10, -42, 64], [58, -48, 0, 78, -74, 84, -14, 54, -68, 48, 84, -2, -74, -20, 32, 40, 4, 8, 38, -24, 58, 56, 76, -88, -18, 90, -94, -64, -76, -8, -88, -20, -66, -4, -20, -70, 34, 66, 12, 8, -38, 8, 92, -98, -32, -44], [96, -20, 6, -36, 54, -82, -74, -98, -58, -32, -42, 26, 34, 72, -98, -2, 40, -90, 16, -66, 70, -10, 36, -84, 8, -22, -18, 24, -92, 12, 34, 30, -74, 54, 46, 26, -52, -48, -86, 78, 16, -94, -12, -24, 64, -42], [-74, -4, -70, -32, 24, 72, 8, 66, 52, -34, -84, -70, 82, -96, 72, 90, 0, 18, 26, 48, 98, -92, -26, 0, -78, -52, 94, -12, -60, -54, 16, 98, 96, -68, 26, 84, 24, -28, 42, -32, 58, 4, -78, 46, -96, -2], [-74, -46, 62, -52, -30, 36, -52, 64, 66, 4, 18, 76, 8, 82, 90, 72, -64, 24, 86, -46, 72, 58, -10, 46, -8, -20, -18, -24, -4, 52, 96, 44, -18, -84, -64, -56, 76, 54, -84, -12, -32, 52, 62, 10, 52, 68], [-44, 20, 44, -20, 94, 76, 94, -40, 40, -74, -56, 78, 20, 38, -56, -2, -34, -6, -24, -62, 72, -36, 42, 32, 56, 24, 38, 6, 8, -78, -64, -38, 58, -98, 16, 38, 92, -4, -38, -22, -62, 96, 34, 64, -32, -98], [34, -96, -98, 10, 40, 2, 26, 14, 18, -12, -16, 84, -74, 0, -98, 38, -48, 18, 22, -32, -52, -2, 28, -50, 64, 10, 80, 6, 20, 0, 66, 80, 96, 14, 20, -56, 18, 80, -16, 74, -74, 26, -70, 58, 74, 32], [72, -52, 2, -90, -56, 98, -50, 10, -60, 84, 24, -88, -98, -48, 54, 44, -84, 10, -18, 68, 40, 40, -46, -18, 60, -58, -50, 26, 74, -24, -64, -70, 44, -40, 18, -88, -60, 82, -60, 26, -66, -68, 46, 60, 92, 84], [96, 26, -46, 94, -48, 24, 50, -10, 24, -50, 86, -76, -78, 98, -28, -60, -62, -32, -74, -18, 96, -44, -72, -56, 12, -28, 70, -16, 48, -26, 86, -24, 44, 56, 82, -34, 30, 36, -34, 92, -80, -50, -54, -20, -52, 48], [74, -70, 64, -98, -40, -14, -82, 56, 82, -16, -76, -56, 22, 64, -84, -48, 44, 70, 30, 56, -84, -80, -44, -30, -38, 96, 58, -18, 56, -42, -54, 20, -60, 82, -94, -8, 40, -16, -94, -70, 30, -82, 74, 4, -36, -42], [24, -10, 16, -4, 50, -8, 58, -24, -90, -90, 52, 16, 96, 74, 36, -92, -28, -84, 6, 70, 54, 60, 26, 42, 34, 22, 4, -48, -96, 20, 88, 34, 78, 12, -62, -6, 80, 30, 86, 74, 68, -18, 42, -50, -80, 32], [62, 90, 6, 66, -26, -98, -80, 46, -52, -22, 10, -60, 62, 92, 16, 78, 52, 22, 70, 28, 98, 28, -94, 70, -68, -84, 32, -86, 38, -6, -94, 10, -4, -84, 74, 42, -10, -82, 12, -6, -8, 14, -30, 72, 18, 12], [78, -18, 56, 90, -74, 82, 20, -90, 26, 40, -72, -46, -76, 14, -58, 58, 30, -58, -62, -62, 70, -4, -62, -64, -88, 96, 80, 74, 30, 12, 44, 78, 76, 76, -48, -38, -12, 22, -90, 0, -26, 28, 88, 80, 38, 66], [-58, 10, 22, -26, 46, -48, -76, 92, 26, 52, 24, -30, 56, -68, 2, 72, -44, 34, -72, -24, 34, 64, 72, -10, 16, -26, 0, 60, 18, -44, -18, -36, -94, 38, 22, 80, -78, -78, -48, 98, 64, 30, 72, 14, -22, 22], [-30, 82, 38, -2, -60, -28, -4, -36, 22, -64, 48, -14, -26, -10, 62, -10, -68, 54, -6, -26, -32, -66, -84, -12, 56, 42, -64, 14, 86, 76, -24, -36, 38, 98, 56, -14, -52, 44, -44, -88, -26, -10, 14, -2, -12, -14], [-58, 50, 18, 30, 80, 78, 22, 22, 12, 90, 0, -20, 50, 20, 82, -70, -26, -28, -90, 58, -24, 18, 54, 62, 48, 20, 96, -10, 72, 70, -98, 64, -56, 42, 76, 58, -84, -62, 40, -78, -22, -98, 42, 54, -34, 10], [42, 64, -40, -90, -8, -54, -42, 80, -28, -18, 8, 28, -10, 36, 12, 86, 28, -16, 66, 10, 6, 86, 60, -92, -92, -16, -84, -84, -50, 76, -2, 68, 80, -62, 54, -90, -96, 48, 2, -42, 70, 68, -24, 92, 14, -46], [-96, 20, 10, 64, -66, 84, -52, -74, -96, -88, -96, 6, -32, -10, -40, -2, 4, 22, 24, -60, -54, -62, -58, -30, -80, -94, -50, -72, 74, 50, 84, -6, 12, -28, 46, 64, -36, -52, -24, 56, 56, -16, 80, -74, -94, 50], [-66, 62, 46, -38, -50, 78, 2, 96, -50, -2, -64, -86, -26, -4, -92, 78, -16, 64, -74, 6, 34, -54, 40, 62, -8, 30, 46, -88, 68, 52, 46, 84, -90, 6, 86, 58, -70, 86, 54, 80, -6, 30, 44, -6, 2, 42], [-44, -76, 40, -30, -38, 14, -24, -10, -28, -54, 90, -64, 66, 88, 62, 94, -56, 72, 4, 46, 60, 70, -92, -48, -62, -94, 96, -40, 74, -40, -28, -44, 64, -54, 14, -42, -74, -24, 18, 46, -48, 60, 16, -78, -74, -82], [-8, -94, -56, 90, 22, -36, -66, 28, 48, -28, 92, 38, -8, 14, 34, 46, 62, 12, 2, -38, -44, 16, -66, -56, -74, 98, 92, -42, -42, -32, 82, -42, -12, -76, 18, 54, 16, 0, 92, 12, 96, 86, 94, -60, -62, -50], [-14, -88, -20, -60, 36, -90, -24, 90, -24, 70, 10, 22, -10, -88, -90, -72, -60, -62, -58, 98, 24, -52, -70, 82, 84, 24, 94, -16, -70, -16, 84, -34, 72, -42, 66, 36, -38, -20, -22, 12, -30, 48, -2, -58, -26, 56], [52, 40, 28, -48, -80, -58, 50, 34, -94, -24, -94, -24, -44, 4, -90, 84, 84, -66, 76, 36, -62, -22, 8, 32, 24, -86, -52, 16, 52, 24, 66, -16, 38, 54, 56, 92, 84, -46, 88, 22, 92, -58, -14, 12, 82, 92], [-98, 38, 16, 44, -10, 32, 68, -90, 94, -16, -90, 38, 96, -82, 68, -72, -80, -54, -68, 0, 58, -12, 56, -46, 68, 4, -52, 4, 2, -96, -78, 80, 50, 4, 20, 80, 62, -40, -82, -22, 90, 44, 88, 68, -72, 66], [-28, 54, -12, 96, 94, 40, 10, -18, 28, 46, 8, 48, 74, 58, 94, 10, -30, -50, -2, -80, -22, -70, 30, -16, 26, 78, -84, -50, -2, -66, -18, 98, -94, -6, -2, -44, -48, 2, 78, 94, -90, 32, -90, -56, -90, 0], [-36, -40, -28, 94, -96, -16, 8, 12, 94, 52, 52, -56, -66, 86, -10, -68, 38, -16, -72, 94, -68, 26, 58, -74, 22, -84, -50, -8, 32, 66, 20, 94, -44, -74, -72, -96, 38, 64, 4, -72, -66, -54, 44, 92, -52, -62], [-98, -58, -82, -74, 38, -6, -86, -98, -60, 62, 32, -64, 12, 80, -58, 90, -76, -6, -98, 78, -12, -20, 68, -62, 72, -72, 90, -24, -84, -84, 54, 66, 46, 50, 12, 98, -4, -90, -46, 12, 28, 76, -54, -24, -12, -26], [-48, -6, -18, 80, -30, 44, 74, 14, -54, 64, -68, -2, 14, -4, -68, -6, -78, -4, -30, -18, -32, -48, 56, -48, -6, -46, 34, -96, -44, -84, -34, -12, -20, 72, -24, 76, 46, 66, -24, -20, -8, 92, 92, 54, 64, 2], [-30, 26, -76, -38, -72, 36, -32, -22, 8, 40, 72, 12, -58, 6, -94, -70, -44, 56, -88, 76, 50, -8, 76, -74, 2, 54, -48, 56, 56, 60, 72, -30, -42, -54, -28, -80, -64, 82, -32, -42, 2, -32, -48, 64, -66, 26], [66, 72, -98, -62, -18, -42, -50, -20, 62, -96, -24, -90, -58, 82, -76, 0, -12, -66, -48, 26, 42, 12, -8, 46, -56, -16, -2, -94, 16, 90, -34, 48, 34, -44, -66, -70, 44, 66, 6, 74, 50, 96, 32, 64, 82, -10], [84, 48, 94, 32, 44, 26, 64, 24, 28, 88, 42, -54, 82, 34, 16, -14, -46, -94, -76, 88, -38, 42, -60, -8, 4, -70, 24, -60, -82, -96, 40, 20, 98, -2, 32, -24, 54, 52, -44, 78, -58, -16, -32, 56, -20, 52], [34, -90, -10, -10, -8, -28, -34, 46, -86, 20, -90, -78, 94, 72, 92, -4, -30, 84, -32, 84, 16, 94, 92, -40, 46, 58, 38, -8, 14, 58, 58, 38, 0, -30, -30, -40, 90, 12, 26, 56, -62, 40, 8, 16, 70, 4], [-32, 88, 70, 26, 30, 62, -18, -50, -78, -18, 40, -98, -84, -74, -68, 22, 8, 6, -88, 78, 14, 50, -34, -12, -58, 78, 32, -6, 52, 70, -98, 32, 6, -26, 98, -82, -8, -88, -6, -6, 84, -28, -68, 78, 68, 12], [-2, 4, 82, 94, 72, -90, 2, -8, 16, 76, -34, 72, -26, -86, 60, 92, -32, 82, -88, -42, 14, 50, 94, -98, -50, -78, -86, 68, -28, 16, -18, -20, -6, -64, -82, 68, -86, 94, 46, -2, 78, -24, 88, -82, -80, 90], [40, -64, 60, -14, 98, 98, 84, 34, -36, 14, 92, 50, -30, -38, -28, 68, -6, 18, -36, -76, -20, -4, 62, -6, -58, -50, 48, -64, 34, -96, 76, 68, 66, 86, -2, -90, 80, -18, -68, -8, -64, -32, -14, -48, 48, -2], [58, 26, 56, -88, -92, -10, -14, 42, -96, 40, 24, 32, 16, 38, 34, 98, 54, -36, 88, 86, -74, 40, -68, -26, -14, -74, -82, 12, -48, -22, -36, 98, -38, -30, -98, -34, -8, 84, -34, -98, 0, -76, 24, -6, 94, -64], [76, 48, -14, 70, -52, -34, 4, -2, -8, 84, 2, 14, 16, -40, -90, -66, -22, 40, -46, 50, -66, -52, 54, -68, 48, 46, -76, 98, 34, -94, 26, 62, -38, 2, 52, 0, 58, 64, -96, 52, 4, 58, 70, -24, -96, 50], [30, 72, -88, -98, 42, 76, -52, -88, -32, -2, 2, -84, -86, -34, -36, 34, -38, -4, -60, -62, 54, -52, 92, 86, 6, 98, 76, 38, -56, 90, 98, -10, 66, 88, -90, -54, -42, -22, -58, 4, 92, 76, 36, 76, -68, 4], [8, 44, -2, -52, -76, 34, -14, -42, -54, 30, 46, 64, 14, 44, 10, -14, -60, -18, 16, -80, -6, -10, 52, 52, 90, -88, 98, -96, -36, 18, -92, 10, -52, 74, -94, -46, 36, -38, -12, 66, 34, -30, 38, 26, 6, 38], [-84, -22, 4, -52, -12, 40, -14, 44, 70, 80, 72, -16, -38, -44, 16, -16, 82, -90, -14, 24, -98, 92, 52, -50, 40, 96, 76, -16, -28, -28, 28, 10, 0, -22, 16, -62, -34, 28, 94, -72, 20, -30, -20, 40, -24, -76], [-62, 98, -82, 34, 12, 14, -64, -34, -70, -24, -34, -92, 54, 90, -66, -48, -52, -80, -72, -80, -46, -60, 76, -2, 58, -96, 52, 42, 88, 96, -58, -28, -4, 48, 66, -94, 4, 90, 64, -52, 62, 80, -98, 76, 90, -64], [-88, -40, 32, 8, 94, -12, 98, -52, 4, -14, 52, -72, -4, -84, 18, -96, 74, 80, -12, 18, 60, 32, -68, -94, 90, 24, 34, 2, -70, 90, 52, 28, 92, 58, -20, -52, 26, -30, 4, 96, 54, 64, 64, 52, -24, 40], [26, -84, -20, 80, -82, 40, 68, -6, -44, 48, 48, -36, 48, 12, -92, -14, 66, 98, 24, 42, 62, 76, 50, -62, -30, 36, 88, -30, -60, 94, -44, 70, 36, -26, -44, -48, 22, 6, 16, 26, 8, -4, 54, -50, 92, 44]], [[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, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], [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, 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], [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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], [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, 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], [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, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], [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, 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], [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, 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, 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]], [[81, 85, 4, 98, 56, 46, 38, 97, 79, 82, 85, 7, 80, 73, 25, 43, 23, 2, 31, 9, 16, 34, 18, 10, 89], [22, 46, 32, 7, 21, 64, 50, 94, 48, 44, 44, 74, 34, 70, 14, 16, 50, 46, 84, 55, 14, 71, 46, 92, 38], [73, 57, 12, 47, 18, 80, 68, 28, 28, 21, 10, 76, 10, 23, 30, 16, 34, 78, 38, 86, 73, 50, 63, 68, 23], [32, 49, 77, 70, 75, 40, 3, 18, 23, 69, 51, 36, 73, 64, 54, 8, 44, 55, 63, 97, 37, 83, 97, 5, 92], [79, 81, 22, 50, 43, 76, 4, 17, 78, 58, 48, 17, 84, 11, 65, 37, 33, 75, 51, 91, 26, 80, 79, 14, 61], [73, 21, 41, 90, 65, 33, 41, 63, 58, 78, 71, 8, 41, 2, 56, 88, 78, 56, 70, 36, 94, 16, 40, 40, 24], [93, 81, 96, 8, 40, 57, 17, 29, 95, 31, 42, 70, 73, 58, 63, 66, 44, 8, 76, 4, 30, 9, 73, 30, 57], [60, 65, 25, 64, 74, 5, 58, 33, 50, 64, 59, 18, 78, 18, 80, 81, 46, 18, 71, 13, 13, 27, 14, 4, 96], [97, 55, 80, 68, 84, 54, 56, 13, 59, 47, 59, 60, 60, 33, 90, 26, 26, 31, 2, 92, 59, 96, 69, 90, 78], [17, 57, 22, 75, 4, 25, 11, 46, 48, 81, 10, 44, 46, 90, 54, 47, 28, 10, 89, 12, 44, 37, 36, 59, 37], [41, 5, 42, 76, 18, 86, 15, 31, 20, 18, 59, 24, 11, 3, 84, 95, 36, 72, 68, 77, 93, 26, 23, 46, 96], [57, 2, 76, 61, 78, 77, 68, 57, 74, 23, 80, 89, 58, 76, 89, 1, 21, 37, 38, 89, 10, 23, 65, 81, 24], [53, 40, 5, 49, 23, 54, 48, 71, 45, 56, 70, 95, 93, 28, 74, 97, 71, 43, 26, 77, 59, 69, 57, 24, 61], [8, 94, 80, 64, 93, 48, 15, 13, 9, 28, 22, 89, 46, 32, 39, 88, 25, 94, 61, 94, 41, 96, 18, 33, 68], [55, 12, 55, 98, 37, 89, 10, 59, 37, 2, 9, 61, 7, 60, 56, 43, 60, 72, 87, 13, 3, 53, 24, 69, 51], [81, 44, 2, 90, 81, 75, 56, 15, 23, 16, 51, 80, 72, 77, 88, 54, 6, 66, 18, 15, 23, 50, 95, 3, 10], [20, 24, 35, 36, 38, 44, 43, 56, 39, 90, 78, 13, 88, 19, 5, 89, 11, 67, 25, 70, 41, 21, 47, 44, 46], [1, 58, 92, 87, 51, 24, 53, 71, 79, 25, 62, 74, 8, 69, 32, 73, 68, 26, 12, 84, 7, 4, 21, 11, 64], [38, 69, 28, 6, 5, 64, 25, 11, 77, 56, 49, 62, 61, 28, 2, 93, 60, 63, 77, 83, 37, 79, 24, 61, 71], [59, 21, 91, 87, 47, 14, 49, 70, 8, 67, 25, 13, 73, 24, 28, 46, 94, 75, 45, 18, 64, 16, 45, 97, 72], [84, 26, 36, 48, 75, 67, 66, 58, 81, 83, 71, 88, 31, 60, 67, 30, 22, 39, 49, 46, 75, 53, 25, 54, 95], [37, 14, 8, 10, 99, 13, 27, 16, 17, 29, 28, 14, 11, 55, 40, 68, 7, 58, 27, 6, 33, 27, 28, 36, 6], [28, 3, 96, 18, 96, 58, 15, 46, 63, 70, 38, 76, 89, 71, 16, 68, 69, 3, 2, 52, 1, 78, 26, 24, 28], [98, 37, 55, 48, 7, 9, 40, 97, 73, 46, 38, 9, 56, 14, 73, 33, 38, 3, 48, 81, 66, 91, 14, 55, 41], [42, 34, 27, 88, 76, 14, 69, 45, 7, 93, 56, 23, 36, 24, 90, 93, 91, 3, 49, 54, 5, 80, 31, 65, 66]], [[-68, -68, -50, -30, 0, 36, 44, 46, 56, 80], [-88, -84, -80, -54, -30, -16, 44, 80, 80, 82], [-78, -66, -46, -44, 2, 42, 52, 56, 62, 92], [-96, -80, -56, -32, -14, 0, 2, 20, 30, 92], [-80, -78, -46, -16, -12, -6, 26, 66, 72, 98], [-62, -52, -52, -22, -12, 2, 10, 42, 90, 96], [-88, -74, -74, -64, -54, -52, 2, 34, 78, 82], [-78, -26, 8, 14, 42, 42, 76, 78, 86, 96], [-78, -70, -68, -22, -12, 20, 58, 60, 84, 98], [-98, -56, -48, -20, -20, 10, 48, 60, 60, 86]], [[0, 0, 1, 1, 0, 1, 1], [0, 1, 0, 1, 1, 0, 0], [1, 1, 1, 1, 0, 1, 0], [0, 0, 1, 0, 0, 0, 1], [1, 0, 1, 0, 0, 0, 0], [1, 1, 1, 1, 1, 1, 0], [1, 0, 0, 1, 1, 0, 1]], [[4, 5, 8, 14, 14, 15, 16, 18, 18, 19, 21, 23, 30, 31, 33, 36, 38, 39, 40, 45, 47, 50, 55, 57, 59, 59, 62, 63, 63, 68, 69, 70, 70, 73, 73, 77, 80, 81, 83, 85, 88, 90, 91, 97, 97], [1, 2, 2, 3, 7, 8, 11, 12, 15, 18, 27, 29, 31, 32, 35, 39, 43, 46, 47, 49, 50, 52, 54, 56, 56, 56, 57, 57, 60, 61, 62, 68, 68, 71, 77, 78, 79, 81, 81, 87, 87, 88, 89, 92, 93], [1, 7, 11, 15, 16, 18, 27, 27, 29, 29, 29, 31, 34, 39, 43, 44, 47, 52, 52, 55, 55, 56, 62, 68, 70, 72, 73, 73, 75, 76, 77, 78, 81, 84, 84, 87, 87, 88, 89, 90, 91, 91, 94, 96, 98], [3, 3, 4, 12, 16, 17, 17, 19, 28, 28, 29, 29, 30, 30, 31, 31, 33, 33, 36, 44, 44, 44, 45, 45, 53, 54, 54, 54, 57, 63, 64, 66, 67, 69, 69, 75, 78, 79, 82, 87, 91, 92, 95, 95, 99], [1, 1, 2, 5, 6, 9, 10, 11, 16, 17, 18, 20, 24, 25, 25, 26, 26, 26, 28, 29, 30, 35, 36, 36, 46, 47, 53, 57, 58, 58, 61, 61, 62, 71, 73, 75, 80, 81, 87, 87, 89, 90, 91, 96, 99], [4, 8, 14, 17, 17, 21, 24, 27, 29, 31, 34, 36, 37, 37, 40, 41, 42, 44, 44, 45, 46, 47, 50, 54, 63, 64, 65, 68, 73, 73, 73, 76, 77, 79, 80, 82, 82, 83, 84, 88, 90, 93, 93, 95, 95], [1, 5, 9, 10, 10, 12, 13, 15, 16, 17, 17, 24, 25, 26, 29, 32, 34, 36, 37, 43, 44, 49, 53, 54, 54, 56, 57, 65, 70, 72, 72, 76, 77, 78, 78, 80, 80, 80, 83, 86, 90, 90, 94, 96, 97], [5, 9, 10, 10, 10, 11, 11, 11, 15, 18, 18, 19, 24, 26, 31, 31, 33, 36, 41, 43, 43, 45, 50, 51, 54, 54, 54, 62, 64, 64, 66, 71, 71, 72, 73, 73, 79, 82, 83, 84, 86, 88, 93, 96, 97], [1, 3, 7, 9, 9, 10, 13, 15, 16, 22, 22, 24, 24, 26, 34, 36, 38, 38, 39, 40, 40, 41, 43, 45, 49, 53, 58, 60, 64, 67, 69, 70, 75, 77, 80, 81, 84, 84, 85, 85, 86, 89, 93, 97, 99], [3, 4, 5, 6, 7, 11, 11, 11, 13, 13, 15, 16, 19, 20, 21, 25, 25, 26, 27, 29, 38, 39, 44, 44, 50, 51, 51, 54, 54, 54, 61, 62, 65, 67, 68, 71, 71, 73, 73, 75, 77, 89, 89, 93, 95], [3, 5, 8, 13, 14, 15, 20, 23, 25, 25, 27, 28, 28, 29, 37, 38, 41, 42, 44, 45, 47, 48, 50, 54, 61, 64, 64, 71, 72, 74, 76, 76, 79, 79, 79, 80, 81, 81, 82, 83, 84, 95, 95, 95, 96], [4, 5, 7, 8, 9, 10, 13, 14, 17, 19, 20, 27, 28, 29, 34, 36, 37, 38, 38, 42, 42, 43, 44, 45, 45, 47, 52, 52, 53, 59, 60, 62, 67, 69, 73, 80, 82, 83, 83, 84, 88, 92, 95, 98, 99], [1, 6, 8, 10, 14, 14, 15, 17, 20, 20, 20, 20, 22, 34, 36, 42, 43, 47, 47, 48, 52, 53, 55, 56, 57, 59, 61, 65, 67, 69, 73, 74, 77, 78, 81, 81, 82, 84, 84, 84, 91, 93, 94, 98, 98], [2, 5, 8, 8, 10, 10, 11, 15, 16, 16, 18, 18, 18, 20, 21, 23, 37, 40, 41, 41, 42, 44, 46, 48, 50, 50, 52, 53, 59, 68, 68, 70, 73, 73, 74, 77, 77, 83, 86, 88, 92, 92, 94, 97, 99], [3, 4, 6, 6, 10, 11, 12, 13, 13, 15, 15, 17, 22, 23, 25, 28, 30, 37, 42, 43, 44, 46, 46, 52, 52, 53, 57, 57, 58, 58, 58, 59, 60, 60, 60, 63, 63, 67, 69, 69, 73, 74, 74, 75, 87], [3, 4, 4, 7, 8, 11, 12, 14, 20, 22, 23, 24, 24, 31, 32, 39, 41, 42, 45, 45, 47, 47, 51, 57, 57, 61, 62, 62, 64, 65, 66, 67, 69, 72, 72, 72, 80, 81, 85, 88, 91, 95, 96, 99, 99], [3, 5, 6, 8, 8, 8, 11, 12, 15, 17, 19, 19, 19, 22, 22, 23, 26, 27, 30, 34, 35, 36, 38, 46, 51, 51, 55, 59, 62, 62, 65, 66, 71, 73, 75, 77, 78, 86, 89, 90, 94, 95, 96, 96, 96], [3, 8, 9, 11, 13, 18, 18, 20, 21, 23, 23, 25, 27, 29, 32, 33, 36, 36, 44, 47, 49, 53, 58, 63, 64, 64, 66, 68, 68, 70, 71, 72, 72, 73, 74, 75, 75, 81, 82, 84, 85, 86, 88, 88, 96], [3, 5, 5, 7, 16, 16, 18, 18, 19, 20, 28, 31, 32, 35, 37, 38, 39, 39, 48, 49, 54, 60, 61, 67, 68, 70, 75, 75, 77, 78, 81, 82, 83, 83, 86, 87, 88, 89, 91, 91, 93, 97, 97, 97, 97], [2, 2, 3, 5, 11, 16, 18, 19, 20, 22, 22, 24, 24, 26, 26, 29, 33, 34, 35, 37, 41, 41, 44, 44, 45, 56, 56, 57, 57, 59, 64, 64, 70, 77, 80, 80, 83, 88, 89, 93, 94, 95, 96, 96, 98], [1, 3, 5, 6, 12, 16, 18, 21, 22, 23, 26, 29, 33, 37, 39, 40, 43, 46, 47, 53, 57, 57, 60, 61, 63, 63, 64, 65, 66, 67, 71, 71, 72, 72, 77, 81, 84, 85, 87, 93, 94, 95, 96, 97, 99], [3, 4, 6, 7, 10, 11, 16, 18, 19, 21, 22, 22, 32, 33, 34, 34, 36, 39, 40, 41, 42, 44, 47, 49, 49, 50, 54, 56, 63, 66, 71, 72, 73, 74, 74, 78, 79, 82, 83, 86, 89, 91, 92, 92, 93], [3, 4, 4, 5, 8, 15, 16, 19, 19, 20, 31, 32, 34, 34, 39, 40, 42, 45, 45, 47, 48, 48, 49, 52, 55, 60, 62, 62, 64, 68, 70, 73, 73, 74, 75, 77, 77, 81, 81, 83, 86, 90, 91, 94, 94], [4, 5, 12, 15, 16, 16, 17, 20, 24, 24, 25, 25, 25, 28, 30, 30, 33, 37, 39, 41, 42, 48, 50, 51, 51, 54, 57, 62, 63, 65, 66, 68, 69, 72, 72, 72, 72, 74, 75, 75, 77, 86, 88, 92, 92], [2, 3, 7, 7, 8, 11, 11, 12, 12, 14, 17, 17, 17, 21, 21, 23, 27, 27, 30, 31, 33, 36, 45, 46, 48, 48, 49, 51, 53, 55, 58, 59, 61, 65, 68, 69, 71, 84, 84, 84, 90, 94, 97, 98, 99], [1, 4, 7, 7, 10, 10, 12, 14, 15, 15, 16, 20, 21, 28, 28, 28, 29, 29, 35, 40, 43, 45, 48, 49, 51, 52, 56, 56, 66, 67, 69, 69, 70, 71, 73, 74, 78, 79, 82, 86, 89, 92, 96, 98, 98], [4, 5, 6, 9, 9, 9, 13, 15, 17, 23, 23, 28, 33, 34, 34, 35, 35, 40, 42, 43, 46, 50, 52, 55, 57, 60, 64, 67, 72, 72, 75, 75, 77, 77, 79, 79, 81, 81, 82, 86, 86, 90, 91, 95, 97], [1, 4, 4, 5, 5, 6, 7, 9, 9, 9, 10, 11, 15, 15, 21, 22, 26, 26, 29, 31, 31, 34, 38, 40, 40, 42, 43, 44, 45, 49, 50, 52, 54, 55, 57, 62, 66, 68, 69, 70, 72, 82, 85, 86, 90], [3, 4, 6, 8, 8, 9, 10, 11, 15, 22, 22, 26, 26, 27, 29, 31, 37, 38, 41, 41, 43, 43, 47, 47, 48, 50, 53, 54, 55, 56, 60, 63, 63, 67, 68, 70, 71, 75, 76, 84, 87, 87, 91, 95, 98], [2, 7, 8, 16, 17, 17, 23, 26, 26, 28, 31, 35, 36, 38, 39, 43, 48, 49, 53, 58, 59, 60, 68, 68, 70, 70, 71, 73, 73, 74, 76, 77, 77, 79, 79, 82, 82, 82, 82, 87, 88, 89, 90, 90, 98], [3, 3, 10, 12, 16, 17, 20, 21, 22, 24, 25, 27, 28, 31, 32, 33, 34, 35, 35, 38, 39, 40, 42, 45, 48, 51, 52, 54, 56, 61, 63, 63, 66, 67, 68, 69, 74, 75, 76, 78, 79, 87, 91, 91, 92], [4, 6, 8, 8, 14, 17, 23, 23, 25, 25, 27, 27, 30, 30, 34, 35, 38, 40, 42, 48, 49, 51, 52, 53, 57, 57, 58, 58, 59, 67, 70, 71, 75, 76, 77, 78, 82, 84, 85, 87, 94, 94, 96, 97, 98], [2, 4, 4, 4, 4, 6, 8, 10, 13, 14, 15, 18, 20, 23, 24, 26, 27, 29, 33, 35, 39, 40, 41, 42, 46, 48, 49, 52, 56, 62, 64, 68, 71, 76, 77, 77, 78, 79, 84, 92, 94, 95, 95, 97, 98], [1, 7, 8, 9, 12, 12, 14, 14, 16, 19, 23, 25, 27, 27, 27, 28, 29, 29, 33, 33, 41, 44, 45, 46, 51, 51, 52, 56, 57, 58, 59, 60, 64, 68, 69, 70, 73, 80, 82, 82, 86, 87, 90, 98, 98], [2, 5, 18, 19, 20, 23, 26, 27, 33, 36, 45, 46, 51, 52, 53, 56, 58, 60, 63, 68, 71, 71, 72, 73, 75, 76, 76, 80, 80, 81, 81, 84, 87, 89, 91, 92, 92, 92, 93, 93, 94, 95, 98, 98, 99], [1, 1, 5, 5, 5, 6, 10, 10, 15, 16, 17, 22, 29, 31, 42, 48, 49, 49, 49, 53, 54, 54, 55, 56, 56, 59, 60, 62, 62, 64, 72, 72, 73, 75, 77, 81, 82, 82, 86, 89, 90, 91, 97, 97, 99], [3, 5, 8, 9, 10, 13, 14, 14, 16, 26, 26, 29, 30, 32, 36, 37, 42, 42, 44, 45, 45, 47, 47, 49, 52, 53, 54, 57, 58, 62, 63, 64, 65, 65, 67, 69, 69, 69, 70, 75, 76, 76, 80, 86, 86], [1, 2, 4, 8, 8, 11, 12, 16, 21, 28, 30, 30, 30, 32, 36, 37, 38, 39, 40, 43, 46, 49, 49, 50, 55, 57, 60, 60, 61, 64, 65, 66, 73, 78, 79, 80, 80, 83, 86, 86, 87, 89, 90, 93, 98], [8, 8, 11, 14, 16, 16, 17, 23, 24, 29, 31, 38, 38, 39, 40, 40, 48, 51, 60, 60, 62, 65, 65, 67, 67, 68, 70, 71, 73, 73, 74, 75, 78, 79, 80, 81, 83, 83, 86, 87, 91, 92, 93, 93, 98], [1, 3, 7, 10, 10, 11, 13, 14, 18, 18, 20, 21, 22, 25, 27, 27, 28, 30, 37, 38, 44, 48, 50, 52, 55, 57, 60, 63, 64, 65, 67, 71, 74, 75, 77, 79, 79, 85, 86, 90, 93, 94, 96, 98, 99], [1, 4, 7, 11, 13, 15, 15, 16, 19, 21, 25, 27, 38, 43, 43, 48, 48, 49, 49, 52, 53, 54, 56, 57, 61, 61, 64, 64, 65, 66, 68, 68, 69, 70, 71, 71, 73, 76, 81, 83, 91, 94, 95, 96, 99], [1, 2, 4, 11, 12, 12, 15, 17, 20, 22, 28, 30, 31, 31, 31, 38, 38, 38, 41, 48, 48, 50, 51, 51, 51, 57, 59, 62, 68, 73, 75, 78, 81, 83, 86, 90, 90, 90, 92, 92, 94, 94, 96, 97, 98], [3, 7, 11, 11, 13, 13, 13, 20, 20, 23, 24, 25, 30, 31, 31, 31, 34, 34, 36, 39, 42, 42, 47, 56, 57, 60, 65, 65, 66, 72, 72, 73, 73, 75, 75, 78, 79, 83, 87, 87, 93, 93, 95, 96, 99], [1, 2, 3, 4, 5, 6, 10, 11, 12, 14, 18, 20, 22, 24, 24, 26, 26, 31, 34, 35, 36, 38, 45, 45, 45, 45, 46, 47, 48, 52, 55, 57, 60, 63, 66, 76, 81, 82, 86, 86, 89, 90, 93, 95, 96], [2, 2, 5, 8, 13, 16, 22, 23, 27, 28, 30, 31, 36, 39, 40, 45, 46, 49, 51, 54, 57, 57, 57, 58, 59, 60, 61, 63, 67, 70, 70, 72, 74, 75, 75, 81, 82, 85, 86, 88, 91, 92, 92, 93, 99]], [[-90, 64, -52, -42, 98, 50, -60, -30, -34, -42, -58, -10, 68, 24, 76, -32, 14, -64, 10, 30, -8, 74, -40, 4, -34, 48, 8, 74, 54, -8, -86, 34, -32, -10, -94, 0, 16, -6, -40, -94, -84], [68, 62, 98, 88, 98, -60, -84, 0, 32, -28, 4, -6, 84, -32, -40, -48, 50, -88, 2, 42, -56, 4, -46, -66, 38, 26, -80, 82, 74, -70, -4, -12, 74, -32, -12, 44, -94, -72, 78, -62, 16], [-76, -32, 58, 48, -38, -38, 46, -74, 12, -88, 82, 0, 8, 44, 22, -68, 34, 48, 74, 4, 48, -82, -96, 40, -78, -80, 26, 22, 36, -22, -36, 88, 10, 14, -98, 22, 4, 72, -72, 10, 56], [-26, -32, -86, 86, 22, -50, 56, 30, -30, -44, 10, 58, 60, -82, 8, 50, -10, 8, 80, 68, 34, -14, -96, 24, -8, -24, 52, 70, 80, -90, -22, -62, -4, 20, -30, -4, -38, 90, 18, 58, 36], [98, -2, 62, -16, -48, 78, 14, 24, 90, 12, -98, -40, -16, 0, 10, 96, -90, 56, 8, 10, -56, 90, -46, -84, 86, 66, -16, 84, -92, 26, -84, -94, -22, -94, 16, -68, -18, 24, -50, -80, 40], [-52, 16, -58, 10, -76, -90, -6, 98, 22, 14, 66, -16, -14, 72, 34, -90, -92, -34, 42, -34, 66, 18, 18, 38, 28, -30, -10, -50, 46, 50, -98, 30, -80, -20, 8, -82, -4, -10, -82, 22, 20], [68, 14, 62, -22, 10, -78, -48, 84, -96, 96, -54, 6, 92, 38, 52, 16, 48, 80, -28, 46, 64, 20, 80, -46, -88, -98, -46, -14, -28, 40, 78, 96, -26, 10, 62, -82, -22, -76, 82, -60, -72], [36, -30, -78, 80, 10, 54, -60, -84, 8, -54, 22, 96, 36, -38, -10, 56, -86, 40, -62, -48, -18, 78, -40, -86, 36, 46, 74, 66, -10, 32, -98, -18, -82, -6, -34, 88, 4, -2, 38, 96, -90], [44, -54, -40, -4, 68, -74, -12, 22, 16, 32, -66, -92, -70, 40, -34, 58, 68, -86, 34, -40, -72, 30, -52, 56, -88, 58, 84, 28, -88, 64, 36, 26, 52, 88, -28, 34, -28, -42, -88, 46, -26], [58, 56, 24, 22, -50, -26, 44, -42, -80, -44, -96, 58, -50, -40, -38, -32, 34, 84, 0, -62, 16, 18, -10, 94, 8, 50, -78, 20, 8, -16, -94, 78, 30, 86, -4, -54, 0, -44, 56, 46, 30], [-44, 2, 14, 56, -2, 20, -14, 20, 24, -90, 40, -90, -6, 90, -22, -64, -64, -8, -58, 62, -48, -84, -44, -78, 80, 68, -74, 6, -42, 52, 14, 40, 2, -44, 24, -76, -92, 82, 6, 6, 94], [80, -84, -8, 90, -72, 88, -58, 98, 30, -28, -84, -98, 14, -90, 2, 50, 2" MAXIMUM_VALUE_CHOICE_EITHER_DIVIDING_CONSIDERING,"static int f_filled ( int n ) { int res [ ] = new int [ n + 1 ] ; res [ 0 ] = 0 ; res [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) res [ i ] = Math . max ( i , ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ) ; return res [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 24, 57, 152, 192, 114, 83, 5, 3, 4]; int [] param0 = [3, 19, 39, 89, 96, 68, 48, 5, 3, 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); } " FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS_1,"static int f_filled ( int arr [ ] , int n , int x , int y ) { int i = 0 ; int min_dist = Integer . MAX_VALUE ; int prev = 0 ; for ( i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == x || arr [ i ] == y ) { prev = i ; break ; } } for ( ; i < n ; i ++ ) { if ( arr [ i ] == x || arr [ i ] == y ) { if ( arr [ prev ] != arr [ i ] && ( i - prev ) < min_dist ) { min_dist = i - prev ; prev = i ; } else prev = i ; } } return min_dist ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [11, 4, 2147483647, 12, 1, 1, 18, 2147483647, 2147483647, 2147483647]; int [] [] param0 = [[4, 7, 7, 8, 11, 14, 16, 25, 34, 35, 36, 36, 38, 40, 41, 43, 45, 47, 57, 60, 64, 72, 73, 74, 75, 82, 83, 83, 84, 84, 84, 92], [96, 70, 88, -64, -42, 58, 92, 66, -14, 90, -66, 12, 88, -12, 48, -4, 90, 24, 98, 14, 32, 38, 98, 78, 2, 26, 12, -36, 90, 80, 40, 58, 88, 64, 16], [0, 0, 1], [46, 96, 82, 73, 30, 36, 56, 20, 5, 36, 4, 7, 89, 63, 54, 97, 80, 56, 93, 34, 90, 56, 25, 27, 75, 68, 14, 90], [-96, -88, -82, -66, -62, -52, -52, -46, -46, -40, -40, -28, -24, -12, 0, 4, 10, 24, 42, 46, 48, 48, 50, 60, 62, 64, 64, 70, 92, 98], [0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1], [1, 2, 2, 6, 10, 14, 15, 18, 19, 22, 23, 29, 30, 37, 40, 40, 41, 41, 42, 42, 44, 46, 46, 54, 56, 72, 73, 81, 83, 83, 86, 88, 93], [46, 86, -52, 18, -32, 86, 2, 38, 72, 72, -60, 70, -58, 66, -66, -72, -74, 58, 52, 58, 16, 64, 62, -62, 80, -70, -96, -44, -20, -74, -10, 14, -32, 48, 30, 76, -16, 80, 66, -46, -92, 26, -86, 28, -76, -24, -98, 54, 50], [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], [32, 65, 10, 72, 17, 58, 79, 28, 67, 36, 18, 35]]; int [] param1 = [22, 25, 1, 26, 24, 10, 27, 30, 38, 7]; int [] param2 = [7, 58, 1, 54, 0, 0, 1, 25, 0, 10]; int [] param3 = [40, 70, 1, 82, 4, 1, 42, 45, 0, 7]; 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_EXPRESSION_DUPLICATE_PARENTHESIS_NOT,"static boolean f_filled ( String s ) { Stack < Character > Stack = new Stack < > ( ) ; char [ ] str = s . toCharArray ( ) ; for ( char ch : str ) { if ( ch == ')' ) { char top = Stack . peek ( ) ; Stack . pop ( ) ; int elementsInside = 0 ; while ( top != '(' ) { elementsInside ++ ; top = Stack . peek ( ) ; Stack . pop ( ) ; } if ( elementsInside < 1 ) { return true ; } } else { Stack . push ( ch ) ; } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, false, false, false, false, false, false, false]; string [] param0 = [""((a+b)+((c+d)))"", ""(((a+(b)))+(c+d))"", ""(((a+(b))+c+d))"", ""((a+b)+(c+d))"", ""(8582007)"", ""((a+(b))+(c+d))"", ""(pylsshedkae)"", ""886980680541"", ""001"", ""jsvmfeoq""]; 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_PRODUCT_OF_A_TRIPLET_IN_ARRAY,"static int f_filled ( int [ ] arr , int n ) { if ( n < 3 ) return - 1 ; int max_product = Integer . MIN_VALUE ; for ( int i = 0 ; i < n - 2 ; i ++ ) for ( int j = i + 1 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) max_product = Math . max ( max_product , arr [ i ] * arr [ j ] * arr [ k ] ) ; return max_product ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 921984, -1, 931491, 69440, 1, 230400, 740880, 0, 477360]; int [] [] param0 = [[41, 66, 77], [92, -34, -36, -50, 20, -94, 2, -86, 22, -50, 74, 84, 52, -84, 98, -50, 88, 26, -36, -36, 6, -50, -48, -84, 38, -96, -62, 34, 52, 92, 40, -84, 18, -90, 54, -38, -74, -98, -8, -92, -60, 86, -36, 94, 56], [0, 0, 1], [2, 77, 99, 95, 78, 15, 69, 39, 34, 43, 66, 45, 97, 27, 67, 62, 64, 2, 28, 94, 41, 87, 97, 52, 14, 61, 78, 50], [-62, -28, 40, 76], [0, 1, 1, 0, 1, 1, 1, 1, 1], [2, 6, 10, 11, 12, 12, 17, 18, 18, 19, 20, 22, 24, 25, 30, 35, 36, 37, 40, 41, 42, 47, 60, 60, 64, 69, 69, 70, 73, 79, 80, 83, 97, 97, 97], [-72, 98, 68, 18, 92, -84, 50, 32, -90, -40, 50, 60, -50, -50, 50, 24, 30, 94, -98, -6, 46, -46, -24, -62, -20, 62, -76], [0, 0, 0, 0, 0, 1, 1, 1], [85, 36, 7, 69, 9, 45, 18, 47, 1, 78, 72, 53, 37, 20, 95, 71, 58, 41]]; int [] param1 = [2, 40, 1, 26, 3, 5, 25, 14, 7, 14]; 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); } " PAINTING_FENCE_ALGORITHM,"static long f_filled ( int n , int k ) { long total = k ; long mod = 1000000007 ; long same = 0 , diff = k ; for ( int i = 2 ; i <= n ; i ++ ) { same = diff ; diff = total * ( k - 1 ) ; diff = diff % mod ; total = ( same + diff ) % mod ; } return total ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [725841870, 370622679, 7554776, 76740139, 647498520, 70208793, 227130467, 204618786, 797370673, 903959704]; int [] param0 = [6, 23, 89, 63, 23, 44, 81, 43, 9, 41]; int [] param1 = [30, 87, 31, 36, 68, 66, 18, 73, 42, 98]; 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_INDEX_0_REPLACED_1_GET_LONGEST_CONTINUOUS_SEQUENCE_1S_BINARY_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int max_count = 0 ; int max_index = 0 ; int prev_zero = - 1 ; int prev_prev_zero = - 1 ; for ( int curr = 0 ; curr < n ; ++ curr ) { if ( arr [ curr ] == 0 ) { if ( curr - prev_prev_zero > max_count ) { max_count = curr - prev_prev_zero ; max_index = prev_zero ; } prev_prev_zero = prev_zero ; prev_zero = curr ; } } if ( n - prev_prev_zero > max_count ) max_index = prev_zero ; return max_index ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 3, 28, -1, -1, 2, -1, -1, 8, -1]; int [] [] param0 = [[2, 8, 9, 13, 13, 19, 19, 21, 21, 24, 28, 28, 29, 29, 29, 32, 34, 38, 39, 43, 45, 46, 57, 59, 62, 63, 67, 67, 68, 69, 70, 70, 71, 72, 74, 74, 76, 78, 79, 81, 90, 90, 95, 96, 98], [28, 92, -16, 0, 6, 12, -88, 42, -48, 72, 2, -38, 80, 82, 96, 32, -42, -38, 62, -76, 20, -10, 2, -48, 4, 88, -24, -72, 32, -42, -48, -62, 38], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [70, 83, 9, 51, 11, 81, 27, 26, 37, 46], [50, 88], [0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1], [96], [18, 78, 14, 60, -12, -86, 32, 74, 74, 96, 58, 28, -42, 28, -18, -58, -82, -58, 22, 6, 2, -6, -4, -98], [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], [58, 22, 15, 85, 8, 74, 93, 76, 44, 51, 43, 93, 20, 51, 52, 35, 17, 13, 96, 82, 23, 51, 44, 18, 45, 79, 66, 48, 16, 31, 62, 99, 46, 66, 53, 89, 87, 2, 87, 20, 30]]; int [] param1 = [36, 20, 39, 7, 1, 6, 0, 21, 19, 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); } " FIND_INDEX_GIVEN_FIBONACCI_NUMBER_CONSTANT_TIME_1,"static int f_filled ( int n ) { float fibo = 2.078087F * ( float ) Math . log ( n ) + 1.672276F ; return Math . round ( fibo ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 11, 9, 8, 11, 11, 10, 10, 8, 4]; int [] param0 = [20, 95, 39, 21, 94, 79, 56, 62, 23, 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); } " LENGTH_OF_THE_LONGEST_ARITHMATIC_PROGRESSION_IN_A_SORTED_ARRAY,"static int f_filled ( int set [ ] , int n ) { if ( n <= 2 ) return n ; int L [ ] [ ] = new int [ n ] [ n ] ; int llap = 2 ; for ( int i = 0 ; i < n ; i ++ ) L [ i ] [ n - 1 ] = 2 ; for ( int j = n - 2 ; j >= 1 ; j -- ) { int i = j - 1 , k = j + 1 ; while ( i >= 0 && k <= n - 1 ) { if ( set [ i ] + set [ k ] < 2 * set [ j ] ) k ++ ; else if ( set [ i ] + set [ k ] > 2 * set [ j ] ) { L [ i ] [ j ] = 2 ; i -- ; } else { L [ i ] [ j ] = L [ j ] [ k ] + 1 ; llap = Math . max ( llap , L [ i ] [ j ] ) ; i -- ; k ++ ; } } while ( i >= 0 ) { L [ i ] [ j ] = 2 ; i -- ; } } return llap ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 2, 4, 1, 3, 4, 3, 3, 15, 2]; int [] [] param0 = [[3, 4, 4, 7, 8, 19, 21, 22, 25, 27, 28, 29, 38, 40, 41, 42, 43, 46, 50, 50, 53, 53, 54, 55, 60, 64, 64, 69, 70, 75, 77, 81, 81, 82, 86, 87, 87, 88, 91, 94, 97], [40, -6, 50, -18, 42, 78, 38, -90, -44, -42, -86, 78, -68, 2, -32, -20, -44, 54, 80, 54, 70, 26, 82, -14, -74, -20, 74, 82], [0, 0, 0, 0, 1, 1, 1], [76, 80], [-92, -90, -88, -76, -76, -60, -46, -40, -24, -8, -8, -6, 2, 12, 36, 38, 58, 76, 80], [1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1], [5, 8, 11, 27, 27, 32, 32, 37, 50, 51, 55, 61, 62, 68, 73, 83], [52, -74, -32, -64, -52, -60, -70, 36, 70, 40, 40, -18, 90, -70, -82, -64, -8, -6, 36, 4, -58, 62, -96, 78, 36, 90, -70, -6, -84, 24, 84, 32, -90, 36, 70, -60, -56, 78, 48, 34, -16, 80, 82, 58, 14, -6, -8, 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], [11, 21, 76, 45, 8, 49, 97, 66, 17, 11, 87, 4, 34, 89, 79, 88, 6, 91, 19, 56, 91, 25, 17, 90, 26, 59, 34, 32, 43, 17, 98, 39, 72, 78, 93, 43]]; int [] param1 = [27, 21, 5, 1, 13, 15, 8, 29, 27, 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); } " FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY,"static int f_filled ( int arr1 [ ] , int arr2 [ ] , int n ) { for ( int i = 0 ; i < n ; i ++ ) if ( arr1 [ i ] != arr2 [ i ] ) return i ; return n ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 2, 0, 0, 24, 0]; int [] [] param0 = [[1, 6, 7, 10, 11, 12, 12, 16, 17, 29, 32, 33, 35, 35, 45, 49, 52, 56, 57, 58, 61, 62, 63, 64, 68, 71, 71, 77, 79, 79, 81, 82, 82, 83, 83, 89, 89, 93, 94, 94], [-48, -92, 96, -18, 10, -24, -4, 96, -16, -78, 4, -80, -96, -28, -78, 68, 2, -60, 0], [1], [68, 98, 21, 29, 71, 49], [-80, -76, -76, -76, -68, -66, -56, -44, -38, -28, -24, -10, 8, 14, 16, 18, 24, 26, 30, 32, 50, 64, 76, 80, 90, 94, 94, 94], [0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1], [3, 7, 16, 17, 20, 22, 29, 32, 34, 34, 35, 40, 40, 40, 41, 46, 49, 58, 60, 62, 63, 64, 64, 68, 70, 73, 76, 79, 83, 86, 90, 92, 99], [18, -68, -6, -32, -76, -86, -8, 76, -46, 20, -80, 54, -88, -58, -48, -66, -66, 18, -28, -74, -72, -26, -92, -78, 24, -22, -80, -80, 82, -2, -72, -88, -54, -84, -8], [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], [74, 75, 52, 58, 34, 53, 51, 45, 34, 28, 53, 94, 10, 20, 23, 12, 95, 78, 48, 11]]; int [] [] param1 = [[3, 12, 13, 14, 15, 17, 18, 19, 22, 24, 28, 29, 33, 37, 41, 42, 44, 49, 51, 51, 52, 53, 56, 56, 59, 60, 64, 64, 67, 70, 71, 78, 83, 88, 88, 90, 92, 93, 93, 95], [-38, -40, -50, 50, -26, -80, 64, 54, 74, -44, -40, -92, -16, 4, -60, -42, -60, -74, 38], [0], [97, 90, 25, 89, 57, 41], [-90, -88, -66, -60, -48, -48, -46, -42, -40, -36, -26, -4, 2, 4, 4, 8, 16, 18, 34, 50, 52, 56, 64, 80, 86, 90, 92, 96], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1], [4, 4, 7, 13, 23, 23, 25, 25, 26, 34, 38, 39, 39, 45, 48, 50, 52, 54, 58, 59, 60, 65, 72, 76, 80, 80, 80, 84, 87, 90, 92, 94, 96], [-30, 96, 92, -12, -14, -68, -16, 20, 74, -42, 36, 84, -82, 66, 44, 70, -92, -56, -28, -68, -4, 10, -4, 90, 72, 84, 68, 14, 32, 60, 40, 60, -34, 58, -56], [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], [62, 56, 17, 1, 11, 30, 59, 18, 99, 21, 86, 49, 24, 85, 25, 56, 21, 66, 23, 96]]; int [] param2 = [36, 16, 0, 3, 14, 22, 26, 17, 24, 17]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_INDEX_OF_AN_EXTRA_ELEMENT_PRESENT_IN_ONE_SORTED_ARRAY_1,"static int f_filled ( int arr1 [ ] , int arr2 [ ] , int n ) { int index = n ; int left = 0 , right = n - 1 ; while ( left <= right ) { int mid = ( left + right ) / 2 ; if ( arr2 [ mid ] == arr1 [ mid ] ) left = mid + 1 ; else { index = mid ; right = mid - 1 ; } } return index ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 14, 0, 3, 6, 0, 0, 9, 0]; int [] [] param0 = [[7, 18, 19, 25, 26, 27, 31, 39, 44, 46, 59, 60, 66, 72, 78, 83, 84, 92, 94], [-14, -56, 92, -90, 96, -84, 64, -38, -20, 84, 56, 92, 18, -78, 98, -96, -60, 88, -52, -28, 30, -90, 14, 76, 56, 20, -18, -94, -82, -2, 96, -60, -64, -90, 42, 6, 20, -38, 82, -86, -4, 82, 54, -88], [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], [13, 64, 73, 50, 73, 19, 92, 10, 64, 79, 58, 41, 97, 53, 53, 10, 96, 45, 47, 38, 99], [-96, -94, -90, -90, -78, -70, -64, -64, -58, -58, -52, -40, -36, -34, -34, -30, -26, -2, 0, 2, 14, 18, 24, 28, 28, 30, 34, 40, 42, 48, 66, 72, 86, 90, 92, 98], [1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0], [10, 51, 74, 74, 75, 80, 90], [-44, 48, 20, -38, -48, -26, 56, -62, -94, -18, 30, 66, -16, 80, 96, -40, -80, 32, 88, -56, -76, 16, 72, -94, 4, -34, -92, 70, -90, -54, 64, -90], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [19, 53, 13, 91, 52, 62, 39, 84, 68, 45, 32, 40, 13, 68, 79, 76, 11, 42, 76, 30, 81, 3, 30, 15, 85, 76, 1]]; int [] [] param1 = [[2, 5, 12, 13, 17, 20, 22, 46, 51, 63, 64, 66, 66, 76, 87, 87, 90, 91, 96], [54, 44, -50, 26, 4, -26, -76, 98, -14, 36, 82, 0, -60, 18, 52, 82, -12, -8, -26, -58, 22, -70, 24, 48, 56, -46, 92, 98, -50, -72, -66, 8, 40, 12, -80, -86, 90, -30, 76, -92, 80, -62, 0, -48], [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], [24, 42, 54, 13, 88, 63, 50, 73, 64, 66, 86, 84, 53, 4, 44, 58, 44, 42, 36, 94, 34], [-94, -92, -90, -88, -86, -82, -82, -80, -76, -74, -64, -60, -58, -46, -44, -36, -30, -30, -30, -18, -16, -8, -6, 12, 14, 20, 26, 38, 40, 42, 42, 68, 78, 82, 88, 98], [0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0], [12, 20, 36, 38, 61, 64, 93], [-76, 92, -66, 20, 86, 40, 64, 16, 54, -6, 54, -88, -24, 38, 86, 2, 30, 70, 98, -46, 28, 34, 40, -88, -96, 92, 22, 14, -36, -96, -48, -72], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [33, 65, 36, 82, 30, 95, 42, 33, 9, 21, 25, 90, 54, 59, 21, 45, 3, 93, 67, 50, 97, 72, 77, 54, 75, 8, 6]]; int [] param2 = [11, 26, 31, 13, 29, 19, 5, 28, 14, 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); } " FIND_LARGEST_D_IN_ARRAY_SUCH_THAT_A_B_C_D,"static int f_filled ( int [ ] S , int n ) { boolean found = false ; Arrays . sort ( S ) ; for ( int i = n - 1 ; i >= 0 ; i -- ) { for ( int j = 0 ; j < n ; j ++ ) { if ( i == j ) continue ; for ( int k = j + 1 ; k < n ; k ++ ) { if ( i == k ) continue ; for ( int l = k + 1 ; l < n ; l ++ ) { if ( i == l ) continue ; if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) { found = true ; return S [ i ] ; } } } } } if ( found == false ) return Integer . MAX_VALUE ; return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [98, 92, 1, 67, 90, 1, 97, 96, 1, 99]; int [] [] param0 = [[8, 12, 14, 15, 16, 20, 27, 28, 29, 30, 35, 41, 46, 51, 53, 55, 55, 58, 63, 64, 72, 73, 75, 75, 75, 82, 82, 86, 89, 91, 92, 94, 95, 95, 97, 97, 98], [-96, -82, -62, -58, -56, -50, -44, -44, -40, -28, -22, -20, -12, -2, 10, 26, 34, 42, 48, 74, 86, 92], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [10, 10, 47, 54, 55, 58, 65, 66, 67, 77, 84], [-46, -28, -20, -18, 4, 8, 18, 38, 90, 90], [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], [11, 13, 14, 21, 26, 28, 36, 39, 41, 42, 43, 44, 49, 49, 57, 58, 59, 59, 63, 64, 67, 69, 70, 75, 78, 79, 83, 83, 86, 91, 92, 93, 96, 96, 96, 97], [-88, -82, -82, -76, -70, -66, -62, -56, -48, -48, -32, -30, -18, -16, 0, 4, 34, 38, 46, 46, 50, 52, 54, 54, 62, 74, 76, 78, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 5, 6, 9, 11, 14, 18, 20, 21, 25, 33, 49, 55, 56, 58, 61, 66, 66, 68, 74, 74, 87, 92, 99]]; int [] param1 = [37, 22, 10, 11, 10, 45, 36, 29, 24, 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); } " PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE,"static int f_filled ( int a ) { return 4 * a ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [392, 36, 72, 152, 336, 32, 156, 24, 240, 188]; int [] param0 = [98, 9, 18, 38, 84, 8, 39, 6, 60, 47]; 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); } " LEONARDO_NUMBER_1,"static int f_filled ( int n ) { int dp [ ] = new int [ n + 1 ] ; dp [ 0 ] = dp [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1 ; return dp [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1973, 242785, 29860703, 1219, 1402817465, 177, 3193, 2692537, 535828591, 866988873]; int [] param0 = [15, 25, 35, 14, 43, 10, 16, 30, 41, 42]; 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_AVERAGE_SUBARRAY_OF_K_LENGTH_1,"static int f_filled ( int arr [ ] , int n , int k ) { if ( k > n ) return - 1 ; int sum = arr [ 0 ] ; for ( int i = 1 ; i < k ; i ++ ) sum += arr [ i ] ; int max_sum = sum , max_end = k - 1 ; for ( int i = k ; i < n ; i ++ ) { sum = sum + arr [ i ] - arr [ i - k ] ; if ( sum > max_sum ) { max_sum = sum ; max_end = i ; } } return max_end - k + 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 0, 1, 0, 1, 3, 2, 0, 14, 15]; int [] [] param0 = [[2, 5, 11, 37, 41, 49, 49, 63, 98], [84, -72, 12, 0, 86, -32, -18, 48, 60, 42, 8, -6, -10, -6, -52, -84, -98, 76, -10, -14, -94, -48, 94, -10, -20, 40, -52, 0, 94, -68, 44, -34, -26, -6, -94, 34, -80, -62, -40, 56, 52, -20, 74, -46, -88, -26, 22], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [94, 97, 74, 88, 14, 66, 65, 50, 76, 55, 70, 93, 53, 30, 2, 60, 65, 24, 80, 73, 84, 95, 49, 32, 55, 70, 17, 26, 96, 20, 36, 2, 89, 49, 83, 67, 42, 51, 71, 11, 61, 78, 17, 78, 94, 68], [-98, -90, -60, -38, 38, 42], [1, 0, 0, 1, 1, 1, 1], [4, 9, 17, 17, 19, 32, 35, 36, 37, 40, 44, 45, 47, 48, 48, 56, 56, 60, 61, 65, 66, 79, 83, 91, 93, 99], [78, 82, -92, -46, -16, -64, 28, 60, 64, 52, 54, -84, 70, 22, 24, 0, -14, 20, -90, 30, 0, 86, 12, 72, -64, -52, 86, 16, -42], [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], [81, 77, 6, 3, 72, 24, 75, 47, 17, 29, 69, 15, 15, 50, 30, 83, 11, 7, 59, 7, 12, 82, 45, 76, 9, 48, 98, 49, 29, 66, 3, 53, 37, 13, 72, 58, 37, 87, 55]]; int [] param1 = [9, 47, 19, 46, 6, 7, 26, 29, 34, 39]; int [] param2 = [7, 43, 18, 33, 5, 4, 24, 27, 20, 23]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MINIMUM_STEPS_MINIMIZE_N_PER_GIVEN_CONDITION,"static int f_filled ( int n ) { int table [ ] = new int [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) table [ i ] = n - i ; for ( int i = n ; i >= 1 ; i -- ) { if ( ! ( i % 2 > 0 ) ) table [ i / 2 ] = Math . min ( table [ i ] + 1 , table [ i / 2 ] ) ; if ( ! ( i % 3 > 0 ) ) table [ i / 3 ] = Math . min ( table [ i ] + 1 , table [ i / 3 ] ) ; } return table [ 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [9, 3, 13, 11, 6, 6, 13, 6, 3, 12]; int [] param0 = [59, 7, 90, 78, 49, 15, 45, 56, 7, 70]; 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); } " FRIENDS_PAIRING_PROBLEM_2,"static int f_filled ( int n ) { int a = 1 , b = 2 , c = 0 ; if ( n <= 2 ) { return n ; } for ( int i = 3 ; i <= n ; i ++ ) { c = b + ( i - 1 ) * a ; a = b ; b = c ; } return c ; }","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); } " MAXIMUM_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_TWICE,"static int f_filled ( int price [ ] , int n ) { int profit [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) profit [ i ] = 0 ; int max_price = price [ n - 1 ] ; for ( int i = n - 2 ; i >= 0 ; i -- ) { if ( price [ i ] > max_price ) max_price = price [ i ] ; profit [ i ] = Math . max ( profit [ i + 1 ] , max_price - price [ i ] ) ; } int min_price = price [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) { if ( price [ i ] < min_price ) min_price = price [ i ] ; profit [ i ] = Math . max ( profit [ i - 1 ] , profit [ i ] + ( price [ i ] - min_price ) ) ; } int result = profit [ n - 1 ] ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [80, 366, 1, 126, 132, 2, 62, 334, 0, 168]; int [] [] param0 = [[9, 10, 10, 12, 17, 18, 23, 32, 41, 44, 47, 50, 59, 69, 69, 75, 82, 84, 87, 89, 97, 99], [6, 6, 60, 40, 32, -70, -92, 88, 10, -8, -54, 4, 16, 8, -44, 80, -70, 36, 36, -74, -94, 18, -64, -66, -46, 0, -54, -84, 16, -88, -34, -24, 92, 84, 62], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 67, 50, 8, 20, 42, 37, 69, 86, 74, 85, 96, 78, 89, 91], [-68, -52, -14, -2, 18, 22, 30, 34, 64, 64, 70], [1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1], [4, 17, 19, 28, 29, 30, 30, 30, 35, 36, 36, 38, 40, 40, 42, 43, 45, 51, 55, 57, 58, 59, 64, 65, 66, 82, 84, 85, 87, 91, 92, 94, 98, 98], [52, 88, -40, 60, 30, 8, -96, 66, -96, -28, -56, -14, 76, -92, 56, 58, 64, -60, -90, 26, 64, -2, 54, -24, 54, -46, -44], [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], [82, 14, 51, 12, 5, 15, 50, 88, 91, 82, 16, 98, 23, 58, 86, 91, 30, 81, 7, 73, 67, 47, 10, 50, 43, 31, 19, 2, 22]]; int [] param1 = [20, 34, 13, 8, 9, 21, 25, 14, 22, 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); } " FIND_MAXIMUM_PRODUCT_OF_A_TRIPLET_IN_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { if ( n < 3 ) { return - 1 ; } Arrays . sort ( arr ) ; return Math . max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ] , arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [921888, 691488, 1, 931095, 522928, 1, 238464, 847872, 1, 893564]; int [] [] param0 = [[5, 8, 14, 15, 18, 21, 21, 21, 27, 29, 30, 33, 34, 34, 35, 37, 40, 41, 44, 44, 46, 49, 54, 58, 60, 61, 61, 63, 66, 69, 69, 70, 81, 82, 82, 90, 90, 90, 91, 92, 92, 96, 97, 99], [-98, -98, -90, -88, -76, -66, -60, -58, -56, -52, -50, -32, -32, -22, -2, 12, 18, 28, 32, 48, 50, 56, 68, 70, 70, 72], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 5, 5, 6, 17, 18, 18, 31, 38, 49, 53, 62, 63, 66, 69, 72, 74, 76, 76, 77, 81, 86, 91, 94, 95, 99, 99], [-92, -58, -8, 20, 24, 24, 42, 98], [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], [46, 64, 81], [-96, -92, -80, -40, -26, -18, -14, -8, -4, 4, 20, 34, 34, 42, 44, 58, 60, 68, 76, 92, 94, 96], [0, 0, 0, 1, 1, 1, 1, 1], [1, 1, 4, 6, 17, 17, 18, 23, 28, 41, 46, 52, 58, 61, 70, 73, 75, 79, 79, 83, 94, 97, 98]]; int [] param1 = [44, 26, 24, 27, 8, 44, 3, 22, 8, 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); } " FIND_MAXIMUM_SUM_POSSIBLE_EQUAL_SUM_THREE_STACKS,"static int f_filled ( int stack1 [ ] , int stack2 [ ] , int stack3 [ ] , int n1 , int n2 , int n3 ) { int sum1 = 0 , sum2 = 0 , sum3 = 0 ; for ( int i = 0 ; i < n1 ; i ++ ) sum1 += stack1 [ i ] ; for ( int i = 0 ; i < n2 ; i ++ ) sum2 += stack2 [ i ] ; for ( int i = 0 ; i < n3 ; i ++ ) sum3 += stack3 [ i ] ; int top1 = 0 , top2 = 0 , top3 = 0 ; int ans = 0 ; while ( true ) { if ( top1 == n1 || top2 == n2 || top3 == n3 ) return 0 ; if ( sum1 == sum2 && sum2 == sum3 ) return sum1 ; if ( sum1 >= sum2 && sum1 >= sum3 ) sum1 -= stack1 [ top1 ++ ] ; else if ( sum2 >= sum3 && sum2 >= sum3 ) sum2 -= stack2 [ top2 ++ ] ; else if ( sum3 >= sum2 && sum3 >= sum1 ) sum3 -= stack3 [ top3 ++ ] ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 7, 0, 0, 2, 0]; int [] [] param0 = [[4, 10, 11, 24, 27, 33, 34, 36, 36, 40, 42, 43, 52, 58, 67, 69, 77, 86, 86, 88], [40, 54, 14, 58, -64, -60, -98, -64, -52, 30, 0, -42, 74, 46, -14, 76, 84, 74, -24, 30, 96, 88, -98, 82, 44, -86, -92, -52, 28, 62], [0, 0], [64, 40, 45, 93, 30, 79, 24, 95, 1, 84, 74, 5, 9, 6, 22, 33, 10, 53, 33, 9, 31, 21, 22, 77, 21, 93, 86, 68, 92, 57, 27, 82, 87, 11, 51, 2, 27, 2, 24, 57, 20, 2, 32, 43], [-94, -50, -24, -12, -6, -6, 8, 26, 28, 44], [1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1], [3, 3, 4, 5, 9, 18, 21, 22, 25, 27, 28, 33, 35, 39, 39, 43, 57, 58, 59, 63, 65, 65, 72, 77, 78, 78, 80, 80, 88, 92, 99], [40, 28, -84, -38, 82, 2, 38, 10, -10, 20, -54, 48, 56, 38, -98, 68, -8, -30, -96, -16, 28, 94, -52, 28, 34, 68, -46, 44, -28, -52, -48, -14, -30, 24, 56, 8, -30, -46, 18, -68, 86, -12], [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], [22, 31, 75, 48, 30, 39, 82, 93, 26, 87, 77, 87, 67, 88, 19, 51, 54, 48, 6, 37, 38, 27]]; int [] [] param1 = [[4, 13, 34, 40, 41, 47, 47, 52, 55, 62, 66, 66, 69, 70, 73, 74, 75, 76, 85, 98], [24, 34, -52, 50, -8, -48, -28, 68, -12, -26, 0, 6, -76, -94, -12, 8, 38, -88, 30, 98, -78, -54, -48, 42, 26, -76, 4, 46, 26, 60], [1, 1], [48, 85, 55, 12, 24, 26, 88, 76, 15, 34, 23, 61, 2, 99, 11, 37, 65, 74, 92, 96, 68, 50, 67, 98, 89, 17, 62, 18, 51, 61, 41, 41, 90, 64, 89, 51, 48, 95, 9, 86, 28, 54, 64, 35], [-96, -94, -86, -70, -52, -18, -6, 20, 52, 52], [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1], [3, 17, 18, 23, 24, 24, 26, 28, 34, 48, 53, 54, 56, 61, 64, 67, 69, 74, 77, 79, 79, 81, 81, 82, 84, 84, 85, 86, 88, 92, 96], [26, 24, -50, 18, 78, -90, 62, 88, -36, -96, 78, 6, -94, -2, -28, -38, 66, 72, -36, 14, -48, -64, -24, 82, 92, -16, -26, -12, 6, 34, 30, -46, 48, -22, 34, -64, 4, -32, 84, -20, 32, -22], [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], [18, 20, 53, 87, 85, 63, 6, 81, 89, 82, 43, 76, 59, 60, 79, 96, 29, 65, 5, 56, 96, 95]]; int [] [] param2 = [[6, 8, 10, 12, 14, 29, 41, 52, 53, 54, 55, 66, 69, 73, 77, 77, 78, 80, 90, 99], [-8, -24, 54, 28, 92, 94, 0, 62, 28, 80, 82, 2, 88, -4, -28, 80, 44, 34, -98, 36, 28, 76, -48, 40, 98, 4, 22, -36, -20, -70], [0, 0], [99, 77, 11, 20, 33, 91, 5, 68, 75, 67, 37, 70, 59, 26, 2, 62, 6, 97, 95, 38, 46, 89, 29, 61, 27, 93, 26, 74, 98, 85, 91, 92, 40, 97, 58, 44, 20, 57, 65, 62, 65, 26, 74, 58], [-70, -40, -22, 4, 12, 12, 38, 54, 72, 74], [0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0], [1, 3, 5, 8, 15, 16, 27, 27, 27, 28, 29, 30, 32, 35, 36, 37, 44, 47, 57, 65, 69, 70, 70, 76, 76, 83, 85, 87, 88, 90, 92], [66, 26, -90, -40, -52, -98, 84, 88, 40, -92, 30, 28, 32, 92, 18, -34, -42, 64, -34, 70, -72, 28, 44, 34, 76, -78, 46, -48, 20, 54, -2, 66, 6, 56, 52, -98, -48, -70, -60, 94, 90, 10], [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], [10, 76, 49, 36, 41, 18, 60, 44, 81, 34, 56, 7, 13, 83, 82, 16, 7, 38, 33, 55, 91, 54]]; int [] param3 = [10, 26, 1, 42, 5, 39, 24, 32, 16, 19]; int [] param4 = [12, 28, 1, 27, 5, 34, 16, 37, 23, 16]; int [] param5 = [18, 15, 1, 31, 5, 26, 29, 41, 22, 17]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i], param4[i], param5[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS_1,"static boolean f_filled ( int arr [ ] , int n , int x ) { HashSet < Integer > hset = new HashSet < > ( ) ; if ( n < 2 ) return false ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] == 0 ) { if ( x == 0 ) return true ; else continue ; } if ( x % arr [ i ] == 0 ) { if ( hset . contains ( x / arr [ i ] ) ) return true ; hset . add ( arr [ i ] ) ; } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, false, true, false, false, false, false, false]; int [] [] param0 = [[1, 2, 3, 7, 23, 23, 25, 27, 37, 42, 53, 56, 58, 61, 69, 78, 79, 84, 85, 86, 90, 93, 95], [-10, -18, 88, -36, 78, 66, -70, -34, -88, -98, -70, -4, -94, -92, -76, -78, -30, -48, -72, 86, -64, 38, -80, 20, 70, -32, -90, 74, -78, 12, -54, 88, 38, -96, 28], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1], [83, 61, 55, 89, 16, 78, 44, 54, 22, 49, 58, 62, 53, 99, 35, 83, 29, 19, 96, 39, 60, 6, 34, 67, 43, 29, 46, 3, 81, 78, 80, 39, 86, 78, 21], [-96, -88, -80, -62, -58, -56, -54, -52, -34, -20, -6, -2, 6, 20, 52, 54, 70, 72, 80, 82, 94], [0, 1, 1, 0, 0, 1, 1, 1], [8, 11, 11, 20, 22, 23, 26, 27, 31, 38, 40, 40, 45, 46, 46, 48, 50, 61, 73, 76, 78, 78, 79, 80, 81, 84, 90, 91, 93, 95], [18], [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], [19, 37, 47, 40, 72, 59, 51, 53, 92, 3, 21, 81, 29, 48, 97, 59, 10, 74, 11, 37, 49, 95, 88, 85, 6, 26, 76, 33]]; int [] param1 = [15, 17, 9, 23, 18, 4, 24, 0, 37, 22]; int [] param2 = [17, 22, 5, 27, 12, 6, 28, 0, 39, 21]; 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_DIFFERENCE_PAIR,"static int f_filled ( int [ ] arr , int n ) { int diff = Integer . MAX_VALUE ; for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( Math . abs ( ( arr [ i ] - arr [ j ] ) ) < diff ) diff = Math . abs ( ( arr [ i ] - arr [ j ] ) ) ; return diff ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 1, 10, 0, 0, 0, 0, 0]; int [] [] param0 = [[1, 1, 2, 3, 5, 8, 10, 11, 15, 15, 16, 20, 26, 28, 30, 30, 33, 33, 39, 50, 50, 50, 54, 62, 66, 68, 69, 69, 74, 74, 75, 75, 76, 78, 82, 83, 85, 86, 86, 89, 89, 91, 91, 92, 92, 92, 93, 94, 98], [6, 6, -20, 88, -78, -18, 74, 72, 80, 76, -62, 38], [0, 1, 1, 1, 1], [75, 85, 49, 66, 44, 89, 80, 39, 64, 70, 25, 21, 81, 33, 90, 68, 51], [-96, -10, 0, 4, 54, 64], [1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0], [3, 3, 5, 5, 7, 7, 9, 11, 11, 18, 18, 18, 20, 29, 29, 31, 31, 32, 37, 43, 44, 46, 48, 50, 52, 52, 53, 63, 63, 65, 69, 72, 76, 76, 81, 84, 85, 86, 87, 87, 90, 94, 97, 97], [40, -46, 72, -28, 8, 90, 86, -90, 8, -66, -98, 6, 42, 86, 88, 42, -50, 74, -34, -16, -94, -56, -18, -18, 84, -44, 34, 80, 96, 42, -50, -92, 70, 80, 62, -38, -4, 68, 54, -14, 30, -18, -58], [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], [15, 41, 32, 19, 68, 36, 61, 59, 5, 91, 53, 95, 10, 64, 15, 32, 14, 64, 48, 70, 85, 19, 83, 2, 33, 58, 93, 88, 21, 88, 45, 45, 18, 8]]; int [] param1 = [32, 11, 3, 16, 3, 41, 27, 33, 26, 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); } " PROGRAM_CALCULATE_AREA_OCTAGON,"static double f_filled ( double side ) { return 2 * ( 1 + Math . sqrt ( 2 ) ) * side * side ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [165794860.15449765, 196612808.27272156, 28799476.852711495, 447291345.3087225, 363738081.5089271, 34739881.027797274, 251483213.5426547, 167041618.6125096, 30124010.84898392, 444887003.7391194]; double [] param0 = [5859.798616323926, -6381.210375893524, 2442.246292006922, -9624.81536339737, 8679.436805247444, -2682.3245401089525, 7216.9161613024435, -5881.789859815442, 2497.776395789202, -9598.912195459263]; 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_MINIMUM_DIFFERENCE_PAIR_1,"static int f_filled ( int [ ] arr , int n ) { Arrays . sort ( arr ) ; int diff = Integer . MAX_VALUE ; for ( int i = 0 ; i < n - 1 ; i ++ ) if ( arr [ i + 1 ] - arr [ i ] < diff ) diff = arr [ i + 1 ] - arr [ i ] ; return diff ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 0, 0, 0, 0, 0, 15, 2, 0, 2147483647]; int [] [] param0 = [[3, 25, 44, 46, 54, 60, 81], [82, 68, -98, -66, -36, -42, 98, -38, 58, -6, -28, 70, -24, 18, 16, 10, 92, 44, 28, -96, -72, 24, 28, -80, -4, 38, 88, 76], [1, 1, 1], [87, 25, 80, 45, 44, 20, 48, 47, 51, 54, 68, 47, 89, 95, 15, 29, 5, 45, 2, 64, 53, 96, 94, 22, 23, 43, 61, 75, 74, 50], [-74, -48, -42, -26, -16, -12, 0, 4, 8, 18, 46, 46, 62, 70, 74, 88, 92, 96, 98], [0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0], [27, 42, 59, 80], [-96, -94, 10, -36, 18, -40], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [96]]; int [] param1 = [7, 28, 3, 30, 19, 40, 4, 6, 21, 1]; 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_IS_DIVISIBLE_BY_29_OR_NOT,"static boolean f_filled ( int n ) { while ( n / 100 > 0 ) { int last_digit = ( int ) n % 10 ; n /= 10 ; n += last_digit * 3 ; } return ( n % 29 == 0 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, false, false, false, true, false]; int [] param0 = [29, 0, 65, 1419, 54, 7, 44, 34, 1160, 2456]; 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_MINIMUM_ELEMENT_IN_A_SORTED_AND_ROTATED_ARRAY,"static int f_filled ( int arr [ ] , int low , int high ) { if ( high < low ) return arr [ 0 ] ; if ( high == low ) return arr [ low ] ; int mid = low + ( high - low ) / 2 ; if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return arr [ mid + 1 ] ; if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return arr [ mid ] ; if ( arr [ high ] > arr [ mid ] ) return f_filled ( arr , low , mid - 1 ) ; return f_filled ( arr , mid + 1 , high ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [68, 88, 0, 26, 46, 1, 81, 4, 1, 3]; int [] [] param0 = [[16, 22, 50, 64, 68, 79, 84, 88, 89], [88, -38, 46, 24, -52, -12, -90, 28, 18, 14, -72, 58, -98, 28, -84, 44, -42, -32, -22, -22, -82, -30, 90, 18, 62, 62, 92, 6, 60, 28, -90, 92, 82, 62, 98, -68, 48, -74, -8, 50, 62, 24, 30, -86, 98, -96, -98], [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], [26, 66, 94, 28, 38, 31, 92, 66, 81, 8, 36, 64, 80, 32, 48, 71, 72, 54, 61, 60, 89], [-46, -26, -22, -14, 46, 62], [0, 1, 1, 1], [14, 81, 87], [4], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 41, 40, 53, 82, 9, 90, 43, 90, 59, 37, 21, 92, 98, 36, 99, 35, 67, 24, 29, 40, 31, 46, 12, 29, 8, 93, 67, 44, 83, 71, 29, 22, 32, 33, 11, 44, 97, 84, 44, 8, 10, 31, 50, 22, 8]]; int [] param1 = [4, 42, 28, 19, 4, 2, 1, 0, 15, 42]; int [] param2 = [6, 31, 21, 17, 4, 2, 1, 0, 17, 31]; 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_CONNECT_WEIGHTED_NODES_REPRESENTED_ARRAY,"static int f_filled ( int a [ ] , int n ) { int mn = Integer . MAX_VALUE ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { mn = Math . min ( a [ i ] , mn ) ; sum += a [ i ] ; } return mn * ( sum - mn ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4548, -736, 0, 270, 40896, 0, 2652, 9936, 0, 1808]; int [] [] param0 = [[3, 8, 14, 15, 17, 17, 19, 21, 22, 23, 29, 32, 36, 37, 43, 45, 46, 47, 47, 53, 57, 57, 70, 71, 72, 76, 81, 82, 90, 95, 96, 98, 99], [94, -18, 50, 94, -74, -50, -44, -92, -58, 14, -66, -78], [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], [15, 18, 64, 28], [-96, -88, -88, -84, -82, -78, -78, -60, -58, -56, -54, -52, -48, -44, -28, -26, -14, -12, 6, 10, 10, 14, 14, 50, 52, 54, 60, 62, 62, 64, 66, 70, 72, 72, 78, 80, 84], [0, 1, 1, 0, 1, 1, 1, 1], [3, 10, 14, 14, 15, 16, 18, 20, 21, 30, 31, 33, 35, 39, 46, 48, 59, 59, 61, 77, 78, 79, 81, 83, 85, 92, 97, 97, 99], [4, -32, 68, -48, 54, 24, 78, 98, -70, 44, -82, -92, -16, -92, -70, 52, -58, -62, -58, 32, 14, -4, 80, -78, -26, -24, -8], [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], [82, 74, 53, 91, 81, 88, 42, 62, 38, 43, 29, 60, 43, 44, 19, 28, 20, 1, 5, 94, 18, 77, 52, 38, 55, 1, 10, 29, 34, 91, 64, 80, 81, 39, 4, 47, 30, 62, 58, 66, 73, 52, 62, 9, 36, 49]]; int [] param1 = [32, 10, 24, 2, 31, 6, 23, 18, 35, 38]; 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_MINIMUM_SUM_FACTORS_NUMBER,"static int f_filled ( int num ) { int sum = 0 ; for ( int i = 2 ; i * i <= num ; i ++ ) { while ( num % i == 0 ) { sum += i ; num /= i ; } } sum += num ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [83, 17, 12, 5, 15, 17, 21, 13, 23, 16]; int [] param0 = [83, 88, 60, 6, 26, 98, 38, 90, 76, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_FIND_SMALLEST_DIFFERENCE_ANGLES_TWO_PARTS_GIVEN_CIRCLE,"static int f_filled ( int arr [ ] , int n ) { int l = 0 , sum = 0 , ans = 360 ; for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] ; while ( sum >= 180 ) { ans = Math . min ( ans , 2 * Math . abs ( 180 - sum ) ) ; sum -= arr [ l ] ; l ++ ; } ans = Math . min ( ans , 2 * Math . abs ( 180 - sum ) ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 16, 340, 256, 360, 354, 192, 24, 340, 0]; int [] [] param0 = [[4, 4, 5, 5, 13, 14, 14, 16, 19, 20, 30, 31, 32, 33, 35, 38, 38, 42, 44, 44, 48, 48, 52, 58, 60, 64, 65, 66, 68, 69, 70, 70, 71, 72, 73, 79, 81, 83, 83, 84, 86, 87, 88, 88, 91, 92, 95, 95, 98], [-56, 88, -50, 70, 20, 58, 42, -56, -52, -78, 98, 20, -26, 4, 20, -66, -46, -58, 74, 74, -72, 2, 16, -78, -4, 10, 58, 60, -46, -2, 32, -96, 24, -6, 90, -64, -24, -38, 26, 66, -42, -86, 48, 92, 28, 6, -54, -6], [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], [52, 67, 62], [-56, -22, 32, 42, 66], [1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0], [38, 46, 58, 72], [16, 62, 90, 40, 30, -56, -92, -56, 60, 42, -64, 92, -30, -70, 42, -48, -54, 54, 48, 94, -44, -46, 10, 48, 22, -24, -62, 34, 60, 24, -60, 50, 40, 34], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [86, 43, 74, 84, 86, 14, 45, 7, 92, 36, 79, 13, 67, 18, 96, 77, 13, 22, 28, 36, 57, 56, 99, 57, 8, 48, 5, 79, 65, 64, 96, 6, 36, 91, 53, 55, 11, 12, 80, 99, 50, 40, 4, 9, 52, 41]]; int [] param1 = [27, 29, 25, 1, 4, 10, 2, 20, 37, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_2,"static int f_filled ( int a , int b , int c ) { int x = a - b ; int y = b - c ; int z = a - c ; if ( x * y > 0 ) return b ; else if ( x * z > 0 ) return c ; else return a ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [46, 16, 31, 34, 32, 58, 66, 38, 27, 13]; int [] param0 = [48, 21, 71, 93, 3, 58, 88, 8, 17, 13]; int [] param1 = [46, 7, 4, 34, 61, 78, 41, 84, 66, 3]; int [] param2 = [38, 16, 31, 11, 32, 6, 66, 38, 27, 23]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_N_TH_ELEMENT_FROM_STERNS_DIATOMIC_SERIES,"static int f_filled ( int n ) { int DP [ ] = new int [ n + 1 ] ; DP [ 0 ] = 0 ; DP [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { if ( i % 2 == 0 ) DP [ i ] = DP [ i / 2 ] ; else DP [ i ] = DP [ ( i - 1 ) / 2 ] + DP [ ( i + 1 ) / 2 ] ; } return DP [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [11, 2, 5, 3, 5, 11, 11, 4, 1, 7]; int [] param0 = [37, 24, 13, 56, 26, 67, 82, 60, 64, 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); } " FIND_ONE_EXTRA_CHARACTER_STRING_1,"static char f_filled ( String strA , String strB ) { int res = 0 , i ; for ( i = 0 ; i < strA . length ( ) ; i ++ ) { res ^= strA . charAt ( i ) ; } for ( i = 0 ; i < strB . length ( ) ; i ++ ) { res ^= strB . charAt ( i ) ; } return ( ( char ) ( res ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ char [] results = [' ', '3', '0', 's', '6', '2', 'q', '4', '0', 'v']; string [] param0 = [""obfla mmmyvghh"", ""2941"", ""0111111"", ""owvbfsti"", ""4937516500"", ""101110100"", ""hyzscjqfbe"", ""58443"", ""1100"", ""zudyuibvnaeeb""]; string [] param1 = [""obfla mmmyvghh"", ""23941"", ""01011111"", ""owvsbfsti"", ""49376516500"", ""1011210100"", ""hyzscjqqfbe"", ""584443"", ""11000"", ""zudyvuibvnaeeb""]; 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); } " MAKING_ELEMENTS_OF_TWO_ARRAYS_SAME_WITH_MINIMUM_INCREMENTDECREMENT,"static int f_filled ( int a [ ] , int b [ ] , int n ) { Arrays . sort ( a ) ; Arrays . sort ( b ) ; int result = 0 ; for ( int i = 0 ; i < n ; ++ i ) { if ( a [ i ] > b [ i ] ) result = result + Math . abs ( a [ i ] - b [ i ] ) ; else if ( a [ i ] < b [ i ] ) result = result + Math . abs ( a [ i ] - b [ i ] ) ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [566, 220, 4, 80, 788, 0, 112, 410, 5, 366]; int [] [] param0 = [[1, 6, 6, 7, 10, 11, 13, 18, 19, 19, 19, 31, 34, 37, 37, 40, 41, 41, 47, 47, 53, 54, 55, 55, 56, 56, 60, 60, 62, 62, 66, 73, 75, 76, 78, 81, 81, 85, 88, 90, 91, 92, 93, 95, 97, 98], [-32, -12, -6, 62, 78, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [74, 76], [-92, -90, -88, -84, -76, -54, -44, -42, -38, -30, 34, 42], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 5, 6, 13, 16, 24, 36, 40, 40, 44, 47, 52, 58, 58, 59, 63, 66, 67, 69, 70, 74, 77, 81, 88, 89, 90, 94, 96], [-54, -36, -36, -16, -12, -10, -8, -2, 10, 22, 36, 40, 44, 50, 54, 66, 84, 92, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 7, 8, 15, 19, 24, 26, 30, 32, 34, 37, 42, 43, 43, 55, 55, 55, 63, 64, 64, 76, 81, 88, 94]]; int [] [] param1 = [[2, 2, 4, 7, 8, 8, 8, 8, 8, 9, 9, 12, 15, 16, 21, 25, 26, 27, 29, 34, 34, 35, 38, 40, 40, 44, 44, 47, 48, 54, 58, 61, 63, 64, 66, 69, 69, 70, 73, 74, 75, 76, 79, 80, 80, 93], [-86, -60, 20, 32, 50, 52], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [16, 98], [-80, -54, -34, 12, 14, 16, 16, 46, 50, 64, 84, 92], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 7, 10, 17, 21, 22, 22, 27, 36, 37, 39, 46, 52, 53, 56, 59, 65, 67, 70, 75, 78, 78, 79, 89, 89, 94, 96, 97], [-92, -76, -74, -62, -58, -26, -18, -10, -10, -10, -6, 22, 26, 50, 62, 78, 84, 86, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 4, 11, 17, 17, 22, 28, 44, 63, 63, 65, 66, 69, 74, 80, 80, 81, 81, 81, 86, 90, 91, 96, 98]]; int [] param2 = [46, 6, 18, 2, 12, 18, 28, 19, 47, 24]; 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_PAIR_WITH_GREATEST_PRODUCT_IN_ARRAY,"static int f_filled ( int [ ] arr , int n ) { int result = - 1 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n - 1 ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = Math . max ( result , arr [ i ] ) ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 76, 1, -1, -1, 0, 60, -1, 1, 40]; int [] [] param0 = [[4, 78, 84], [-54, 64, 60, 14, 18, -68, -54, -58, 38, -72, -84, 46, 74, 76, 28, -2, 54, 24, 18, -74, -78, 14, -38, -70, 26, -54, -36, -96, -12, 8, 62, -42, -84, 10, -6, 36, -72, 10, 10, -20, 16, 92, -64, -34, 74, -98, 18], [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], [39, 49, 94, 80, 48, 34, 63, 82, 47, 51, 60, 68, 79, 23, 97, 22, 54, 53, 40, 2, 25], [-90, -52, -10, 12, 72], [1, 0, 0], [2, 9, 11, 14, 16, 17, 17, 18, 19, 21, 24, 25, 28, 29, 30, 33, 33, 39, 41, 41, 43, 46, 50, 51, 60, 62, 67, 80, 84, 86, 91, 92, 97], [4], [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], [52, 8, 31, 92, 20, 18, 34, 5, 15, 8, 73, 20, 40, 61, 80, 51, 95, 73, 38, 30, 21, 69, 52, 38, 68, 77]]; int [] param1 = [2, 26, 22, 10, 3, 2, 27, 0, 16, 22]; 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_PERIMETER_CYLINDER,"static int f_filled ( int diameter , int height ) { return 2 * ( diameter + height ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [296, 286, 150, 234, 332, 170, 336, 212, 142, 204]; int [] param0 = [70, 97, 49, 56, 87, 64, 75, 90, 55, 73]; int [] param1 = [78, 46, 26, 61, 79, 21, 93, 16, 16, 29]; 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_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES,"static int f_filled ( int [ ] a , int n ) { int result = 1 ; for ( int i = 1 ; i <= n ; ++ i ) { int y = ( i * ( i + 1 ) ) / 2 ; if ( y < n ) result = i ; else break ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 7, 6, 4, 1, 8, 3, 7, 1, 6]; int [] [] param0 = [[8, 10, 11, 14, 14, 17, 20, 20, 22, 22, 22, 23, 25, 30, 33, 39, 39, 41, 43, 45, 46, 46, 46, 50, 51, 53, 57, 59, 60, 64, 64, 66, 72, 72, 75, 77, 85, 85, 87, 88, 90, 91, 93, 94, 94, 95], [-44, -90, 20, 4, -56, -50, -80, 74, -82, 20, 62, -26, -10, -14, -76, 82, -88, 92, 30, 44, -62, -86, -20, -96, -60, -88, -78, -40, -48, -92, 62, 58, 94, 68, 68, 44, 80, 4, 48, -92, 30, -76, -46, -20, 4], [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, 34, 48, 10, 5, 12, 80, 7, 67, 1, 79, 59, 63, 13, 16, 23, 62, 56, 99, 89, 7, 80], [-88, -46, -40, -40, 38], [1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1], [8, 15, 35, 39, 49, 81, 86, 91], [-24, 56, -74, -76, -80, 86, 90, 0, -26, 18, 72, 78, -66, -28, 22, 22, 72, 78, -50, -12, 20, 12, -68, -2, -58, -44, 28, -58, 90, -28, 32, -70, -48, -66, -94, -50, 18, -12, 80, 12, 82, 56, -64, 10, -22], [0, 0], [62, 93, 69, 40, 26, 2, 29, 83, 66, 68, 67, 73, 12, 65, 89, 57, 38, 99, 42, 27, 38, 24, 43, 4, 4, 54, 72, 47, 52, 46, 53, 24, 3, 41, 64, 33, 88, 3, 1, 7, 17, 31, 20, 33, 69, 21, 9, 24, 59]]; int [] param1 = [38, 36, 28, 12, 3, 44, 7, 36, 1, 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); } " FIND_POSITION_GIVEN_NUMBER_AMONG_NUMBERS_MADE_4_7,"static int f_filled ( String n ) { int k = 0 , pos = 0 , i = 0 ; while ( k != n . length ( ) ) { switch ( n . charAt ( i ) ) { case '4' : pos = pos * 2 + 1 ; break ; case '7' : pos = pos * 2 + 2 ; break ; } i ++ ; k ++ ; } return pos ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 5, 7, 1, 5, 2, 8, 0, 0, 0]; string [] param0 = [""7"", ""305745689"", ""444"", ""4"", ""2074"", ""27"", ""447"", ""255"", ""10000111111011"", ""fakcsdrtnz""]; 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_REPEATED_CHARACTER_PRESENT_FIRST_STRING,"static int f_filled ( String s ) { int p = - 1 , i , j ; for ( i = 0 ; i < s . length ( ) ; i ++ ) { for ( j = i + 1 ; j < s . length ( ) ; j ++ ) { if ( s . charAt ( i ) == s . charAt ( j ) ) { p = i ; break ; } } if ( p != - 1 ) break ; } return p ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 0, 0, 0, 0, 0, -1, 0, 0, 1]; string [] param0 = [""orxmflacqfbv"", ""39977638567848"", ""011110011011"", ""fyjfny"", ""222280492"", ""11"", ""ujntbg"", ""6866190138212"", ""0000"", ""fwz pweqgvlrz""]; 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_PROFIT_BY_BUYING_AND_SELLING_A_SHARE_AT_MOST_K_TIMES_1,"static int f_filled ( int price [ ] , int n , int k ) { int profit [ ] [ ] = new int [ k + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= k ; i ++ ) profit [ i ] [ 0 ] = 0 ; for ( int j = 0 ; j <= n ; j ++ ) profit [ 0 ] [ j ] = 0 ; for ( int i = 1 ; i <= k ; i ++ ) { int prevDiff = Integer . MIN_VALUE ; for ( int j = 1 ; j < n ; j ++ ) { prevDiff = Math . max ( prevDiff , profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] ) ; profit [ i ] [ j ] = Math . max ( profit [ i ] [ j - 1 ] , price [ j ] + prevDiff ) ; } } return profit [ k ] [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 1272, 0, 46, 112, 3, 42, 564, 1, 213]; int [] [] param0 = [[3, 6, 16, 16, 19, 37, 47, 49, 74, 77, 86, 96], [-6, -70, -26, 78, 98, -72, 48, -94, -38, 52, -50, 58, 84, 16, -74, 32, -44, -50, 68, -48, 28, 94, -26, -96, -42, 96, -24, 42, -70, 10, -16, -32, 98, 38, -2, 26, -26, -78, 44, -72, -56, -22], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [22, 12, 58, 70], [-96, -96, -94, -92, -90, -88, -88, -84, -78, -76, -72, -72, -68, -62, -54, -52, -52, -36, -34, -32, -26, -20, -6, -4, -4, 4, 8, 10, 14, 16, 32, 32, 32, 34, 42, 46, 50, 60, 62, 64, 64, 72, 74, 76, 76, 78, 90, 92, 96], [1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0], [2, 4, 7, 11, 20, 24, 25, 27, 29, 33, 33, 36, 36, 41, 44, 45, 47, 54, 65, 66, 67, 75, 78, 82, 85, 90], [56, 2, -10, -44, 68, 10, -32, -2, -68, 12, -34, -36, 0, 40, -16, -36, 92, 8, -40, -10, 46, 98, 76, -2, 98, -20, 6, 68, 32, -26, -12, 70, 16, -34, -50, -76, -34, -18, 0, -44, -76, 58], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [78, 39, 2, 76, 20, 21, 3, 21, 32, 80, 28, 89, 51, 2, 88, 19, 99, 71, 68, 38, 8, 76, 48, 81, 90, 71, 31]]; int [] param1 = [6, 31, 7, 3, 30, 14, 15, 24, 10, 14]; int [] param2 = [6, 32, 8, 2, 36, 13, 22, 35, 8, 24]; 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); } " NUMBER_OF_PAIRS_IN_AN_ARRAY_HAVING_SUM_EQUAL_TO_PRODUCT,"static int f_filled ( int a [ ] , int n ) { int zero = 0 , two = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] == 0 ) { zero ++ ; } if ( a [ i ] == 2 ) { two ++ ; } } int cnt = ( zero * ( zero - 1 ) ) / 2 + ( two * ( two - 1 ) ) / 2 ; return cnt ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 21, 0, 0, 15, 0, 0, 15, 0]; int [] [] param0 = [[9, 10, 20, 26, 26, 28, 31, 34, 35, 36, 36, 37, 39, 43, 44, 44, 46, 49, 54, 57, 58, 63, 64, 64, 65, 67, 70, 70, 74, 75, 77, 78, 79, 81, 82, 83, 84, 86, 95], [0, -10, 10, 0, 68, 4, -6, -14, 74, -80, 56, -4, 36, 56, 10, -16, 90, 84, -38, -40, 40, -86, -36, -16, -48, -76, -72, -18, -14, -40, -82, 56, -60], [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], [88, 20, 53, 21, 29, 73, 62, 91, 72, 34, 47, 42, 98, 9, 79, 80, 94, 36, 7, 67, 96, 34, 99, 56, 37, 70, 55, 36, 10, 77, 41, 51, 5, 37, 57, 29, 56, 74, 97, 31, 96, 52, 13, 29, 87, 58, 28, 31], [20], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1], [2, 4, 9, 16, 22, 23, 25, 33, 33, 36, 39, 48, 49, 52, 53, 60, 67, 68, 76, 77, 79, 84, 84, 86, 89], [-62, 42, -88, -44, 90, 30, 52, 54, 56, -72, -76, 90, 18, 42, 62, -84, 56, -80, 72], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [22, 15, 28, 29, 32, 16, 33, 83]]; int [] param1 = [31, 19, 22, 38, 0, 21, 24, 13, 15, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_ROTATION_COUNT_ROTATED_SORTED_ARRAY_1,"static int f_filled ( int arr [ ] , int low , int high ) { if ( high < low ) return 0 ; if ( high == low ) return low ; int mid = low + ( high - low ) / 2 ; if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return ( mid + 1 ) ; if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return mid ; if ( arr [ high ] > arr [ mid ] ) return f_filled ( arr , low , mid - 1 ) ; return f_filled ( arr , mid + 1 , high ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 0, 29, 24, 31, 0, 0, 0, 0, 0]; int [] [] param0 = [[4, 16, 38, 39, 48, 74, 79], [-46, 72, 72, -66, 96, 92, 40, 8, 94, -84, 6, -90, 38, -6, 48, -20, -86, -76, 88, -50, -44, -14, 54, -6, -2, 72, 8, -64, -46, 44, -88, 50, 86, 38, 42, -56], [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], [48, 74, 59, 57, 95, 11, 25, 61, 46, 54, 34, 84, 7, 97, 62, 57, 99, 93, 76, 5, 76, 93, 35, 84, 37, 60, 65, 16, 30, 73, 42, 61, 74, 77, 48, 62, 84, 93, 64, 57, 68, 46, 28, 77], [-72, -68, -66, -66, -62, -62, -52, -48, -42, -42, -42, -38, -30, -22, -20, -20, -16, -16, -14, 0, 2, 2, 2, 4, 12, 20, 22, 26, 32, 34, 46, 46, 64, 64, 64, 66, 68, 68, 68, 74, 80, 84, 84, 88, 88, 90, 96, 98], [1], [7, 11, 20, 21, 22, 27, 30, 30, 34, 35, 36, 37, 38, 60, 61, 63, 63, 69, 70, 75, 80, 84, 88, 97], [-2, 70, -40], [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], [71, 71, 27, 10, 97, 43, 55, 71, 6, 6, 77, 48, 77, 2, 83, 51, 61, 19, 2, 51, 26, 70, 20, 23, 54, 15, 6, 92, 35, 75, 8, 57, 50, 49, 88, 21, 36]]; int [] param1 = [6, 32, 16, 24, 29, 0, 23, 2, 30, 24]; int [] param2 = [6, 21, 29, 26, 43, 0, 22, 1, 17, 22]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " GIVEN_LARGE_NUMBER_CHECK_SUBSEQUENCE_DIGITS_DIVISIBLE_8,"static boolean f_filled ( String str ) { int i , j , k , l = str . length ( ) ; int arr [ ] = new int [ l ] ; for ( i = 0 ; i < l ; i ++ ) { for ( j = i ; j < l ; j ++ ) { for ( k = j ; k < l ; k ++ ) { if ( arr [ i ] % 8 == 0 ) return true ; else if ( ( arr [ i ] * 10 + arr [ j ] ) % 8 == 0 && i != j ) return true ; else if ( ( arr [ i ] * 100 + arr [ j ] * 10 + arr [ k ] ) % 8 == 0 && i != j && j != k && i != k ) return true ; } } } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, true, true, true, true, false]; string [] param0 = [""1787075866"", ""8"", ""1110101110111"", ""6673177113"", ""7"", ""000001"", ""dbxmf"", ""71733"", ""01101101100"", """"]; 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_SMALLEST_VALUE_REPRESENTED_SUM_SUBSET_GIVEN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int res = 1 ; for ( int i = 0 ; i < n && arr [ i ] <= res ; i ++ ) res = res + arr [ i ] ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, -95, 4, 1, -93, 2, 1, 1, 12, 1]; int [] [] param0 = [[16, 23, 24, 41, 48, 58, 72, 75], [-14, -82, 12, -14, -38, 12, 40, 12, -74, 42, -36, 64], [0, 0, 1, 1, 1, 1], [17, 89, 44], [-94, -92, -84, -82, -72, -58, -56, -40, -34, -34, -24, -22, -8, -8, 12, 14, 16, 16, 22, 22, 34, 46, 54, 58, 68, 72, 74, 78, 88, 96], [0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0], [2, 12, 13, 13, 13, 16, 28, 32, 34, 41, 41, 47, 49, 49, 50, 52, 58, 61, 63, 65, 67, 68, 68, 74, 80, 80, 84, 84, 89, 93, 94, 98, 99, 99], [-54], [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], [42, 50, 76, 45, 6, 63, 46, 73, 65, 70, 87, 5, 41, 63, 96, 75, 38, 76, 27, 7, 71, 9, 65, 44, 76, 37, 94, 52, 55, 3, 38, 68, 45, 15, 35, 90, 36, 46, 13, 92, 32, 22, 49, 35, 83]]; int [] param1 = [4, 8, 5, 2, 25, 8, 23, 0, 33, 35]; 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_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED,"static int f_filled ( int [ ] arr , int n ) { int [ ] dp = new int [ n ] ; if ( n == 1 ) return arr [ 0 ] ; if ( n == 2 ) return Math . min ( arr [ 0 ] , arr [ 1 ] ) ; if ( n == 3 ) return Math . min ( arr [ 0 ] , Math . min ( arr [ 1 ] , arr [ 2 ] ) ) ; if ( n == 4 ) return Math . min ( Math . min ( arr [ 0 ] , arr [ 1 ] ) , Math . min ( arr [ 2 ] , arr [ 3 ] ) ) ; dp [ 0 ] = arr [ 0 ] ; dp [ 1 ] = arr [ 1 ] ; dp [ 2 ] = arr [ 2 ] ; dp [ 3 ] = arr [ 3 ] ; for ( int i = 4 ; i < n ; i ++ ) dp [ i ] = arr [ i ] + Math . min ( Math . min ( dp [ i - 1 ] , dp [ i - 2 ] ) , Math . min ( dp [ i - 3 ] , dp [ i - 4 ] ) ) ; return Math . min ( Math . min ( dp [ n - 1 ] , dp [ n - 2 ] ) , Math . min ( dp [ n - 4 ] , dp [ n - 3 ] ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [227, -622, 0, 281, -74, 0, 188, -318, 0, 153]; int [] [] param0 = [[2, 7, 11, 12, 13, 14, 18, 20, 22, 26, 28, 29, 31, 32, 33, 35, 38, 38, 40, 40, 41, 42, 43, 44, 45, 53, 54, 54, 59, 62, 69, 72, 74, 75, 75, 76, 79, 83, 84, 89, 91, 96, 97, 98, 99, 99], [50, -22, 90, -40, 46, 86, 50, 44, 12, -42, -58, 6, 52, -16, 4, 46, 44, 0, -64, 78, -14, -80, 30, -66, 78, 24, 28, 10, -72, -44, -28, -32, -30, 94, -22, 26, 16, 20, -52, -16, -80, 2, -56, -70, -76, 60, 62], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [63, 18, 13, 2, 1, 94, 11, 49, 82, 97, 75, 98, 25, 20, 96, 82, 60, 94, 24, 15, 79, 48, 40, 60, 9, 62, 24, 69, 31, 78, 34, 83, 22, 88], [-74, 16, 96], [0, 0, 1, 0, 1, 1], [2, 5, 6, 8, 10, 16, 18, 19, 20, 21, 24, 30, 34, 36, 39, 42, 52, 53, 54, 55, 56, 57, 70, 71, 72, 73, 75, 75, 77, 78, 82, 85, 87, 88, 89, 91], [-40, 12, -86, -54, -68, 32, 10, -24, -46, 54, -64, 20, 22, 88, 62, -4, -2, -8, -32, 88, -4, 38, 4, 86, 82, -16, -76, -44, 54, -24, -92, 74, 50, -52, 52], [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], [4, 53, 96, 86, 69, 81, 86, 95, 80, 43, 25, 66, 24, 72]]; int [] param1 = [30, 40, 14, 33, 1, 5, 25, 22, 20, 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); } " FIND_SUBARRAY_WITH_GIVEN_SUM_1,"static int f_filled ( int arr [ ] , int n , int sum ) { int curr_sum = arr [ 0 ] , start = 0 , i ; for ( i = 1 ; i <= n ; i ++ ) { while ( curr_sum > sum && start < i - 1 ) { curr_sum = curr_sum - arr [ start ] ; start ++ ; } if ( curr_sum == sum ) { int p = i - 1 ; System . out . println ( ""Sum found between indexes "" + start + "" and "" + p ) ; return 1 ; } if ( i < n ) curr_sum = curr_sum + arr [ i ] ; } System . out . println ( ""No subarray found"" ) ; return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 0, 1, 1, 0, 1, 1, 1, 1, 1]; int [] [] param0 = [[7, 7, 8, 8, 23, 24, 28, 32, 48, 53, 56, 62, 69, 77, 81, 82, 84, 87, 88, 90], [-62, -62, -80, -30, -80, 44, -12, -76, 16, -52, -86, 72, 32, -60, -70, -62, -78, -96, -18, 40, -4, -18, -58, 30, -70, 6, 0, -62, -66, 20, 92, -64, 20, -48, 48, -32, 64, 22, 16, 26], [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], [50, 25, 6, 87, 55, 86, 61, 97, 24, 30, 51, 43, 26, 1, 80, 47, 19, 36, 64, 62, 92, 5, 48, 27, 82, 76, 70, 59, 1, 43, 1, 36, 28, 9, 52, 22, 43], [-86, -76, -64, -22, -16, -8, 4, 6, 8, 32, 38, 60, 68, 74], [0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0], [7, 7, 12, 25, 25, 32, 33, 34, 37, 39, 39, 41, 46, 48, 56, 56, 57, 58, 61, 62, 62, 63, 65, 66, 69, 72, 74, 78, 78, 79, 80, 85, 89, 94, 95, 99], [98, -60], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [80, 89, 83, 42, 75, 30, 64, 25, 95, 17, 90, 6, 11, 1, 77, 16, 75, 86, 96, 67, 27, 80, 27]]; int [] param1 = [16, 39, 40, 29, 7, 31, 22, 1, 8, 16]; int [] param2 = [31, 44, 7, 105, 2, 10, 39, 98, 0, 108]; 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_SUM_EVEN_FACTORS_NUMBER,"static int f_filled ( int n ) { if ( n % 2 != 0 ) return 0 ; int res = 1 ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { int count = 0 , curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { count ++ ; n = n / i ; if ( i == 2 && count == 1 ) curr_sum = 0 ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n >= 2 ) res *= ( 1 + n ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 112, 0, 78, 0, 0, 0, 96, 144, 0]; int [] param0 = [71, 78, 39, 36, 49, 17, 53, 66, 92, 71]; 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_SUM_EVEN_INDEX_BINOMIAL_COEFFICIENTS,"static int f_filled ( int n ) { int C [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ; int i , j ; for ( i = 0 ; i <= n ; i ++ ) { for ( j = 0 ; j <= Math . min ( i , n ) ; j ++ ) { if ( j == 0 || j == i ) C [ i ] [ j ] = 1 ; else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ] ; } } int sum = 0 ; for ( i = 0 ; i <= n ; i += 2 ) sum += C [ n ] [ i ] ; return sum ; }","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); } " FIND_WHETHER_AN_ARRAY_IS_SUBSET_OF_ANOTHER_ARRAY_SET_1,"static boolean f_filled ( int arr1 [ ] , int arr2 [ ] , int m , int n ) { int i = 0 ; int j = 0 ; for ( i = 0 ; i < n ; i ++ ) { for ( j = 0 ; j < m ; j ++ ) if ( arr2 [ i ] == arr1 [ j ] ) break ; if ( j == m ) return false ; } return true ; }","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], [12, 30, -94, -92, -62, -18, -56, 44, -50, -92, 6, 2, 56, -90, 0, 0, 18, 86, -58, 58, -54, 62, -94, 94, 0, 8, 82, -68, -88, -18, 8, -80, -42, 18, 62, -8, 56, -76, -42, 56, 44, -2, -20, 62, -14, 74, -86, -76], [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], [94, 26, 32, 20, 46, 55, 9, 51, 57, 80, 45, 38, 68, 12, 90, 10, 80, 65, 12, 52, 51, 86, 64, 57, 93, 19, 30, 92, 85, 82, 24, 26, 36, 56], [-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], [1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1], [6, 8, 11, 13, 14, 26, 26, 41, 48, 70, 82, 83, 84, 88, 96], [-88, 80, 62, 76, 48, 92, 18, -94, -62, 98, -46, -50, 70, 32, 68, -54, 26, 16, 94, 0, -84, 2, -16, 88, 26, -38, 18, 64, 90, 80, 76, 2, 14, -90, 50, 4, 76, 30], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [54, 44, 97, 92, 13, 54, 27, 8, 43, 70, 77, 84, 55, 64, 5, 59, 27, 19, 65, 68, 66, 26, 33, 38, 7]]; int [] [] param1 = [[10, 13, 17, 63], [12, -18, 44], [0, 0, 0], [80, 58, 32, 2], [-99, -90, -90, -86], [0, 0, 1, 1], [1, 9, 12, 16], [-76, -54, 4, 78], [0, 1, 0, 1], [93, 5, 9, 13]]; int [] param2 = [29, 46, 34, 17, 23, 10, 10, 27, 10, 19]; 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); } " NTH_EVEN_LENGTH_PALINDROME,"static String f_filled ( String n ) { String res = n ; for ( int j = n . length ( ) - 1 ; j >= 0 ; -- j ) res += n . charAt ( j ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""lsuhevxcgfiifgcxvehusl"", ""7732928338292377"", ""010111111111111010"", ""stazbbzats"", ""07022070"", ""0111111111111110"", ""aa"", ""359118754930039457811953"", ""1101101001001001011011"", ""rznbbnzr""]; string [] param0 = [""lsuhevxcgfi"", ""77329283"", ""010111111"", ""stazb"", ""0702"", ""01111111"", ""a"", ""359118754930"", ""11011010010"", ""rznb""]; 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_SUM_MODULO_K_FIRST_N_NATURAL_NUMBER,"static int f_filled ( int N , int K ) { int ans = 0 ; for ( int i = 1 ; i <= N ; i ++ ) ans += ( i % K ) ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [21, 666, 876, 0, 2211, 237, 3, 2701, 388, 465]; int [] param0 = [11, 36, 71, 74, 66, 38, 2, 73, 79, 30]; int [] param1 = [5, 69, 28, 1, 84, 14, 11, 87, 11, 55]; 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); } " MULTIPLY_LARGE_NUMBERS_REPRESENTED_AS_STRINGS,"static String f_filled ( String num1 , String num2 ) { int len1 = num1 . length ( ) ; int len2 = num2 . length ( ) ; if ( len1 == 0 || len2 == 0 ) return ""0"" ; int result [ ] = new int [ len1 + len2 ] ; int i_n1 = 0 ; int i_n2 = 0 ; for ( int i = len1 - 1 ; i >= 0 ; i -- ) { int carry = 0 ; int n1 = num1 . charAt ( i ) - '0' ; i_n2 = 0 ; for ( int j = len2 - 1 ; j >= 0 ; j -- ) { int n2 = num2 . charAt ( j ) - '0' ; int sum = n1 * n2 + result [ i_n1 + i_n2 ] + carry ; carry = sum / 10 ; result [ i_n1 + i_n2 ] = sum % 10 ; i_n2 ++ ; } if ( carry > 0 ) result [ i_n1 + i_n2 ] += carry ; i_n1 ++ ; } int i = result . length - 1 ; while ( i >= 0 && result [ i ] == 0 ) i -- ; if ( i == - 1 ) return ""0"" ; String s = """" ; while ( i >= 0 ) s += ( result [ i -- ] ) ; return s ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""812165205"", ""49207455593601"", ""12223454455433432211"", ""20253658262825"", ""175984925696"", ""1100012222210"", ""111651036"", ""3891078706008"", ""110101"", ""80493516""]; string [] param0 = [""12345"", ""88111031"", ""1100111"", ""8459203"", ""43701248"", ""100001111110"", ""907732"", ""68337672"", ""00110101"", ""39574""]; string [] param1 = [""65789"", ""558471"", ""11111110111101"", ""2394275"", ""4027"", ""11"", ""123"", ""56939"", ""1"", ""2034""]; 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_MODULO_K_FIRST_N_NATURAL_NUMBER_1,"static int f_filled ( int N , int K ) { int ans = 0 ; int y = N / K ; int x = N % K ; ans = ( K * ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2 ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [820, 1081, 913, 0, 2146, 920, 1158, 1891, 1921, 1171]; int [] param0 = [40, 46, 97, 63, 92, 60, 67, 61, 74, 67]; int [] param1 = [90, 64, 20, 1, 52, 35, 40, 62, 61, 41]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_SUM_NON_REPEATING_DISTINCT_ELEMENTS_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int sum = 0 ; HashSet < Integer > s = new HashSet < Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( ! s . contains ( arr [ i ] ) ) { sum += arr [ i ] ; s . add ( arr [ i ] ) ; } } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [971, 84, 1, 769, -972, 1, 765, 150, 1, 135]; int [] [] param0 = [[5, 6, 8, 10, 21, 22, 27, 32, 35, 36, 43, 44, 46, 48, 49, 55, 60, 61, 69, 69, 71, 72, 73, 78, 88, 94], [80, 94, 16, -74, 32, -64, -84, -66, -10], [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], [99, 4, 96, 39, 39, 24, 15, 47, 25, 74, 7, 98, 88, 91, 62, 12, 31, 14, 48, 26, 37, 25, 11, 32, 34, 64, 72, 5, 80, 86, 6], [-86, -84, -84, -78, -78, -76, -74, -68, -66, -64, -60, -60, -56, -50, -42, -42, -38, -34, -32, -22, -16, -14, -10, -6, -6, 4, 4, 26, 36, 36, 54, 62, 64, 68, 70, 76, 76, 76, 84, 92, 92, 94, 96], [1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1], [3, 3, 5, 8, 32, 33, 35, 35, 42, 48, 67, 71, 71, 74, 77, 80, 94, 96, 96, 97], [-50, -18, -66, 76, -54, 96, 98, 26, 42, 64, -60], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [70, 21, 44, 82, 62, 41, 86]]; int [] param1 = [24, 6, 27, 15, 27, 25, 19, 9, 15, 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); } " MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int a = 0 , b = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i % 2 != 0 ) a = a * 10 + arr [ i ] ; else b = b * 10 + arr [ i ] ; } return a + b ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [227889, -123809, 22222222, 11, -15712863, 1222222, 247916, -1894059, 22, 29134588]; int [] [] param0 = [[1, 1, 1, 1, 3, 4, 4, 4, 4, 4, 4, 5], [-7, -5, -2, -2, -2, 3, 4, 4, 5, 6], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 7], [-9, -6, -4, -3, -3, 1, 2, 4, 5, 5, 6, 6, 8, 9], [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, 2, 2, 3, 4, 4, 4, 5, 5, 8, 8], [-9, -9, -6, -3, -3, -1, -1, 0, 0, 3, 4, 7], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [2, 3, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 9, 9, 9]]; int [] param1 = [12, 10, 26, 2, 14, 24, 11, 12, 10, 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); } " FIND_SUM_ODD_FACTORS_NUMBER,"static int f_filled ( int n ) { int res = 1 ; while ( n % 2 == 0 ) n = n / 2 ; for ( int i = 3 ; i <= Math . sqrt ( n ) ; i ++ ) { int count = 0 , curr_sum = 1 ; int curr_term = 1 ; while ( n % i == 0 ) { count ++ ; n = n / i ; curr_term *= i ; curr_sum += curr_term ; } res *= curr_sum ; } if ( n >= 2 ) res *= ( 1 + n ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 4, 56, 6, 12, 8, 1, 40, 84, 4]; int [] param0 = [20, 6, 39, 80, 88, 7, 16, 27, 83, 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); } " FIND_SUM_UNIQUE_SUB_ARRAY_SUM_GIVEN_ARRAY,"static int f_filled ( int [ ] arr , int n ) { int res = 0 ; HashMap < Integer , Integer > m = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int sum = 0 ; for ( int j = i ; j < n ; j ++ ) { sum += arr [ j ] ; if ( m . containsKey ( sum ) ) { m . put ( sum , m . get ( sum ) + 1 ) ; } else { m . put ( sum , 1 ) ; } } } for ( Map . Entry < Integer , Integer > x : m . entrySet ( ) ) if ( x . getValue ( ) == 1 ) res += x . getKey ( ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5631, 52, 0, 207596, -1638, 0, 27034, 1698, 0, 267019]; int [] [] param0 = [[7, 24, 34, 35, 36, 40, 49, 51, 53, 74, 78], [-34, 60, 32], [0], [80, 64, 10, 82, 14, 75, 51, 91, 1, 25, 98, 22, 36, 27, 21, 31, 93, 6, 52, 91, 80, 8, 62, 95, 10, 71, 40, 80, 35, 86, 85, 26, 74, 72, 64, 88, 4, 71, 4, 16], [-94, -46, -36, -24, -22, 0, 10, 14, 34, 34, 90, 92, 98], [1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1], [19, 20, 20, 24, 25, 33, 43, 47, 57, 61, 61, 64, 65, 71, 72, 73, 75, 82, 90, 93, 95], [-6, 56, 58, -36, 70, -92, 30, 58, -40, 98, 80, -96, -4, -88, 34, 76, 40, -32, -94, -26, 8, 72, -56, -96, -88, -24, 36, 14, -88, -32, 90, 4, -88, 28, 18], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [91, 51, 15, 78, 55, 3, 10, 24, 42, 84, 66, 78, 10, 41, 21, 53, 69, 57, 20, 22, 50, 72, 8, 80, 12, 91, 29, 95, 38, 74, 95, 26, 10, 57, 51, 25, 49, 74, 15, 42, 99, 21, 27]]; int [] param1 = [9, 2, 0, 31, 9, 21, 15, 24, 11, 36]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THE_ELEMENT_BEFORE_WHICH_ALL_THE_ELEMENTS_ARE_SMALLER_THAN_IT_AND_AFTER_WHICH_ALL_ARE_GREATER_THAN_IT,"static int f_filled ( int [ ] arr , int n ) { int [ ] leftMax = new int [ n ] ; leftMax [ 0 ] = Integer . MIN_VALUE ; for ( int i = 1 ; i < n ; i ++ ) leftMax [ i ] = Math . max ( leftMax [ i - 1 ] , arr [ i - 1 ] ) ; int rightMin = Integer . MAX_VALUE ; for ( int i = n - 1 ; i >= 0 ; i -- ) { if ( leftMax [ i ] < arr [ i ] && rightMin > arr [ i ] ) return i ; rightMin = Math . min ( rightMin , arr [ i ] ) ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, -1, -1, -1, 28, -1, 8, -1, -1, -1]; int [] [] param0 = [[4, 24, 30, 33, 56, 67, 87, 90], [72, -48, 12, 4, 46, 36, 2, 58, 82, -88, -14, 56, 90, 76, 18, -6, -28, 18, 88, 90, 40, -68, -10, -82, -28, 16, 32, -90, 12, -86, -16, 78, -98, -52, -26, 80, 6, 50, 40, -12, 52, 38, -92, 94, -32, 14, -80, -88, 48], [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], [51, 87, 46, 76, 2, 89, 56, 34, 49, 61, 44, 73, 14, 60, 89], [-90, -90, -80, -72, -68, -64, -62, -62, -60, -46, -44, -44, -44, -42, -42, -32, -22, -22, -18, -2, 4, 6, 10, 12, 14, 30, 34, 34, 40, 56, 56, 56, 58, 68, 74, 78, 78, 82, 84, 86, 88, 90, 92], [0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0], [7, 8, 11, 12, 15, 17, 28, 34, 57, 61, 66, 76, 92], [-22, -96, -78, -60, 34, -18, 86, -42, -78, 76, 8, 28, -80, 80, 6, -72, 34, 66, 84, 50, -4, 18, 72, -66, -68, -24, 56, -12, -70, 24, -82], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [79, 81, 55, 6, 78, 93, 81, 33, 29, 1, 27, 49, 21, 58, 22, 65, 44, 95, 6, 51, 75, 42, 14, 55, 79, 82, 90, 8, 15, 15, 53, 98, 76, 43, 33]]; int [] param1 = [4, 28, 30, 11, 29, 26, 9, 19, 9, 30]; 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); } " K_TH_LARGEST_SUM_CONTIGUOUS_SUBARRAY,"static int f_filled ( int arr [ ] , int n , int k ) { int sum [ ] = new int [ n + 1 ] ; sum [ 0 ] = 0 ; sum [ 1 ] = arr [ 0 ] ; for ( int i = 2 ; i <= n ; i ++ ) sum [ i ] = sum [ i - 1 ] + arr [ i - 1 ] ; PriorityQueue < Integer > Q = new PriorityQueue < Integer > ( ) ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = i ; j <= n ; j ++ ) { int x = sum [ j ] - sum [ i - 1 ] ; if ( Q . size ( ) < k ) Q . add ( x ) ; else { if ( Q . peek ( ) < x ) { Q . poll ( ) ; Q . add ( x ) ; } } } } return Q . poll ( ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [157, 166, 5, 508, -86, 3, 721, 36, 0, 1041]; int [] [] param0 = [[2, 3, 5, 7, 8, 29, 29, 44, 47, 52, 60, 65, 73, 83, 87, 92, 92, 95], [44, -98, -10, 14, -6, -46, 6, -74, -4, 36, 10, -2, 30, 28, 96, -84, -36, -76, 64, -74, -20, 94, -4, 14, 78, 52, -56, 98, -68, -76, -10, 20, 88, -98, 96, 80, 96, -32, -40, -30, 82], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 21, 97, 78, 78, 57, 29, 33, 57, 81, 66, 32, 11, 82, 28, 72, 46, 67, 42, 15, 60, 45, 16, 37], [-92, -90, -88, -84, -68, -66, -62, -58, -52, -44, -22, -16, -4, -4, 2, 12, 14, 14, 24, 26, 44, 56, 80, 90, 92, 94, 98], [1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0], [3, 4, 8, 12, 13, 14, 17, 19, 23, 24, 28, 29, 30, 35, 35, 38, 44, 47, 47, 53, 55, 56, 56, 58, 66, 67, 70, 71, 72, 73, 74, 75, 77, 78, 82, 84, 87, 87, 87, 88, 88, 93, 94, 96], [20, -58, 94, -70, 18, 16, -46, 38, -44, -92, -20, -70, -30, 50], [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], [90, 77, 82, 38, 96, 62, 66, 4, 93, 30, 75, 22, 26, 61, 40, 11, 38, 55, 88, 24, 66, 47, 40, 71, 21, 5, 18, 31, 26, 56, 19, 47, 71, 34]]; int [] param1 = [10, 34, 16, 14, 15, 5, 26, 11, 19, 28]; int [] param2 = [12, 37, 15, 20, 25, 5, 25, 7, 23, 32]; 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); } " POSITION_ELEMENT_STABLE_SORT,"static int f_filled ( int arr [ ] , int n , int idx ) { int result = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( arr [ i ] < arr [ idx ] ) result ++ ; if ( arr [ i ] == arr [ idx ] && i < idx ) result ++ ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [32, 20, 30, 24, 17, 14, 35, 7, 19, 1]; int [] [] param0 = [[4, 8, 9, 12, 15, 16, 18, 28, 28, 31, 33, 36, 36, 37, 40, 41, 44, 44, 46, 50, 50, 50, 52, 52, 54, 55, 60, 61, 65, 68, 71, 75, 75, 78, 81, 84, 87, 89, 90, 92, 94, 97, 97, 98, 98, 99], [-16, 86, 94, -86, -38, 64, 96, -64, 94, 10, -10, -62, -50, -46, -62, -32, -4, 72, 14, 36, 74, -66, 46, 82, -44, -22, -26, 16, -8, 0, -90, 94, -50, 22, -82, 8, 92, -84, -34, -36, -66], [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], [66, 8, 30, 84, 36, 96, 45, 63, 23, 23, 14, 34, 86, 51, 18, 97, 21, 39, 96, 70, 28, 96, 78, 68, 88, 66, 13, 24, 74, 94], [-94, -90, -86, -86, -72, -72, -58, -50, -32, -22, -18, -10, -4, -2, -2, 0, 0, 6, 14, 22, 22, 36, 36, 40, 44, 58, 60, 70, 70, 76, 82, 82, 84, 88, 96], [1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1], [3, 5, 6, 7, 8, 10, 17, 20, 20, 26, 27, 27, 27, 32, 32, 38, 40, 44, 45, 45, 45, 45, 47, 50, 57, 57, 57, 58, 62, 63, 63, 67, 68, 73, 75, 76, 77, 79, 79, 80, 85, 88, 89, 89, 89, 94, 96, 98], [98, -92, 18, -18, 44, -88, -90, -66, -38, 78, -22, -46, -20, 64, -10, 54], [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], [14, 17]]; int [] param1 = [37, 31, 30, 26, 17, 30, 42, 14, 19, 1]; int [] param2 = [32, 27, 34, 21, 31, 36, 35, 12, 31, 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); } " NUMBER_RECTANGLES_NM_GRID,"static long f_filled ( int n , int m ) { return ( m * n * ( n + 1 ) * ( m + 1 ) ) / 4 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [9296385, 1203345, 90, 326508, 212058, 259350, 1898100, 3558880, 1690650, 9900]; int [] param0 = [86, 33, 3, 91, 33, 13, 75, 58, 50, 4]; int [] param1 = [70, 65, 5, 12, 27, 75, 36, 64, 51, 44]; 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_HEIGHT_OF_TRIANGULAR_ARRANGEMENT_OF_ARRAY_VALUES_1,"static int f_filled ( int a [ ] , int n ) { return ( int ) Math . floor ( ( - 1 + Math . sqrt ( 1 + ( 8 * n ) ) ) / 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 4, 6, 4, 5, 6, 7, 1, 1, 3]; int [] [] param0 = [[1, 2, 2, 3, 5, 6, 7, 8, 8, 12, 15, 16, 18, 18, 20, 21, 21, 22, 22, 24, 24, 25, 30, 35, 42, 49, 52, 55, 55, 63, 68, 70, 72, 73, 77, 80, 83, 87, 87, 88, 88, 94, 95, 97], [48, -72, 84, -24, 28, 94, 36, 28, 32, 66, -62, 64, 6, -68, -12, 46, 4, 98, 18, 86, -60, 76, 14, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [11, 16, 84, 8, 86, 44, 79, 11, 73, 12, 29, 62, 22, 44, 28, 8, 48, 92, 73, 63, 59, 44, 95, 66], [-94, -94, -92, -88, -86, -82, -80, -80, -78, -76, -56, -56, -50, -44, -42, -36, -36, -32, -32, -26, -14, -12, -6, 12, 24, 28, 34, 38, 42, 42, 46, 50, 56, 62, 62, 74, 84, 92, 94], [0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0], [2, 2, 3, 3, 3, 4, 5, 13, 16, 18, 21, 22, 27, 28, 32, 34, 36, 37, 41, 42, 43, 51, 52, 52, 54, 54, 61, 65, 67, 67, 68, 71, 75, 77, 77, 78, 80, 81, 81, 84, 86, 90, 90, 93, 93, 94, 99, 99], [54, -86], [0, 1], [5, 54, 49, 80, 56, 62, 31, 49, 60, 19, 45, 94, 33, 46, 32]]; int [] param1 = [22, 12, 25, 14, 19, 24, 31, 1, 1, 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); } " FIND_THE_MAXIMUM_ELEMENT_IN_AN_ARRAY_WHICH_IS_FIRST_INCREASING_AND_THEN_DECREASING,"static int f_filled ( int arr [ ] , int low , int high ) { int max = arr [ low ] ; int i ; for ( i = low ; i <= high ; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ] ; } return max ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [94, 92, 1, 83, 86, 0, 97, 86, 1, 61]; int [] [] param0 = [[11, 15, 16, 19, 24, 25, 26, 28, 34, 34, 43, 61, 63, 66, 67, 72, 77, 79, 81, 83, 87, 94, 99], [8, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27], [-98, -94, -88, -84, -74, -72, -58, -52, -48, -48, -46, -42, -42, -32, -30, -30, -18, -10, -8, -8, -6, -4, 4, 6, 28, 30, 34, 38, 44, 48, 56, 58, 60, 64, 86], [0, 1, 0], [5, 9, 10, 16, 18, 19, 23, 24, 26, 33, 37, 44, 46, 54, 55, 57, 58, 59, 63, 64, 70, 75, 77, 81, 83, 84, 85, 85, 88, 89, 96, 97, 99], [86, 20, -50, 74, -78, 86], [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], [16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73, 30, 62, 77, 26, 66, 61, 61, 45]]; int [] param1 = [15, 1, 23, 8, 31, 2, 20, 3, 19, 28]; int [] param2 = [21, 1, 15, 13, 34, 2, 31, 5, 18, 22]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_THE_MINIMUM_DISTANCE_BETWEEN_TWO_NUMBERS,"static int f_filled ( int arr [ ] , int n , int x , int y ) { int i , j ; int min_dist = Integer . MAX_VALUE ; for ( i = 0 ; i < n ; i ++ ) { for ( j = i + 1 ; j < n ; j ++ ) { if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > Math . abs ( i - j ) ) min_dist = Math . abs ( i - j ) ; } } return min_dist ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [11, 4, 2147483647, 12, 1, 1, 18, 2147483647, 1, 2147483647]; int [] [] param0 = [[4, 7, 7, 8, 11, 14, 16, 25, 34, 35, 36, 36, 38, 40, 41, 43, 45, 47, 57, 60, 64, 72, 73, 74, 75, 82, 83, 83, 84, 84, 84, 92], [96, 70, 88, -64, -42, 58, 92, 66, -14, 90, -66, 12, 88, -12, 48, -4, 90, 24, 98, 14, 32, 38, 98, 78, 2, 26, 12, -36, 90, 80, 40, 58, 88, 64, 16], [0, 0, 1], [46, 96, 82, 73, 30, 36, 56, 20, 5, 36, 4, 7, 89, 63, 54, 97, 80, 56, 93, 34, 90, 56, 25, 27, 75, 68, 14, 90], [-96, -88, -82, -66, -62, -52, -52, -46, -46, -40, -40, -28, -24, -12, 0, 4, 10, 24, 42, 46, 48, 48, 50, 60, 62, 64, 64, 70, 92, 98], [0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1], [1, 2, 2, 6, 10, 14, 15, 18, 19, 22, 23, 29, 30, 37, 40, 40, 41, 41, 42, 42, 44, 46, 46, 54, 56, 72, 73, 81, 83, 83, 86, 88, 93], [46, 86, -52, 18, -32, 86, 2, 38, 72, 72, -60, 70, -58, 66, -66, -72, -74, 58, 52, 58, 16, 64, 62, -62, 80, -70, -96, -44, -20, -74, -10, 14, -32, 48, 30, 76, -16, 80, 66, -46, -92, 26, -86, 28, -76, -24, -98, 54, 50], [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], [32, 65, 10, 72, 17, 58, 79, 28, 67, 36, 18, 35]]; int [] param1 = [22, 25, 1, 26, 24, 10, 27, 30, 38, 7]; int [] param2 = [7, 58, 1, 54, 0, 0, 1, 25, 0, 10]; int [] param3 = [40, 70, 1, 82, 4, 1, 42, 45, 0, 7]; 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); } " LONGEST_SUBSEQUENCE_SUCH_THAT_DIFFERENCE_BETWEEN_ADJACENTS_IS_ONE,"static int f_filled ( int arr [ ] , int n ) { int dp [ ] = new int [ n ] ; for ( int i = 0 ; i < n ; i ++ ) dp [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { for ( int j = 0 ; j < i ; j ++ ) { if ( ( arr [ i ] == arr [ j ] + 1 ) || ( arr [ i ] == arr [ j ] - 1 ) ) dp [ i ] = Math . max ( dp [ i ] , dp [ j ] + 1 ) ; } } int result = 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( result < dp [ i ] ) result = dp [ i ] ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 1, 2, 1, 1, 12, 3, 1, 2, 2]; int [] [] param0 = [[2, 13, 15, 17, 18, 20, 22, 24, 28, 34, 37, 43, 46, 47, 49, 51, 52, 54, 58, 64, 65, 77, 78, 79, 87, 90, 92, 93, 94, 97], [-86, -56, 76, 86, 42, -40, 8, 34, -48, -54, -80, 6, 42, 48, 76, -26, 6], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 22, 15, 26, 29, 47, 22], [-90, -84, -76, -76, -74, -74, -66, -58, -58, -56, -56, -44, -38, -36, -34, -32, -16, -10, 2, 6, 24, 24, 24, 34, 36, 54, 60, 68, 70, 76, 88], [0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1], [1, 3, 12, 12, 12, 12, 14, 17, 18, 19, 23, 27, 28, 30, 35, 38, 42, 44, 45, 48, 52, 59, 61, 64, 65, 69, 73, 76, 77, 82, 83, 85, 87, 99], [-54, -20, 24, -78, -58, 64, 34, 70, -36, -24], [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], [5, 35, 75, 21, 82, 32, 28, 53, 20, 27, 42, 92, 32, 70, 81, 75, 72, 66, 97, 60, 11, 83, 14, 30, 5, 68, 17, 27, 62, 86, 26, 20, 97, 91, 44, 69]]; int [] param1 = [23, 15, 16, 5, 17, 26, 23, 8, 27, 20]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_FOR_SURFACE_AREA_OF_OCTAHEDRON,"static double f_filled ( double side ) { return ( 2 * ( Math . sqrt ( 3 ) ) * ( side * side ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [7275798.574924052, 266562009.34357828, 30114046.875937637, 4857977.358664159, 190866258.51879707, 116865336.10679008, 2385823.7719733207, 188079541.63799432, 107551908.5552799, 55396369.52612884]; double [] param0 = [1449.255716877097, -8772.104874265995, 2948.419328234334, -1184.220109553511, 7422.825800698956, -5808.280006171851, 829.8963781665169, -7368.438572511732, 5572.033890611617, -3998.9441642787706]; 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_THE_MISSING_NUMBER_2,"static int f_filled ( int a [ ] , int n ) { int x1 = a [ 0 ] ; int x2 = 1 ; for ( int i = 1 ; i < n ; i ++ ) x1 = x1 ^ a [ i ] ; for ( int i = 2 ; i <= n + 1 ; i ++ ) x2 = x2 ^ i ; return ( x1 ^ x2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [50, -91, 1, 109, 94, 42, 124, 101, 0, 32]; int [] [] param0 = [[2, 5, 7, 8, 10, 14, 27, 32, 51, 52, 57, 58, 65, 68, 68, 72, 73, 73, 83, 92, 98], [-60, -48, 38, -78, 88, 86, -4, -94, 16, -64, 32, 88, 58, -78, -16, 48, 38, 30, 66, -60, 20, 40, -28, -64, -48, -86, -80, -8, -58, 52, 80, -32, 46, -4, -70, 76, -4, 78, -64, 38, -40], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [69, 59, 22, 33, 69, 28, 11, 34, 72, 88, 16, 30, 69, 89, 43, 4, 65, 85, 27], [-98, -98, -92, -88, -88, -82, -74, -70, -68, -60, -60, -48, -38, -34, -34, -24, 14, 38, 50, 58, 62, 64, 64, 68, 76, 78, 78, 86, 88, 90, 92, 98, 98], [0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0], [1, 9, 12, 12, 24, 25, 33, 33, 36, 39, 46, 48, 48, 52, 52, 53, 57, 69, 71, 72, 75, 76, 78, 80, 82, 86, 89, 91, 94, 95, 96, 97, 98, 99], [62, -66, 60, -92, 46, 6, -52, 48, 72, -64, 34, 20, 50, 70, -34, 20, -70, 14, -44, 66, -70], [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], [33, 10, 6, 71, 18, 22, 15, 57, 56, 63, 35, 93, 31, 43, 98, 99, 62, 39, 44, 86, 78, 95, 6, 76, 71]]; int [] param1 = [12, 28, 38, 13, 23, 41, 30, 17, 30, 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); } " FIND_THE_NUMBER_OCCURRING_ODD_NUMBER_OF_TIMES,"static int f_filled ( int arr [ ] , int arr_size ) { int i ; for ( i = 0 ; i < arr_size ; i ++ ) { int count = 0 ; for ( int j = 0 ; j < arr_size ; j ++ ) { if ( arr [ i ] == arr [ j ] ) count ++ ; } if ( count % 2 != 0 ) return arr [ i ] ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, -56, 0, 36, -84, 1, 11, 52, 0, 4]; int [] [] param0 = [[1, 5, 5, 8, 14, 15, 17, 17, 18, 23, 23, 25, 26, 35, 36, 39, 51, 53, 56, 56, 60, 62, 64, 64, 65, 66, 67, 68, 71, 75, 80, 82, 83, 88, 89, 91, 91, 92, 93, 95, 99], [-56, 98, 44, 30, -88, 18, 60, 86, 4, 16, 10, 64, -22, -86, -66, -16, 70, -44, 98, 78, -96, -66, 92, 10, 40, -16], [0, 0, 0, 0, 0, 1, 1, 1], [36, 11, 83, 41, 42, 14, 46, 89, 91, 96, 57, 42, 74, 73, 9, 26, 79, 40, 31, 69, 44, 39, 14, 92, 34, 20, 52, 47, 14], [-84, -84, -84, -78, -66, -62, -62, -36, -24, -10, -10, -8, -4, -2, 12, 14, 20, 22, 36, 42, 46, 66, 84, 96, 96, 98], [1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [11, 12, 14, 28, 42, 48, 50, 58, 67, 74, 86, 89, 95], [52, -56, -6, 74, 10, 68, 74, 10, 16, -80, 82, -32, 6, -6, 82, 20], [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], [4, 80, 92]]; int [] param1 = [31, 19, 6, 25, 23, 19, 7, 11, 31, 1]; 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); } " HEIGHT_COMPLETE_BINARY_TREE_HEAP_N_NODES,"static int f_filled ( int N ) { return ( int ) Math . ceil ( Math . log ( N + 1 ) / Math . log ( 2 ) ) - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 6, 5, 4, 3, 0, 5, 6, 5, 4]; int [] param0 = [65, 94, 52, 31, 9, 1, 41, 98, 45, 24]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_PRINT_IDENTITY_MATRIX_1,"static boolean f_filled ( int mat [ ] [ ] , int N ) { for ( int row = 0 ; row < N ; row ++ ) { for ( int col = 0 ; col < N ; col ++ ) { if ( row == col && mat [ row ] [ col ] != 1 ) return false ; else if ( row != col && mat [ row ] [ col ] != 0 ) return false ; } } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, false, false, false, false]; int [] [] [] param0 = [[[1]], [[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 0, 1]], [[1, 0, 0, 0], [0, 1, 0, 0], [0, 0, 1, 0], [1, 0, 0, 1]], [[80, 68, 67, 24, 55, 89, 15, 35, 7, 28, 36, 65, 76, 4, 97, 99, 82, 21, 14, 55, 66, 43, 28, 81, 94, 23, 43, 97, 74], [94, 39, 98, 29, 57, 15, 49, 96, 28, 97, 8, 4, 39, 58, 71, 76, 88, 85, 9, 89, 93, 64, 44, 64, 41, 47, 26, 70, 75], [47, 8, 15, 88, 50, 27, 9, 88, 95, 51, 96, 43, 14, 14, 38, 63, 40, 60, 41, 80, 13, 74, 29, 26, 52, 95, 86, 39, 66], [40, 65, 70, 92, 28, 99, 1, 80, 18, 13, 45, 88, 67, 16, 75, 91, 37, 2, 80, 33, 64, 4, 59, 6, 11, 11, 25, 39, 7], [43, 70, 31, 99, 4, 1, 98, 30, 76, 89, 2, 14, 6, 28, 56, 19, 30, 87, 98, 75, 37, 39, 1, 84, 29, 92, 71, 67, 54], [18, 97, 8, 12, 59, 68, 25, 40, 24, 82, 22, 43, 73, 59, 17, 92, 67, 90, 14, 95, 8, 41, 3, 7, 69, 59, 15, 63, 88], [32, 57, 74, 7, 87, 61, 83, 38, 83, 68, 1, 89, 92, 76, 94, 21, 25, 27, 62, 29, 21, 88, 14, 59, 20, 77, 7, 35, 5], [22, 72, 82, 3, 58, 73, 55, 65, 23, 83, 65, 96, 63, 16, 92, 63, 60, 76, 91, 58, 7, 65, 3, 61, 13, 12, 6, 88, 83], [15, 52, 62, 34, 57, 88, 56, 16, 25, 23, 50, 90, 57, 94, 56, 62, 33, 20, 71, 66, 7, 10, 88, 35, 47, 42, 61, 9, 1], [85, 33, 29, 35, 54, 26, 37, 63, 35, 16, 22, 97, 68, 22, 14, 70, 84, 89, 93, 85, 54, 15, 15, 77, 15, 80, 81, 60, 64], [4, 62, 17, 84, 89, 79, 9, 58, 43, 16, 10, 32, 36, 93, 76, 7, 44, 93, 12, 19, 25, 34, 80, 53, 65, 69, 9, 71, 56], [65, 37, 85, 44, 43, 68, 55, 69, 55, 52, 47, 38, 41, 37, 32, 24, 35, 59, 46, 41, 48, 51, 87, 64, 75, 71, 94, 17, 60], [50, 6, 95, 63, 14, 78, 8, 83, 46, 7, 32, 90, 3, 25, 88, 78, 11, 34, 57, 10, 18, 33, 75, 14, 68, 6, 98, 12, 36], [11, 73, 12, 20, 89, 5, 78, 56, 3, 36, 98, 63, 11, 88, 4, 9, 87, 20, 62, 87, 23, 3, 54, 51, 99, 10, 30, 34, 33], [79, 23, 94, 80, 42, 32, 29, 28, 18, 35, 74, 94, 89, 52, 11, 74, 5, 15, 78, 99, 38, 94, 95, 89, 92, 79, 74, 13, 24], [74, 87, 21, 34, 25, 60, 49, 92, 29, 88, 22, 65, 27, 24, 89, 32, 90, 42, 67, 24, 71, 47, 79, 12, 73, 42, 2, 80, 13], [79, 84, 54, 87, 94, 43, 62, 11, 48, 36, 26, 22, 27, 31, 14, 87, 30, 23, 6, 43, 64, 76, 68, 2, 33, 14, 13, 63, 4], [77, 96, 66, 22, 59, 32, 40, 81, 24, 58, 39, 63, 53, 3, 68, 37, 29, 11, 50, 38, 74, 64, 70, 5, 75, 46, 47, 15, 75], [5, 87, 49, 47, 42, 18, 34, 58, 72, 65, 68, 73, 17, 74, 93, 85, 97, 97, 93, 36, 97, 70, 49, 84, 24, 73, 21, 36, 92], [97, 58, 52, 86, 90, 71, 1, 92, 71, 85, 32, 71, 27, 68, 71, 96, 57, 62, 81, 98, 25, 89, 13, 84, 59, 91, 83, 92, 43], [74, 54, 73, 63, 20, 19, 13, 22, 96, 46, 80, 60, 68, 40, 12, 34, 43, 41, 57, 49, 24, 69, 54, 29, 20, 65, 13, 50, 54], [93, 26, 9, 10, 61, 46, 49, 40, 3, 93, 22, 24, 99, 19, 77, 92, 10, 27, 28, 5, 8, 4, 56, 9, 52, 76, 89, 28, 82], [73, 33, 56, 17, 7, 59, 85, 95, 64, 16, 40, 86, 27, 59, 65, 49, 55, 27, 35, 93, 97, 27, 73, 14, 78, 33, 27, 84, 5], [37, 93, 55, 95, 95, 70, 37, 78, 49, 62, 65, 26, 85, 16, 70, 36, 39, 59, 33, 24, 62, 53, 80, 30, 91, 28, 44, 92, 12], [45, 91, 17, 24, 74, 67, 90, 86, 68, 26, 55, 20, 65, 9, 51, 69, 74, 76, 3, 90, 3, 64, 81, 81, 89, 73, 60, 76, 21], [4, 53, 19, 1, 88, 95, 30, 83, 85, 76, 74, 29, 59, 52, 92, 46, 74, 93, 67, 96, 46, 88, 45, 87, 56, 28, 49, 57, 96], [10, 41, 45, 41, 2, 48, 49, 20, 48, 21, 60, 57, 10, 69, 47, 91, 34, 23, 5, 89, 61, 36, 51, 19, 59, 23, 96, 90, 94], [16, 12, 62, 79, 4, 78, 25, 56, 40, 44, 66, 42, 75, 95, 91, 17, 78, 79, 41, 79, 17, 7, 99, 81, 47, 36, 67, 74, 68], [78, 88, 92, 77, 75, 10, 5, 97, 22, 77, 70, 97, 86, 14, 3, 6, 39, 95, 21, 38, 33, 68, 52, 24, 22, 38, 37, 98, 46]], [[54, 16, 12, 57, 31, 31, 71, 17, 46], [74, 81, 65, 60, 4, 64, 19, 31, 18], [42, 3, 51, 46, 58, 13, 72, 29, 69], [6, 81, 28, 72, 32, 8, 11, 14, 16], [9, 2, 29, 22, 52, 42, 78, 46, 15], [70, 89, 42, 58, 72, 9, 21, 23, 34], [37, 33, 35, 32, 96, 38, 69, 53, 18], [35, 19, 88, 73, 2, 67, 92, 61, 29], [49, 40, 86, 14, 67, 89, 37, 66, 29]], [[6, 45, 61, 50, 95, 16, 88, 4, 77, 57, 23, 14, 58, 9, 94, 61, 56, 58, 52, 22, 3, 88, 34, 16, 75, 37, 40, 45, 19, 5, 38, 43, 25, 90, 33, 54, 45, 58, 91, 26, 72, 59, 90, 58], [57, 23, 46, 56, 38, 75, 35, 81, 92, 15, 69, 75, 73, 74, 2, 25, 82, 15, 3, 66, 55, 50, 78, 42, 27, 20, 59, 82, 84, 99, 77, 60, 29, 87, 2, 93, 4, 73, 58, 75, 24, 91, 34, 60], [48, 16, 15, 20, 93, 77, 91, 76, 26, 29, 82, 81, 6, 17, 65, 78, 72, 13, 17, 21, 70, 68, 27, 5, 86, 42, 29, 93, 22, 85, 83, 47, 34, 71, 20, 66, 38, 51, 11, 98, 69, 33, 11, 61], [52, 98, 3, 21, 45, 88, 95, 71, 96, 74, 5, 34, 29, 25, 22, 4, 45, 34, 27, 34, 25, 6, 20, 64, 95, 6, 38, 70, 47, 12, 16, 31, 36, 69, 52, 3, 42, 99, 39, 51, 4, 83, 43, 89], [82, 5, 49, 81, 7, 20, 64, 69, 5, 76, 7, 66, 34, 32, 73, 21, 39, 84, 11, 79, 12, 75, 41, 22, 9, 55, 83, 58, 20, 91, 23, 55, 14, 41, 90, 34, 28, 82, 71, 31, 75, 97, 13, 70], [14, 38, 99, 57, 37, 89, 94, 35, 32, 3, 8, 80, 7, 36, 13, 14, 62, 18, 9, 65, 10, 62, 18, 23, 79, 18, 19, 27, 85, 5, 24, 89, 4, 18, 79, 55, 50, 53, 93, 98, 47, 79, 11, 44], [36, 45, 81, 66, 95, 20, 70, 67, 48, 14, 53, 71, 38, 92, 33, 65, 19, 93, 70, 82, 49, 39, 20, 99, 49, 26, 62, 14, 51, 43, 50, 67, 79, 71, 1, 79, 44, 88, 77, 29, 16, 17, 79, 37], [47, 63, 92, 95, 43, 92, 58, 38, 70, 7, 33, 6, 22, 24, 57, 14, 16, 99, 86, 58, 7, 60, 18, 86, 66, 12, 99, 35, 62, 84, 16, 64, 7, 64, 37, 26, 89, 95, 46, 22, 82, 41, 63, 81], [44, 45, 67, 38, 12, 94, 31, 12, 24, 7, 81, 14, 25, 88, 7, 44, 78, 20, 67, 49, 64, 52, 5, 3, 79, 95, 29, 50, 30, 76, 57, 35, 11, 10, 73, 35, 62, 92, 19, 47, 61, 2, 21, 18], [26, 32, 78, 90, 56, 43, 74, 23, 88, 4, 86, 76, 75, 51, 45, 76, 49, 47, 27, 34, 53, 44, 52, 31, 79, 34, 51, 75, 38, 20, 58, 29, 11, 42, 82, 67, 83, 48, 32, 6, 89, 88, 36, 2], [75, 60, 53, 13, 83, 51, 2, 9, 67, 24, 12, 85, 4, 11, 94, 3, 51, 30, 7, 13, 47, 80, 21, 11, 52, 13, 31, 99, 10, 60, 53, 8, 4, 86, 74, 41, 98, 64, 11, 4, 48, 55, 58, 8], [2, 30, 97, 44, 20, 75, 85, 39, 34, 37, 66, 61, 85, 96, 26, 13, 78, 59, 37, 25, 20, 50, 21, 90, 39, 22, 51, 9, 49, 2, 83, 89, 98, 11, 32, 91, 57, 83, 80, 23, 48, 62, 14, 20], [43, 87, 42, 65, 98, 57, 25, 16, 20, 23, 86, 8, 47, 82, 85, 56, 95, 80, 72, 83, 35, 17, 35, 51, 7, 64, 49, 87, 99, 37, 25, 55, 86, 58, 82, 59, 73, 4, 97, 76, 70, 36, 39, 51], [38, 79, 75, 87, 98, 4, 60, 71, 43, 12, 30, 59, 89, 91, 67, 85, 59, 74, 94, 10, 36, 88, 59, 15, 90, 20, 62, 67, 7, 65, 48, 85, 72, 42, 24, 33, 85, 37, 70, 8, 91, 33, 60, 36], [65, 64, 13, 60, 62, 41, 27, 90, 90, 72, 40, 55, 83, 31, 54, 47, 1, 86, 27, 93, 91, 95, 44, 56, 6, 72, 93, 67, 17, 24, 19, 52, 46, 25, 58, 37, 42, 71, 62, 96, 38, 4, 80, 44], [25, 70, 58, 20, 57, 12, 57, 29, 95, 36, 54, 63, 48, 92, 43, 87, 72, 58, 39, 85, 42, 53, 1, 7, 1, 56, 52, 4, 47, 50, 12, 4, 57, 9, 54, 72, 6, 50, 67, 1, 20, 88, 70, 59], [9, 39, 54, 75, 64, 97, 52, 37, 52, 22, 14, 87, 16, 69, 20, 85, 45, 43, 96, 14, 14, 12, 35, 79, 23, 85, 23, 27, 82, 1, 63, 1, 69, 26, 82, 14, 95, 30, 13, 87, 95, 73, 52, 18], [6, 50, 3, 2, 89, 32, 77, 57, 75, 12, 49, 25, 53, 14, 23, 77, 32, 40, 48, 25, 66, 28, 42, 86, 68, 80, 88, 40, 85, 24, 41, 64, 77, 8, 8, 72, 51, 86, 72, 58, 36, 95, 74, 34], [70, 93, 46, 18, 15, 36, 4, 3, 8, 86, 82, 87, 44, 93, 54, 95, 26, 25, 59, 81, 58, 14, 15, 60, 98, 87, 24, 59, 43, 3, 91, 91, 42, 37, 4, 88, 2, 96, 49, 93, 60, 87, 58, 23], [60, 63, 45, 25, 49, 83, 69, 50, 69, 72, 72, 60, 68, 66, 46, 20, 32, 31, 47, 72, 54, 64, 18, 96, 24, 99, 73, 31, 97, 28, 81, 36, 35, 87, 64, 97, 56, 11, 15, 58, 5, 99, 20, 91], [48, 71, 80, 56, 84, 33, 73, 39, 19, 51, 80, 90, 54, 22, 50, 30, 41, 22, 74, 29, 74, 16, 26, 75, 89, 31, 32, 73, 64, 89, 37, 87, 51, 20, 59, 41, 18, 23, 54, 53, 79, 87, 69, 72], [37, 2, 19, 48, 66, 62, 73, 81, 90, 78, 3, 66, 10, 49, 32, 44, 67, 24, 28, 63, 79, 25, 89, 59, 63, 55, 22, 92, 22, 9, 37, 36, 48, 88, 47, 92, 83, 44, 38, 60, 87, 67, 85, 10], [67, 95, 54, 94, 33, 72, 62, 96, 67, 16, 87, 35, 54, 38, 79, 59, 53, 57, 96, 51, 52, 78, 72, 22, 80, 86, 53, 38, 47, 72, 95, 22, 72, 10, 53, 95, 49, 22, 13, 12, 29, 50, 36, 60], [91, 79, 47, 95, 10, 98, 88, 93, 69, 89, 80, 90, 55, 17, 76, 40, 46, 42, 41, 56, 62, 40, 19, 87, 95, 46, 37, 61, 33, 96, 85, 83, 60, 37, 73, 55, 70, 56, 27, 42, 50, 32, 86, 97], [65, 30, 27, 47, 8, 3, 73, 16, 19, 68, 38, 37, 90, 62, 83, 12, 15, 34, 29, 26, 48, 90, 64, 28, 61, 17, 86, 10, 81, 92, 23, 75, 16, 97, 76, 89, 61, 4, 54, 92, 70, 91, 67, 92], [68, 8, 75, 73, 41, 37, 79, 63, 2, 96, 29, 18, 80, 66, 63, 88, 95, 13, 31, 83, 51, 56, 39, 69, 79, 9, 1, 84, 86, 66, 74, 27, 10, 35, 40, 96, 41, 42, 18, 95, 54, 74, 11, 71], [64, 45, 42, 50, 83, 34, 54, 55, 99, 11, 74, 78, 20, 29, 47, 41, 68, 12, 8, 14, 42, 63, 98, 55, 36, 20, 79, 75, 30, 57, 17, 75, 33, 39, 39, 4, 15, 39, 48, 32, 61, 13, 4, 5], [34, 40, 40, 57, 3, 45, 81, 4, 34, 43, 63, 51, 55, 65, 91, 29, 59, 9, 23, 90, 79, 80, 82, 24, 91, 31, 45, 76, 32, 91, 81, 59, 69, 92, 98, 54, 48, 48, 9, 54, 51, 52, 46, 72], [14, 30, 64, 76, 37, 19, 73, 70, 80, 21, 32, 65, 6, 82, 82, 63, 9, 84, 83, 18, 18, 72, 18, 34, 3, 69, 3, 40, 27, 4, 20, 6, 59, 41, 64, 5, 49, 1, 4, 48, 51, 3, 73, 98], [78, 67, 32, 90, 78, 32, 16, 15, 20, 39, 75, 80, 20, 67, 4, 6, 6, 45, 48, 97, 13, 39, 50, 4, 62, 92, 78, 12, 88, 89, 27, 69, 17, 59, 27, 79, 36, 66, 14, 81, 32, 68, 46, 77], [25, 26, 66, 77, 45, 94, 29, 69, 7, 55, 43, 41, 14, 68, 98, 98, 75, 81, 91, 93, 58, 36, 75, 16, 52, 95, 41, 76, 6, 2, 12, 50, 66, 7, 63, 24, 96, 36, 12, 47, 58, 86, 20, 8], [43, 30, 21, 45, 62, 76, 21, 12, 5, 98, 24, 39, 66, 8, 10, 47, 52, 62, 69, 33, 43, 63, 94, 47, 89, 35, 2, 97, 68, 27, 91, 67, 79, 76, 63, 44, 62, 26, 71, 41, 65, 11, 63, 68], [83, 26, 88, 87, 27, 89, 90, 44, 25, 11, 24, 51, 63, 87, 21, 47, 30, 87, 41, 10, 51, 68, 19, 99, 3, 60, 9, 1, 88, 96, 50, 51, 4, 7, 21, 19, 81, 12, 3, 68, 86, 76, 94, 27], [70, 20, 21, 16, 66, 54, 91, 72, 58, 19, 87, 21, 83, 86, 36, 55, 90, 93, 21, 99, 40, 83, 70, 10, 74, 29, 47, 2, 90, 40, 54, 7, 42, 58, 81, 86, 96, 50, 78, 91, 13, 8, 19, 75], [48, 77, 22, 83, 16, 42, 23, 23, 66, 28, 93, 6, 55, 33, 71, 80, 69, 45, 17, 65, 61, 36, 96, 88, 34, 91, 96, 16, 38, 82, 14, 46, 93, 30, 80, 71, 78, 32, 88, 10, 49, 64, 80, 71], [43, 22, 43, 14, 39, 21, 40, 9, 28, 58, 67, 37, 48, 21, 15, 23, 65, 37, 95, 9, 78, 72, 24, 15, 61, 34, 60, 71, 89, 67, 54, 12, 65, 93, 7, 33, 32, 66, 15, 77, 35, 49, 7, 37], [11, 94, 76, 42, 84, 60, 54, 9, 48, 62, 66, 29, 46, 66, 39, 5, 50, 42, 11, 70, 68, 44, 97, 32, 66, 78, 94, 30, 74, 62, 30, 9, 72, 93, 86, 56, 39, 33, 3, 69, 90, 82, 84, 52], [58, 42, 85, 13, 96, 49, 7, 2, 15, 63, 99, 30, 99, 61, 4, 70, 61, 2, 41, 89, 65, 73, 26, 81, 80, 99, 19, 60, 97, 47, 82, 52, 99, 46, 20, 64, 72, 76, 77, 87, 83, 71, 61, 27], [52, 73, 93, 29, 14, 16, 36, 20, 50, 20, 82, 46, 13, 97, 48, 91, 3, 64, 95, 94, 57, 80, 35, 72, 96, 88, 2, 90, 46, 85, 12, 85, 6, 72, 26, 43, 6, 23, 98, 98, 57, 5, 88, 33], [16, 41, 49, 59, 67, 92, 11, 44, 53, 79, 8, 47, 38, 89, 16, 59, 8, 57, 45, 87, 27, 63, 52, 23, 70, 22, 27, 95, 39, 42, 53, 70, 77, 14, 37, 66, 40, 42, 83, 19, 15, 51, 42, 31], [11, 64, 69, 92, 73, 96, 98, 93, 44, 68, 87, 34, 37, 60, 65, 74, 41, 20, 72, 60, 58, 91, 84, 58, 54, 16, 68, 88, 17, 9, 20, 10, 2, 24, 80, 41, 15, 99, 74, 19, 83, 88, 77, 97], [1, 23, 97, 64, 27, 1, 39, 25, 98, 41, 57, 7, 11, 26, 60, 53, 1, 88, 78, 45, 83, 1, 7, 43, 35, 34, 68, 40, 20, 64, 82, 66, 61, 46, 54, 50, 30, 55, 51, 83, 9, 47, 89, 94], [58, 17, 59, 16, 88, 29, 50, 63, 79, 86, 5, 74, 37, 36, 17, 23, 2, 55, 85, 19, 88, 94, 98, 10, 80, 3, 18, 2, 90, 24, 45, 95, 42, 7, 59, 46, 44, 93, 35, 30, 4, 89, 62, 45], [30, 12, 55, 36, 47, 2, 26, 57, 75, 42, 38, 56, 75, 95, 26, 95, 37, 73, 28, 31, 29, 46, 25, 96, 15, 77, 85, 19, 76, 71, 83, 23, 1, 93, 59, 94, 64, 45, 37, 9, 92, 92, 66, 5]], [[65, 34, 26, 9, 37, 67, 53, 2, 72, 64, 94, 58, 2, 94, 35, 57, 91, 79, 54, 72, 39, 11, 27, 46, 26, 53, 1, 43, 93, 8, 32, 94, 4], [70, 74, 34, 17, 26, 35, 12, 1, 81, 4, 69, 57, 12, 53, 47, 75, 31, 54, 38, 4, 75, 27, 12, 68, 75, 76, 32, 30, 97, 65, 71, 82, 58], [55, 76, 56, 98, 18, 2, 69, 56, 84, 19, 8, 83, 11, 32, 19, 33, 18, 70, 85, 12, 21, 53, 84, 42, 79, 57, 48, 74, 4, 32, 56, 93, 25], [81, 46, 85, 84, 85, 1, 12, 93, 15, 95, 36, 6, 66, 53, 15, 15, 22, 13, 52, 78, 51, 78, 13, 12, 16, 6, 33, 46, 74, 60, 42, 23, 86], [24, 32, 97, 90, 96, 79, 70, 38, 1, 40, 31, 81, 50, 18, 5, 83, 71, 28, 59, 22, 85, 88, 9, 42, 42, 80, 1, 53, 69, 19, 28, 6, 7], [94, 36, 5, 98, 38, 21, 4, 80, 67, 31, 67, 25, 86, 20, 25, 51, 91, 81, 49, 36, 34, 90, 15, 17, 73, 93, 29, 64, 65, 69, 15, 99, 85], [51, 3, 38, 69, 97, 30, 29, 16, 18, 38, 53, 56, 27, 45, 82, 52, 93, 83, 38, 48, 58, 63, 75, 35, 57, 3, 64, 35, 91, 2, 3, 11, 17], [42, 87, 47, 48, 84, 66, 97, 47, 22, 24, 25, 13, 60, 82, 36, 33, 6, 21, 37, 70, 99, 46, 59, 7, 48, 43, 85, 61, 88, 23, 28, 62, 67], [39, 1, 60, 53, 83, 73, 88, 11, 94, 21, 35, 42, 70, 76, 11, 21, 37, 94, 77, 44, 16, 18, 11, 48, 23, 31, 88, 99, 47, 51, 5, 84, 39], [76, 36, 4, 40, 26, 32, 68, 98, 87, 61, 86, 9, 7, 19, 87, 82, 25, 89, 88, 17, 71, 90, 93, 96, 93, 38, 79, 40, 37, 39, 50, 78, 27], [93, 50, 25, 86, 64, 79, 31, 5, 2, 79, 17, 28, 43, 55, 75, 86, 80, 44, 40, 79, 22, 86, 76, 39, 29, 94, 55, 21, 58, 16, 11, 25, 3], [65, 46, 21, 53, 94, 31, 36, 95, 56, 15, 61, 79, 47, 91, 6, 3, 77, 58, 19, 1, 14, 3, 88, 14, 25, 26, 87, 31, 32, 92, 34, 1, 10], [32, 23, 80, 11, 71, 66, 61, 14, 5, 4, 20, 46, 14, 22, 46, 33, 79, 10, 23, 40, 27, 14, 53, 96, 36, 18, 88, 72, 21, 89, 54, 41, 15], [58, 51, 83, 78, 50, 9, 74, 89, 78, 45, 35, 48, 16, 22, 87, 98, 55, 14, 45, 66, 39, 69, 15, 63, 90, 99, 58, 71, 72, 58, 66, 60, 59], [75, 60, 51, 45, 94, 80, 68, 18, 55, 52, 91, 83, 75, 66, 82, 59, 25, 32, 60, 99, 55, 18, 44, 8, 47, 70, 23, 50, 47, 70, 7, 82, 75], [99, 87, 34, 94, 16, 25, 38, 55, 34, 47, 95, 19, 23, 33, 65, 4, 12, 69, 58, 37, 49, 64, 31, 15, 8, 81, 49, 21, 43, 17, 36, 69, 66], [36, 37, 27, 32, 39, 87, 14, 14, 20, 91, 54, 77, 73, 98, 84, 49, 31, 88, 35, 60, 64, 92, 11, 25, 83, 61, 81, 9, 17, 75, 41, 26, 9], [56, 72, 59, 52, 16, 37, 54, 75, 37, 61, 38, 68, 69, 30, 45, 88, 94, 90, 63, 37, 68, 93, 36, 66, 81, 75, 22, 26, 70, 1, 91, 57, 48], [12, 1, 43, 29, 13, 3, 73, 28, 90, 13, 17, 93, 52, 42, 98, 43, 50, 25, 73, 54, 77, 70, 68, 53, 34, 14, 36, 19, 74, 2, 3, 62, 91], [53, 16, 54, 88, 98, 49, 27, 72, 31, 44, 42, 79, 26, 27, 2, 29, 98, 49, 13, 86, 43, 39, 15, 35, 93, 47, 36, 30, 55, 50, 14, 6, 62], [78, 34, 23, 81, 13, 49, 39, 23, 3, 56, 41, 98, 47, 22, 13, 60, 99, 73, 1, 12, 63, 72, 96, 76, 28, 40, 41, 59, 78, 36, 67, 94, 80], [49, 16, 72, 51, 7, 35, 73, 49, 91, 86, 45, 12, 4, 60, 56, 32, 55, 92, 19, 93, 55, 11, 79, 31, 58, 36, 61, 16, 68, 36, 80, 2, 61], [5, 36, 19, 30, 33, 96, 99, 83, 98, 89, 30, 33, 31, 36, 31, 65, 94, 40, 31, 13, 42, 60, 66, 2, 74, 95, 41, 77, 59, 60, 23, 29, 50], [44, 80, 2, 23, 40, 79, 46, 11, 47, 85, 79, 1, 36, 61, 2, 56, 79, 51, 31, 3, 44, 76, 47, 12, 37, 43, 13, 43, 47, 2, 98, 56, 7], [16, 78, 74, 73, 14, 67, 14, 10, 48, 6, 18, 81, 76, 3, 95, 20, 59, 93, 2, 69, 49, 45, 12, 25, 31, 17, 37, 17, 9, 21, 88, 21, 10], [76, 93, 65, 22, 27, 8, 28, 66, 46, 92, 12, 73, 84, 28, 43, 95, 15, 83, 77, 90, 32, 85, 52, 89, 21, 82, 11, 21, 11, 98, 70, 31, 43], [44, 70, 41, 47, 92, 72, 99, 44, 62, 51, 70, 76, 10, 37, 50, 27, 39, 42, 81, 59, 82, 41, 33, 57, 57, 4, 14, 34, 95, 59, 33, 16, 2], [22, 63, 34, 90, 6, 55, 79, 36, 55, 52, 96, 12, 19, 95, 26, 58, 31, 41, 77, 55, 25, 22, 13, 64, 39, 2, 53, 77, 70, 60, 40, 99, 14], [81, 48, 68, 96, 21, 87, 19, 85, 97, 55, 12, 43, 26, 17, 74, 82, 37, 66, 79, 27, 39, 8, 33, 69, 69, 51, 64, 64, 65, 55, 69, 40, 64], [87, 40, 17, 98, 18, 93, 65, 49, 93, 30, 55, 5, 70, 42, 31, 1, 23, 72, 23, 4, 25, 27, 77, 39, 19, 20, 89, 83, 70, 31, 97, 14, 67], [13, 48, 77, 97, 13, 89, 48, 57, 27, 18, 84, 78, 58, 84, 73, 45, 97, 6, 12, 27, 63, 83, 59, 51, 75, 15, 28, 89, 14, 24, 34, 91, 77], [92, 66, 37, 4, 47, 78, 71, 32, 83, 73, 64, 91, 27, 29, 83, 9, 39, 58, 80, 63, 43, 59, 14, 22, 75, 40, 39, 66, 91, 12, 83, 94, 59], [76, 33, 76, 72, 72, 20, 38, 51, 14, 15, 85, 73, 91, 6, 11, 38, 69, 33, 33, 80, 82, 48, 38, 10, 66, 80, 57, 74, 23, 85, 93, 17, 63]], [[20, 59, 92, 38, 68, 74, 80, 12, 75, 17, 90, 28, 32, 68, 51, 92, 9, 87, 92, 42, 1, 58, 4, 54, 95, 81, 87, 47, 29, 71, 32], [91, 56, 90, 35, 34, 99, 8, 1, 13, 48, 11, 13, 98, 49, 66, 59, 93, 31, 94, 67, 76, 95, 12, 9, 3, 97, 74, 32, 52, 88, 51], [78, 15, 37, 60, 60, 51, 19, 57, 62, 95, 22, 82, 60, 17, 70, 11, 38, 99, 11, 81, 53, 98, 69, 80, 85, 22, 66, 18, 6, 85, 35], [61, 35, 21, 18, 30, 38, 26, 82, 1, 31, 86, 8, 68, 82, 95, 73, 51, 5, 27, 97, 67, 64, 52, 15, 59, 45, 36, 76, 75, 94, 96], [84, 55, 25, 87, 88, 21, 76, 60, 54, 69, 74, 12, 36, 77, 84, 1, 34, 16, 19, 69, 34, 75, 97, 87, 13, 52, 38, 9, 75, 94, 14], [47, 82, 61, 86, 67, 43, 66, 51, 25, 35, 15, 48, 16, 93, 50, 91, 44, 57, 52, 56, 3, 11, 97, 92, 25, 37, 99, 14, 68, 34, 64], [31, 12, 98, 9, 45, 80, 4, 61, 55, 46, 38, 31, 40, 42, 27, 53, 49, 59, 20, 19, 62, 16, 9, 52, 95, 75, 87, 70, 96, 90, 74], [88, 20, 61, 40, 55, 58, 43, 50, 34, 77, 73, 86, 17, 24, 98, 56, 14, 47, 41, 90, 41, 32, 63, 66, 88, 57, 6, 66, 20, 9, 26], [16, 54, 1, 53, 79, 34, 12, 30, 7, 23, 9, 46, 40, 45, 3, 44, 83, 99, 63, 56, 38, 76, 82, 11, 18, 59, 88, 74, 42, 21, 44], [38, 50, 80, 48, 98, 72, 60, 51, 67, 96, 55, 70, 71, 70, 87, 87, 12, 42, 87, 65, 19, 14, 20, 19, 84, 32, 21, 48, 30, 23, 58], [7, 23, 15, 17, 86, 87, 76, 92, 19, 13, 15, 21, 65, 52, 12, 37, 74, 19, 13, 33, 73, 60, 39, 50, 37, 32, 62, 58, 10, 20, 31], [69, 27, 28, 76, 93, 14, 24, 96, 83, 94, 77, 47, 14, 11, 39, 86, 40, 24, 69, 30, 45, 24, 9, 24, 93, 32, 3, 86, 87, 61, 87], [47, 83, 78, 32, 86, 32, 92, 82, 10, 76, 45, 83, 6, 77, 91, 63, 78, 24, 86, 61, 90, 51, 44, 88, 11, 81, 90, 33, 17, 23, 97], [84, 97, 32, 2, 6, 19, 17, 53, 25, 60, 15, 42, 17, 76, 86, 35, 29, 28, 69, 95, 60, 92, 6, 31, 80, 21, 2, 52, 14, 46, 32], [1, 71, 62, 39, 44, 88, 75, 39, 9, 53, 48, 76, 63, 27, 69, 71, 22, 89, 15, 25, 1, 75, 39, 75, 31, 86, 52, 29, 38, 64, 76], [48, 70, 75, 49, 76, 5, 82, 72, 83, 58, 66, 43, 25, 87, 73, 6, 9, 87, 42, 47, 82, 43, 71, 19, 7, 17, 61, 78, 44, 3, 31], [78, 89, 29, 56, 19, 7, 68, 28, 81, 68, 91, 88, 41, 98, 8, 3, 12, 11, 85, 78, 1, 21, 19, 69, 32, 72, 62, 9, 26, 20, 14], [94, 60, 73, 46, 60, 12, 21, 21, 47, 91, 56, 74, 88, 76, 60, 84, 10, 38, 4, 23, 20, 46, 59, 8, 19, 51, 14, 6, 15, 25, 69], [4, 48, 57, 98, 25, 86, 76, 78, 66, 21, 16, 71, 18, 65, 95, 33, 10, 7, 50, 21, 81, 52, 30, 92, 15, 40, 7, 20, 90, 1, 9], [92, 58, 71, 51, 54, 56, 57, 21, 32, 7, 54, 97, 57, 32, 71, 81, 51, 25, 82, 81, 35, 25, 45, 69, 82, 20, 31, 77, 20, 70, 17], [55, 96, 60, 73, 88, 63, 2, 90, 14, 37, 9, 94, 55, 44, 55, 96, 84, 54, 20, 90, 6, 54, 34, 7, 16, 58, 58, 88, 72, 44, 68], [98, 72, 10, 44, 74, 20, 96, 24, 85, 9, 23, 58, 7, 32, 30, 65, 75, 28, 57, 25, 37, 61, 94, 38, 5, 45, 86, 77, 55, 50, 23], [9, 43, 13, 86, 41, 42, 4, 64, 59, 31, 90, 68, 99, 93, 10, 88, 89, 83, 84, 95, 52, 25, 99, 95, 75, 1, 27, 99, 92, 61, 95], [23, 9, 95, 28, 79, 76, 53, 1, 13, 47, 30, 14, 81, 43, 84, 84, 99, 77, 44, 52, 47, 35, 90, 64, 77, 47, 66, 32, 77, 96, 40], [53, 27, 68, 47, 54, 21, 53, 24, 38, 1, 85, 65, 33, 50, 32, 60, 37, 6, 54, 15, 78, 35, 98, 88, 73, 32, 84, 10, 31, 79, 55], [45, 44, 77, 84, 86, 83, 10, 64, 60, 57, 20, 71, 9, 92, 78, 61, 29, 62, 63, 39, 49, 58, 88, 5, 25, 61, 59, 55, 39, 12, 9], [12, 35, 58, 74, 10, 97, 46, 66, 22, 77, 6, 87, 64, 20, 55, 65, 68, 10, 15, 51, 24, 96, 93, 36, 5, 20, 59, 3, 22, 76, 18], [29, 27, 6, 76, 52, 73, 81, 12, 7, 55, 18, 30, 81, 15, 86, 93, 48, 40, 63, 78, 8, 5, 79, 83, 93, 78, 91, 7, 94, 7, 83], [10, 29, 80, 26, 28, 72, 4, 94, 69, 37, 89, 26, 40, 78, 22, 1, 99, 4, 73, 79, 51, 89, 83, 79, 30, 41, 17, 71, 10, 32, 99], [39, 61, 3, 58, 92, 51, 77, 76, 79, 30, 44, 5, 30, 3, 95, 15, 50, 89, 39, 73, 53, 82, 1, 18, 76, 99, 29, 65, 75, 32, 32], [38, 40, 23, 94, 62, 91, 94, 42, 32, 52, 10, 23, 51, 7, 77, 52, 86, 13, 65, 12, 25, 26, 84, 32, 19, 36, 94, 91, 48, 50, 11]], [[93, 83, 42, 36, 3, 96, 99, 4, 83, 84, 92, 19, 69, 39, 25, 37, 46, 22, 48, 91, 51, 83, 1, 5, 31, 15, 80, 59, 40, 93, 95], [54, 11, 90, 56, 27, 57, 45, 62, 95, 13, 85, 33, 86, 20, 39, 58, 72, 86, 29, 60, 14, 95, 58, 85, 72, 58, 90, 6, 73, 96, 83], [33, 22, 85, 19, 97, 11, 52, 56, 85, 45, 6, 97, 69, 99, 37, 43, 16, 45, 91, 6, 44, 85, 1, 20, 38, 8, 8, 43, 76, 88, 25], [69, 43, 13, 63, 41, 26, 51, 26, 83, 20, 65, 38, 60, 76, 13, 80, 51, 90, 70, 63, 88, 47, 82, 52, 15, 55, 98, 12, 36, 21, 81], [2, 91, 37, 21, 77, 38, 47, 83, 46, 50, 21, 80, 13, 54, 53, 31, 44, 94, 85, 47, 20, 54, 23, 60, 86, 86, 56, 35, 86, 88, 18], [46, 75, 65, 1, 94, 23, 37, 13, 73, 70, 90, 44, 12, 54, 50, 69, 28, 80, 64, 10, 44, 71, 6, 68, 63, 79, 22, 10, 96, 19, 95], [13, 71, 30, 9, 50, 85, 17, 41, 16, 58, 27, 14, 25, 59, 51, 15, 48, 61, 50, 15, 39, 7, 79, 49, 43, 21, 28, 32, 60, 5, 8], [40, 81, 37, 19, 62, 87, 90, 26, 23, 70, 64, 89, 35, 10, 1, 50, 94, 20, 75, 48, 62, 41, 59, 43, 38, 78, 4, 44, 37, 73, 16], [97, 37, 78, 7, 32, 92, 29, 80, 85, 68, 52, 98, 15, 27, 54, 46, 37, 33, 40, 20, 72, 68, 50, 49, 50, 22, 52, 96, 94, 54, 29], [35, 66, 92, 81, 84, 52, 72, 10, 3, 52, 10, 22, 25, 14, 22, 43, 78, 75, 95, 55, 11, 95, 93, 14, 16, 81, 14, 82, 61, 82, 7], [92, 56, 47, 97, 57, 39, 82, 67, 14, 63, 49, 24, 27, 33, 12, 98, 16, 70, 55, 13, 12, 29, 59, 8, 15, 78, 60, 94, 36, 50, 79], [79, 56, 75, 54, 90, 10, 59, 53, 87, 86, 48, 65, 9, 10, 5, 55, 35, 37, 75, 75, 72, 63, 41, 43, 96, 33, 51, 49, 55, 97, 89], [51, 24, 59, 88, 43, 51, 67, 10, 84, 22, 15, 62, 77, 24, 75, 34, 97, 71, 3, 46, 38, 59, 82, 53, 52, 69, 2, 57, 21, 89, 88], [33, 49, 78, 9, 9, 85, 92, 47, 9, 36, 67, 24, 14, 66, 72, 45, 11, 49, 2, 44, 87, 98, 3, 28, 15, 22, 42, 30, 28, 26, 45], [30, 97, 41, 94, 2, 35, 30, 83, 75, 35, 77, 12, 40, 15, 9, 39, 64, 47, 63, 92, 54, 33, 23, 4, 3, 42, 32, 55, 16, 46, 20], [11, 80, 79, 61, 36, 97, 56, 15, 15, 5, 55, 11, 96, 66, 51, 51, 99, 45, 55, 77, 33, 49, 91, 96, 58, 10, 53, 69, 12, 6, 6], [23, 73, 85, 83, 94, 51, 28, 20, 39, 36, 50, 60, 74, 68, 38, 30, 65, 71, 78, 69, 78, 87, 26, 49, 20, 44, 10, 72, 97, 1, 17], [12, 50, 96, 79, 8, 43, 71, 63, 13, 88, 21, 13, 62, 80, 42, 85, 19, 53, 97, 62, 21, 75, 86, 78, 91, 35, 88, 9, 3, 73, 28], [28, 62, 83, 54, 34, 11, 79, 29, 20, 74, 75, 68, 46, 22, 4, 59, 89, 29, 24, 56, 8, 49, 12, 87, 89, 95, 90, 21, 48, 39, 29], [98, 88, 4, 74, 67, 38, 35, 65, 58, 36, 35, 24, 59, 12, 49, 92, 84, 27, 56, 81, 48, 43, 73, 65, 51, 84, 39, 93, 56, 24, 94], [94, 92, 81, 45, 74, 80, 98, 72, 40, 20, 41, 34, 23, 59, 59, 28, 83, 13, 23, 74, 12, 89, 90, 82, 2, 12, 49, 50, 51, 2, 52], [29, 74, 58, 85, 1, 37, 5, 66, 26, 58, 7, 84, 70, 73, 16, 6, 98, 87, 51, 49, 87, 89, 24, 30, 80, 16, 76, 50, 6, 74, 9], [14, 96, 38, 81, 29, 8, 19, 75, 17, 83, 63, 5, 57, 46, 3, 52, 46, 47, 94, 96, 18, 22, 77, 14, 9, 60, 94, 50, 7, 37, 30], [85, 76, 84, 18, 58, 48, 45, 54, 93, 16, 10, 22, 30, 5, 62, 51, 18, 44, 27, 23, 55, 56, 28, 58, 13, 14, 6, 85, 32, 25, 30], [70, 19, 93, 74, 98, 7, 55, 67, 38, 49, 77, 85, 37, 65, 80, 83, 67, 15, 99, 71, 51, 81, 25, 77, 65, 37, 62, 80, 8, 78, 48], [1, 76, 42, 12, 54, 26, 18, 30, 9, 61, 74, 7, 58, 5, 48, 43, 41, 18, 70, 24, 8, 15, 41, 47, 46, 44, 9, 95, 82, 24, 3], [17, 28, 29, 45, 1, 80, 41, 27, 18, 50, 1, 43, 84, 92, 19, 18, 23, 2, 68, 7, 18, 27, 32, 9, 65, 85, 21, 33, 89, 74, 72], [98, 66, 13, 88, 97, 14, 26, 83, 71, 6, 59, 65, 34, 10, 39, 78, 45, 95, 70, 22, 89, 93, 98, 58, 63, 80, 93, 98, 31, 73, 85], [56, 76, 20, 78, 84, 26, 43, 32, 39, 14, 64, 37, 99, 54, 44, 6, 98, 26, 9, 29, 78, 19, 41, 51, 33, 37, 33, 93, 55, 93, 42], [56, 29, 87, 54, 47, 91, 90, 47, 11, 43, 63, 8, 53, 88, 76, 63, 87, 41, 64, 81, 39, 85, 74, 56, 4, 3, 58, 86, 20, 85, 53], [64, 65, 80, 69, 83, 7, 3, 64, 27, 52, 18, 45, 3, 51, 86, 16, 59, 73, 4, 48, 47, 20, 20, 34, 74, 40, 16, 37, 30, 86, 93]]]; int [] param1 = [1, 4, 4, 17, 4, 35, 30, 25, 29]; 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); } " INTEGER_POSITIVE_VALUE_POSITIVE_NEGATIVE_VALUE_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { int neg = 0 , pos = 0 ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] ; if ( arr [ i ] < 0 ) neg ++ ; else pos ++ ; } return ( sum / Math . abs ( neg - pos ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [49, 74, 0, 41, -146, 0, 16, -96, 0, 55]; int [] [] param0 = [[49, 98], [82, 66, -68, 24, -10], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [56, 3, 18, 5, 20, 56, 47, 29, 60, 98, 60, 40, 42, 2, 54, 56, 91, 8, 93, 14, 31, 27, 61, 49, 23, 12, 71], [-94, -94, -92, -86, -50, -48, -6, 8, 28, 40, 44, 58, 62, 72, 94], [0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1], [16, 56, 56], [74, -90, -92, 30, -18, 66, -66, 22], [0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [21, 64, 82, 78, 30, 34, 35]]; int [] param1 = [1, 2, 8, 25, 12, 36, 1, 5, 7, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_UNIT_DIGIT_X_RAISED_POWER_Y,"static int f_filled ( int x , int y ) { int res = 1 ; for ( int i = 0 ; i < y ; i ++ ) res = ( res * x ) % 10 ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7, 5, 1, 9, 0, 6, 3, 4, 4, 9]; int [] param0 = [33, 95, 21, 3, 40, 64, 17, 58, 44, 27]; int [] param1 = [55, 7, 63, 62, 53, 24, 23, 74, 13, 54]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_UNIT_DIGIT_X_RAISED_POWER_Y_1,"static int f_filled ( int x , int y ) { x = x % 10 ; if ( y != 0 ) y = y % 4 + 4 ; return ( ( ( int ) ( Math . pow ( x , y ) ) ) % 10 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7, 0, 6, 1, 8, 5, 1, 3, 1, 1]; int [] param0 = [37, 70, 26, 9, 82, 95, 43, 7, 19, 49]; int [] param1 = [17, 52, 23, 96, 71, 36, 40, 27, 56, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_VALUE_OF_Y_MOD_2_RAISED_TO_POWER_X,"static long f_filled ( long y , long x ) { if ( ( Math . log ( y ) / Math . log ( 2 ) ) < x ) return y ; if ( x > 63 ) return y ; return ( y % ( 1 << ( int ) x ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [57, 80, 84, 35, 3, 42, 3, 99, 13, 44]; long [] param0 = [57, 80, 84, 35, 3, 42, 7, 99, 13, 44]; long [] param1 = [76, 46, 96, 16, 84, 79, 2, 83, 61, 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); } " PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_1,"static int f_filled ( int num , int divisor ) { if ( divisor == 0 ) { System . out . println ( ""Error: divisor "" + ""can't be zero \n"" ) ; return - 1 ; } if ( divisor < 0 ) divisor = - divisor ; if ( num < 0 ) num = - num ; int i = 1 ; int product = 0 ; while ( product <= num ) { product = divisor * i ; i ++ ; } return num - ( product - divisor ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 19, 15, 56, 63, 28, 54, 2, 3, 2]; int [] param0 = [34, 63, 15, 56, 63, 28, 54, 2, 94, 82]; int [] param1 = [55, 22, 26, 58, 94, 45, 97, 58, 91, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_1,"static int f_filled ( int n ) { int count = 0 ; int x = n & ( n - 1 ) ; if ( n > 0 && x == 0 ) { while ( n > 1 ) { n >>= 1 ; count += 1 ; } return ( count % 2 == 0 ) ? 1 : 0 ; } return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 1, 0, 0, 1, 0, 0, 0, 0]; int [] param0 = [1, 4, 64, -64, 128, 1024, 45, 33, 66, 74]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MOBILE_NUMERIC_KEYPAD_PROBLEM,"static int f_filled ( char keypad [ ] [ ] , int n ) { if ( keypad == null || n <= 0 ) return 0 ; if ( n == 1 ) return 10 ; int [ ] odd = new int [ 10 ] ; int [ ] even = new int [ 10 ] ; int i = 0 , j = 0 , useOdd = 0 , totalCount = 0 ; for ( i = 0 ; i <= 9 ; i ++ ) odd [ i ] = 1 ; for ( j = 2 ; j <= n ; j ++ ) { useOdd = 1 - useOdd ; if ( useOdd == 1 ) { even [ 0 ] = odd [ 0 ] + odd [ 8 ] ; even [ 1 ] = odd [ 1 ] + odd [ 2 ] + odd [ 4 ] ; even [ 2 ] = odd [ 2 ] + odd [ 1 ] + odd [ 3 ] + odd [ 5 ] ; even [ 3 ] = odd [ 3 ] + odd [ 2 ] + odd [ 6 ] ; even [ 4 ] = odd [ 4 ] + odd [ 1 ] + odd [ 5 ] + odd [ 7 ] ; even [ 5 ] = odd [ 5 ] + odd [ 2 ] + odd [ 4 ] + odd [ 8 ] + odd [ 6 ] ; even [ 6 ] = odd [ 6 ] + odd [ 3 ] + odd [ 5 ] + odd [ 9 ] ; even [ 7 ] = odd [ 7 ] + odd [ 4 ] + odd [ 8 ] ; even [ 8 ] = odd [ 8 ] + odd [ 0 ] + odd [ 5 ] + odd [ 7 ] + odd [ 9 ] ; even [ 9 ] = odd [ 9 ] + odd [ 6 ] + odd [ 8 ] ; } else { odd [ 0 ] = even [ 0 ] + even [ 8 ] ; odd [ 1 ] = even [ 1 ] + even [ 2 ] + even [ 4 ] ; odd [ 2 ] = even [ 2 ] + even [ 1 ] + even [ 3 ] + even [ 5 ] ; odd [ 3 ] = even [ 3 ] + even [ 2 ] + even [ 6 ] ; odd [ 4 ] = even [ 4 ] + even [ 1 ] + even [ 5 ] + even [ 7 ] ; odd [ 5 ] = even [ 5 ] + even [ 2 ] + even [ 4 ] + even [ 8 ] + even [ 6 ] ; odd [ 6 ] = even [ 6 ] + even [ 3 ] + even [ 5 ] + even [ 9 ] ; odd [ 7 ] = even [ 7 ] + even [ 4 ] + even [ 8 ] ; odd [ 8 ] = even [ 8 ] + even [ 0 ] + even [ 5 ] + even [ 7 ] + even [ 9 ] ; odd [ 9 ] = even [ 9 ] + even [ 6 ] + even [ 8 ] ; } } totalCount = 0 ; if ( useOdd == 1 ) { for ( i = 0 ; i <= 9 ; i ++ ) totalCount += even [ i ] ; } else { for ( i = 0 ; i <= 9 ; i ++ ) totalCount += odd [ i ] ; } return totalCount ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [105314726, 465832, 1583522062, 138, 7004156, 2062, 120130, 30984, 7990, 36]; char [] [] [] param0 = [[[' ', 'a', 'c', 'k', 'r', 'r', 'v', 'c', 'd', 'i', 'i', 'j', 'm', 'o', 'q', 'q', 'r', 'r', 'v', 'v', 'x', 'z'], ['b', 'd', 'i', 'm', 'n', 'q', 'r', 'z', 'c', 'f', 'i', 'j', 'j', 'l', 'l', 'n', 'p', 'q', 's', 't', 't', 'w'], ['a', 'f', 'f', 'g', 'h', 'j', 'k', 'k', 'n', 'v', 'v', 'b', 'c', 'c', 'g', 'i', 'j', 'l', 'l', 's', 't', 'y'], [' ', 'a', 'b', 'b', 'e', 'h', 'i', 'j', 'j', 'p', 'q', 't', 'u', 'v', 'z', 'c', 'c', 'j', 'p', 'w', 'y', 'z'], [' ', ' ', 'a', 'c', 'f', 'g', 'h', 'm', 'n', 'r', 'r', 'v', 'c', 'i', 'j', 'o', 'p', 'p', 'q', 'r', 'w', 'y'], [' ', ' ', 'c', 'c', 'd', 'h', 'i', 'j', 'k', 'o', 's', 'x', 'y', 'f', 'h', 'h', 'o', 'p', 'p', 'u', 'u', 'w'], ['b', 'c', 'd', 'h', 'm', 'm', 'q', 'q', 'r', 's', 'x', 'z', 'e', 'e', 'e', 'j', 'k', 'l', 'm', 'o', 'v', 'w'], ['a', 'c', 'c', 'd', 'h', 'h', 'i', 'j', 'l', 'l', 'l', 'm', 'n', 's', 'u', 'c', 'd', 'f', 'f', 's', 'u', 'y'], ['a', 'b', 'd', 'd', 'i', 'j', 'k', 'l', 'l', 'm', 'p', 's', 's', 'y', 'b', 'e', 'h', 'j', 'm', 'o', 'q', 's'], [' ', 'b', 'e', 'h', 'h', 'j', 'm', 'p', 's', 't', 'u', 'v', 'z', 'd', 'j', 'm', 'm', 'p', 'q', 'v', 'w', 'w'], ['b', 'e', 'f', 'g', 'h', 'm', 'm', 'm', 'n', 'o', 'q', 'r', 't', 'v', 'a', 'c', 'g', 'g', 'i', 's', 'x', 'y'], ['a', 'e', 'g', 'j', 'o', 'r', 'r', 's', 't', 'w', 'a', 'b', 'f', 'h', 'h', 'i', 'm', 'n', 's', 'u', 'v', 'y'], ['b', 'd', 'e', 'h', 'i', 'i', 'k', 'm', 'n', 'p', 'q', 's', 'a', 'e', 'i', 'j', 'm', 'o', 'p', 'r', 'x', 'z'], ['a', 'g', 'i', 'k', 'k', 'l', 'o', 'p', 'u', 'u', 'x', 'x', 'z', 'a', 'c', 'f', 'g', 'i', 'l', 'o', 'o', 'v'], [' ', ' ', 'e', 'h', 'j', 'j', 'l', 'm', 'n', 'o', 'p', 's', 's', 'x', 'c', 'f', 'g', 'r', 'u', 'v', 'x', 'z'], ['c', 'e', 'f', 'f', 'h', 'h', 'i', 'k', 'm', 'm', 'u', 'z', 'e', 'e', 'h', 'h', 'h', 'j', 'k', 'k', 'p', 'r'], [' ', ' ', ' ', 'c', 'g', 'i', 'j', 'o', 'o', 'p', 't', 'v', 'y', 'b', 'j', 'n', 'o', 'o', 's', 'u', 'w', 'x'], ['a', 'd', 'f', 'f', 'h', 'h', 'n', 'r', 's', 'w', 'w', 'y', 'y', 'b', 'f', 'i', 'k', 'o', 'u', 'y', 'y', 'z'], [' ', 'c', 'g', 'i', 'i', 'l', 'p', 's', 'x', 'y', 'd', 'd', 'f', 'g', 'g', 'k', 'm', 'o', 'r', 'r', 'r', 'x'], ['f', 'i', 'j', 'n', 'p', 'p', 'q', 'q', 'r', 'x', 'y', 'a', 'b', 'h', 'h', 'j', 'l', 'm', 'n', 'p', 'r', 'y'], [' ', 'c', 'd', 'e', 'f', 'l', 'q', 'q', 'v', 'c', 'g', 'h', 'k', 'k', 'l', 'l', 'n', 'o', 'p', 'r', 'u', 'x'], [' ', 'a', 'g', 'k', 'l', 'm', 't', 'u', 'u', 'w', 'z', 'a', 'f', 'i', 'k', 'k', 'n', 'n', 'p', 'q', 'v', 'z']], [['3', '5', '1', '5', '6', '7', '7', '3', '0', '4', '7', '6', '1', '4', '0', '6', '3', '4', '1', '3', '1', '2', '9', '8', '7', '8', '0', '2', '7', '6', '1', '0', '3', '8', '0', '5', '9', '3', '9', '9', '8', '6'], ['0', '3', '8', '5', '0', '2', '0', '6', '1', '8', '7', '2', '8', '6', '0', '3', '9', '4', '9', '5', '7', '4', '3', '7', '4', '3', '8', '6', '1', '5', '4', '8', '0', '8', '3', '2', '7', '7', '6', '9', '7', '9'], ['6', '7', '1', '1', '7', '2', '5', '3', '2', '8', '4', '7', '8', '6', '1', '5', '2', '1', '6', '5', '7', '6', '8', '6', '8', '8', '1', '6', '3', '1', '1', '7', '1', '6', '4', '9', '2', '8', '2', '6', '3', '4'], ['8', '7', '9', '2', '0', '6', '6', '6', '2', '3', '1', '4', '8', '2', '3', '5', '5', '9', '2', '8', '0', '3', '2', '7', '2', '0', '2', '7', '0', '6', '5', '8', '2', '9', '3', '9', '8', '1', '9', '7', '9', '7'], ['9', '8', '1', '5', '0', '9', '9', '7', '7', '8', '4', '1', '8', '0', '4', '6', '7', '0', '5', '8', '6', '5', '6', '5', '1', '4', '0', '4', '3', '4', '6', '7', '6', '7', '3', '5', '4', '5', '6', '7', '1', '1'], ['4', '4', '4', '9', '8', '8', '7', '5', '3', '1', '8', '4', '8', '1', '0', '4', '9', '8', '9', '5', '2', '7', '5', '3', '4', '8', '2', '4', '7', '5', '0', '3', '6', '2', '5', '6', '3', '1', '9', '4', '8', '9'], ['7', '2', '7', '6', '2', '8', '8', '8', '1', '1', '5', '4', '6', '5', '3', '0', '3', '7', '4', '0', '0', '2', '4', '1', '8', '0', '0', '7', '6', '4', '7', '1', '8', '8', '1', '8', '8', '2', '3', '1', '7', '2'], ['2', '7', '5', '8', '7', '6', '2', '9', '9', '0', '6', '1', '7', '8', '1', '3', '3', '1', '5', '7', '9', '8', '2', '0', '7', '6', '0', '0', '1', '1', '5', '8', '6', '7', '7', '9', '9', '0', '4', '4', '3', '4'], ['0', '9', '9', '0', '5', '4', '9', '9', '3', '0', '3', '1', '5', '9', '9', '5', '3', '0', '2', '3', '9', '9', '7', '8', '5', '4', '6', '4', '2', '8', '7', '0', '2', '3', '6', '5', '2', '6', '0', '6', '5', '7'], ['1', '1', '4', '1', '4', '2', '7', '1', '9', '7', '9', '9', '4', '4', '2', '7', '6', '8', '2', '6', '7', '3', '1', '8', '0', '5', '3', '0', '3', '9', '0', '4', '7', '9', '6', '8', '1', '7', '0', '3', '2', '4'], ['6', '3', '1', '3', '2', '9', '5', '5', '4', '7', '2', '4', '7', '6', '9', '2', '0', '1', '2', '1', '4', '3', '8', '4', '9', '8', '9', '7', '7', '6', '8', '2', '4', '5', '3', '0', '1', '3', '0', '1', '0', '9'], ['5', '9', '4', '2', '1', '5', '0', '2', '6', '6', '0', '8', '3', '0', '3', '3', '3', '0', '7', '8', '0', '7', '7', '4', '3', '0', '6', '9', '6', '2', '2', '2', '8', '3', '7', '2', '4', '0', '0', '4', '5', '2'], ['3', '1', '1', '6', '2', '9', '7', '0', '3', '2', '8', '0', '5', '2', '2', '9', '9', '2', '8', '3', '5', '7', '4', '2', '8', '7', '8', '0', '4', '9', '7', '8', '0', '3', '2', '2', '1', '5', '1', '4', '9', '1'], ['6', '4', '8', '2', '4', '2', '5', '4', '0', '1', '0', '9', '0', '3', '0', '6', '4', '8', '6', '7', '9', '3', '0', '1', '6', '9', '5', '7', '5', '2', '9', '4', '7', '0', '6', '4', '1', '4', '4', '1', '3', '5'], ['6', '7', '8', '2', '9', '5', '0', '2', '6', '5', '4', '9', '4', '7', '8', '4', '6', '7', '6', '5', '1', '3', '8', '1', '7', '5', '9', '3', '9', '4', '0', '6', '5', '6', '9', '8', '4', '6', '9', '9', '0', '2'], ['6', '9', '2', '4', '3', '7', '2', '5', '8', '6', '3', '6', '3', '6', '7', '2', '6', '8', '6', '4', '3', '9', '6', '2', '1', '3', '1', '8', '8', '9', '6', '2', '0', '2', '2', '9', '3', '6', '4', '4', '8', '7'], ['1', '4', '5', '5', '7', '2', '3', '8', '3', '6', '9', '3', '3', '4', '4', '2', '3', '7', '5', '5', '2', '8', '7', '2', '7', '6', '0', '5', '1', '4', '1', '5', '5', '0', '4', '8', '7', '8', '1', '4', '2', '6'], ['5', '6', '8', '0', '0', '6', '3', '8', '3', '8', '2', '0', '8', '5', '4', '4', '0', '0', '8', '5', '8', '9', '1', '3', '3', '1', '1', '2', '9', '9', '1', '2', '1', '3', '5', '8', '7', '9', '3', '1', '3', '5'], ['9', '6', '7', '4', '9', '0', '2', '8', '9', '4', '3', '6', '4', '1', '8', '3', '1', '8', '0', '4', '4', '2', '1', '2', '9', '8', '3', '6', '7', '3', '9', '5', '7', '9', '1', '4', '6', '1', '4', '5', '4', '0'], ['5', '7', '4', '0', '6', '7', '8', '3', '6', '5', '8', '1', '4', '9', '9', '2', '7', '7', '4', '2', '8', '0', '8', '3', '2', '7', '3', '5', '7', '4', '4', '1', '3', '5', '1', '9', '6', '1', '0', '9', '5', '4'], ['3', '4', '0', '0', '3', '2', '2', '2', '9', '7', '5', '5', '1', '8', '4', '7', '9', '0', '7', '4', '1', '9', '3', '7', '3', '9', '5', '0', '3', '6', '6', '8', '8', '4', '1', '8', '2', '3', '9', '5', '3', '3'], ['7', '0', '6', '2', '5', '2', '1', '8', '1', '4', '4', '8', '9', '0', '3', '0', '3', '1', '9', '0', '8', '0', '1', '0', '3', '7', '6', '6', '3', '9', '4', '3', '4', '4', '1', '4', '7', '2', '9', '5', '8', '3'], ['7', '5', '7', '9', '8', '8', '3', '4', '3', '2', '5', '2', '4', '6', '5', '6', '1', '6', '0', '4', '9', '6', '8', '0', '3', '3', '2', '1', '1', '8', '9', '5', '3', '8', '3', '0', '4', '7', '7', '9', '2', '6'], ['6', '3', '9', '7', '5', '8', '5', '1', '1', '6', '6', '0', '8', '3', '2', '7', '3', '0', '4', '5', '1', '2', '3', '0', '4', '2', '8', '4', '1', '1', '0', '2', '3', '2', '5', '6', '3', '0', '1', '2', '2', '5'], ['8', '7', '2', '1', '4', '9', '6', '5', '2', '0', '9', '1', '0', '8', '6', '9', '7', '3', '4', '5', '6', '7', '2', '8', '3', '0', '1', '9', '5', '4', '4', '1', '6', '4', '0', '5', '1', '5', '7', '8', '2', '4'], ['4', '8', '1', '1', '7', '0', '8', '0', '2', '1', '8', '2', '2', '7', '6', '2', '3', '5', '2', '5', '5', '5', '9', '3', '4', '9', '4', '9', '8', '8', '0', '1', '6', '7', '7', '5', '7', '5', '9', '3', '6', '1'], ['5', '8', '6', '8', '0', '7', '3', '1', '9', '2', '3', '5', '5', '5', '0', '9', '2', '2', '2', '8', '7', '7', '6', '7', '6', '7', '4', '3', '9', '8', '3', '9', '3', '5', '7', '1', '3', '1', '4', '0', '7', '1'], ['9', '2', '6', '8', '8', '6', '8', '4', '8', '6', '7', '7', '7', '0', '2', '6', '5', '1', '5', '3', '8', '0', '5', '6', '5', '4', '9', '4', '6', '0', '0', '7', '2', '2', '1', '1', '0', '5', '1', '2', '5', '1'], ['1', '8', '4', '3', '2', '6', '1', '8', '3', '6', '5', '5', '1', '5', '9', '8', '0', '2', '8', '9', '4', '2', '1', '9', '6', '5', '1', '2', '5', '4', '6', '7', '3', '8', '7', '3', '2', '4', '7', '6', '6', '0'], ['9', '2', '9', '7', '5', '6', '4', '9', '5', '4', '8', '5', '2', '4', '0', '5', '5', '1', '0', '9', '3', '6', '4', '0', '9', '4', '2', '7', '5', '1', '3', '4', '8', '3', '7', '4', '2', '8', '3', '0', '2', '8'], ['8', '4', '4', '7', '5', '7', '3', '2', '8', '9', '5', '5', '2', '3', '8', '3', '3', '8', '0', '4', '9', '5', '9', '8', '5', '9', '1', '9', '4', '3', '9', '7', '4', '3', '0', '9', '3', '1', '3', '1', '3', '9'], ['9', '3', '7', '7', '4', '9', '1', '1', '8', '9', '2', '1', '2', '4', '1', '0', '9', '2', '8', '8', '9', '7', '2', '6', '0', '4', '3', '6', '2', '1', '4', '7', '6', '2', '4', '0', '8', '5', '1', '6', '2', '1'], ['6', '8', '7', '3', '6', '4', '3', '9', '3', '7', '1', '5', '0', '5', '5', '1', '7', '9', '3', '9', '8', '9', '9', '6', '6', '3', '1', '2', '2', '2', '0', '7', '8', '4', '7', '3', '6', '2', '2', '1', '9', '6'], ['1', '3', '1', '5', '7', '5', '2', '5', '3', '4', '0', '7', '6', '8', '5', '9', '7', '1', '0', '3', '3', '8', '2', '9', '7', '2', '4', '8', '6', '3', '1', '3', '3', '0', '7', '1', '5', '9', '0', '9', '8', '1'], ['4', '1', '6', '2', '2', '3', '9', '7', '6', '5', '6', '5', '3', '0', '8', '4', '3', '0', '6', '8', '7', '4', '1', '4', '2', '3', '2', '2', '1', '0', '0', '5', '3', '4', '0', '8', '4', '8', '4', '9', '0', '0'], ['2', '1', '1', '4', '8', '0', '6', '9', '7', '0', '9', '4', '7', '6', '1', '1', '5', '2', '0', '6', '9', '2', '0', '2', '7', '3', '3', '0', '5', '2', '6', '3', '0', '1', '8', '3', '5', '5', '3', '9', '8', '5'], ['1', '3', '2', '8', '8', '7', '7', '2', '6', '3', '8', '8', '5', '6', '7', '0', '1', '7', '7', '8', '5', '1', '9', '5', '2', '5', '7', '2', '2', '5', '9', '6', '0', '3', '1', '2', '2', '2', '3', '0', '1', '9'], ['2', '5', '0', '6', '4', '0', '1', '6', '9', '7', '0', '6', '7', '4', '9', '1', '0', '2', '5', '5', '7', '0', '2', '0', '8', '0', '6', '2', '6', '8', '1', '1', '0', '6', '4', '4', '0', '6', '5', '8', '7', '3'], ['9', '7', '8', '6', '0', '3', '7', '5', '7', '5', '6', '0', '5', '6', '3', '9', '6', '3', '2', '6', '0', '0', '6', '5', '8', '3', '7', '3', '7', '3', '5', '2', '4', '9', '4', '1', '0', '7', '9', '7', '6', '2'], ['3', '0', '7', '5', '1', '4', '8', '7', '9', '9', '0', '7', '6', '8', '6', '0', '5', '8', '0', '8', '9', '4', '8', '1', '3', '1', '8', '6', '0', '5', '1', '7', '3', '4', '7', '6', '4', '2', '8', '6', '1', '7'], ['4', '2', '8', '1', '1', '3', '2', '6', '5', '1', '9', '1', '2', '8', '8', '8', '2', '6', '2', '5', '6', '0', '7', '5', '2', '0', '9', '3', '0', '1', '4', '1', '1', '0', '0', '3', '9', '3', '4', '8', '8', '3'], ['9', '1', '9', '0', '9', '4', '0', '8', '4', '9', '7', '6', '7', '6', '0', '7', '1', '1', '7', '4', '9', '0', '0', '7', '3', '2', '8', '1', '6', '9', '7', '2', '0', '1', '6', '1', '9', '8', '9', '7', '5', '3']], [['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', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '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'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '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'], ['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', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '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'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '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'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1']], [['b', 'q', 'b', 'd', 't', 'y', 'z', 'g', 'd', 'r', 'r', 'r', 'z', 'a', 'y', 'h', 'd', 'q', 'x', 'u', 'o', 'a', 's', 'p', 's', 'c', 'w', 'r', 'i', 'y', 'e', 'x', 'e', 'k', 'l', 'f', 'm', 'g', 'z', 't', 'i', 'e', 'd', 'k', 'm', 'l'], ['v', 'm', 'w', 'm', 'l', 'h', 'l', 'j', 'f', 's', 'k', 'g', 'o', 'w', 's', 'r', 'i', 'l', 'j', 'z', 'v', 'x', 'w', 'l', 'k', 's', 'f', 'o', 'x', 'k', 'a', 'l', 'k', 'h', ' ', 'e', 'x', 'b', 'z', 'w', 'z', 'y', 'u', 'y', 'i', 'q'], ['i', 'o', 's', 'a', 'f', 'z', 'c', 'o', 'x', 'b', 'd', 's', ' ', 'y', 'q', 'u', 'c', 't', 'k', 'r', 'q', 'u', 'p', 'c', 'w', 'r', 'e', 's', 'l', 'a', 'j', 'g', 'p', 'b', 'i', 'w', 'l', 'e', 'w', 'b', 'r', 'z', 'y', 'm', 'm', 'e'], ['k', 'y', 'v', 'l', 'f', 'x', 'v', 'l', 'c', 'g', 'j', 'v', 'l', 'q', 'p', 'x', 'z', 'a', 'j', 'h', 'v', 'i', 'h', 'r', 'z', 'i', ' ', 'y', 'm', 'k', 'p', 'q', 'x', 'm', 'u', 'w', 'v', 'v', 'p', 'l', 'n', 'j', 'r', 'o', 'k', ' '], ['k', 'k', 'k', 'z', 'x', 'w', 'e', ' ', 'x', 'u', 'r', 'l', 'l', 'z', 'v', 'e', 'k', 'z', 'y', 'x', 'f', 'v', 'n', 'f', 'k', 'p', 'b', 'i', 'c', 'p', 'b', 'v', 'r', 't', 'n', 't', 'm', 'a', 'f', 'j', 'u', 'm', 'n', 'g', 'm', 'w'], ['a', 'e', 'x', 'a', 'u', 'v', 'p', 'w', 'w', 'l', 'p', ' ', 'o', 'l', 'x', 'e', 'g', 'k', 'y', 'w', 'p', 'y', 'b', 't', 'z', 'm', 'v', 'z', 'o', 'z', 'o', 'o', 'm', 's', 'x', 'o', 'l', 'q', 'z', 'e', 'y', 'b', 'l', 'h', 'h', 't'], ['c', 'x', 'r', 'r', 'x', 's', 'r', 'y', 'j', 'y', 'e', 'f', 'x', 'x', 'h', 'l', 'n', 'q', 'j', 'x', 's', 'h', 'z', 'm', 'q', 'b', 'q', 'h', 'x', 'r', 'y', 'c', 'r', 'd', 'b', 'o', 'l', 'w', 'j', 'i', 'a', 'p', 'x', 'd', 't', 'c'], ['y', 's', 'b', 'n', 'b', 'g', 'e', 'h', 'l', 'y', 'n', 's', 'a', 'f', 'k', 'p', 'c', 'q', 'c', 'u', 'a', 'n', 'w', 'v', 'z', 'f', 'j', 'm', 'f', 'g', 'q', 'x', 'r', 'l', 'e', 'y', 't', 'z', ' ', 'a', 'n', 'n', 'x', 'p', 'm', 'j'], ['v', 'o', 'a', 'a', 'e', 'q', 'l', 'p', ' ', 'w', 'l', 'g', 'k', 'f', 'm', 'a', 'k', 'i', 'f', 'd', 'z', 'a', 'j', 'y', 'b', 'g', 'a', 'h', 'e', 's', 'q', 'h', 'c', 'f', 'i', 's', 'x', 'y', 'j', 'g', 'f', 'n', 'g', 'j', 'r', 's'], [' ', 's', 'w', 'g', 'b', 'v', 'z', 'u', 'l', 'k', 'a', 'w', 'y', 'd', 'q', 'v', 'c', 't', 's', 's', 'n', 'm', 'm', 'j', 'u', 'x', 'a', 'k', 'o', 'a', 't', 'a', 'u', 'u', 'y', 's', 'w', 'j', 'k', 'n', 'a', 'v', 'x', 'n', 'd', 'c'], ['z', 'o', 'o', 'a', 'z', 'm', 'x', 'k', 'm', 'x', 'j', 'w', 'y', 'd', 'j', 'c', 'q', 'e', 'e', 'i', 'g', 'q', 'u', 'v', 'c', 'k', 'y', 't', 't', 'a', 'o', 'u', 'o', 'e', 'j', 'c', 'c', 'd', 'i', 'o', 'b', 'a', 'h', 'g', 'y', 'y'], ['o', 'j', 'f', 'a', 'f', 't', 'j', 'u', 'v', 'j', 'p', 'z', 'c', 'c', 'c', 'y', 'g', 's', 'w', 'x', 'o', 'g', 'q', 'l', 'z', 'l', 'p', 'u', 'o', 'a', 'k', 'v', 'q', 'v', 'i', 'w', 'k', 'r', 'm', 'y', 'i', 'v', 'y', 'c', 'p', 's'], ['n', ' ', 'w', 'k', 'z', 'o', 'v', 'w', 'm', 'a', 'q', 'c', 'p', 'd', 'x', 'o', 'm', 'y', ' ', 'b', 'y', 'l', 'v', 'e', 'j', 'i', 'c', 'k', ' ', ' ', 'c', 'k', 'c', 'h', 'y', 'k', 'c', 'g', 'q', 'h', 'b', 'i', 'l', 'q', 'p', 's'], ['x', 'p', 'y', 'i', 'w', 'f', 'f', 'o', 'w', 'g', 'a', 'h', 'a', 'h', 'x', 'f', 'd', 'y', 'i', 'x', 'n', 'r', 's', 'c', 'b', 'l', 'o', 'b', 'c', 'o', 'g', 'v', 't', 'q', 'a', 'z', 'a', 'z', 'd', 's', 'b', 's', 'f', 'i', 'm', 'c'], ['f', 't', 'c', 'w', 'e', 'x', 's', 'f', 'e', 'j', 'h', 'y', 'f', 'g', 'd', 'f', 'n', 'x', 'g', 'l', 'n', 'm', 'l', 'k', 'p', 'y', 'm', ' ', 'u', 'x', 'n', 's', 'o', 'f', 'r', 'g', 'e', 'i', 'g', 'p', 'x', 'f', 'h', 'k', 'b', 'k'], ['a', 'p', 'j', 'q', 'x', 'p', 'h', 'r', 'g', 'u', 'o', 'x', 'x', 'k', 'v', 'm', 'o', 'e', 'z', 'z', 'w', 'v', 'k', 'l', 'o', 'o', 'n', 'p', 'q', 'k', 'a', 'k', 'c', 'l', 'w', 'a', 'k', 'z', 'd', 't', 's', 't', 'k', 'l', 'x', 'k'], ['t', 'f', 'v', 'q', 'x', 'e', 's', 'f', 'o', 'n', 'u', 'z', 'y', 'k', 'f', ' ', 'a', 'v', 'w', 'a', 'j', 'c', 't', 'g', 'z', 'k', 'j', ' ', 'i', 'w', 'h', 'q', 't', 'i', 'm', 'v', 'h', 'm', 'l', 'q', 'j', 'g', 'p', 'x', 'p', 'i'], ['x', 'q', 'b', 'i', 't', 'a', 'r', 'f', 'c', 'r', 'k', 't', 'j', 'e', 'z', 'd', 'w', 'o', 'g', 'x', 'u', 'i', 'z', ' ', 'm', 'h', 's', 'p', 'd', 's', 'k', 'm', 'e', 'k', 'y', 'h', 'l', 'b', 'z', 'y', 'i', 'c', 'p', 'y', 'y', 't'], ['p', 'g', 'c', 't', 'i', 'z', 's', 's', 'r', 'e', 'l', 'p', 't', 'o', 'r', 'g', 'x', 'c', 'u', 'b', 'o', 'l', 'h', 'h', 'k', 'b', 'n', 'e', 's', 'e', 'u', 'c', 'g', 'v', 'e', 'v', 'l', 'l', ' ', 'i', 'h', 'm', 'l', 'z', 'p', 'e'], ['l', 'i', 'o', 'f', 's', 'e', 'z', 'j', 'y', 'j', 'p', 'c', 'q', 'j', 'q', 'e', 'j', 'd', 'u', 's', 'n', 'y', 'r', ' ', 'f', 'i', 'f', 'u', 'd', 't', 'u', 'q', 'j', 'v', 'i', 'x', 'a', 'd', 'k', 'v', 'h', 'z', 'b', 'u', 'o', 'k'], ['v', 'p', 'b', 'h', 'm', 'a', 'p', 'n', 'z', 'l', 's', 'g', 'c', 'g', 't', 'x', 'a', 'x', 's', 'h', 'o', 'x', 'h', 's', 'x', 'n', ' ', 'o', 'w', 'f', 'v', 'm', 'w', 'u', 'c', 'y', 'x', 'x', 'h', 'p', 't', 'h', 's', 'w', 'w', 'l'], ['b', 'f', 'k', 'u', 'j', 'b', 'x', 'j', 'z', 'y', 'w', 'b', 'n', 'f', 'x', 'n', 'y', 'l', 'q', 'h', 't', 'v', 'u', 'y', 'i', 'g', 'q', 't', 'a', 'i', 'n', 'p', 'e', 'z', 'y', 'q', 'b', 'g', 'e', 'n', 'v', 's', 'e', 'u', 'b', 'h'], ['q', 'y', 'r', 'w', 't', 'g', 'g', 'm', 'f', ' ', 'e', 'u', 'e', 'g', 's', 'd', 'c', 'h', 'l', 'g', 'x', 'u', 'v', 'j', 'u', 'u', 'i', 'm', 'y', 'j', 'l', 'p', 'h', 'x', 'p', 'p', 'f', 'f', 'o', 'u', 'u', 'h', 'y', 'i', 'a', 'x'], ['v', ' ', 'w', 'a', 'e', 't', 'y', 't', 'i', 's', 'w', 'm', ' ', 'e', 'r', 'k', 'x', 'i', 'o', 'w', 'h', 'e', 'f', 'n', 'i', 'n', 'v', 'q', 'f', 'u', 'a', 'c', 'e', 's', 'p', 'n', 'j', 'g', 'q', 'w', 'q', 'u', 'j', 'b', 'v', 'i'], ['p', 'y', 'p', 'f', 'i', 'n', 's', 'c', 'j', 'p', 'o', 'o', 's', 'v', 's', 'z', 'y', 's', 'l', 'o', 'b', 'e', 'l', 'j', 'm', 'w', 'g', 'p', 'x', 'l', 'w', 'n', 'a', 't', 'm', 'd', 'p', 'p', 'l', 'p', 'e', 'v', 'c', 'o', 't', 'z'], ['x', ' ', 'v', 'x', 't', 's', 'i', 'a', 'j', 'q', 'h', 'p', 'x', 'q', 'y', 'n', 's', 'i', 'w', 'z', 'y', 'q', 'a', 'z', 't', 'm', 's', 'a', 'q', 'e', 'w', 'v', 'g', 'y', 'x', 'n', 'e', 'p', 'x', 't', 'q', 'r', 't', 'm', 'h', 'm'], ['m', 'u', 'd', 'r', 'r', 'h', 'b', 'f', ' ', 'h', 'b', 'l', 'q', 'x', 'f', 'b', 'r', 'e', 'v', 'd', 'm', 't', 'v', 'l', 'g', 'l', 'z', 'y', 'a', 'o', 'i', 'g', 'q', 'l', 'k', 'g', 'h', 'g', 's', 'b', 'a', 'b', 'k', 'p', 'g', 'r'], ['g', 'q', 'p', 'e', 'p', 'r', 'k', 'u', 'l', 'g', 'x', 'q', 'i', 'o', 'u', 'y', 'v', 'z', 't', 'q', 'g', 'd', 't', 'j', 'q', 'w', 'z', 'l', 'v', 'p', 'e', 'x', 'x', 'd', 'k', 'r', 'p', 'u', 'l', 'z', 'a', 'l', 'l', 'q', 'z', 'd'], ['j', 'w', 'q', 'e', 'p', 'v', 'f', 'p', 'w', 'n', 'u', 'j', 'z', 'p', 'f', 'v', 'r', 'r', 'h', 'z', 'r', 'l', 't', 'p', 'u', 'f', 'v', 'a', 'b', 'k', 'b', 'n', 'o', 'h', 'j', 'k', 'h', 'r', 'f', 'q', 'x', 'e', 'u', 'g', 'd', 'c'], ['c', 'v', 'd', ' ', 'k', 'd', 'd', 'd', 'd', 'f', 'u', 'f', 'l', 'x', 'e', 'd', 'q', 'l', 'w', 'x', 'e', 'e', 'x', 't', 'm', 'c', 'e', 'b', 'x', 'o', 'c', 'f', 'd', 'o', 'f', 't', 'j', 'f', 'g', 'l', 'k', 'x', 'u', 'q', 'n', 't'], ['l', 'd', 'p', 'k', 'n', 'w', 't', 'c', 'u', 'n', 'f', 'z', 'b', 'a', 'z', 'z', 'z', 'v', 'z', 's', 'n', 'f', 'y', 'c', 's', 'j', 'e', 'm', 'e', 'i', 'n', 'y', 'd', 'k', 'k', 'n', 'j', 'x', 'q', 't', 't', 'g', 's', 'd', 't', 'd'], ['c', 'c', 'g', 'd', 'y', 't', 'e', 'w', 'k', 'r', 'd', 'n', 's', 'm', 'l', 'p', 'h', 'f', 'c', 'l', 'n', 'l', 'c', 'm', 'l', 'u', 'k', ' ', 'x', 'e', 'l', 'j', 'l', 'g', 'l', 'h', 'l', 'r', 'p', 'v', 'd', 't', 'r', 'l', 'v', 'e'], ['t', 'a', 's', 'j', 'm', 'b', 'p', 'a', 'p', 'g', 'q', 'p', 'i', 'd', 'b', 'c', 's', 'w', 'c', 'n', 'm', 'a', 'c', 'm', 'f', 't', 'p', 'z', 'u', 'l', 'o', 'v', 'n', 'm', 'g', 'h', 'v', 'h', 'u', 's', 'i', 'n', 'f', 'h', 'l', 'f'], ['q', 'v', 'z', 'j', 's', 'c', 't', 'n', 'u', 'l', 'e', 'v', 'c', 's', 'j', 'n', 'q', 'b', 'c', 'h', 'e', 'x', 'h', 'g', 'k', 'u', 'p', 'u', 't', 'w', 'n', 't', 'p', 'i', 'b', 'u', 'b', 'h', 's', 'd', 'l', 'y', 'z', 'u', 'p', 'w'], ['s', 'f', 'o', 't', 'j', 'e', 'f', 'p', 'l', 'l', 'v', 'g', 'b', 'j', 'i', 'b', 'i', 'r', 'p', 'x', 'a', 'i', 'x', 't', 'g', 'g', 'a', 'k', 'd', 'z', 'l', 'y', 'u', 'r', 'b', 'p', 't', 'k', 'l', 't', 'x', 't', 'k', 'v', 'a', 'k'], ['c', 's', 'b', 'z', 'd', 'h', 'd', 'p', 'w', 'd', 'a', 'c', 'g', 'm', 't', 'u', 'u', 'o', 't', 'w', 'a', 'o', 'x', 'v', 'j', 'g', 'n', 'w', 'w', 'f', 'g', 'u', 'j', 'p', 'g', 't', 'w', 'x', 'j', 'p', 'm', 'y', 'o', 'g', 'm', 'w'], ['w', 'j', 'k', 'u', 'k', 'd', 'n', 'i', 'w', 'e', ' ', 'k', 'k', 'c', 'x', 'u', 'a', 'a', 'v', 'f', 'z', 'a', 'z', 'c', 'v', 'w', 'a', 'o', 'm', 'z', 'i', 'u', 'f', 'e', 'p', 'w', 'o', 'a', 't', 'u', 'a', 'p', 'l', 'y', 'w', 'j'], ['b', 'm', 'e', 'h', 's', 'q', 'c', 'g', 'd', 'a', 'i', 'h', 'g', 'f', 'e', 'j', 'x', 'u', 'p', 'p', 'p', 'd', 'v', 'f', 'd', 'l', 'l', 'g', 'h', 'h', 'n', 'q', 'k', 'l', 'g', 'k', 'y', 'y', 'u', 'a', 'g', 'w', 't', 'j', 'x', 'f'], ['k', 'j', 'l', 'x', 'j', 'm', 'e', 'y', 'd', 'z', 'l', 'w', 'r', 'w', 't', 'j', 'g', 'f', ' ', 's', 'j', 'j', 'p', 'h', 'k', 'x', 'k', 'k', 'b', 'n', 'j', 'h', 's', 'o', 'b', 'm', 'u', 'o', 'i', 'd', 'c', 'b', 'a', 'h', 'b', 'y'], ['l', 'l', 'r', 'z', 'f', 'j', 'g', 'e', 'j', 'g', 'x', 's', 'p', 'h', 't', 'a', 'c', 'y', 'b', 'r', 'n', 'n', 'r', 'n', 'd', 'j', 'h', 'm', 'x', 'a', 'v', 'g', 'c', 'r', 'l', 'v', 'f', 'e', 'z', 'k', 'z', 'q', 'r', 'f', 'l', 'h'], ['u', 'o', 'y', 'o', 'n', 'j', 'c', 'i', 'j', 'a', 'j', 'h', 'o', 'u', 's', 'm', 'k', 'y', 'i', 't', 'v', 'j', ' ', 'v', 'h', 'f', 'r', 'q', 'f', 'a', 'l', 'u', 'f', 'e', 'p', 'b', 'v', ' ', 'm', 'o', 'm', 'e', 'f', 'q', 't', 't'], [' ', 'b', 'h', 'i', 'h', 'c', 't', ' ', 'k', 'u', 'd', 'c', 'f', 'f', 's', 'v', 'z', 'a', 'b', 't', 'r', 'g', 'i', 'f', 'p', 'l', 'g', 'n', 'h', 'y', 'm', 'b', 'z', 'v', 'g', 'd', 'p', 'k', 'p', 'c', 'x', 'y', 'w', 'c', 'z', 'k'], ['p', 'q', 'o', 'm', 't', 'u', 'o', 'r', 'a', 'h', 's', 'q', 't', 's', 'v', 'u', 'c', 'n', 'v', 'e', 'r', 'x', 'k', 'v', 'm', 'p', 'q', 'd', 'y', 'q', 'j', 'c', 'l', 'm', 'r', 'z', 'd', 'k', 'v', 'u', 'g', ' ', 'y', 'o', 'i', 'x'], ['v', 'x', 'o', 'g', 't', 'g', 'g', 'n', 'a', 'q', 'p', 'l', 'k', 't', 'j', 'n', 'c', 'u', 'c', 'b', 'q', 'q', 'c', 'c', 'w', 'x', 'b', 'c', 't', 'v', 'z', 'y', 'y', 'o', 'u', 'e', 'o', 'x', 'j', 'v', 'r', 'y', 't', 'n', 'r', 'h'], ['z', 'o', 'w', 'z', 'v', 'k', 'u', 'c', 'n', 'm', 'h', 'w', 'y', 'z', 'g', 'k', 'h', 'o', 'k', 'b', 'k', 'q', 'u', 'p', 'z', 'v', 'j', 'u', 'z', 'p', 'b', 'y', 'p', 'y', 'u', 'w', 'z', 'i', 'c', 'm', 'w', 'j', 'c', 'l', ' ', 'o'], ['q', 'a', 'b', 'z', 'c', 'd', 'n', 'i', 'w', 'e', 'w', 'v', 'z', 'k', 'a', 'd', 'z', 'z', 'i', 't', 'y', 'k', 'u', 't', 'u', 'q', 'p', 'v', 'p', 'y', 'o', 'e', 'y', 'x', 'd', 'l', 'p', 'l', 'p', 'z', 'e', 'n', 'r', 'c', 'k', 'z']], [['1', '1', '1', '1', '2', '2', '3', '3', '3', '4', '4', '5', '5', '6', '7', '7', '7', '8', '8', '9', '9'], ['0', '0', '1', '1', '1', '2', '3', '4', '5', '6', '6', '6', '6', '6', '6', '6', '7', '7', '8', '8', '9'], ['0', '0', '0', '0', '0', '1', '1', '2', '2', '2', '3', '3', '4', '5', '5', '5', '5', '6', '7', '7', '8'], ['0', '1', '1', '2', '2', '2', '2', '2', '3', '3', '4', '4', '5', '5', '6', '6', '7', '7', '7', '9', '9'], ['0', '0', '1', '1', '2', '2', '2', '3', '3', '3', '4', '4', '4', '4', '4', '6', '7', '7', '8', '8', '9'], ['0', '0', '0', '0', '1', '1', '2', '3', '3', '3', '3', '4', '4', '4', '5', '7', '8', '8', '8', '9', '9'], ['0', '0', '0', '0', '0', '0', '1', '1', '2', '3', '4', '5', '5', '6', '6', '7', '7', '8', '8', '9', '9'], ['0', '2', '2', '2', '4', '4', '4', '4', '4', '5', '5', '5', '6', '6', '7', '7', '7', '8', '8', '9', '9'], ['0', '0', '1', '2', '3', '3', '3', '4', '4', '5', '5', '5', '7', '7', '7', '8', '8', '8', '9', '9', '9'], ['0', '0', '1', '2', '2', '3', '4', '4', '4', '4', '4', '5', '6', '6', '6', '7', '8', '8', '9', '9', '9'], ['0', '0', '1', '1', '1', '1', '1', '2', '2', '2', '2', '3', '4', '4', '5', '5', '6', '6', '8', '8', '9'], ['0', '0', '1', '2', '2', '2', '3', '3', '5', '5', '5', '6', '7', '7', '7', '7', '7', '8', '8', '9', '9'], ['0', '0', '1', '1', '1', '3', '5', '5', '5', '5', '6', '6', '6', '6', '6', '7', '7', '8', '8', '9', '9'], ['0', '0', '1', '2', '2', '2', '2', '2', '2', '3', '3', '5', '5', '5', '6', '7', '8', '8', '9', '9', '9'], ['0', '0', '0', '0', '2', '3', '5', '5', '5', '5', '5', '6', '6', '6', '7', '7', '7', '7', '7', '8', '9'], ['0', '0', '1', '2', '2', '3', '3', '3', '4', '4', '4', '5', '5', '5', '6', '6', '6', '7', '7', '8', '9'], ['0', '0', '0', '0', '1', '1', '3', '3', '3', '4', '4', '5', '5', '6', '7', '8', '8', '8', '9', '9', '9'], ['0', '0', '1', '1', '1', '1', '1', '2', '2', '3', '5', '5', '6', '6', '6', '7', '7', '7', '7', '8', '8'], ['0', '1', '1', '1', '1', '2', '2', '4', '4', '4', '4', '4', '5', '5', '6', '7', '7', '8', '8', '9', '9'], ['1', '1', '2', '2', '3', '3', '4', '5', '5', '5', '5', '6', '6', '7', '7', '7', '8', '8', '8', '9', '9'], ['0', '0', '0', '0', '2', '2', '2', '3', '3', '4', '5', '5', '5', '5', '5', '5', '6', '7', '7', '7', '9']], [['0', '1', '0', '1', '1', '1', '0', '1', '1', '0', '1', '0', '0', '0', '1', '1', '1', '1', '0', '0', '0', '1', '1', '1', '0', '1', '1', '1', '1', '1', '0', '0', '0', '1', '1', '1', '1', '0', '1'], ['1', '0', '0', '0', '1', '0', '1', '1', '0', '0', '0', '0', '1', '0', '0', '0', '1', '1', '0', '0', '0', '1', '0', '0', '1', '0', '1', '1', '1', '1', '0', '0', '0', '0', '0', '0', '0', '1', '0'], ['0', '1', '1', '0', '1', '0', '1', '1', '0', '0', '0', '1', '0', '1', '1', '0', '1', '0', '0', '1', '0', '1', '0', '1', '1', '1', '0', '1', '0', '0', '0', '1', '0', '0', '1', '1', '1', '0', '0'], ['0', '1', '1', '0', '0', '1', '1', '1', '0', '0', '0', '1', '1', '1', '1', '1', '0', '1', '0', '1', '1', '0', '0', '0', '1', '1', '0', '0', '1', '1', '1', '1', '0', '0', '0', '0', '1', '1', '0'], ['1', '1', '1', '1', '1', '0', '0', '0', '1', '0', '1', '1', '0', '1', '1', '0', '0', '1', '1', '1', '1', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '1', '0', '0', '1', '0', '0', '1', '1'], ['1', '0', '1', '0', '0', '1', '1', '1', '1', '0', '1', '1', '0', '0', '0', '0', '1', '0', '0', '1', '0', '1', '0', '1', '1', '1', '1', '0', '0', '1', '0', '0', '1', '1', '0', '1', '0', '1', '0'], ['0', '0', '0', '0', '1', '1', '0', '1', '0', '1', '0', '1', '1', '1', '1', '1', '0', '1', '1', '0', '1', '0', '0', '1', '0', '1', '0', '0', '0', '0', '1', '1', '1', '1', '0', '0', '0', '1', '1'], ['1', '0', '0', '1', '1', '1', '1', '0', '0', '0', '1', '0', '0', '1', '0', '0', '0', '0', '1', '0', '1', '0', '0', '0', '0', '1', '1', '0', '1', '1', '0', '1', '0', '0', '0', '0', '1', '0', '0'], ['0', '0', '1', '1', '1', '1', '0', '1', '0', '1', '1', '1', '1', '0', '1', '1', '0', '0', '0', '0', '0', '0', '0', '1', '0', '1', '1', '0', '1', '0', '0', '0', '1', '1', '0', '1', '1', '1', '1'], ['1', '0', '0', '1', '1', '0', '1', '1', '0', '0', '0', '1', '1', '0', '1', '0', '1', '0', '0', '0', '0', '1', '1', '1', '0', '1', '1', '0', '0', '1', '0', '0', '0', '1', '1', '0', '1', '0', '0'], ['0', '0', '0', '1', '0', '0', '1', '1', '0', '0', '1', '0', '0', '1', '0', '0', '0', '0', '1', '1', '0', '1', '0', '0', '1', '0', '1', '0', '1', '0', '1', '1', '0', '0', '0', '1', '0', '0', '1'], ['1', '0', '0', '1', '0', '0', '0', '0', '1', '1', '1', '0', '1', '1', '1', '0', '0', '0', '0', '0', '0', '1', '0', '1', '0', '1', '0', '1', '1', '1', '1', '0', '1', '0', '1', '1', '0', '1', '0'], ['0', '0', '1', '0', '0', '0', '1', '1', '1', '1', '1', '0', '1', '1', '1', '1', '0', '0', '1', '0', '0', '0', '0', '1', '0', '1', '1', '0', '0', '1', '1', '1', '0', '0', '0', '1', '1', '0', '0'], ['0', '1', '0', '1', '0', '0', '0', '0', '1', '1', '1', '1', '0', '0', '0', '0', '1', '1', '1', '0', '0', '0', '0', '0', '0', '1', '0', '1', '1', '1', '1', '0', '0', '1', '0', '0', '0', '0', '0'], ['0', '0', '0', '0', '1', '1', '0', '0', '1', '1', '0', '0', '0', '1', '1', '0', '1', '0', '0', '0', '0', '1', '0', '0', '1', '1', '1', '0', '0', '1', '1', '1', '1', '0', '1', '0', '1', '1', '1'], ['1', '1', '0', '1', '1', '0', '0', '0', '0', '0', '0', '1', '0', '1', '0', '0', '0', '1', '1', '0', '1', '1', '0', '0', '1', '0', '0', '1', '0', '0', '0', '0', '1', '0', '1', '0', '1', '0', '1'], ['0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '0', '1', '0', '0', '1', '1', '1', '1', '1', '0'], ['1', '1', '0', '1', '1', '1', '0', '0', '1', '1', '0', '0', '1', '0', '1', '1', '0', '1', '1', '0', '0', '1', '1', '0', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '0', '1', '0', '1', '1'], ['0', '0', '1', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '1', '1', '1', '0', '1', '0', '0', '0', '0', '0', '1', '0', '0', '0', '0', '1', '0', '1', '1', '1', '0', '1', '1', '1', '0', '0'], ['1', '1', '0', '1', '0', '0', '1', '1', '1', '1', '0', '0', '1', '0', '0', '0', '1', '1', '1', '0', '1', '0', '1', '0', '1', '1', '1', '1', '1', '0', '0', '0', '1', '0', '0', '0', '1', '1', '1'], ['1', '0', '0', '1', '1', '1', '0', '0', '1', '1', '1', '1', '1', '0', '0', '0', '0', '0', '1', '0', '1', '0', '0', '0', '0', '1', '0', '0', '1', '1', '0', '1', '1', '0', '1', '0', '0', '0', '0'], ['0', '0', '1', '1', '0', '1', '1', '1', '0', '0', '0', '1', '1', '1', '1', '1', '0', '1', '1', '1', '1', '0', '1', '0', '1', '0', '1', '1', '1', '0', '0', '1', '0', '1', '1', '1', '1', '0', '0'], ['0', '1', '0', '1', '1', '1', '1', '1', '0', '0', '1', '1', '0', '1', '0', '1', '1', '0', '0', '0', '1', '0', '0', '1', '0', '1', '0', '0', '1', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1'], ['0', '1', '1', '1', '1', '0', '1', '1', '0', '0', '1', '0', '0', '1', '1', '0', '1', '0', '0', '0', '1', '1', '0', '0', '0', '0', '0', '1', '1', '0', '1', '1', '0', '1', '1', '1', '0', '0', '1'], ['0', '0', '0', '1', '0', '0', '1', '0', '1', '0', '0', '1', '0', '1', '1', '0', '1', '0', '1', '1', '0', '0', '0', '0', '1', '0', '1', '0', '0', '1', '0', '1', '1', '1', '1', '0', '0', '0', '1'], ['1', '0', '0', '1', '0', '1', '0', '1', '0', '0', '1', '1', '1', '0', '0', '0', '1', '0', '1', '1', '0', '1', '1', '1', '0', '0', '1', '1', '0', '1', '1', '0', '1', '1', '0', '0', '1', '1', '0'], ['0', '0', '1', '0', '1', '1', '0', '0', '1', '1', '1', '0', '0', '1', '1', '1', '0', '1', '0', '0', '0', '0', '1', '1', '1', '1', '1', '0', '0', '1', '0', '1', '0', '0', '1', '0', '1', '0', '0'], ['1', '1', '0', '0', '1', '1', '1', '0', '0', '1', '0', '1', '1', '1', '0', '0', '0', '0', '0', '1', '0', '1', '0', '1', '1', '0', '1', '1', '1', '0', '0', '1', '0', '0', '1', '0', '1', '1', '1'], ['0', '1', '0', '0', '1', '1', '0', '1', '1', '0', '1', '0', '1', '1', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '0', '1', '0', '0', '0', '0', '0', '1', '1', '0', '1', '0', '1'], ['1', '0', '1', '0', '1', '1', '0', '0', '0', '1', '1', '0', '0" FIND_WHETHER_A_GIVEN_NUMBER_IS_A_POWER_OF_4_OR_NOT_2,"static boolean f_filled ( int n ) { return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ( n & 0xAAAAAAAA ) == 0 ; }","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, false, false]; int [] param0 = [1, 4, 64, -64, 128, 1024, 97, 86, 14, 99]; 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_XOR_VALUE_PAIR,"static int f_filled ( int arr [ ] , int n ) { int min_xor = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) min_xor = Math . min ( min_xor , arr [ i ] ^ arr [ j ] ) ; return min_xor ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, -96, 0, 0, 0, 0, 0, -96, 0, 0]; int [] [] param0 = [[4, 5, 7, 10, 10, 11, 14, 19, 21, 24, 27, 27, 27, 28, 28, 28, 33, 34, 41, 42, 43, 48, 52, 53, 53, 59, 62, 64, 66, 71, 77, 78, 78, 79, 80, 82, 90, 97, 99, 99], [-96, -94, -94, -84, -70, -68, -66, -64, -58, -28, -22, -16, -14, -10, -2, 0, 8, 28, 36, 42, 50, 52, 56, 56, 56, 66, 74, 80, 80, 88, 90, 90, 90, 94], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [10, 11, 17, 23, 25, 31, 39, 42, 45, 48, 57, 60, 63, 65, 73, 73, 75, 83, 94, 96, 97, 97], [-92, -92, -90, -88, -84, -82, -66, -64, -64, -62, -44, -42, -40, -28, -22, -12, -4, -2, 0, 4, 16, 22, 28, 34, 54, 60, 72, 74, 78, 86, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 2, 6, 13, 16, 16, 17, 19, 19, 20, 22, 25, 27, 29, 34, 34, 34, 36, 38, 39, 42, 49, 49, 53, 59, 59, 71, 77, 79, 82, 83, 83, 84, 84, 86, 86, 87, 88, 93, 96], [-96, -94, -92, -82, -54, -50, -48, -46, -46, -28, -28, -28, -20, -14, -14, 6, 12, 14, 20, 22, 24, 36, 36, 44, 46, 70, 74, 82, 92, 96, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [4, 5, 11, 12, 12, 13, 17, 18, 19, 22, 23, 23, 23, 27, 32, 33, 34, 38, 42, 48, 48, 50, 51, 54, 60, 62, 64, 69, 70, 70, 75, 76, 77, 78, 79, 82, 93, 94, 96, 99]]; int [] param1 = [34, 17, 9, 21, 18, 36, 36, 20, 39, 30]; 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_TIME_WRITE_CHARACTERS_USING_INSERT_DELETE_COPY_OPERATION,"static int f_filled ( int N , int insert , int remove , int copy ) { if ( N == 0 ) return 0 ; if ( N == 1 ) return insert ; int dp [ ] = new int [ N + 1 ] ; for ( int i = 1 ; i <= N ; i ++ ) { if ( i % 2 == 0 ) dp [ i ] = Math . min ( dp [ i - 1 ] + insert , dp [ i / 2 ] + copy ) ; else dp [ i ] = Math . min ( dp [ i - 1 ] + insert , dp [ ( i + 1 ) / 2 ] + copy + remove ) ; } return dp [ N ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [351, 382, 195, 76, 460, 147, 405, 392, 694, 244]; int [] param0 = [59, 66, 98, 63, 99, 45, 60, 11, 96, 54]; int [] param1 = [75, 68, 55, 4, 37, 28, 53, 96, 95, 6]; int [] param2 = [12, 32, 69, 41, 98, 59, 40, 50, 48, 50]; int [] param3 = [45, 41, 5, 12, 55, 7, 52, 50, 84, 82]; 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); } " FIRST_ELEMENT_OCCURRING_K_TIMES_ARRAY,"static int f_filled ( int arr [ ] , int n , int k ) { HashMap < Integer , Integer > count_map = new HashMap < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int a = 0 ; if ( count_map . get ( arr [ i ] ) != null ) { a = count_map . get ( arr [ i ] ) ; } count_map . put ( arr [ i ] , a + 1 ) ; } for ( int i = 0 ; i < n ; i ++ ) { if ( count_map . get ( arr [ i ] ) == k ) { return arr [ i ] ; } } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, -1, -1, 38, -8, 0, 49, -1, -1, -1]; int [] [] param0 = [[2, 3, 4, 4, 7, 18, 20, 23, 27, 30, 31, 31, 32, 35, 36, 43, 45, 46, 49, 50, 53, 55, 59, 60, 64, 64, 65, 68, 78, 80, 80, 85, 95], [-26, 32, 36, 6, 64, 24, -28, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [38, 40, 43, 70, 20, 40, 95, 96, 81, 82], [-68, -8, -8, 16, 24, 54], [1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1], [13, 18, 19, 28, 31, 34, 49, 49, 53, 57, 58, 62, 75, 76, 77, 78, 80, 84, 84, 85, 87, 91, 98, 99], [-4, 24, -86, -84, 30, -16, 12, -92, -68, 22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [55, 44, 75, 97, 25, 65, 76, 53, 20, 78, 25, 59, 61, 29, 81, 35, 15, 78, 41, 44, 31, 33, 39, 93, 26, 67]]; int [] param1 = [30, 6, 15, 9, 3, 6, 20, 6, 8, 23]; int [] param2 = [2, 3, 7, 1, 2, 4, 2, 5, 10, 20]; 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); } " FIRST_UPPERCASE_LETTER_IN_A_STRING_ITERATIVE_AND_RECURSIVE,"static char f_filled ( String str ) { for ( int i = 0 ; i < str . length ( ) ; i ++ ) if ( Character . isUpperCase ( str . charAt ( i ) ) ) return str . charAt ( i ) ; return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ char [] results = ['h', '\x00', '\x00', '\x00', '\x00', '\x00', '\x00', '\x00', '\x00', '\x00']; string [] param0 = [""ph"", ""96544000"", ""000010000"", ""ujqpx"", ""20684847994"", ""111"", ""rclkv"", ""45173693434"", ""11111011001101"", ""f""]; 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_TRIPLET_SUM_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; return arr [ n - 1 ] + arr [ n - 2 ] + arr [ n - 3 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [284, 230, 3, 281, 244, 3, 285, 234, 3, 225]; int [] [] param0 = [[6, 8, 18, 18, 27, 33, 33, 38, 42, 43, 44, 47, 52, 58, 64, 65, 67, 68, 71, 75, 85, 89, 91, 94, 94, 95, 95], [-88, -84, -82, -58, -12, 18, 24, 24, 28, 30, 34, 44, 92, 94], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 2, 4, 5, 9, 11, 12, 15, 16, 18, 18, 21, 23, 25, 25, 26, 27, 28, 31, 34, 35, 47, 51, 55, 63, 63, 66, 67, 70, 70, 72, 73, 73, 75, 76, 79, 81, 84, 87, 87, 92, 94, 95], [-86, -86, -78, -56, -24, -14, -10, -6, 12, 12, 18, 22, 22, 26, 50, 50, 72, 78, 94], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [2, 13, 17, 19, 20, 23, 28, 28, 29, 40, 45, 51, 52, 58, 58, 68, 70, 75, 79, 81, 92, 96, 97], [-78, -62, -46, -36, -20, -4, 4, 6, 6, 40, 50, 52, 64, 76, 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, 1, 1, 1, 1, 1, 1], [3, 3, 4, 5, 6, 7, 11, 11, 14, 15, 17, 22, 25, 32, 33, 34, 35, 42, 44, 44, 52, 57, 58, 66, 70, 89]]; int [] param1 = [27, 14, 20, 43, 19, 15, 23, 15, 36, 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); } " FLOOR_IN_A_SORTED_ARRAY_1,"static int f_filled ( int arr [ ] , int low , int high , int x ) { if ( low > high ) return - 1 ; if ( x >= arr [ high ] ) return high ; int mid = ( low + high ) / 2 ; if ( arr [ mid ] == x ) return mid ; if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1 ; if ( x < arr [ mid ] ) return f_filled ( arr , low , mid - 1 , x ) ; return f_filled ( arr , mid + 1 , high , x ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 28, -1, -1, -1, -1, -1, 31, 29, -1]; int [] [] param0 = [[5, 11, 20, 42, 42, 55, 58, 98, 99], [50, -90, -38, -46, -10, -22, -66, 72, -52, 38, 90, 34, -12, -44, -6, 0, -20, -38, 86, 26, 64, -24, 40, 90, -26, -2, -28, 12, 22, -14], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [69, 28, 68, 98, 24, 67, 86, 2, 18, 22, 44, 77, 52, 62, 24, 46], [-96, -94, -88, -84, -68, -60, -52, -52, -42, -34, -32, -16, -12, -6, -6, -4, -2, 0, 16, 18, 38, 58, 70, 72, 76, 78, 90, 92, 98], [0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0], [1, 6, 7, 9, 10, 11, 19, 19, 22, 22, 26, 34, 36, 37, 37, 38, 39, 40, 49, 54, 60, 62, 65, 67, 71, 76, 78, 79, 82, 82, 89, 95, 97], [76, -32, -98, -18, -80, 74, -22, -82, 40, -64, 58, -18, -64, 34, -44, -82, -46, 62, -80, -76, 32, 44, -32, 98, -26, 62, 16, 86, -52, -72, -90, -30, 6], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [81, 69, 15, 52, 49, 54, 18, 92, 33, 21, 91, 21, 5, 25, 77, 92, 26, 58, 72, 55, 76, 18, 13, 59, 9, 12, 31, 24, 36, 33, 71, 87, 55, 19, 42, 25]]; int [] param1 = [5, 26, 11, 15, 22, 24, 22, 28, 28, 35]; int [] param2 = [7, 28, 9, 11, 27, 15, 26, 31, 29, 19]; int [] param3 = [6, 23, 18, 13, 20, 26, 25, 24, 30, 33]; 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); } " LONGEST_PALINDROME_SUBSEQUENCE_SPACE,"static int f_filled ( String s ) { int n = s . length ( ) ; int a [ ] = new int [ n ] ; for ( int i = n - 1 ; i >= 0 ; i -- ) { int back_up = 0 ; for ( int j = i ; j < n ; j ++ ) { if ( j == i ) a [ j ] = 1 ; else if ( s . charAt ( i ) == s . charAt ( j ) ) { int temp = a [ j ] ; a [ j ] = back_up + 2 ; back_up = temp ; } else { back_up = a [ j ] ; a [ j ] = Math . max ( a [ j - 1 ] , a [ j ] ) ; } } } return a [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 7, 5, 3, 1, 8, 1, 7, 1, 1]; string [] param0 = ["" e"", ""0845591950"", ""00101011"", ""plsvlwracvfaot"", ""7246"", ""1010101100000"", ""obpkclsfp"", ""914757557818"", ""1"", ""pkvuwiq""]; 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); } " FORM_SMALLEST_NUMBER_USING_ONE_SWAP_OPERATION,"static String f_filled ( String str ) { char [ ] num = str . toCharArray ( ) ; int n = str . length ( ) ; int [ ] rightMin = new int [ n ] ; rightMin [ n - 1 ] = - 1 ; int right = n - 1 ; for ( int i = n - 2 ; i >= 1 ; i -- ) { if ( num [ i ] > num [ right ] ) rightMin [ i ] = right ; else { rightMin [ i ] = - 1 ; right = i ; } } int small = - 1 ; for ( int i = 1 ; i < n ; i ++ ) if ( num [ i ] != '0' ) { if ( small == - 1 ) { if ( num [ i ] < num [ 0 ] ) small = i ; } else if ( num [ i ] < num [ small ] ) small = i ; } if ( small != - 1 ) { char temp ; temp = num [ 0 ] ; num [ 0 ] = num [ small ] ; num [ small ] = temp ; } else { for ( int i = 1 ; i < n ; i ++ ) { if ( rightMin [ i ] != - 1 ) { char temp ; temp = num [ i ] ; num [ i ] = num [ rightMin [ i ] ] ; num [ rightMin [ i ] ] = temp ; break ; } } } return ( new String ( num ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""ecyltuhsxnfg"", ""16625541616459"", ""0011"", ""kh"", ""122462103899"", ""0001"", ""sfczh"", ""29"", ""0"", ""v""]; string [] param0 = [""ncyltuhsxefg"", ""26615541616459"", ""0101"", ""hk"", ""422162103899"", ""0010"", ""zfcsh"", ""92"", ""0"", ""v""]; 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_XOR_VALUE_MATRIX,"static int f_filled ( int mat [ ] [ ] , int N ) { int r_xor , c_xor ; int max_xor = 0 ; for ( int i = 0 ; i < N ; i ++ ) { r_xor = 0 ; c_xor = 0 ; for ( int j = 0 ; j < N ; j ++ ) { r_xor = r_xor ^ mat [ i ] [ j ] ; c_xor = c_xor ^ mat [ j ] [ i ] ; } if ( max_xor < Math . max ( r_xor , c_xor ) ) max_xor = Math . max ( r_xor , c_xor ) ; } return max_xor ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [126, 126, 1, 126, 92, 1, 127, 122, 1, 125]; int [] [] [] param0 = [[[2, 2, 3, 9, 9, 10, 12, 13, 17, 19, 26, 28, 28, 30, 30, 32, 32, 39, 40, 41, 42, 52, 52, 54, 54, 55, 56, 59, 62, 63, 69, 71, 72, 72, 72, 73, 77, 78, 80, 83, 83, 85, 87, 90, 90, 91, 93], [1, 1, 3, 5, 5, 8, 10, 14, 15, 17, 20, 22, 24, 24, 26, 27, 32, 33, 33, 35, 38, 40, 41, 44, 54, 54, 55, 55, 59, 63, 64, 65, 66, 71, 72, 73, 73, 74, 74, 76, 80, 80, 83, 87, 89, 93, 97], [2, 2, 3, 3, 6, 9, 9, 10, 13, 15, 15, 17, 19, 22, 22, 22, 23, 24, 25, 27, 27, 29, 29, 35, 36, 37, 38, 41, 41, 52, 52, 54, 54, 61, 64, 65, 66, 70, 72, 73, 73, 74, 89, 89, 90, 97, 97], [1, 11, 15, 18, 22, 22, 25, 27, 27, 28, 29, 31, 32, 33, 40, 40, 42, 42, 42, 46, 52, 52, 52, 54, 55, 56, 57, 59, 60, 60, 61, 62, 66, 66, 67, 67, 76, 77, 78, 80, 85, 85, 87, 88, 88, 98, 99], [1, 2, 3, 4, 6, 9, 10, 15, 15, 19, 20, 20, 28, 29, 34, 35, 36, 45, 47, 48, 54, 56, 57, 62, 64, 65, 66, 68, 69, 70, 75, 76, 77, 77, 77, 79, 79, 83, 87, 90, 90, 92, 95, 96, 96, 99, 99], [1, 1, 3, 3, 4, 8, 9, 11, 15, 18, 18, 22, 23, 23, 24, 26, 26, 28, 29, 32, 40, 41, 42, 42, 43, 44, 54, 54, 54, 57, 58, 61, 64, 67, 69, 72, 76, 79, 80, 80, 87, 89, 91, 93, 95, 95, 97], [1, 1, 6, 11, 14, 14, 16, 17, 20, 20, 25, 28, 28, 30, 31, 31, 33, 35, 36, 37, 37, 40, 42, 43, 45, 45, 48, 49, 54, 55, 55, 60, 60, 62, 63, 65, 66, 72, 74, 80, 80, 82, 82, 84, 84, 93, 94], [4, 5, 8, 10, 10, 14, 20, 21, 21, 23, 23, 23, 25, 27, 33, 36, 37, 40, 45, 48, 50, 52, 56, 57, 63, 67, 68, 69, 72, 77, 77, 82, 82, 83, 83, 84, 85, 86, 87, 88, 92, 93, 95, 96, 97, 97, 97], [1, 7, 7, 9, 13, 13, 18, 19, 21, 28, 28, 31, 37, 39, 41, 43, 44, 45, 48, 48, 49, 50, 51, 52, 58, 62, 63, 64, 64, 68, 70, 73, 74, 79, 80, 81, 85, 88, 90, 91, 93, 93, 94, 94, 95, 98, 98], [3, 8, 9, 12, 13, 15, 15, 18, 19, 21, 23, 24, 29, 30, 34, 38, 39, 40, 42, 45, 47, 50, 54, 55, 57, 57, 58, 64, 65, 65, 67, 67, 67, 68, 69, 71, 72, 72, 75, 79, 80, 81, 81, 83, 85, 91, 93], [3, 3, 5, 5, 6, 11, 23, 24, 25, 27, 29, 31, 35, 35, 38, 40, 43, 44, 45, 46, 50, 54, 54, 55, 57, 57, 58, 62, 65, 69, 70, 70, 74, 78, 78, 78, 79, 79, 80, 84, 87, 90, 90, 92, 94, 98, 99], [9, 14, 17, 17, 21, 22, 24, 25, 27, 31, 31, 32, 36, 37, 43, 46, 46, 48, 49, 50, 50, 54, 59, 60, 63, 63, 66, 68, 71, 72, 74, 76, 76, 77, 77, 79, 82, 83, 84, 85, 86, 87, 89, 89, 91, 92, 94], [2, 3, 8, 10, 10, 11, 16, 19, 19, 21, 21, 23, 27, 28, 34, 36, 40, 41, 46, 46, 46, 48, 52, 52, 52, 53, 60, 63, 64, 66, 67, 67, 71, 71, 72, 74, 77, 80, 83, 84, 86, 88, 88, 88, 89, 89, 89], [6, 9, 11, 12, 12, 14, 15, 16, 21, 29, 29, 30, 30, 32, 34, 35, 43, 43, 44, 45, 51, 51, 52, 54, 57, 58, 59, 64, 65, 67, 69, 70, 70, 72, 75, 76, 79, 82, 86, 86, 88, 90, 92, 93, 98, 98, 98], [1, 2, 3, 8, 9, 13, 15, 16, 17, 17, 17, 19, 22, 25, 32, 36, 44, 44, 45, 46, 48, 54, 55, 58, 66, 68, 72, 72, 73, 74, 78, 79, 80, 80, 82, 89, 89, 89, 90, 91, 91, 93, 93, 97, 97, 98, 99], [3, 5, 9, 9, 14, 14, 16, 16, 18, 21, 22, 26, 26, 35, 35, 37, 42, 42, 44, 46, 47, 48, 49, 50, 54, 56, 58, 59, 61, 65, 66, 66, 66, 66, 70, 79, 79, 80, 83, 87, 88, 92, 96, 97, 98, 99, 99], [4, 7, 9, 10, 10, 12, 16, 20, 22, 24, 26, 28, 33, 34, 34, 36, 37, 37, 39, 43, 45, 45, 46, 51, 52, 53, 54, 55, 55, 56, 56, 57, 59, 63, 65, 69, 70, 70, 70, 73, 74, 77, 82, 85, 92, 97, 98], [1, 1, 2, 3, 3, 3, 4, 7, 12, 14, 18, 19, 21, 25, 30, 31, 37, 38, 39, 39, 41, 41, 44, 44, 45, 49, 52, 53, 55, 57, 59, 59, 70, 74, 75, 78, 78, 83, 87, 89, 90, 91, 93, 97, 97, 98, 98], [4, 6, 6, 9, 12, 15, 21, 22, 23, 26, 29, 30, 33, 40, 41, 41, 42, 43, 44, 46, 47, 50, 53, 56, 60, 61, 61, 62, 62, 62, 64, 66, 71, 75, 77, 77, 84, 85, 85, 85, 85, 89, 90, 90, 91, 97, 98], [1, 5, 13, 14, 17, 17, 17, 19, 21, 22, 23, 23, 24, 25, 25, 28, 32, 32, 33, 37, 38, 38, 39, 44, 45, 46, 47, 59, 60, 63, 70, 72, 72, 74, 75, 75, 77, 78, 80, 80, 82, 84, 85, 91, 92, 99, 99], [4, 5, 9, 14, 17, 19, 21, 25, 25, 27, 29, 29, 30, 30, 32, 42, 42, 44, 44, 44, 45, 46, 51, 54, 57, 57, 61, 69, 69, 72, 73, 74, 75, 77, 78, 80, 81, 82, 89, 91, 91, 93, 96, 96, 97, 98, 99], [1, 2, 7, 8, 9, 11, 12, 12, 15, 17, 17, 21, 26, 28, 30, 31, 33, 35, 36, 41, 41, 44, 44, 45, 47, 48, 49, 50, 52, 53, 53, 56, 67, 71, 71, 72, 74, 75, 78, 83, 85, 86, 86, 88, 89, 95, 99], [2, 4, 5, 13, 17, 18, 21, 22, 24, 26, 27, 28, 29, 31, 32, 34, 35, 36, 38, 38, 39, 41, 43, 43, 52, 52, 54, 62, 69, 70, 71, 71, 72, 73, 77, 77, 78, 81, 82, 82, 84, 86, 89, 91, 93, 94, 95], [3, 3, 3, 5, 5, 10, 20, 21, 23, 24, 30, 32, 33, 35, 39, 40, 43, 43, 44, 45, 48, 48, 49, 52, 55, 56, 56, 57, 57, 59, 64, 65, 67, 68, 68, 72, 73, 80, 81, 81, 82, 82, 85, 88, 89, 93, 98], [3, 6, 6, 11, 12, 12, 13, 21, 21, 23, 25, 31, 31, 33, 36, 37, 41, 43, 44, 46, 50, 53, 56, 57, 57, 57, 58, 59, 62, 66, 71, 73, 74, 78, 78, 78, 79, 80, 89, 92, 92, 94, 96, 96, 97, 97, 97], [3, 5, 12, 15, 23, 24, 25, 29, 32, 34, 34, 36, 36, 40, 44, 46, 46, 47, 48, 48, 48, 49, 50, 56, 59, 60, 62, 62, 66, 67, 70, 73, 76, 77, 80, 81, 82, 83, 83, 86, 87, 88, 90, 91, 92, 98, 99], [9, 11, 13, 19, 20, 21, 23, 26, 29, 29, 30, 35, 38, 38, 42, 43, 47, 50, 52, 53, 54, 55, 56, 57, 57, 58, 61, 62, 63, 65, 67, 69, 72, 72, 72, 76, 79, 82, 85, 86, 86, 87, 88, 89, 90, 90, 99], [5, 7, 11, 15, 16, 20, 21, 24, 24, 26, 30, 31, 33, 34, 35, 39, 43, 44, 45, 45, 46, 48, 49, 50, 57, 58, 59, 61, 62, 62, 64, 65, 66, 66, 67, 72, 78, 80, 84, 84, 84, 84, 89, 91, 92, 96, 97], [2, 6, 7, 9, 10, 14, 14, 16, 21, 22, 24, 27, 30, 32, 32, 33, 35, 35, 37, 40, 43, 47, 55, 56, 59, 65, 67, 68, 68, 69, 70, 71, 73, 74, 75, 76, 78, 79, 79, 82, 86, 88, 90, 93, 94, 97, 99], [3, 3, 4, 4, 5, 8, 11, 13, 14, 14, 17, 19, 19, 20, 20, 21, 22, 22, 29, 40, 41, 42, 42, 46, 48, 48, 51, 58, 68, 69, 70, 71, 74, 79, 81, 82, 84, 87, 89, 90, 90, 92, 94, 95, 96, 97, 98], [1, 1, 2, 2, 5, 6, 7, 7, 9, 11, 13, 16, 18, 25, 26, 27, 31, 32, 33, 35, 35, 35, 38, 39, 40, 55, 58, 58, 60, 61, 62, 63, 64, 68, 70, 72, 72, 74, 75, 76, 81, 82, 84, 90, 97, 97, 99], [2, 2, 3, 3, 6, 8, 8, 10, 12, 13, 13, 15, 15, 16, 16, 18, 21, 22, 31, 40, 41, 43, 48, 48, 49, 50, 51, 52, 53, 57, 61, 61, 63, 67, 67, 69, 75, 76, 77, 79, 81, 84, 85, 89, 90, 91, 97], [5, 5, 6, 7, 9, 16, 18, 19, 19, 20, 22, 23, 23, 24, 25, 27, 27, 28, 32, 34, 34, 34, 37, 37, 38, 43, 52, 53, 54, 55, 59, 62, 63, 64, 65, 70, 74, 77, 78, 78, 79, 81, 83, 83, 88, 93, 97], [1, 3, 4, 6, 9, 11, 13, 13, 15, 18, 19, 20, 20, 23, 23, 25, 28, 28, 35, 35, 37, 39, 42, 44, 49, 52, 53, 53, 53, 60, 60, 61, 62, 63, 64, 64, 65, 65, 65, 65, 65, 67, 67, 71, 72, 81, 83], [3, 5, 6, 8, 8, 14, 15, 20, 21, 22, 26, 26, 28, 29, 32, 35, 36, 37, 38, 42, 44, 49, 50, 51, 56, 57, 59, 62, 65, 67, 68, 68, 70, 73, 73, 75, 79, 84, 89, 90, 90, 91, 95, 97, 98, 99, 99], [2, 2, 7, 9, 9, 10, 12, 14, 15, 15, 22, 22, 23, 23, 24, 24, 27, 28, 29, 29, 29, 35, 35, 43, 45, 52, 55, 57, 66, 67, 67, 68, 71, 75, 76, 79, 80, 81, 90, 91, 91, 94, 94, 95, 96, 96, 99], [1, 2, 2, 4, 11, 12, 12, 13, 17, 20, 22, 22, 25, 27, 29, 37, 41, 42, 43, 43, 45, 47, 53, 54, 54, 54, 55, 55, 59, 60, 63, 66, 66, 66, 81, 82, 82, 82, 84, 85, 85, 86, 93, 94, 94, 94, 96], [3, 5, 5, 6, 17, 19, 21, 22, 24, 24, 29, 32, 32, 36, 38, 40, 40, 41, 48, 49, 50, 53, 54, 54, 55, 56, 58, 59, 59, 61, 70, 71, 74, 74, 77, 78, 81, 83, 83, 84, 85, 86, 87, 88, 90, 95, 96], [1, 2, 3, 4, 6, 9, 10, 12, 14, 15, 15, 15, 18, 22, 23, 23, 24, 25, 27, 32, 34, 35, 37, 38, 40, 41, 42, 43, 44, 46, 46, 49, 53, 54, 54, 55, 55, 55, 60, 78, 83, 86, 86, 87, 91, 93, 98], [2, 2, 9, 10, 11, 14, 17, 18, 19, 23, 23, 31, 31, 31, 35, 36, 36, 38, 39, 41, 43, 43, 44, 50, 53, 54, 60, 61, 61, 64, 64, 67, 71, 72, 72, 72, 78, 79, 80, 81, 83, 84, 87, 88, 92, 93, 99], [3, 5, 7, 7, 12, 12, 12, 18, 19, 20, 20, 21, 24, 25, 26, 26, 28, 32, 36, 39, 39, 41, 53, 54, 54, 55, 59, 60, 62, 64, 64, 64, 64, 65, 67, 68, 79, 81, 87, 88, 96, 97, 97, 97, 98, 99, 99], [4, 7, 17, 19, 20, 29, 32, 33, 34, 34, 35, 37, 37, 39, 43, 44, 47, 51, 53, 53, 55, 56, 56, 57, 60, 60, 62, 63, 63, 66, 68, 68, 70, 72, 73, 74, 79, 81, 82, 85, 89, 91, 92, 93, 95, 96, 97], [3, 3, 3, 6, 10, 13, 14, 14, 16, 17, 18, 18, 18, 19, 28, 31, 33, 34, 35, 44, 44, 45, 48, 51, 59, 59, 60, 62, 65, 66, 67, 70, 71, 73, 73, 73, 77, 78, 82, 86, 86, 88, 88, 89, 90, 93, 93], [5, 10, 12, 15, 16, 18, 18, 18, 19, 22, 26, 27, 27, 28, 29, 31, 36, 36, 39, 41, 45, 46, 46, 47, 49, 51, 51, 52, 52, 55, 64, 68, 69, 71, 72, 74, 74, 74, 87, 87, 89, 90, 93, 96, 96, 98, 99], [3, 16, 17, 19, 19, 25, 25, 31, 32, 33, 35, 36, 39, 42, 42, 44, 45, 46, 59, 61, 62, 63, 64, 65, 65, 66, 67, 68, 68, 69, 70, 73, 75, 76, 76, 78, 86, 88, 88, 88, 89, 91, 93, 95, 98, 99, 99], [1, 5, 6, 8, 13, 14, 14, 14, 15, 16, 16, 19, 19, 19, 20, 22, 24, 24, 25, 30, 34, 35, 36, 37, 38, 38, 39, 42, 44, 46, 49, 52, 56, 57, 58, 62, 77, 78, 82, 85, 85, 86, 87, 93, 95, 98, 99], [4, 4, 5, 5, 7, 11, 12, 12, 14, 20, 21, 25, 26, 26, 28, 30, 31, 33, 34, 36, 37, 43, 44, 45, 49, 51, 53, 56, 57, 59, 62, 62, 63, 63, 66, 66, 66, 72, 78, 79, 84, 85, 88, 92, 94, 97, 98]], [[94, -54, 58, 36, -2, 56, -90, -44, -18, 68, 26, -60, 60, 52, -30, 8, 98, -80, -88, -30, -92, -34, -68, -74, -86, -4, -72, -84, 24, 50, -70, 72, 60, 86, -48, 38, 16, 42], [30, 8, -64, 92, -28, 92, -28, -54, 74, 16, 60, 58, 60, 6, -30, 88, 66, -80, 86, -70, -30, -74, 42, -10, 54, -36, -18, 70, 38, -58, 50, 68, 22, 26, 24, 46, 56, -78], [-74, 78, 46, -10, 50, 88, 82, -2, 90, 54, 36, 22, 96, -50, 38, 86, -90, 36, -6, 54, -72, 42, -54, 98, -74, -70, 0, -14, -94, 20, -8, -22, -98, -90, 64, 14, 42, -28], [-96, 62, 54, -98, -80, 32, -92, -18, -90, 88, 50, -98, -24, -32, 46, 66, -10, 34, 52, 24, 0, 82, -92, 34, -40, -10, 78, -20, -96, 46, -56, 48, -58, 24, 28, -34, 66, -80], [-86, -24, -84, 80, 84, -36, 56, -28, -88, 36, 68, 20, 16, -86, -24, 88, -88, -28, -56, 44, 14, -66, 90, -64, 14, 6, 82, 20, 36, 66, -50, 52, -20, -40, -76, 26, -12, -50], [-18, -78, -46, 46, 58, 78, 46, 54, 46, 56, -80, 70, 42, 78, -96, -76, -78, 38, -8, 14, 28, -42, 52, 72, 42, -96, 16, 96, -8, 40, -42, -40, 84, 38, -28, -38, -34, -98], [-62, 62, 86, -84, -20, 24, -98, 46, 84, 20, -92, -20, -28, -38, 44, 12, 48, 34, 46, -80, -38, -36, 96, 96, 64, -72, -92, 96, 98, -84, 4, 74, 14, -20, 66, -14, -22, 72], [16, -60, 68, 44, 82, 38, -70, 86, -22, 72, -10, 48, 52, 66, 74, 74, -50, 94, -32, -98, -76, 14, -16, -98, -52, -74, 10, -98, 60, 94, 82, 32, -56, -44, -84, -62, 70, -90], [28, 80, -60, -88, -4, 68, -36, 2, -28, -6, 16, 20, 0, 84, 50, 6, -72, -68, 14, -80, -82, -26, -16, -40, 22, -18, 24, -90, -6, -42, -80, -54, 62, -54, -66, 32, -34, -24], [-60, -26, -18, 80, -84, -24, -12, 78, -8, 22, 68, 62, -10, 40, 96, 30, -38, 46, -84, -84, 4, -34, 8, -18, -32, -68, 98, 6, -44, 50, 62, -56, 20, -18, -40, -54, -56, 56], [8, 16, 82, -82, -64, -10, -96, -56, 18, 24, 46, 86, 48, 36, 66, 84, 4, 18, -74, 68, 24, -94, 68, 54, 44, -80, 88, -48, -72, 16, -90, 80, -72, -82, -34, 74, 38, -92], [64, -88, -44, -88, 2, 26, -34, -82, -14, 96, 34, 94, 2, -64, 38, -90, -44, 62, 40, -62, 14, -56, 4, -42, -32, 62, -36, -78, 58, -86, 74, 4, -50, -26, 22, -16, 58, 84], [80, -2, -40, -32, -42, -58, -96, 58, -54, 22, 34, -84, -20, 84, 76, 98, 18, -44, 2, 14, 10, -26, 92, 0, 32, -54, 24, 78, -86, 48, 0, 24, -20, -54, 32, -44, -78, -28], [56, 40, 66, -26, 48, 30, -72, 60, -38, 34, -40, 42, -16, 24, -54, -44, 70, -62, -2, 12, -62, 78, 22, 56, 32, 12, 2, -48, 24, 74, -42, 48, 62, 90, 74, -84, 74, 8], [20, -58, -40, -92, 10, 26, 12, -66, 76, 96, 50, -42, 26, 68, 50, -90, 86, 78, -10, 38, 48, -62, 30, 40, -66, 86, -74, 12, -20, 46, 24, -98, -62, 56, -40, -46, -60, 30], [44, 62, -48, -78, -32, 90, -14, -74, 98, -50, 10, -54, -96, -14, -76, 40, 16, -44, 24, -70, -84, 96, 62, 64, 56, 60, 30, -70, -32, 14, -92, 66, -94, 94, 24, 74, -62, -54], [54, 44, -8, -36, -68, -80, 76, -58, -4, -64, 4, 96, 26, -10, -28, 20, -12, -62, -64, -38, -74, -24, -46, 26, -88, 46, -34, -2, 0, -10, 58, -76, -16, -50, 84, -88, -94, 34], [-72, 80, -96, 26, 32, -68, -2, 88, -98, 10, 96, 2, -50, 50, -2, 76, -24, 6, 50, 50, -24, -46, 10, 74, -70, -90, 82, 56, 16, -24, 66, 80, 96, 90, -80, -66, 48, -36], [38, 22, 88, 14, -54, 36, -86, 80, 2, 54, 34, 84, -96, -84, 38, 26, 96, -14, 60, 46, 26, 74, -8, -78, -6, -24, 4, 34, -80, 14, 62, 28, -56, -62, 32, -96, 14, -32], [-60, 80, 98, 54, -68, -16, -92, 48, -66, -42, -94, -24, -28, -84, -78, 74, 34, -14, -92, 78, 26, -52, -78, 88, -84, 94, -20, -34, 6, 64, 40, -44, -44, -88, 54, -16, 28, 24], [-76, -26, -80, -72, 76, 88, 36, 66, 12, 28, 64, 8, -92, 42, 52, -14, -44, -96, 20, -6, 26, -64, 34, 0, 12, 16, 64, -68, -86, 94, -80, -22, -8, 60, -32, -76, -66, 44], [-46, 58, -78, -62, 60, -54, -34, 88, 76, 4, 32, 32, -4, -76, -32, -20, 90, -78, -64, 44, 42, 38, -66, -46, 36, -96, -42, 58, -24, -36, -34, -64, 30, 40, 26, -32, -42, 20], [-52, -82, -76, -94, -82, -94, -46, -46, 40, 58, -96, 86, -18, -2, -36, -74, -78, 88, 86, 24, -6, 44, -30, -96, 78, -62, -64, -72, 66, -28, 68, 96, -24, 24, -98, 26, 26, -6], [88, 90, 0, 38, 52, -50, -94, -50, -64, -66, 40, 82, -64, -40, 72, -50, 86, 92, 48, -72, -12, 6, 42, 70, -80, 86, -6, -76, -64, -56, 80, -14, 70, -58, 96, -36, 84, -76], [-22, -40, 4, 66, -4, 10, 0, 18, -16, -78, -18, 10, 52, -20, 74, 4, 34, -80, 62, -92, -58, 24, -44, -52, 20, 6, 70, 90, 88, 40, 60, 42, -44, 42, -18, 30, -22, 48], [30, 86, -78, -22, 52, 90, -74, -68, 50, -14, -78, 30, 84, -60, -24, 40, -80, -56, 40, 34, 42, -16, -50, -18, -78, 14, 40, 52, -86, 24, 88, -62, -94, 16, 96, 86, -56, 74], [-38, 42, -42, 78, 26, 48, 86, -68, 2, -54, -50, 2, 46, -54, -46, 74, 48, -66, 20, -32, -20, 72, -36, 96, 98, 24, -70, 66, -72, -68, 76, 68, -82, 68, 60, -76, -92, 42], [-12, -14, 42, -96, 14, 52, 6, -18, 62, 58, 16, 2, 34, 28, 20, -72, -66, 82, -80, -92, -12, -4, -94, 30, 68, 64, 96, -54, 66, -30, -22, -60, -32, 32, 52, 2, 90, -26], [-70, 78, 24, -34, -20, -14, 54, 24, -48, 48, -2, -96, 92, -8, 60, -4, -40, 30, 4, 64, -32, -58, -96, -34, -24, -80, -12, 38, -4, -26, -82, 30, 6, -96, 50, -56, 10, -12], [36, -42, -50, 36, -60, -18, -12, 28, -56, 26, -64, 56, 44, 90, 66, -24, -32, 10, -48, -82, -8, 6, -64, -98, 88, 84, -8, -54, -36, -76, -60, -70, -54, -96, 10, 54, -76, 4], [94, 22, -86, -60, 88, 26, 12, 10, -96, 66, -48, 42, -40, -60, -70, -36, -70, -78, 20, -96, -58, -46, -84, -28, 64, -58, 94, 64, -16, 74, 34, 22, 0, -86, -64, -6, -2, 26], [56, -78, -34, 4, -66, 4, 12, -8, 46, 94, 50, 76, -82, 0, 32, 70, 70, -16, 66, 20, -22, 84, 8, 88, -84, 36, 22, 68, 76, -2, 62, 66, -52, 90, -34, -12, -12, 46], [-98, -50, 60, -96, 44, 84, 4, -12, -4, -80, -12, -42, 76, -62, 66, -14, 50, 84, -48, 72, 88, 20, 72, 96, 90, 46, 90, -40, 32, -90, 84, -34, -92, -18, -58, 18, 26, -42], [-2, -22, 54, 68, 52, -18, -42, -90, -58, -48, -66, -94, 6, -56, -4, 88, 22, -58, -6, -80, 48, -16, 78, -96, -6, -66, 24, -92, -40, -62, -90, -92, -66, -40, 8, -32, 6, -50], [94, -2, 10, -30, 8, -30, -84, -12, -22, -2, -26, -60, -60, 22, -38, 82, 18, 50, 78, -48, 0, 52, -78, 66, 10, 26, 68, -48, -44, 20, 64, 78, 80, 76, -44, -52, -48, 18], [34, 16, 58, 44, -46, 90, -76, -78, 16, 80, -32, 62, -54, -14, 76, -22, 2, 36, 68, 28, 52, -74, 84, 22, 84, -30, -60, 66, 92, -86, -40, 74, -60, -14, 58, -52, 36, 78], [-84, -92, 34, 24, 76, 90, 44, 22, 18, -84, 90, 62, 82, -22, 18, -42, 12, -14, -86, -78, -24, -30, 92, 20, 32, 54, -24, 26, 24, -80, -84, 76, 44, 74, 56, 56, 40, -58], [-40, 96, 20, 48, 4, -74, 72, 58, 62, -10, 22, 36, -82, 4, -12, -92, 2, -80, -54, 50, -64, 36, -40, -82, -2, -18, 8, -18, -52, 94, -30, 66, -42, -62, -72, 44, 12, 54]], [[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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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]], [[88, 92, 80, 80, 15, 85, 46, 62, 7, 8, 47, 50, 1, 6, 55, 63, 19, 14, 52, 10, 56, 26, 80, 55, 22, 99, 23, 36], [38, 72, 34, 22, 11, 19, 4, 66, 32, 79, 66, 90, 70, 34, 45, 84, 88, 37, 81, 6, 46, 45, 94, 95, 55, 44, 75, 36], [41, 26, 10, 97, 4, 30, 79, 82, 98, 41, 93, 36, 60, 37, 36, 56, 26, 72, 70, 25, 82, 2, 64, 89, 83, 38, 80, 47], [56, 31, 40, 37, 97, 27, 41, 60, 7, 75, 84, 5, 96, 49, 71, 63, 40, 21, 47, 2, 47, 1, 31, 63, 27, 12, 89, 41], [84, 79, 99, 26, 28, 96, 42, 61, 17, 78, 75, 40, 95, 45, 16, 93, 64, 3, 76, 15, 2, 26, 27, 71, 89, 47, 78, 91], [25, 94, 20, 71, 77, 11, 76, 16, 98, 26, 53, 36, 83, 79, 23, 25, 55, 40, 82, 34, 3, 92, 34, 61, 70, 37, 95, 61], [14, 55, 54, 38, 63, 31, 54, 36, 9, 1, 46, 80, 54, 19, 62, 54, 26, 66, 79, 18, 27, 30, 1, 39, 85, 68, 16, 32], [64, 96, 46, 25, 90, 24, 80, 45, 52, 11, 39, 89, 17, 83, 96, 89, 70, 30, 43, 41, 53, 74, 55, 19, 55, 35, 5, 75], [66, 99, 36, 49, 5, 1, 26, 37, 7, 82, 75, 83, 8, 99, 6, 49, 86, 72, 41, 20, 78, 58, 2, 56, 8, 20, 99, 62], [74, 59, 71, 97, 95, 8, 71, 12, 90, 23, 74, 42, 6, 61, 58, 16, 98, 37, 8, 29, 84, 59, 96, 87, 2, 12, 37, 59], [41, 65, 76, 35, 52, 81, 4, 50, 72, 59, 42, 59, 21, 47, 20, 28, 85, 61, 35, 44, 98, 28, 49, 13, 35, 9, 15, 32], [42, 78, 59, 33, 14, 7, 83, 6, 52, 69, 69, 68, 71, 10, 56, 67, 55, 67, 67, 71, 53, 10, 97, 65, 30, 53, 6, 62], [43, 75, 45, 42, 7, 19, 80, 69, 77, 20, 28, 47, 23, 54, 45, 22, 83, 89, 72, 8, 54, 79, 46, 23, 36, 29, 62, 17], [80, 83, 73, 86, 10, 71, 53, 83, 28, 8, 54, 20, 9, 63, 27, 95, 18, 17, 20, 9, 45, 18, 85, 38, 23, 5, 45, 77], [20, 4, 82, 22, 95, 45, 38, 39, 32, 29, 71, 82, 94, 39, 83, 1, 87, 52, 2, 98, 38, 44, 77, 17, 5, 62, 66, 85], [49, 82, 28, 41, 68, 56, 38, 17, 49, 92, 20, 88, 68, 51, 53, 20, 18, 61, 61, 15, 22, 62, 40, 16, 96, 81, 11, 48], [14, 7, 17, 46, 72, 54, 59, 23, 17, 87, 93, 57, 30, 88, 50, 96, 47, 60, 43, 60, 38, 15, 31, 24, 70, 19, 71, 6], [35, 3, 6, 22, 21, 79, 81, 63, 9, 13, 93, 24, 37, 94, 66, 30, 17, 31, 30, 78, 26, 58, 50, 28, 94, 22, 59, 76], [15, 24, 7, 76, 50, 31, 9, 81, 3, 2, 32, 52, 24, 42, 27, 99, 25, 35, 98, 85, 8, 36, 16, 17, 44, 54, 8, 21], [2, 62, 26, 20, 54, 50, 32, 5, 68, 90, 11, 7, 99, 16, 19, 75, 18, 22, 78, 71, 35, 72, 81, 32, 99, 97, 59, 32], [30, 2, 93, 99, 99, 93, 57, 9, 20, 54, 54, 72, 67, 7, 10, 39, 16, 50, 58, 1, 23, 36, 93, 73, 91, 40, 76, 35], [26, 85, 67, 49, 9, 35, 41, 92, 61, 31, 54, 10, 90, 73, 29, 74, 23, 88, 18, 86, 42, 77, 74, 46, 43, 5, 75, 58], [99, 45, 58, 32, 65, 47, 77, 6, 14, 51, 67, 70, 64, 96, 61, 75, 91, 39, 65, 50, 27, 88, 84, 91, 71, 78, 87, 75], [57, 46, 59, 33, 9, 79, 36, 94, 15, 81, 56, 58, 84, 46, 61, 92, 66, 32, 73, 90, 42, 86, 39, 45, 47, 79, 99, 92], [9, 62, 49, 98, 19, 10, 50, 41, 99, 12, 22, 61, 32, 75, 46, 83, 57, 98, 92, 86, 65, 38, 23, 39, 26, 45, 68, 12], [86, 39, 13, 21, 41, 90, 64, 53, 81, 25, 76, 15, 18, 69, 9, 16, 51, 1, 70, 11, 90, 65, 46, 62, 7, 24, 98, 63], [30, 1, 38, 95, 83, 32, 71, 46, 6, 66, 81, 74, 29, 82, 54, 86, 90, 6, 62, 13, 30, 55, 77, 72, 29, 4, 92, 96], [72, 71, 55, 66, 3, 83, 41, 61, 7, 75, 30, 85, 59, 18, 27, 94, 41, 15, 42, 99, 54, 93, 24, 70, 35, 71, 80, 55]], [[-84, -66, 26, 44, 52], [-92, 2, 12, 30, 36], [-82, -62, 30, 46, 82], [-10, 36, 66, 68, 96], [4, 14, 38, 64, 68]], [[0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0], [0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1], [1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1], [0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0], [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0], [0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0], [0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0], [0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0], [0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1], [0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1], [0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1], [0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1], [1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1], [1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1], [1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0], [1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1], [1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0], [0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1]], [[2, 8, 11, 12, 12, 15, 17, 24, 26, 32, 38, 39, 41, 44, 45, 48, 52, 55, 56, 57, 59, 62, 63, 71, 72, 77, 81, 82, 83, 85, 89, 92, 92, 92], [11, 11, 12, 14, 21, 25, 35, 41, 42, 43, 49, 50, 51, 52, 55, 55, 55, 55, 55, 56, 60, 64, 70, 70, 71, 73, 78, 78, 78, 82, 86, 90, 93, 98], [1, 2, 9, 9, 16, 19, 19, 20, 21, 23, 28, 29, 30, 35, 35, 42, 51, 53, 54, 58, 60, 64, 66, 70, 73, 74, 77, 79, 81, 88, 94, 95, 97, 97], [2, 7, 8, 13, 15, 23, 29, 40, 43, 49, 51, 51, 52, 60, 61, 62, 63, 64, 64, 65, 69, 72, 76, 78, 81, 84, 87, 87, 88, 89, 95, 95, 95, 99], [3, 3, 7, 8, 9, 17, 17, 18, 18, 23, 23, 36, 40, 45, 47, 50, 52, 53, 54, 58, 60, 60, 75, 76, 77, 77, 83, 83, 87, 88, 88, 91, 93, 97], [7, 8, 9, 11, 12, 35, 36, 39, 39, 47, 51, 52, 55, 55, 59, 61, 62, 65, 65, 66, 67, 69, 73, 73, 80, 81, 81, 85, 87, 89, 89, 93, 99, 99], [1, 2, 2, 4, 4, 7, 13, 16, 18, 21, 22, 23, 26, 27, 35, 37, 37, 41, 44, 45, 51, 51, 54, 56, 57, 59, 66, 71, 78, 78, 79, 82, 83, 95], [5, 5, 6, 8, 10, 10, 13, 18, 19, 22, 30, 33, 36, 43, 44, 48, 49, 59, 60, 63, 66, 67, 72, 72, 75, 77, 79, 81, 81, 84, 85, 90, 91, 92], [7, 7, 15, 17, 19, 20, 20, 23, 25, 26, 33, 36, 38, 38, 44, 46, 48, 49, 59, 60, 63, 64, 68, 68, 74, 74, 76, 79, 79, 90, 91, 93, 96, 98], [3, 4, 8, 17, 19, 29, 30, 35, 37, 39, 40, 45, 45, 51, 57, 57, 58, 62, 63, 63, 69, 71, 77, 78, 79, 81, 83, 84, 91, 94, 94, 95, 97, 97], [5, 10, 13, 13, 15, 20, 21, 26, 28, 35, 39, 40, 42, 44, 47, 48, 48, 49, 55, 56, 60, 61, 67, 75, 76, 78, 79, 82, 84, 84, 85, 87, 90, 91], [1, 3, 7, 13, 16, 19, 23, 25, 28, 28, 29, 30, 34, 40, 41, 44, 45, 47, 49, 50, 57, 60, 66, 66, 78, 78, 79, 79, 81, 83, 84, 85, 95, 99], [8, 10, 14, 15, 15, 15, 16, 19, 21, 21, 21, 22, 26, 29, 30, 31, 44, 44, 47, 58, 62, 63, 68, 76, 78, 78, 81, 84, 86, 90, 90, 91, 96, 98], [2, 4, 10, 14, 15, 15, 28, 31, 33, 36, 36, 42, 44, 46, 49, 49, 50, 51, 55, 57, 57, 60, 62, 65, 69, 72, 81, 82, 86, 89, 91, 95, 97, 97], [1, 2, 6, 7, 16, 24, 24, 24, 28, 30, 41, 46, 47, 47, 49, 49, 50, 60, 61, 64, 66, 66, 67, 70, 70, 74, 75, 78, 80, 81, 83, 90, 91, 97], [3, 10, 16, 18, 22, 22, 22, 24, 33, 34, 39, 40, 46, 47, 49, 51, 52, 59, 60, 61, 62, 62, 64, 65, 68, 72, 73, 79, 80, 84, 86, 87, 92, 95], [9, 11, 12, 16, 22, 25, 25, 29, 32, 34, 39, 39, 39, 39, 41, 42, 48, 49, 52, 55, 58, 62, 69, 69, 76, 82, 82, 84, 86, 87, 90, 91, 92, 97], [2, 4, 6, 8, 8, 9, 15, 17, 20, 20, 22, 26, 27, 29, 29, 32, 32, 34, 35, 36, 37, 38, 40, 40, 52, 56, 64, 64, 70, 71, 73, 88, 88, 94], [1, 7, 11, 12, 12, 13, 14, 15, 20, 25, 29, 32, 34, 38, 41, 43, 50, 57, 59, 64, 65, 69, 71, 72, 74, 77, 78, 82, 84, 85, 91, 91, 92, 96], [2, 2, 4, 6, 11, 14, 17, 20, 21, 21, 29, 30, 31, 32, 34, 39, 40, 40, 48, 50, 50, 55, 57, 64, 66, 72, 74, 79, 79, 84, 86, 88, 93, 99], [1, 2, 2, 10, 16, 25, 26, 26, 29, 29, 31, 33, 34, 36, 41, 42, 44, 47, 53, 53, 54, 59, 61, 62, 70, 72, 73, 75, 78, 79, 82, 84, 87, 99], [9, 9, 11, 13, 20, 23, 25, 30, 31, 37, 37, 39, 42, 43, 45, 48, 50, 55, 56, 58, 65, 66, 72, 75, 82, 82, 88, 88, 89, 91, 91, 93, 94, 96], [1, 5, 5, 8, 9, 13, 15, 17, 18, 21, 21, 24, 25, 27, 34, 43, 44, 45, 46, 50, 54, 55, 60, 67, 68, 71, 76, 78, 81, 82, 84, 87, 97, 99], [1, 3, 3, 5, 14, 23, 23, 25, 28, 29, 32, 36, 40, 41, 43, 49, 50, 53, 53, 53, 54, 64, 72, 76, 78, 80, 81, 81, 87, 87, 87, 91, 93, 94], [2, 10, 10, 12, 13, 15, 15, 16, 17, 21, 23, 27, 28, 32, 37, 37, 41, 43, 45, 46, 48, 51, 52, 56, 57, 69, 70, 74, 78, 80, 83, 86, 89, 95], [4, 4, 7, 7, 8, 10, 11, 14, 14, 17, 19, 26, 30, 36, 40, 51, 60, 62, 68, 69, 71, 73, 74, 80, 80, 82, 84, 85, 86, 86, 86, 88, 92, 97], [2, 3, 6, 8, 10, 11, 11, 13, 16, 18, 19, 21, 23, 23, 26, 27, 28, 35, 37, 37, 42, 50, 53, 54, 55, 58, 61, 68, 73, 81, 85, 86, 97, 99], [6, 7, 14, 17, 19, 20, 21, 22, 23, 24, 26, 30, 32, 36, 37, 38, 39, 42, 45, 57, 61, 66, 67, 67, 69, 81, 84, 84, 85, 90, 94, 95, 97, 99], [1, 2, 9, 10, 12, 13, 13, 13, 14, 15, 16, 16, 16, 17, 21, 27, 27, 33, 35, 35, 36, 41, 44, 46, 46, 47, 48, 51, 61, 66, 73, 76, 93, 95], [1, 6, 8, 14, 14, 19, 22, 25, 30, 36, 40, 45, 52, 61, 63, 67, 68, 70, 70, 73, 73, 75, 75, 77, 79, 81, 85, 86, 89, 90, 93, 94, 96, 97], [12, 14, 18, 22, 24, 25, 26, 26, 27, 29, 32, 34, 38, 38, 40, 54, 55, 56, 58, 60, 70, 74, 76, 77, 78, 78, 81, 83, 84, 84, 86, 91, 95, 98], [2, 4, 9, 17, 23, 24, 33, 36, 36, 37, 37, 39, 43, 43, 44, 51, 52, 56, 58, 59, 60, 64, 65, 68, 68, 69, 77, 78, 78, 79, 88, 94, 98, 99], [2, 2, 5, 5, 6, 13, 17, 19, 19, 23, 33, 36, 45, 45, 46, 51, 53, 62, 66, 69, 74, 77, 77, 78, 78, 79, 81, 86, 87, 93, 94, 96, 96, 99], [2, 5, 5, 6, 7, 10, 11, 15, 16, 29, 30, 31, 31, 36, 37, 41, 41, 48, 49, 49, 52, 53, 55, 56, 60, 61, 63, 81, 84, 92, 95, 97, 98, 99]], [[-12, 46, -32, -10, 74, 98, -60, -54, 8, 90, 78, 84, -42, -36, -4, -72], [-10, -52, -22, 84, -28, -90, -82, 88, 4, 76, 22, 26, -38, 6, 94, 10], [52, 0, 52, -34, -52, -40, 30, 62, 64, -66, -22, -34, 46, -86, 82, 58], [-38, -36, -84, 72, -88, 42, 66, -60, -4, 86, -42, 30, 36, -98, -44, 58], [-34, 16, -36, 80, 26, 60, 94, 48, 16, -10, 4, 68, -20, -76, 84, -76], [-22, 86, -98, -82, 78, 82, 48, 26, 0, -30, 54, -92, 64, 68, 78, 50], [-58, 66, -14, -42, -38, -86, -70, -14, -54, 44, 82, 54, -92, -58, -64, 32], [18, 50, 6, -22, 36, 12, 12, 20, -6, -68, 82, 38, -8, -4, -22, 16], [-16, 90, -94, -62, 26, 32, -70, 26, -8, -90, 64, -80, 42, -10, -22, 82], [-94, 54, 28, 38, 86, -50, -96, 10, 48, 16, 46, 4, -78, -54, 4, -28], [64, 56, 0, -58, -22, 62, 96, -20, 0, -26, 16, -90, -84, 8, 80, 60], [38, 98, -18, -74, -24, -94, 34, -68, -68, 72, -74, 60, 62, 76, 86, 86], [-58, -40, -70, 90, 94, -66, -52, 54, -46, -80, 32, -40, -20, 50, 48, -96], [74, 2, -22, -28, 42, -44, -58, 36, -60, 26, -86, -74, 26, -96, -14, -60], [-90, 8, -72, 52, -94, 22, 90, -42, -22, -68, -86, -10, -12, -60, 12, 42], [26, -18, -68, -30, 18, 68, 98, 76, -2, 28, 4, -16, -92, 82, -94, -58]], [[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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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]], [[39, 26, 40, 73, 91, 43, 76, 46, 5, 71, 28, 22, 71, 56, 55, 25, 59, 76, 19, 83, 62, 32, 63, 92, 44, 70, 86, 77, 33, 66, 58, 84, 91, 32, 47, 71, 71, 32, 62, 62, 60, 17, 12, 38, 15], [2, 23, 60, 30, 49, 2, 6, 37, 52, 78, 18, 59, 66, 91, 78, 84, 96, 74, 10, 49, 95, 52, 40, 92, 47, 71, 31, 16, 59, 44, 28, 34, 40, 89, 30, 84, 40, 58, 51, 59, 20, 45, 86, 19, 48], [49, 19, 56, 96, 95, 28, 79, 26, 61, 56, 51, 1, 51, 55, 48, 30, 12, 75, 74, 3, 80, 56, 57, 69, 99, 60, 2, 44, 82, 34, 39, 91, 70, 27, 55, 59, 19, 78, 86, 16, 15, 72, 55, 36, 74], [59, 23, 88, 66, 35, 26, 35, 21, 28, 1, 94, 53, 11, 98, 75, 20, 73, 36, 97, 71, 59, 53, 98, 41, 48, 29, 33, 83, 79, 44, 60, 47, 50, 16, 70, 95, 34, 52, 18, 58, 45, 94, 15, 79, 10], [19, 63, 40, 53, 26, 74, 28, 90, 96, 56, 72, 39, 39, 48, 42, 32, 46, 88, 2, 75, 9, 5, 92, 91, 89, 1, 83, 23, 51, 12, 92, 84, 10, 20, 3, 90, 34, 49, 74, 43, 55, 15, 76, 45, 58], [59, 70, 73, 46, 39, 54, 85, 4, 75, 95, 12, 61, 88, 43, 91, 75, 4, 89, 41, 73, 30, 37, 4, 75, 63, 41, 68, 7, 93, 67, 84, 54, 43, 7, 97, 17, 93, 95, 96, 41, 64, 46, 31, 72, 24], [78, 44, 67, 42, 78, 24, 45, 68, 31, 27, 87, 33, 78, 49, 64, 5, 89, 31, 84, 42, 86, 54, 10, 75, 9, 59, 8, 93, 26, 16, 62, 73, 20, 14, 70, 83, 50, 92, 77, 37, 55, 45, 84, 55, 94], [59, 6, 36, 64, 29, 50, 28, 15, 62, 47, 88, 9, 97, 95, 29, 46, 75, 15, 9, 91, 59, 29, 99, 73, 47, 25, 15, 52, 47, 57, 40, 28, " FREQUENT_ELEMENT_ARRAY,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int max_count = 1 , res = arr [ 0 ] ; int curr_count = 1 ; for ( int i = 1 ; i < n ; i ++ ) { if ( arr [ i ] == arr [ i - 1 ] ) curr_count ++ ; else { if ( curr_count > max_count ) { max_count = curr_count ; res = arr [ i - 1 ] ; } curr_count = 1 ; } } if ( curr_count > max_count ) { max_count = curr_count ; res = arr [ n - 1 ] ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [51, 96, 0, 31, -52, 0, 9, -42, 0, 4]; int [] [] param0 = [[1, 1, 3, 11, 11, 11, 18, 20, 26, 26, 27, 30, 33, 39, 39, 42, 42, 48, 51, 51, 51, 51, 60, 66, 66, 68, 68, 69, 71, 72, 73, 76, 76, 77, 77, 77, 78, 90, 96], [-74, -46, -38, -32, -22, -18, -14, -8, -4, 14, 30, 36, 42, 46, 48, 64, 66, 72, 80, 92, 94, 96, 96], [0, 0, 0, 0, 0, 0, 1], [3, 21, 23, 31, 31, 32, 45, 49, 52, 55, 56, 58, 67, 70, 71, 80, 87, 93, 96, 97], [-98, -96, -84, -82, -72, -64, -62, -56, -52, -52, -48, -46, -42, -36, -32, -30, -30, -18, -16, -10, -2, 0, 6, 18, 22, 22, 40, 42, 50, 54, 64, 68, 68, 72, 80, 82, 84, 96], [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], [9, 12, 13, 28, 43, 46, 64, 66, 68, 89, 92], [-94, -88, -82, -80, -72, -60, -56, -52, -46, -42, -42, -40, -40, -32, -32, -26, -24, -22, -22, -12, -12, -8, 4, 6, 18, 18, 22, 22, 32, 36, 36, 38, 40, 46, 48, 50, 54, 68, 76, 78, 80, 86, 86, 90, 92, 92, 94, 96], [0, 0, 0, 0, 0, 0, 1, 1, 1], [2, 4, 4, 5, 9, 16, 25, 29, 31, 32, 40, 41, 41, 43, 54, 61, 62, 63, 64, 65, 74, 74, 76, 80, 81, 81, 85, 86, 95, 96, 97, 97]]; int [] param1 = [39, 23, 7, 20, 38, 41, 11, 48, 9, 32]; 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_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int res = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int curr_sum = 0 ; for ( int j = 0 ; j < n ; j ++ ) { int index = ( i + j ) % n ; curr_sum += j * arr [ index ] ; } res = Math . max ( res , curr_sum ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3035, 592, 392, 10714, 7026, 19, 5149, 4226, 46, 16847]; int [] [] param0 = [[11, 12, 16, 26, 29, 40, 54, 59, 65, 70, 71, 73, 78, 81, 87, 87, 88, 90, 95, 97], [-46, -32, 54, 96, -72, -58, -36, -44, 26, -2, -68, 42, 90, 26, -92, -96, 88, -42, -18, 46, -70, 24, 0, 24, 34, 34, -52, 50, 94, -60, 64, 58], [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], [48, 2, 79, 98, 28, 17, 41, 47, 61, 76, 82, 5, 74, 4, 80, 51, 22, 45, 91, 75, 91, 93, 42, 45, 69, 98, 76, 74, 83, 17, 30, 88, 53, 25, 35, 19, 26], [-88, -84, -82, -74, -44, -34, -32, -20, -20, -14, 6, 6, 10, 12, 16, 24, 32, 34, 38, 46, 54, 54, 56, 60, 82, 88, 90, 94, 98], [0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1], [10, 14, 14, 14, 19, 20, 22, 26, 35, 36, 40, 53, 54, 55, 55, 57, 57, 67, 72, 72, 77, 78, 83, 84, 95, 96], [-80, 18, -76, 48, -52, -38, 52, -82, 40, -44, -90, 86, -86, -36, -32, -2, 56, -12, -88, 14, -16, 8, 52, 24, 46, 56, 84, -36, 84, -60, 72, -46, 32, -16, -20, 68, -86, -62, 58, 8, 78, -52, 22, -28, -22, -42, 12, -48], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [20, 94, 36, 2, 50, 62, 84, 50, 66, 75, 1, 18, 41, 48, 72, 61, 86, 22, 54, 6, 71, 46, 92, 68, 59, 51, 89, 31, 58, 78, 82, 84]]; int [] param1 = [11, 22, 33, 20, 24, 7, 16, 30, 14, 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); } " HEXAGONAL_NUMBER,"static int f_filled ( int n ) { return n * ( 2 * n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2850, 3828, 6670, 190, 1891, 5565, 17578, 8128, 10011, 6903]; int [] param0 = [38, 44, 58, 10, 31, 53, 94, 64, 71, 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); } " MINIMUM_ROTATIONS_REQUIRED_GET_STRING,"static int f_filled ( String str ) { String tmp = str + str ; int n = str . length ( ) ; for ( int i = 1 ; i <= n ; i ++ ) { String substring = tmp . substring ( i , i + str . length ( ) ) ; if (str.equals(substring)) return i ; } return n ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [14, 2, 12, 13, 2, 3, 5, 1, 1, 2]; string [] param0 = [""vdevdndqsopptj"", ""ababab"", ""100010101011"", ""tldovjhaymllu"", ""06"", ""101"", ""dygtu"", ""4"", ""00"", ""dt""]; 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_FOR_FACTORIAL_OF_A_NUMBER,"static int f_filled ( int n ) { if ( n==1 || n == 0 ) return 1 ; return n * f_filled ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [362880, 120, 24, 479001600, 2, 5040, 3628800, 6, 2, 720]; int [] param0 = [9, 5, 4, 12, 2, 7, 10, 3, 2, 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); } " PRINT_MAXIMUM_SHORTEST_DISTANCE,"static int f_filled ( int a [ ] , int n , int k ) { HashMap < Integer , Integer > b = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { int x = a [ i ] ; int d = Math . min ( 1 + i , n - i ) ; if ( ! b . containsKey ( x ) ) b . put ( x , d ) ; else { b . put ( x , Math . min ( d , b . get ( x ) ) ) ; } } int ans = Integer . MAX_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int x = a [ i ] ; if ( x != k - x && b . containsKey ( k - x ) ) ans = Math . min ( Math . max ( b . get ( x ) , b . get ( k - x ) ) , ans ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 1000000000, 4, 1000000000, 1000000000]; int [] [] param0 = [[2, 27, 66, 89, 96, 96], [84, -38, -56, -20, -98, -40, -16, 22, 20, 98, -56, -32, -44, 30, -58, 26, -44, -32, 50, 46, 92], [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], [20, 71, 66, 58, 74, 2, 63, 13, 1, 36, 28, 83, 24, 20, 85, 30, 59, 56, 8, 97, 58, 28, 28, 42], [-94, -88, -86, -68, -66, -64, -28, -12, 4, 18, 22, 28, 32, 34, 34, 40, 44, 46, 60, 68, 72, 78, 80, 84, 88, 96], [0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1], [8, 13, 54, 59, 61, 69, 89, 90, 92], [-58, 50, -74, -8, -50, 90, 90, -2, -22, 8, -76, 16, 4, 56, 94, 36, 28, -42, 80, -88, 88, 52, 74, 40, 12, -72, -50, 50, 88, -54, 32, -24, -48, -66, -86, 40, -6, 14, 10, -88, 56, 80, -34], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [2, 60, 66, 39, 18, 60, 37, 75, 3, 64, 24, 16, 72, 95, 96, 44, 23, 58, 58, 33, 24, 96]]; int [] param1 = [4, 13, 23, 23, 16, 8, 4, 27, 9, 21]; int [] param2 = [4, 11, 13, 17, 15, 13, 8, 42, 12, 17]; 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); } " GOLD_MINE_PROBLEM,"static int f_filled ( int gold [ ] [ ] , int m , int n ) { int goldTable [ ] [ ] = new int [ m ] [ n ] ; for ( int [ ] rows : goldTable ) Arrays . fill ( rows , 0 ) ; for ( int col = n - 1 ; col >= 0 ; col -- ) { for ( int row = 0 ; row < m ; row ++ ) { int right = ( col == n - 1 ) ? 0 : goldTable [ row ] [ col + 1 ] ; int right_up = ( row == 0 || col == n - 1 ) ? 0 : goldTable [ row - 1 ] [ col + 1 ] ; int right_down = ( row == m - 1 || col == n - 1 ) ? 0 : goldTable [ row + 1 ] [ col + 1 ] ; goldTable [ row ] [ col ] = gold [ row ] [ col ] + Math . max ( right , Math . max ( right_up , right_down ) ) ; ; } } int res = goldTable [ 0 ] [ 0 ] ; for ( int i = 1 ; i < m ; i ++ ) res = Math . max ( res , goldTable [ i ] [ 0 ] ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1221, 238, 21, 45, 888, 17, 210, 2412, 15, 2346]; int [] [] [] param0 = [[[19, 20, 23, 25, 28, 35, 35, 40, 45, 46, 48, 54, 57, 59, 74, 76, 78, 82, 84, 86, 87, 90, 91, 96], [9, 13, 17, 20, 26, 27, 42, 46, 48, 62, 67, 69, 72, 73, 76, 77, 82, 83, 86, 93, 95, 95, 98, 98], [2, 12, 18, 25, 29, 30, 31, 33, 39, 45, 48, 49, 56, 57, 60, 61, 64, 72, 73, 78, 79, 94, 98, 98], [2, 3, 10, 15, 20, 22, 23, 23, 27, 29, 36, 40, 42, 46, 48, 53, 53, 60, 60, 70, 73, 78, 98, 98], [6, 10, 11, 12, 15, 20, 28, 28, 33, 40, 43, 48, 51, 57, 60, 60, 61, 62, 66, 68, 72, 75, 92, 97], [2, 11, 12, 14, 15, 19, 21, 26, 30, 35, 36, 36, 46, 51, 56, 63, 69, 74, 82, 88, 89, 89, 89, 94], [1, 4, 5, 10, 11, 13, 15, 18, 23, 28, 44, 53, 53, 66, 67, 69, 70, 71, 71, 77, 79, 87, 88, 99], [2, 2, 5, 7, 7, 8, 9, 17, 26, 30, 35, 39, 41, 43, 49, 63, 64, 65, 70, 70, 80, 89, 96, 99], [4, 7, 11, 12, 14, 16, 20, 21, 27, 41, 42, 42, 43, 48, 49, 52, 62, 66, 75, 76, 81, 86, 97, 99], [1, 12, 13, 15, 17, 19, 26, 34, 47, 47, 47, 48, 51, 52, 53, 60, 61, 63, 64, 74, 77, 82, 87, 93], [1, 2, 4, 8, 14, 19, 22, 24, 31, 31, 37, 54, 60, 63, 66, 68, 76, 80, 80, 84, 88, 92, 93, 99], [1, 2, 3, 6, 7, 9, 11, 19, 25, 27, 35, 36, 45, 52, 57, 57, 86, 88, 89, 89, 93, 94, 97, 99], [7, 8, 9, 10, 11, 30, 33, 34, 37, 48, 50, 50, 56, 60, 66, 70, 72, 73, 76, 79, 86, 88, 95, 95], [1, 4, 5, 5, 6, 11, 26, 27, 32, 36, 43, 47, 47, 47, 50, 56, 56, 66, 76, 78, 78, 94, 97, 99], [6, 15, 18, 27, 36, 38, 40, 44, 47, 48, 64, 64, 68, 70, 76, 79, 83, 85, 86, 90, 93, 93, 95, 97], [1, 4, 4, 10, 11, 12, 16, 19, 20, 22, 22, 23, 35, 49, 51, 58, 66, 66, 68, 76, 77, 81, 86, 94], [2, 9, 12, 12, 13, 20, 20, 35, 44, 48, 51, 55, 62, 66, 71, 71, 73, 74, 78, 83, 89, 90, 93, 99], [9, 15, 20, 24, 25, 31, 32, 35, 36, 49, 50, 51, 52, 55, 58, 63, 79, 79, 85, 89, 90, 96, 98, 99], [6, 10, 12, 15, 16, 17, 17, 21, 24, 44, 48, 53, 58, 60, 61, 64, 67, 74, 81, 84, 86, 87, 88, 92], [7, 10, 14, 20, 21, 27, 30, 30, 31, 34, 36, 37, 39, 45, 55, 55, 63, 64, 66, 82, 88, 88, 94, 95], [6, 11, 13, 21, 22, 23, 23, 24, 28, 35, 36, 40, 41, 53, 55, 57, 63, 66, 73, 74, 77, 78, 87, 96], [4, 17, 19, 23, 25, 38, 42, 45, 50, 57, 61, 62, 62, 62, 62, 64, 75, 78, 79, 79, 82, 85, 86, 93], [14, 15, 21, 27, 38, 39, 40, 42, 43, 43, 50, 51, 54, 58, 58, 59, 60, 62, 63, 70, 75, 85, 91, 92], [6, 7, 11, 12, 20, 30, 40, 41, 41, 44, 47, 51, 52, 53, 59, 75, 76, 77, 84, 87, 91, 93, 95, 97]], [[38, 12, 92, -6, 8], [80, 66, -56, -54, -74], [36, 6, 52, -78, -92], [80, 76, 88, 10, -30], [32, 64, 18, 58, -2]], [[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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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]], [[45, 96, 71], [87, 80, 90], [96, 72, 49]], [[-98, -98, -92, -82, -80, -72, -70, -48, -38, -32, -32, -28, -16, -2, 0, 0, 20, 20, 24, 30, 36, 40, 46, 58, 62, 62, 66, 74, 74, 76, 80, 82], [-96, -94, -94, -88, -80, -64, -54, -48, -46, -44, -38, -36, -34, -32, -30, -30, -24, -16, 2, 8, 26, 36, 36, 40, 48, 52, 78, 80, 80, 80, 88, 94], [-98, -98, -92, -88, -88, -88, -62, -60, -46, -34, -24, -16, -14, 8, 10, 16, 18, 20, 30, 44, 48, 48, 50, 54, 54, 70, 70, 76, 78, 82, 84, 94], [-94, -80, -76, -74, -66, -58, -48, -38, -26, -16, -12, -10, -8, -2, 0, 8, 10, 10, 12, 22, 28, 32, 40, 42, 44, 50, 60, 72, 84, 86, 90, 94], [-88, -72, -62, -46, -44, -44, -34, -30, -28, -28, -18, -18, -10, -6, -4, -2, 2, 8, 8, 22, 32, 34, 38, 46, 54, 54, 54, 76, 76, 80, 84, 86], [-94, -94, -82, -80, -78, -70, -58, -46, -36, -28, -10, -10, 0, 2, 2, 4, 8, 14, 24, 32, 34, 34, 38, 42, 42, 42, 58, 84, 86, 88, 94, 96], [-98, -96, -96, -88, -80, -68, -62, -54, -52, -28, -28, -26, -22, -12, -8, -4, 2, 8, 16, 16, 28, 30, 32, 38, 54, 58, 66, 70, 74, 76, 96, 98], [-86, -84, -80, -62, -62, -58, -52, -50, -42, -38, -36, -36, -28, -18, -4, 10, 14, 38, 40, 46, 46, 48, 54, 72, 72, 74, 84, 86, 86, 88, 90, 96], [-78, -74, -66, -62, -48, -26, -18, -12, 6, 8, 18, 22, 24, 34, 36, 38, 42, 46, 64, 66, 66, 68, 70, 72, 76, 76, 78, 80, 84, 86, 88, 90], [-98, -98, -92, -84, -74, -70, -68, -50, -50, -48, -48, -36, -30, -6, -4, -4, -4, 10, 24, 28, 30, 32, 50, 58, 60, 62, 76, 78, 84, 90, 90, 98], [-98, -96, -82, -78, -74, -62, -62, -60, -58, -56, -50, -42, -36, -32, -20, -4, 0, 2, 6, 14, 16, 26, 26, 42, 46, 70, 70, 72, 78, 82, 86, 90], [-86, -80, -80, -76, -70, -66, -58, -54, -50, -44, -42, -36, -32, -24, -22, -16, -8, -6, 2, 4, 16, 18, 36, 40, 46, 52, 58, 60, 62, 74, 76, 98], [-86, -78, -66, -64, -58, -52, -38, -32, -30, -28, -18, -18, -16, -10, -8, 2, 2, 4, 6, 6, 14, 22, 36, 36, 42, 52, 54, 76, 78, 84, 88, 98], [-98, -94, -94, -74, -72, -52, -50, -38, -30, -26, -16, -14, -4, 2, 2, 4, 4, 16, 22, 24, 28, 32, 34, 34, 36, 50, 56, 66, 68, 80, 82, 94], [-98, -90, -86, -78, -74, -72, -70, -58, -56, -52, -50, -44, -30, -24, -24, -2, 0, 6, 20, 32, 40, 40, 46, 48, 50, 58, 64, 74, 84, 90, 90, 90], [-98, -92, -86, -84, -82, -82, -78, -66, -64, -50, -40, -24, -24, -22, -22, -14, -12, -8, 0, 8, 12, 14, 20, 26, 42, 42, 58, 64, 82, 86, 92, 96], [-98, -90, -86, -76, -68, -64, -64, -64, -54, -54, -52, -44, -34, -34, -12, 6, 10, 12, 26, 38, 40, 40, 60, 68, 68, 68, 74, 78, 80, 88, 98, 98], [-92, -92, -68, -60, -54, -52, -48, -46, -40, -36, -32, -30, -28, -24, -24, -18, -4, -2, 2, 28, 32, 38, 42, 46, 60, 62, 72, 78, 80, 82, 82, 90], [-98, -86, -80, -80, -76, -64, -62, -60, -50, -34, -22, -18, -14, -12, -12, -10, 2, 6, 10, 18, 22, 28, 32, 32, 36, 38, 48, 66, 72, 82, 90, 96], [-92, -90, -86, -84, -82, -78, -72, -72, -68, -68, -60, -46, -38, -30, -28, 2, 8, 10, 18, 22, 24, 28, 40, 40, 52, 54, 64, 74, 80, 82, 86, 96], [-96, -86, -82, -82, -70, -70, -62, -62, -58, -58, -56, -56, -52, -52, -46, -42, -38, -34, -26, -24, -6, -6, -2, 8, 22, 26, 38, 52, 70, 74, 82, 90], [-92, -70, -64, -62, -56, -54, -48, -42, -36, -22, -22, -20, -14, -14, -2, 2, 2, 12, 22, 26, 60, 64, 68, 70, 70, 74, 74, 80, 84, 88, 88, 90], [-98, -98, -84, -84, -84, -80, -64, -60, -54, -54, -44, -34, -30, -18, -16, -14, 2, 8, 10, 28, 30, 32, 50, 58, 62, 62, 64, 72, 78, 78, 82, 88], [-96, -94, -86, -86, -60, -56, -52, -50, -34, -26, -14, -10, -6, -4, 2, 18, 20, 30, 38, 40, 42, 46, 48, 52, 54, 66, 68, 74, 74, 84, 92, 98], [-98, -96, -96, -94, -66, -50, -44, -44, -38, -30, -30, -22, -20, -18, -16, -14, -14, -4, -4, -2, 2, 22, 30, 42, 52, 54, 60, 70, 80, 84, 92, 96], [-96, -84, -80, -78, -76, -74, -68, -64, -60, -58, -54, -46, -26, -14, -14, -10, -2, 4, 10, 10, 12, 26, 28, 28, 38, 40, 42, 42, 50, 82, 88, 88], [-90, -78, -78, -76, -76, -76, -64, -64, -62, -44, -40, -32, -28, -24, -10, 4, 24, 28, 30, 44, 58, 60, 62, 72, 74, 76, 76, 78, 80, 82, 82, 90], [-88, -86, -72, -66, -60, -60, -58, -58, -54, -38, -32, -30, -16, -14, -10, -10, -6, 0, 8, 12, 16, 20, 22, 26, 30, 34, 36, 44, 52, 64, 66, 88], [-98, -94, -92, -92, -88, -68, -64, -64, -62, -44, -44, -36, -32, -32, -24, -18, -16, -6, -6, 6, 8, 14, 20, 26, 28, 36, 38, 40, 56, 56, 66, 84], [-98, -94, -92, -90, -58, -56, -44, -42, -40, -40, -36, -32, -32, -12, -10, -2, -2, -2, 0, 8, 16, 18, 26, 26, 42, 46, 52, 54, 84, 86, 88, 94], [-80, -78, -78, -70, -58, -56, -56, -36, -34, -32, -6, 4, 6, 10, 20, 32, 40, 42, 54, 58, 58, 64, 66, 66, 66, 66, 80, 82, 82, 82, 88, 90], [-92, -90, -78, -74, -70, -50, -48, -46, -46, -40, -40, -36, -24, -22, -20, -10, -10, -8, -8, -4, 6, 14, 20, 32, 38, 46, 46, 48, 60, 68, 68, 74]], [[1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0], [1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0], [0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1], [1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0], [0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0], [1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0], [0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1], [1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0], [0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0], [0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1], [0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1], [1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0], [0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0], [0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1], [1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1], [0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0], [0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1], [0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1], [1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1], [0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1], [0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0], [0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0], [1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0], [0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0], [0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1], [0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1]], [[13, 26, 41, 59, 89, 95, 99], [5, 21, 27, 30, 41, 84, 92], [6, 46, 75, 76, 95, 96, 97], [13, 21, 33, 62, 74, 85, 88], [2, 3, 15, 25, 56, 73, 97], [38, 65, 71, 76, 82, 86, 86], [2, 28, 32, 51, 73, 77, 90]], [[10, -88, 60, -18, -24, -72, -10, 8, -12, 16, -22, -94, 12, -8, 66, 10, 6, 6, 52, -6, -18, 98, 44, 48, -38, -32, -84, -56, -52, -60, -6, -74, -54, 76, -74, -36, -44, 94, -52, 74, 14], [0, -12, -26, -24, -72, 28, -72, -44, 32, -28, -98, -64, -48, 72, -74, -10, 10, -44, 30, -12, -26, -38, -14, 72, -42, 68, 26, 78, -6, -58, -70, 74, 24, -68, -22, 48, 14, 86, -14, 58, -52], [48, -18, 34, -38, 8, 96, -22, 14, -48, 74, 58, -70, -30, -40, -12, -90, 8, -98, -56, 60, 46, 38, -82, 32, -24, -68, -92, 72, 2, -96, -96, 72, 38, 38, 12, -18, -36, -94, -68, -32, 54], [-28, 4, -84, -68, -56, -60, -12, 82, 2, 14, -2, 62, 42, 36, 56, -12, -30, -72, -70, 10, 96, -84, -44, 64, 2, 70, -78, -62, -48, -94, 48, 28, -78, 64, -4, 80, -34, 4, 68, -18, -48], [-38, 0, 34, 28, 80, -36, -4, 52, -86, 84, 44, 16, 34, 8, -38, -80, -62, -78, 62, 50, 98, -88, -40, -66, -16, -20, -34, -84, 48, -28, -4, -10, 34, -10, 52, -58, -92, -46, 14, -86, 66], [-8, -56, -18, 64, -64, -82, 14, -60, -4, -32, -52, -70, 62, 56, -58, -26, -32, 84, 88, 28, -34, -56, 12, 56, 54, 92, -90, 8, 84, 18, 12, 40, -80, -24, 66, -22, -14, 76, -46, -18, 10], [-22, -34, -92, -58, -6, -26, 26, 30, -92, 82, 12, -60, -60, -10, 24, 78, -78, 50, -6, 10, -32, -10, -6, 72, -90, -54, -32, -88, -86, 30, 70, -4, 84, -40, -52, 32, -46, -92, -18, -92, -16], [-78, 0, 56, -10, 14, 64, 84, -6, -32, -54, 42, -22, 26, -94, 32, 54, -32, 20, -76, 6, -68, -72, -54, 32, 14, -36, -2, -74, 44, 76, 28, -34, 20, 84, 56, -60, -6, 30, -4, 36, 54], [90, -48, -22, 20, 26, 48, -64, 88, 20, 46, -86, -92, 2, 24, -4, 4, -36, -12, 28, -38, -84, 48, -46, -30, 68, -8, -30, -10, -2, 64, -4, -30, 48, 2, 96, 26, -76, -26, 14, -94, 86], [-92, -66, -14, 94, -92, -2, 30, -8, 88, 34, -52, 60, 52, -10, -18, 28, 2, 94, -12, 62, -48, 30, 22, -26, 70, -84, -4, 82, -42, 32, 62, 30, -54, 80, -34, 32, -94, -8, -40, -28, 32], [-28, 26, 2, 86, -74, 8, -38, 84, -6, 18, -38, 48, -60, 36, -58, 12, -76, 62, -4, -14, -18, -74, -56, -16, 48, 74, -46, 12, -42, -18, 62, 18, 98, -80, -92, 22, -80, -74, 10, -72, -88], [12, 54, 48, 60, 32, -74, 54, 50, 32, -38, 96, 20, 72, -32, 76, -30, 96, 58, -2, 40, 12, 72, 94, 82, 70, 74, -90, -82, -2, 6, 2, -18, -34, -58, -66, 12, 72, 68, -76, -42, -4], [-60, -30, 70, 42, -52, 4, 32, 20, -40, -34, 26, -74, 36, -10, -16, 0, 16, -66, 4, -46, -54, -50, -76, 52, -4, -96, 60, -62, 82, 8, 56, 70, 32, -44, -68, -8, -10, -42, 44, 84, 28], [-8, 94, 98, 78, 38, 8, 22, -6, 96, -8, 48, 26, -22, 12, -46, 92, 80, 12, 62, 4, 80, -20, 16, -28, 70, -88, 44, 68, 22, 8, 6, 84, 98, 4, -68, -44, -4, 94, 40, 38, 32], [54, 80, -38, 14, -36, -96, 28, -86, -36, -42, 34, 22, 16, 8, 22, 36, -24, -32, 78, 36, 12, -10, -50, 8, 56, -74, -92, -64, -74, 86, 28, 38, 48, 20, 82, 60, -10, 32, -60, 58, -52], [6, 18, -12, -80, -42, -12, -34, -38, 16, 42, 98, 6, 40, -28, 90, 76, 94, -36, 74, 0, -52, -52, 24, 0, 78, 44, 2, -94, 72, 96, 8, 64, -40, -42, -2, -80, 52, -86, 58, -72, -10], [-2, -38, 56, 24, 44, 50, 58, -56, 96, -96, 56, -72, -86, 68, 58, -32, 48, 24, -68, -66, 64, 0, -82, -14, 30, 4, -8, -8, 22, -38, -4, -78, -50, 90, -72, -2, -66, 50, -60, 26, -10], [42, -54, 82, -20, -94, 32, 6, -58, 62, 86, 66, -10, 0, 78, -14, 66, -74, 38, -42, -2, -42, -66, -52, -38, 38, 32, -16, 78, 80, 40, -98, -98, -62, -36, 18, 8, 12, -20, 94, -92, 52], [48, -80, 76, -36, 90, 6, -30, -22, 10, -6, 42, -86, -52, 84, -86, -12, -92, -72, 78, 28, -98, 38, 80, 76, 18, 64, 66, -8, -6, -66, -92, 86, -26, -98, -88, 62, 82, -8, -34, -64, 44], [-26, -28, 92, -82, -36, -24, -58, 32, 44, -70, 2, -72, 54, -64, 58, 92, -36, -14, -22, -70, -30, -10, -84, -22, 82, 88, -18, 24, -18, -22, 4, 72, 28, -46, 48, -14, 92, 24, -82, 92, 40], [-32, -60, -32, 72, 98, -96, 34, -86, -92, -4, -52, -52, 18, -56, -36, -34, -22, -28, 72, 54, -20, -42, 64, 0, 26, 34, -20, -6, -80, -48, 22, 12, -58, 2, 58, -2, -34, 92, -34, 32, 40], [70, 60, -76, -54, -76, 56, -78, 44, 42, -78, -40, 12, 50, 46, 48, -12, 62, -46, -4, -62, 24, -10, 54, 76, 22, 4, 26, 96, -82, -88, -72, 48, -18, 16, -22, 48, 0, -32, 82, 76, 96], [38, -80, -92, 14, 2, -92, 62, 98, -34, -30, -32, -32, 72, -12, -12, 30, -24, -76, -58, -24, -80, 48, -22, 54, -80, 64, -90, -26, 56, -46, 18, -70, 96, 86, 68, -72, 52, 28, -98, -42, 90], [-20, -66, 94, 20, 14, -82, 94, 60, 92, 46, -86, 18, -44, 42, 96, 40, 90, -96, -10, 44, -54, -50, 10, -48, 78, 66, -62, 42, -88, -58, 80, 36, -20, 70, 82, -12, -90, 14, -94, 8, 90], [40, 54, 2, 12, -98, -96, 48, -10, -64, -16, 22, 98, -98, 76, -28, 76, 66, 56, -10, -34, 44, 14, 86, 94, 50, -18, -76, -46, 30, 94, 42, -70, -72, -48, 48, -88, 94, 50, 84, -64, 24], [-14, -96, 94, -42, 94, 52, 58, 62, 46, 14, -28, -68, 42, -80, 70, -44, -94, -66, 54, -60, -58, 30, 40, -30, 78, -76, -40, 24, 98, 6, -42, 72, 20, 64, -84, -30, 84, -34, -16, -86, 70], [-20, -66, 90, 0, 58, -12, -14, -98, -68, -12, 82, 0, 60, 94, -10, 96, 62, -66, -22, 84, -20, -56, -60, 98, -18, 96, 10, 48, 2, 52, -64, -70, 8, -88, -20, -50, 56, -10, 72, -30, -68], [-32, 66, 70, 82, -30, 24, 58, 0, -80, -96, 18, -44, 82, 76, -10, 34, -34, 38, -30, -88, -68, 2, 16, 4, -22, 36, 58, -56, 48, 70, 46, 24, -86, -94, 2, 6, -70, -68, -82, -20, 30], [44, 90, 0, 98, 94, -34, -8, 66, 80, -98, 32, -26, 96, -98, 14, 22, 74, -62, -4, -52, 44, -62, -6, 26, 86, -18, 88, -20, 4, 72, -10, 4, 34, 4, -36, -76, 8, 80, -84, -50, 14], [40, -16, 96, 22, -26, 18, -18, 78, -72, -84, -10, -42, 18, 4, 26, 0, 70, -84, 84, -68, 54, -16, -34, 32, -28, 86, -8, 40, 90, -92, -78, 16, -78, 84, -8, -28, -12, -44, 10, -10, -42], [98, 72, 68, -4, 68, 68, 66, 34, 52, -58, 12, 2, -62, 64, -40, 42, 60, -88, -72, -20, -46, 46, 94, 32, -72, -92, -56, -98, -64, 66, -70, -42, -44, -88, -92, 10, 50, -26, -40, -70, 84], [-58, 84, -40, -16, -72, 10, -26, 76, -72, -14, 50, 16, 6, 6, -8, -82, 96, -80, -70, 46, 66, -46, 96, 68, -50, 54, 4, -32, 32, 62, -80, 36, 88, 88, 74, -22, -80, 8, 98, 62, -42], [50, -68, 82, -28, 72, -78, 82, -84, 80, -2, -94, -46, -16, 16, -64, -12, -38, -84, 98, -68, -74, 14, 88, -66, -50, 58, 98, 70, -34, -4, 86, 28, 60, -34, -52, -22, 12, 40, 98, 42, 66], [90, -58, -18, -70, -12, -86, 2, 26, 70, -76, 80, -38, 68, -30, -62, -2, 0, 88, -62, -44, 84, 32, 98, 28, -42, 80, 28, 80, -70, 2, 80, 74, 92, 72, 56, -14, 28, -52, -28, -50, 0], [-52, -46, 30, 6, -10, 76, 60, -34, -38, -58, 12, 58, -50, 82, -40, -16, 14, 94, 84, -22, -36, 22, 14, 84, -38, 62, 70, -34, -30, -18, 46, -82, -18, 96, -14, -58, 16, 96, -76, -60, 50], [68, 74, 10, -20, 14, -62, -70, -86, -36, 90, 44, -12, 74, -4, -34, -16, 84, -66, -20, 86, 52, 88, 6, 64, 60, 4, -10, -90, -48, 82, -26, 14, 36, -44, 38, 34, -86, -80, 90, 8, -70], [-60, 56, -54, 10, -82, 66, 14, -16, -46, -88, 96, -58, 4, 44, 74, 32, 22, 44, 94, 48, -96, -74, -2, -90, 32, 62, 36, 56, -10, 10, 84, -64, 54, -32, -42, 36, -32, 14, -86, -98, 10], [98, -62, 76, -38, 36, 20, 72, -18, 2, -18, -66, 16, -66, 28, -8, -44, 98, -12, 12, -94, 38, 38, -6, -40, 66, -34, 16, -96, -60, 24, -50, 96, -58, -26, 74, -48, 72, -26, -38, 28, 82], [-60, -62, 24, -74, 72, 22, 56, 78, -56, -10, 86, -60, 54, -92, 18, 36, -26, 66, -18, 54, 50, -70, -10, 20, -4, -6, -34, 80, -76, -10, 76, -72, -6, -44, -64, 88, 78, 78, -8, -26, 2], [-28, -98, -50, 18, 8, -16, 16, 58, 4, 28, 14, 76, 96, 56, 56, -86, 14, -56, 74, -28, -34, 30, 74, 30, 72, 18, 42, -64, -94, 54, -14, -42, 80, 40, -94, -36, -32, -70, 18, -26, 86], [28, 6, -82, 6, -2, -26, 6, -66, -20, -36, 6, 6, 70, 4, -96, 42, -66, -44, -42, 26, 12, -52, 90, 54, -82, -30, 38, -64, -80, -70, 36, -16, -44, -80, -44, -76, 94, -18, 90, -14, 62]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[44, 4, 10, 70, 98, 8, 30, 72, 6, 11, 85, 86, 72, 96, 67, 39, 45, 63, 4, 28, 55, 81, 74, 7, 4, 44, 53, 90, 89, 35, 89, 32, 96, 28, 44, 61, 74, 13, 9, 83, 96, 41], [37, 10, 41, 26, 61, 21, 58, 58, 72, 3, 73, 43, 21, 47, 6, 30, 57, 35, 16, 37, 18, 23, 23, 32, 15, 19, 29, 67, 65, 16, 65, 93, 8, 44, 46, 21, 24, 30, 62, 52, 66, 88], [48, 53, 60, 92, 35, 91, 92, 46, 56, 39, 30, 31, 66, 24, 96, 54, 1, 90, 31, 47, 52, 45, 70, 82, 83, 27, 22, 99, 67, 23, 53, 82, 34, 52, 88, 7, 36, 7, 20, 55, 92, 44], [15, 75, 94, 97, 21, 37, 45, 50, 71, 64, 60, 49, 51, 86, 79, 90, 53, 93, 93, 13, 95, 51, 28, 66, 16, 10, 7, 2, 85, 27, 80, 37, 76, 33, 86, 30, 6, 62, 5, 45, 42, 47], [75, 93, 35, 92, 77, 7, 89, 76, 43, 9, 90, 10, 6, 80, 34, 24, 18, 30, 58, 84, 68, 71, 93, 58, 41, 52, 28, 75, 86, 86, 80, 84, 82, 64, 50, 89, 99, 59, 44, 83, 94, 89], [95, 1, 40, 3, 34, 69, 24, 99, 58, 29, 36, 11, 78, 80, 91, 71, 68, 69, 35, 93, 34, 61, 45, 33, 48, 30, 41, 95, 56, 99, 5, 27, 95, 14, 99, 69, 48, 94, 11, 27, 92, 54], [70, 19, 36, 19, 31, 78, 14, 51, 61, 28, 8, 10, 31, 2, 25, 61, 46, 55, 77, 21, 41, 5, 21, 32, 23, 99, 71, 46, 76, 66, 37, 2, 21, 65, 36, 48, 71, 52, 90, 89, 68, 24], [43, 40, 64, 15, 67, 6, 20, 61, 69, 51, 86, 95, 92, 70, 1, 32, 21, 80, 63, 30, 86, 4, 47, 21, 33, 66, 2, 75, 8, 78, 19, 51, 44, 66, 12, 58, 14, 20, 39, 66, 94, 78], [8, 25, 73, 3, 51, 70, 51, 36, 34, 46, 16, 28, 20, 75, 18, 35, 35, 71, 31, 80, 24, 1, 96, 30, 17, 64, 69, 55, 24, 48, 82, 85, 67, 70, 15, 94, 13, 33, 12, 25, 49, 65], [33, 90, 55, 35, 6, 30, 47, 12, 2, 60, 80, 80, 6, 68, 39, 35, 98, 13, 44, 94, 20, 13, 15, 50, 7, 52, 12, 8, 24, 18, 83, 69, 30, 76, 32, 89, 55, 20, 58, 85, 80, 50], [49, 80, 37, 60, 53, 38, 14, 60, 2, 17, 88, 15, 25, 87, 3, 2, 88, 8, 64, 5, 44, 47, 13, 79, 2, 2, 74, 77, 58, 40, 1, 80, 74, 2, 83, 42, 26, 89, 62, 66, 20, 77], [37, 13, 42, 49, 21, 7, 26, 39, 14, 58, 12, 97, 52, 45, 77, 25, 66, 58, 30, 48, 59, 46, 90, 37, 94, 3, 78, 66, 70, 46, 95, 26, 49, 88, 8, 90, 13, 87, 47, 89, 65, 82], [81, 55, 21, 50, 64, 12, 37, 28, 27, 83, 52, 29, 83, 43, 56, 14, 60, 25, 61, 48, 56, 6, 16, 47, 56, 71, 70, 40, 17, 85, 65, 8, 24, 31, 6, 4, 87, 31, 24, 78, 85, 37], [51, 46, 97, 80, 73, 46, 45, 93, 4, 43, 96, 96, 48, 1, 62, 85, 3, 70, 61, 81, 37, 45, 72, 35, 78, 12, 98, 56, 84, 77, 99, 96, 87, 42, 98, 97, 27, 30, 66, 45, 84, 41], [42, 41, 8, 68, 6, 28, 57, 24, 59, 93, 39, 20, 19, 59, 78, 8, 92, 61, 11, 3, 27, 94, 77, 66, 48, 31, 18, 70, 60, 36, 27, 39, 72, 87, 56, 48, 8, 6, 35, 38, 37, 40], [50, 45, 75, 68, 22, 7, 84, 74, 30, 34, 15, 44, 30, 44, 49, 65, 79, 93, 63, 54, 72, 89, 58, 29, 47, 50, 77, 44, 52, 57, 45, 34, 31, 26, 29, 54, 44, 93, 38, 37, 53, 82], [11, 86, 90, 17, 22, 44, 73, 54, 25, 58, 21, 27, 22, 91, 26, 66, 74, 66, 3, 27, 51, 19, 90, 60, 7, 51, 93, 54, 29, 19, 23, 2, 35, 29, 48, 87, 76, 66, 14, 99, 98, 51], [34, 39, 88, 97, 99, 84, 14, 8, 36, 56, 69, 57, 94, 68, 91, 62, 40, 96, 10, 73, 65, 35, 94, 91, 80, 67, 37, 95, 6, 5, 23, 69, 22, 81, 22, 58, 83, 13, 25, 6, 38, 28], [60, 88, 74, 42, 42, 39, 2, 10, 57, 59, 94, 79, 92, 39, 59, 31, 63, 44, 17, 99, 3, 55, 2, 87, 95, 90, 47, 60, 72, 17, 17, 35, 39, 63, 70, 74, 76, 25, 55, 72, 13, 30], [26, 27, 43, 37, 21, 26, 8, 65, 66, 33, 15, 82, 43, 40, 15, 68, 74, 1, 98, 49, 51, 9, 47, 21, 79, 67, 21, 11, 28, 73, 7, 96, 33, 44, 61, 30, 75, 95, 90, 43, 64, 89], [91, 13, 86, 21, 29, 24, 34, 68, 24, 3, 60, 92, 92, 80, 82, 52, 95, 13, 12, 59, 36, 78, 6, 9, 1, 3, 61, 93, 86, 80, 31, 16, 59, 11, 6, 23, 77, 7, 10, 1, 32, 30], [6, 21, 11, 79, 3, 77, 25, 52, 32, 39, 92, 63, 3, 32, 18, 15, 66, 53, 96, 93, 74, 79, 31, 36, 80, 27, 12, 46, 72, 27, 98, 83, 44, 21, 36, 15, 47, 41, 18, 96, 91, 60], [59, 98, 10, 37, 12, 91, 48, 77, 14, 59, 12, 22, 91, 25, 36, 83, 31, 4, 31, 5, 38, 25, 44, 67, 49, 27, 7, 28, 19, 82, 35, 13, 55, 70, 49, 48, 73, 78, 36, 98, 97, 82], [10, 87, 31, 78, 38, 14, 99, 81, 87, 49, 60, 53, 57, 82, 90, 77, 82, 35, 60, 82, 85, 13, 67, 21, 70, 45, 88, 13, 25, 9, 85, 60, 63, 50, 50, 39, 44, 32, 51, 73, 74, 87], [40, 34, 76, 93, 84, 22, 2, 73, 95, 42, 26, 92, 88, 20, 50, 14, 74, 41, 34, 75, 10, 47, 89, 41, 15, 32, 74, 48, 82, 8, 22, 70, 25, 34, 19, 63, 79, 76, 82, 15, 98, 53], [27, 19, 98, 30, 57, 58, 79, 13, 31, 61, 75, 33, 54, 9, 25, 2, 24, 64, 66, 67, 73, 59, 30, 44, 89, 35, 71, 55, 90, 66, 44, 10, 92, 36, 8, 23, 83, 75, 17, 39, 96, 75], [52, 31, 79, 97, 85, 46, 67, 50, 41, 3, 57, 48, 53, 58, 55, 42, 24, 33, 86, 27, 84, 28, 1, 46, 40, 73, 78, 41, 33, 99, 73, 57, 18, 69, 32, 47, 91, 3, 82, 80, 9, 43], [17, 60, 74, 21, 61, 90, 72, 18, 45, 86, 72, 78, 14, 98, 43, 65, 4, 22, 34, 18, 45, 38, 83, 38, 50, 40, 30, 60, 64, 25, 69, 6, 57, 10, 52, 59, 69, 17, 80, 65, 94, 97], [47, 37, 33, 49, 55, 83, 4, 9, 79, 24, 17, 48, 58, 49, 44, 19, 16, 44, 99, 6, 45, 78, 61, 85, 88, 12, 20, 30, 12, 37, 2, 84, 47, 97, 42, 74, 34, 1, 34, 28, 19, 18], [26, 28, 6, 93, 27, 1, 49, 32, 83, 36, 36, 16, 34, 96, 27, 50, 7, 43, 86, 42, 20, 37, 70, 87, 33, 8, 93, 55, 80, 4, 66, 73, 13, 11, 79, 99, 4, 42, 17, 74, 12, 34], [64, 93, 72, 63, 99, 8, 97, 99, 29, 45, 61, 42, 95, 14, 47, 56, 86, 2, 81, 92, 36, 13, 20, 7, 96, 62, 79, 84, 33, 36, 91, 35, 42, 2, 83, 4, 37, 98, 92, 39, 89, 14], [86, 77, 25, 50, 14, 29, 32, 86, 57, 7, 72, 95, 48, 51, 61, 20, 77, 2, 9, 11, 21, 64, 52, 41, 64, 6, 45, 64, 55, 2, 90, 45, 30, 23, 47, 53, 9, 71, 83, 36, 62, 67], [47, 65, 75, 96, 24, 18, 98, 80, 13, 63, 88, 51, 47, 72, 12, 54, 88, 77, 13, 77, 19, 56, 81, 25, 77, 62, 44, 43, 61, 5, 35, 21, 35, 38, 21, 52, 41, 86, 90, 16, 26, 87], [20, 80, 16, 44, 45, 38, 52, 99, 63, 14, 90, 84, 89, 82, 50, 4, 72, 94, 28, 26, 3, 54, 58, 83, 31, 34, 20, 16, 96, 33, 34, 9, 55, 89, 42, 16, 18, 87, 13, 85, 69, 64], [44, 71, 35, 81, 66, 4, 4, 29, 53, 73, 52, 99, 69, 54, 69, 38, 48, 8, 94, 31, 13, 3, 16, 8, 3, 54, 31, 58, 96, 17, 36, 15, 27, 16, 22, 56, 54, 27, 11, 40, 34, 5], [58, 93, 26, 73, 54, 22, 32, 35, 83, 44, 18, 78, 17, 58, 28, 47, 51, 75, 40, 69, 50, 13, 84, 18, 59, 50, 42, 74, 56, 82, 77, 43, 12, 99, 82, 77, 10, 2, 25, 59, 50, 36], [83, 23, 64, 92, 61, 47, 43, 4, 67, 92, 18, 18, 54, 58, 50, 2, 86, 69, 47, 99, 7, 50, 48, 45, 35, 20, 39, 63, 29, 9, 84, 21, 69, 28, 91, 13, 68, 91, 51, 90, 22, 46], [45, 28, 67, 44, 26, 98, 95, 8, 43, 23, 52, 77, 46, 34, 72, 56, 74, 59, 77, 94, 7, 50, 30, 18, 73, 97, 42, 34, 46, 52, 5, 96, 40, 10, 63, 51, 93, 16, 14, 65, 63, 65], [77, 24, 8, 94, 47, 10, 20, 15, 39, 49, 71, 92, 76, 2, 71, 85, 45, 87, 41, 32, 38, 70, 79, 12, 30, 44, 22, 95, 89, 21, 51, 88, 35, 33, 66, 9, 65, 64, 26, 72, 19, 35], [44, 43, 19, 41, 45, 85, 10, 54, 79, 21, 81, 17, 16, 29, 60, 68, 85, 90, 89, 68, 92, 61, 98, 92, 21, 49, 10, 19, 7, 29, 51, 31, 57, 60, 7, 86, 21, 88, 7, 54, 15, 1], [98, 10, 52, 61, 26, 89, 45, 10, 22, 36, 45, 71, 26, 57, 41, 10, 98, 19, 58, 24, 12, 50, 76, 67, 3, 94, 43, 71, 42, 14, 80, 24, 74, 33, 68, 51, 47, 55, 99, 65, 39, 22], [43, 92, 79, 13, 74, 41, 76, 42, 6, 47, 97, 39, 98, 48, 54, 81, 97, 90, 74, 95, 60, 47, 98, 50, 25, 33, 97, 27, 70, 51, 32, 41, 54, 18, 87, 1, 91, 81, 59, 64, 30, 88]]]; int [] param1 = [23, 2, 33, 1, 29, 23, 4, 32, 18, 30]; int [] param2 = [21, 3, 35, 1, 31, 17, 4, 36, 23, 29]; 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); } " HARDY_RAMANUJAN_THEOREM,"static int f_filled ( int n ) { int count = 0 ; if ( n % 2 == 0 ) { count ++ ; while ( n % 2 == 0 ) n = n / 2 ; } for ( int i = 3 ; i <= Math . sqrt ( n ) ; i = i + 2 ) { if ( n % i == 0 ) { count ++ ; while ( n % i == 0 ) n = n / i ; } } if ( n > 2 ) count ++ ; return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 2, 2, 1, 2, 2, 1, 2, 2, 1]; int [] param0 = [99, 33, 50, 17, 18, 69, 23, 18, 94, 16]; 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_PRODUCT_OF_4_ADJACENT_ELEMENTS_IN_MATRIX,"static int f_filled ( int arr [ ] [ ] , int n ) { int max = 0 , result ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { if ( ( j - 3 ) >= 0 ) { result = arr [ i ] [ j ] * arr [ i ] [ j - 1 ] * arr [ i ] [ j - 2 ] * arr [ i ] [ j - 3 ] ; if ( max < result ) max = result ; } if ( ( i - 3 ) >= 0 ) { result = arr [ i ] [ j ] * arr [ i - 1 ] [ j ] * arr [ i - 2 ] [ j ] * arr [ i - 3 ] [ j ] ; if ( max < result ) max = result ; } if ( ( i - 3 ) >= 0 && ( j - 3 ) >= 0 ) { result = arr [ i ] [ j ] * arr [ i - 1 ] [ j - 1 ] * arr [ i - 2 ] [ j - 2 ] * arr [ i - 3 ] [ j - 3 ] ; if ( max < result ) max = result ; } } } return max ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [85791650, 32184672, 1, 37003392, 81397232, 1, 49595568, 26455296, 1, 56796795]; int [] [] [] param0 = [[[1, 2, 5, 6, 7, 11, 12, 14, 15, 16, 19, 19, 24, 25, 32, 34, 36, 36, 38, 38, 39, 43, 43, 45, 47, 49, 51, 51, 51, 52, 53, 56, 59, 59, 67, 69, 70, 74, 75, 75, 77, 79, 81, 90, 94, 96, 96, 96], [1, 2, 4, 6, 9, 9, 9, 16, 18, 21, 23, 26, 26, 30, 36, 37, 37, 38, 39, 42, 45, 49, 51, 52, 52, 53, 56, 59, 61, 61, 64, 64, 69, 72, 77, 79, 82, 82, 87, 88, 89, 91, 91, 91, 94, 95, 95, 98], [2, 5, 5, 6, 10, 10, 14, 16, 16, 20, 22, 24, 25, 28, 28, 29, 30, 31, 36, 38, 42, 44, 44, 45, 45, 49, 51, 53, 56, 57, 61, 63, 66, 67, 67, 70, 76, 80, 87, 87, 91, 93, 95, 96, 96, 96, 97, 99], [4, 9, 10, 11, 12, 13, 13, 18, 20, 23, 24, 26, 27, 28, 33, 35, 35, 37, 42, 42, 44, 45, 49, 52, 55, 56, 59, 60, 60, 63, 64, 64, 72, 72, 74, 77, 78, 81, 85, 85, 87, 89, 93, 93, 95, 98, 98, 99], [7, 7, 7, 9, 11, 11, 14, 18, 19, 21, 26, 32, 32, 34, 35, 37, 37, 39, 40, 41, 42, 53, 56, 59, 62, 62, 65, 68, 69, 70, 72, 73, 73, 75, 75, 77, 77, 78, 85, 86, 87, 88, 88, 88, 93, 94, 95, 98], [4, 4, 5, 12, 16, 19, 20, 23, 25, 27, 28, 37, 38, 39, 40, 41, 45, 46, 47, 48, 49, 49, 55, 58, 61, 61, 62, 67, 67, 69, 69, 71, 72, 73, 75, 76, 76, 77, 77, 79, 81, 85, 86, 90, 90, 97, 97, 99], [1, 9, 9, 11, 19, 19, 21, 23, 25, 26, 26, 27, 28, 31, 37, 38, 41, 41, 43, 43, 49, 54, 55, 56, 58, 58, 61, 62, 63, 64, 64, 68, 70, 75, 79, 81, 83, 84, 85, 85, 86, 87, 92, 92, 92, 94, 94, 97], [2, 6, 8, 10, 11, 11, 12, 13, 14, 15, 15, 19, 23, 25, 27, 29, 33, 33, 41, 43, 45, 47, 49, 49, 51, 52, 55, 59, 60, 62, 64, 64, 65, 65, 72, 74, 76, 79, 83, 83, 84, 90, 91, 92, 93, 93, 94, 96], [5, 9, 11, 12, 13, 15, 16, 21, 24, 28, 32, 33, 36, 37, 40, 45, 46, 48, 57, 60, 63, 63, 63, 63, 64, 66, 68, 68, 73, 75, 75, 77, 77, 79, 80, 81, 83, 84, 84, 85, 85, 85, 89, 91, 91, 92, 94, 99], [2, 2, 4, 6, 6, 11, 14, 15, 15, 18, 25, 25, 27, 28, 30, 31, 32, 36, 37, 40, 40, 41, 42, 46, 52, 59, 60, 60, 61, 62, 63, 65, 68, 68, 69, 71, 73, 74, 75, 78, 79, 82, 93, 93, 93, 94, 97, 99], [1, 1, 4, 5, 5, 6, 8, 8, 9, 10, 11, 12, 15, 21, 22, 28, 32, 33, 35, 35, 36, 38, 41, 44, 49, 53, 54, 57, 58, 59, 62, 62, 63, 67, 68, 69, 70, 75, 77, 77, 82, 83, 83, 86, 90, 91, 92, 97], [1, 1, 3, 4, 5, 9, 9, 13, 15, 24, 27, 28, 33, 37, 37, 39, 40, 41, 41, 48, 50, 50, 51, 52, 54, 63, 63, 64, 65, 68, 70, 71, 73, 74, 74, 74, 79, 79, 80, 83, 89, 90, 90, 93, 94, 98, 99, 99], [2, 3, 5, 9, 11, 11, 20, 22, 23, 25, 26, 26, 26, 29, 39, 39, 40, 40, 48, 48, 49, 49, 50, 51, 51, 53, 54, 58, 65, 66, 67, 71, 71, 72, 75, 76, 79, 85, 87, 87, 90, 91, 95, 97, 98, 98, 98, 99], [4, 4, 9, 9, 10, 13, 15, 22, 23, 23, 24, 26, 26, 27, 28, 29, 31, 33, 34, 38, 40, 45, 45, 47, 48, 50, 50, 58, 59, 60, 64, 65, 66, 70, 80, 80, 81, 83, 84, 84, 88, 89, 90, 90, 95, 98, 99, 99], [2, 4, 5, 7, 9, 11, 11, 12, 13, 15, 17, 19, 23, 26, 26, 28, 28, 29, 34, 35, 43, 47, 48, 49, 51, 51, 51, 56, 57, 58, 60, 61, 63, 64, 66, 68, 68, 71, 72, 74, 78, 80, 81, 84, 86, 90, 91, 97], [1, 2, 3, 4, 6, 7, 7, 12, 13, 17, 19, 22, 23, 33, 33, 38, 40, 44, 44, 47, 47, 51, 52, 54, 56, 56, 57, 58, 64, 65, 67, 68, 74, 74, 76, 79, 80, 83, 85, 88, 90, 92, 92, 93, 93, 94, 97, 99], [1, 4, 5, 10, 13, 13, 20, 22, 23, 28, 30, 31, 32, 33, 36, 36, 44, 46, 49, 49, 51, 51, 51, 55, 56, 60, 69, 72, 73, 74, 74, 75, 75, 77, 78, 78, 81, 82, 82, 84, 87, 87, 88, 91, 91, 95, 97, 99], [2, 3, 4, 10, 13, 13, 14, 16, 18, 23, 31, 35, 39, 41, 42, 42, 43, 43, 48, 49, 49, 53, 56, 57, 57, 58, 64, 65, 68, 68, 68, 74, 75, 77, 78, 78, 82, 83, 84, 87, 88, 89, 89, 91, 92, 93, 99, 99], [2, 4, 5, 8, 10, 12, 13, 16, 17, 18, 23, 24, 28, 29, 29, 31, 32, 34, 38, 39, 39, 43, 45, 50, 51, 51, 54, 55, 58, 59, 59, 61, 62, 63, 63, 65, 65, 72, 74, 82, 82, 84, 92, 92, 93, 94, 95, 97], [6, 7, 9, 10, 10, 10, 11, 14, 16, 19, 22, 24, 33, 38, 41, 47, 50, 50, 51, 52, 52, 54, 55, 57, 57, 57, 59, 62, 66, 66, 66, 67, 68, 72, 72, 73, 80, 81, 81, 83, 87, 88, 89, 94, 96, 97, 97, 98], [2, 4, 5, 6, 9, 13, 14, 14, 14, 16, 20, 21, 23, 23, 24, 24, 27, 29, 31, 33, 36, 37, 43, 48, 49, 50, 51, 56, 57, 59, 62, 62, 65, 70, 71, 72, 74, 74, 75, 77, 80, 81, 84, 87, 89, 93, 96, 99], [1, 2, 3, 6, 8, 17, 27, 28, 30, 31, 32, 32, 33, 33, 37, 40, 41, 42, 42, 45, 49, 51, 52, 54, 57, 60, 62, 62, 64, 64, 65, 67, 67, 70, 73, 77, 77, 80, 83, 83, 83, 83, 85, 85, 92, 95, 97, 97], [1, 3, 11, 11, 12, 15, 20, 22, 22, 22, 23, 23, 23, 24, 26, 28, 33, 33, 34, 34, 36, 39, 41, 42, 42, 43, 50, 50, 54, 56, 59, 60, 64, 70, 74, 75, 76, 82, 82, 89, 89, 94, 96, 96, 96, 98, 98, 98], [2, 2, 3, 4, 7, 11, 14, 18, 18, 18, 21, 23, 28, 29, 32, 33, 33, 33, 34, 39, 39, 40, 41, 42, 48, 49, 50, 52, 56, 57, 57, 58, 59, 66, 66, 70, 72, 74, 76, 77, 77, 79, 86, 86, 89, 92, 94, 99], [1, 9, 10, 12, 13, 14, 17, 18, 20, 21, 23, 23, 25, 26, 28, 28, 31, 33, 33, 36, 37, 41, 41, 41, 41, 42, 43, 44, 47, 51, 54, 57, 59, 59, 59, 63, 64, 67, 69, 69, 75, 78, 84, 85, 93, 98, 98, 99], [1, 3, 5, 8, 9, 9, 10, 18, 18, 18, 19, 21, 23, 24, 24, 25, 26, 27, 29, 34, 34, 35, 37, 37, 39, 39, 41, 48, 56, 57, 59, 61, 64, 65, 68, 69, 75, 75, 75, 76, 78, 83, 85, 86, 90, 94, 97, 98], [7, 8, 11, 13, 14, 15, 16, 16, 17, 20, 28, 31, 39, 41, 42, 46, 51, 52, 53, 53, 54, 57, 57, 66, 66, 67, 72, 72, 73, 74, 74, 78, 82, 82, 83, 84, 85, 87, 89, 91, 93, 95, 95, 97, 98, 98, 98, 99], [1, 2, 4, 5, 6, 8, 8, 12, 12, 12, 20, 20, 25, 29, 30, 31, 38, 38, 39, 39, 42, 43, 43, 44, 45, 47, 47, 51, 56, 56, 57, 58, 62, 65, 65, 65, 66, 69, 69, 73, 78, 82, 83, 85, 87, 90, 95, 96], [2, 2, 3, 3, 6, 7, 8, 14, 15, 16, 16, 17, 20, 23, 25, 29, 29, 31, 32, 33, 37, 37, 39, 40, 40, 47, 48, 48, 50, 51, 52, 55, 55, 56, 59, 62, 69, 70, 71, 72, 72, 81, 82, 84, 89, 92, 96, 99], [2, 8, 9, 10, 16, 17, 23, 30, 32, 37, 38, 41, 41, 46, 49, 49, 55, 57, 59, 59, 63, 63, 64, 66, 68, 68, 69, 70, 72, 74, 76, 77, 80, 81, 83, 84, 84, 85, 86, 90, 90, 91, 91, 92, 96, 96, 97, 97], [1, 7, 13, 13, 17, 17, 18, 23, 24, 31, 33, 34, 34, 35, 36, 40, 40, 40, 40, 44, 45, 51, 53, 55, 55, 58, 58, 64, 64, 69, 72, 75, 75, 80, 80, 81, 82, 82, 83, 84, 86, 87, 87, 88, 89, 95, 96, 99], [1, 4, 7, 9, 10, 11, 13, 15, 15, 19, 21, 23, 23, 24, 25, 27, 32, 32, 33, 37, 38, 41, 43, 43, 45, 45, 47, 51, 52, 53, 54, 58, 59, 61, 63, 63, 65, 73, 76, 77, 80, 80, 85, 87, 90, 92, 94, 96], [3, 4, 7, 7, 12, 13, 20, 20, 20, 21, 22, 22, 27, 27, 28, 31, 32, 35, 37, 39, 39, 40, 41, 45, 45, 45, 48, 48, 49, 49, 51, 54, 57, 64, 67, 70, 80, 83, 89, 89, 90, 90, 90, 92, 92, 98, 98, 99], [1, 1, 7, 10, 12, 16, 16, 21, 27, 31, 33, 34, 36, 44, 45, 46, 46, 46, 47, 49, 49, 53, 54, 57, 57, 58, 58, 62, 62, 63, 67, 69, 77, 79, 82, 82, 84, 85, 85, 85, 85, 86, 92, 93, 94, 94, 96, 99], [1, 1, 4, 14, 14, 17, 19, 20, 21, 29, 30, 30, 32, 33, 34, 36, 36, 44, 46, 47, 48, 53, 57, 59, 59, 62, 63, 64, 65, 65, 66, 69, 69, 70, 72, 73, 74, 74, 80, 81, 83, 84, 84, 84, 85, 85, 87, 94], [9, 13, 16, 18, 19, 19, 21, 23, 24, 24, 25, 30, 32, 33, 35, 36, 37, 42, 46, 47, 48, 48, 52, 54, 55, 62, 62, 66, 67, 69, 70, 70, 71, 71, 73, 74, 75, 77, 78, 79, 80, 82, 83, 86, 88, 89, 94, 99], [1, 2, 2, 4, 13, 14, 15, 15, 18, 18, 18, 19, 21, 22, 22, 22, 24, 28, 31, 36, 45, 46, 47, 49, 51, 52, 56, 56, 58, 66, 67, 68, 69, 71, 73, 75, 77, 78, 79, 79, 82, 87, 87, 93, 93, 97, 97, 98], [2, 3, 4, 4, 8, 11, 14, 14, 16, 19, 25, 29, 32, 36, 39, 45, 46, 46, 46, 47, 50, 51, 52, 55, 56, 57, 61, 63, 63, 64, 66, 67, 70, 72, 75, 76, 80, 82, 83, 84, 84, 87, 89, 90, 92, 94, 96, 97], [3, 6, 10, 11, 14, 15, 19, 20, 21, 23, 28, 29, 30, 30, 32, 34, 34, 38, 39, 41, 41, 44, 45, 47, 50, 50, 50, 54, 57, 57, 58, 58, 63, 65, 66, 68, 68, 69, 73, 75, 76, 79, 83, 86, 89, 94, 95, 96], [4, 10, 13, 18, 18, 21, 21, 22, 22, 22, 24, 24, 25, 25, 26, 29, 29, 39, 50, 51, 51, 53, 55, 56, 56, 56, 57, 60, 61, 62, 67, 67, 69, 69, 73, 76, 76, 76, 77, 79, 79, 80, 82, 84, 89, 90, 95, 97], [1, 6, 8, 10, 10, 25, 35, 38, 39, 40, 40, 40, 41, 41, 43, 47, 51, 56, 56, 56, 57, 60, 60, 62, 63, 64, 65, 68, 69, 72, 73, 75, 76, 76, 76, 78, 79, 79, 79, 80, 82, 82, 84, 90, 91, 95, 96, 99], [2, 3, 7, 10, 11, 11, 17, 17, 19, 21, 21, 23, 24, 26, 28, 29, 31, 33, 44, 44, 44, 45, 48, 48, 50, 50, 52, 54, 56, 58, 61, 65, 66, 67, 69, 70, 72, 72, 74, 81, 84, 85, 86, 87, 92, 93, 98, 99], [1, 3, 3, 3, 6, 9, 13, 14, 14, 22, 25, 26, 28, 28, 33, 36, 38, 38, 41, 44, 45, 46, 46, 51, 55, 56, 57, 57, 59, 62, 64, 65, 65, 68, 77, 78, 79, 79, 84, 85, 87, 90, 94, 95, 95, 95, 97, 99], [7, 7, 8, 9, 14, 18, 24, 24, 25, 27, 28, 28, 30, 31, 31, 31, 33, 36, 36, 37, 37, 38, 40, 43, 45, 46, 46, 47, 50, 51, 51, 52, 52, 53, 53, 60, 62, 65, 65, 67, 73, 76, 79, 88, 91, 94, 95, 95], [4, 5, 7, 16, 17, 18, 18, 18, 21, 24, 25, 27, 28, 31, 33, 35, 36, 36, 38, 40, 42, 42, 42, 45, 46, 46, 47, 49, 50, 52, 53, 65, 68, 68, 69, 69, 71, 71, 71, 72, 75, 76, 76, 80, 80, 87, 90, 95], [9, 11, 12, 14, 15, 20, 22, 23, 29, 29, 29, 33, 35, 35, 37, 37, 41, 42, 44, 45, 45, 47, 50, 51, 51, 51, 55, 57, 62, 64, 66, 66, 67, 76, 80, 82, 82, 83, 83, 83, 83, 83, 85, 86, 90, 90, 92, 93], [1, 3, 3, 7, 8, 8, 11, 16, 19, 20, 25, 29, 32, 33, 39, 39, 42, 43, 43, 44, 47, 48, 49, 50, 51, 53, 54, 54, 58, 60, 60, 60, 62, 64, 65, 67, 71, 74, 75, 77, 83, 84, 85, 87, 87, 90, 91, 97], [2, 5, 5, 12, 13, 16, 17, 19, 20, 22, 26, 28, 28, 30, 30, 31, 36, 37, 41, 44, 44, 44, 46, 50, 51, 51, 51, 54, 54, 57, 58, 58, 59, 60, 62, 66, 66, 68, 68, 71, 75, 76, 84, 85, 89, 90, 91, 95]], [[36, 16, 60, 44, 14, -68, -28, -98, 14, -6, 24, 56, 54, 70, 70], [-14, 28, -16, -26, -54, 60, 2, 52, 28, -42, 36, 6, 14, 2, -30], [-26, 56, -60, -6, 24, -36, 76, -52, 20, -54, -22, 38, 90, -2, -70], [62, -70, -50, 18, 62, -34, -74, 66, 30, 64, 6, 94, -72, 58, -82], [30, 28, 6, -38, -40, -98, -14, -80, -84, -20, -8, 12, -90, -26, -48], [-2, 64, -38, -82, -82, -18, -14, -20, 28, 16, -94, -78, -80, -4, 32], [-82, -74, 68, 78, -56, 24, -58, 36, -10, 28, 98, 42, 26, -98, 92], [40, -82, 56, 98, 68, -8, 48, -78, -72, -40, 78, 22, -76, 68, 10], [88, 88, 80, 52, -66, -16, -24, -84, 56, -10, 70, -2, 42, 64, 62], [-76, -52, 70, -10, 24, -46, 62, -98, 28, -78, 58, -10, -76, 40, -98], [-82, -58, -12, -98, -54, -62, -32, 52, 48, 64, 28, 72, -84, 48, -14], [-72, 66, -84, 34, -96, 66, -90, 48, 86, -34, -4, -70, -88, -76, 46], [40, 70, 22, -40, 64, -32, -68, -6, -78, -56, -96, -98, -26, -38, -90], [98, 32, 20, 2, -56, 12, 72, -40, 24, 78, 98, 76, 98, -8, 70], [-30, -34, -34, 46, 18, -48, -96, -12, -60, -90, -50, -64, 12, 60, -94]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[43, 44, 74, 24, 47, 58, 43, 11, 78, 61], [93, 7, 12, 81, 39, 13, 50, 62, 27, 87], [27, 9, 63, 68, 8, 83, 44, 22, 83, 2], [70, 73, 44, 15, 37, 38, 42, 21, 20, 75], [72, 43, 56, 93, 92, 73, 34, 9, 28, 38], [4, 83, 97, 56, 44, 89, 92, 51, 82, 68], [55, 51, 72, 78, 65, 66, 10, 13, 71, 85], [97, 15, 49, 86, 56, 56, 92, 84, 98, 73], [89, 44, 19, 45, 74, 7, 76, 60, 42, 34], [65, 47, 3, 34, 46, 97, 98, 78, 19, 57]], [[-88, -82, -70, -46, -44, -18, 12, 38, 66, 90, 96], [-98, -90, -84, -62, -42, -30, -16, 4, 14, 18, 26], [-94, -48, -32, -24, -22, -18, 42, 44, 64, 70, 74], [-94, -60, -58, -56, -40, -34, 2, 18, 32, 76, 96], [-94, -74, -62, -56, -50, -46, -2, 34, 34, 44, 68], [-74, -56, -50, -16, -14, 0, 14, 30, 30, 66, 82], [-80, -78, -60, -56, -46, -32, 4, 8, 14, 42, 54], [-68, -66, -58, -50, -50, -40, -16, -2, 4, 10, 80], [-70, -68, -24, -8, -4, 34, 36, 60, 82, 84, 92], [-90, -62, -60, -54, -6, -6, 10, 10, 14, 52, 66], [-88, -72, -70, -18, -6, 28, 38, 50, 56, 72, 90]], [[0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1], [1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0], [1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1], [0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], [1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0], [0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], [0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0], [0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1], [1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1], [1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0], [1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1], [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0], [1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1], [0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0], [0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1], [0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1], [1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1], [0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0], [1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1], [0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1], [0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0], [1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1], [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0], [0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1], [1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0], [0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0], [0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0], [0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0]], [[8, 14, 19, 21, 33, 35, 37, 40, 44, 49, 52, 68, 68, 72, 77, 80, 86, 88, 88, 99], [10, 12, 18, 18, 25, 27, 30, 32, 32, 42, 46, 47, 48, 53, 67, 69, 70, 84, 85, 89], [12, 15, 18, 24, 26, 33, 41, 45, 55, 71, 73, 79, 82, 87, 88, 88, 89, 91, 92, 98], [1, 1, 11, 16, 24, 24, 27, 42, 49, 50, 69, 69, 72, 73, 75, 80, 80, 82, 95, 96], [1, 6, 12, 13, 14, 22, 28, 30, 39, 51, 53, 66, 68, 68, 69, 77, 86, 90, 96, 99], [2, 6, 24, 26, 28, 32, 32, 37, 38, 54, 56, 61, 64, 64, 68, 71, 71, 76, 79, 86], [22, 31, 32, 34, 39, 47, 54, 57, 59, 61, 62, 72, 72, 74, 79, 79, 80, 85, 91, 93], [3, 7, 12, 13, 15, 16, 21, 26, 26, 36, 56, 60, 62, 63, 64, 66, 67, 71, 76, 83], [3, 22, 29, 30, 34, 35, 36, 39, 41, 42, 43, 51, 57, 58, 72, 72, 80, 84, 88, 92], [9, 14, 17, 29, 34, 37, 38, 39, 40, 46, 46, 52, 62, 68, 77, 78, 79, 92, 93, 95], [1, 17, 17, 18, 19, 23, 26, 27, 36, 37, 48, 53, 56, 62, 62, 68, 69, 78, 78, 84], [20, 20, 22, 33, 33, 33, 43, 48, 60, 63, 64, 70, 77, 80, 80, 85, 87, 88, 91, 94], [7, 10, 10, 13, 14, 14, 23, 42, 64, 65, 65, 72, 73, 74, 75, 76, 77, 78, 79, 91], [1, 4, 9, 12, 13, 13, 23, 23, 27, 33, 34, 34, 37, 40, 43, 63, 67, 70, 87, 96], [1, 2, 8, 11, 12, 14, 14, 23, 24, 33, 44, 45, 47, 55, 78, 79, 83, 98, 98, 99], [3, 9, 18, 21, 24, 28, 34, 35, 45, 46, 59, 60, 60, 63, 64, 84, 95, 96, 97, 97], [4, 11, 17, 19, 20, 20, 20, 30, 31, 41, 45, 47, 64, 68, 76, 81, 83, 89, 93, 93], [2, 8, 10, 21, 38, 40, 43, 44, 47, 52, 55, 71, 75, 80, 85, 85, 89, 92, 94, 99], [3, 7, 13, 14, 27, 28, 29, 30, 44, 47, 50, 53, 55, 64, 64, 75, 79, 86, 98, 99], [10, 10, 10, 16, 17, 33, 44, 52, 53, 57, 59, 64, 65, 74, 75, 76, 80, 87, 90, 90]], [[-78, 34, -74, 16, -10, -10, -14, 28], [-22, -84, 48, -20, 2, 86, 88, -60], [32, 16, 98, 30, -10, 48, 82, 56], [48, -32, -76, -54, 36, 56, 6, 82], [6, -20, 64, 56, 6, -28, 30, -72], [-32, -48, 10, 26, 40, -8, -26, -54], [-68, -36, -86, -12, -6, 62, -90, 26], [-76, 80, 44, -82, 92, -12, -56, -8]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [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, 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], [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], [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, 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], [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, 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], [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, 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], [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, 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], [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], [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, 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], [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]], [[76, 57, 99, 99, 95, 61, 64, 17, 58, 47], [52, 18, 37, 70, 17, 3, 33, 84, 80, 7], [2, 34, 4, 49, 17, 71, 12, 76, 74, 44], [89, 49, 69, 17, 38, 56, 61, 75, 86, 84], [32, 56, 87, 23, 66, 67, 97, 5, 23, 51], [25, 24, 30, 51, 30, 72, 46, 57, 29, 85], [80, 62, 87, 29, 37, 90, 88, 40, 55, 26], [27, 75, 51, 91, 22, 65, 38, 91, 1, 15], [11, 56, 38, 93, 54, 94, 23, 90, 37, 51], [61, 82, 79, 22, 66, 55, 67, 26, 93, 93]]]; int [] param1 = [45, 8, 18, 8, 9, 18, 15, 7, 17, 6]; 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); } " LEXICOGRAPHICAL_CONCATENATION_SUBSTRINGS_STRING,"static String f_filled ( String s ) { int n = s . length ( ) ; int sub_count = n * ( n + 1 ) / 2 ; String [ ] arr = new String [ sub_count ] ; int index = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int len = 1 ; len <= n - i ; len ++ ) { arr [ index ++ ] = s . substring ( i , i + len ) ; } Arrays . sort ( arr ) ; String res = """" ; for ( int i = 0 ; i < sub_count ; i ++ ) res += arr [ i ] ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""ggogoiooiiqqgqgoqgoissqsqgsqgosqgoi"", ""04484854858485805585808888084848848584858848580858588580"", ""00000000000000010010010011001100110001100001100100111001110001110000111001001110011001110011000111001100001110011001010101010100100010010100110100111010011100100111000100111001010011100110100111001100100111001100010011100110010110110110011000110010111011100111000111001011100110111001100111001100011100110011111111101010100100100100110011001100111001110011010011001001100110011110011101001110010011100110011100111001110011010011100110010011100110011111111101101100110011001110011100111100110110011001100110011111110111001110011110011111001101110011001110011001"", ""ikkmkmekmeikmeiiuukukmukmeukmeiukmeiiwwxwxuwxukwxukmwxukmewxukmeiwxukmeiixxuxukxukmxukmexukmeixukmeiizzhzhwzhwxzhwxuzhwxukzhwxukmzhwxukmezhwxukmeizhwxukmeiieeieiihhwhwxhwxuhwxukhwxukmhwxukmehwxukmeihwxukmeiiiiimmemeimeii"", ""00909109170917209172909172960917296509172965409172965410917296541209172965412809172965412851112128128517172172917296172965172965417296541172965412172965412817296541285222828529296296529654296541296541229654128296541285441412412841285555454154125412854128566565465416541265412865412857727297296729657296547296541729654127296541287296541285885999191791729172991729691729659172965491729654191729654129172965412891729654128596965965496541965412965412896541285"", ""00000000000010011001110011110011111001111100011111000101010100100010010100110100111010011110100111110100111110010011111000110110110011010110100110100011010010110100110110100111011010011110110100111110110100111110011010011111000111011110111110111110011111001111111110101010010010011001110011110011111001111110011111010011111001011010101001010011010011101001111010011111010011111101001111101010011111001111111111110110110011011101011010011010011101001111010011111010011111101001111111010011111011010011111001111111111110111001111111111110111100111111111101111100"", "" k krpp p kp krrjjpjp jp kjp krkkrttjtjptjp tjp ktjp kr"", ""00779999909079999999909907999999999099907999999990999907"", ""00000010110111011100111001111010011111101100111111011100"", ""hhnhnshnsjhnsjohnsjouhnsjoujjjjojoujoujjpjphjphnjphnsjphnsjjphnsjojphnsjoujphnsjoujnnsnsjnsjonsjounsjoujoououjpphphnphnsphnsjphnsjophnsjouphnsjoujssjsjosjousjoujuujjqqjqjpqjphqjphnqjphnsqjphnsjqjphnsjoqjphnsjouqjphnsjouj""]; string [] param0 = [""sqgoi"", ""848580"", ""01001110011001"", ""zhwxukmeii"", ""0917296541285"", ""01101001111100"", ""tjp kr"", ""999907"", ""011100"", ""qjphnsjouj""]; 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); } " HORNERS_METHOD_POLYNOMIAL_EVALUATION,"static int f_filled ( int poly [ ] , int n , int x ) { int result = poly [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) result = result * x + poly [ i ] ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [837, 537, 40, 1]; int [] [] param0 = [[3, 4, 5], [6, 7, 8, 9], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [1]]; int [] param1 = [3, 4, 11, 1]; int [] param2 = [16, 4, 3, 26]; 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_POINTS_INTERSECTION_N_CIRCLES,"static int f_filled ( int n ) { return n * ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [870, 600, 4692, 1482, 182, 3540, 7832, 702, 812, 812]; int [] param0 = [30, 25, 69, 39, 14, 60, 89, 27, 29, 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); } " HOW_CAN_WE_SUM_THE_DIGITS_OF_A_GIVEN_NUMBER_IN_SINGLE_STATEMENT,"static int f_filled ( int n ) { int sum = 0 ; while ( n != 0 ) { sum = sum + n % 10 ; n = n / 10 ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [12, 3, 2, 10, 16, 8, 8, 13, 4, 10]; int [] param0 = [57, 21, 11, 64, 88, 62, 17, 49, 22, 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); } " MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { Set < Integer > s = new HashSet < > ( ) ; int first = 0 , second = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ! s . contains ( arr [ i ] ) ) { s . add ( arr [ i ] ) ; continue ; } if ( arr [ i ] > first ) { second = first ; first = arr [ i ] ; } else if ( arr [ i ] > second ) second = arr [ i ] ; } return ( first * second ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2397, 0, 1, 0, 0, 1, 0, 0, 0, 0]; int [] [] param0 = [[4, 6, 7, 8, 12, 13, 14, 15, 18, 18, 19, 19, 26, 26, 32, 32, 33, 34, 34, 36, 41, 43, 47, 47, 51, 51, 52, 53, 55, 56, 57, 60, 61, 71, 74, 75, 76, 77, 79, 87, 87, 87, 90, 95, 98, 99], [-64, -72, 6, -62, 54, 14, 28, 60, -96, 14, -32, -2, 80, 8, -56, 68, 86, 64, 86, -12, 82], [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], [99, 7, 14, 50, 94, 24, 79, 13, 19, 29, 22, 2, 77, 36, 38, 18, 51, 15, 99, 52, 17, 77, 22, 54], [-96, -92, -86, -84, -84, -80, -70, -70, -68, -64, -64, -48, -46, -24, -22, -20, -8, -8, 0, 0, 4, 8, 8, 22, 28, 36, 46, 50, 52, 54, 60, 62, 66, 70, 80, 84, 86, 94, 96, 96], [1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1], [98], [-88, -24, 8, 20, -46, 60, 24, 26, 98, 82, -30, 16, 22, -28, 84, 12, 34, 14, -18, -38, -94, -24, 6, 4, -52, -48, 84], [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], [6, 30, 47, 97, 20, 16, 68, 34, 1, 77, 48, 8, 22, 68]]; int [] param1 = [37, 12, 27, 15, 25, 12, 0, 21, 21, 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); } " HOW_TO_AVOID_OVERFLOW_IN_MODULAR_MULTIPLICATION,"static long f_filled ( long a , long b , long mod ) { long res = 0 ; a = a % mod ; while ( b > 0 ) { if ( b % 2 == 1 ) { res = ( res + a ) % mod ; } a = ( a * 2 ) % mod ; b /= 2 ; } return res % mod ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [25, 3, 1, 35, 6, 5, 20, 4, 9, 45]; long [] param0 = [99, 11, 51, 49, 9, 90, 19, 17, 54, 5]; long [] param1 = [75, 4, 37, 51, 34, 85, 96, 96, 3, 69]; long [] param2 = [40, 41, 23, 88, 30, 55, 41, 37, 51, 60]; 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); } " HOW_TO_CHECK_IF_A_GIVEN_ARRAY_REPRESENTS_A_BINARY_HEAP,"static boolean f_filled ( int arr [ ] , int i , int n ) { if ( i > ( n - 2 ) / 2 ) { return true ; } if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_filled ( arr , 2 * i + 1 , n ) && f_filled ( arr , 2 * i + 2 , n ) ) { return true ; } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, false, true, true, false, true, true, true]; int [] [] param0 = [[1, 2, 3, 5, 24, 24, 25, 25, 36, 37, 37, 39, 42, 44, 46, 50, 51, 54, 56, 60, 62, 70, 71, 73, 75, 80, 80, 85, 86, 89, 91, 95, 99], [-44, -58, 88, -42, 42, -14, -44, 42, 64, 94, -46, -70, 34, -10, -46, -52, -6, -78, 64, 56, 74, 98, -34, -4, -92, 6, -52, -20, 78, -72, -40], [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], [10, 2, 1, 34, 21, 37, 49, 31, 70, 97, 87, 50, 76, 55], [-94, -84, -82, -66, -64, -62, -56, -38, -24, -24, -4, 2, 4, 4, 8, 14, 16, 20, 30, 34, 34, 48, 58, 58, 70, 76, 78, 86, 88, 96, 98], [1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0], [5, 20, 30, 5, 10, 21, 5], [50, 20, 30, 5, 10, 21, 5], [50, 20, 30, 5, 10, 21, 5], [50, 20, 30, 5, 10, 21, 5]]; int [] param1 = [0, 0, 0, 0, 29, 12, 0, 0, 2, 4]; int [] param2 = [18, 27, 20, 8, 26, 11, 7, 7, 7, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " K_TH_MISSING_ELEMENT_INCREASING_SEQUENCE_NOT_PRESENT_GIVEN_SEQUENCE,"static int f_filled ( int a [ ] , int b [ ] , int k , int n1 , int n2 ) { LinkedHashSet < Integer > s = new LinkedHashSet < > ( ) ; for ( int i = 0 ; i < n2 ; i ++ ) s . add ( b [ i ] ) ; int missing = 0 ; for ( int i = 0 ; i < n1 ; i ++ ) { if ( ! s . contains ( a [ i ] ) ) missing ++ ; if ( missing == k ) return a [ i ] ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, -1, 37, -1, -1, 87, -82, -1, -1]; int [] [] param0 = [[2, 9, 9, 13, 38, 41, 50, 59, 64, 64, 72, 78, 79, 80, 84, 92, 94, 98, 99], [-54, -80, -62, 98, -68, 42, 98, 80, -8, -6, 26, 0, -60, -24, -74, -48, 4, -54, 20, 32, 42, 68, -50, 58, -50, 96, -34, 22, 56, -60, -10, -18, 80, 20, -50], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [85, 44, 60, 86, 26, 22, 95, 47, 43, 24, 30, 37, 22, 33, 6, 56], [-32, -18, 2, 54, 72, 92, 94], [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0], [3, 9, 13, 14, 16, 19, 20, 21, 23, 26, 27, 27, 28, 29, 31, 36, 37, 38, 41, 42, 45, 46, 52, 56, 63, 65, 70, 70, 72, 72, 76, 77, 78, 78, 79, 82, 83, 86, 87, 87, 90, 93, 93, 94, 96, 96, 97, 98], [-82, -62], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [26, 5, 60, 53, 35]]; int [] [] param1 = [[5, 9, 11, 21, 24, 27, 30, 35, 38, 39, 40, 45, 48, 48, 51, 58, 61, 91, 92], [90, -86, -82, 92, -42, -34, 10, -28, -78, 8, 66, 96, -16, -22, -68, -36, -72, 84, -54, -44, -80, -30, 64, 10, -60, -90, 22, 54, -88, 74, -56, 22, -24, -52, 82], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [66, 76, 38, 91, 57, 50, 12, 21, 90, 17, 18, 78, 23, 12, 90, 81], [-76, -68, -34, -24, 8, 12, 32], [0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0], [2, 5, 6, 7, 9, 11, 11, 13, 17, 18, 20, 20, 26, 27, 35, 35, 36, 37, 41, 42, 45, 46, 48, 49, 50, 50, 54, 54, 56, 60, 62, 63, 65, 67, 68, 68, 70, 72, 74, 74, 78, 79, 80, 80, 86, 89, 97, 99], [48, 32], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [41, 80, 35, 14, 47]]; int [] param2 = [11, 24, 15, 12, 6, 29, 27, 1, 10, 3]; int [] param3 = [9, 24, 15, 14, 3, 29, 39, 1, 14, 2]; int [] param4 = [18, 21, 11, 10, 5, 37, 28, 1, 12, 3]; 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); } " RECURSIVELY_BREAK_NUMBER_3_PARTS_GET_MAXIMUM_SUM,"static int f_filled ( int n ) { if ( n == 0 || n == 1 ) return n ; return Math . max ( ( f_filled ( n / 2 ) + f_filled ( n / 3 ) + f_filled ( n / 4 ) ) , n ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [41, 87, 7, 87, 57, 19, 63, 17, 41, 5]; int [] param0 = [39, 79, 7, 76, 48, 18, 58, 17, 36, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " HYPERCUBE_GRAPH,"static int f_filled ( int n ) { if ( n == 1 ) return 2 ; return 2 * f_filled ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [536870912, 268435456, 33554432, 4194304, 524288, 65536, 8192, 1024, 128, 16]; int [] param0 = [29, 28, 25, 22, 19, 16, 13, 10, 7, 4]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_TO_FIND_THE_AREA_OF_PENTAGON,"static float f_filled ( float a ) { float area ; area = ( float ) ( Math . sqrt ( 5 * ( 5 + 2 * ( Math . sqrt ( 5 ) ) ) ) * a * a ) / 4 ; return area ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [6944120.6857642615, 3771147.371815937, 220240.9998483103, 111222537.30911414, 25130647.008061722, 80508515.3102342, 4532163.809416133, 162347573.54592204, 26389745.561382204, 770176.1075446572]; float [] param0 = [2009.019461888707, -1480.5131394215787, 357.7870347569567, -8040.293697508038, 3821.882657293133, -6840.635072240347, 1623.036598830132, -9714.00706195298, 3916.454769669618, -669.068424712943]; 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); } " K_TH_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY,"static int f_filled ( int arr [ ] , int n , int k ) { int dist_count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break ; if ( j == n ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [89, -32, -1, -1, 44, -1, -1, -1, -1, 65]; int [] [] param0 = [[2, 3, 8, 18, 20, 33, 53, 56, 60, 71, 76, 80, 81, 87, 88, 89, 92, 95], [-78, 6, 32, 52, -12, -32, 22, -40, -82, 24, 30, 10, -40], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [3, 28, 55, 21, 42, 60, 96, 83, 98, 75, 29, 73, 51, 21, 27, 65, 19, 47, 12, 81, 19, 94, 50, 43, 21, 32, 52, 44, 52, 91, 49, 59, 52, 10, 75, 86, 46, 43, 3, 49, 70, 60, 77, 99, 27, 63], [-96, -90, -76, -44, -16, -8, 0, 0, 2, 2, 8, 14, 16, 18, 18, 20, 20, 28, 34, 44, 68, 74, 84, 90], [0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0], [3, 4, 5, 8, 9, 15, 26, 26, 26, 35, 39, 40, 42, 43, 45, 45, 48, 52, 54, 56, 57, 67, 74, 77, 79, 80, 81, 86, 87, 92, 95, 97], [-76, -24, -12, 66, -40, 26, 72, 46, -56, 58, -68, 2, -82], [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], [29, 83, 32, 75, 5, 22, 68, 64, 36, 18, 7, 63, 16, 42, 77, 61, 1, 26, 12, 41, 67, 85, 85, 35, 94, 18, 14, 65, 8, 55, 44, 34, 48, 23, 8, 27, 86, 2, 51, 91]]; int [] param1 = [16, 8, 7, 40, 23, 10, 26, 6, 27, 28]; int [] param2 = [16, 6, 5, 39, 12, 8, 24, 10, 17, 24]; 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_DISTINCT_OR_NON_REPEATING_ELEMENT_IN_AN_ARRAY_1,"static int f_filled ( int arr [ ] , int n , int k ) { Map < Integer , Integer > h = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( h . containsKey ( arr [ i ] ) ) h . put ( arr [ i ] , h . get ( arr [ i ] ) + 1 ) ; else h . put ( arr [ i ] , 1 ) ; } if ( h . size ( ) < k ) return - 1 ; int dist_count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( h . get ( arr [ i ] ) == 1 ) dist_count ++ ; if ( dist_count == k ) return arr [ i ] ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [73, -1, -1, 6, -1, -1, 79, -1, -1, 45]; int [] [] param0 = [[17, 25, 27, 27, 73, 91], [-86, -74, -88, 28, -32, 20, -34, 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, 1, 1], [5, 11, 36, 27, 6, 24, 58, 44, 14, 68], [-98, -98, -94, -92, -86, -86, -70, -66, -64, -64, -58, -52, -46, -44, -44, -38, -38, -28, -24, -12, -10, -4, -2, 2, 8, 10, 12, 20, 22, 26, 26, 36, 42, 52, 54, 60, 60, 68, 82, 82, 92, 98], [0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1], [3, 8, 9, 10, 10, 13, 14, 16, 18, 23, 24, 25, 27, 28, 30, 33, 36, 39, 42, 42, 44, 45, 45, 48, 52, 52, 55, 55, 59, 59, 59, 60, 61, 61, 66, 66, 67, 68, 71, 72, 75, 76, 79, 80, 94, 94], [-12, 56, -48, 52, -96, -84, 32, -12, -6, 82, 70, 18, 66, -6, -22, -46, -54, 18, -14, -32, 68, 82, -44, -42, 10, 56, 8, -56, 24, 20, -38, 30, -52, -66, 82, -64, 68, -82, 52, -88, -34, -26, 94, 58, -4, -84, -60], [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, 23, 75, 84, 28, 34, 15, 13, 51, 69, 94, 45, 38, 38]]; int [] param1 = [5, 5, 33, 7, 27, 27, 44, 37, 22, 13]; int [] param2 = [3, 6, 32, 5, 27, 20, 26, 46, 21, 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); } " PROGRAM_CIRCUMFERENCE_PARALLELOGRAM,"static float f_filled ( float a , float b ) { return ( ( 2 * a ) + ( 2 * b ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [2515.4971893573984, -22592.18785519679, 27237.242036312673, -26538.168540307313, 15509.335106518702, -16933.889441987998, 26208.62444090405, -18155.585669713404, 19258.60615615351, -26966.87935977597]; float [] param0 = [801.0366882228715, -7069.610056819919, 7723.966966568705, -7935.859205856963, 6094.247432557289, -7371.490363309265, 8368.473889617526, -3761.921143166053, 3139.1089185587884, -5218.286665567171]; float [] param1 = [456.71190645582783, -4226.483870778477, 5894.65405158763, -5333.225064296693, 1660.420120702062, -1095.4543576847332, 4735.838330834498, -5315.871691690649, 6490.194159517967, -8265.153014320813]; 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); } " MODULUS_TWO_FLOAT_DOUBLE_NUMBERS,"static double f_filled ( double a , double b ) { if ( a < 0 ) a = - a ; if ( b < 0 ) b = - b ; double mod = a ; while ( mod >= b ) mod = mod - b ; if ( a < 0 ) return - mod ; return mod ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [3243.229719038493, 4362.665881044217, 2008.6661365619666, 911.5074141984414, 3569.942027998315, 56.49596323882673, 368.98245607783906, 2856.1752826258803, 108.4901262723597, 1722.873699288031]; double [] param0 = [3243.229719038493, -4362.665881044217, 7255.066257575837, -6929.554320261099, 3569.942027998315, -6513.849053096595, 7333.183189243961, -2856.1752826258803, 9787.228111241662, -1722.873699288031]; double [] param1 = [5659.926861939672, -9196.507113304497, 2623.200060506935, -3009.0234530313287, 6920.809419868375, -70.95992406437102, 580.3500610971768, -9625.97442825802, 2419.6844962423256, -8370.700544254058]; 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_SUBSEQUENCE_LEAST_K_DISTANT_ELEMENTS,"static int f_filled ( int arr [ ] , int N , int k ) { int MS [ ] = new int [ N ] ; MS [ N - 1 ] = arr [ N - 1 ] ; for ( int i = N - 2 ; i >= 0 ; i -- ) { if ( i + k + 1 >= N ) MS [ i ] = Math . max ( arr [ i ] , MS [ i + 1 ] ) ; else MS [ i ] = Math . max ( arr [ i ] + MS [ i + k + 1 ] , MS [ i + 1 ] ) ; } return MS [ 0 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [98, 90, 0, 96, 26, 1, 72, 80, 1, 155]; int [] [] param0 = [[3, 5, 20, 21, 23, 26, 27, 31, 33, 38, 39, 41, 48, 48, 50, 51, 56, 57, 64, 68, 69, 70, 71, 74, 76, 86, 97], [32, 34, -40, 90, -82, -70, 30, 26, -76, -46, -84, 76, -76], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [96, 15, 30, 25, 83], [-90, -82, -80, -76, -62, -58, -50, -48, -46, -38, -38, -38, -38, -38, -34, -32, -24, -22, -16, -16, -4, -2, 10, 10, 20, 26, 26, 32, 38, 38, 44, 44, 46, 48, 58, 62, 64, 66, 76, 78, 78, 82, 92, 96, 96, 98], [1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0], [1, 2, 9, 17, 24, 31, 31, 33, 56, 57, 61, 71, 73, 74, 76, 77, 79, 83, 86, 95, 99], [-12, 52, -44, 80, -66, 34, 42, -46, 8, 12, -22, -56, 74, -98, -44, 2, -24, -14, -54, -56, -26, -18, -72], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [65, 1, 34, 38, 15, 6, 55, 21, 32, 90, 39, 25, 43, 48, 64, 66, 88, 70, 82, 75, 25, 56, 23, 27, 41, 33, 33, 55, 60, 90, 41, 58, 42, 53, 38, 90, 7, 15]]; int [] param1 = [23, 9, 22, 2, 27, 9, 12, 13, 13, 37]; int [] param2 = [15, 10, 34, 3, 30, 9, 10, 19, 13, 33]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " K_TH_PRIME_FACTOR_GIVEN_NUMBER,"static int f_filled ( int n , int k ) { while ( n % 2 == 0 ) { k -- ; n = n / 2 ; if ( k == 0 ) return 2 ; } for ( int i = 3 ; i <= Math . sqrt ( n ) ; i = i + 2 ) { while ( n % i == 0 ) { if ( k == 1 ) return i ; k -- ; n = n / i ; } } if ( n > 2 && k == 1 ) return n ; return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 3, 2, 3, 3, -1, -1, -1, -1, -1]; int [] param0 = [94, 99, 64, 27, 24, 84, 69, 69, 22, 39]; int [] param1 = [0, 1, 3, 3, 4, 6, 98, 39, 60, 57]; 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); } " LARGEST_SUBARRAY_WITH_EQUAL_NUMBER_OF_0S_AND_1S_1,"static int f_filled ( int arr [ ] , int n ) { HashMap < Integer , Integer > hM = new HashMap < Integer , Integer > ( ) ; int sum = 0 ; int max_len = 0 ; int ending_index = - 1 ; int start_index = 0 ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = ( arr [ i ] == 0 ) ? - 1 : 1 ; } for ( int i = 0 ; i < n ; i ++ ) { sum += arr [ i ] ; if ( sum == 0 ) { max_len = i + 1 ; ending_index = i ; } if ( hM . containsKey ( sum + n ) ) { if ( max_len < i - hM . get ( sum + n ) ) { max_len = i - hM . get ( sum + n ) ; ending_index = i ; } } else hM . put ( sum + n , i ) ; } for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1 ; } int end = ending_index - max_len + 1 ; System . out . println ( end + "" to "" + ending_index ) ; return max_len ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 10, 0, 0, 0, 0, 2, 2, 0]; int [] [] param0 = [[1, 1, 1, 1, 1, 1, 1, 1, 1, 42, 60, 66, 69, 70, 70, 73, 74, 80, 99], [1, -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, 1, 1, 1, 1, 1, 26, 44, 32], [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, 72, 74, 86, 92, 94], [1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 64, 86], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, -68, 12, -44, 62, 60, -34, -52, 18], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [1, 1, 1, 1, 1, 1, 1, 1, 53]]; int [] param1 = [9, 1, 19, 8, 34, 4, 1, 17, 9, 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); } " LARGEST_SUBSEQUENCE_GCD_GREATER_1,"static int f_filled ( int arr [ ] , int n ) { int ans = 0 ; int maxele = Arrays . stream ( arr ) . max ( ) . getAsInt ( ) ; ; for ( int i = 2 ; i <= maxele ; ++ i ) { int count = 0 ; for ( int j = 0 ; j < n ; ++ j ) { if ( arr [ j ] % i == 0 ) ++ count ; } ans = Math . max ( ans , count ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [16, 10, 0, 4, 40, 0, 10, 9, 0, 8]; int [] [] param0 = [[10, 18, 22, 22, 22, 29, 30, 32, 33, 34, 37, 39, 40, 41, 44, 47, 49, 50, 50, 51, 53, 67, 69, 70, 71, 71, 73, 75, 78, 80, 81, 82, 91, 91, 93, 97, 97, 99], [-42, 62, 6, 98, 38, -4, -38, 72, 42, 4, -22, -94, 78, -90, 14], [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], [89, 92, 96, 71, 24, 27, 18, 19, 41, 1, 45, 8], [-98, -94, -92, -90, -82, -80, -76, -76, -72, -62, -60, -58, -56, -52, -42, -36, -32, -32, -24, -22, -20, -10, -10, -10, -8, -2, -2, 0, 2, 4, 6, 6, 8, 10, 14, 18, 22, 26, 30, 46, 46, 62, 68, 74, 78, 82, 86, 86], [1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1], [4, 8, 10, 10, 11, 17, 18, 25, 32, 33, 34, 37, 40, 41, 44, 47, 47, 52, 63, 77, 85, 87, 89, 89, 91, 95, 96, 98], [-86, 52, -48, 70, 10, -94, 16, 14, 38, 62], [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], [95, 32, 87, 37, 86, 71, 30, 88, 96, 52, 88, 92, 79, 86, 19, 5, 74, 67]]; int [] param1 = [35, 10, 23, 7, 40, 41, 23, 9, 30, 13]; 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); } " LCS_FORMED_CONSECUTIVE_SEGMENTS_LEAST_LENGTH_K,"static int f_filled ( int k , String s1 , String s2 ) { int n = s1 . length ( ) ; int m = s2 . length ( ) ; int lcs [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ; int cnt [ ] [ ] = new int [ n + 1 ] [ m + 1 ] ; for ( int i = 1 ; i <= n ; i ++ ) { for ( int j = 1 ; j <= m ; j ++ ) { lcs [ i ] [ j ] = Math . max ( lcs [ i - 1 ] [ j ] , lcs [ i ] [ j - 1 ] ) ; if ( s1 . charAt ( i - 1 ) == s2 . charAt ( j - 1 ) ) cnt [ i ] [ j ] = cnt [ i - 1 ] [ j - 1 ] + 1 ; if ( cnt [ i ] [ j ] >= k ) { for ( int a = k ; a <= cnt [ i ] [ j ] ; a ++ ) lcs [ i ] [ j ] = Math . max ( lcs [ i ] [ j ] , lcs [ i - a ] [ j - a ] + a ) ; } } } return lcs [ n ] [ m ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 2, 7, 5, 0, 5, 4, 3, 3, 0]; int [] param0 = [4, 2, 3, 5, 2, 3, 3, 1, 2, 2]; string [] param1 = [""aggayxysdfa"", ""55571659965107"", ""01011011100"", ""aggasdfa"", ""5710246551"", ""0100010"", ""aabcaaaa"", ""1219"", ""111000011"", ""wic od""]; string [] param2 = [""aggajxaaasdfa"", ""390286654154"", ""0000110001000"", ""aggajasdfaxy"", ""79032504084062"", ""10100000"", ""baaabcd"", ""3337119582"", ""011"", ""csiugouwe""]; 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_CHARACTERS_ADDED_FRONT_MAKE_STRING_PALINDROME,"static boolean f_filled ( String s ) { int l = s . length ( ) ; for ( int i = 0 , j = l - 1 ; i <= j ; i ++ , j -- ) { if ( s . charAt ( i ) != s . charAt ( j ) ) { return false ; } } return true ; }","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); } " PROGRAM_COUNT_OCCURRENCE_GIVEN_CHARACTER_STRING,"static int f_filled ( String s , char c ) { int res = 0 ; for ( int i = 0 ; i < s . length ( ) ; i ++ ) { if ( s . charAt ( i ) == c ) res ++ ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 3, 1, 1, 0, 0, 0, 0, 1, 0]; string [] param0 = [""mhjnkfd"", ""716662107"", ""01"", ""wphsxibnhakgro"", ""721106"", ""111"", ""tibfu"", ""0"", ""10"", ""lqq""]; char [] param1 = ['l', '6', '1', 'n', '8', '0', 'q', '3', '0', 'd']; 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_COST_SORT_MATRIX_NUMBERS_0_N2_1,"static int f_filled ( int mat [ ] [ ] , int n ) { int i_des , j_des , q ; int tot_energy = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = 0 ; j < n ; j ++ ) { q = mat [ i ] [ j ] / n ; i_des = q ; j_des = mat [ i ] [ j ] - ( n * q ) ; tot_energy += Math . abs ( i_des - i ) + Math . abs ( j_des - j ) ; } } return tot_energy ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2436, 0, 14929, 18771, 5844, 41068, 147, 231, 41068, 19143]; int [] [] [] param0 = [[[4, 7, 10, 11, 14, 22, 27, 43, 45, 47, 48, 48, 49, 49, 51, 54, 56, 57, 59, 62, 63, 64, 66, 79, 82, 83, 87, 96, 97, 97, 98], [1, 1, 10, 13, 14, 18, 31, 33, 35, 37, 37, 42, 43, 44, 46, 54, 60, 61, 63, 63, 67, 67, 74, 76, 81, 83, 88, 91, 91, 96, 97], [2, 3, 4, 10, 11, 13, 17, 27, 30, 35, 35, 38, 39, 44, 47, 52, 52, 60, 61, 65, 68, 69, 71, 75, 76, 76, 85, 93, 94, 94, 98], [3, 5, 5, 19, 22, 23, 24, 24, 27, 31, 31, 32, 32, 44, 46, 50, 52, 54, 55, 57, 58, 59, 61, 61, 68, 72, 76, 78, 79, 85, 98], [7, 10, 14, 15, 21, 28, 30, 31, 40, 46, 51, 51, 52, 54, 57, 58, 58, 64, 67, 68, 68, 71, 72, 76, 79, 80, 85, 88, 88, 91, 93], [2, 5, 18, 21, 21, 25, 28, 31, 33, 34, 37, 38, 42, 45, 47, 56, 64, 70, 71, 75, 76, 78, 78, 81, 84, 88, 90, 91, 98, 98, 99], [10, 11, 14, 17, 18, 22, 27, 35, 36, 37, 46, 53, 55, 59, 59, 64, 66, 66, 66, 69, 69, 73, 73, 74, 74, 85, 86, 87, 89, 93, 99], [11, 13, 13, 14, 17, 18, 19, 19, 21, 25, 25, 29, 36, 36, 42, 43, 45, 49, 57, 61, 64, 65, 71, 75, 84, 84, 89, 94, 94, 95, 98], [1, 1, 2, 2, 10, 10, 21, 22, 23, 24, 24, 29, 34, 40, 46, 48, 49, 49, 50, 60, 73, 73, 75, 80, 81, 85, 86, 93, 96, 97, 99], [1, 2, 10, 15, 16, 18, 19, 21, 23, 25, 29, 29, 31, 31, 32, 38, 42, 43, 48, 51, 54, 56, 63, 74, 74, 74, 88, 88, 94, 94, 94], [19, 24, 25, 27, 29, 33, 34, 35, 36, 37, 37, 44, 45, 50, 51, 51, 52, 54, 59, 59, 66, 69, 70, 75, 77, 80, 81, 84, 97, 99, 99], [1, 2, 5, 5, 7, 12, 17, 19, 20, 38, 44, 45, 47, 48, 51, 55, 59, 61, 61, 64, 65, 67, 74, 76, 76, 77, 79, 83, 86, 92, 92], [3, 5, 5, 12, 18, 23, 25, 38, 38, 48, 49, 57, 61, 63, 67, 70, 71, 75, 75, 77, 78, 79, 80, 80, 84, 87, 92, 92, 95, 96, 98], [1, 3, 3, 5, 7, 8, 9, 13, 17, 21, 23, 36, 38, 39, 39, 41, 45, 57, 71, 72, 72, 73, 76, 79, 80, 82, 83, 87, 89, 97, 99], [9, 10, 13, 14, 14, 16, 17, 23, 26, 27, 28, 31, 32, 38, 38, 43, 45, 50, 51, 52, 52, 64, 66, 68, 71, 78, 85, 85, 85, 91, 91], [1, 2, 2, 3, 10, 12, 13, 15, 15, 21, 25, 26, 28, 34, 45, 45, 46, 46, 49, 49, 52, 55, 57, 61, 62, 63, 70, 72, 73, 84, 86], [5, 5, 8, 13, 16, 18, 21, 25, 29, 33, 35, 36, 39, 45, 46, 47, 49, 58, 66, 68, 70, 71, 77, 80, 83, 83, 86, 87, 94, 97, 98], [5, 9, 17, 20, 24, 27, 27, 27, 28, 30, 32, 32, 35, 39, 40, 43, 45, 52, 55, 56, 63, 71, 76, 78, 81, 86, 90, 95, 97, 98, 98], [1, 6, 6, 7, 15, 22, 29, 33, 38, 38, 42, 42, 44, 45, 53, 59, 61, 62, 62, 72, 75, 76, 77, 77, 80, 81, 89, 96, 96, 97, 99], [3, 4, 4, 10, 11, 12, 16, 17, 32, 33, 33, 36, 40, 40, 42, 42, 44, 45, 47, 52, 53, 56, 59, 62, 64, 67, 80, 80, 89, 90, 94], [2, 3, 8, 9, 15, 19, 20, 21, 22, 23, 23, 24, 24, 28, 28, 32, 36, 40, 43, 46, 54, 55, 65, 71, 76, 83, 86, 93, 93, 96, 97], [2, 3, 3, 4, 8, 11, 13, 14, 18, 19, 20, 22, 35, 39, 45, 60, 61, 64, 66, 69, 70, 70, 72, 72, 74, 75, 79, 83, 87, 90, 97], [19, 21, 22, 23, 24, 28, 30, 30, 32, 41, 42, 54, 56, 60, 62, 65, 71, 72, 72, 73, 75, 75, 78, 84, 85, 85, 85, 85, 87, 89, 92], [6, 7, 10, 11, 11, 16, 17, 20, 20, 23, 31, 33, 34, 36, 38, 42, 44, 48, 56, 57, 58, 63, 64, 69, 69, 70, 72, 81, 85, 89, 91], [9, 11, 13, 18, 21, 22, 24, 26, 26, 30, 35, 42, 51, 53, 55, 55, 58, 58, 59, 59, 61, 63, 67, 75, 79, 88, 88, 92, 96, 98, 99], [9, 12, 14, 17, 21, 21, 32, 35, 38, 39, 41, 43, 45, 45, 45, 55, 57, 57, 63, 67, 71, 72, 74, 75, 76, 77, 78, 83, 83, 85, 97], [3, 4, 13, 17, 20, 22, 28, 32, 36, 38, 39, 39, 52, 56, 60, 60, 61, 61, 62, 64, 65, 69, 71, 73, 82, 88, 91, 96, 96, 97, 99], [2, 2, 13, 14, 15, 19, 25, 32, 33, 34, 37, 38, 41, 45, 45, 53, 57, 59, 59, 60, 68, 71, 78, 80, 81, 84, 93, 93, 95, 99, 99], [5, 16, 17, 18, 18, 24, 27, 27, 32, 35, 41, 41, 49, 51, 56, 60, 60, 62, 67, 67, 71, 78, 78, 79, 82, 89, 92, 92, 95, 97, 98], [6, 7, 9, 10, 10, 12, 16, 19, 19, 26, 28, 31, 32, 33, 41, 43, 46, 47, 48, 49, 51, 52, 58, 66, 75, 75, 76, 78, 81, 88, 91], [8, 13, 18, 19, 22, 26, 26, 26, 27, 30, 30, 32, 33, 35, 35, 38, 45, 53, 57, 60, 63, 63, 65, 71, 77, 79, 81, 91, 96, 98, 99]], [[-40]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 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, 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, 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, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[3, 86, 3, 43, 83, 22, 69, 67, 38, 82, 99, 59, 27, 2, 8, 84, 60, 93, 75, 37, 65, 79, 43, 69, 7, 42, 44, 77, 24, 58], [88, 63, 93, 78, 89, 63, 23, 39, 60, 17, 94, 68, 16, 76, 31, 4, 66, 91, 57, 98, 95, 83, 22, 79, 50, 34, 84, 59, 59, 39], [37, 36, 42, 78, 47, 20, 40, 18, 7, 56, 4, 26, 25, 64, 34, 28, 88, 46, 21, 45, 70, 75, 24, 29, 79, 7, 81, 32, 65, 87], [90, 25, 86, 26, 59, 67, 24, 74, 37, 68, 78, 5, 7, 15, 63, 20, 59, 90, 58, 50, 82, 19, 37, 64, 81, 74, 62, 3, 28, 87], [81, 75, 25, 44, 42, 86, 92, 29, 11, 50, 77, 77, 99, 69, 3, 49, 89, 35, 59, 95, 85, 51, 36, 72, 29, 74, 55, 72, 58, 16], [82, 37, 70, 98, 69, 84, 29, 36, 49, 94, 64, 72, 17, 95, 83, 51, 16, 65, 89, 21, 14, 4, 75, 99, 39, 60, 18, 65, 69, 6], [88, 1, 88, 12, 21, 19, 37, 85, 43, 80, 65, 79, 97, 12, 45, 12, 38, 62, 53, 21, 86, 67, 99, 12, 38, 83, 30, 32, 27, 29], [42, 25, 24, 59, 60, 38, 34, 96, 84, 77, 14, 97, 14, 1, 89, 95, 62, 57, 96, 59, 65, 52, 72, 70, 69, 36, 79, 34, 68, 33], [69, 92, 20, 1, 71, 47, 28, 33, 29, 80, 55, 67, 17, 82, 82, 68, 18, 24, 51, 49, 71, 62, 69, 36, 97, 39, 22, 97, 3, 63], [63, 34, 94, 31, 49, 43, 90, 61, 1, 55, 45, 29, 28, 13, 44, 26, 45, 14, 92, 96, 9, 39, 83, 53, 34, 59, 73, 52, 9, 28], [30, 46, 18, 73, 90, 38, 8, 49, 75, 15, 39, 10, 96, 85, 32, 53, 4, 93, 86, 7, 95, 87, 95, 59, 65, 22, 77, 79, 66, 30], [92, 28, 99, 32, 90, 28, 2, 97, 76, 97, 38, 39, 77, 84, 88, 19, 34, 23, 81, 81, 73, 13, 91, 68, 6, 21, 44, 30, 16, 2], [76, 7, 20, 53, 71, 29, 57, 33, 32, 53, 44, 25, 76, 28, 91, 15, 28, 14, 63, 78, 75, 49, 81, 93, 82, 45, 59, 81, 85, 97], [98, 10, 23, 21, 48, 22, 4, 43, 13, 24, 69, 62, 61, 11, 61, 95, 89, 31, 10, 77, 93, 41, 45, 32, 8, 42, 50, 15, 57, 10], [85, 90, 37, 19, 60, 33, 71, 96, 9, 10, 52, 20, 73, 67, 83, 18, 62, 19, 17, 43, 32, 15, 92, 47, 59, 83, 15, 45, 95, 90], [38, 86, 16, 5, 83, 44, 46, 23, 96, 75, 76, 15, 8, 58, 29, 81, 52, 30, 87, 45, 62, 82, 74, 69, 57, 99, 60, 13, 57, 92], [75, 52, 45, 6, 41, 30, 93, 17, 76, 53, 20, 13, 65, 38, 14, 51, 83, 93, 55, 83, 19, 81, 70, 57, 37, 95, 48, 52, 25, 86], [75, 79, 14, 80, 61, 82, 79, 70, 35, 31, 66, 47, 8, 2, 30, 96, 22, 94, 68, 59, 20, 29, 98, 14, 95, 33, 63, 72, 3, 1], [43, 21, 47, 66, 48, 27, 51, 75, 20, 87, 71, 98, 93, 4, 59, 22, 76, 65, 7, 38, 21, 26, 36, 86, 28, 78, 62, 98, 40, 5], [46, 57, 64, 58, 2, 92, 98, 82, 40, 87, 80, 96, 62, 53, 92, 27, 74, 38, 40, 72, 8, 81, 64, 25, 75, 54, 70, 91, 95, 42], [97, 97, 58, 63, 90, 72, 76, 74, 96, 96, 16, 43, 65, 97, 48, 95, 36, 16, 57, 38, 21, 11, 99, 39, 67, 61, 76, 89, 25, 83], [1, 5, 93, 79, 76, 93, 81, 74, 11, 6, 74, 49, 86, 23, 82, 24, 33, 65, 2, 49, 74, 6, 14, 11, 82, 32, 34, 41, 78, 5], [82, 67, 38, 85, 78, 83, 2, 93, 39, 17, 51, 17, 97, 99, 35, 98, 82, 84, 29, 68, 91, 86, 49, 16, 2, 50, 10, 34, 18, 45], [71, 44, 54, 31, 93, 84, 28, 82, 87, 53, 89, 45, 97, 23, 74, 76, 35, 4, 71, 92, 35, 68, 53, 2, 8, 38, 95, 68, 18, 6], [37, 28, 49, 99, 51, 64, 10, 80, 69, 45, 85, 58, 41, 56, 39, 67, 3, 77, 35, 75, 46, 44, 38, 70, 75, 19, 21, 91, 43, 78], [68, 31, 36, 20, 86, 37, 17, 3, 10, 68, 61, 59, 95, 80, 73, 52, 96, 23, 54, 33, 45, 74, 55, 83, 60, 55, 88, 59, 77, 9], [55, 81, 74, 8, 73, 6, 86, 64, 38, 76, 80, 62, 64, 11, 62, 72, 95, 22, 27, 57, 83, 85, 60, 36, 76, 28, 78, 24, 25, 80], [85, 85, 15, 8, 23, 92, 30, 74, 79, 90, 62, 20, 96, 61, 46, 80, 40, 7, 51, 27, 28, 43, 83, 39, 94, 10, 49, 98, 27, 84], [91, 70, 64, 86, 70, 85, 54, 69, 14, 67, 43, 22, 9, 91, 10, 84, 93, 3, 5, 87, 59, 54, 59, 82, 8, 73, 22, 33, 53, 64], [82, 37, 42, 38, 4, 98, 16, 82, 47, 87, 9, 34, 36, 92, 10, 72, 87, 72, 22, 40, 12, 96, 12, 30, 41, 18, 33, 37, 27, 45]], [[-96, -90, -78, -74, -70, -60, -52, -50, -48, -46, -32, -20, -20, -10, -6, -4, 4, 4, 6, 8, 8, 24, 32, 48, 48, 58, 86, 92, 98], [-68, -60, -58, -54, -40, -38, -22, -16, -16, -16, -12, 0, 4, 4, 30, 30, 42, 46, 48, 48, 50, 52, 52, 52, 66, 68, 76, 78, 96], [-92, -90, -86, -70, -60, -58, -48, -46, -46, -36, -34, -14, -14, -10, -2, 12, 44, 46, 52, 54, 66, 70, 70, 74, 76, 80, 86, 90, 98], [-98, -88, -78, -78, -74, -72, -68, -66, -66, -58, -36, -32, -26, -22, -6, -6, 8, 8, 18, 20, 22, 28, 34, 60, 70, 70, 70, 80, 90], [-98, -96, -96, -88, -86, -86, -72, -66, -64, -62, -54, -52, -52, -46, -42, -22, -20, -14, -10, -4, 8, 14, 22, 64, 74, 78, 88, 96, 96], [-98, -82, -78, -58, -54, -54, -52, -52, -46, -46, -40, -40, -28, -26, -4, 0, 8, 8, 12, 14, 50, 52, 62, 66, 68, 70, 78, 94, 96], [-94, -90, -80, -78, -74, -72, -70, -54, -52, -46, -40, -38, -28, -22, -22, -20, 16, 16, 18, 18, 20, 24, 44, 46, 50, 58, 64, 70, 76], [-96, -94, -92, -86, -80, -80, -76, -76, -72, -68, -52, -32, -26, -18, -14, -10, -2, 0, 4, 10, 12, 18, 22, 30, 44, 70, 76, 78, 82], [-90, -88, -68, -66, -46, -40, -40, -30, -30, -26, -22, -18, -6, -4, -4, 6, 8, 10, 10, 16, 20, 20, 26, 28, 36, 58, 82, 90, 98], [-90, -86, -84, -84, -82, -66, -60, -40, -32, -22, -14, 4, 6, 20, 22, 22, 32, 34, 34, 52, 58, 60, 66, 70, 76, 80, 88, 92, 96], [-96, -90, -80, -80, -66, -66, -46, -36, -36, -28, -20, -10, -4, 0, 14, 20, 24, 26, 32, 38, 38, 44, 60, 70, 70, 76, 78, 86, 94], [-94, -82, -80, -72, -70, -60, -46, -46, -38, -36, -26, -24, -18, -12, -4, 18, 26, 34, 38, 44, 46, 50, 52, 64, 68, 72, 80, 80, 96], [-98, -94, -92, -84, -76, -66, -62, -44, -36, -34, -32, -22, 2, 4, 8, 18, 18, 18, 18, 32, 36, 42, 52, 58, 70, 80, 86, 94, 98], [-98, -96, -92, -82, -74, -72, -72, -28, -2, 0, 4, 20, 32, 32, 34, 34, 36, 38, 50, 52, 58, 60, 62, 62, 80, 84, 88, 88, 90], [-74, -74, -70, -66, -54, -50, -42, -40, -36, -16, -14, -14, -12, -10, -8, -4, 10, 18, 28, 58, 60, 68, 68, 74, 76, 84, 86, 96, 98], [-98, -96, -90, -56, -54, -46, -42, -36, -34, -26, -26, -6, 0, 2, 12, 14, 24, 24, 40, 50, 60, 64, 64, 70, 76, 78, 80, 88, 90], [-92, -92, -84, -80, -80, -64, -56, -50, -44, -42, -32, -18, -16, -14, 14, 24, 26, 26, 30, 36, 44, 46, 46, 50, 56, 64, 86, 86, 86], [-96, -94, -94, -88, -86, -74, -62, -62, -44, -40, -30, -28, -24, -20, 14, 20, 22, 40, 52, 52, 56, 58, 60, 60, 62, 62, 84, 96, 98], [-98, -92, -92, -54, -54, -50, -48, -48, -40, -40, -30, -26, -24, -12, -6, 0, 18, 24, 24, 26, 26, 36, 44, 48, 66, 74, 86, 88, 94], [-98, -98, -94, -90, -88, -80, -76, -68, -60, -58, -56, -42, -38, -28, -26, -4, 0, 20, 22, 28, 36, 50, 56, 56, 60, 60, 68, 86, 86], [-94, -84, -62, -42, -36, -36, -28, -26, -24, -20, -14, -10, 0, 16, 20, 22, 30, 34, 40, 52, 56, 56, 62, 66, 76, 82, 84, 92, 98], [-98, -92, -86, -86, -78, -76, -58, -58, -54, -50, -40, -26, -10, -6, 0, 18, 20, 24, 24, 24, 38, 42, 46, 54, 64, 76, 80, 90, 96], [-86, -84, -78, -76, -66, -62, -60, -56, -46, -32, -22, -18, -18, -10, -2, 4, 10, 14, 28, 36, 42, 42, 56, 60, 62, 68, 74, 82, 88], [-98, -98, -76, -72, -64, -64, -62, -60, -48, -44, -42, -36, -36, -30, -24, -12, -8, 2, 12, 16, 36, 42, 44, 60, 66, 68, 84, 86, 88], [-96, -96, -94, -94, -92, -90, -62, -50, -48, -48, -48, -44, -24, -22, -8, -8, -6, -6, 0, 16, 48, 54, 54, 58, 64, 74, 74, 78, 88], [-98, -96, -84, -74, -54, -52, -40, -34, -24, -16, -14, -10, -6, -6, -4, 12, 16, 18, 46, 46, 48, 48, 56, 62, 64, 78, 82, 86, 90], [-86, -86, -72, -66, -62, -48, -44, -38, -26, -22, -20, -12, -4, 8, 10, 14, 18, 30, 30, 32, 42, 62, 66, 70, 70, 78, 84, 94, 98], [-98, -88, -82, -80, -68, -68, -68, -66, -64, -52, -50, -46, -44, -42, -36, -34, -2, -2, 4, 10, 26, 42, 44, 62, 66, 68, 76, 82, 98], [-98, -92, -88, -88, -86, -62, -50, -46, -32, -28, -20, -4, -2, 0, 12, 20, 34, 38, 42, 60, 64, 64, 64, 66, 66, 72, 74, 88, 98]], [[1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0], [1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1], [1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0], [0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1], [1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0], [1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0], [1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1], [0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0], [0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0], [1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 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, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1], [0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], [0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0], [0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1], [1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1], [1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], [0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1], [0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0], [0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0], [1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0], [0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1], [1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0], [1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0], [1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1], [0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0], [1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0], [1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1], [1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0], [1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1], [1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1], [1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0], [0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0], [1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0], [1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0], [1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0]], [[12, 22, 56, 63, 69], [8, 8, 12, 57, 95], [40, 55, 59, 65, 72], [2, 22, 40, 72, 83], [2, 4, 12, 31, 38]], [[-92, -36, 84, 62, -94, -74, 20, 20, 92], [52, -40, -98, -32, 58, 80, -60, 46, 80], [8, 8, 0, -48, -86, 48, -38, -96, 92], [18, -68, -74, 92, -70, -36, -32, -16, -16], [-70, -26, 32, -58, 82, 22, -12, 96, -44], [-68, -54, -94, -84, -68, -70, -30, -76, -52], [-68, 64, 68, 80, 30, 12, -82, 20, -58], [-38, -88, 24, 28, -98, 56, -62, -46, 98], [28, -82, -32, 74, -94, 38, -12, -46, -6]], [[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, 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], [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], [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], [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, 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, 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], [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], [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], [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, 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, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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], [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, 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, 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], [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], [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], [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, 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], [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], [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], [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, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[78, 96, 83, 94, 61, 52, 86, 42, 64, 39, 8, 48, 87, 31, 77, 72, 9, 9, 3, 83, 2, 79, 20, 84, 50, 85, 32, 15, 14, 70, 7, 19, 43, 6, 71, 16], [35, 5, 20, 49, 27, 85, 22, 1, 99, 13, 57, 86, 70, 34, 34, 11, 50, 22, 60, 58, 31, 45, 64, 3, 74, 95, 85, 46, 32, 94, 13, 90, 94, 56, 25, 94], [52, 7, 25, 18, 38, 42, 26, 83, 41, 20, 38, 29, 71, 38, 99, 53, 76, 61, 98, 56, 74, 46, 62, 1, 1, 98, 7, 36, 87, 66, 77, 52, 81, 27, 44, 54], [12, 17, 86, 71, 29, 39, 95, 71, 53, 32, 65, 93, 66, 62, 97, 63, 99, 48, 33, 7, 28, 20, 68, 98, 45, 92, 9, 94, 29, 43, 24, 99, 9, 99, 39, 88], [25, 71, 58, 33, 26, 76, 27, 56, 55, 60, 28, 36, 10, 18, 71, 98, 61, 83, 18, 62, 43, 57, 23, 61, 43, 34, 66, 76, 25, 82, 73, 79, 76, 13, 6, 31], [79, 36, 81, 72, 22, 53, 90, 82, 99, 10, 42, 11, 36, 80, 30, 95, 90, 71, 57, 62, 38, 97, 73, 47, 66, 15, 59, 62, 26, 7, 25, 93, 35, 24, 4, 19], [49, 55, 96, 83, 54, 53, 41, 35, 52, 83, 46, 58, 50, 48, 53, 41, 69, 36, 93, 27, 7, 42, 95, 90, 7, 29, 93, 23, 43, 18, 78, 13, 70, 18, 19, 91], [74, 42, 96, 90, 95, 25, 48, 8, 19, 48, 59, 79, 64, 90, 67, 76, 33, 60, 25, 32, 92, 12, 38, 12, 52, 73, 84, 62, 72, 82, 76, 30, 95, 15, 22, 30], [61, 90, 92, 47, 62, 34, 56, 90, 12, 81, 48, 3, 37, 43, 78, 41, 42, 78, 22, 35, 36, 98, 77, 70, 22, 32, 88, 22, 66, 64, 81, 88, 63, 67, 48, 51], [39, 21, 32, 61, 54, 32, 98, 87, 66, 71, 31, 81, 68, 3, 60, 67, 1, 71, 24, 64, 52, 99, 25, 85, 60, 3, 17, 93, 61, 74, 44, 27, 74, 42, 70, 22], [98, 61, 8, 13, 47, 31, 11, 99, 47, 3, 21, 28, 67, 3, 35, 67, 71, 32, 85, 62, 6, 94, 99, 41, 34, 7, 81, 22, 74, 15, 78, 48, 86, 38, 54, 21], [57, 49, 87, 34, 93, 5, 91, 89, 46, 63, 13, 89, 59, 56, 67, 24, 12, 57, 96, 66, 44, 32, 90, 23, 14, 10, 28, 12, 66, 74, 17, 4, 82, 92, 27, 62], [3, 62, 20, 85, 22, 98, 38, 68, 57, 37, 98, 22, 82, 34, 65, 99, 61, 66, 8, 36, 92, 50, 12, 73, 64, 4, 61, 31, 25, 2, 59, 68, 47, 28, 86, 93], [28, 6, 38, 36, 93, 72, 39, 55, 30, 76, 96, 54, 5, 73, 15, 14, 12, 74, 65, 44, 94, 91, 6, 33, 42, 87, 35, 81, 57, 10, 11, 33, 86, 73, 89, 94], [8, 10, 9, 84, 30, 9, 35, 86, 49, 37, 43, 23, 43, 13, 36, 82, 61, 34, 12, 73, 4, 70, 32, 17, 34, 35, 64, 80, 19, 50, 58, 77, 44, 66, 1, 46], [99, 72, 9, 61, 48, 92, 58, 68, 33, 52, 8, 47, 14, 9, 13, 2, 11, 49, 3, 64, 60, 95, 64, 59, 36, 52, 10, 50, 86, 9, 31, 80, 31, 91, 9, 25], [74, 65, 81, 28, 88, 58, 49, 92, 17, 14, 31, 27, 61, 52, 15, 40, 33, 38, 28, 92, 71, 56, 34, 49, 2, 55, 33, 3, 3, 61, 66, 95, 79, 62, 79, 91], [47, 87, 29, 43, 72, 14, 76, 93, 41, 18, 65, 2, 17, 20, 48, 59, 97, 43, 94, 59, 61, 79, 71, 54, 93, 8, 86, 4, 73, 10, 66, 98, 29, 48, 11, 72], [32, 79, 33, 43, 27, 60, 73, 55, 27, 84, 4, 97, 39, 5, 25, 23, 98, 1, 7, 4, 48, 47, 34, 79, 17, 89, 87, 8, 37, 22, 80, 21, 81, 74, 73, 31], [97, 59, 19, 17, 65, 65, 21, 37, 30, 76, 41, 86, 84, 30, 33, 32, 38, 7, 30, 56, 19, 80, 86, 62, 47, 19, 45, 80, 16, 82, 44, 27, 7, 38, 6, 30], [64, 83, 75, 9, 41, 8, 61, 89, 61, 49, 40, 67, 75, 27, 80, 9, 30, 12, 99, 20, 93, 42, 99, 88, 76, 1, 56, 10, 34, 41, 50, 97, 66, 62, 52, 49], [64, 54, 22, 65, 92, 84, 27, 42, 10, 69, 67, 18, 75, 24, 38, 71, 52, 79, 18, 38, 70, 94, 91, 77, 38, 74, 91, 3, 1, 85, 82, 1, 52, 40, 44, 60], [83, 17, 61, 43, 30, 62, 60, 35, 39, 95, 91, 71, 2, 50, 7, 32, 51, 44, 24, 18, 66, 87, 62, 3, 92, 87, 77, 1, 25, 46, 77, 15, 59, 46, 88, 86], [83, 66, 34, 2, 59, 29, 65, 98, 55, 93, 66, 26, 75, 36, 64, 60, 45, 19, 75, 40, 16, 34, 52, 25, 8, 52, 29, 39, 92, 17, 70, 29, 42, 33, 23, 80], [22, 11, 32, 56, 48, 20, 32, 33, 49, 59, 13, 53, 79, 4, 33, 11, 6, 71, 86, 14, 98, 61, 20, 80, 2, 53, 68, 9, 50, 26, 73, 20, 87, 60, 96, 99], [96, 64, 95, 64, 34, 73, 24, 52, 46, 28, 94, 82, 26, 1, 74, 47, 14, 48, 5, 33, 65, 84, 72, 21, 10, 60, 69, 65, 57, 16, 73, 2, 28, 42, 14, 44], [57, 72, 10, 97, 89, 71, 74, 20, 5, 82, 52, 86, 39, 67, 93, 19, 81, 53, 21, 72, 64, 6, 61, 47, 89, 54, 72, 47, 18, 97, 53, 48, 75, 65, 99, 33], [61, 22, 43, 17, 71, 62, 73, 94, 48, 51, 85, 46, 41, 66, 31, 43, 7, 29, 3, 61, 28, 62, 56, 34, 61, 59, 49, 38, 14, 33, 64, 94, 14, 27, 42, 28], [93, 66, 93, 79, 99, 47, 2, 8, 26, 82, 73, 3, 5, 43, 80, 74, 29, 94, 11, 16, 31, 89, 16, 74, 95, 87, 43, 15, 77, 80, 57, 27, 92, 74, 6, 69], [64, 88, 68, 15, 45, 85, 22, 39, 62, 24, 92, 7, 61, 69, 51, 32, 81, 81, 62, 68, 39, 26, 38, 97, 62, 70, 84, 80, 42, 3, 60, 89, 2, 61, 39, 90], [29, 39, 6, 62, 21, 87, 37, 64, 88, 68, 5, 75, 96, 72, 37, 39, 23, 97, 58, 57, 81, 74, 72, 91, 58, 52, 68, 47, 64, 46, 60, 60, 65, 31, 65, 46], [81, 39, 17, 69, 41, 21, 62, 88, 29, 31, 3, 73, 28, 99, 30, 39, 48, 28, 52, 62, 57, 5, 9, 5, 24, 77, 22," LONGEST_REPEATING_AND_NON_OVERLAPPING_SUBSTRING,"static String f_filled ( String str ) { int n = str . length ( ) ; int LCSRe [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ; String res = """" ; int res_length = 0 ; int i , index = 0 ; for ( i = 1 ; i <= n ; i ++ ) { for ( int j = i + 1 ; j <= n ; j ++ ) { if ( str . charAt ( i - 1 ) == str . charAt ( j - 1 ) && LCSRe [ i - 1 ] [ j - 1 ] < ( j - i ) ) { LCSRe [ i ] [ j ] = LCSRe [ i - 1 ] [ j - 1 ] + 1 ; if ( LCSRe [ i ] [ j ] > res_length ) { res_length = LCSRe [ i ] [ j ] ; index = Math . max ( i , index ) ; } } else { LCSRe [ i ] [ j ] = 0 ; } } } if ( res_length > 0 ) { for ( i = index - res_length + 1 ; i <= index ; i ++ ) { res += str . charAt ( i - 1 ) ; } } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""f"", ""2"", ""001"", """", ""4"", ""0"", ""d"", ""1"", ""1"", ""i""]; string [] param0 = [""fbfhtje"", ""09285256323"", ""0011000101110"", ""ue jkvztt"", ""48387612426300"", ""010"", ""ddrruz"", ""1049162633793"", ""100011"", ""ijfadivaqqv""]; 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); } " LEXICOGRAPHICALLY_MINIMUM_STRING_ROTATION,"static String f_filled ( String str ) { int n = str . length ( ) ; String arr [ ] = new String [ n ] ; String concat = str + str ; for ( int i = 0 ; i < n ; i ++ ) { arr [ i ] = concat . substring ( i , i + n ) ; } Arrays . sort ( arr ) ; return arr [ 0 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""echlonw"", ""2"", ""001"", ""aghbcz"", ""05505687982061"", ""000100101111"", ""yhznnyulljp"", ""17599845449992"", ""01111"", ""cyejsyjwzqvypg""]; string [] param0 = [""onwechl"", ""2"", ""100"", ""ghbcza"", ""50568798206105"", ""001011110001"", ""lljpyhznnyu"", ""54499921759984"", ""11101"", ""qvypgcyejsyjwz""]; 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); } " LEXICOGRAPHICALLY_NEXT_STRING,"static String f_filled ( String str ) { if ( str == """" ) return ""a"" ; int i = str . length ( ) - 1 ; while ( str . charAt ( i ) == 'z' && i >= 0 ) i -- ; if ( i == - 1 ) str = str + 'a' ; else str = str . substring ( 0 , i ) + ( char ) ( ( int ) ( str . charAt ( i ) ) + 1 ) + str . substring ( i + 1 ) ; return str ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""amkirzpiqltiz"", ""69"", ""101"", ""g"", ""802205376"", ""0112"", ""grjryivywgub"", ""813991000680:"", ""100102"", ""rx""]; string [] param0 = [""amkirzpiqltiy"", ""68"", ""100"", ""f"", ""802205375"", ""0111"", ""grjryivywgua"", ""8139910006809"", ""100101"", ""rw""]; 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_FOR_FACTORIAL_OF_A_NUMBER_1,"static int f_filled ( int n ) { int res = 1 , i ; for ( i = 2 ; i <= n ; i ++ ) res *= i ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5040, 40320, 6, 362880, 2, 24, 1, 120, 720, 3628800]; int [] param0 = [7, 8, 3, 9, 2, 4, 1, 5, 6, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " LEXICOGRAPHICAL_MAXIMUM_SUBSTRING_STRING,"static String f_filled ( String str ) { String mx = """" ; for ( int i = 0 ; i < str . length ( ) ; ++ i ) { if ( mx . compareTo ( str . substring ( i ) ) <= 0 ) { mx = str . substring ( i ) ; } } return mx ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""oaan"", ""80336005"", ""1111111110"", ""qih"", ""98472796"", ""10101"", ""tcgxjs"", ""9666021"", ""111101101"", ""z""]; string [] param0 = [""hcoaefoaan"", ""80336005"", ""01111111110"", ""qih"", ""4210598472796"", ""10101"", ""imqmkdatcgxjs"", ""950509666021"", ""10111101101"", ""wasqgyfvz""]; 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_COMMON_INCREASING_SUBSEQUENCE_LCS_LIS,"static int f_filled ( int arr1 [ ] , int n , int arr2 [ ] , int m ) { int table [ ] = new int [ m ] ; for ( int j = 0 ; j < m ; j ++ ) table [ j ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) { int current = 0 ; for ( int j = 0 ; j < m ; j ++ ) { if ( arr1 [ i ] == arr2 [ j ] ) if ( current + 1 > table [ j ] ) table [ j ] = current + 1 ; if ( arr1 [ i ] > arr2 [ j ] ) if ( table [ j ] > current ) current = table [ j ] ; } } int result = 0 ; for ( int i = 0 ; i < m ; i ++ ) if ( table [ i ] > result ) result = table [ i ] ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 2, 0, 0, 2, 4, 1, 2, 0]; int [] [] param0 = [[1, 7, 9, 35, 43, 51, 51, 66, 88], [-52, 52, -92, -46, -94, 30, -36, 18, -98, 22, -36, 96, -88, -50, 50], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 74, 29], [-84, -74, -70, -62, -56, -56, -52, -2, 6, 24, 28, 44, 44, 52], [0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0], [3, 4, 4, 7, 15, 15, 16, 22, 32, 32, 37, 39, 39, 41, 43, 46, 47, 47, 49, 75, 79, 80, 86, 88, 93], [70, -64, 0, 52, 32, -98, 38, -8, 34, 70, 98, 58, -48, -60, -28, -22, -72, 82, -98, -36], [0, 0, 1, 1, 1, 1, 1, 1], [46, 87, 98]]; int [] param1 = [5, 7, 36, 1, 8, 17, 19, 16, 7, 2]; int [] [] param2 = [[10, 21, 38, 50, 65, 67, 87, 93, 99], [-58, 40, 56, -62, -92, -94, 40, 18, -2, -76, -78, -14, 44, 84, 4], [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], [57, 33, 48], [-98, -96, -88, -66, -32, -26, -24, -20, -4, 20, 48, 74, 90, 96], [1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0], [9, 12, 15, 20, 22, 27, 28, 28, 30, 31, 35, 39, 47, 58, 58, 60, 73, 74, 76, 78, 80, 86, 95, 96, 98], [-18, 88, -40, -52, 30, -10, -18, -56, 84, -22, -64, 80, -14, -64, 40, 92, 48, -8, 24, 82], [0, 1, 1, 1, 1, 1, 1, 1], [67, 31, 54]]; int [] param3 = [8, 10, 22, 1, 12, 15, 14, 12, 7, 2]; 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); } " LONGEST_COMMON_SUBSTRING,"static int f_filled ( char X [ ] , char Y [ ] , int m , int n ) { int LCStuff [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ; int result = 0 ; for ( int i = 0 ; i <= m ; i ++ ) { for ( int j = 0 ; j <= n ; j ++ ) { if ( i == 0 || j == 0 ) LCStuff [ i ] [ j ] = 0 ; else if ( X [ i - 1 ] == Y [ j - 1 ] ) { LCStuff [ i ] [ j ] = LCStuff [ i - 1 ] [ j - 1 ] + 1 ; result = Integer . max ( result , LCStuff [ i ] [ j ] ) ; } else LCStuff [ i ] [ j ] = 0 ; } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 3, 29, 1, 1, 1, 3, 2, 7, 1]; char [] [] param0 = [['a', 'd', 'e', 'e', 'l', 'l', 't', 'r', 'x'], ['9', '3', '4', '8', '7', '6', '3', '8', '3', '3', '5', '3', '5', '4', '2', '5', '5', '3', '6', '2', '1', '7', '4', '2', '7', '3', '2', '1', '3', '7', '6', '5', '0', '6', '3', '8', '5', '1', '7', '9', '2', '7'], ['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'], ['w', 'x', 'p', 'u', 's', 'k', 'o', 'y', 'q', 'i', 't', 'z', 'f', 'f', 's', 'n', 'k', 'm', 'i', 'm', 'g', 'e', 'e', 'p', 'b', 'y', 'c', 'o', ' ', 'g', 'f', 'x'], ['0', '1', '2', '4', '5', '7', '7', '7', '8', '8', '9', '9', '9'], ['0', '0', '1'], ['a', 'c', 'f', 'g', 'g', 'h', 'i', 'k', 'k', 'n', 'o', 'q', 'r', 'v', 'v', 'w', 'y', 'a', 'a', 'c', 'd', 'k', 'k', 'm', 'o', 'p', 't', 'u', 'y', 'y', 'y', 'z'], ['0', '0', '0', '2', '8', '3', '5', '1', '0', '7', '7', '9', '9', '4', '8', '9', '5'], ['0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1'], ['b', 'o', 'r', 'k', 'y', 'm', 'g', 'b', 'h', 'a', 'i', 'x', 'p', 'i', 'j', 'f', 'v', 'n', 'd', 'p', 't', 'u', 'f', 'g', 'm', 'w', 'g', 'a', 'c', 'e', 'v', 'c', ' ']]; char [] [] param1 = [['d', 'f', 'h', 'o', 'g', 'o', 'u', 'v', 'w'], ['5', '5', '3', '7', '8', '0', '9', '8', '5', '8', '5', '1', '4', '4', '0', '2', '9', '2', '3', '1', '1', '3', '6', '1', '2', '0', '5', '4', '3', '7', '5', '5', '8', '1', '1', '4', '8', '1', '7', '5', '5', '4'], ['0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'], ['e', 'r', 'p', 'w', 'd', 'a', 'a', 'j', 'h', 'v', 't', 'w', 'x', 'i', 'd', 'o', 'z', 'k', 'b', 'm', 'j', 'l', 'a', ' ', 't', 'l', 'v', 't', 'm', 'u', 'z', 'r'], ['0', '0', '2', '2', '2', '3', '4', '6', '6', '7', '8', '9', '9'], ['0', '0', '1'], [' ', ' ', 'b', 'c', 'c', 'c', 'd', 'e', 'i', 'j', 'm', 'n', 'p', 't', 'u', 'u', 'v', 'v', 'w', 'w', 'y', 'b', 'c', 'e', 'i', 'o', 'p', 'r', 't', 'y', 'y', 'z'], ['8', '5', '8', '7', '1', '4', '0', '2', '2', '7', '2', '4', '0', '8', '3', '8', '7'], ['0', '0', '0', '0', '0', '0', '1', '1', '1', '1', '1'], ['f', 'h', 'g', 'h', 'q', 'q', 'k', 'g', 'k', 'u', 'l', 'c', 'c', 'o', 'n', 'g', 'i', 'z', 'd', 'b', 'c', 'b', 'v', 't', 's', 't', 'p', 'a', 'k', 'g', 'g', 'i', 'm']]; int [] param2 = [4, 41, 35, 31, 12, 1, 21, 13, 9, 19]; int [] param3 = [4, 37, 29, 18, 8, 1, 23, 12, 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])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE,"static int f_filled ( int arr [ ] , int n , int x ) { int curr_sum = 0 , min_len = n + 1 ; int start = 0 , end = 0 ; while ( end < n ) { while ( curr_sum <= x && end < n ) curr_sum += arr [ end ++ ] ; while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 9, 1, 18, 12, 1, 43, 26, 1]; int [] [] param0 = [[6, 11, 11, 14, 18, 19, 21, 22, 22, 23, 26, 27, 28, 28, 29, 30, 31, 34, 39, 42, 42, 44, 45, 49, 49, 53, 57, 61, 65, 66, 67, 70, 71, 73, 74, 74, 78, 85, 88, 94, 95, 97], [-30, -22, -66, -80, 18, -64, -28, -46, 94, 60, -64, 2, 26, -94, 58, 56, 56, 88, 50, -78, -12, 68, 54, -78, 42, -30, 24, -48, 84, 12, -88, 0, 54, -92, -4, 42, -60, -72, -32], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [86, 8, 23, 40, 55, 93, 11, 35, 33, 37, 96, 91, 35, 66, 37, 57, 83, 99, 96, 15, 18, 93], [-92, -68, -48, -48, -42, -26, -22, -18, 2, 4, 8, 14, 20, 22, 32, 46, 52, 62, 70, 96, 98], [0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0], [4, 4, 11, 11, 13, 15, 16, 18, 19, 19, 19, 23, 26, 27, 34, 39, 39, 40, 41, 46, 47, 51, 52, 52, 53, 57, 58, 58, 60, 64, 68, 70, 72, 84, 84, 85, 95, 98, 99], [12, -22, 2, -90, -92, 84, -26, -76, -72, 50, -36, 30, 78, -18, -94, -30, 22, 28, 10, 32, 34, -86, 0, -4, 40, 0, 80, 50, 66, -48, -40, -94, 64, 58, -14, 0, -32, -58, -22, -94, -68, -36, -94, -48, 40, 78, -74], [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, 33, 20, 32, 76, 27, 8, 95, 78, 72, 25, 56]]; int [] param1 = [37, 31, 8, 16, 17, 11, 31, 42, 25, 9]; int [] param2 = [23, 29, 12, 13, 14, 10, 35, 26, 21, 10]; 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); } " LONGEST_INCREASING_ODD_EVEN_SUBSEQUENCE,"static int f_filled ( int arr [ ] , int n ) { int [ ] lioes = new int [ n ] ; int maxLen = 0 ; for ( int i = 0 ; i < n ; i ++ ) lioes [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && ( arr [ i ] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ] ; return maxLen ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [18, 1, 1, 5, 1, 2, 5, 1, 2, 3]; int [] [] param0 = [[7, 8, 9, 16, 16, 27, 32, 33, 35, 35, 39, 39, 41, 42, 44, 47, 48, 50, 56, 59, 66, 69, 70, 73, 74, 76, 78, 87, 87, 89, 94, 96, 96, 98, 98], [40, 76, -54, -92, -28, -96, 8, 60, 28, -38, -62, -40, -16, 16, 52, 28, 70, -56, -50, 46, 68, -16, -56, 46, 42, 70, 52, -34, 86, -32, -50, 64, 36, 54, 20, 82, 84], [0, 0, 0, 0, 1, 1, 1], [15, 19, 87, 44, 15, 48, 21, 85, 90, 30, 88, 95, 48, 92, 29, 52, 46, 46, 7, 23, 96, 97, 43], [-98, -96, -94, -94, -94, -80, -80, -78, -64, -62, -62, -46, -42, -38, -36, -36, -34, -32, -20, -18, -16, -12, -8, -4, -4, -2, -2, 2, 6, 12, 34, 40, 42, 44, 46, 46, 50, 54, 58, 58, 70, 72, 72, 76, 78, 86], [0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1], [6, 7, 19, 36, 44, 63, 68, 72, 83], [-64, 12, 56, 50, 94, 6, 0, 70, -70, 46, -84, -64, 4, 76, 28, 94, -8, 24, 76, 64, -62, -34], [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], [71, 57, 20, 8, 90, 69, 15, 62, 45, 14, 65, 20, 48, 9]]; int [] param1 = [32, 25, 4, 19, 33, 13, 8, 15, 21, 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); } " PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR_2,"static int f_filled ( int num , int divisor ) { while ( num >= divisor ) num -= divisor ; return num ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 2, 4, 34, 18, 6, 79, 12, 26, 82]; int [] param0 = [70, 77, 77, 88, 96, 6, 79, 44, 26, 82]; int [] param1 = [13, 3, 73, 54, 39, 10, 95, 32, 86, 91]; 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_PREFIX_ALSO_SUFFIX_1,"static int f_filled ( String s ) { int n = s . length ( ) ; int lps [ ] = new int [ n ] ; lps [ 0 ] = 0 ; int len = 0 ; int i = 1 ; while ( i < n ) { if ( s . charAt ( i ) == s . charAt ( len ) ) { len ++ ; lps [ i ] = len ; i ++ ; } else { if ( len != 0 ) { len = lps [ len - 1 ] ; } else { lps [ i ] = 0 ; i ++ ; } } } int res = lps [ n - 1 ] ; return ( res > n / 2 ) ? n / 2 : res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 0, 1, 2, 0, 3, 2, 0, 2, 0]; string [] param0 = [""aabcdaabc"", ""1372494598"", ""110000100001"", ""abcab"", ""488938"", ""011010101011"", ""aaaa"", ""3356203205"", ""1010"", ""kkxiitzkgeh""]; 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_SUBARRAY_SUM_ARRAY_CREATED_REPEATED_CONCATENATION,"static int f_filled ( int a [ ] , int n , int k ) { int max_so_far = 0 ; int INT_MIN , max_ending_here = 0 ; for ( int i = 0 ; i < n * k ; i ++ ) { max_ending_here = max_ending_here + a [ i % n ] ; if ( max_so_far < max_ending_here ) max_so_far = max_ending_here ; if ( max_ending_here < 0 ) max_ending_here = 0 ; } return max_so_far ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [15540, 218, 522, 29070, 18, 300, 2570, 134, -2147483648, -2147483648]; int [] [] param0 = [[5, 6, 12, 20, 23, 28, 33, 37, 47, 51, 53, 56, 63, 65, 65, 68, 69, 76, 76, 78, 83], [68, 10, 52, -44, 34, -4, -34, 2, 50, -60, 50, 94, -98, -98, -44, -36, -4, -62, -2, -92, -70, -48, -78, -10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1], [71, 59, 21, 82, 73, 29, 30, 25, 21, 10, 85, 22, 60, 43, 49, 20, 34, 39, 69, 6, 44, 27, 50, 33, 57, 29, 65, 18, 68, 56, 50, 28], [-84, -74, -74, -56, -54, -48, -48, -46, -42, -34, -32, -30, -18, -16, -16, 6, 12, 20, 24, 26, 30, 32, 34, 42, 42, 42, 44, 46, 46, 50, 50, 62, 72, 78, 90], [0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0], [3, 7, 11, 11, 26, 60, 68, 71, 77, 91, 95], [28, 48, -86, -52, 6, 4, 30, 18, -32, 60, -2, 16, -88, -36], [1], [76]]; int [] param1 = [18, 22, 34, 23, 17, 16, 8, 8, 0, 0]; int [] param2 = [20, 22, 29, 30, 23, 25, 10, 11, 0, 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); } " MINIMUM_LENGTH_SUBARRAY_SUM_GREATER_GIVEN_VALUE_1,"static int f_filled ( int arr [ ] , int n , int x ) { int curr_sum = 0 , min_len = n + 1 ; int start = 0 , end = 0 ; while ( end < n ) { while ( curr_sum <= x && end < n ) { if ( curr_sum <= 0 && x > 0 ) { start = end ; curr_sum = 0 ; } curr_sum += arr [ end ++ ] ; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start ; curr_sum -= arr [ start ++ ] ; } } return min_len ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 43, 1, 2, 13, 1, 1, 11, 1]; int [] [] param0 = [[2, 4, 5, 10, 14, 15, 16, 20, 23, 28, 31, 35, 36, 36, 43, 48, 49, 55, 57, 57, 58, 61, 64, 64, 68, 70, 70, 73, 74, 76, 76, 77, 81, 81, 82, 87, 89, 92, 99], [66, -20, 12, -48, 22, 28, 40, -30, -6, -96, 10, -88, 40], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [28, 19, 38, 31, 17, 27, 60, 35, 19, 47, 34, 51, 3, 95, 33, 29, 84, 46, 74, 87], [-48, -2], [1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1], [1, 4, 4, 6, 8, 10, 12, 12, 13, 15, 18, 20, 21, 23, 25, 28, 28, 33, 33, 35, 35, 36, 37, 38, 42, 44, 63, 63, 65, 65, 65, 66, 70, 74, 77, 78, 80, 80, 84, 87, 87, 89, 92, 93, 94, 97, 98, 99], [-82, -12, -40, 58, 22, -76, -94, -28, 42, 36, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [76, 65, 96, 76, 1, 91, 22, 29, 95, 21, 73, 68, 30, 52, 73, 86, 52, 66, 67, 37, 76, 53, 68, 6, 95, 81, 98, 42, 63, 38, 92, 78, 59, 86, 10, 38, 18, 15, 52, 62, 16, 66]]; int [] param1 = [33, 11, 42, 15, 1, 12, 42, 10, 10, 23]; int [] param2 = [28, 12, 23, 15, 1, 15, 27, 6, 14, 35]; 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_ROTATIONS_UNLOCK_CIRCULAR_LOCK,"static int f_filled ( int input , int unlock_code ) { int rotation = 0 ; int input_digit , code_digit ; while ( input > 0 || unlock_code > 0 ) { input_digit = input % 10 ; code_digit = unlock_code % 10 ; rotation += Math . min ( Math . abs ( input_digit - code_digit ) , 10 - Math . abs ( input_digit - code_digit ) ) ; input /= 10 ; unlock_code /= 10 ; } return rotation ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 8, 8, 4, 6, 8, 7, 8, 1, 7]; int [] param0 = [71, 90, 28, 41, 32, 39, 33, 89, 50, 92]; int [] param1 = [46, 65, 84, 23, 58, 82, 58, 32, 51, 77]; 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); } " MARKOV_MATRIX,"static boolean f_filled ( double m [ ] [ ] ) { for ( int i = 0 ; i < m . length ; i ++ ) { double sum = 0 ; for ( int j = 0 ; j < m [ i ] . length ; j ++ ) sum = sum + m [ i ] [ j ] ; if ( sum != 1 ) return false ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, false, true, true, false, false, false, false]; double [] [] [] param0 = [[[0.0, 0.0, 1.0], [0.5, 0.0, 0.5], [1.0, 0.0, 0.0]], [[0.0, 0.0, 1.0], [0.5, 0.0, 0.51], [1.0, 0.0, 0.0]], [[0.0, 0.0, 0.9], [1.0, 0.0, 0.1], [0.0, 1.0, 0.0]], [[]], [[0.0, 1.0], [0.9, 0.1], [0.0, 1.0]], [[1.0]], [[1800.5208165864472, 5129.668497755772, 4091.578454432755, 9520.788540775387, 9012.789443327169, 5479.787317916788, 4846.101760095075, 9310.645104102381, 6862.485564868333, 6537.037513320974, 7943.016882755804], [8081.404685413337, 2775.350842660207, 3624.18060172129, 320.5505410412923, 896.5298358859519, 9778.851990348234, 8093.842945978867, 5513.194168934705, 3238.213662532161, 2068.183825530009, 8922.404213665432, 2564.415908565606, 9541.992473376376, 3500.695185589028, 7425.292941600525, 1035.1769706476443, 1993.3236514377372, 7516.6428866994665, 7036.757321520528, 4521.722941224576, 6046.954992856951, 1480.947630193744, 2468.314968942801, 6721.875264461492, 729.3668691453537, 7013.1702771055125, 620.7860776027774, 4073.8164568995426, 6637.935131989998, 4970.880129282128, 8491.291538095455, 6017.257595728452, 8758.321951108288, 7450.774705441449, 2430.104778991052, 7653.421788466134, 9867.846002930755, 9025.832543077806, 3130.4709292949738], [4092.6187809701687, 3682.191052666517, 6210.3251142981435, 7559.705041866003, 8083.3992753238235, 7027.888848387021, 322.813354455147, 6396.660665360345], [6712.595190644637, 3351.7854488023168, 3596.9007070939974, 7383.906373292954, 6925.055360334225, 6564.096130017967, 9810.727474966703, 1812.3875023392943, 7582.083184537618, 6792.011378435494, 6737.106729773401, 5165.155358877282, 7694.499267616087, 3564.5292718018964, 8125.369501443796, 7515.428339325206, 3373.5371602639975, 8145.31715886053, 6297.6183870619725, 489.2402023933884, 9562.673985208492, 6553.732669130852, 7196.924911915597, 9239.272829887721, 5855.3831715786055, 9570.600140348652, 6684.3117497126605, 9977.065074407292, 9210.767097725591, 3456.1818868411087], [4472.26489764256, 7298.311171623871, 6184.798212074516, 5645.069795561799, 9113.123076453292, 5537.618956455394, 2142.794697171854, 8370.190271064876, 5972.2448507765475, 6299.8293468991715, 7388.052824286836, 735.079089195314, 4216.330577355761, 928.9766117855969, 1935.1190718709943, 5606.352487792576, 9764.404560908582, 5301.250390178857, 2250.0545430370357, 8159.5544835139635, 1327.0903534461743, 7505.6753057440255, 9918.714694238013, 8827.139931812451, 1859.1883736005789, 8018.161213209266, 7984.370920859778, 288.30827861459517, 1461.0614788611754, 2690.173572057434, 8427.499467578928, 4724.15901701013, 4457.387382560547, 9993.904502656509], [2842.9663139830186, 8957.4584498927, 8686.31672019927, 4832.99654565389], [1477.392902127036, 7189.591229360169, 8822.61208105902, 4851.411807703794, 9600.384550545641, 5836.4581179869165, 2366.7307632417446, 9442.85367113618, 9848.096373489492, 3805.2945900367695, 2741.21016804169, 7787.421240650287, 5163.029236960128, 3839.164193518556, 8999.926058466983, 5787.032859796697, 7669.921381103829, 7893.275228211627, 1051.182564195985, 7017.888839448166, 5215.123486606644, 5208.568127672256, 1134.2054935790945, 7573.233029924398, 6060.282198006302, 1395.7596136070006, 3653.7960603925126, 244.94506756705502, 3594.7042035479526, 6272.774300983842, 4043.3735550683537, 2274.103544548338, 4022.0181987353485, 9109.556771757481, 4286.57480001852, 6721.662297331347, 6105.99828625709, 8758.359235513371, 1658.875171187041, 2024.5696201552444], [5912.554579767912, 5341.080476025451, 4305.59603125092, 9800.436262778925, 8097.160534980595, 493.9680676037761, 4047.191664109233, 6070.216899309564, 5697.682730828276, 9448.806800500452, 7698.114392101278, 7020.216498152797, 7091.797827878821, 3273.5516687760546, 3685.5162670409804, 2210.2161977720316, 7182.207804931318, 3265.217158812098, 1798.8408452362914, 9318.266496779846, 2859.486203159565, 4314.215039310549, 8313.026936365693], [8911.686558511605, 5660.199086800985, 6475.525180381277, 4040.3172648744144, 5708.611042449874, 9524.099373256367, 7030.627120796817, 783.4145757917787, 9713.798324426925, 5284.149579386235, 986.5900188717991, 2567.146044707662, 2034.3874533234496, 7853.582414512236, 5610.18808118777, 9372.679297083534, 1227.8195252860025, 8558.328099907549, 5800.797131024546, 1345.9810037159548, 8059.092655056248, 1007.7145561634637, 1867.8280914974055, 8073.000957658564]], [[9784.847472945596, 1467.4849690692215, 326.01056399299114, 3577.1820356491303, 3413.7335834614014, 5621.398199278954, 75.70726246875714, 3072.65108747655, 7278.353400799695, 4703.166022097605, 9423.746532838595, 9651.338090892916, 7908.363875282913, 2112.03821823538, 1975.7721197648048, 1044.0925741602891, 8579.267990348524, 3350.769942053501, 5299.788699272214, 7928.710248719408, 8396.62857032498, 3836.1908586465343, 8012.249410750618, 7828.91833852811, 1917.7798073113083, 5120.386576342888, 3678.786128839827, 4600.911873999521, 9497.461077450645, 3000.203085004004, 7858.544769795873, 8325.214884003173, 2451.061402910233, 647.2264467569499, 7282.170138249182, 2285.3064693716783, 5922.10840378214, 6916.751327338277, 7063.312743282037, 6645.4394853366075, 5500.794550321606, 7493.492320906113, 7206.786508904741, 2686.298332703524, 2538.8761292983, 7253.98778369984], [4241.304996916518, 483.6596378334046, 2763.9580150656075, 1405.7652499741057, 258.3758368726019, 6614.609227113464, 2961.514732472338, 9474.777783117728, 2912.5365535711267, 5242.8884354914, 2501.548861500482, 6531.229223937745, 4140.476002883762, 132.56892540437048, 3020.289197641887, 5554.185397774308, 8773.09782632125, 5011.890905582158, 8392.625753242448, 7800.7407071334765, 4421.736562443395, 52.49756244802284, 7333.792465191643, 1840.7462281638009, 7908.087535935016, 3036.262276198375, 3509.2829531181924, 7645.618711034763, 5397.717763289013, 3243.612078360748, 34.14499888319544, 3384.2995707615296, 4853.062855850027, 2223.4821740514067, 7479.5354594110395, 5969.120408179362, 5192.807647536894, 3509.0771162909696, 7334.4495826109105, 4987.315435971069, 6816.016561595986, 442.4714082796233, 65.9273693936524, 9593.436472709476, 2670.0620305702496, 4952.745706389296, 6867.130101433143], [1926.3801797530411, 4684.089278792868, 1544.945305609513, 712.4317947088488, 6354.9413872948935, 2717.619315479798, 6846.354537398023, 3775.3936214538207, 6375.903394134439, 1363.1538350088424, 2277.399819529351, 4091.6667790722695, 3659.9052193584657, 3149.203276820165, 7595.555393770957, 5372.782288919421, 8515.657623246656, 3159.662631217324, 4043.737445094111, 1842.2411676778072, 9713.005101273826, 2832.78160742499, 4589.20341066574, 9043.00917767472], [3498.6444148809305, 2140.852698797143, 4510.872710314036, 2990.179189617128, 7420.541642401762, 1033.9572862948598], [2794.437679786802, 3463.1871053331233, 9732.829396187464, 663.0832249897201, 5276.910560721226, 481.59416166211446, 2090.2478003682513, 4558.692561388009, 8758.39373387397, 4610.715817786542, 9921.398649289273, 1682.6982416319624, 3585.6795224563066, 3977.0601543964967, 9993.300034767055, 8757.889303531827, 1287.4604767598673, 9265.34884519963, 9590.296620414523, 3376.6132678108816, 795.8613040403706, 6807.576250770766, 6498.575499062116, 3521.0998180866904, 818.8610607244495, 1889.8998767199425, 3567.5388991226396, 3904.860163650392, 7927.945627565823, 5684.632085876909, 2665.280318592044, 3200.1780479713084, 4080.5659548739804, 4423.8860644441, 2026.9544154357254, 6542.038761607715, 371.810846991496, 9089.128291277799, 7033.856907920886, 1925.889920294268, 7735.925631486304], [650.8667327357808, 4738.836852826164, 3985.4301749766173, 1955.6572393313954, 3810.217150006002, 8241.6067168621, 2457.8677884976973, 5043.061693161945, 4098.220705621862, 8311.523429129516, 2613.3577094067405, 8951.447431099867, 3413.493711945631, 195.07449236425666, 3526.5261452758646, 5987.082440383985, 7672.683285206186, 8940.181891567034, 8715.378318384124, 1609.9269146079098, 5147.181463101181, 3305.462535094599, 9965.648218377532, 3910.7964252545266, 8068.070848658828, 4992.46105696117, 116.74465555125413, 3636.501190685493, 6298.365303023811, 758.4342724419646, 9850.35171473097, 6154.099626143185, 6627.416733525318, 2147.4459586732773, 4542.271637456006, 6116.269798885344, 1404.5680346185973, 5378.69792918011], [283.30445322594545, 1212.7329453006353, 6176.516523951887, 7361.713020934436, 446.2529292320283, 3573.9634384317155, 2866.7667140384456, 716.9415721666761, 2066.5957334633813, 8494.234070043816, 6193.876480036603], [2136.416496948584, 4757.490297134756, 1761.236114129905, 9672.92860361088, 292.470289758332, 2616.287787938537, 2448.153310489565, 8852.291381698386, 9393.592818697269, 1859.3755772816644, 7576.3934917486795, 2082.9223147752805, 2503.5367105046867, 6532.795825292272, 9756.064172800725], [2016.9598997834726, 9246.468446682007, 7917.631622499911, 7530.075198225538, 1619.9210624035043, 8192.289210321009, 111.78933513454669, 1304.2859282076513, 752.9875736889525, 805.8026634404869, 3551.4066295443845, 5397.733935371496, 4669.6567467481555, 4794.75142820851, 4543.875056844882, 3805.9629250337543, 5742.679148326456, 3813.8720700893437, 5210.151412919032, 5556.602949642819, 2200.424210202666, 5908.92594615778, 13.819841484519202, 1329.454109503373, 3028.833109958248, 8592.293540323464, 9978.59670979421, 3605.121961455566, 5381.409564276148, 1891.7229437227568, 625.9300378157828, 2758.668754886496, 6051.709933922486, 6457.36281514481, 5548.754777623672], [8850.151741072603, 6337.421968969598, 6419.680943286824, 9156.134838807471, 8322.880320938539, 5346.094263229739, 8840.13035584083, 4662.998040082982, 5049.325678804513, 6885.637071688473, 4883.744421558373, 2324.765558938434, 995.0281814899331, 4461.416494281927, 9543.834187148504, 784.6027172885606, 4558.569173648864, 7373.848141952878, 9152.707277929396, 3448.6407116186224, 3753.543292707031, 4293.096821412292], [1409.0526006258365, 816.3081240623837, 2140.41426162899, 728.4924219143152, 2193.525472941873, 4035.7606724635307, 6500.846781261058, 5527.736115595666, 2134.0180018693986, 6779.435167553661, 1806.1545644495725, 9627.301890803697], [2371.0568858922543, 3268.660813251466, 1707.0991863723361, 5378.8673760312895, 4595.50873089922, 2635.8908557704995, 691.8444475043295, 1624.4384043918103, 8928.107824993145, 6825.313895904731, 8182.165500835241, 2451.226122788347, 7782.688704839678, 6441.579872434251, 4321.009439314746, 4899.256098629653, 5519.087620918876, 45.86639299398176, 429.87376466871564, 6270.117082341795, 6415.83724491815, 590.2483422808136, 2744.8282476562367, 3286.420684963404, 9655.583401408132, 5203.85048223821, 8915.078884333285, 2608.1519486714988, 886.3789741564909, 6130.506796586644, 6650.901924046862, 6646.892160204216, 3289.49925972008, 5166.474954280374, 6759.760310020064, 5274.430205929131, 5227.164076346812, 8287.373511433061, 8205.14217850992, 3862.4949439064203, 7981.66493597097, 3621.863491818439, 1773.8539613657788, 7194.120248679593, 6717.104192113617, 9016.56618386249], [4918.488645705508, 4863.9376793380325, 7980.4716752546, 8867.75386799514, 7286.076902807735, 6413.32763495569, 7345.819132709017, 610.4954669263795, 6823.681549442864, 1375.05106487004, 5238.380502512437, 2773.5771144536634, 1491.8279295443392, 7856.576929303261, 6541.511110001304, 9898.82817639193, 2431.5435459289947, 2730.7902667354133, 9195.287603503173, 6925.56268238798, 5431.128027542276, 8702.555149921645, 6465.507768740284, 9314.270576749725, 6272.806736480676, 3446.023537244589, 6842.356648227475, 5788.729554244277, 1502.222414850204, 5144.345936259722, 6576.536519145917, 2388.5817800660634, 9895.843552802167, 8863.44954106686, 8659.39270167813, 6782.724020047004, 6901.026465987045], [9835.349971287455, 1349.9943677780557, 9305.006231475043, 7682.072854084074, 7772.435685418998, 6457.172433005703, 2271.0896412754787, 147.3581960989412, 5040.667292338796, 5347.141489987937, 3007.9371262367195], [6024.724622587527, 1333.55102363379, 7543.244958334469, 9460.475824602792, 5402.777961971936, 8618.077786578586, 7680.609290490088, 5356.651624620611, 3081.6630316517667, 9965.820175569215, 7449.902533219914, 2376.8033440694426, 2121.6403598925017, 5899.797061644942, 8738.967016335799, 6819.82087022954], [3658.3990216338057, 5939.885133721119, 6112.535663798665, 4603.757105062263, 3601.7182918941257, 2699.3894158179332, 7634.713427911456, 1785.935936680989, 6282.120568441831, 5216.58891069557, 5607.715652949593, 5173.8490353923025, 7091.689227700492, 7231.192245003612, 8164.945945372898, 691.0808086432995, 8884.363372959273, 880.702711513005, 2983.6539638181393, 7041.501334247409, 2686.9984210291477, 6039.4806880060305, 4397.578815778263, 4727.811059409236, 8382.722608048367, 9206.150345275291, 172.2170912991472, 2020.4702767795213, 5489.448690729701, 2451.26584431948, 3295.4350676203826, 4629.077813268916, 343.6354616846271, 5913.229158529008, 2178.835131759951, 8464.236722574358, 598.6751867838647, 1890.7273951970649, 9233.763123524577, 3511.4462447810624, 7198.449866811291, 7009.77653163331, 8249.84422453666, 4282.457347563149, 2271.24825809504, 5764.120163554731, 5765.436670299819, 8908.501071223765, 2586.0376485095303], [4178.517530004291, 8230.813420124246, 1482.5779208939982, 9884.823630994786, 7654.976401516819, 7172.9744832796405, 6743.457935859208, 2332.0202265026755, 6512.820966135465, 7899.27033659936, 6446.637651589306, 3660.9711365100516, 6983.0340219305535, 8514.370249450678, 1743.2333221598017, 5103.440073973708, 9266.372786086862, 4118.043957388042, 5646.298272664013, 5981.854812259621, 3200.6662612242185, 6635.177996178426, 9679.83767911182, 3226.414516089032, 9037.63040871817, 1667.244125906292, 437.75555568785876, 8080.445197603589, 7182.504146702597, 8450.080668876279, 5837.320531337393, 375.1630048786392, 6609.658242430057, 4138.324209656617, 4978.355962743171], [6943.097108273823, 8155.800311882496, 881.1561722205652, 6892.581313027855, 8870.412782607324, 8669.932116289347, 570.9050959816841, 3403.556267239408, 6454.311530504761, 1789.7908209345858, 7910.710586936548, 5812.846543860358, 6168.21145124294, 2131.0842431388164, 2770.4029575820955, 1574.8495056694844, 8538.95214350614, 3406.107386087113, 2908.900240552177, 9882.928919376212, 2844.4878840063193, 43.21457208309343, 7278.594953930636, 9356.662142497536, 6209.878587941289, 3990.0985725352966, 414.3501395268456, 8619.011907510358, 6999.1215509988015, 2882.9851019850194], [9844.923038076766, 6980.156846171918, 3950.1442565126367, 3157.4009365459556, 5223.187529515773, 4385.453833112532, 5325.893429872211, 3353.2248195726265, 2442.165605224922, 3655.8385765512303, 3898.449238531656, 8850.04098103363, 6831.015148578976, 4445.821672553541, 9928.380860823137, 9561.952605608369, 1591.1130291936638, 5403.707165706667, 2275.6687548872, 887.1665703941445, 1270.6708733832606, 15.351416031957887, 6885.875136030228, 9550.622085409022, 769.7305357431617, 4632.5188789504755, 3118.15405662019, 7553.524447042849, 4528.6508356550885, 6481.3993346127445, 6479.947453700064, 5346.224605722107, 7272.600816935826, 261.5836192208221, 5155.049534248697, 5501.689301147346, 417.6298514208843, 2176.1185299140107, 6866.720403076896, 2801.874422363495, 6539.364493633207, 2948.3952227572686, 3413.699419210543, 8937.812262772239, 260.2567282196444, 9974.652627956628, 3607.8218449527135, 4313.257989389619, 5126.9798391913355], [6633.663300606726, 1812.9942057781057, 1654.7655510188663, 8405.163469784291, 1953.9035308876119, 8957.383693535636, 1421.2991902099047, 9264.40639576394, 8150.024375652974, 2257.3830199676427, 2479.3344627483484, 4043.056101781555, 9247.05324493969, 7363.206663924256, 8490.180569522778, 2927.295097067805, 3679.2436731106004, 3838.815927824232, 3115.4209839633218, 7612.651962526704, 7076.710446359618, 825.7143449578574, 9864.274122425695, 9647.78655096705, 7548.744154086509, 9815.450355850051, 8653.699152037381, 4050.238822185216, 5272.888444100065, 6951.384129122965, 1394.39534640736, 7755.935683847396, 5317.102211979815], [8829.674867773414, 6689.896932346349, 1968.0933078351115, 4809.007582058182, 6069.87219516547, 9766.476615420386, 8993.904574223372, 281.1877463140244, 5576.660306049759, 7140.548946726968, 2518.194869927194, 2172.7143296254435, 5507.955541433988, 5420.491404996137, 8394.755280403098, 4012.132315372791, 6389.889892691528, 717.5893819573375, 2875.0684389259386, 5280.900234755885, 8161.863197586057, 3926.09778356536, 7022.709269632878, 106.07736204608864, 2617.3249490483054, 8109.0289788950895, 4083.165322330473, 5420.617161522736, 4445.31100910545, 9393.19511825442, 176.7904030369116, 514.69093147267, 7614.2873289591125, 6264.256156371076, 1595.849249955039, 4210.816847220884, 127.47354248535902, 9212.920824942166, 2676.3018953846185, 7651.925841175547, 4176.854241193708, 3254.032717531873, 5064.677632904187], [2933.30773145417, 7167.004460596055, 6730.0751341762925, 1612.3416038398664, 9996.385398599057], [1469.1245592389023, 738.4910375434861, 5091.743233692105, 4943.243843219373, 8276.601429613058, 2099.0155722034933, 1123.1905308985645, 8721.083497458614, 9900.434613544232, 7607.245058601638, 5384.468994284775, 7529.134743235198, 6837.595578988219, 4384.871356847701, 63.287732870004334, 2024.4193945797394, 5173.262923609003, 5685.6159554472, 1043.3138744199034, 6561.322154461737, 5043.419149196029, 1528.205177909735, 8635.632452899306, 6625.361243781218, 1138.9370493081663, 8600.196985866145, 1988.3249787645564, 2698.6573886862807, 3376.856288948763, 9380.474940630262, 3444.5098538813136, 7264.095443784668, 9446.89932278781, 8424.493192525451, 9315.526779885298, 1047.4543557980887, 3662.6853228335076, 3828.4452182545315, 6635.496292334783, 7667.419322235606, 35.21225339409906, 2963.565449291854, 9156.290265259724, 7727.156188255046], [8444.782911920447, 1531.875281624423, 1699.8134908798013, 7098.064080652596, 1705.6887525781183, 4769.810129535693, 4765.399059911866, 3365.3409651977972, 9969.592937121795, 5626.5051907189345, 9397.353074698978, 3239.97430286867, 3201.0073584794072, 2131.5074414166947, 5957.610797969433, 1768.6186313252672, 5616.852203640092], [5673.7710445882185, 1647.625614019551, 5656.936125270759, 1461.1781245051013, 6574.86009082487, 6774.466975453835, 3556.387873542125, 6549.504662488484, 886.9791309380082, 3820.027258607421, 5024.250405254414, 3506.088366609631, 2328.582902932946, 3679.112881703358, 3462.9919828067, 3160.911388035562, 1846.9062209575804, 7117.953023727776, 4143.612558015889, 3572.534316888979, 319.14170051129065, 1991.6701484666844, 4560.568775382851, 8901.408228818616, 6935.299537774818, 8511.84810818133, 3234.869691027137, 1295.0435896601964, 8851.889516538351, 2489.8888199410617, 2150.116130246351, 4658.446390325435, 5811.264860869128, 685.8607919672866, 5378.0726932806465, 9702.618375935705, 9289.55238058894, 5269.520454210251, 7499.026434764086, 6002.394709230661], [5531.687229932249, 5270.626911688324, 6624.91325164783, 9195.735161525663, 9266.277822312304, 9275.612244101923, 8173.831391641886, 1019.8131750228023, 3540.52480573109, 4983.413349807722, 130.21910681093928, 9770.440852859852, 9084.150791955952, 2173.294809269972, 2626.817132323017, 5925.181708485516, 4528.1824472864855, 8068.031788501554, 3141.2705598953207, 3367.1318650759276, 4202.813507746614, 4921.654402545408, 6179.504202375986, 405.8037182681518, 9118.07199473433, 2364.02187704932, 7528.315731917878, 938.6323242878248, 4866.461999667605, 9592.4230672652, 7487.79868696995, 8665.033290573028, 2575.202765522496, 6907.965979702926, 9796.688661165712, 9809.595158621196, 141.61358495260566, 2879.523431694646, 9399.935781123395, 8148.891111247624, 6176.39610921895, 5458.065535590684, 9057.109293696058, 4091.3715908046956, 7455.832236582406, 8438.475825901112], [9744.238368205903, 7257.463958276382, 3501.640602033552, 5097.35039463446, 8356.088347682142, 1013.494789934316, 7760.657819535339, 2812.190929226328, 2095.6075816074826, 1500.6497868172942, 1593.50863029047, 7654.141363404645, 3036.4929462046775, 1264.0074125211331, 7295.376768297045, 4806.278483546197, 7588.593079677283, 862.8315269726494, 9602.080432568271, 8490.755890338718, 6964.467603996281, 846.0767010844494, 3356.979090302684, 8907.430974420711, 2398.102582887749, 4278.797398815162, 830.7948679651822, 2273.3942290608734, 2275.2588065251434, 2776.5976090708787, 8490.43423277904, 7033.653179624773, 7101.244630276114, 3462.954058628571]], [[6241.900245829036, 6667.025729021001, 5691.351954033881, 571.7284163476577, 599.5121330777808, 6243.463062193512, 6717.298231363792, 3608.7492690924137, 9032.092398160055, 5926.293767824268, 6210.655170074396, 4474.741994028476, 1861.945257692308, 1779.876008485327, 5869.991094563328, 5423.461312062491, 1370.6862587942037, 6873.167245632268, 7649.546578266097, 2351.8399326106596, 1989.178556111051, 422.20373285440036, 2925.774069473833, 6272.788011818715, 8279.978442600892, 5970.172054492473, 6285.440742792799, 7304.627499347196, 372.4523079479392, 2940.8339544890937, 7317.6400210247875, 5166.330426233502, 8284.813081839371, 4712.766186568946, 7997.385423676035], [6452.611650019052, 6533.207730947289, 8807.075741968045, 9613.017513620158, 7551.372353415147, 3814.9462465572815, 3178.498657329026, 807.6312013168241, 629.477046023933, 5989.092355191663], [1305.6504233275512, 1205.5849470621283, 2131.0955750784424, 6257.637312213648, 8633.528791950788, 736.2226708854236, 5119.414303257056, 8804.172116612383, 2288.600322833193, 6674.881539883841, 5432.169377077389, 9984.06868017292, 7926.301399413941, 2449.424127914216, 1688.0860689625322, 260.6488247313743, 1178.8654972754252, 2073.6854863269373, 5529.394205300341, 7653.727965408834, 569.9328536601145, 1224.9369795814468, 7797.080337878472, 1005.767754018665, 3090.0776894453675, 455.9069614769562, 9044.51867916772, 1718.965140003418, 6583.579031677243, 4791.924601541926, 7018.857860820445, 9808.375188561504, 1320.5685001544575, 329.7136763666042, 6342.892026874494, 8972.682821764105, 4668.29063954748, 6946.344862709311, 9805.303722784838, 2973.069105760632, 6985.874880236632, 9545.021104493411, 9719.80028292283, 7198.598793755461], [5331.89188600143, 3188.443349871333, 221.02133512022948, 880.68828138539, 1515.4027709793838, 7930.966870782095, 9507.713752644831, 4313.160757690817, 3846.72384161552, 1655.681262068367, 55.170275874311116, 2949.6754977555197, 1910.1840751659095, 4244.735303329609, 8121.260273473295, 3860.8176185770503, 4750.489350886882, 1467.6363234444666, 465.8560983548199, 4940.401342901576, 5809.536778997865, 4565.245203215682], [6828.767147722977, 128.93271215892787, 3797.8224655761874, 8079.884381341665], [4517.275715047743, 8940.097122408839, 7281.039946934588, 27.728369323011258, 3740.264596087575, 4874.93591726158, 8043.314070462276, 5166.097047074663, 4925.980878654775, 3648.0727223990084, 3791.9876484136016, 2912.2565199145156, 3834.847575889263, 1354.5777786291524, 9765.026115064547, 7549.4703666134255, 1936.525418831999, 1478.6811488485152, 893.3329941262602, 3586.843418684723, 7367.442903319976, 5813.70155527669, 8396.79082639397, 8247.306407746588, 6074.220118587592, 5634.113567301089], [7096.526417346024, 7299.596512835649, 6326.555025996232, 3505.971650102451, 4088.5960369402806, 6348.481260870844, 1022.4660759645033, 6479.299624221714, 8255.83540280519, 5318.646177823633, 385.5360954127318, 1742.7901571985306, 383.9634977990947], [8312.439822931368, 7693.173653102019, 9684.846018395066, 5436.851517291458, 2240.2570185572104, 8549.76817377781, 2863.1071822119657, 2364.4898333606247, 8387.6366465958, 235.49213883719779, 5635.75381122587, 8824.638572201757, 5855.982086624727, 9390.895322287037, 9729.264148554501, 7581.889326800262, 7539.671214598107, 8212.126365277514, 3414.4707187305257, 2186.9037265717116, 148.32911299373586, 3907.974409916858, 1171.2309102908814, 8222.6799813232, 9643.24040317058, 8560.840012204286, 8605.631358897996], [2080.1073040550423, 2877.2637236850574, 3818.077902160524, 2477.6928693570053, 7555.588606535247, 3270.181723572487, 4332.255274782373, 6344.623935872137, 7847.221150939287, 1112.3530198820374, 6944.858605401434, 8337.745136833113, 5061.397976451156, 9552.075051082322, 203.72691830435886, 1225.1921990053638, 3211.0942488406326, 1276.8268581899101, 7670.342953764469, 4181.706551221689, 1406.5485053574666, 7060.566377790574, 25.700288190759757, 8334.288430677061, 2867.655518166218, 9739.933759812533, 310.29910419946293, 2246.3458997758767, 8825.811097236192, 8480.717272229293, 8484.35331937365, 9453.101358520635, 5368.758902198425, 6711.186412720251, 4527.55608166248, 9086.130657920075, 1931.1440358139143, 5924.407535867492, 5380.415819375357], [3846.753290795024, 1732.6441416861594, 4543.440737272442, 7218.242312741953, 6321.872177360868, 6764.197557825947, 3503.1296065699958, 4159.706453642625, 2760.640834432676, 6725.738873358718, 593.3134928627992, 6645.189779519307, 1452.3664747870412, 6717.461512638625, 9729.597277117091, 3076.719110299966, 135.3391256749814, 7528.0224422840265, 6012.289608040301, 4014.73128472828, 1071.8528463489108, 4668.170320820327, 9114.25103505039, 751.3155545422634, 8509.699032980909, 8679.657328254336, 4057.877122536042, 7402.240832613551, 4542.251198006061, 3308.334311294533, 5502.399907436886, 4604.392185814295, 9896.08110125432, 6017.690628500904, 8830.375455102685, 9694.940638011103, 1270.5221941729205, 3630.751473478894, 6743.2106963398455, 4667.728606843594, 4731.991841183002, 8993.050057035647, 4536.511085240959, 4828.172159143931, 9631.71972231329, 3019.3395883885764, 5681.601206319076, 5189.918716253909, 9457.451025038778], [9858.490575174568, 7707.905607803832, 5021.584175638065, 2126.0930665803635, 1093.0428368047963, 3745.011847594666, 9771.166318207452, 472.61146441024306, 4008.6772252631677, 1585.794170199577, 483.33570777268295, 5227.284291977262, 3565.305570733922, 9644.097132819306, 829.7755761930725, 6055.538965298497, 175.36201751864766, 3413.0217400469296, 2640.2753174918603, 9155.091839148372, 2204.147217534156, 9646.824594662883, 5535.653721601298, 6999.1296089517145, 2052.106730093315, 8765.774235212373, 5618.504221894872, 1823.101083855152, 6450.228448742152, 3709.0840347005037, 2562.8685396231153, 9404.89205337425, 8223.893813893073], [2933.9119028337823, 1670.1502558318027, 6087.785052928502, 5830.496579124935, 6012.667523752366, 8605.549463703592, 8391.896202104264, 6781.779546376485, 8722.263881711979, 5244.490064787881, 7941.369082757103, 9725.010319453018, 5820.878548931412, 6412.693111293454, 8686.079007513366, 4832.8557027198185, 1971.5020676134554, 4713.00315718324, 23.95004735105899, 2043.0266876244518, 1744.4110544238877, 9582.30503057717, 1370.9954690178238, 4895.774712815934, 308.82987894597204, 4401.248882448594, 1374.6357709485146, 4959.382604347441, 3218.244984172339, 1034.0450323702598, 6737.440724743908, 634.1304172158091, 4999.24253043374, 6330.331284021177, 9139.827275144382], [6997.489257897447, 6806.800562474949, 3902.9309997574023, 6376.073892981555, 1670.3644171585763, 7131.487894217919, 1408.3540095032376, 412.2056336025215, 4304.210459722586, 3124.575744335187, 7828.129832271993, 2643.8811253771487, 6873.465900546271, 6509.248773293544, 579.0570266395179, 9394.219664404045, 8578.463028905046, 3835.6538352530943, 6162.595716602937, 9170.955208900608, 2407.4357214948327], [4870.0107594261635, 3324.1339614958356, 5932.348671574118, 7765.827307806859, 2031.094134376461, 6089.677488554667, 1434.5229583013374, 1396.7772537825929, 7054.601057121471, 1148.3122565408987, 7728.834323176571, 4487.6592414211855, 5517.523660019319, 5899.975978067698, 3265.7994047891757, 7871.939795019093, 9946.250158526567, 5665.668416355023, 6987.594052558873, 5279.374685773946, 9511.549579080132, 431.7493942707229, 3461.0964351048756, 309.70060280253506, 8983.523425189924, 2456.575385065778, 1265.8660899152085], [8529.096294439394, 2980.465082017305, 1247.057568565425, 1683.7901051144765, 2346.8054018979224, 5410.236203075452, 9768.449536539629, 754.8137030947732, 4162.952453094405, 6112.1743131963, 273.037880594309, 808.4213368212689, 4615.3391439094175, 8759.276596590496, 8992.405678183211, 3879.2595073552816, 7503.976937076325, 2178.3774847327077, 9626.995412254648, 4762.384453793243, 4304.784074817238, 1051.1728645390829, 4006.2527490710277, 9709.333274524432, 3201.6798740910435, 2478.8484504271014, 3115.7977329178675, 1663.9006122470812, 9723.917944178913, 8904.652104789036, 4893.318186460499, 1308.7180114241014, 6679.899715892782, 5764.6618025963535, 3532.443421003797, 3583.4289228422845, 9154.05602075901, 4110.438471296866, 547.2737136121641, 8607.280965840293, 6844.321723607965, 7456.603075966929, 3281.0807490473303, 2789.154901361526, 782.2666839299308, 4682.115076692754, 8304.025574969566], [7867.432895770139, 7142.481633795158, 616.3828766647327], [3387.3802798770657, 7144.366061237613, 9860.806002618854, 8079.830027999986, 960.6136403709353, 3649.091708134886, 2944.5665577603286, 4517.417094476161, 4018.920033033857, 2443.3697424046786, 5216.456010749324, 8490.246719274373, 5191.955006675276, 7368.537038688761, 1669.5608867539668, 3879.493413167572, 9889.474876929211, 9992.481486612269, 3660.7510158002187, 8138.870105890437, 4698.871535878607, 8170.396330191924, 2996.6723471223313, 3207.835113478479, 7602.8165060169995, 8428.482452334038, 3854.3925110712416, 4292.9644291593695, 3257.118330538692, 3205.1510927519776, 2351.8971372001183, 7927.634015142587, 2271.416178727619, 5279.455156231754, 9528.477679256916], [4809.558214848555, 6512.113001668395, 4126.780341230375, 8132.839211158911, 3910.846617356295, 3156.911078233957, 6491.515503128564, 6847.145249167793, 6321.306375289207], [5132.246799974731, 6370.43772475688, 758.3383190726755, 3822.1912772556598, 8392.762450933264, 6840.7826438867105, 906.171738227003, 3924.4554022145207, 4394.162240587243, 2168.1300970892626, 4967.331263775884, 3161.0163687093864, 5567.720858829881, 7250.935239567056, 3349.9827470371847, 7062.4877637767795, 8205.045407756192, 2845.672970275027, 3632.275199296913, 6278.2813550024985, 3311.7990092854398, 1244.3732947943565, 125.2291572270614, 966.8954156959719, 594.1764921541792, 665.1263367721838, 6373.084192169837, 2661.853212656231, 4270.594558825736, 3354.1377968170336, 4191.810824563139, 1447.4469824976234, 6100.290756172702, 7643.94222186592, 8064.262463824555, 4159.99596569145, 314.409524232685, 9662.847377558683, 1963.453914000497, 3833.110525685618, 1382.4852909355711, 5216.451524604983, 1923.6243302753153, 9366.946960746385, 7010.521276782435, 6438.24964953168, 6613.800664284052], [383.97664429939414, 6189.259103225889, 223.53430583521904, 6482.472343800064, 2428.333587831151, 9818.068366530008, 9781.347438012055], [3898.2961108062773, 9291.534494677917, 7317.398922809986, 6426.207629331639, 6967.6541718465505, 3752.1475543957704, 9733.352111551661, 5361.463573450924, 7189.933607605151, 8777.4997082165, 2824.233126142458, 7816.366398242133, 877.4402752427968, 6056.868857289174, 2182.6819683042677, 1280.1579204947611, 4436.555287965954, 1661.3145376490336, 2092.423589364817, 8260.380550864431, 5966.315646458932, 2432.5698050980773, 2739.185628046621, 7245.886255806842, 268.77157782930425, 1233.0706867884178, 5943.957524802674, 7405.470958601446, 501.9242163945048, 2971.016181534857, 7782.648869979246, 9913.953451407731], [2235.11258828775, 9865.00539197128, 8231.382920563366, 2952.921926617926, 2929.760559635134, 9595.450532333396, 6384.407369365793, 9412.122783013581, 175.63593700402947, 9514.63820403047, 371.6559244036188, 7825.43779507584], [5590.251121718374, 1407.730019930593, 6933.377338234666, 538.4946470584406, 3654.1200805880903, 5562.66912969946, 8950.192777377413, 312.53390952430624, 1975.0088926924968, 8822.979565516376, 6368.251716233585, 3094.0902834724347, 2238.6087134777144], [8225.011588911006, 447.0286611190544, 2531.794580124993, 5786.881077286801, 399.8362563738822, 1165.8075770758226, 2026.1937515817751, 196.0265843025899, 9049.138866114914, 9141.277243142813, 1800.317527008992, 688.9468968954048, 1037.703653911477, 5719.273573098196, 8613.212547189436, 447.6345582866159, 2408.581086134727, 338.52365298329136, 8235.860036451202, 8121.796753653178, 836.9094638861175, 8.520867197108206, 4628.612686002925, 4344.374163287639, 9274.546442753306, 2372.0278182942657, 3812.8030782577302, 3816.980924729987, 9211.587577868697, 6548.961092866181, 7683.6400177831965, 7210.282733624986, 8488.116010841984, 102.69806692702055, 7549.429474892514, 6546.469769481529, 6756.096944305571, 8869.645061932615, 6320.84551678245, 720.6570295438963, 9866.068905769132, 475.1409373336379, 2798.0614694422534, 9503.48700738789, 8161.54971021859, 1975.2144598311195, 3184.927" MAXIMIZE_SUM_ARRII,"static int f_filled ( int arr [ ] , int n ) { Arrays . sort ( arr ) ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += ( arr [ i ] * i ) ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [58965, 28832, 126, 5898, 3418, 155, 78220, 30682, 5, 9269]; int [] [] param0 = [[2, 3, 4, 6, 7, 8, 9, 11, 19, 23, 24, 30, 31, 31, 32, 41, 43, 43, 46, 47, 50, 50, 51, 53, 57, 63, 63, 69, 73, 74, 79, 80, 81, 81, 85, 86, 88, 92, 93, 95, 98, 99], [-98, -98, -82, -80, -78, -76, -74, -68, -62, -58, -58, -52, -42, -42, -40, -34, -16, -10, -10, -6, 10, 12, 20, 32, 52, 62, 66, 68, 72, 76, 76, 80, 90, 90, 90, 90, 92, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [8, 13, 14, 42, 44, 44, 44, 45, 47, 52, 58, 79, 98, 99], [-90, -88, -68, -66, -46, -42, -40, -20, -16, 4, 8, 8, 8, 20, 28, 52, 84, 98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [5, 6, 7, 9, 11, 13, 16, 19, 22, 25, 26, 27, 28, 29, 32, 32, 32, 33, 36, 40, 43, 43, 47, 49, 51, 51, 52, 53, 59, 61, 63, 65, 66, 66, 67, 72, 73, 73, 75, 76, 80, 86, 87, 89, 89, 91, 96, 98, 99], [-98, -96, -90, -78, -66, -52, -48, -38, -34, -32, -30, -26, -24, -22, -20, -20, -14, -14, -12, -12, -8, -6, -4, 2, 6, 26, 28, 32, 32, 34, 40, 40, 48, 52, 54, 64, 64, 68, 70, 76, 88, 92, 96], [0, 0, 1, 1], [18, 20, 21, 32, 34, 44, 47, 49, 49, 49, 62, 71, 75, 84, 84, 88, 88]]; int [] param1 = [42, 38, 22, 14, 18, 21, 49, 43, 4, 17]; 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); } " MAXIMIZE_SUM_CONSECUTIVE_DIFFERENCES_CIRCULAR_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int sum = 0 ; Arrays . sort ( arr ) ; for ( int i = 0 ; i < n / 2 ; i ++ ) { sum -= ( 2 * arr [ i ] ) ; sum += ( 2 * arr [ n - i - 1 ] ) ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1708, 3788, 6, 306, 3172, 44, 2146, 2704, 40, 688]; int [] [] param0 = [[8, 9, 12, 13, 17, 21, 24, 29, 37, 37, 39, 40, 41, 45, 49, 50, 53, 54, 56, 59, 60, 60, 70, 71, 72, 74, 77, 77, 78, 85, 89, 89, 90, 90, 95, 98, 98], [-92, -84, -84, -84, -84, -80, -80, -80, -64, -52, -40, -32, -20, -18, -16, 0, 6, 14, 20, 26, 28, 30, 32, 32, 44, 48, 48, 52, 54, 66, 76, 78, 88, 92, 94, 96], [0, 0, 0, 1, 1, 1], [7, 47, 53, 59, 80, 84, 96], [-88, -80, -68, -62, -60, -60, -48, -46, -44, -38, -16, -16, 0, 0, 2, 8, 20, 36, 40, 40, 44, 54, 60, 68, 70, 82, 82, 84, 92, 94, 96], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 5, 10, 11, 13, 14, 15, 17, 17, 23, 23, 24, 27, 27, 28, 29, 30, 40, 42, 43, 46, 47, 51, 52, 57, 64, 65, 73, 74, 75, 76, 77, 81, 81, 82, 87, 89, 93, 95, 95, 99], [-94, -92, -84, -84, -76, -72, -72, -72, -54, -48, -38, -22, -16, -12, 2, 2, 12, 20, 20, 24, 26, 26, 26, 26, 30, 38, 48, 50, 84, 86], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [7, 8, 27, 31, 37, 46, 46, 52, 53, 53, 56, 57, 57, 73, 73, 74, 80, 84, 97]]; int [] param1 = [37, 36, 6, 7, 31, 48, 41, 30, 47, 19]; 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); } " MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES,"static int f_filled ( int s ) { int maxvalue = 0 ; for ( int i = 1 ; i <= s - 2 ; i ++ ) { for ( int j = 1 ; j <= s - 1 ; j ++ ) { int k = s - i - j ; maxvalue = Math . max ( maxvalue , i * j * k ) ; } } return maxvalue ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [11132, 4096, 7600, 392, 100, 10648, 0, 15625, 7220, 17576]; int [] param0 = [67, 48, 59, 22, 14, 66, 1, 75, 58, 78]; 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); } " MAXIMIZE_VOLUME_CUBOID_GIVEN_SUM_SIDES_1,"static int f_filled ( int s ) { int length = s / 3 ; s -= length ; int breadth = s / 2 ; int height = s - breadth ; return length * breadth * height ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [18, 32768, 32768, 32768, 64, 31744, 13824, 19683, 2744, 80]; int [] param0 = [8, 96, 96, 96, 12, 95, 72, 81, 42, 13]; 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_TRIPLET_SUM_ARRAY,"static int f_filled ( int arr [ ] , int n ) { int sum = - 1000000 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) for ( int k = j + 1 ; k < n ; k ++ ) if ( sum < arr [ i ] + arr [ j ] + arr [ k ] ) sum = arr [ i ] + arr [ j ] + arr [ k ] ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [176, 276, 3, 290, 158, 3, 242, 288, 2, 276]; int [] [] param0 = [[6, 10, 14, 19, 24, 29, 42, 43, 44, 47, 47, 55, 57, 59, 60, 61, 76, 76, 77, 81, 84, 92, 92, 93, 95, 97], [-98, 72, 52, -62, 74, -26, -82, -74, 90, 58, 94, -2, 76, -28, 12, 64, -94, 86, 56, 10, 40, 20, 92, -4, -80, 26, -40, 36, 66, -46, 4, -42, -76, 76, -90, -48, 22, 30, 48, 38, 78], [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], [96, 96, 38, 26, 2, 36, 15, 51, 78, 98, 94, 31, 62, 21, 7, 68, 37, 4], [-8, 12, 68, 78, 78], [0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], [1, 15, 16, 17, 28, 28, 28, 30, 31, 37, 38, 38, 45, 45, 46, 46, 50, 51, 53, 53, 55, 55, 56, 58, 58, 64, 78, 82, 82, 85, 87, 89, 89, 90, 94, 95], [-56, -72, -20, 88, 20, 86, 30, 36, -44, -66, -26, -88, 12, -76, 78, 62, 62, 68, -34, 0, -22, 64, 72, 56, -64, -16, -4, 86, 0, 98, -70, 98, -68, 92, -84, -56, 28, -74, 6, -10, -82, 36, -12, -26, 66, -60, -68, 70, 2], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [85, 31, 15, 68, 92, 89, 32, 56, 27, 70, 82, 58, 63, 83, 89, 95, 78, 9, 27, 34, 24, 42, 66, 6, 1, 71, 55, 23, 75, 26, 19, 58, 25]]; int [] param1 = [15, 28, 22, 10, 4, 35, 29, 36, 11, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_AREA_RECTANGLE_PICKING_FOUR_SIDES_ARRAY,"static int f_filled ( Integer arr [ ] , int n ) { Arrays . sort ( arr , Collections . reverseOrder ( ) ) ; int [ ] dimension = { 0 , 0 }; for ( int i = 0 , j = 0 ; i < n - 1 && j < 2 ; i ++ ) if ( arr [ i ] == arr [ i + 1 ] ) dimension [ j ++ ] = arr [ i ++ ] ; return ( dimension [ 0 ] * dimension [ 1 ] ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4845, 0, 1, 1632, 5412, 1, 5525, 1248, 1, 4794]; int [] [] param0 = [[99, 96, 95, 95, 92, 84, 83, 82, 81, 74, 72, 68, 67, 52, 51, 51, 49, 47, 44, 40, 36, 25, 24, 17, 16, 14, 12, 11, 9, 8, 6, 5, 1], [-32, -54, -82, -92], [1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [99, 96, 96, 94, 68, 65, 62, 60, 45, 44, 30, 26, 17, 17, 16, 15, 2], [98, 94, 82, 82, 74, 66, 66, 56, 54, 46, 16, -28, -34, -42, -50, -52, -78, -82, -88], [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], [97, 96, 93, 87, 85, 85, 75, 68, 65, 65, 64, 63, 62, 58, 56, 52, 49, 44, 43, 38, 33, 30, 29, 28, 27, 25, 24, 23, 14, 14, 13, 10, 8, 8, 8, 6, 1], [78, 78, 76, 70, 60, 54, 50, 32, 16, 16, 6, -6, -20, -56, -64, -68, -70, -90, -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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], [94, 94, 94, 90, 84, 82, 75, 71, 57, 55, 53, 51, 51, 43, 35, 31, 30, 29, 22, 18, 14, 10, 7, 5, 4]]; int [] param1 = [33, 4, 18, 17, 19, 26, 37, 20, 34, 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); } " MAXIMUM_AVERAGE_SUM_PARTITION_ARRAY,"static double f_filled ( int [ ] A , int K ) { int n = A . length ; double [ ] pre_sum = new double [ n + 1 ] ; pre_sum [ 0 ] = 0 ; for ( int i = 0 ; i < n ; i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ] ; double [ ] dp = new double [ n ] ; double sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ) ; for ( int k = 0 ; k < K - 1 ; k ++ ) for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) dp [ i ] = Math . max ( dp [ i ] , ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] ) ; return dp [ 0 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [1742.8333333333333, 856.9, 11.0, 2092.5, 1052.5185185185185, 10.0, 1996.1875, 358.0, 22.0, 1060.0]; int [] [] param0 = [[4, 11, 14, 27, 32, 37, 39, 49, 52, 53, 57, 62, 67, 67, 68, 69, 76, 77, 78, 81, 85, 85, 87, 91, 91, 91, 99, 99, 99], [80, 12, 32, 44, 24, 82, -40, 42, 26, 36, 58, 52, -34, 44, 12, -18, -72, 52, 2, -8, 22, -18, 98, -60, 62, 92, -46, 20, 20, -46, 52, 94, 0, -28, -22, 80, 26, -92, -50, 48, -80], [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], [32, 16, 67, 53, 99, 56, 80, 92, 84, 21, 36, 46, 94, 31, 63, 67, 59, 88, 41, 17, 74, 47, 95, 12, 27, 99, 32, 4, 82, 31, 65, 40, 93, 72, 23, 33, 93, 9, 62, 47], [-92, -86, -80, -78, -72, -70, -70, -68, -66, -62, -60, -54, -54, -52, -52, -40, -36, -32, -28, -26, -22, -22, -20, -16, -16, -8, 0, 6, 8, 10, 14, 18, 20, 42, 46, 52, 60, 66, 68, 70, 74, 86, 88, 88, 92, 94, 98], [1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0], [1, 1, 3, 3, 6, 7, 10, 11, 12, 13, 16, 16, 22, 23, 24, 27, 28, 30, 30, 30, 31, 33, 35, 35, 39, 40, 41, 52, 52, 58, 59, 60, 61, 61, 66, 66, 71, 73, 74, 75, 75, 76, 80, 83, 85, 95, 96, 97, 97], [28, -52, 48, 96, 54, 94, 60, 18], [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], [26, 80, 12, 87, 90, 98, 46, 91, 38, 46, 20, 64, 53, 4, 60, 87, 44, 88, 22, 30]]; int [] param1 = [24, 26, 15, 36, 36, 16, 34, 7, 31, 19]; 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_COST_MAKE_ARRAY_SIZE_1_REMOVING_LARGER_PAIRS,"static int f_filled ( int [ ] a , int n ) { int min = a [ 0 ] ; for ( int i = 1 ; i < a . length ; i ++ ) { if ( a [ i ] < min ) min = a [ i ] ; } return ( n - 1 ) * min ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [38, -6, 0, 185, -2640, 0, 48, -2112, 0, 66]; int [] [] param0 = [[1, 2, 3, 4, 7, 8, 10, 10, 16, 20, 22, 22, 23, 23, 23, 27, 29, 32, 35, 39, 41, 46, 51, 53, 54, 59, 59, 60, 61, 69, 70, 70, 79, 79, 81, 84, 90, 91, 98], [-6, 10], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [20, 61, 92, 45, 75, 26, 83, 5, 85, 27, 39, 88, 36, 39, 83, 41, 56, 77, 39, 69, 72, 98, 39, 15, 29, 69, 64, 92, 96, 49, 59, 62, 53, 82, 40, 37, 29, 41], [-88, -60, -60, -58, -56, -56, -46, -44, -40, -38, -32, -28, -22, -18, -12, -4, -2, 10, 24, 24, 28, 38, 42, 46, 54, 64, 72, 74, 78, 96, 96], [0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1], [1, 4, 6, 9, 10, 12, 17, 17, 18, 21, 22, 26, 26, 31, 32, 33, 34, 39, 42, 43, 45, 46, 48, 50, 53, 53, 54, 55, 60, 61, 62, 63, 63, 64, 70, 70, 70, 71, 71, 78, 86, 88, 91, 92, 95, 95, 96, 97, 99], [-42, 44, -80, -60, 48, 66, 54, -76, 26, -74, -10, 46, -50, 42, -26, -24, -14, 36, -2, -26, 16, -10, 20, -88, -78], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [65, 32, 66, 82, 86, 98, 15, 33, 57, 3, 73, 45, 90, 82, 33, 99, 44, 76, 50, 89, 5, 7, 64]]; int [] param1 = [39, 2, 18, 38, 31, 46, 49, 25, 10, 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); } " PRINT_WORDS_STRING_REVERSE_ORDER,"static String f_filled ( String str ) { int i = str . length ( ) - 1 ; int start , end = i + 1 ; String result = """" ; while ( i >= 0 ) { if ( str . charAt ( i ) == ' ' ) { start = i + 1 ; while ( start != end ) result += str . charAt ( start ++ ) ; result += ' ' ; end = i ; } i -- ; } start = 0 ; while ( start != end ) result += str . charAt ( start ++ ) ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""yz dm m"", ""71 57 48 65"", ""010 01"", ""vhbyi mt"", ""1 9 44 19"", ""0"", "" vui z"", ""055 9 36643 591 7"", ""01"", ""ygaijpy ti""]; string [] param0 = [""m dm yz"", ""65 48 57 71"", ""01 010"", ""mt vhbyi"", ""19 44 9 1"", ""0"", ""z vui "", ""7 591 36643 9 055"", ""01"", ""ti ygaijpy""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_CONSECUTIVE_REPEATING_CHARACTER_STRING_1,"static char f_filled ( String str ) { int n = str . length ( ) ; int count = 0 ; char res = str . charAt ( 0 ) ; int cur_count = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( i < n - 1 && str . charAt ( i ) == str . charAt ( i + 1 ) ) cur_count ++ ; else { if ( cur_count > count ) { count = cur_count ; res = str . charAt ( i ) ; } cur_count = 1 ; } } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ char [] results = ['e', '3', '1', 'a', '1', '1', 'w', '1', '1', 'a']; string [] param0 = [""geeekk"", ""3786868"", ""110"", ""aaaabbcbbb"", ""11"", ""011101"", ""wohnyjylc"", ""3141711779"", ""10111101101"", ""aabbabababcc""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_WEIGHT_PATH_ENDING_ELEMENT_LAST_ROW_MATRIX,"static int f_filled ( int mat [ ] [ ] , int N ) { int dp [ ] [ ] = new int [ N ] [ N ] ; dp [ 0 ] [ 0 ] = mat [ 0 ] [ 0 ] ; for ( int i = 1 ; i < N ; i ++ ) dp [ i ] [ 0 ] = mat [ i ] [ 0 ] + dp [ i - 1 ] [ 0 ] ; for ( int i = 1 ; i < N ; i ++ ) for ( int j = 1 ; j < i + 1 && j < N ; j ++ ) dp [ i ] [ j ] = mat [ i ] [ j ] + Math . max ( dp [ i - 1 ] [ j - 1 ] , dp [ i - 1 ] [ j ] ) ; int result = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( result < dp [ N - 1 ] [ i ] ) result = dp [ N - 1 ] [ i ] ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1387, 452, 0, 260, 48, 21, 2087, 328, 1, 364]; int [] [] [] param0 = [[[1, 3, 17, 22, 24, 29, 36, 38, 41, 42, 44, 44, 47, 48, 49, 51, 52, 54, 64, 69, 70, 77, 79, 82, 86, 86, 87, 88, 97, 99], [5, 6, 17, 21, 27, 27, 37, 39, 47, 48, 48, 52, 53, 54, 57, 59, 61, 63, 68, 72, 75, 77, 78, 81, 88, 89, 91, 95, 95, 97], [2, 8, 10, 16, 17, 18, 18, 18, 20, 27, 33, 35, 36, 42, 48, 51, 56, 66, 72, 72, 75, 76, 76, 76, 84, 85, 91, 94, 96, 98], [1, 2, 4, 11, 12, 12, 14, 21, 24, 26, 30, 33, 37, 42, 43, 47, 54, 56, 62, 64, 67, 68, 69, 71, 72, 73, 86, 86, 90, 93], [1, 1, 3, 7, 9, 10, 11, 12, 14, 14, 15, 17, 21, 25, 26, 40, 45, 46, 46, 48, 49, 54, 56, 60, 64, 68, 68, 73, 93, 93], [8, 11, 12, 13, 13, 15, 19, 20, 24, 27, 29, 31, 32, 33, 34, 37, 39, 42, 45, 50, 51, 61, 65, 68, 75, 81, 84, 85, 87, 94], [12, 16, 17, 24, 34, 34, 35, 40, 43, 48, 50, 51, 53, 55, 60, 60, 62, 66, 68, 70, 71, 73, 77, 83, 84, 86, 88, 95, 96, 97], [1, 5, 7, 18, 18, 22, 32, 36, 38, 38, 40, 43, 46, 49, 50, 54, 58, 61, 71, 74, 78, 78, 79, 82, 86, 87, 87, 88, 90, 95], [4, 11, 22, 26, 28, 35, 35, 37, 39, 42, 45, 46, 51, 57, 60, 61, 62, 63, 65, 65, 79, 79, 79, 82, 83, 87, 89, 90, 91, 98], [6, 7, 7, 8, 9, 11, 13, 16, 18, 23, 29, 37, 38, 41, 44, 46, 50, 50, 51, 56, 58, 67, 71, 74, 77, 79, 80, 90, 91, 97], [3, 7, 10, 15, 19, 20, 22, 28, 28, 32, 33, 36, 36, 38, 41, 49, 51, 54, 63, 66, 66, 70, 72, 79, 87, 88, 89, 92, 93, 98], [3, 8, 10, 14, 21, 25, 33, 35, 37, 37, 43, 44, 45, 50, 59, 62, 63, 75, 79, 79, 79, 84, 85, 86, 87, 87, 88, 90, 91, 96], [2, 4, 7, 12, 13, 18, 23, 23, 28, 29, 32, 34, 37, 37, 37, 38, 41, 44, 45, 47, 48, 49, 59, 64, 72, 75, 87, 92, 93, 98], [2, 4, 5, 5, 11, 14, 18, 23, 24, 27, 32, 35, 35, 37, 39, 40, 45, 48, 49, 52, 60, 66, 68, 71, 72, 74, 78, 81, 91, 92], [4, 4, 4, 6, 11, 18, 20, 23, 24, 29, 32, 33, 37, 40, 42, 47, 51, 52, 58, 59, 62, 67, 68, 75, 77, 78, 80, 85, 89, 95], [5, 5, 19, 21, 22, 23, 29, 30, 32, 39, 42, 42, 44, 44, 45, 46, 52, 55, 59, 63, 65, 76, 78, 80, 81, 82, 84, 93, 94, 97], [3, 4, 6, 8, 10, 15, 15, 17, 27, 28, 34, 36, 39, 42, 53, 54, 59, 63, 65, 66, 70, 71, 72, 80, 80, 91, 92, 94, 95, 99], [1, 7, 12, 13, 16, 25, 32, 32, 36, 46, 46, 49, 52, 55, 61, 61, 67, 68, 69, 72, 74, 76, 77, 78, 79, 81, 85, 90, 90, 92], [2, 12, 12, 13, 18, 20, 25, 28, 31, 31, 34, 36, 38, 39, 42, 43, 44, 47, 54, 60, 75, 76, 77, 80, 82, 83, 86, 90, 91, 91], [3, 8, 9, 11, 12, 14, 14, 14, 19, 25, 27, 29, 43, 45, 48, 50, 50, 56, 58, 61, 63, 65, 68, 71, 73, 81, 83, 83, 86, 93], [11, 15, 15, 15, 15, 18, 28, 29, 33, 33, 36, 43, 44, 48, 50, 50, 53, 55, 59, 59, 60, 61, 62, 63, 75, 78, 81, 82, 87, 94], [4, 7, 8, 10, 11, 12, 19, 24, 31, 36, 36, 37, 40, 41, 46, 48, 49, 51, 57, 62, 73, 75, 78, 81, 82, 86, 86, 91, 97, 97], [5, 5, 7, 8, 10, 14, 15, 17, 19, 21, 22, 23, 31, 34, 36, 43, 46, 58, 60, 72, 72, 75, 77, 81, 83, 84, 86, 91, 96, 98], [6, 10, 13, 15, 22, 27, 28, 29, 30, 31, 32, 35, 35, 36, 37, 39, 39, 43, 44, 47, 55, 68, 68, 69, 77, 83, 94, 94, 98, 99], [4, 4, 5, 6, 6, 10, 18, 27, 28, 29, 31, 33, 34, 41, 43, 44, 54, 56, 63, 74, 76, 77, 80, 80, 83, 89, 89, 90, 98, 99], [2, 7, 15, 19, 23, 23, 36, 41, 44, 46, 47, 49, 53, 58, 58, 60, 60, 66, 70, 73, 76, 77, 78, 80, 80, 88, 88, 91, 93, 94], [3, 3, 9, 9, 10, 13, 15, 19, 20, 23, 25, 33, 36, 37, 47, 54, 58, 60, 60, 65, 71, 73, 81, 88, 89, 90, 92, 94, 94, 96], [6, 7, 11, 19, 22, 27, 27, 31, 31, 33, 34, 44, 46, 47, 47, 48, 49, 53, 53, 56, 60, 60, 70, 72, 79, 80, 86, 93, 94, 96], [2, 7, 7, 7, 8, 10, 13, 15, 17, 18, 27, 27, 30, 33, 33, 34, 37, 41, 43, 47, 55, 55, 59, 71, 71, 75, 78, 78, 84, 85], [5, 6, 7, 7, 14, 21, 24, 26, 29, 31, 32, 34, 40, 42, 43, 45, 46, 53, 57, 58, 67, 73, 74, 77, 81, 85, 88, 91, 91, 92]], [[62, 44, 46, 46, -20, -40, 24, 42, -66, -90, 62, -98, 60], [62, 88, -38, -30, 44, -40, 70, -70, 96, 12, 20, -46, -96], [48, 28, -90, 82, 36, -74, 62, 70, -54, 94, 0, 58, 56], [46, -26, -40, 86, -54, -32, 28, 10, 42, -82, -92, 32, 82], [-34, -36, -12, -26, 82, 84, 34, 20, 18, -28, -2, 2, -84], [0, -18, -24, 72, 56, 58, 10, 36, -64, 30, 28, -76, -18], [-16, 20, 0, 62, 66, -28, -4, 42, 46, -84, -50, -86, -84], [76, 62, 52, -38, -76, 14, 32, -76, -46, -8, -86, 22, 16], [16, -74, 6, 30, -2, -30, 88, 90, -66, 44, 34, -80, -32], [72, -92, 92, -42, -8, 50, -8, 54, 18, 22, 36, 32, -32], [72, -90, -82, -60, -58, -66, -76, 84, 64, 34, -90, 20, 6], [4, 56, -4, 80, -62, -66, 8, 36, -30, 76, -18, -74, -34], [-70, 26, -70, -38, -44, -80, 14, 42, -34, -86, -90, 80, 60]], [[0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1], [0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 1, 1, 1]], [[89, 8, 34, 49, 96], [58, 75, 47, 25, 3], [45, 52, 96, 99, 96], [34, 69, 92, 92, 8], [27, 80, 63, 82, 25]], [[-98, -94, -92, -86, -86, -86, -84, -78, -76, -70, -68, -66, -64, -58, -56, -52, -42, -40, -38, -38, -36, -32, -30, -24, -20, -12, -8, 4, 4, 6, 8, 12, 18, 22, 26, 30, 32, 56, 58, 72, 76, 78, 80, 82, 88, 94, 96, 98], [-94, -94, -92, -84, -84, -82, -80, -80, -80, -78, -78, -76, -74, -68, -64, -64, -58, -54, -48, -46, -40, -38, -36, -30, -22, -22, -12, -12, -6, -2, 2, 4, 6, 22, 22, 22, 24, 24, 24, 24, 26, 42, 44, 50, 52, 54, 66, 80], [-98, -92, -92, -84, -80, -76, -76, -70, -64, -60, -60, -52, -48, -48, -46, -46, -36, -32, -30, -24, -22, -16, -14, -8, -8, -4, -2, 0, 2, 2, 2, 8, 10, 12, 22, 32, 38, 38, 40, 48, 64, 68, 76, 78, 78, 86, 96, 96], [-98, -96, -88, -86, -78, -78, -70, -68, -62, -60, -58, -42, -38, -38, -38, -36, -36, -32, -28, -26, -24, -12, -10, -4, 2, 12, 12, 18, 26, 32, 34, 36, 38, 44, 44, 50, 52, 54, 54, 56, 56, 58, 70, 74, 76, 82, 86, 90], [-98, -96, -96, -94, -90, -90, -90, -86, -82, -78, -76, -74, -72, -68, -66, -60, -52, -46, -44, -44, -38, -38, -34, -32, -22, -20, -18, -14, 8, 8, 12, 12, 12, 16, 20, 38, 40, 44, 52, 76, 78, 80, 82, 86, 90, 90, 96, 98], [-88, -84, -84, -80, -78, -70, -68, -66, -62, -62, -54, -52, -48, -42, -42, -40, -32, -30, -26, -26, -24, -24, -14, -6, -4, -2, -2, 4, 4, 8, 22, 24, 40, 42, 52, 52, 56, 56, 58, 64, 72, 72, 74, 74, 86, 92, 96, 98], [-98, -98, -92, -82, -76, -72, -68, -66, -64, -62, -56, -50, -48, -46, -46, -40, -40, -40, -38, -28, -28, -24, -22, -20, -20, -10, -6, 4, 6, 10, 12, 26, 32, 38, 38, 40, 42, 56, 60, 64, 64, 72, 72, 76, 84, 90, 94, 98], [-98, -86, -72, -72, -66, -66, -64, -58, -56, -54, -54, -50, -44, -44, -36, -32, -30, -28, -26, -18, -14, -6, -4, 6, 6, 10, 10, 14, 22, 28, 38, 40, 46, 46, 50, 52, 54, 56, 60, 68, 68, 72, 76, 90, 90, 92, 92, 98], [-90, -86, -86, -84, -76, -74, -70, -66, -58, -58, -54, -50, -48, -44, -38, -38, -36, -34, -30, -22, -22, -8, -6, 4, 6, 6, 6, 8, 10, 24, 24, 28, 32, 32, 32, 36, 44, 48, 48, 50, 52, 64, 70, 74, 76, 92, 94, 96], [-96, -94, -84, -76, -76, -70, -68, -66, -56, -50, -50, -48, -46, -42, -42, -40, -40, -38, -38, -36, -36, -34, -30, -24, -22, -6, -4, -2, 2, 4, 10, 12, 16, 24, 28, 32, 38, 46, 50, 56, 56, 62, 64, 66, 74, 74, 98, 98], [-98, -96, -92, -88, -88, -84, -82, -78, -68, -66, -54, -52, -52, -50, -44, -40, -40, -38, -34, -34, -30, -26, -26, -24, -18, -14, -10, 4, 6, 6, 16, 20, 24, 26, 26, 32, 36, 38, 56, 66, 70, 78, 78, 84, 86, 88, 88, 90], [-94, -90, -86, -86, -86, -86, -84, -82, -78, -78, -76, -72, -68, -64, -64, -62, -46, -42, -42, -28, -26, -18, -16, -10, -8, -2, 0, 10, 10, 12, 18, 18, 26, 26, 32, 34, 34, 40, 50, 54, 56, 58, 62, 66, 66, 82, 84, 94], [-98, -94, -88, -86, -84, -80, -80, -78, -78, -74, -72, -72, -70, -70, -68, -66, -66, -64, -50, -44, -28, -24, -16, -6, -4, 0, 2, 8, 12, 22, 26, 32, 38, 38, 50, 54, 58, 58, 64, 64, 66, 70, 78, 86, 88, 90, 96, 98], [-96, -94, -90, -82, -78, -76, -76, -72, -64, -62, -54, -52, -50, -46, -44, -36, -30, -28, -28, -28, -22, -14, -12, 0, 0, 2, 6, 6, 10, 18, 22, 22, 24, 28, 28, 30, 34, 36, 36, 42, 46, 48, 54, 66, 72, 76, 86, 96], [-98, -96, -92, -92, -90, -88, -86, -82, -78, -70, -68, -66, -60, -58, -48, -48, -46, -30, -26, -22, -20, -16, -12, -8, -4, -4, 4, 16, 22, 32, 34, 34, 36, 36, 40, 52, 60, 62, 64, 66, 66, 74, 74, 78, 82, 82, 86, 94], [-92, -90, -88, -84, -82, -80, -78, -76, -74, -60, -56, -48, -48, -48, -48, -42, -38, -38, -30, -28, -28, -26, -12, -12, -10, -10, -2, 14, 16, 22, 26, 34, 42, 44, 52, 54, 56, 58, 58, 60, 62, 66, 70, 82, 84, 90, 94, 96], [-96, -92, -92, -84, -80, -76, -74, -74, -72, -70, -66, -66, -62, -60, -58, -56, -56, -50, -36, -34, -26, -10, 2, 2, 10, 10, 10, 10, 12, 18, 22, 22, 34, 34, 40, 60, 62, 62, 68, 72, 76, 78, 82, 82, 82, 82, 94, 96], [-96, -96, -88, -84, -78, -72, -68, -62, -56, -56, -52, -38, -32, -24, -20, -18, -18, -16, -10, -6, 8, 8, 12, 18, 24, 24, 26, 28, 30, 30, 32, 32, 56, 62, 64, 66, 66, 72, 74, 74, 78, 84, 84, 86, 88, 92, 92, 98], [-92, -86, -78, -68, -68, -68, -64, -58, -56, -48, -44, -38, -36, -34, -26, -22, -20, -18, -8, -6, 0, 2, 4, 12, 12, 18, 20, 22, 30, 32, 36, 38, 42, 44, 46, 50, 50, 52, 56, 58, 62, 64, 68, 70, 70, 82, 90, 98], [-94, -92, -92, -90, -88, -84, -80, -76, -74, -72, -72, -68, -62, -62, -56, -54, -50, -44, -42, -42, -30, -20, -16, -6, -6, 12, 14, 16, 18, 30, 30, 40, 42, 44, 54, 58, 58, 68, 74, 74, 80, 84, 84, 86, 88, 94, 96, 96], [-90, -86, -84, -84, -78, -78, -70, -70, -64, -56, -52, -50, -48, -48, -48, -46, -42, -40, -40, -30, -30, -28, -24, -22, -18, -16, -14, -6, -2, 4, 10, 12, 14, 14, 20, 26, 32, 44, 58, 64, 68, 68, 74, 76, 76, 82, 86, 88], [-98, -84, -80, -80, -78, -78, -78, -76, -68, -62, -56, -50, -34, -30, -30, -12, -8, -4, 2, 8, 10, 12, 14, 22, 24, 26, 36, 38, 38, 44, 46, 48, 56, 58, 62, 64, 64, 66, 66, 70, 70, 74, 78, 82, 88, 90, 94, 96], [-96, -96, -96, -96, -94, -94, -90, -86, -84, -80, -78, -74, -64, -60, -56, -54, -42, -38, -38, -38, -36, -34, -18, -16, -14, -14, -10, -10, -10, -6, -4, 8, 14, 20, 32, 42, 44, 48, 54, 54, 56, 70, 70, 72, 74, 80, 84, 94], [-96, -94, -86, -84, -78, -76, -70, -66, -62, -60, -56, -56, -54, -54, -52, -52, -50, -46, -46, -34, -32, -32, -28, -16, -12, -6, 0, 16, 18, 18, 20, 20, 28, 34, 38, 40, 42, 42, 52, 56, 62, 66, 66, 70, 82, 84, 88, 98], [-86, -84, -80, -78, -62, -60, -58, -56, -54, -52, -48, -44, -40, -38, -38, -26, -26, -24, -24, -18, -10, -6, 2, 8, 12, 16, 22, 26, 32, 36, 42, 44, 46, 48, 52, 52, 52, 62, 66, 70, 78, 78, 78, 80, 84, 90, 92, 92], [-98, -96, -88, -86, -82, -78, -78, -72, -72, -70, -64, -64, -60, -58, -54, -52, -46, -42, -30, -18, -14, -2, 2, 2, 6, 12, 20, 24, 24, 28, 32, 38, 38, 48, 54, 58, 60, 66, 68, 70, 70, 74, 78, 80, 82, 84, 86, 90], [-98, -88, -82, -82, -76, -76, -74, -70, -70, -68, -66, -64, -62, -58, -56, -52, -40, -38, -38, -38, -38, -36, -30, -26, -26, -12, -2, 4, 6, 16, 20, 24, 26, 26, 28, 34, 44, 50, 60, 68, 72, 74, 78, 84, 84, 88, 90, 90], [-98, -98, -96, -94, -88, -88, -86, -82, -66, -64, -62, -62, -40, -38, -34, -20, -14, -12, -10, -8, 0, 6, 10, 10, 12, 18, 22, 26, 26, 28, 32, 36, 40, 44, 44, 46, 64, 68, 70, 72, 74, 78, 80, 82, 82, 82, 92, 96], [-94, -94, -92, -88, -88, -84, -82, -78, -78, -76, -72, -64, -60, -56, -54, -54, -50, -48, -46, -42, -32, -28, -28, -24, -22, -22, -16, -14, -12, -12, 4, 10, 16, 16, 16, 28, 30, 40, 48, 56, 62, 64, 68, 76, 88, 90, 92, 98], [-94, -90, -88, -80, -76, -76, -76, -76, -72, -72, -68, -68, -68, -68, -66, -64, -62, -62, -54, -52, -46, -44, -36, -34, -20, -20, -16, -16, -10, -8, 0, 4, 22, 24, 28, 36, 38, 44, 50, 52, 60, 64, 68, 72, 76, 84, 86, 88], [-98, -98, -96, -94, -92, -80, -74, -72, -68, -68, -66, -64, -64, -62, -54, -52, -52, -28, -28, -28, -20, -10, 2, 6, 6, 14, 16, 16, 24, 28, 28, 32, 32, 36, 38, 44, 44, 46, 50, 58, 64, 68, 78, 86, 90, 90, 96, 98], [-96, -92, -80, -78, -68, -56, -54, -54, -44, -44, -36, -34, -34, -32, -30, -26, -22, -12, -8, -2, -2, -2, 6, 8, 8, 20, 20, 24, 28, 32, 36, 36, 38, 40, 42, 44, 44, 46, 48, 52, 54, 56, 60, 68, 70, 76, 80, 86], [-96, -86, -82, -82, -78, -76, -74, -68, -62, -54, -50, -48, -40, -38, -36, -34, -32, -26, -14, -12, -12, -6, -4, 0, 8, 10, 14, 20, 20, 26, 28, 40, 44, 46, 48, 56, 58, 60, 62, 66, 68, 76, 78, 86, 88, 88, 90, 94], [-98, -96, -86, -86, -84, -76, -76, -72, -72, -70, -64, -62, -58, -58, -54, -48, -46, -42, -32, -28, -28, -26, -24, -20, -14, 0, 0, 0, 0, 2, 10, 14, 18, 48, 50, 50, 52, 56, 58, 60, 62, 68, 76, 82, 86, 88, 94, 94], [-96, -92, -86, -82, -82, -80, -80, -78, -76, -74, -72, -62, -62, -56, -56, -50, -40, -30, -28, -18, -18, -12, -10, 0, 4, 10, 12, 12, 16, 18, 18, 18, 22, 30, 34, 42, 68, 74, 82, 86, 86, 90, 90, 90, 92, 92, 94, 94], [-92, -90, -88, -82, -82, -80, -74, -70, -66, -60, -58, -54, -48, -44, -40, -38, -32, -30, -26, -4, 2, 2, 10, 16, 18, 26, 30, 32, 32, 54, 56, 56, 58, 60, 62, 64, 64, 66, 72, 76, 78, 78, 78, 80, 80, 82, 86, 92], [-82, -82, -76, -74, -70, -66, -62, -62, -56, -54, -46, -46, -42, -36, -32, -30, -30, -26, -24, -22, -20, -10, -8, 4, 8, 14, 20, 22, 26, 36, 38, 46, 46, 46, 50, 50, 52, 54, 54, 58, 68, 76, 80, 84, 86, 86, 90, 98], [-98, -92, -92, -82, -78, -76, -62, -56, -54, -50, -50, -48, -48, -46, -44, -44, -34, -26, -24, -20, -16, -2, 16, 16, 22, 28, 28, 30, 36, 36, 38, 38, 40, 42, 42, 44, 50, 56, 56, 60, 62, 74, 78, 90, 92, 94, 96, 98], [-96, -92, -92, -86, -84, -74, -56, -54, -50, -42, -38, -36, -30, -28, -24, -22, -14, -10, -10, -10, -8, -8, 0, 4, 8, 8, 10, 18, 24, 24, 30, 30, 34, 38, 38, 42, 44, 44, 50, 54, 54, 66, 72, 74, 78, 84, 92, 98], [-90, -88, -80, -70, -56, -56, -54, -54, -50, -44, -44, -42, -40, -38, -26, -22, -22, -16, -14, -8, 0, 2, 18, 20, 34, 36, 36, 40, 42, 44, 46, 46, 48, 54, 54, 54, 56, 68, 68, 72, 72, 72, 76, 84, 86, 90, 92, 96], [-98, -96, -94, -86, -82, -76, -76, -70, -70, -68, -64, -48, -38, -38, -36, -28, -28, -26, -20, -18, -6, -2, -2, 2, 4, 6, 8, 8, 12, 12, 14, 16, 26, 30, 30, 34, 44, 44, 48, 48, 56, 72, 80, 80, 84, 84, 92, 94], [-90, -88, -84, -74, -74, -72, -70, -70, -68, -68, -64, -56, -52, -50, -40, -38, -32, -28, -22, -14, -14, -12, -8, -4, -2, 8, 10, 14, 14, 18, 22, 24, 30, 32, 36, 40, 58, 62, 64, 64, 64, 68, 72, 74, 82, 94, 98, 98], [-98, -92, -88, -80, -76, -70, -70, -66, -58, -56, -56, -40, -32, -26, -18, -6, -4, -2, 0, 0, 0, 2, 2, 6, 18, 20, 26, 32, 46, 46, 48, 48, 48, 52, 66, 68, 68, 68, 70, 70, 82, 82, 84, 86, 92, 96, 96, 98], [-98, -96, -92, -92, -92, -82, -72, -68, -66, -62, -46, -44, -44, -42, -38, -34, -32, -26, -26, -16, -12, -12, -10, -6, -6, -2, 0, 0, 4, 10, 12, 12, 14, 30, 36, 42, 46, 54, 58, 58, 66, 68, 68, 70, 90, 92, 96, 98], [-92, -86, -76, -76, -76, -72, -72, -68, -68, -58, -48, -40, -40, -36, -36, -26, -18, -14, -12, -10, -8, -8, 2, 8, 12, 16, 20, 24, 26, 30, 30, 34, 42, 42, 46, 56, 60, 62, 66, 72, 78, 78, 82, 82, 88, 90, 92, 92], [-92, -90, -90, -88, -84, -78, -70, -64, -60, -54, -42, -36, -34, -32, -30, -20, -14, -10, -8, -2, 0, 8, 10, 10, 20, 24, 28, 32, 42, 42, 42, 50, 54, 56, 60, 60, 60, 68, 68, 72, 78, 78, 86, 86, 92, 92, 98, 98], [-98, -98, -96, -96, -94, -90, -88, -86, -80, -78, -76, -72, -58, -52, -48, -34, -34, -28, -28, -24, -24, -18, -16, -12, -8, -8, -6, 8, 10, 12, 12, 12, 12, 26, 30, 30, 38, 52, 52, 64, 68, 72, 74, 80, 80, 82, 88, 90], [-92, -90, -82, -80, -72, -66, -52, -44, -44, -42, -42, -36, -34, -32, -26, -24, -22, -20, -18, -18, -16, -16, -16, -2, 2, 4, 8, 10, 16, 22, 24, 36, 38, 40, 46, 50, 56, 58, 64, 66, 74, 74, 84, 84, 88, 92, 96, 98]], [[0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0], [0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1], [0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1], [1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0], [0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1], [0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0], [0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1], [1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0], [1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1], [1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0], [1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], [1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0], [0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1], [0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1], [0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1], [0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1], [1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1], [0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0], [1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0], [1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1], [0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0], [0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1], [0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1], [0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0], [1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0], [0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0], [1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1], [1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0], [1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1], [0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0], [0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0], [1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1], [1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0], [1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1], [0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1], [1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0], [1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0]], [[1, 3, 3, 4, 4, 5, 8, 11, 13, 15, 16, 18, 20, 21, 24, 25, 25, 35, 36, 37, 39, 40, 40, 41, 41, 42, 42, 44, 44, 44, 45, 47, 49, 54, 61, 62, 64, 64, 70, 72, 82, 85, 87, 92, 93, 93, 94, 95], [1, 2, 2, 3, 4, 5, 5, 6, 8, 8, 9, 11, 15, 16, 19, 20, 20, 22, 22, 25, 33, 36, 37, 39, 40, 41, 41, 44, 54, 60, 62, 65, 67, 68, 68, 70, 72, 77, 77, 78, 78, 79, 85, 86, 87, 88, 93, 99], [1, 1, 1, 1, 3, 5, 6, 7, 7, 10, 12, 13, 13, 15, 17, 20, 21, 21, 22, 25, 31, 33, 37, 40, 41, 41, 46, 50, 53, 54, 55, 57, 61, 63, 64, 65, 68, 69, 76, 76, 81, 81, 82, 82, 84, 87, 89, 90], [1, 1, 1, 1, 4, 6, 19, 19, 19, 20, 21, 21, 22, 22, 23, 23, 25, 25, 26, 26, 29, 30, 34, 34, 35, 37, 48, 48, 50, 52, 59, 60, 62, 63, 64, 66, 68, 68, 75, 85, 88, 89, 91, 92, 94, 95, 97, 99], [2, 3, 7, 12, 15, 16, 18, 20, 20, 23, 24, 27, 29, 31, 33, 36, 36, 37, 38, 44, 47, 52, 52, 54, 55, 61, 62, 62, 64, 66, 66, 73, 74, 75, 76, 80, 81, 81, 83, 83, 84, 87, 87, 89, 92, 92, 96, 99], [1, 4, 4, 5, 6, 8, 12, 12, 14, 16, 21, 24, 24, 27, 29, 34, 35, 39, 41, 44, 44, 46, 48, 50, 52, 52, 53, 56, 60, 62, 64, 67, 72, 77, 78, 80, 81, 83, 84, 84, 85, 88, 91, 93, 93, 94, 94, 95], [3, 3, 4, 11, 11, 12, 15, 15, 17, 17, 18, 20, 24, 24, 27, 27, 29, 32, 35, 37, 39, 39, 41, 43, 43, 44, 48, 49, 53, 60, 69, 70, 73, 74, 75, 76, 76, 84, 85, 85, 85, 87, 87, 89, 90, 91, 93, 93], [1, 11, 11, 12, 15, 15, 16, 16, 17, 17, 18, 19, 20, 23, 27, 27, 31, 32, 32, 35, 37, 39, 39, 41, 43, 45, 47, 49, 49, 49, 56, 60, 61, 64, 67, 71, 73, 78, 79, 79, 81, 82, 83, 85, 87, 89, 92, 98], [5, 6, 9, 13, 14, 16, 17, 20, 20, 22, 22, 23, 28, 29, 29, 30, 32, 33, 36, 37, 45, 47, 49, 49, 50, 50, 52, 56, 60, 62, 65, 66, 69, 70, 71, 77, 78, 78, 80, 82, 83, 86, 86, 88, 88, 90, 90, 99], [3, 11, 12, 13, 14, 14, 15, 19, 19, 20, 26, 27, 28, 31, 32, 32, 32, 35, 35, 39, 39, 42, 43, 49, 54, 55, 57, 58, 59, 60, 61, 62, 62, 65, 65, 67, 73, 74, 81, 82, 83, 86, 88, 88, 93, 95, 95, 97], [1, 3, 3, 5, 7, 11, 17, 20, 20, 21, 21, 23, 24, 25, 26, 26, 30, 32, 35, 37, 38, 39, 42, 44, 47, 47, 48, 49, 51, 57, 57, 59, 60, 61, 62, 63, 66, 69, 70, 73, 78, 80, 84, 84, 89, 92, 96, 97], [1, 1, 2, 11, 12, 13, 15, 17, 19, 21, 22, 24, 27, 28, 28, 29, 30, 34, 39, 40, 40, 44, 45, 48, 57, 58, 58, 59, 61, 63, 63, 64, 66, 66, 68, 69, 70, 71, 74, 78, 79, 82, 84, 86, 89, 90, 94, 97], [2, 3, 7, 10, 10, 12, 13, 13, 17, 17, 19, 21, 36, 47, 48, 48, 51, 51, 52, 55, 57, 61, 61, 61, 65, 70, 71, 73, 74, 74, 75, 75, 76, 78, 79, 80, 80, 85, 86, 87, 87, 89, 91, 94, 95, 97, 97, 97], [1, 2, 2, 8, 9, 9, 9, 14, 16, 17, 23, 24, 27, 29, 30, 30, 34, 35, 36, 43, 44, 44, 47, 49, 50, 54, 56, 57, 58, 63, 67, 68, 69, 70, 72, 76, 77, 80, 81, 84, 84, 86, 88, 90, 93, 96, 96, 96], [2, 3, 3, 5, 5, 7, 7, 11, 18, 19, 19, 20, 23, 24, 27, 27, 28, 30, 30, 36, 38, 39, 40, 48, 50, 51, 53, 57, 57, 66, 67, 68, 73, 77, 78, 79, 82, 84, 85, 87, 88, 89, 95, 96, 97, 98, 99, 99], [3, 8, 10, 10, 12, 13, 13, 15, 16, 16, 17, 21, 21, 22, 23, 24, 26, 26, 27, 29, 32, 34, 35, 37, 42, 42, 52, 54, 61, 61, 65, 65, 66, 70, 73, 74, 76, 79, 83, 83, 85, 89, 91, 93, 94, 96, 97, 97], [3, 5, 6, 7, 9, 10, 13, 16, 16, 19, 23, 24, 24, 26, 28, 29, 30, 32, 33, 36, 37, 37, 41, 41, 41, 42, 42, 44, 45, 49, 50, 52, 55, 57, 58, 60, 61, 63, 75, 77, 77, 79, 80, 81, 86, 89, 94, 99], [1, 10, 13, 14, 15, 17, 18, 20, 21, 22, 23, 25, 26, 28, 32, 37, 39, 44, 46, 47, 47, 47, 47, 50, 51, 52, 55, 55, 58, 61, 69, 72, 73, 77, 77, 78, 80, 81, 82, 84, 88, 91, 93, 94, 95, 96, 97, 98], [1, 5, 5, 13, 13, 17, 26, 28, 30, 32, 34, 41, 43, 44, 45, 45, 46, 46, 49, 52, 53, 56, 57, 61, 61, 62, 63, 63, 63, 64, 65, 67, 69, 70, 73, 76, 77, 80, 80, 81, 82, 87, 87, 88, 89, 89, 93, 96], [5, 11, 12, 12, 18, 19, 19, 22, 24, 26, 26, 26, 30, 32, 33, 35, 35, 36, 38, 39, 42, 44, 46, 48, 52, 56, 57, 58, 59, 65, 65, 66, 67, 67, 68, 70, 73, 73, 75, 76, 77, 78, 80, 83, 84, 88, 92, 99], [5, 6, 9, 13, 17, 20, 20, 21, 22, 24, 25, 26, 30, 32, 33, 36, 37, 38, 38, 40, 44, 45, 48, 53, 55, 58, 58, 58, 59, 61, 63, 63, 63, 65, 67, 72, 75, 75, 75, 77, 77, 77, 79, 82, 88, 93, 97, 97], [9, 13, 14, 16, 17, 18, 21, 22, 22, 23, 24, 25, 33, 37, 40, 41, 42, 46, 49, 49, 51, 54, 57, 58, 58, 60, 67, 71, 73, 74, 74, 75, 77, 78, 80, 82, 85, 85, 86, 86, 86, 87, 91, 92, 93, 95, 97, 98], [1, 3, 10, 11, 14, 18, 18, 19, 23, 24, 26, 28, 33, 36, 37, 42, 42, 47, 47, 48, 48, 52, 53, 56, 57, 59, 61, 63, 63, 64, 65, 67, 69, 71, 75, 77, 78, 79, 83, 83, 83, 85, 86, 86, 92, 96, 97, 97], [3, 5, 6, 7, 7, 9, 13, 13, 18, 25, 27, 28, 29, 30, 32, 34, 37, 43, 44, 51, 52, 53, 54, 59, 63, 63, 64, 66, 68, 70, 70, 72, 72, 73, 77, 78, 80, 82, 83, 83, 84, 85, 85, 93, 95, 97, 99, 99], [4, 6, 7, 9, 9, 20, 20, 22, 31, 33, 34, 35, 35, 38, 40, 41, 42, 42, 44, 46, 47, 50, 52, 54, 57, 58, 60, 61, 62, 63, 63, 64, 65, 70, 72, 74, 80, 81, 87, 87, 88, 88, 92, 92, 95, 99, 99, 99], [3, 5, 9, 10, 10, 15, 18, 20, 21, 21, 23, 25, 28, 29, 37, 38, 40, 40, 40, 46, 51, 53, 55, 57, 59, 59, 60, 67, 68, 71, 72, 73, 75, 76, 79, 79, 81, 83, 86, 87, 88, 90, 90, 90, 92, 95, 96, 98], [5, 7, 8, 9, 9, 12, 14, 16, 18, 18, 18, 24, 25, 26, 28, 28, 29, 30, 32, 37, 38, 44, 44, 45, 46, 48, 51, 55, 55, 56, 58, 58, 62, 63, 64, 67, 71, 74, 76, 81, 86, 87, 88, 90, 90, 91, 95, 97], [4, 5, 13, 13, 16, 19, 19, 20, 22, 26, 27, 28, 30, 30, 31, 32, 33, 39, 39, 41, 41, 43, 45, 49, 50, 51, 64, 66, 67, 71, 73, 75, 78, 78, 79, 82, 84, 86, 87, 87, 88, 90, 91, 91, 92, 93, 96, 97], [2, 3, 5, 11, 16, 20, 21, 21, 25, 29, 31, 34, 36, 36, 37, 37, 38, 38, 44, 45, 46, 54, 60, 60, 61, 61, 67, 67, 67, 70, 71, 72, 76, 77, 79, 80, 83, 84, 84, 87, 87, 88, 90, 92, 93, 98, 99, 99], [1, 2, 5, 5, 12, 13, 13, 15, 18, 19, 24, 25, 25, 26, 28, 29, 30, 33, 34, 35, 35, 36, 36, 37, 38, 42, 44, 49, 50, 53, 58, 58, 58, 60, 65, 67, 72, 75, 77, 78, 81, 84, 88, 88, 90, 91, 94, 97], [5, 5, 6, 7, 8, 11, 11, 13, 19, 23, 25, 35, 37, 40, 40, 46, 47, 48, 48, 49, 51, 58, 60, 61, 63, 65, 67, 68, 71, 72, 76, 77, 79, 80, 84, 87, 88, 88, 89, 90, 92, 94, 94, 96, 96, 97, 97, 99], [1, 2, 3, 3, 5, 5, 13, 18, 19, 23, 31, 32, 34, 35, 36, 38, 39, 40, 42, 49, 51, 53, 54, 56, 62, 64, 64, 64, 66, 67, 67, 67, 69, 72, 74, 74, 80, 81, 83, 83, 84, 85, 91, 91, 94, 95, 96, 98], [1, 2, 5, 9, 10, 11, 14, 15, 16, 16, 24, 27, 30, 32, 35, 37, 39, 39, 40, 43, 48, 49, 50, 54, 57, 57, 58, 59, 60, 63, 63, 64, 64, 64, 68, 70, 76, 77, 80, 82, 85, 87, 88, 90, 91, 94, 94, 97], [10, 14, 15, 17, 17, 18, 22, 22, 28, 29, 29, 32, 32, 34, 36, 36, 38, 39, 40, 42, 43, 45, 45, 45, 54, 54, 55, 55, 59, 63, 67, 68, 74, 75, 75, 77, 77, 79, 80, 86, 86, 87, 87, 87, 87, 88, 93, 96], [2, 2, 5, 5, 9, 14, 17, 17, 20, 22, 22, 23, 25, 32, 32, 32, 35, 37, 37, 38, 39, 40, 47, 52, 55, 56, 60, 62, 63, 63, 63, 63, 64, 69, 73, 73, 74, 75, 77, 79, 82, 85, 88, 88, 90, 92, 92, 93], [3, 4, 4, 6, 8, 10, 12, 15, 16, 16, 17, 20, 21, 21, 24, 26, 27, 28, 28, 29, 30, 32, 38, 44, 49, 49, 50, 54, 59, 59, 61, 62, 64, 64, 65, 70, 70, 71, 72, 72, 73, 74, 75, 80, 83, 90, 92, 92], [4, 5, 9, 9, 13, 15, 16, 16, 17, 23, 25, 27, 28, 29, 29, 37, 37, 40, 43, 45, 49, 50, 51, 51, 53, 55, 56, 60, 61, 61, 64, 67, 68, 73, 74, 75, 76, 77, 79, 80, 85, 89, 89, 89, 91, 97, 97, 97], [2, 5, 9, 10, 11, 11, 11, 15, 15, 16, 18, 20, 21, 22, 23, 24, 40, 41, 47, 47, 48, 48, 49, 51, 53, 53, 54, 55, 61, 63, 65, 68, 70, 73, 74, 74, 77, 78, 79, 80, 82, 83, 85, 85, 86, 87, 98, 99], [1, 12, 13, 14, 16, 17, 18, 19, 20, 21, 23, 23, 27, 27, 30, 34, 36, 36, 38, 42, 43, 43, 44, 44, 48, 49, 53, 54, 55, 61, 62, 66, 67, 72, 72, 73, 73, 77, 78, 78, 86, 88, 89, 92, 93, 98, 98, 99], [1, 2, 4, 6, 9, 13, 13, 13, 17, 18, 20, 28, 28, 30, 32, 33, 37, 38, 42, 42, 44, 47, 50, 52, 53, 54, 56, 57, 59, 60, 66, 68, 70, 71, 72, 74, 76, 77, 79, 83, 83, 84, 85, 90, 94, 94, 97, 99], [1, 1, 9, 9, 10, 10, 11, 12, 12, 15, 21, 22, 24, 24, 25, 26, 26, 27, 30, 31, 34, 35, 40, 41, 43, 47, 47, 53, 53, 53, 57, 60, 61, 61, 64, 66, 68, 71, 71, 79, 82, 82, 84, 88, 88, 90, 96, 99], [4, 4, 6, 6, 6, 6, 8, 9, 11, 11, 14, 16, 21, 25, 29, 37, 38, 40, 44, 45, 50, 51, 51, 53, 53, 56, 57, 58, 59, 59, 63, 69, 71, 72, 74, 76, 79, 80, 82, 83, 87, 93, 94, 96, 98, 98, 99, 99], [2, 2, 5, 9, 10, 12, 13, 13, 13, 13, 19, 22, 27, 32, 33, 34, 34, 38, 41, 45, 46, 47, 48, 50, 51, 51, 52, 54, 54, 57, 57, 60, 61, 74, 76, 76, 77, 79, 81, 83, 85, 92, 93, 95, 96, 97, 99, 99], [4, 4, 4, 6, 7, 9, 14, 15, 16, 18, 19, 23, 27, 37, 38, 39, 40, 41, 41, 44, 45, 51, 52, 53, 54, 54, 56, 57, 58, 59, 60, 63, 65, 65, 69, 79, 85, 85, 88, 89, 90, 90, 93, 94, 95, 95, 95, 99], [6, 6, 7, 9, 10, 10, 11, 15, 15, 16, 16, 17, 19, 20, 24, 28, 30, 31, 31, 33, 35, 37, 38, 40, 40, 43, 44, 44, 45, 46, 48, 58, 59, 62, 72, 73, 74, 80, 82, 82, 83, 85, 88, 90, 91, 91, 91, 96], [2, 2, 2, 2, 3, 4, 5, 12, 12, 15, 23, 23, 24, 24, 29, 35, 36, 38, 40, 41, 47, 47, 48, 49, 51, 54, 56, 57, 60, 62, 63, 64, 70, 75, 75, 76, 77, 80, 82, 83, 87, 90, 91, 91, 92, 93, 94, 94], [3, 4, 4, 7, 8, 9, 11, 12, 15, 19, 21, 22, 23, 24, 28, 28, 31, 37, 37, 37, 39, 48, 52, 52, 55, 55, 55, 57, 61, 66, 72, 75, 76, 77, 79, 83, 84, 84, 84, 88, 90, 92, 93, 94, 98, 98, 98, 99], [2, 5, 7, 11, 13, 15, 27, 29, 29, 31, 35, 38, 41, 42, 44, 44, 46, 47, 49, 52, 52, 53, 53, 53, 54, 54, 55, 56, 58, 60, 61, 61, 63, 69, 72, 72, 77, 77, 79, 80, 84, 84, 86, 87, 90, 92, 92, 93]], [[28, 84, -76, -76, -28, -42, -78, 6, 40, 70, 48, 92, -6, -34, 62, 34, -14, -64], [48, 6, -22, 44, -32, -26, -18, 94, -2, -80, -20, -64, -50, -18, -28, -96, 66, 48], [-2, 34, 6, -62, -48, 8, 2, -50, -66, 48, 22, -8, 10, 0, 50, -78, -76, -20], [-4, 12, -84, 76, -72, 74, 12, 8, -66, -10, -90, -94, -82, 68, -60, 66, -58, 60], [-34, -90, -52, 26, 58, -48, 78, 84, -34, -64, -64, -24, -34, -46, -2, 0, -70, 54], [4, 96, 36, 98, -62, 90, -50, 52, 52, -50, -34, 20, -26, 84, -14, -82, -72, -94], [38, 12, -48, 6, -18, 64, -58, -22, 60, -54, 86, 48, 16, 38, 50, -42, 24, 6], [-10, -46, -32, -72, -18, 48, 20, -16, 2, 50, -78, -30, -62, 76, 30, 52, 22, -6], [-72, 34, 4, -36, 60, -80, -66, -20, 36, 26, -70, 94, -22, 14, -80, 42, 94, -66], [52, -66, -68, 56, -94, 2, 88, -8, 10, 98, -48, 52, -38, 62, 44, -62, 80, 36], [-70, 16, 56, -40, -4, 12, -16, -52, 4, -14, -32, 20, 66, -94, 36, -78, -74, 0], [64, -62, -12, -34, -24, -94, 98, 30, -30, -28, -24, -22, -50, 28, -74, 36, 40, 50], [-98, 44, 8, 96, -82, -28, -26, 18, -58, -60, -98, 98, 18, -44, 42, 12, -82, 30], [-28, 96, -32, 62, -36, 32, -50, 2, 26, 80, -10, -48, -58, 64, 86, 2, -52, 84], [-76, -78, -46, -54, -34, 60, 84, 84, -24, 10, 40, -16, -42, -32, 14, -94, -88, -4], [28, -74, -28, 58, 40, -34, 52, 14, 10, -74, 94, 2, 84, 6, -28, -90, -50, 62], [-26, -62, -30, -32, 8, -8, -88, 66, -98, 42, -32, 12, 66, 94, -48, -16, 82, -24], [-48, 98, 18, 68, -52, -58, 20, 80, -60, -88, 34, -80, -76, 94, -56, 24, 22, 60]], [[0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1]], [[93, 9, 33, 88, 35, 75, 39, 77, 87, 25], [80, 56, 48, 85, 10, 41, 83, 99, 59, 28], [41, 66, 51, 62, 30, 40, 40, 69, 62, 15], [3, 24, 41, 63, 48, 61, 48, 47, 56, 76], [8, 78, 18, 84, 23, 69, 65, 46, 66, 80], [69, 22, 65, 12, 19, 22, 55, 62, 51, 48], [17, 13, 28, 67, 5, 60, 15, 81, 44, 46], [29, 68, 96, 49, 43, 68, 77, 20, 18, 64], [49, 42, 12, 89, 94, 79, 36, 8, 28, 86], [60, 49, 38, 80, 58, 5, 46, 98, 75, 2]]]; int [] param1 = [29, 9, 4, 3, 28, 26, 44, 9, 5, 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); } " MAXIMUM_DIFFERENCE_SUM_ELEMENTS_TWO_ROWS_MATRIX,"static int f_filled ( int mat [ ] [ ] , int m , int n ) { int rowSum [ ] = new int [ m ] ; for ( int i = 0 ; i < m ; i ++ ) { int sum = 0 ; for ( int j = 0 ; j < n ; j ++ ) sum += mat [ i ] [ j ] ; rowSum [ i ] = sum ; } int max_diff = rowSum [ 1 ] - rowSum [ 0 ] ; int min_element = rowSum [ 0 ] ; for ( int i = 1 ; i < m ; i ++ ) { if ( rowSum [ i ] - min_element > max_diff ) max_diff = rowSum [ i ] - min_element ; if ( rowSum [ i ] < min_element ) min_element = rowSum [ i ] ; } return max_diff ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [518, 1378, 3, 416, 284, 2, 267, -30, 4, 488]; int [] [] [] param0 = [[[1, 5, 5, 6, 6, 7, 7, 11, 12, 15, 17, 24, 25, 27, 30, 33, 35, 36, 38, 41, 42, 44, 44, 46, 50, 53, 53, 56, 58, 67, 71, 71, 77, 78, 85, 85, 87, 87, 89, 91, 94, 96, 97, 98, 99, 99], [1, 3, 3, 6, 7, 12, 18, 19, 21, 21, 23, 25, 25, 26, 33, 37, 38, 39, 39, 39, 41, 42, 43, 46, 49, 50, 54, 56, 57, 60, 66, 67, 67, 68, 69, 71, 75, 76, 85, 86, 88, 90, 91, 93, 98, 98], [2, 2, 3, 9, 15, 18, 21, 21, 23, 24, 27, 28, 28, 28, 30, 34, 36, 38, 40, 43, 45, 46, 46, 49, 53, 53, 55, 58, 66, 66, 67, 68, 70, 72, 73, 73, 75, 77, 78, 80, 83, 84, 88, 89, 95, 98], [1, 3, 6, 6, 7, 7, 8, 11, 15, 21, 21, 24, 28, 28, 29, 30, 31, 31, 33, 34, 36, 46, 47, 49, 51, 58, 64, 65, 69, 70, 70, 76, 78, 81, 86, 86, 87, 89, 90, 92, 93, 94, 97, 97, 97, 99], [10, 11, 12, 12, 17, 19, 23, 24, 25, 26, 28, 31, 31, 33, 35, 39, 41, 42, 42, 45, 49, 50, 53, 56, 57, 60, 60, 62, 63, 64, 64, 65, 66, 68, 71, 77, 77, 80, 80, 81, 84, 84, 86, 86, 90, 92], [2, 2, 3, 7, 8, 10, 11, 12, 13, 19, 20, 22, 24, 24, 27, 29, 30, 32, 34, 35, 37, 37, 37, 38, 39, 39, 39, 44, 54, 54, 57, 62, 63, 64, 64, 70, 72, 73, 84, 84, 85, 87, 89, 94, 95, 95], [1, 1, 4, 4, 6, 7, 20, 22, 24, 25, 26, 31, 31, 35, 38, 41, 41, 42, 47, 48, 48, 50, 51, 56, 56, 57, 57, 58, 61, 62, 67, 68, 72, 75, 75, 77, 80, 81, 83, 83, 84, 87, 88, 97, 97, 98], [2, 3, 10, 13, 16, 23, 26, 27, 29, 30, 35, 35, 36, 39, 41, 42, 45, 48, 49, 49, 56, 56, 59, 59, 59, 60, 60, 61, 62, 64, 67, 67, 71, 73, 76, 78, 81, 83, 86, 87, 87, 88, 89, 92, 97, 99], [8, 13, 14, 15, 16, 16, 19, 25, 25, 28, 29, 30, 30, 34, 36, 38, 40, 41, 41, 43, 46, 48, 49, 49, 49, 50, 53, 55, 57, 63, 64, 64, 66, 70, 74, 74, 77, 77, 78, 83, 84, 92, 93, 93, 96, 99], [2, 3, 5, 5, 6, 6, 6, 8, 8, 14, 15, 19, 22, 23, 27, 28, 31, 32, 33, 34, 34, 36, 38, 42, 43, 49, 55, 57, 58, 68, 71, 71, 74, 77, 81, 85, 85, 87, 90, 91, 92, 94, 96, 97, 97, 98], [1, 4, 5, 8, 9, 9, 16, 16, 19, 20, 21, 24, 25, 25, 26, 29, 30, 34, 38, 39, 40, 46, 48, 49, 55, 56, 57, 57, 59, 62, 63, 64, 64, 69, 70, 73, 77, 78, 78, 85, 85, 91, 92, 93, 95, 97], [1, 5, 11, 11, 15, 15, 15, 23, 30, 31, 34, 37, 39, 39, 44, 44, 46, 47, 47, 47, 48, 49, 50, 53, 54, 58, 62, 64, 66, 67, 68, 69, 73, 74, 80, 82, 82, 84, 85, 89, 91, 91, 93, 96, 97, 98], [2, 3, 5, 7, 8, 9, 9, 10, 14, 18, 20, 21, 25, 28, 31, 33, 33, 34, 34, 39, 45, 47, 48, 49, 49, 54, 58, 64, 71, 74, 74, 75, 78, 82, 82, 83, 84, 88, 92, 92, 93, 94, 95, 95, 98, 99], [1, 2, 6, 9, 9, 9, 15, 15, 17, 17, 24, 25, 26, 27, 28, 28, 30, 30, 33, 34, 36, 39, 41, 42, 46, 46, 53, 59, 62, 65, 68, 69, 70, 71, 72, 74, 76, 78, 83, 84, 90, 92, 96, 98, 98, 99], [1, 1, 3, 5, 7, 8, 8, 10, 11, 18, 18, 18, 21, 30, 35, 36, 43, 51, 51, 53, 54, 57, 58, 58, 58, 59, 60, 60, 60, 61, 63, 68, 70, 74, 76, 82, 83, 87, 87, 87, 91, 91, 92, 93, 97, 99], [3, 3, 3, 6, 11, 13, 13, 14, 16, 16, 22, 28, 29, 29, 32, 35, 38, 51, 51, 52, 53, 57, 58, 62, 67, 70, 71, 73, 73, 76, 76, 76, 80, 80, 83, 84, 84, 86, 87, 91, 92, 95, 95, 96, 96, 99], [1, 3, 7, 7, 7, 9, 9, 10, 16, 21, 23, 23, 24, 24, 26, 27, 36, 37, 43, 44, 48, 50, 51, 52, 53, 56, 57, 58, 59, 66, 68, 69, 72, 73, 74, 76, 77, 77, 80, 81, 81, 81, 84, 84, 90, 98], [1, 1, 2, 6, 10, 12, 13, 14, 15, 16, 20, 22, 22, 22, 24, 25, 26, 30, 34, 35, 35, 37, 38, 39, 43, 43, 43, 49, 50, 56, 57, 62, 64, 66, 67, 68, 71, 78, 82, 84, 86, 86, 89, 90, 94, 96], [2, 5, 6, 7, 7, 9, 9, 12, 20, 21, 23, 25, 30, 32, 37, 40, 41, 43, 43, 45, 45, 45, 57, 60, 61, 61, 61, 63, 66, 67, 67, 68, 69, 70, 73, 74, 75, 78, 82, 83, 84, 87, 89, 90, 99, 99], [8, 11, 12, 16, 22, 23, 23, 27, 28, 29, 31, 38, 39, 41, 42, 42, 48, 48, 52, 52, 57, 58, 60, 60, 63, 66, 66, 67, 69, 72, 74, 75, 75, 76, 76, 78, 79, 80, 84, 86, 92, 92, 94, 94, 96, 98], [2, 3, 4, 6, 6, 14, 14, 16, 17, 20, 22, 23, 26, 28, 28, 29, 29, 31, 32, 32, 38, 40, 42, 45, 51, 52, 54, 56, 62, 65, 66, 68, 73, 79, 80, 81, 87, 87, 88, 89, 89, 89, 91, 93, 96, 97], [4, 6, 9, 12, 13, 14, 16, 17, 18, 23, 25, 25, 26, 27, 29, 33, 34, 45, 45, 46, 49, 51, 51, 51, 52, 53, 59, 59, 64, 66, 67, 67, 70, 71, 72, 77, 77, 78, 82, 82, 84, 90, 93, 94, 96, 99], [1, 2, 7, 8, 9, 11, 19, 20, 23, 23, 24, 29, 29, 34, 41, 46, 48, 51, 51, 53, 54, 59, 61, 65, 67, 72, 74, 76, 76, 77, 80, 81, 81, 84, 87, 88, 90, 91, 92, 92, 93, 95, 96, 96, 97, 99], [1, 3, 4, 6, 8, 9, 9, 9, 9, 10, 15, 23, 24, 24, 25, 32, 34, 35, 38, 42, 43, 44, 45, 45, 48, 49, 53, 57, 57, 60, 60, 68, 70, 72, 72, 73, 74, 76, 76, 77, 79, 80, 83, 85, 94, 96], [2, 5, 7, 11, 12, 12, 14, 15, 16, 18, 20, 21, 25, 25, 26, 29, 35, 41, 43, 44, 47, 47, 50, 52, 52, 55, 57, 58, 60, 62, 67, 68, 69, 73, 74, 76, 78, 85, 86, 87, 87, 87, 90, 91, 94, 96], [1, 3, 5, 7, 7, 8, 10, 11, 13, 17, 24, 25, 26, 29, 30, 32, 33, 35, 36, 40, 41, 43, 44, 47, 49, 51, 54, 57, 59, 65, 69, 73, 74, 80, 80, 82, 82, 82, 84, 85, 85, 87, 90, 94, 95, 97], [1, 4, 6, 8, 13, 13, 13, 17, 17, 18, 22, 23, 23, 24, 24, 30, 32, 33, 36, 36, 36, 39, 40, 41, 43, 43, 45, 49, 51, 55, 55, 56, 57, 61, 63, 65, 65, 68, 69, 71, 72, 72, 77, 80, 96, 99], [1, 2, 3, 6, 7, 8, 10, 12, 13, 14, 17, 18, 19, 22, 23, 25, 28, 29, 31, 33, 34, 36, 36, 38, 41, 42, 42, 45, 48, 49, 49, 49, 50, 53, 54, 62, 70, 72, 77, 79, 84, 85, 92, 92, 93, 99], [1, 1, 6, 7, 11, 14, 17, 17, 21, 28, 29, 31, 32, 37, 40, 43, 44, 46, 47, 52, 56, 58, 59, 60, 63, 65, 68, 70, 75, 81, 81, 81, 82, 84, 85, 85, 88, 92, 92, 93, 94, 95, 95, 95, 99, 99], [1, 4, 4, 7, 9, 11, 12, 14, 14, 14, 19, 24, 26, 28, 29, 31, 36, 39, 41, 45, 45, 46, 47, 49, 58, 60, 60, 62, 63, 71, 72, 76, 76, 76, 77, 78, 80, 81, 83, 84, 84, 85, 89, 94, 97, 98], [1, 7, 10, 13, 15, 16, 16, 18, 19, 22, 26, 28, 33, 35, 36, 37, 38, 40, 41, 42, 42, 45, 46, 47, 48, 54, 54, 54, 58, 64, 65, 66, 67, 67, 68, 70, 71, 72, 74, 77, 78, 84, 85, 88, 88, 93], [2, 2, 2, 5, 8, 8, 20, 22, 27, 28, 30, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 50, 50, 55, 59, 63, 65, 66, 71, 73, 74, 76, 78, 81, 86, 89, 90, 91, 93, 94, 94, 94, 95, 96, 98, 98], [1, 1, 2, 3, 5, 5, 7, 7, 7, 9, 10, 10, 14, 16, 20, 24, 26, 31, 36, 40, 44, 46, 49, 50, 50, 50, 54, 56, 58, 60, 62, 62, 63, 66, 67, 74, 75, 75, 79, 82, 90, 91, 91, 93, 93, 95], [3, 7, 9, 9, 10, 13, 15, 16, 19, 20, 22, 24, 28, 32, 36, 37, 39, 40, 42, 43, 43, 43, 45, 46, 50, 50, 52, 57, 58, 61, 69, 70, 71, 72, 74, 76, 78, 83, 83, 87, 87, 89, 91, 96, 98, 99], [1, 8, 8, 9, 16, 17, 18, 20, 20, 20, 22, 27, 28, 29, 29, 30, 31, 34, 36, 41, 43, 47, 51, 52, 55, 56, 58, 66, 67, 67, 68, 70, 71, 75, 76, 78, 79, 80, 80, 85, 87, 90, 94, 94, 95, 96], [4, 4, 5, 7, 7, 18, 19, 21, 22, 24, 24, 26, 29, 31, 33, 36, 37, 38, 47, 50, 50, 51, 51, 52, 53, 53, 53, 53, 55, 55, 55, 57, 58, 73, 76, 76, 80, 81, 83, 85, 86, 87, 89, 90, 91, 97], [1, 3, 5, 12, 15, 18, 18, 20, 22, 26, 26, 27, 28, 29, 31, 32, 32, 35, 36, 39, 40, 42, 47, 47, 49, 51, 51, 51, 51, 57, 62, 62, 64, 66, 70, 71, 72, 73, 74, 84, 84, 88, 89, 94, 96, 97], [10, 11, 13, 15, 15, 17, 17, 18, 21, 22, 24, 24, 26, 28, 32, 33, 34, 35, 39, 40, 45, 46, 48, 50, 54, 55, 55, 56, 57, 60, 62, 62, 63, 63, 67, 67, 68, 68, 71, 72, 78, 79, 80, 90, 97, 98], [1, 5, 7, 7, 9, 11, 14, 22, 25, 26, 28, 31, 34, 37, 38, 44, 46, 47, 47, 48, 48, 52, 52, 53, 54, 54, 54, 57, 60, 61, 67, 74, 75, 77, 78, 80, 80, 81, 81, 86, 91, 92, 94, 97, 98, 99], [2, 3, 11, 15, 15, 16, 22, 22, 24, 31, 32, 32, 32, 33, 33, 35, 36, 41, 43, 44, 46, 46, 47, 50, 54, 55, 55, 57, 59, 65, 67, 67, 68, 70, 70, 73, 74, 79, 82, 84, 84, 86, 87, 87, 94, 97], [1, 2, 2, 3, 5, 7, 9, 12, 12, 12, 13, 16, 19, 19, 22, 23, 23, 27, 30, 32, 33, 38, 43, 47, 47, 47, 50, 53, 53, 56, 57, 59, 60, 64, 67, 70, 73, 78, 81, 82, 88, 88, 92, 95, 97, 98], [2, 3, 3, 5, 6, 8, 20, 23, 24, 26, 27, 28, 35, 38, 38, 40, 43, 44, 44, 46, 47, 49, 51, 53, 56, 58, 59, 63, 63, 64, 65, 67, 68, 68, 69, 70, 76, 80, 82, 85, 86, 87, 88, 92, 92, 96], [1, 1, 2, 2, 4, 5, 8, 10, 11, 14, 15, 17, 17, 18, 23, 31, 35, 36, 42, 44, 48, 49, 51, 52, 52, 61, 64, 66, 67, 68, 70, 72, 75, 77, 78, 81, 84, 85, 87, 95, 97, 98, 98, 98, 98, 99], [2, 6, 6, 7, 9, 11, 16, 17, 26, 26, 28, 35, 36, 43, 44, 46, 48, 50, 51, 53, 53, 54, 56, 57, 58, 67, 68, 68, 68, 73, 73, 74, 75, 77, 78, 78, 78, 79, 80, 85, 86, 91, 92, 92, 98, 99], [3, 9, 9, 12, 15, 19, 19, 30, 31, 34, 35, 35, 39, 40, 47, 49, 49, 53, 58, 58, 59, 61, 61, 63, 64, 66, 67, 69, 70, 70, 71, 74, 77, 77, 78, 82, 84, 90, 90, 90, 91, 92, 92, 94, 95, 97], [3, 4, 8, 8, 8, 9, 10, 23, 27, 27, 31, 31, 36, 38, 38, 39, 40, 41, 41, 41, 46, 48, 51, 54, 55, 55, 65, 65, 67, 74, 74, 77, 79, 83, 83, 84, 86, 87, 89, 89, 90, 92, 93, 97, 98, 99]], [[-38, -60, 88, -62, 64, -80, -6, -2, 92, 70, -90, 90, -48, 12, -90, 38, -32, -62, -64, -86, 28, -72, 42, -56, 42, 72, 80, 40, -20, -2, 36, -74, 70, -76, -98, 2, 2, 12, -4, -36, 48, -60, -36, -94], [46, -60, -56, -72, 84, 42, -58, 20, 94, 42, 40, 18, -48, 34, -40, -64, 38, 80, 64, -96, -94, 34, -24, -30, 0, -82, -70, 56, -30, -12, -86, -34, 18, 62, 46, 90, -82, -60, -60, 8, 52, 58, 76, -18], [-36, -60, -48, 96, -22, -96, 16, -16, 94, 20, 52, -14, 94, -12, -62, -10, 24, 86, -40, -92, 30, -6, -74, 60, 42, -84, 30, -38, 70, 30, -2, -96, 96, -68, 54, -38, 38, 94, -62, -54, 0, 32, -86, 76], [18, 52, -66, -96, -56, 10, 14, 40, -96, -58, 72, 30, -24, 80, -22, 46, 0, -88, -10, 0, -82, -76, -70, -38, -52, 72, -60, 40, -92, 30, 18, 70, -58, 76, -60, 98, 98, 42, -70, -66, 26, -18, -24, 0], [6, -98, 22, -4, 8, 84, 52, -72, 34, -68, -86, -4, -92, 92, -74, 76, 46, 30, 0, -10, -4, -28, 62, 72, 78, 84, 96, -12, 30, 12, -56, 46, 66, -12, 96, -52, -26, -52, -62, 68, -8, -84, 68, -98], [-90, 42, 78, -70, -6, -82, 68, 26, 20, 18, 30, 64, 12, -98, -90, 22, -64, -60, -34, -24, -30, -76, -62, 28, 6, -58, -70, -52, 34, -72, 80, -6, -66, 58, 28, 30, -38, 80, -58, 26, 72, -46, -18, -74], [-2, -40, -52, -68, -80, 86, -78, 18, -60, -18, -94, -50, -30, -22, -40, -76, 58, 4, -88, -82, 32, -52, 76, 62, -22, 6, 76, -80, 38, 34, 82, -50, 18, -4, -96, 72, -46, 22, -66, 46, -50, -34, 28, 2], [-18, 94, 94, -92, -96, 64, 60, 94, 8, 10, -14, 74, 12, 28, 58, 18, -68, -66, 20, -84, 6, -54, 88, 76, -72, -94, -84, -28, 22, -84, -50, -22, 66, 86, -12, -52, 66, -82, -24, 0, 62, -74, 58, 10], [86, 26, -24, -10, -46, 42, 86, -76, -42, 0, -74, -86, -32, 88, -50, 12, -14, -88, -94, 8, 38, -72, -26, -8, 56, -36, 82, -80, -12, 42, -86, 96, -90, -34, -6, -86, -72, 52, -42, 80, 86, 26, -72, 8], [-26, -10, 44, -70, -22, -40, 4, 82, 40, -18, -64, 72, 10, 36, -76, 78, 52, -58, 4, -60, -52, -32, -58, -68, 32, -82, 82, -80, 6, 58, 44, 26, -44, -48, -98, -42, -48, -46, 4, 48, -36, -84, 10, 0], [50, -64, 98, 0, -90, 80, 80, -24, -84, -22, -84, -6, 76, 26, 36, -82, -46, -92, 86, 54, -18, 22, 76, 98, 16, 64, -32, 62, 84, 58, -16, -22, 46, -76, -58, 40, 26, 28, -62, -66, -60, -20, 72, -68], [-20, 14, -4, -90, 14, 86, 22, 26, 20, -80, 96, -20, -90, 50, -94, 10, -96, 46, -74, 58, 84, 24, -60, 64, -28, -58, 18, -52, -64, -54, 52, -26, 78, -50, -80, -8, -4, -30, 78, -2, 32, 70, 84, -60], [22, 98, 26, -72, 6, -24, 98, 74, -48, -48, 76, -12, -88, 48, -56, -52, 78, -58, 58, -72, 86, -78, -70, 36, 26, 4, -98, -32, 90, -96, -42, -18, 90, -8, -84, -4, 72, 24, -6, 60, 38, -72, 14, -2], [-24, -10, -16, -92, -52, 6, -44, -84, 0, 98, 88, -4, 58, 4, -20, 28, -58, 32, 64, 68, -66, 96, 36, 16, -74, 42, -96, 70, -92, 48, -52, -58, 40, -46, 82, -36, -68, -10, 94, -62, -34, -86, -6, 4], [32, 96, 22, 22, -82, -14, -58, -78, 44, -70, -30, -62, -56, -52, 42, 26, -48, 18, 18, 80, -82, 50, -12, 90, 20, 6, 72, -30, -80, -56, 72, 68, 0, -70, -28, 52, -52, -64, 86, 36, -38, -30, 24, -64], [22, -74, -30, 54, 76, 58, -88, 56, -30, -48, 4, 18, -28, 54, 42, -2, 8, -32, -20, 4, -40, -74, 78, 42, 6, 26, 94, 50, 94, -78, -16, 54, 36, -42, -6, -10, -70, 84, 62, 68, -76, -12, -46, -30], [56, -8, 86, -22, -80, 28, 8, -10, -40, -4, 0, -70, -70, 26, -70, -70, -84, -24, -10, -84, -12, 72, 8, -46, 38, 2, 86, -46, 48, -62, 60, -36, -18, -56, -84, 98, 6, -24, -22, 12, 2, 72, 34, 40], [12, -4, -66, -10, -20, -4, 96, 2, 76, 72, 40, 64, -6, 48, 32, -76, 18, 42, 66, 22, 12, 62, 34, -50, 10, 68, 94, -2, 82, 20, 8, 26, 22, -48, 42, 28, -70, -58, 88, -18, 12, 14, -46, -96], [70, -32, 42, -72, 54, 54, -92, -62, 30, -58, 50, -96, 68, -32, 40, -64, 76, -54, 88, 98, 86, 74, 62, 28, -62, 0, 60, -94, 24, 52, 70, 44, 76, -24, -46, -50, 74, -2, 40, 36, -52, -40, 46, 88], [46, -14, -6, 56, -94, -18, -24, -36, -2, 98, 28, -40, 36, -36, 82, -62, 88, -46, -70, -64, -30, 34, -14, 18, -20, 52, -96, -80, -20, -68, -62, -24, 60, 54, 66, 40, 14, 6, 20, -90, -20, 46, 66, 56], [4, 14, -78, -26, -16, 10, 40, -74, 60, -80, 46, 28, 80, -66, -28, 76, -4, 50, -4, 66, -38, 0, 46, 52, 98, 14, -4, 92, 92, -14, 24, 24, 90, -66, -86, 20, -44, 80, -26, -50, 92, 92, 86, -38], [-44, -74, 44, -46, -32, -50, 52, 94, -86, 46, 8, 56, 6, 12, 54, 66, -22, 18, -74, -54, -88, 42, 16, 8, -22, 96, -78, 98, 18, -16, 72, 44, -46, 36, 4, 72, -70, -68, -64, 20, -60, -50, 84, -64], [8, 82, 24, -46, -62, 78, -72, 94, -8, 42, 18, 74, -40, -94, -86, 70, -34, -20, 58, 32, -14, -42, -46, -14, 6, 2, 74, 16, 92, 20, 6, -62, 40, -40, 88, -12, 82, 18, -22, 22, 38, -88, 28, 90], [82, -92, 96, 88, -64, 38, 14, -22, 56, -84, 2, -16, -88, -4, -50, -74, -10, -36, 68, 22, -92, 50, -12, 54, -84, -24, -50, -72, 12, 38, 74, -32, -26, -96, 38, 14, -50, 94, 74, -78, -56, 96, -68, 14], [-22, 46, -52, 16, 28, -22, -48, -96, 92, -54, -40, 86, 30, -4, -86, -92, -52, -18, -98, -78, 38, 70, -86, 98, 72, 30, 90, -28, 36, 58, 14, 12, 98, -54, 36, -32, -16, -76, 88, 32, -28, -4, 52, 30], [38, -90, 44, 54, -2, 16, -16, -66, 62, 98, 32, -82, -12, 12, -66, 54, -72, 64, -10, 30, 40, 0, -90, 90, -54, -92, -48, 58, 10, -4, -24, -86, -68, 70, 24, -38, -56, -78, -16, 56, 70, 88, 0, 54], [-50, 2, 18, -6, -12, 64, -12, 64, -44, 16, -16, 20, 72, 32, -54, -22, -12, 56, 84, -48, -60, -90, -70, -12, -4, -72, -78, 16, 22, 12, 48, -2, -82, -94, 48, 30, 76, -12, 94, -8, -10, -8, -46, -22], [96, 56, -22, -44, -30, 92, -56, 26, -42, 60, -2, 58, 52, 8, -48, 70, -38, -32, -92, 14, 26, 76, 48, 84, -96, 42, 32, 38, 6, -70, -58, 4, 58, 86, -54, -4, 80, 94, 18, 28, -82, 4, -14, -80], [-70, -4, 88, 20, -96, 64, -64, -66, -44, 50, -72, -56, 90, 38, 46, -84, 68, 66, -42, 52, 2, -6, 94, 78, -48, 84, -78, 82, -78, 96, 24, -12, -78, 60, 54, 26, -20, -80, -26, -42, 66, -40, -8, -74], [-60, -36, -16, 18, 24, 54, -52, -28, -48, 10, -16, -28, -26, -44, 72, 38, -56, 70, 28, 42, -38, 66, -34, -92, -42, 66, -18, 6, -64, 72, -22, -72, 82, 4, -14, -98, 20, -92, 84, 98, 84, -92, -96, 20], [-66, 8, -92, 76, -24, -36, -18, -62, -62, 12, 26, -12, -64, -26, -16, -42, 2, 82, -16, -74, -60, 8, 62, -8, 0, -66, -52, -44, -54, 58, 16, 94, -90, -60, -2, -14, 18, 16, -22, -88, -60, -16, 26, -18], [-22, -42, 20, -58, 72, 86, 2, -94, 32, -16, -68, -96, 10, -74, 40, -78, 96, -92, -94, 6, -26, -50, -28, -34, 62, 10, 74, -82, 0, 4, 58, -62, 28, 14, 26, 2, -40, -68, 42, 42, 80, 4, -48, -74], [-40, 26, -68, -60, -22, -50, 70, -42, 54, 30, -40, -70, 66, -8, -66, 24, 28, -46, 68, 8, -4, 84, 66, 54, 22, -80, -20, -28, 2, 6, 24, 88, -70, -80, 22, -96, -50, 60, -76, -32, 26, -58, 6, 6], [-60, 28, -56, -4, -8, -32, -12, 48, 48, 94, 18, 30, -56, 72, -70, 68, -26, -48, 22, 18, 64, 78, 38, -90, 18, -34, 90, -98, 82, -26, -80, -34, -22, 72, 58, 82, -96, -20, -80, 16, -50, -4, 24, 64], [-18, -62, 54, 32, 82, -22, 70, 16, 88, -34, 70, 16, -6, -80, 34, -42, 78, 30, -36, 96, 96, -62, 22, -96, -6, 0, -60, -70, 40, -62, 8, -92, -62, 90, -88, -78, 86, -38, 26, 18, 82, -96, -42, 30], [-48, -20, -42, -34, 76, 64, 2, 4, 6, 8, 56, -98, -50, -16, 68, -12, 78, -88, 62, 46, 22, 28, 36, 36, -46, 78, -86, -78, -10, -98, -24, -48, -62, -26, -4, 78, -84, -56, -48, -74, -2, 72, -86, 14], [-42, -74, 54, -28, -16, 94, 40, 44, -22, 10, 42, 38, 46, 68, 72, 32, 84, -6, -30, -54, -62, 30, 94, 36, -18, -30, 66, 52, 18, -24, -16, -60, -56, -2, -78, 80, -60, 20, -72, -24, -48, -86, -16, -12], [46, -38, -28, -72, 80, -8, -28, 28, -28, 4, -84, 56, -48, 28, -54, 34, 84, 28, -52, 38, -34, 20, 84, -10, 36, -60, 54, -66, -8, -54, -44, -82, 56, -78, -76, -94, 24, 30, 30, -78, -22, -48, 22, 44], [-10, -84, 66, 60, 40, -56, 86, 16, 44, -50, -62, 34, -44, 30, -62, 96, 76, -98, -50, -50, 36, -74, 42, -82, 44, -32, -48, 58, 22, 82, 82, 94, -70, -92, -96, -78, -70, 84, -44, -70, 82, -92, -96, -50], [40, -86, 66, 64, 98, 86, 18, 20, 54, -92, -26, 56, -96, -28, 16, 52, 42, 36, -64, 44, -96, -56, 78, 94, -54, 24, -62, 82, -36, -90, -40, 50, -72, -54, 80, 12, -24, 30, -48, 2, -64, 96, -66, 94], [80, 4, -82, -24, 18, 24, -78, -4, -14, 38, -10, -70, -78, -26, 6, 46, 78, 16, -48, 94, 4, 46, 54, -84, -56, -76, -50, -30, -94, -58, -96, 32, -2, -16, 76, -94, 54, -96, 96, -18, 80, 60, -82, 74], [12, -4, -66, 54, 82, 24, -84, 62, -58, -52, 8, -74, -62, 56, 86, -82, 30, 86, 46, 78, 94, 24, 44, 2, 62, -48, 58, 34, -74, -52, 32, 46, 92, 28, 72, -36, -14, -98, 68, -92, 12, 56, -40, -64], [-48, -98, 52, -92, 88, 30, 42, 90, 56, 76, 44, -58, -72, -28, -54, 26, -36, -28, -54, 64, 22, 2, -58, 30, 12, -92, 40, 46, 54, -16, -74, -2, 30, 72, 56, 96, -86, 76, -28, -26, 76, 32, -46, -22], [6, 16, 74, -22, -20, -12, 50, 50, 16, 50, 58, -16, -76, 68, 66, 36, -52, 98, 64, 84, -50, 88, -40, -22, -2, -94, 48, 70, 46, -36, 20, 74, -10, 20, -98, -26, -58, 80, 78, -66, -66, -28, 46, -40]], [[0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1]], [[73, 62, 15, 20, 30, 7, 64, 47, 16, 52, 55, 87, 49, 78, 88, 59, 29, 62, 70], [8, 6, 26, 49, 12, 22, 62, 79, 79, 7, 38, 44, 68, 23, 38, 35, 52, 91, 46], [48, 26, 67, 1, 45, 46, 37, 11, 25, 35, 79, 3, 10, 87, 65, 22, 99, 20, 7], [56, 58, 1, 24, 66, 45, 43, 71, 43, 66, 51, 46, 95, 72, 38, 13, 53, 70, 70], [91, 38, 39, 29, 88, 50, 81, 47, 29, 64, 26, 76, 37, 24, 1, 30, 70, 93, 99], [66, 67, 92, 20, 36, 5, 28, 62, 57, 94, 9, 89, 81, 64, 55, 68, 36, 44, 41], [85, 37, 47, 87, 73, 77, 56, 49, 73, 35, 94, 62, 26, 95, 59, 96, 77, 71, 21], [89, 38, 3, 80, 35, 75, 1, 39, 92, 10, 94, 55, 60, 95, 22, 42, 85, 98, 19], [52, 99, 43, 54, 60, 70, 15, 4, 25, 58, 45, 28, 5, 9, 40, 41, 53, 63, 35], [76, 43, 87, 77, 58, 81, 44, 99, 64, 16, 55, 17, 76, 20, 81, 74, 1, 61, 10], [14, 44, 60, 78, 72, 24, 31, 26, 86, 50, 77, 35, 64, 87, 57, 13, 79, 7, 51], [6, 35, 77, 25, 14, 30, 30, 88, 60, 63, 60, 30, 97, 14, 44, 75, 15, 82, 74], [16, 3, 1, 29, 70, 16, 42, 45, 86, 16, 77, 93, 69, 19, 20, 93, 14, 62, 84], [9, 40, 39, 99, 39, 51, 6, 26, 71, 73, 41, 40, 29, 69, 48, 8, 98, 81, 45], [52, 50, 89, 89, 99, 72, 84, 49, 86, 70, 48, 34, 35, 25, 79, 21, 47, 68, 99], [15, 71, 84, 46, 30, 57, 73, 52, 96, 40, 99, 16, 68, 51, 58, 48, 65, 7, 29], [55, 2, 13, 73, 91, 76, 24, 80, 39, 2, 34, 62, 90, 81, 96, 67, 31, 37, 34], [56, 7, 51, 88, 69, 1, 28, 68, 19, 8, 26, 36, 27, 96, 80, 49, 55, 8, 79], [74, 90, 52, 48, 12, 13, 9, 94, 61, 8, 7, 49, 53, 79, 99, 71, 81, 18, 55]], [[-92, -78, -78, -52, -46, -42, -38, -24, -18, -6, 2, 8, 14, 20, 58, 80, 84], [-86, -76, -66, -42, -26, -24, -18, -12, 2, 4, 10, 10, 14, 56, 62, 78, 80], [-82, -76, -60, -40, -40, -34, -22, -8, 0, 10, 16, 24, 56, 64, 68, 80, 92], [-86, -74, -72, -60, -58, -30, -12, -4, 2, 10, 24, 30, 34, 58, 64, 84, 96], [-88, -88, -88, -84, -66, -48, -32, -32, -18, -18, -12, 2, 12, 40, 58, 72, 86], [-80, -70, -64, -50, -48, -44, -26, -24, -20, -16, -8, 16, 24, 26, 48, 48, 76], [-96, -94, -94, -66, -50, -46, -34, -34, -10, 0, 2, 20, 24, 40, 82, 84, 98], [-90, -78, -66, -34, -20, -10, -10, 0, 10, 20, 36, 44, 58, 58, 80, 80, 84], [-96, -92, -56, -46, -44, -20, 16, 20, 24, 28, 34, 40, 42, 48, 60, 78, 90], [-98, -54, -46, -46, -44, -40, -34, -26, -24, -16, 2, 18, 24, 24, 38, 64, 82], [-80, -68, -66, -56, -46, -28, -24, -22, -16, 18, 20, 22, 24, 52, 64, 82, 98], [-90, -46, -44, -32, -20, -16, 12, 28, 32, 52, 54, 66, 70, 70, 72, 86, 88], [-98, -84, -78, -64, -58, -18, -8, 4, 38, 42, 46, 46, 56, 62, 62, 86, 90], [-98, -52, -52, -36, -8, -6, 22, 24, 26, 38, 40, 44, 56, 60, 66, 80, 94], [-88, -80, -72, -58, -50, -22, -20, -10, -6, 4, 4, 8, 24, 48, 70, 78, 80], [-88, -70, -60, -58, -50, -42, -36, -24, -6, 2, 14, 20, 44, 58, 74, 78, 80], [-76, -50, -46, -40, -30, -24, -10, 4, 10, 14, 28, 36, 40, 40, 46, 56, 60]], [[0, 0, 1, 0, 0, 1], [1, 1, 1, 0, 0, 0], [0, 1, 0, 1, 0, 1], [1, 0, 1, 1, 0, 0], [1, 0, 0, 1, 0, 0], [1, 1, 0, 1, 0, 1]], [[6, 13, 16, 17, 27, 30, 43, 43, 44, 49, 55, 60, 66, 68, 74, 75, 77, 84], [5, 17, 22, 32, 34, 38, 40, 43, 54, 57, 60, 61, 63, 66, 84, 86, 87, 91], [4, 4, 14, 19, 27, 29, 29, 34, 34, 44, 46, 51, 53, 59, 64, 77, 80, 82], [3, 8, 13, 18, 19, 28, 34, 35, 40, 52, 53, 53, 61, 73, 81, 83, 89, 98], [1, 5, 11, 19, 25, 34, 35, 37, 41, 50, 71, 74, 74, 76, 87, 95, 97, 99], [1, 4, 12, 17, 29, 30, 44, 48, 49, 54, 54, 59, 60, 64, 74, 78, 82, 96], [6, 15, 16, 17, 17, 23, 26, 28, 36, 37, 40, 47, 48, 51, 52, 56, 81, 94], [7, 9, 9, 43, 47, 51, 52, 56, 60, 65, 68, 74, 82, 88, 91, 97, 98, 98], [1, 4, 10, 17, 18, 24, 31, 45, 51, 51, 56, 65, 68, 70, 73, 77, 94, 95], [1, 1, 12, 13, 26, 27, 33, 37, 39, 39, 40, 41, 46, 51, 61, 67, 74, 87], [4, 6, 14, 15, 16, 17, 20, 22, 23, 45, 55, 56, 79, 80, 85, 85, 98, 99], [16, 17, 23, 23, 38, 43, 43, 49, 51, 66, 69, 69, 69, 72, 81, 84, 90, 97], [18, 23, 25, 26, 26, 29, 35, 37, 45, 59, 67, 73, 73, 76, 79, 80, 81, 85], [2, 6, 7, 8, 15, 18, 24, 33, 36, 46, 53, 54, 54, 66, 85, 91, 91, 96], [2, 9, 17, 23, 28, 28, 35, 36, 39, 48, 67, 69, 74, 75, 80, 85, 89, 96], [8, 15, 16, 19, 20, 31, 33, 43, 52, 63, 72, 79, 86, 88, 91, 92, 97, 99], [4, 5, 10, 14, 34, 37, 41, 44, 45, 49, 72, 74, 81, 84, 85, 93, 96, 99], [1, 2, 19, 20, 25, 27, 31, 33, 40, 48, 55, 61, 63, 69, 76, 81, 83, 84]], [[4, 12, -60, -76], [-56, 66, -84, 68], [-8, 14, 44, -74], [54, 50, 78, 0]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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, 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], [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, 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], [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, 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], [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], [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], [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, 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], [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], [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], [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, 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, 1, 1, 1, 1], [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], [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, 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], [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, 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, 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], [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], [[52, 7, 95, 62, 93, 89, 91, 56, 59, 16, 68, 28, 66, 67, 28, 60, 62, 73, 99, 50, 82, 60, 6, 98, 1, 16, 98, 77, 24, 53, 93, 41, 57, 64], [58, 70, 84, 33, 17, 25, 71, 88, 18, 52, 3, 82, 29, 21, 92, 7, 30, 32, 22, 70, 23, 3, 82, 10, 51, 58, 16, 8, 18, 58, 88, 12, 38, 24], [54, 57, 1, 87, 51, 44, 43, 24, 90, 50, 11, 30, 50, 76, 32, 99, 28, 10, 31, 90, 34, 90, 96, 39, 7, 22, 87, 72, 49, 31, 41, 71, 37, 64], [3, 91, 36, 83, 54, 80, 5, 44, 86, 45, 3, 33, 82, 92, 49, 96, 66, 97, 22, 43, 39, 12, 57, 97, 19, 99, 14, 20, 18, 24, 21, 62, 50, 8], [84, 52, 2, 31, 27, 92, 11, 4, 45, 39, 71, 95, 86, 19, 93, 93, 78, 35, 49, 66, 63, 57, 92, 20, 42, 19, 42, 71, 3, 58, 8, 30, 46, 36], [93, 21, 64, 42, 14, 39, 41, 71, 53, 68, 17, 46, 20, 66, 31, 24, 84, 63, 33, 58, 77, 56, 25, 61, 18, 26, 1, 10, 17, 24, 68, 39, 32, 23], [39, 54, 68, 4, 79, 78, 80, 94, 47, 18, 88, 9, 5, 24, 15, 19, 75, 50, 92, 23, 95, 90, 45, 21, 75, 70, 54, 12, 91, 15, 19, 73, 95, 20], [6, 50, 7, 65, 67, 87, 75, 68, 30, 89, 55, 31, 22, 42, 81, 71, 16, 4, 53, 3, 36, 69, 60, 45, 57, 85, 97, 99, 86, 11, 62, 76, 73, 7], [90, 92, 37, 24, 45, 10, 86, 79, 95, 62, 61, 70, 52, 84, 32, 62, 51, 31, 84, 58, 69, 85, 96, 74, 78, 11, 5, 73, 22, 89, 95, 86, 96, 1], [23, 83, 80, 6, 93, 80, 51, 87, 21, 29, 58, 92, 79, 80, 57, 76, 85, 49, 52, 32, 38, 83, 90, 14, 46, 83, 68, 76, 22, 58, 79, 43, 78, 42], [3, 51, 5, 9, 20, 68, 89, 22, 21, 39, 84, 36, 23, 70, 93, 33, 38, 76, 43, 3, 87, 9, 33, 50, 52, 91, 42, 76, 80, 82, 96, 10, 16, 98], [79, 84, 65, 45, 18, 45, 8, 42, 13, 1, 62, 95, 46, 53, 7, 32, 43, 19, 26, 63, 12, 58, 56, 52, 73, 50, 6, 41, 14, 85, 4, 35, 28, 20], [81, 20, 82, 93, 57, 57, 3, 8, 93, 17, 80, 34, 23, 21, 71, 46, 52, 77, 76, 62, 67, 70, 12, 99, 71, 1, 4, 21, 70, 56, 60, 19, 79, 92], [39, 69, 98, 82, 21, 26, 68, 89, 17, 8, 60, 21, 36, 55, 81, 44, 96, 62, 87, 14, 47, 14, 39, 76, 49, 38, 58, 84, 93, 14, 15, 30, 13, 16], [92, 70, 11, 57, 19, 22, 3, 39, 96, 86, 46, 55, 19, 40, 16, 37, 50, 75, 63, 50, 49, 95, 89, 38, 47, 8, 78, 15, 64, 57, 5, 8, 32, 54], [53, 2, 4, 76, 12, 39, 65, 40, 70, 13, 15, 42, 62, 15, 23, 16, 69, 47, 6, 35, 54, 8, 37, 53, 15, 16, 62, 74, 58, 31, 17, 42, 50, 9], [55, 92, 37, 74, 80, 67, 21, 31, 51, 10, 73, 43, 54, 26, 57, 40, 40, 39, 67, 64, 71, 4, 36, 33, 85, 86, 35, 97, 2, 56, 25, 94, 89, 29], [76, 13, 35, 51, 17, 13, 31, 6, 83, 31, 5, 71, 92, 2, 49, 11, 89, 83, 61, 82, 8, 48, 91, 71, 95, 55, 19, 60, 85, 89, 66, 25, 15, 30], [54, 94, 58, 73, 99, 27, 74, 6, 89, 46, 3, 16, 70, 44, 6, 30, 37, 50, 92, 17, 79, 77, 82, 69, 19, 57, 95, 39, 10, 13, 79, 50, 20, 96], [78, 2, 85, 80, 62, 28, 17, 28, 51, 37, 91, 31, 99, 98, 3, 19, 3, 91, 12, 37, 33, 18, 5, 39, 93, 21, 57, 71, 47, 62, 76, 35, 79, 6], [1, 90, 92, 4, 33, 68, 68, 31, 76, 18, 81, 20, 50, 97, 17, 8, 38, 80, 85, 56, 36, 76, 20, 57, 20, 5, 56, 61, 2, 14, 22, 8, 86, 14], [71, 45, 94, 34, 98, 3, 65, 8, 88, 17, 20, 98, 19, 63, 11, 89, 34, 62, 54, 26, 94, 7, 27, 28, 28, 12, 7, 4, 77, 12, 9, 24, 65, 85], [70, 14, 10, 88, 9, 7, 56, 53, 18, 17, 22, 82, 79, 89, 26, 52, 39, 74, 21, 57, 70, 71, 78, 67, 27, 37, 65, 90, 73, 28, 78, 31, 94, 91], [10, 99, 56, 64, 46, 65, 8, 74, 81, 76, 44, 82, 37, 84, 31, 30, 93, 45, 79, 35, 37, 61, 51, 99, 67, 19, 59, 8, 28, 9, 82, 88, 62, 4], [37, 6, 2, 45, 24, 60, 77, 78, 78, 25, 73, 25, 46, 56, 99, 26, 2, 59, 50, 86, 18, 32, 3, 82, 45, 96, 88, 90, 53, 91, 72, 52, 20, 24], [51, 11, 26, 53, 77, 33, 83, 46, 32, 63, 22, 48, 64, 5, 29, 95, 28, 16, 5, 51, 43, 27, 38, 22, 5, 29, 54, 54, 23, 13, 80, 45, 96, 85], [26, 54, 77, 95, 90, 59, 70, 7, 96, 65, 33, 29, 88, 79, 15, 74, 52, 36, 74, 56, 63, 4, 42, 8, 98, 55, 24, 60, 68, 99, 18, 86, 46, 92], [16, 81, 86, 22, 79, 79, 30, 7, 77, 68, 77, 50, 98, 76, 98, 27, 59, 10, 95, 53, 55, 91, 11, 18, 12, 5, 22, 48, 84, 3, 83, 41, 7, 72], [62, 72, 56, 90, 49, 13, 25, 29, 85, 47, 6, 30, 59, 30, 74, 55, 98, 86, 75, 7, 50, 34, 92, 71, 28, 27, 73, 76, 96, 92, 67, 78, 73, 36], [68, 91, 8, 18, 61, 91, 37, 26, 32, 81, 77, 7, 72, 88, 4, 29, 67, 61, 5, 23, 72, 50, 79, 24, 23, 72, 88, 90, 51, 74, 8, 2, 7, 82], [75, 25, 11, 60, 42, 36, 10, 26, 11, 97, 13, 77, 14, 25, 39, 48, 22, 39, 70, 85, 42, 47, 79, 96, 45, 15, 10, 79, 6, 93, 50, 67, 66, 99], [43, 58, 67, 95, 47, 79, 13, 66, 90, 52, 35, 18, 87, 7, 99, 6, 17, 5, 84, 25, 23, 46, 49, 71, 23, 5, 97, 50, 30, 12, 99, 58, 45, 19], [66, 54, 34, 82, 61, 60, 61, 18, 71, 81, 67, 2, 10, 90, 31, 66, 54, 27, 82, 58, 69, 16, 30, 78, 62, 66, 30, 79, 86, 98, 49, 43, 46, 74], [60, 3, 19, 15, 90, 29, 28, 90, 96, 62, 51, 37, 3, 88, 71, 77, 44, 40, 92, 41, 96, 69, 53, 41, 82, 42, 49, 99, 79, 21, 56, 28, 7, 46]]]; int [] param1 = [41, 30, 10, 17, 8, 5, 10, 2, 19, 17]; int [] param2 = [32, 35, 9, 10, 10, 3, 13, 3, 18, 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); } " NUMBER_DAYS_TANK_WILL_BECOME_EMPTY,"static int f_filled ( int C , int l ) { if ( l >= C ) return C ; double eq_root = ( Math . sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2 ; return ( int ) ( Math . ceil ( eq_root ) + l ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [40, 64, 11, 23, 12, 1, 10, 14, 13, 36]; int [] param0 = [91, 99, 11, 23, 12, 1, 18, 14, 13, 36]; int [] param1 = [29, 55, 56, 56, 97, 64, 5, 37, 55, 99]; 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_SUBSTRINGS_DIVISIBLE_4_STRING_INTEGERS,"static int f_filled ( String s ) { int n = s . length ( ) ; int count = 0 ; for ( int i = 0 ; i < n ; ++ i ) if ( s . charAt ( i ) == '4' || s . charAt ( i ) == '8' || s . charAt ( i ) == '0' ) count ++ ; for ( int i = 0 ; i < n - 1 ; ++ i ) { int h = ( s . charAt ( i ) - '0' ) * 10 + ( s . charAt ( i + 1 ) - '0' ) ; if ( h % 4 == 0 ) count = count + i + 1 ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 16, 10, 11, 1, 1, 6, 11, 0, 21]; string [] param0 = [""qaq"", ""9400761825850"", ""0011001111"", ""laswqrlrq"", ""5662"", ""110"", "" toykf"", ""6536991235305"", ""11111"", ""uzftt idhcyict""]; 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_EQULIBRIUM_SUM_ARRAY,"static int f_filled ( int [ ] arr , int n ) { int res = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) { int prefix_sum = arr [ i ] ; for ( int j = 0 ; j < i ; j ++ ) prefix_sum += arr [ j ] ; int suffix_sum = arr [ i ] ; for ( int j = n - 1 ; j > i ; j -- ) suffix_sum += arr [ j ] ; if ( prefix_sum == suffix_sum ) res = Math . max ( res , prefix_sum ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7, 6, 5, 4, 0, 9, 4, 4]; int [] [] param0 = [[-2, 5, 3, 1, 2, 6, -4, 2], [4, 2, 8, -1, 2, -4, -1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 3, 0, 4], [1, 0, 2, 0, -2, 0, 1, 0, -2, 0, 0, 0, 0], [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0], [-2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [-1, 2, 3, 0, 3, 2, -1]]; int [] param1 = [8, 7, 19, 5, 13, 38, 21, 7]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_GAMES_PLAYED_WINNER,"static int f_filled ( int N ) { int [ ] dp = new int [ N ] ; dp [ 0 ] = 1 ; dp [ 1 ] = 2 ; int i = 2 ; do { dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] ; } while ( dp [ i ++ ] <= N ) ; return ( i - 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 6, 6, 6, 8, 6, 7, 7, 7, 9]; int [] param0 = [73, 28, 33, 23, 84, 31, 48, 46, 45, 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); } " MAXIMUM_LENGTH_PREFIX_ONE_STRING_OCCURS_SUBSEQUENCE_ANOTHER,"static int f_filled ( String s , String t ) { int count = 0 ; for ( int i = 0 ; i < t . length ( ) ; i ++ ) { if ( count == t . length ( ) ) break ; if ( t . charAt ( i ) == s . charAt ( count ) ) count ++ ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 1, 1, 0, 2, 2, 0, 0, 0, 0]; string [] param0 = [""nobyiojeqz"", ""84574"", ""1010001010010"", ""djztafuudk"", ""550"", ""1110"", ""gywyxwh"", ""67318370914755"", ""11011000000101"", ""g""]; string [] param1 = [""uartdtqbmgi"", ""8538229"", ""11"", ""oewgm"", ""132744553919"", ""0101"", ""lpqqeqrdziwy"", ""9928"", ""00000"", ""v""]; 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); } " REMAINDER_7_LARGE_NUMBERS,"static int f_filled ( String num ) { int series [ ] = { 1 , 3 , 2 , - 1 , - 3 , - 2 }; int series_index = 0 ; int result = 0 ; for ( int i = num . length ( ) - 1 ; i >= 0 ; i -- ) { int digit = num . charAt ( i ) - '0' ; result += digit * series [ series_index ] ; series_index = ( series_index + 1 ) % 6 ; result %= 7 ; } if ( result < 0 ) result = ( result + 7 ) % 7 ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 3, 6, 5, 1, 1, 0, 3, 3, 3]; string [] param0 = [""k"", ""850076"", ""00111"", ""x"", ""1"", ""10010001100"", "" pgpelz"", ""53212456821275"", ""101"", ""v""]; 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_LENGTH_SUBSEQUENCE_DIFFERENCE_ADJACENT_ELEMENTS_EITHER_0_1,"static int f_filled ( int arr [ ] , int n ) { int mls [ ] = new int [ n ] , max = 0 ; for ( int i = 0 ; i < n ; i ++ ) mls [ i ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( Math . abs ( arr [ i ] - arr [ j ] ) <= 1 && mls [ i ] < mls [ j ] + 1 ) mls [ i ] = mls [ j ] + 1 ; for ( int i = 0 ; i < n ; i ++ ) if ( max < mls [ i ] ) max = mls [ i ] ; return max ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 2, 29, 2, 1, 3, 3, 1, 38, 1]; int [] [] param0 = [[4, 5, 9, 31, 31, 37, 41, 55, 56, 61, 79, 81, 89, 93], [-76, 96, -68, -16, 22, -24, -24, 6, 98, -82, 54, -80, 46, 0, 0, -50], [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], [97, 93, 43, 51, 15, 33, 13, 96, 39, 89, 78, 25, 45, 6, 64, 54], [-98, -78, -72, -70, -68, -58, -56, -54, -46, -44, -38, -34, -30, -24, -18, -16, -14, -12, 2, 6, 8, 8, 10, 10, 16, 24, 26, 28, 40, 42, 44, 56, 58, 62, 66, 66, 78, 86], [1, 1, 0, 1, 0, 0], [7, 8, 10, 11, 12, 15, 16, 16, 19, 21, 23, 23, 23, 25, 26, 35, 38, 43, 46, 47, 51, 52, 53, 57, 60, 61, 66, 67, 69, 74, 75, 81, 83, 84, 88, 92, 94, 98, 98, 99], [14, -40], [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], [59, 70, 53]]; int [] param1 = [12, 15, 29, 13, 19, 3, 34, 1, 38, 1]; 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); } " PAIR_WITH_GIVEN_PRODUCT_SET_1_FIND_IF_ANY_PAIR_EXISTS,"static boolean f_filled ( int arr [ ] , int n , int x ) { for ( int i = 0 ; i < n - 1 ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) if ( arr [ i ] * arr [ j ] == x ) return true ; return false ; }","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 = [[10, 20, 9, 40], [1, -10, 20, 9, -40], [0, 0, 0, 0, 0, 1, 1, 1, 1], [4, 10, 20, 9, -40], [-90, -86, -76, -72, -70, -62, -56, -50, -18, -12, -10, 4, 16, 26, 42, 48, 52, 54, 54, 70, 84, 86, 88, 98], [1], [4, 7, 14, 14, 16, 18, 19, 20, 22, 24, 29, 38, 38, 38, 40, 40, 46, 46, 47, 51, 51, 52, 55, 56, 56, 62, 62, 62, 78, 79, 81, 84, 86, 88, 89, 89, 89], [72, 80, -82, 24, -98, 90, -32, -56, -22, 8, -12, 8, -78, 60, -62, 50, 12, -60, 10, -54, 74, 98, 26, 56, 24], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [93, 40, 48, 99, 95, 59, 43, 58, 79, 70, 28]]; int [] param1 = [4, 5, 9, 5, 24, 1, 37, 25, 24, 11]; int [] param2 = [400, 400, 8, -400, 23, 0, 32, 19, 18, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_NUMBER_CHOCOLATES_DISTRIBUTED_EQUALLY_AMONG_K_STUDENTS,"static int f_filled ( int arr [ ] , int n , int k ) { HashMap < Integer , Integer > um = new HashMap < Integer , Integer > ( ) ; int [ ] sum = new int [ n ] ; int curr_rem ; int maxSum = 0 ; sum [ 0 ] = arr [ 0 ] ; for ( int i = 1 ; i < n ; i ++ ) sum [ i ] = sum [ i - 1 ] + arr [ i ] ; for ( int i = 0 ; i < n ; i ++ ) { curr_rem = Math.abs(sum [ i ]) % k ; if ( curr_rem == 0 ) { if ( maxSum < sum [ i ] ) maxSum = sum [ i ] ; } else if ( ! um . containsKey ( curr_rem ) ) um . put ( curr_rem , i ) ; else if ( maxSum < ( sum [ i ] - sum [ um . get ( curr_rem ) ] ) ) maxSum = sum [ i ] - sum [ um . get ( curr_rem ) ] ; } return ( maxSum / k ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [29, 0, 0, 48, 2, 0, 36, 5, 0, 31]; int [] [] param0 = [[2, 3, 8, 8, 12, 14, 23, 25, 25, 27, 27, 29, 40, 42, 49, 52, 52, 54, 56, 57, 61, 68, 74, 77, 81, 82, 83, 84, 85, 85, 85, 87, 87, 88, 88, 90, 92, 96, 96], [-90, -34, 26, -20, -12, -42, 28, 12, -6, 58, -46, 4, -30, -28, -14], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 81, 36, 2, 51, 71, 77, 34, 91, 82, 47, 4, 91, 83, 26, 96, 3, 6], [-92, -86, -82, -68, -60, -46, -40, -28, -26, -24, -2, -2, 2, 2, 10, 10, 10, 16, 16, 18, 20, 20, 22, 30, 34, 38, 56, 56, 60, 62, 62, 68, 82, 94, 94, 98], [0, 1, 0], [3, 8, 15, 19, 21, 26, 28, 31, 31, 42, 45, 48, 57, 75, 75, 78, 79, 85, 91, 99], [-38, 42, 40, -60, -16, -36, 44, 60, -86, -38, 30, -22, -30, -96, -66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [95, 38, 91, 75, 43, 95, 23, 36, 51, 4, 38, 53, 52, 58, 55, 3, 19, 22, 84, 9]]; int [] param1 = [27, 8, 7, 16, 20, 2, 17, 12, 13, 14]; int [] param2 = [32, 14, 9, 12, 31, 2, 16, 10, 16, 19]; 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_CHECK_INPUT_INTEGER_STRING,"static boolean f_filled ( String s ) { for ( int i = 0 ; i < s . length ( ) ; i ++ ) if ( Character . isDigit ( s . charAt ( i ) ) == false ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, true, false, true, true, false, true, true, false]; string [] param0 = [""mgtoyho nt"", ""033675175"", ""011001"", ""xllccg"", ""8223900094410"", ""000"", ""aupp"", ""90202721499"", ""110000100011"", ""mhyhsmqelhg""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_NUMBER_OF_SQUARES_THAT_CAN_BE_FIT_IN_A_RIGHT_ANGLE_ISOSCELES_TRIANGLE,"static int f_filled ( int b , int m ) { return ( b / m - 1 ) * ( b / m ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 1, 0, 0, 0, 153, 0]; int [] param0 = [40, 38, 47, 52, 21, 50, 8, 56, 93, 21]; int [] param1 = [74, 35, 71, 29, 9, 33, 82, 80, 5, 90]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_DECIMAL_BINARY_CONVERSION_2,"static int f_filled ( int N ) { int B_Number = 0 ; int cnt = 0 ; while ( N != 0 ) { int rem = N % 2 ; double c = Math . pow ( 10 , cnt ) ; B_Number += rem * c ; N /= 2 ; cnt ++ ; } return B_Number ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [10010, 1011100, 1010111, 110010, 111000, 1011000, 11, 10000, 101101, 111010]; int [] param0 = [18, 92, 87, 50, 56, 88, 3, 16, 45, 58]; 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_PRODUCT_INCREASING_SUBSEQUENCE,"static int f_filled ( int [ ] arr , int n ) { int [ ] mpis = new int [ n ] ; int max = Integer . MIN_VALUE ; for ( int i = 0 ; i < n ; i ++ ) mpis [ i ] = arr [ i ] ; for ( int i = 1 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( arr [ i ] > arr [ j ] && mpis [ i ] < ( mpis [ j ] * arr [ i ] ) ) mpis [ i ] = mpis [ j ] * arr [ i ] ; for ( int k = 0 ; k < mpis . length ; k ++ ) { if ( mpis [ k ] > max ) { max = mpis [ k ] ; } } return max ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [45000, 21780000, 0, 24, 140, 1, 13234752, 1, 4320]; int [] [] param0 = [[3, 100, 4, 5, 150, 6], [10, 22, 9, 33, 21, 50, 41, 60], [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, 2, 3, 4, 1], [0, 7, 1, 5, 20], [1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1], [-54, 8, -92, -28, 72, 54, -74, 36, -10, 54, -30, -16, -72, -32, -92, 38, -76, -76, -50, -92, 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, 1, 1], [8, 2, 3, 4, 6, 30]]; int [] param1 = [6, 8, 14, 5, 5, 22, 19, 26, 6]; 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_TRIANGLES_N_MOVES,"static int f_filled ( int n ) { int [ ] answer = new int [ n + 1 ] ; answer [ 0 ] = 1 ; for ( int i = 1 ; i <= n ; i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2 ; return answer [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [53, 17, 485, 39365, 13121, 4373, 1062881, 118097, 354293, 1457]; int [] param0 = [3, 2, 5, 9, 8, 7, 12, 10, 11, 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); } " PYTHAGOREAN_QUADRUPLE,"static Boolean f_filled ( int a , int b , int c , int d ) { int sum = a * a + b * b + c * c ; if ( d * d == sum ) return true ; else return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, true, false, false, false, false, false, false, false]; int [] param0 = [1, 3, 0, -1, 82, 14, 6, 13, 96, 70]; int [] param1 = [1, 2, 0, -1, 79, 57, 96, 7, 65, 33]; int [] param2 = [1, 5, 0, -1, 6, 35, 45, 3, 72, 6]; int [] param3 = [3, 38, 0, 1, 59, 29, 75, 63, 93, 2]; 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); } " MAXIMUM_SUM_IARRI_AMONG_ROTATIONS_GIVEN_ARRAY_1,"static int f_filled ( int arr [ ] , int n ) { int cum_sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) cum_sum += arr [ i ] ; int curr_val = 0 ; for ( int i = 0 ; i < n ; i ++ ) curr_val += i * arr [ i ] ; int res = curr_val ; for ( int i = 1 ; i < n ; i ++ ) { int next_val = curr_val - ( cum_sum - arr [ i - 1 ] ) + arr [ i - 1 ] * ( n - 1 ) ; curr_val = next_val ; res = Math . max ( res , next_val ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2249, 9152, 35, 34887, 586, 58, 11145, 14776, 297, 1359]; int [] [] param0 = [[6, 6, 13, 14, 16, 20, 24, 24, 24, 27, 28, 36, 49, 51, 55, 56, 62, 69, 74, 74, 76, 85, 86, 90, 92, 98], [-42, 96, 68, 64, 14, -74, 76, 42, 34, -92, -20, 28, -80, -34, -22, 96, -46, 96, 10, -82, 82, 50, -24, 48, 56, 72, -40, -86, 84, 66, -62, 50, -76, 34], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [37, 88, 70, 86, 24, 62, 34, 44, 37, 42, 46, 34, 23, 32, 55, 2, 5, 70, 30, 46, 40, 65, 91, 4, 7, 74, 46, 12, 30, 22, 1, 91, 89, 88, 97, 6, 6, 11, 33, 14, 68, 24], [-92, -90, -70, -70, -10, 2, 10, 12, 14, 40, 44, 46, 64, 68, 68, 96], [1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1], [9, 15, 15, 17, 19, 20, 21, 23, 25, 25, 25, 32, 32, 33, 45, 51, 54, 59, 68, 71, 71, 71, 72, 75, 78, 80, 82, 82, 88, 89, 92, 93, 94, 97], [52, -78, -80, 32, -56, -98, -36, 86, 34, -36, 42, 46, 50, 0, 34, -46, -2, -18, -96, 12, -42, 62, 32, 78, 66, -8, 50, 60, 10, -18, 66, 80, -24, -98, 8, 48, 34, 44, -80, -34, 72, 0, -60, 52, 40, 20], [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], [45, 35, 25, 7, 24, 73, 25, 86, 48, 70, 47, 91, 96, 15, 39, 9]]; int [] param1 = [13, 27, 10, 39, 11, 15, 22, 45, 33, 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); } " MINIMUM_DIFFERENCE_BETWEEN_GROUPS_OF_SIZE_TWO,"static long f_filled ( long a [ ] , int n ) { Arrays . sort ( a ) ; int i , j ; Vector < Long > s = new Vector < > ( ) ; for ( i = 0 , j = n - 1 ; i < j ; i ++ , j -- ) s . add ( ( a [ i ] + a [ j ] ) ) ; long mini = Collections . min ( s ) ; long maxi = Collections . max ( s ) ; return Math . abs ( maxi - mini ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [10, 10, 1, 13, 38, 0, 9, 0, 1, 16]; long [] [] param0 = [[11, 12, 14, 15, 20, 21, 28, 28, 30, 33, 39, 39, 42, 43, 44, 45, 48, 53, 53, 58, 59, 67, 68, 70, 70, 72, 74, 76, 76, 81, 87, 91], [-94, -84, -70, -62, -60, -56, -44, -42, -30, -14, -14, -12, 0, 14, 18, 28, 42, 52, 58, 58, 88, 92], [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], [2, 4, 4, 6, 8, 9, 10, 21, 24, 28, 28, 31, 31, 31, 32, 34, 36, 37, 38, 44, 46, 46, 48, 49, 49, 61, 61, 64, 66, 67, 70, 70, 76, 76, 78, 78, 85, 90, 97], [-98, -78, -68, -58, -26, -10, 32, 42, 90, 96], [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], [8, 17, 23, 25, 29, 32, 35, 35, 52, 56, 57, 59, 70, 71, 77, 88, 96], [-10, 18, 46, 62, 82], [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], [3, 5, 5, 7, 11, 12, 13, 16, 20, 21, 24, 27, 28, 33, 39, 42, 43, 44, 46, 48, 49, 50, 52, 52, 53, 53, 56, 58, 60, 60, 61, 61, 67, 69, 70, 71, 76, 76, 76, 82, 82, 92, 93, 93, 98]]; int [] param1 = [31, 11, 19, 37, 8, 35, 16, 3, 20, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " MAXIMUM_SUM_PAIRS_SPECIFIC_DIFFERENCE,"static int f_filled ( int arr [ ] , int N , int K ) { Arrays . sort ( arr ) ; int dp [ ] = new int [ N ] ; dp [ 0 ] = 0 ; for ( int i = 1 ; i < N ; i ++ ) { dp [ i ] = dp [ i - 1 ] ; if ( arr [ i ] - arr [ i - 1 ] < K ) { if ( i >= 2 ) dp [ i ] = Math . max ( dp [ i ] , dp [ i - 2 ] + arr [ i ] + arr [ i - 1 ] ) ; else dp [ i ] = Math . max ( dp [ i ] , arr [ i ] + arr [ i - 1 ] ) ; } } return dp [ N - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [344, 204, 13, 2546, 0, 8, 2218, 206, 15, 0]; int [] [] param0 = [[48, 53, 67, 78, 78, 93, 95], [-70, -32, -2, 18, 30, 32, 52, 70, 72, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 3, 5, 5, 6, 10, 12, 13, 13, 16, 23, 23, 34, 36, 39, 40, 42, 45, 45, 47, 51, 51, 52, 56, 57, 58, 60, 60, 60, 60, 61, 63, 67, 68, 71, 73, 75, 80, 80, 82, 84, 86, 86, 86, 86, 89, 90, 98, 99], [-84, -56, 68, 78], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [1, 2, 3, 9, 12, 12, 16, 17, 18, 19, 20, 21, 21, 26, 29, 42, 44, 45, 48, 48, 48, 54, 54, 55, 60, 63, 63, 64, 64, 67, 67, 68, 69, 74, 78, 78, 79, 83, 95, 95, 95, 96, 97, 99], [-92, -58, -56, -48, -42, -16, -14, 28, 40, 42, 54, 60, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [25, 64, 96]]; int [] param1 = [7, 10, 40, 49, 4, 17, 44, 13, 27, 3]; int [] param2 = [4, 8, 31, 37, 3, 9, 42, 8, 19, 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); } " PRIMALITY_TEST_SET_5USING_LUCAS_LEHMER_SERIES,"static boolean f_filled ( int p ) { double checkNumber = Math . pow ( 2 , p ) - 1 ; double nextval = 4 % checkNumber ; for ( int i = 1 ; i < p - 1 ; i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber ; if ( nextval == 0 ) return true; else return false; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, true, false, true, false, false, false, false, false]; int [] param0 = [11, 7, 5, 4, 3, 14, 9, 2, 8, 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); } " N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN,"static int f_filled ( int n ) { int count = 0 ; for ( int curr = 1 ; ; curr ++ ) { int sum = 0 ; for ( int x = curr ; x > 0 ; x = x / 10 ) sum = sum + x % 10 ; if ( sum == 10 ) count ++ ; if ( count == n ) return curr ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [406, 136, 613, 1054, 1126, 109, 1360, 433, 1054, 46]; int [] param0 = [37, 13, 51, 69, 76, 10, 97, 40, 69, 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); } " MIDDLE_OF_THREE_USING_MINIMUM_COMPARISONS_1,"static int f_filled ( int a , int b , int c ) { if ( a > b ) { if ( b > c ) return b ; else if ( a > c ) return c ; else return a ; } else { if ( a > c ) return a ; else if ( b > c ) return c ; else return b ; } }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [24, 66, 40, 10, 56, 50, 62, 16, 41, 63]; int [] param0 = [43, 76, 57, 10, 59, 92, 49, 16, 33, 66]; int [] param1 = [24, 54, 5, 13, 47, 14, 62, 95, 41, 63]; int [] param2 = [7, 66, 40, 4, 56, 50, 65, 12, 90, 46]; 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); } " MINIMIZE_SUM_PRODUCT_TWO_ARRAYS_PERMUTATIONS_ALLOWED,"static int f_filled ( int A [ ] , int B [ ] , int n ) { Arrays . sort ( A ) ; Arrays . sort ( B ) ; int result = 0 ; for ( int i = 0 ; i < n ; i ++ ) result += ( A [ i ] * B [ n - i - 1 ] ) ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2553, -40912, 2, 13337, -134772, 0, 27121, -12260, 0, 47383]; int [] [] param0 = [[31, 85], [-74, -14, -10, -6, 6, 22, 22, 28, 68, 70, 84, 84, 90], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [2, 2, 9, 9, 12, 33, 61, 69, 83, 84, 93], [-92, -88, -84, -78, -78, -76, -66, -54, -52, -48, -46, -44, -40, -34, -32, -24, -20, -14, -6, -4, 2, 6, 10, 10, 22, 26, 32, 36, 36, 40, 46, 48, 56, 58, 64, 76, 80, 80, 80, 84, 84, 84, 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], [4, 6, 6, 20, 22, 23, 26, 39, 40, 47, 50, 68, 68, 70, 73, 77, 80, 82, 85], [-12, -8, 46, 60, 78], [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, 9, 10, 12, 23, 26, 28, 33, 34, 39, 45, 49, 53, 53, 60, 64, 66, 68, 70, 71, 84, 85, 85, 89, 93, 95, 97, 99]]; int [] [] param1 = [[18, 33], [-98, -92, -74, -72, -48, -36, -32, -22, -4, -4, 2, 48, 94], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 4, 31, 39, 52, 54, 69, 81, 85, 92, 92], [-98, -90, -82, -80, -76, -66, -62, -62, -62, -50, -50, -50, -32, -30, -14, -12, 4, 6, 12, 14, 16, 30, 30, 30, 32, 34, 40, 42, 50, 52, 56, 58, 60, 62, 62, 64, 66, 68, 78, 82, 86, 90, 94], [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], [2, 3, 15, 21, 22, 26, 35, 37, 37, 38, 57, 59, 62, 63, 64, 76, 81, 85, 91], [-80, -72, -38, -30, 16], [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, 2, 2, 15, 22, 22, 23, 27, 28, 31, 33, 33, 34, 36, 37, 50, 51, 54, 55, 63, 68, 71, 76, 77, 78, 89, 90, 96]]; int [] param2 = [2, 13, 15, 11, 43, 34, 19, 5, 25, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_BINARY_DECIMAL_CONVERSION,"static int f_filled ( int n ) { int num = n ; int dec_value = 0 ; int base = 1 ; int temp = num ; while ( temp > 0 ) { int last_digit = temp % 10 ; temp = temp / 10 ; dec_value += last_digit * base ; base = base * 2 ; } return dec_value ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [14, 23, 9, 25, 8, 8, 9, 17, 17, 22]; int [] param0 = [70, 95, 41, 97, 8, 16, 41, 57, 81, 78]; 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_STEPS_TO_DELETE_A_STRING_AFTER_REPEATED_DELETION_OF_PALINDROME_SUBSTRINGS,"static int f_filled ( String str ) { int N = str . length ( ) ; int [ ] [ ] dp = new int [ N + 1 ] [ N + 1 ] ; for ( int i = 0 ; i <= N ; i ++ ) for ( int j = 0 ; j <= N ; j ++ ) dp [ i ] [ j ] = 0 ; for ( int len = 1 ; len <= N ; len ++ ) { for ( int i = 0 , j = len - 1 ; j < N ; i ++ , j ++ ) { if ( len == 1 ) dp [ i ] [ j ] = 1 ; else { dp [ i ] [ j ] = 1 + dp [ i + 1 ] [ j ] ; if ( str . charAt ( i ) == str . charAt ( i + 1 ) ) dp [ i ] [ j ] = Math . min ( 1 + dp [ i + 2 ] [ j ] , dp [ i ] [ j ] ) ; for ( int K = i + 2 ; K <= j ; K ++ ) if ( str . charAt ( i ) == str . charAt ( K ) ) dp [ i ] [ j ] = Math . min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ] , dp [ i ] [ j ] ) ; } } } return dp [ 0 ] [ N - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 7, 3, 7, 5, 2, 6, 7, 2, 2]; string [] param0 = [""yctlqthlwr"", ""47713514383248"", ""0100101001111"", ""xfdiyvn"", ""45499225407"", ""000100111001"", ""zouqhqwoap"", ""18579027952"", ""00000001111"", ""jd""]; 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_DIFFERENCE_MAX_MIN_K_SIZE_SUBSETS,"static int f_filled ( int arr [ ] , int N , int K ) { Arrays . sort ( arr ) ; int res = 2147483647 ; for ( int i = 0 ; i <= ( N - K ) ; i ++ ) { int curSeqDiff = arr [ i + K - 1 ] - arr [ i ] ; res = Math . min ( res , curSeqDiff ) ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 146, 1, 84, 82, 1, 77, 108, 0, 39]; int [] [] param0 = [[1, 1, 4, 18, 21, 35, 37, 39, 76, 81, 86, 92, 96], [-94, -86, -48, -48, -38, -8, -6, 0, 2, 24, 34, 52, 62], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 10, 13, 23, 30, 30, 34, 36, 37, 39, 43, 50, 57, 66, 71, 74, 81, 83, 89, 94, 94, 99], [-96, -94, -92, -84, -80, -72, -24, -22, -18, -14, 6, 8, 26, 28, 30, 36, 50, 58, 80, 84, 92, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [6, 7, 9, 27, 30, 42, 54, 55, 57, 57, 59, 76, 84, 84, 84], [-96, -86, -80, -72, -70, -68, -64, -64, -56, -54, -38, -30, -24, -16, -16, -12, -12, -10, 0, 0, 4, 4, 24, 28, 38, 40, 44, 48, 50, 54, 54, 62, 62, 68, 80, 84, 88, 88, 92, 94], [0, 1], [1, 6, 7, 8, 10, 10, 18, 54, 55, 56, 59, 59, 61, 63, 67, 69, 75, 78, 88, 89, 93, 97, 98]]; int [] param1 = [13, 13, 28, 22, 22, 23, 15, 40, 2, 23]; int [] param2 = [6, 12, 26, 20, 12, 22, 14, 26, 1, 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); } " NON_REPEATING_ELEMENT,"static int f_filled ( int arr [ ] , int n ) { for ( int i = 0 ; i < n ; i ++ ) { int j ; for ( j = 0 ; j < n ; j ++ ) if ( i != j && arr [ i ] == arr [ j ] ) break ; if ( j == n ) return arr [ i ] ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, -96, -1, 19, -90, -1, 1, -84, -1, 2]; int [] [] param0 = [[1, 2, 3, 4, 6, 6, 7, 9, 10, 13, 16, 23, 30, 32, 36, 42, 42, 43, 44, 47, 48, 48, 49, 52, 52, 53, 55, 56, 58, 59, 60, 60, 63, 67, 68, 68, 74, 75, 76, 80, 81, 81, 83, 83, 86, 87, 91, 92, 97], [-96, -46, -86, 56, -72, 50, 18, 8, 50], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [19, 10, 49, 40, 34, 21, 63, 51], [-96, -96, -90, -88, -88, -84, -80, -76, -68, -64, -64, -52, -52, -52, -52, -50, -50, -48, -48, -40, -32, -26, -24, -22, -20, -14, -12, 0, 6, 8, 10, 20, 24, 28, 34, 36, 54, 60, 60, 60, 68, 74, 74, 74, 84, 88, 94], [1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0], [1, 2, 3, 10, 15, 21, 28, 36, 41, 44, 45, 47, 72, 77, 77, 79, 85], [42, -84, 42, 36, -10, 24, -62, 60], [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], [2, 21, 42, 92, 65, 62, 75, 43, 81, 17, 92, 86, 37, 63, 27, 97, 24, 61, 85, 49, 84, 7, 14, 19, 60, 55, 68, 79, 8, 12, 75, 12, 92, 79, 42]]; int [] param1 = [47, 8, 14, 5, 27, 19, 15, 7, 35, 27]; 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_FLIP_REQUIRED_MAKE_BINARY_MATRIX_SYMMETRIC_1,"static int f_filled ( int mat [ ] [ ] , int n ) { int flip = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( mat [ i ] [ j ] != mat [ j ] [ i ] ) flip ++ ; return flip ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [27, 15, 340, 21, 55, 46, 230, 0, 340, 432]; int [] [] [] param0 = [[[16, 16, 47, 49, 50, 64, 70, 83, 88], [11, 12, 24, 32, 36, 39, 48, 58, 62], [29, 31, 35, 49, 71, 78, 82, 92, 96], [6, 21, 46, 53, 83, 88, 94, 94, 97], [29, 36, 41, 52, 83, 89, 89, 90, 90], [3, 11, 35, 45, 47, 79, 81, 85, 96], [31, 43, 62, 62, 62, 65, 66, 68, 81], [8, 9, 10, 26, 36, 43, 58, 70, 95], [2, 8, 24, 31, 42, 43, 58, 90, 94]], [[20, 8, -42, -16, 58, 58, 80], [-28, -20, 54, 94, 62, 22, -86], [-26, 86, 48, -28, 10, 90, -40], [68, 76, 16, -50, -58, 18, -86], [40, -52, 8, -14, -8, 54, 78], [82, 92, 2, 54, 62, 80, 14], [-56, -90, 74, -16, -92, 76, 32]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 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, 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], [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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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], [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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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, 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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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], [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, 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, 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, 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, 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, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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, 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]], [[66, 95, 76, 26, 11, 80, 1, 59, 16], [79, 5, 47, 12, 55, 11, 49, 12, 84], [77, 16, 8, 92, 95, 71, 16, 71, 44], [14, 17, 30, 80, 42, 42, 35, 62, 87], [47, 75, 69, 34, 25, 54, 87, 49, 62], [9, 20, 35, 98, 95, 57, 51, 64, 72], [66, 38, 22, 59, 82, 49, 40, 46, 64], [31, 15, 63, 84, 6, 18, 93, 36, 62], [96, 13, 34, 87, 16, 6, 91, 65, 13]], [[-94, -68, -54, -36, -32, -28, -10, 10, 30, 38, 58, 66, 78, 90], [-98, -62, -44, -38, -36, -34, -34, -26, 28, 30, 34, 64, 90, 98], [-90, -88, -84, -62, -54, -24, 4, 6, 30, 32, 40, 50, 56, 68], [-98, -80, -74, -48, -18, -14, -10, 10, 24, 42, 54, 54, 74, 96], [-84, -68, -52, -32, -16, -8, -4, 6, 44, 48, 50, 78, 80, 84], [-96, -84, -78, -42, -38, -36, -16, -14, 2, 14, 16, 24, 28, 40], [-94, -92, -86, -84, -62, -58, -52, -46, -22, -12, 16, 32, 62, 68], [-92, -72, -68, -62, -50, -50, -38, -12, 22, 40, 40, 42, 48, 70], [-90, -72, -42, -28, 16, 22, 26, 36, 42, 50, 68, 82, 90, 94], [-86, -78, -66, -60, -46, -30, -26, -20, -14, 54, 60, 66, 76, 84], [-98, -96, -76, -64, -30, -16, -4, 14, 22, 28, 48, 64, 74, 96], [-88, -68, -58, -50, -28, -16, -8, 2, 18, 20, 28, 58, 60, 82], [-94, -82, -70, 14, 14, 24, 30, 36, 48, 50, 50, 76, 78, 96], [-88, -74, -12, 6, 10, 18, 28, 46, 56, 58, 84, 90, 90, 96]], [[1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1], [0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1], [1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0], [1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0], [0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0], [0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1], [1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0], [0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0], [0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1], [1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1], [1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1], [1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1], [1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1], [0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0], [1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0], [1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1], [0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1], [0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0], [1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1], [0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0], [1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0], [0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1]], [[1, 4, 11, 16, 18, 19, 20, 25, 27, 29, 30, 30, 33, 34, 35, 36, 37, 38, 40, 40, 49, 49, 51, 51, 53, 56, 57, 59, 60, 61, 61, 62, 63, 69, 72, 77, 79, 82, 85, 86, 89, 94, 97, 98], [2, 6, 8, 10, 11, 11, 11, 14, 15, 19, 20, 21, 21, 23, 26, 31, 31, 34, 37, 37, 40, 40, 41, 47, 47, 48, 52, 53, 55, 59, 67, 77, 81, 82, 82, 83, 88, 92, 92, 93, 94, 96, 97, 98], [3, 4, 4, 6, 10, 13, 13, 13, 16, 18, 24, 25, 26, 27, 28, 31, 32, 34, 35, 38, 45, 50, 52, 53, 55, 57, 57, 58, 62, 64, 65, 70, 71, 72, 75, 77, 82, 86, 86, 92, 93, 94, 98, 99], [2, 4, 5, 8, 10, 10, 13, 14, 15, 18, 19, 21, 21, 21, 24, 24, 28, 30, 30, 31, 36, 37, 38, 48, 48, 52, 53, 58, 59, 60, 61, 67, 75, 77, 77, 78, 80, 81, 86, 87, 89, 89, 96, 96], [2, 4, 8, 16, 20, 20, 24, 26, 27, 28, 29, 36, 37, 43, 43, 43, 44, 45, 46, 46, 47, 48, 49, 50, 51, 52, 56, 59, 59, 62, 70, 71, 71, 72, 73, 79, 79, 86, 86, 89, 91, 91, 91, 97], [1, 1, 2, 5, 6, 10, 17, 21, 22, 23, 23, 28, 31, 34, 36, 38, 41, 42, 43, 44, 52, 53, 54, 56, 56, 58, 59, 62, 64, 67, 67, 68, 70, 71, 77, 81, 82, 83, 83, 85, 88, 89, 90, 98], [1, 1, 2, 3, 3, 4, 6, 6, 7, 10, 11, 12, 13, 14, 15, 15, 19, 21, 25, 27, 42, 45, 46, 50, 51, 51, 52, 55, 60, 60, 67, 70, 71, 71, 77, 78, 81, 85, 86, 86, 87, 90, 95, 99], [2, 4, 7, 9, 9, 11, 15, 17, 19, 22, 27, 27, 30, 32, 34, 35, 35, 36, 41, 42, 46, 46, 48, 54, 55, 56, 59, 61, 61, 65, 66, 67, 70, 73, 80, 81, 85, 89, 90, 91, 92, 96, 96, 97], [7, 8, 12, 14, 17, 19, 21, 24, 27, 28, 34, 36, 38, 48, 54, 57, 59, 59, 62, 66, 66, 67, 70, 71, 71, 71, 72, 73, 74, 74, 76, 76, 78, 79, 80, 80, 83, 88, 88, 90, 92, 95, 96, 98], [3, 3, 8, 10, 10, 15, 16, 20, 25, 25, 25, 29, 34, 36, 42, 50, 52, 54, 56, 58, 59, 63, 64, 65, 71, 73, 73, 74, 75, 75, 76, 76, 78, 80, 82, 86, 86, 87, 87, 92, 94, 94, 96, 99], [7, 9, 12, 15, 24, 24, 25, 26, 27, 28, 32, 37, 38, 43, 44, 46, 50, 50, 52, 52, 55, 56, 56, 56, 58, 58, 59, 62, 64, 65, 68, 72, 72, 80, 85, 85, 86, 90, 91, 92, 98, 98, 98, 99], [2, 7, 9, 18, 28, 29, 31, 32, 32, 38, 39, 39, 41, 41, 45, 48, 49, 49, 49, 50, 50, 58, 58, 62, 62, 63, 68, 69, 69, 71, 72, 74, 74, 75, 77, 78, 79, 81, 82, 82, 83, 83, 95, 98], [3, 5, 6, 6, 7, 10, 10, 13, 15, 17, 22, 23, 25, 25, 25, 25, 27, 29, 35, 37, 38, 46, 47, 50, 50, 51, 53, 56, 56, 59, 71, 71, 72, 74, 77, 79, 80, 83, 84, 90, 90, 92, 95, 98], [1, 9, 19, 20, 22, 22, 22, 23, 24, 28, 32, 32, 32, 36, 36, 37, 37, 39, 45, 50, 53, 56, 58, 58, 60, 64, 66, 68, 68, 69, 72, 73, 73, 73, 75, 75, 79, 80, 80, 82, 86, 87, 91, 99], [5, 9, 12, 13, 14, 18, 23, 25, 25, 28, 29, 32, 33, 34, 39, 41, 46, 49, 50, 52, 55, 55, 56, 59, 61, 63, 65, 65, 67, 69, 69, 74, 75, 78, 80, 81, 85, 85, 86, 88, 88, 92, 96, 98], [4, 4, 9, 11, 12, 20, 23, 23, 24, 27, 33, 35, 37, 40, 41, 43, 44, 45, 45, 49, 50, 51, 54, 54, 56, 58, 63, 65, 71, 71, 72, 73, 75, 76, 76, 78, 81, 84, 86, 88, 90, 90, 96, 99], [1, 2, 8, 9, 10, 15, 17, 18, 18, 19, 20, 21, 21, 21, 26, 27, 29, 32, 33, 34, 34, 39, 44, 47, 55, 56, 58, 60, 62, 64, 65, 70, 70, 72, 74, 74, 75, 76, 79, 81, 84, 86, 90, 93], [2, 2, 6, 8, 9, 13, 15, 16, 16, 17, 18, 20, 24, 28, 33, 34, 36, 39, 40, 44, 46, 48, 50, 53, 53, 54, 61, 67, 69, 71, 72, 75, 76, 78, 83, 87, 88, 91, 93, 94, 94, 96, 97, 98], [2, 6, 9, 10, 12, 13, 14, 15, 16, 17, 21, 22, 29, 29, 31, 31, 34, 38, 38, 39, 40, 43, 44, 46, 48, 50, 52, 52, 57, 62, 65, 66, 68, 69, 69, 73, 74, 77, 79, 80, 83, 84, 87, 95], [7, 7, 13, 14, 19, 22, 24, 24, 25, 30, 30, 32, 39, 41, 43, 48, 49, 50, 50, 52, 53, 54, 58, 61, 62, 65, 65, 66, 66, 67, 69, 70, 73, 73, 75, 77, 88, 89, 92, 92, 96, 96, 97, 98], [1, 3, 3, 4, 12, 14, 27, 32, 32, 33, 33, 37, 42, 42, 42, 43, 47, 49, 53, 55, 56, 57, 59, 60, 61, 61, 61, 65, 66, 66, 67, 71, 72, 73, 78, 79, 80, 82, 87, 89, 92, 94, 95, 96], [5, 6, 6, 11, 11, 13, 18, 18, 19, 21, 25, 28, 31, 37, 40, 40, 43, 45, 51, 53, 53, 58, 63, 64, 67, 68, 73, 75, 75, 77, 82, 84, 84, 86, 88, 91, 92, 94, 94, 96, 97, 97, 98, 99], [1, 2, 3, 7, 8, 8, 8, 17, 23, 23, 24, 31, 33, 33, 36, 37, 38, 38, 43, 44, 47, 47, 47, 49, 52, 55, 56, 56, 59, 68, 71, 72, 72, 75, 79, 79, 80, 82, 83, 92, 93, 97, 97, 98], [1, 2, 6, 6, 11, 13, 15, 15, 17, 20, 20, 24, 27, 27, 28, 30, 30, 33, 36, 37, 38, 40, 40, 40, 40, 42, 46, 51, 58, 60, 64, 65, 67, 71, 72, 75, 78, 82, 85, 87, 89, 97, 98, 98], [1, 2, 3, 5, 7, 7, 7, 16, 16, 18, 20, 20, 23, 23, 32, 32, 33, 33, 34, 38, 39, 41, 42, 43, 45, 47, 47, 50, 50, 53, 53, 56, 59, 60, 61, 64, 72, 79, 79, 84, 85, 89, 94, 98], [2, 9, 11, 11, 14, 25, 26, 27, 29, 31, 32, 34, 35, 38, 38, 38, 40, 46, 47, 47, 48, 49, 51, 55, 58, 63, 63, 66, 67, 67, 68, 69, 70, 77, 80, 81, 83, 85, 89, 90, 92, 95, 97, 98], [1, 2, 5, 8, 8, 9, 12, 12, 17, 19, 20, 28, 29, 35, 38, 38, 38, 41, 43, 45, 48, 51, 56, 62, 68, 69, 70, 73, 74, 74, 77, 79, 81, 83, 84, 87, 88, 89, 92, 93, 93, 97, 98, 99], [2, 3, 4, 5, 6, 6, 10, 11, 11, 13, 14, 14, 18, 18, 19, 20, 26, 30, 31, 32, 32, 34, 34, 35, 38, 42, 43, 44, 48, 53, 55, 56, 59, 59, 65, 72, 78, 84, 85, 88, 90, 97, 97, 98], [1, 9, 10, 15, 17, 17, 18, 18, 20, 24, 25, 26, 30, 31, 33, 35, 36, 42, 43, 43, 44, 46, 46, 48, 49, 49, 49, 49, 51, 51, 52, 59, 62, 64, 65, 71, 72, 74, 79, 79, 89, 90, 94, 97], [1, 2, 10, 11, 15, 18, 18, 19, 21, 22, 25, 28, 28, 30, 37, 38, 40, 41, 46, 46, 49, 51, 52, 53, 53, 56, 64, 69, 69, 72, 72, 74, 77, 77, 77, 78, 78, 84, 85, 96, 97, 98, 98, 99], [1, 6, 6, 6, 7, 7, 10, 11, 16, 17, 18, 18, 27, 27, 33, 33, 35, 38, 41, 46, 47, 53, 54, 54, 56, 62, 63, 63, 66, 67, 67, 77, 77, 78, 79, 83, 88, 88, 89, 92, 95, 95, 96, 99], [3, 4, 6, 8, 8, 8, 10, 12, 15, 17, 19, 19, 22, 22, 25, 28, 28, 29, 34, 34, 39, 41, 42, 43, 46, 46, 46, 53, 53, 54, 56, 56, 56, 63, 64, 68, 70, 75, 82, 84, 85, 94, 95, 96], [3, 4, 4, 5, 8, 9, 17, 21, 23, 25, 31, 32, 35, 38, 38, 39, 39, 43, 49, 54, 56, 61, 61, 64, 64, 65, 65, 65, 69, 70, 70, 70, 71, 72, 74, 74, 77, 78, 78, 80, 84, 90, 96, 99], [1, 3, 6, 12, 13, 13, 13, 20, 21, 21, 24, 29, 33, 33, 38, 40, 42, 42, 45, 46, 47, 49, 55, 57, 58, 60, 60, 62, 63, 63, 67, 68, 69, 70, 72, 72, 74, 75, 75, 77, 77, 88, 95, 99], [3, 4, 4, 8, 9, 9, 9, 11, 12, 12, 15, 16, 17, 18, 20, 21, 22, 22, 25, 28, 29, 33, 34, 35, 36, 43, 46, 57, 58, 59, 63, 68, 69, 72, 76, 78, 83, 89, 90, 91, 93, 96, 97, 99], [1, 9, 11, 12, 13, 15, 19, 26, 27, 32, 34, 42, 42, 44, 48, 54, 54, 56, 57, 58, 60, 64, 76, 80, 81, 82, 82, 82, 83, 84, 85, 85, 85, 86, 87, 92, 94, 95, 96, 97, 97, 97, 98, 98], [5, 7, 16, 20, 21, 22, 27, 29, 30, 31, 32, 33, 36, 37, 38, 44, 47, 47, 50, 53, 54, 56, 58, 60, 60, 61, 62, 63, 63, 64, 64, 68, 69, 77, 81, 81, 82, 82, 84, 86, 87, 90, 92, 96], [3, 3, 6, 6, 8, 8, 9, 13, 20, 21, 27, 27, 29, 32, 34, 40, 43, 47, 49, 49, 50, 53, 54, 54, 57, 61, 63, 65, 66, 71, 72, 72, 73, 73, 74, 75, 75, 75, 79, 82, 85, 90, 92, 94], [2, 3, 5, 5, 9, 9, 14, 17, 20, 21, 23, 27, 29, 31, 33, 36, 38, 42, 43, 45, 45, 46, 47, 47, 48, 53, 54, 55, 56, 58, 60, 64, 67, 67, 69, 77, 77, 84, 87, 92, 92, 93, 94, 98], [4, 9, 10, 12, 13, 15, 16, 20, 24, 25, 26, 27, 31, 34, 38, 38, 40, 41, 43, 44, 46, 46, 47, 47, 48, 57, 64, 74, 77, 78, 79, 82, 82, 85, 87, 87, 88, 89, 91, 92, 94, 96, 97, 99], [2, 2, 4, 8, 10, 12, 13, 20, 21, 21, 29, 32, 34, 40, 40, 40, 43, 45, 46, 47, 47, 48, 49, 51, 57, 67, 68, 68, 70, 72, 76, 76, 77, 78, 79, 81, 84, 88, 89, 91, 94, 95, 97, 98], [3, 4, 4, 6, 8, 8, 9, 11, 14, 14, 15, 16, 16, 22, 22, 23, 25, 30, 30, 33, 33, 35, 36, 37, 40, 40, 42, 42, 44, 52, 55, 56, 56, 58, 60, 64, 64, 66, 67, 69, 80, 81, 81, 91], [7, 10, 10, 11, 13, 13, 13, 15, 23, 25, 27, 28, 28, 30, 34, 35, 37, 38, 39, 44, 45, 46, 49, 50, 53, 53, 56, 60, 60, 64, 64, 65, 66, 68, 68, 70, 77, 78, 79, 80, 81, 85, 92, 95], [1, 3, 7, 7, 9, 11, 12, 19, 19, 20, 22, 22, 25, 26, 34, 38, 43, 45, 47, 49, 50, 54, 55, 55, 57, 60, 62, 62, 64, 69, 70, 72, 72, 76, 77, 79, 83, 89, 93, 94, 95, 98, 99, 99]], [[-6]], [[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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [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], [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], [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], [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], [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], [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], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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], [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]], [[57, 35, 39, 48, 79, 25, 49, 44, 40, 59, 90, 18, 4, 14, 32, 39, 2, 15, 34, 91, 11, 16, 23, 1, 7, 3, 40, 93, 14, 33, 51, 35, 78, 35, 67, 3, 38, 71], [57, 4, 10, 9, 40, 48, 47, 9, 33, 91, 47, 12, 66, 45, 90, 89, 94, 69, 71, 43, 83, 23, 30, 15, 52, 78, 42, 34, 65, 45, 35, 9, 48, 4, 6, 1, 40, 13], [58, 15, 43, 30, 58, 15, 58, 90, 96, 92, 80, 66, 14, 16, 79, 49, 91, 19, 1, 64, 21, 27, 41, 48, 21, 21, 21, 26, 70, 97, 63, 35, 92, 96, 61, 3, 86, 47], [92, 91, 51, 18, 77, 83, 67, 81, 77, 78, 53, 40, 53, 35, 43, 16, 39, 69, 10, 38, 19, 3, 33, 94, 60, 84, 95, 76, 23, 52, 72, 67, 14, 61, 26, 52, 81, 62], [27, 60, 67, 50, 57, 97, 65, 22, 57, 91, 71, 61, 5, 56, 59, 55, 67, 23, 89, 88, 61, 21, 70, 69, 63, 59, 36, 29, 63, 60, 82, 33, 60, 83, 24, 22, 69, 96], [89, 59, 51, 55, 68, 44, 41, 11, 19, 44, 14, 47, 14, 3, 23, 84, 76, 95, 19, 69, 67, 62, 42, 69, 43, 18, 93, 93, 6, 18, 16, 37, 28, 46, 53, 82, 5, 64], [73, 22, 7, 71, 4, 28, 4, 43, 3, 28, 82, 66, 45, 52, 59, 66, 80, 50, 84, 82, 22, 52, 98, 13, 48, 33, 58, 15, 44, 79, 91, 80, 30, 67, 72, 23, 14, 1], [70, 78, 31, 58, 42, 81, 50, 88, 23, 99, 7, 59, 1, 63, 60, 8, 69, 81, 19, 96, 61, 16, 37, 47, 69, 83, 70, 77, 72, 45, 41, 34, 78, 71, 71, 6, 94, 53], [38, 46, 91, 77, 24, 94, 98, 68, 4, 23, 30, 65, 12, 71, 20, 21, 84, 39, 83, 98, 79, 72, 76, 71, 99, 73, 27, 47, 55, 43, 4, 10, 38, 93, 14, 65, 18, 98], [66, 76, 94, 19, 66, 43, 17, 53, 69, 25, 48, 29, 70, 65, 90, 93, 6, 85, 21, 33, 12, 90, 66, 32, 14, 88, 13, 6, 12, 5, 57, 75, 87, 44, 72, 45, 66, 48], [66, 44, 52, 38, 99, 65, 41, 88, 18, 93, 96, 39, 45, 19, 35, 53, 68, 76, 14, 6, 74, 30, 18, 28, 39, 67, 20, 48, 9, 77, 25, 45, 72, 48, 36, 24, 36, 16], [14, 90, 11, 65, 5, 97, 61, 91, 5, 47, 11, 85, 83, 39, 69, 12, 76, 44, 52, 24, 35, 99, 23, 94, 56, 55, 71, 19, 3, 86, 7, 1, 44, 20, 95, 81, 77, 43], [10, 93, 48, 53, 66, 88, 68, 58, 67, 17, 7, 54, 16, 33, 46, 15, 34, 56, 84, 18, 46, 93, 54, 99, 63, 47, 28, 48, 35, 94, 77, 34, 56, 36, 43, 12, 73, 90], [8, 56, 60, 26, 78, 18, 28, 30, 65, 81, 84, 40, 74, 17, 52, 46, 28, 4, 14, 41, 2, 91, 9, 16, 85, 82, 59, 58, 63, 35, 1, 13, 48, 39, 1, 12, 31, 34], [48, 3, 7, 11, 44, 41, 4, 35, 30, 23, 86, 98, 35, 82, 72, 49, 58, 32, 71, 58, 92, 49, 88, 84, 80, 3, 86, 37, 65, 91, 12, 7, 44, 74, 50, 65, 52, 16], [27, 21, 48, 22, 70, 83, 45, 34, 84, 45, 39, 9, 33, 76, 51, 19, 82, 27, 30, 83, 93, 62, 21, 84, 13, 24, 22, 95, 86, 33, 18, 74, 88, 95, 41, 91, 51, 7], [62, 22, 26, 38, 15, 3, 28, 93, 54, 23, 46, 10, 36, 83, 66, 14, 32, 80, 73, 58, 79, 51, 34, 94, 70, 24, 7, 64, 76, 96, 3, 85, 93, 79, 12, 37, 94, 93], [33, 20, 76, 50, 37, 56, 92, 79, 66, 76, 28, 69, 38, 6, 90, 30, 51, 95, 34, 15, 40, 24, 47, 99, 50, 3, 5, 8, 50, 35, 27, 30, 44, 31, 64, 79, 13, 73], [69, 56, 99, 12, 4, 16, 97, 89, 62, 15, 41, 67, 82, 6, 20, 80, 98, 42, 78, 86, 77, 59, 21, 11, 96, 96, 34, 69, 84, 67, 91, 64, 67, 75, 50, 47, 59, 79], [82, 78, 57, 77, 3, 60, 27, 93, 26, 98, 24, 38, 49, 31, 57, 44, 23, 33, 68, 66, 26, 17, 4, 76, 11, 10, 7, 98, 73, 57, 55, 37, 41, 57, 82, 29, 80, 86], [78, 61, 89, 44, 96, 59, 79, 39, 55, 23, 94, 23, 59, 4, 37, 19, 10, 94, 72, 90, 25, 86, 50, 68, 71, 34, 56, 72, 46, 45, 28, 85, 91, 50, 34, 71, 49, 68], [46, 60, 27, 21, 44, 61, 86, 9, 64, 78, 53, 97, 30, 57, 24, 67, 38, 30, 61, 87, 79, 40, 20, 59, 31, 20, 2, 22, 96, 63, 9, 8, 81, 96, 19, 60, 97, 40], [61, 59, 30, 75, 21, 33, 92, 89, 85, 72, 98, 3, 23, 61, 87, 93, 92, 83, 9, 82, 44, 89, 68, 54, 14, 76, 49, 29, 44, 33, 94, 23, 17, 46, 45, 50, 1, 88], [53, 90, 59, 33, 63, 59, 94, 93, 7, 61, 96, 16, 51, 52, 3, 42, 9, 10, 94, 66, 14, 89, 72, 94, 99, 14, 74, 45, 78, 99, 54, 53, 80, 19, 87, 48, 12, 38], [9, 17, 96, 94, 10, 97, 46, 40, 35, 37, 16, 11, 88, 65, 94, 87, 75, 42, 16, 32, 95, 4, 54, 42, 62, 10, 90, 31, 79, 45, 42, 88, 96, 47, 88, 4, 10, 76], [1, 14, 14, 41, 6, 62, 47, 66, 23, 51, 65, 6, 16, 47, 32, 22, 93, 54, 72, 82, 40, 24, 94, 62, 25, 61, 41, 14, 95, 50, 98, 30, 65, 22, 85, 79, 3, 10], [64, 40, 52, 51, 32, 35, 71, 5, 89, 12, 91, 33, 78, 88, 39, 68, 44, 30, 5, 57, 18, 30, 58, 57, 22, 44, 12, 16, 50, 42, 80, 85, 53, 29, 5, 56, 14, 92], [35, 81, 5, 71, 97, 39, 34, 19, 78, 75, 51, 49, 39, 12, 80, 2, 90, 35, 25, 48, 87, 75, 23, 92, 33, 78, 39, 37, 70, 74, 62, 92, 12, 99, 18, 33, 89, 28], [79, 82, 20, 51, 35, 70, 24, 9, 34, 25, 27, 53, 84, 45, 31, 20, 58, 55, 12, 51, 78, 45, 48, 66, 92, 7, 93, 72, 93, 59, 70, 66, 67, 11, 10, 95, 57, 65], [56, 23, 53, 92, 41, 98, 86, 27, 56, 38, 95, 34, 5, 83, 80, 49, 10, 71, 54, 40, 81, 44, 91, 61, 96, 22, 53, 7, 60, 35, 65, 93, 2, 59, 92, 60, 80, 70], [58, 75, 10, 84, 37, 32, 71, 91, 66, 98, 51, 28, 17, 91, 45, 22, 13, 19, 93, 85, 19, 11, 66, 2, 87, 58, 24, 42, 15, 21, 95, 59, 67, 27, 39, 48, 94, 53], [48, 39, 19, 44, 34, 20, 42, 38, 95, 24, 69, 5, 12, 75, 17, 5, 72, 70, 91, 24, 20, 45, 14, 29, 43, 10, 27, 98, 93, 21, 89, 23, 40, 38, 36, 99, 90, 82], [38, 1, 96, 18, 20, 6, 20, 88, 73, 92, 41, 90, 2, 18, 78, 89, 7, 81, 34, 8, 36, 88, 60, 64, 56, 70, 53, 27, 41, 54, 35, 94, 30, 20, 90, 47, 18, 75], [49, 44, 96, 84, 67, 89, 40, 83, 21, 42, 41, 3, 19, 59, 94, 65, 56, 16, 79, 61, 59, 63, 35, 32, 2, 8, 73, 65, 87, 56, 83, 16, 85, 83, 80, 11, 92, 74], [59, 63, 9, 66, 85, 47, 15, 81, 41, 75, 3, 5, 73, 2, 99, 89, 87, 67, 10, 2, 97, 20, 57, 75, 18, 77, 66, 36, 78, 43, 5, 76, 31, 3, 87, 62, 13, 38], [68, 88, 92, 3, 70, 43, 61, 91, 7, 17, 56, 91, 74, 15, 31, 8, 17, 25, 75, 5, 55, 46, 73, 48, 21, 53, 9, 23, 45, 30, 63, 67, 29, 53, 30, 68, 58, 41], [14, 51, 22, 93, 95, 99, 28, 63, 48, 48, 31, 5, 8, 96, 86, 98, 21, 34, 16, 31, 2, 27, 25, 34, 30, 68, 27, 86, 30, 24, 25, 14, 72, 6, 28, 5, 30, 97], [93, 73, 8, 62, 72, 47, 31, 64, 16, 42, 84, 12, 40, 49, 52, 62, 96, 3, 95, 10, 35, 62, 69, 77, 31, 90, 51, 13, 91, 58, 6, 77, 5, 86, 81, 19, 76, 12]]]; int [] param1 = [8, 6, 38, 7, 11, 14, 22, 0, 37, 30]; 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_INCREMENT_K_OPERATIONS_MAKE_ELEMENTS_EQUAL,"static int f_filled ( int arr [ ] , int n , int k ) { Arrays . sort ( arr ) ; int max = arr [ arr . length - 1 ] ; int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( ( max - arr [ i ] ) % k != 0 ) return - 1 ; else res += ( max - arr [ i ] ) / k ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [10, 0, 24, -1, 36, -1, -1, -1, -1, 1365]; int [] [] param0 = [[4, 7, 19, 16], [4, 4, 4, 4, 4], [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], [85, 36, 52, 8, 52, 15, 16], [-10, -5, -5, -20, 10, 30], [0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0], [1, 5, 5, 9, 11, 12, 12, 13, 13, 14, 16, 18, 26, 26, 28, 28, 30, 31, 32, 37, 37, 38, 40, 43, 44, 45, 47, 47, 55, 58, 60, 62, 63, 64, 69, 78, 83, 84, 92, 96, 96, 99], [76, -78, 92, -98, 16, 44, 86, 96, -8, 2, -96, 74, -28, 12, 54, -40, -64, -12, 4, 48, 68, -82, 8, 0, -4, 88, 48, -54, 90, 62, -84, 76, -48, 62, -80, -94, 38, -4, 36], [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, 1], [62, 99, 29, 23, 55, 30, 79, 63, 1, 88, 59, 8, 11, 80, 23, 51, 97, 32, 80, 48, 84, 36, 73, 59, 1, 34, 92, 10]]; int [] param1 = [4, 5, 46, 7, 6, 17, 42, 39, 48, 28]; int [] param2 = [3, 3, 1, 6, 5, 15, 33, 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); } " MINIMUM_INSERTIONS_SORT_ARRAY,"static int f_filled ( int arr [ ] , int N ) { int [ ] lis = new int [ N ] ; for ( int i = 0 ; i < N ; i ++ ) lis [ i ] = 1 ; for ( int i = 1 ; i < N ; i ++ ) for ( int j = 0 ; j < i ; j ++ ) if ( arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1 ; int max = 0 ; for ( int i = 0 ; i < N ; i ++ ) if ( max < lis [ i ] ) max = lis [ i ] ; return ( N - max ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 3, 0, 7, 0, 4, 0, 30, 0, 10]; int [] [] param0 = [[4, 7, 20, 22, 23, 31, 33, 36, 47, 61, 63, 63, 71, 74, 82, 91, 95, 99], [-84, 12, -42, -78, 22, 72, 56, 70, 28, -72], [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], [29, 41, 4, 62, 77, 74, 30, 2, 14, 90, 93, 10, 78, 36, 66, 22, 48, 89, 36, 73, 70, 23, 90], [-80, -72, -68, -66, -58, -50, -48, -32, -28, -24, -22, -18, 0, 2, 6, 10, 12, 14, 14, 18, 24, 24, 24, 28, 28, 28, 34, 38, 42, 42, 46, 46, 46, 58, 80, 82, 82, 84, 84, 86, 88, 90, 92, 96], [1, 1, 0, 1, 0, 1, 0, 0, 1, 0], [26, 36, 58, 64, 69, 72, 79, 82, 82, 87, 89, 90, 95], [-52, -40, 98, 40, 42, -50, 60, -64, -92, 36, -88, 72, -72, 38, -80, -52, 68, 70, 16, 22, -30, -74, 56, -80, 62, -54, -32, -22, -86, -70, 88, -76, -46, 28, 40, -2, -84, 68, -98, -16, 90, 36, -38, -86, 20, -40, 82, 98, 54], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [36, 62, 58, 24, 99, 12, 46, 3, 4, 40, 54, 97, 48, 94, 98, 7, 17, 5, 3, 36, 3]]; int [] param1 = [15, 7, 16, 13, 36, 8, 8, 41, 10, 16]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " NUMBER_UNIQUE_RECTANGLES_FORMED_USING_N_UNIT_SQUARES,"static int f_filled ( int n ) { int ans = 0 ; for ( int length = 1 ; length <= Math . sqrt ( n ) ; ++ length ) for ( int height = length ; height * length <= n ; ++ height ) ans ++ ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [66, 104, 83, 28, 151, 76, 128, 144, 135, 127]; int [] param0 = [34, 49, 41, 17, 67, 38, 59, 64, 61, 58]; 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); } " N_TH_NUMBER_WHOSE_SUM_OF_DIGITS_IS_TEN_2,"static int f_filled ( int n ) { int nthElement = 19 + ( n - 1 ) * 9 ; int outliersCount = ( int ) Math . log10 ( nthElement ) - 1 ; nthElement += 9 * outliersCount ; return nthElement ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [631, 649, 640, 856, 910, 415, 838, 82, 766, 478]; int [] param0 = [68, 70, 69, 93, 99, 44, 91, 8, 83, 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); } " MINIMUM_PRODUCT_SUBSET_ARRAY,"static int f_filled ( int a [ ] , int n ) { if ( n == 1 ) return a [ 0 ] ; int negmax = Integer . MIN_VALUE ; int posmin = Integer . MAX_VALUE ; int count_neg = 0 , count_zero = 0 ; int product = 1 ; for ( int i = 0 ; i < n ; i ++ ) { if ( a [ i ] == 0 ) { count_zero ++ ; continue ; } if ( a [ i ] < 0 ) { count_neg ++ ; negmax = Math . max ( negmax , a [ i ] ) ; } if ( a [ i ] > 0 && a [ i ] < posmin ) posmin = a [ i ] ; product *= a [ i ] ; } if ( count_zero == n || ( count_neg == 0 && count_zero > 0 ) ) return 0 ; if ( count_neg == 0 ) return posmin ; if ( count_neg % 2 == 0 && count_neg != 0 ) { product = product / negmax ; } return product ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, -297032800813056, 0, 7, -128064, 0, 1, -975833006044977561600000, 0, 3]; int [] [] param0 = [[3, 6, 7, 8, 8, 9, 12, 12, 12, 13, 15, 15, 15, 16, 18, 18, 18, 19, 20, 21, 22, 22, 23, 28, 29, 30, 30, 33, 33, 35, 35, 36, 40, 43, 58, 63, 73, 78, 82, 83, 84, 87, 89, 89, 92, 94], [18, -6, -8, 98, 66, -86, 24, 6, 58, 74, 82], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [97, 79, 93, 41, 76, 34, 94, 57, 63, 98, 52, 62, 96, 7, 63, 44, 55, 43, 36, 66, 35, 14, 24, 40, 26, 16, 67, 19, 31, 86, 64, 93, 85, 86, 66, 24, 73, 86, 45, 99, 25, 98, 38, 57], [-58, -48, -46, -36, 0, 18], [1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0], [1, 3, 5, 15, 18, 19, 21, 23, 29, 29, 33, 33, 34, 37, 39, 43, 43, 68, 73, 74, 75, 84, 87, 88, 89, 90, 93], [74, 70, -36, 16, 10, 60, -82, 96, -30, 58, 56, -54, -14, 94, 10, -82, -80, -40, -72, -68, 8, 38, -50, -76, 34, 2, -66, -30, 26], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [74, 74, 8, 74, 85, 41, 31, 3, 84, 46, 73, 39, 64, 72, 28, 83, 98, 27, 64, 7, 95, 37, 10, 38, 77, 32, 69, 72, 62, 96, 5, 81, 34, 96, 80, 25, 38]]; int [] param1 = [23, 10, 25, 30, 3, 36, 18, 15, 20, 33]; 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); } " MULTIPLY_TWO_NUMBERS_WITHOUT_USING_MULTIPLY_DIVISION_BITWISE_OPERATORS_AND_NO_LOOPS,"static int f_filled ( int x , int y ) { if ( y == 0 ) return 0 ; if ( y > 0 ) return ( x + f_filled ( x , y - 1 ) ) ; if ( y < 0 ) return - f_filled ( x , - y ) ; return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1692, 828, 528, 6900, 1075, 1824, 1767, 136, 912, 5180]; int [] param0 = [18, 23, 24, 75, 25, 57, 31, 8, 12, 74]; int [] param1 = [94, 36, 22, 92, 43, 32, 57, 17, 76, 70]; 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_SUM_SUBSEQUENCE_LEAST_ONE_EVERY_FOUR_CONSECUTIVE_ELEMENTS_PICKED_1,"static int f_filled ( int ar [ ] , int n ) { if ( n <= 4 ) return Arrays . stream ( ar ) . min ( ) . getAsInt ( ) ; int [ ] sum = new int [ n ] ; sum [ 0 ] = ar [ 0 ] ; sum [ 1 ] = ar [ 1 ] ; sum [ 2 ] = ar [ 2 ] ; sum [ 3 ] = ar [ 3 ] ; for ( int i = 4 ; i < n ; i ++ ) sum [ i ] = ar [ i ] + Arrays . stream ( Arrays . copyOfRange ( sum , i - 4 , i ) ) . min ( ) . getAsInt ( ) ; return Arrays . stream ( Arrays . copyOfRange ( sum , n - 4 , n ) ) . min ( ) . getAsInt ( ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [188, -76, 6, 48, -366, 1, 61, -474, 0, 36]; int [] [] param0 = [[4, 4, 9, 26, 31, 31, 33, 35, 40, 45, 48, 52, 57, 60, 69, 75, 82, 89, 90, 92, 95, 97], [60, -68, 30, -62, -8, 48, -20, 30, 16, -60, -20], [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], [15, 70, 50, 28, 67, 11, 27, 42, 1, 61, 37, 8, 66, 54, 50, 91, 86, 57, 4], [-98, -92, -84, -80, -70, -58, -58, -48, -42, -14, -8, 24, 30, 32, 42, 62, 68, 70, 72, 88], [1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0], [4, 5, 5, 10, 12, 13, 16, 19, 19, 21, 22, 25, 26, 29, 30, 33, 34, 44, 46, 52, 55, 55, 56, 78, 86, 88, 88, 90, 92], [40, -50, -96, 78, 82, -16, 26, 8, 38, 38, 54, -24, 88, 96, -42, -84, -28, -32, -64, 74, 74, -10, -8, 66, 14, -78, 56, -22, -90, 66, -68], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [29, 38, 20, 25, 16, 97, 16, 90, 30, 99]]; int [] param1 = [19, 5, 43, 15, 16, 7, 16, 26, 7, 9]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_FOR_DEADLOCK_FREE_CONDITION_IN_OPERATING_SYSTEM,"static int f_filled ( int process , int need ) { int minResources = 0 ; minResources = process * ( need - 1 ) + 1 ; return minResources ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1369, 165, 51, 2699, 2605, 5761, 89, 61, 1509, 2443]; int [] param0 = [38, 82, 2, 38, 31, 80, 11, 2, 26, 37]; int [] param1 = [37, 3, 26, 72, 85, 73, 9, 31, 59, 67]; 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); } " QUICK_WAY_CHECK_CHARACTERS_STRING,"static boolean f_filled ( String s ) { int n = s . length ( ) ; for ( int i = 1 ; i < n ; i ++ ) if ( s . charAt ( i ) != s . charAt ( 0 ) ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, false, false, false, true, true, true, false]; string [] param0 = ["""", ""ggg"", ""11"", ""koyihns"", ""232"", ""10111000011101"", ""dddd"", ""11"", ""11111"", ""ewjvixqzu""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_TO_CHECK_IF_A_MATRIX_IS_SYMMETRIC,"static boolean f_filled ( int mat [ ] [ ] , int N ) { for ( int i = 0 ; i < N ; i ++ ) for ( int j = 0 ; j < N ; j ++ ) if ( mat [ i ] [ j ] != mat [ j ] [ i ] ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, false, false, false, false, false, false]; int [] [] [] param0 = [[[29]], [[1, 3, 5], [3, 2, 4], [5, 4, 1]], [[1, 2, 5], [3, 2, 4], [5, 4, 1]], [[32, 53, 61, 4, 94, 83, 17, 81, 12, 79, 93, 11, 91, 14, 15], [13, 34, 5, 70, 47, 93, 43, 97, 24, 44, 49, 93, 33, 2, 34], [94, 82, 63, 86, 67, 80, 10, 15, 76, 76, 39, 51, 15, 91, 20], [71, 90, 63, 91, 53, 14, 13, 78, 84, 44, 96, 39, 66, 80, 82], [60, 33, 64, 97, 47, 93, 89, 32, 10, 64, 77, 3, 60, 87, 26], [69, 81, 93, 32, 34, 95, 76, 38, 85, 22, 30, 53, 84, 86, 2], [71, 38, 57, 33, 49, 92, 28, 63, 54, 6, 62, 95, 36, 74, 19], [6, 34, 8, 6, 41, 89, 15, 22, 4, 73, 86, 56, 18, 24, 99], [67, 18, 89, 84, 39, 89, 61, 77, 78, 94, 44, 28, 30, 51, 33], [82, 64, 52, 28, 73, 14, 69, 99, 54, 49, 7, 44, 60, 1, 51], [99, 38, 66, 68, 74, 99, 59, 98, 62, 39, 63, 32, 21, 85, 23], [15, 1, 29, 94, 19, 33, 88, 70, 10, 46, 47, 55, 18, 71, 10], [92, 59, 34, 42, 98, 91, 42, 67, 7, 15, 35, 53, 1, 14, 90], [22, 84, 62, 36, 99, 16, 63, 6, 22, 7, 95, 17, 80, 50, 59], [42, 40, 14, 73, 80, 53, 8, 91, 78, 59, 66, 88, 72, 71, 63]], [[93, 91, 59, 11, 73, 34, 33, 29, 78, 95, 52, 61, 39, 63, 91, 82, 75, 35, 18, 71, 19, 42, 64], [92, 7, 2, 46, 32, 22, 94, 78, 67, 73, 52, 15, 70, 89, 48, 40, 60, 4, 21, 67, 60, 67, 39], [94, 67, 26, 74, 69, 58, 14, 10, 9, 3, 75, 67, 48, 38, 39, 41, 43, 78, 67, 6, 46, 78, 16], [25, 44, 27, 86, 54, 56, 75, 43, 59, 83, 83, 80, 94, 72, 94, 56, 8, 51, 29, 14, 12, 13, 12], [78, 10, 44, 59, 8, 24, 37, 43, 89, 8, 64, 77, 67, 73, 40, 74, 46, 83, 92, 18, 82, 72, 8], [59, 36, 96, 21, 3, 88, 16, 83, 55, 22, 22, 77, 12, 60, 92, 72, 9, 84, 79, 68, 24, 48, 45], [6, 64, 87, 15, 30, 84, 27, 27, 98, 97, 58, 10, 73, 72, 78, 1, 74, 4, 59, 82, 94, 41, 90], [43, 14, 29, 73, 37, 22, 88, 99, 36, 95, 58, 15, 61, 7, 99, 91, 42, 98, 25, 64, 44, 6, 4], [66, 14, 4, 35, 77, 93, 34, 26, 56, 90, 68, 78, 75, 3, 87, 8, 44, 90, 78, 5, 58, 86, 78], [12, 67, 94, 20, 3, 33, 77, 18, 75, 26, 7, 90, 3, 1, 17, 12, 73, 81, 82, 23, 91, 2, 27], [55, 15, 44, 69, 95, 49, 63, 35, 19, 53, 92, 2, 52, 20, 59, 3, 8, 40, 30, 12, 49, 17, 66], [23, 39, 27, 57, 19, 44, 66, 32, 33, 43, 23, 14, 80, 57, 98, 57, 58, 62, 40, 44, 47, 84, 46], [53, 29, 49, 53, 9, 73, 25, 47, 81, 50, 71, 16, 37, 18, 39, 78, 56, 82, 8, 57, 89, 20, 57], [1, 88, 13, 75, 52, 97, 30, 81, 57, 5, 22, 51, 79, 74, 1, 46, 79, 42, 42, 93, 64, 21, 79], [99, 69, 19, 14, 15, 51, 83, 91, 16, 83, 53, 55, 23, 36, 18, 45, 88, 71, 89, 45, 7, 69, 88], [84, 85, 20, 74, 87, 46, 33, 15, 34, 79, 5, 9, 91, 64, 60, 28, 9, 50, 36, 9, 31, 45, 55], [78, 15, 41, 66, 63, 96, 27, 64, 60, 56, 71, 14, 60, 93, 40, 20, 51, 5, 82, 72, 50, 71, 88], [60, 86, 20, 27, 20, 6, 8, 79, 22, 35, 42, 77, 92, 20, 93, 69, 3, 27, 69, 60, 20, 23, 96], [12, 55, 49, 96, 80, 27, 65, 51, 76, 77, 72, 44, 29, 39, 16, 5, 43, 57, 97, 20, 36, 96, 48], [50, 2, 12, 39, 53, 63, 12, 34, 34, 12, 17, 6, 30, 86, 37, 87, 80, 26, 48, 40, 31, 46, 66], [67, 88, 91, 37, 17, 94, 68, 59, 82, 40, 27, 95, 12, 31, 28, 26, 13, 82, 17, 41, 32, 22, 99], [80, 50, 3, 22, 59, 95, 16, 66, 40, 56, 86, 56, 78, 14, 62, 69, 27, 47, 80, 68, 87, 74, 95], [17, 27, 51, 59, 59, 79, 24, 54, 99, 13, 14, 70, 70, 52, 96, 85, 21, 30, 54, 86, 19, 59, 47]], [[1, 88, 52, 21, 60, 48, 74, 12, 87, 76, 80, 55, 3, 66, 6, 22, 67, 73, 21, 37, 33, 1, 65, 71, 37, 40, 63, 52, 76, 32, 27, 42, 52], [29, 46, 66, 46, 83, 25, 99, 65, 57, 28, 18, 63, 18, 24, 51, 29, 19, 31, 95, 86, 29, 20, 66, 68, 46, 19, 7, 42, 16, 52, 33, 39, 43], [84, 46, 4, 15, 43, 30, 39, 43, 14, 70, 86, 18, 46, 79, 21, 76, 91, 61, 75, 95, 65, 25, 89, 81, 71, 32, 48, 89, 82, 35, 90, 76, 78], [8, 22, 76, 32, 46, 13, 33, 1, 92, 67, 80, 50, 32, 10, 1, 71, 47, 7, 62, 52, 68, 4, 57, 89, 5, 71, 55, 67, 57, 99, 75, 76, 39], [80, 43, 71, 85, 10, 82, 29, 26, 30, 65, 38, 15, 89, 19, 28, 97, 15, 78, 61, 38, 99, 32, 78, 77, 41, 85, 76, 15, 88, 84, 63, 1, 43], [14, 2, 8, 11, 20, 44, 59, 17, 12, 84, 74, 21, 67, 4, 88, 54, 27, 95, 74, 68, 76, 79, 90, 34, 1, 59, 52, 45, 18, 73, 50, 34, 54], [54, 52, 30, 4, 53, 24, 50, 45, 61, 90, 7, 45, 85, 78, 34, 10, 11, 45, 49, 40, 51, 71, 99, 28, 62, 15, 38, 49, 1, 50, 14, 13, 22], [57, 85, 41, 37, 82, 73, 95, 5, 31, 65, 86, 57, 15, 90, 29, 54, 41, 91, 34, 85, 76, 35, 55, 98, 33, 42, 87, 8, 83, 99, 91, 30, 84], [92, 74, 42, 25, 14, 65, 30, 13, 89, 12, 24, 70, 73, 38, 87, 52, 70, 35, 28, 5, 42, 84, 80, 20, 22, 51, 87, 76, 47, 97, 39, 28, 68], [47, 72, 21, 48, 50, 49, 76, 62, 35, 80, 72, 5, 76, 90, 37, 73, 41, 92, 40, 58, 72, 2, 50, 86, 94, 80, 48, 24, 91, 33, 70, 94, 42], [26, 78, 95, 16, 21, 2, 59, 8, 7, 90, 21, 18, 82, 1, 91, 8, 92, 2, 22, 20, 78, 35, 60, 31, 41, 67, 72, 90, 24, 15, 38, 79, 99], [38, 81, 95, 66, 5, 2, 2, 90, 38, 37, 10, 91, 72, 74, 99, 24, 24, 95, 4, 40, 14, 26, 12, 27, 6, 27, 14, 22, 49, 20, 3, 73, 80], [73, 49, 96, 98, 25, 27, 91, 2, 22, 66, 48, 53, 1, 54, 39, 10, 12, 37, 46, 17, 3, 85, 76, 59, 27, 15, 45, 41, 67, 5, 34, 63, 98], [85, 13, 89, 14, 82, 61, 3, 3, 45, 96, 18, 32, 96, 44, 93, 37, 99, 27, 40, 24, 56, 36, 99, 6, 71, 78, 17, 61, 27, 44, 70, 3, 39], [35, 66, 83, 87, 17, 9, 9, 35, 9, 12, 67, 85, 57, 92, 97, 98, 43, 22, 60, 30, 31, 80, 99, 65, 73, 65, 87, 37, 82, 4, 10, 27, 2], [55, 68, 40, 97, 8, 15, 61, 7, 94, 24, 20, 55, 5, 7, 2, 74, 77, 21, 3, 53, 14, 53, 80, 63, 54, 72, 24, 78, 50, 6, 88, 93, 26], [34, 44, 69, 98, 98, 77, 67, 5, 86, 85, 91, 88, 39, 53, 8, 68, 36, 70, 95, 69, 6, 2, 1, 62, 29, 87, 18, 3, 80, 31, 22, 8, 22], [77, 29, 80, 10, 46, 34, 56, 59, 33, 78, 96, 23, 15, 25, 26, 12, 64, 19, 49, 19, 96, 74, 91, 23, 56, 63, 52, 64, 18, 99, 50, 13, 66], [36, 22, 84, 7, 12, 79, 93, 8, 23, 13, 97, 5, 83, 7, 68, 9, 19, 89, 65, 68, 82, 71, 83, 52, 87, 28, 93, 6, 44, 27, 46, 4, 87], [30, 45, 58, 62, 54, 24, 96, 75, 30, 90, 80, 57, 53, 70, 89, 84, 10, 1, 44, 59, 11, 76, 20, 76, 60, 44, 16, 79, 62, 90, 56, 75, 3], [2, 44, 83, 96, 87, 44, 24, 13, 1, 39, 5, 13, 8, 51, 49, 49, 48, 40, 30, 44, 92, 93, 53, 36, 84, 69, 71, 30, 38, 7, 75, 75, 84], [33, 79, 68, 51, 10, 38, 40, 3, 24, 2, 23, 51, 59, 42, 19, 8, 26, 82, 44, 48, 73, 36, 9, 97, 11, 41, 62, 88, 24, 32, 33, 81, 90], [45, 33, 2, 66, 78, 21, 87, 22, 65, 32, 29, 69, 36, 25, 22, 69, 52, 67, 24, 97, 92, 47, 85, 80, 11, 6, 51, 83, 61, 82, 44, 10, 76], [33, 64, 15, 76, 50, 5, 1, 38, 98, 12, 30, 11, 73, 44, 46, 71, 81, 52, 63, 26, 27, 97, 39, 5, 73, 87, 94, 36, 1, 52, 8, 1, 74], [7, 38, 59, 60, 67, 7, 8, 34, 40, 42, 96, 32, 69, 91, 13, 55, 12, 74, 1, 85, 7, 10, 81, 37, 48, 65, 42, 13, 23, 57, 92, 19, 32], [10, 82, 8, 16, 35, 58, 81, 48, 48, 23, 26, 55, 23, 50, 23, 54, 56, 45, 71, 12, 22, 17, 77, 48, 78, 71, 50, 83, 59, 39, 71, 60, 91], [17, 34, 75, 9, 39, 67, 23, 40, 4, 57, 16, 59, 85, 25, 5, 1, 96, 20, 11, 97, 32, 83, 39, 45, 57, 82, 36, 42, 88, 96, 9, 24, 79], [47, 46, 86, 98, 59, 10, 2, 42, 7, 1, 9, 42, 26, 79, 57, 22, 87, 3, 11, 56, 86, 62, 40, 78, 16, 98, 5, 53, 72, 66, 11, 45, 62], [87, 65, 74, 6, 67, 83, 29, 79, 87, 49, 8, 89, 88, 52, 12, 1, 4, 94, 98, 60, 43, 97, 44, 30, 40, 13, 30, 19, 20, 38, 63, 68, 23], [89, 11, 31, 76, 41, 98, 57, 30, 80, 96, 82, 8, 95, 36, 77, 82, 62, 35, 27, 6, 64, 74, 37, 47, 44, 71, 80, 66, 43, 57, 47, 89, 90], [90, 18, 20, 92, 67, 57, 1, 74, 95, 84, 56, 8, 48, 58, 64, 71, 57, 51, 99, 40, 84, 3, 63, 11, 58, 76, 46, 12, 8, 45, 86, 84, 15], [49, 31, 46, 94, 40, 31, 20, 2, 6, 78, 26, 97, 87, 89, 37, 92, 99, 71, 59, 66, 64, 17, 91, 48, 66, 12, 80, 32, 18, 62, 16, 5, 24], [49, 75, 64, 46, 42, 88, 78, 1, 90, 26, 68, 90, 4, 96, 16, 80, 40, 84, 81, 49, 84, 96, 42, 11, 62, 93, 55, 27, 85, 29, 32, 41, 12]], [[97, 17, 59, 40, 18, 53, 65, 84, 85, 42, 38, 32, 22, 61, 89, 32, 31, 99, 58, 77, 80, 56, 83, 41, 15, 46, 97, 59, 65, 51, 13, 24, 87, 93, 16, 49, 32, 16, 43, 88, 53, 21, 33, 59, 60], [27, 29, 33, 50, 32, 46, 28, 51, 26, 48, 58, 47, 63, 47, 70, 19, 79, 81, 98, 65, 19, 67, 81, 46, 78, 75, 80, 54, 94, 91, 82, 87, 49, 27, 56, 44, 75, 77, 44, 23, 90, 42, 64, 34, 99], [43, 84, 88, 96, 26, 2, 13, 3, 12, 27, 14, 74, 38, 76, 40, 75, 50, 66, 95, 62, 10, 6, 55, 42, 61, 22, 47, 19, 74, 47, 91, 92, 10, 45, 60, 17, 79, 43, 12, 84, 64, 80, 47, 84, 50], [27, 22, 91, 13, 59, 69, 81, 98, 22, 94, 67, 71, 15, 71, 3, 29, 6, 49, 91, 65, 54, 34, 58, 8, 89, 15, 38, 11, 73, 27, 77, 76, 11, 58, 35, 44, 57, 87, 21, 28, 7, 77, 95, 35, 81], [88, 86, 74, 80, 6, 12, 1, 16, 98, 63, 58, 91, 5, 83, 11, 37, 63, 75, 8, 53, 16, 95, 11, 65, 47, 81, 49, 25, 55, 26, 34, 2, 16, 31, 22, 86, 32, 70, 2, 71, 11, 10, 16, 51, 1], [35, 39, 74, 59, 99, 77, 78, 76, 44, 3, 38, 75, 98, 25, 87, 72, 64, 27, 50, 4, 62, 88, 60, 63, 13, 31, 64, 14, 84, 86, 76, 67, 96, 5, 96, 76, 92, 91, 87, 68, 69, 45, 9, 9, 93], [57, 81, 83, 66, 96, 54, 15, 2, 78, 96, 49, 90, 12, 90, 36, 76, 97, 90, 87, 13, 37, 40, 92, 34, 54, 83, 89, 99, 85, 70, 16, 24, 51, 16, 94, 28, 74, 17, 84, 48, 24, 80, 20, 55, 26], [29, 22, 20, 96, 29, 87, 57, 98, 76, 83, 17, 86, 10, 82, 69, 1, 90, 89, 77, 39, 46, 12, 20, 6, 18, 2, 73, 33, 54, 1, 75, 22, 68, 21, 29, 20, 69, 51, 27, 97, 18, 22, 41, 37, 18], [21, 6, 28, 2, 79, 11, 11, 26, 91, 43, 87, 56, 8, 63, 46, 59, 84, 98, 26, 65, 63, 88, 53, 41, 93, 11, 8, 30, 79, 82, 25, 64, 60, 11, 48, 51, 73, 32, 12, 42, 23, 88, 83, 74, 82], [15, 94, 47, 98, 42, 39, 13, 42, 23, 45, 22, 60, 27, 52, 69, 11, 40, 6, 67, 32, 74, 40, 20, 18, 98, 82, 2, 13, 56, 46, 62, 77, 47, 59, 90, 64, 12, 12, 12, 23, 18, 24, 47, 91, 70], [40, 45, 67, 62, 58, 95, 96, 92, 54, 9, 34, 60, 27, 27, 60, 25, 83, 78, 40, 83, 76, 95, 36, 25, 58, 61, 52, 6, 14, 7, 93, 90, 34, 36, 51, 75, 76, 81, 87, 31, 82, 53, 61, 26, 87], [50, 8, 23, 75, 95, 19, 22, 41, 81, 49, 57, 91, 31, 17, 17, 98, 99, 11, 84, 60, 4, 58, 3, 72, 36, 43, 83, 20, 5, 90, 86, 55, 26, 50, 74, 88, 52, 96, 61, 89, 15, 53, 34, 16, 47], [64, 74, 70, 61, 41, 85, 45, 2, 49, 19, 38, 87, 17, 6, 54, 48, 44, 59, 34, 15, 91, 22, 35, 83, 2, 44, 20, 45, 62, 61, 97, 81, 56, 56, 2, 12, 82, 23, 19, 54, 69, 21, 60, 20, 80], [6, 59, 90, 96, 99, 23, 54, 18, 42, 85, 48, 13, 28, 14, 94, 37, 99, 47, 53, 41, 40, 22, 35, 77, 9, 80, 77, 18, 53, 73, 8, 19, 80, 75, 43, 92, 32, 19, 7, 24, 23, 7, 40, 79, 23], [79, 72, 73, 91, 22, 22, 20, 21, 14, 85, 22, 33, 78, 13, 86, 90, 85, 15, 75, 12, 6, 32, 24, 17, 98, 88, 25, 60, 63, 86, 23, 86, 84, 45, 76, 81, 53, 27, 65, 45, 56, 1, 37, 78, 43], [90, 67, 47, 22, 16, 72, 11, 25, 17, 50, 89, 84, 15, 7, 22, 32, 89, 15, 10, 5, 81, 6, 3, 31, 43, 72, 33, 23, 43, 12, 10, 33, 13, 48, 6, 24, 27, 92, 63, 99, 24, 55, 10, 20, 22], [45, 52, 19, 18, 80, 74, 48, 70, 47, 13, 8, 88, 84, 89, 5, 68, 90, 35, 15, 35, 75, 33, 40, 68, 60, 21, 67, 96, 35, 1, 18, 6, 19, 31, 48, 60, 56, 49, 8, 70, 87, 68, 12, 15, 51], [68, 10, 30, 46, 76, 42, 39, 8, 59, 61, 70, 81, 87, 50, 7, 97, 53, 7, 96, 93, 30, 77, 54, 38, 82, 30, 85, 30, 18, 62, 98, 29, 49, 45, 51, 20, 31, 47, 83, 13, 77, 45, 70, 57, 87], [28, 1, 55, 6, 63, 56, 56, 97, 48, 21, 77, 81, 95, 80, 48, 64, 45, 45, 17, 72, 42, 89, 64, 95, 92, 52, 40, 64, 8, 51, 66, 73, 50, 20, 68, 99, 60, 54, 64, 43, 32, 9, 30, 49, 1], [49, 96, 37, 62, 18, 86, 55, 83, 16, 85, 49, 64, 57, 39, 68, 15, 12, 80, 64, 93, 89, 77, 20, 34, 19, 75, 93, 92, 19, 82, 49, 29, 20, 28, 8, 40, 46, 56, 99, 69, 41, 89, 84, 71, 28], [25, 56, 58, 92, 77, 94, 72, 67, 80, 80, 87, 10, 6, 83, 38, 90, 18, 91, 20, 6, 81, 30, 16, 25, 51, 16, 70, 37, 64, 71, 60, 96, 55, 52, 56, 17, 27, 3, 92, 98, 29, 4, 27, 84, 76], [99, 74, 14, 56, 22, 24, 90, 11, 84, 72, 29, 73, 38, 70, 92, 90, 9, 45, 26, 89, 52, 6, 21, 60, 59, 21, 91, 11, 20, 17, 98, 51, 64, 55, 86, 16, 85, 77, 98, 54, 54, 56, 7, 96, 13], [96, 83, 88, 44, 40, 69, 28, 81, 40, 94, 62, 59, 50, 11, 15, 60, 10, 20, 30, 35, 99, 96, 59, 51, 58, 12, 46, 7, 64, 18, 28, 11, 98, 35, 76, 76, 15, 54, 40, 19, 40, 53, 10, 72, 22], [21, 20, 69, 1, 27, 36, 33, 90, 63, 14, 86, 32, 11, 93, 93, 74, 65, 49, 84, 94, 34, 61, 56, 95, 39, 50, 30, 14, 35, 25, 53, 56, 29, 40, 65, 53, 99, 64, 21, 81, 14, 10, 74, 1, 12], [79, 15, 42, 97, 70, 30, 28, 31, 17, 97, 85, 50, 51, 87, 67, 49, 92, 28, 81, 14, 80, 89, 3, 69, 70, 95, 68, 67, 60, 68, 99, 44, 74, 55, 69, 78, 34, 2, 79, 34, 4, 12, 13, 73, 4], [31, 44, 56, 6, 71, 62, 82, 94, 22, 78, 12, 48, 46, 72, 25, 42, 75, 55, 25, 80, 81, 54, 92, 68, 98, 26, 6, 52, 85, 64, 58, 57, 72, 68, 75, 34, 2, 83, 39, 67, 73, 95, 76, 12, 73], [39, 32, 69, 72, 32, 22, 88, 51, 91, 41, 50, 17, 45, 59, 44, 32, 48, 30, 28, 83, 18, 20, 74, 11, 60, 34, 39, 38, 17, 49, 87, 71, 6, 56, 24, 60, 72, 4, 81, 66, 22, 51, 51, 16, 85], [40, 8, 71, 64, 71, 4, 25, 59, 70, 82, 79, 85, 16, 55, 24, 11, 71, 42, 3, 41, 22, 26, 4, 16, 63, 17, 19, 79, 7, 66, 55, 45, 87, 72, 1, 17, 39, 8, 57, 85, 50, 55, 26, 95, 53], [33, 30, 94, 36, 21, 41, 37, 21, 29, 8, 52, 39, 69, 14, 85, 38, 15, 30, 71, 27, 72, 35, 41, 53, 61, 95, 45, 30, 91, 1, 33, 78, 7, 62, 22, 51, 69, 85, 55, 31, 54, 27, 44, 79, 87], [60, 53, 17, 94, 36, 66, 2, 97, 20, 10, 69, 58, 81, 47, 63, 39, 62, 82, 60, 73, 74, 32, 63, 39, 18, 24, 2, 16, 79, 51, 84, 54, 56, 62, 71, 82, 89, 77, 60, 75, 72, 91, 20, 64, 98], [68, 79, 77, 49, 86, 26, 52, 61, 9, 5, 30, 4, 31, 14, 25, 28, 15, 67, 95, 77, 9, 66, 23, 48, 33, 28, 63, 8, 36, 2, 24, 22, 79, 24, 69, 91, 97, 53, 85, 81, 58, 35, 55, 26, 46], [25, 85, 11, 24, 78, 24, 73, 2, 6, 25, 81, 3, 5, 32, 48, 55, 93, 36, 36, 25, 56, 28, 35, 13, 79, 60, 27, 75, 6, 56, 27, 42, 94, 97, 38, 55, 19, 86, 13, 68, 6, 29, 94, 89, 61], [15, 12, 21, 82, 25, 38, 69, 76, 49, 29, 62, 42, 22, 95, 48, 28, 23, 53, 16, 60, 40, 97, 39, 68, 6, 47, 11, 10, 31, 71, 14, 59, 6, 58, 18, 33, 30, 84, 92, 1, 57, 81, 59, 26, 53], [18, 24, 18, 39, 79, 36, 90, 32, 84, 70, 91, 72, 39, 86, 37, 38, 71, 73, 34, 98, 28, 63, 73, 30, 41, 95, 8, 8, 78, 9, 98, 25, 9, 64, 3, 96, 27, 74, 66, 82, 59, 40, 24, 23, 41], [53, 49, 66, 61, 64, 34, 27, 64, 60, 35, 53, 72, 71, 58, 13, 76, 77, 53, 17, 57, 60, 15, 78, 19, 35, 18, 17, 84, 25, 37, 23, 23, 75, 46, 84, 7, 87, 62, 23, 91, 85, 21, 58, 96, 50], [28, 66, 93, 9, 35, 61, 68, 86, 23, 6, 84, 69, 12, 59, 65, 39, 41, 3, 42, 43, 85, 66, 96, 29, 47, 92, 97, 26, 15, 45, 90, 73, 61, 85, 20, 49, 27, 65, 9, 58, 51, 38, 84, 19, 44], [11, 78, 89, 76, 45, 7, 3, 80, 62, 1, 15, 44, 11, 1, 3, 22, 43, 6, 22, 50, 28, 78, 96, 29, 5, 35, 11, 1, 7, 3, 86, 31, 3, 17, 18, 79, 99, 80, 94, 99, 17, 79, 42, 27, 65], [30, 30, 69, 65, 4, 11, 58, 13, 10, 88, 84, 18, 87, 42, 99, 44, 62, 91, 79, 24, 30, 65, 41, 67, 24, 32, 63, 4, 98, 1, 21, 8, 46, 12, 1, 22, 78, 89, 28, 72, 64, 40, 89, 55, 87], [60, 41, 80, 59, 68, 36, 33, 94, 45, 75, 50, 47, 77, 44, 68, 88, 33, 97, 76, 21, 97, 46, 97, 73, 31, 62, 94, 16, 12, 54, 9, 35, 53, 43, 70, 89, 56, 64, 28, 87, 29, 86, 58, 24, 20], [27, 97, 19, 90, 38, 60, 3, 23, 59, 91, 91, 74, 24, 56, 52, 41, 66, 98, 22, 66, 28, 88, 38, 86, 67, 58, 37, 2, 57, 87, 77, 79, 97, 45, 53, 77, 84, 7, 77, 39, 68, 63, 46, 91, 96], [2, 15, 5, 3, 16, 49, 90, 6, 35, 38, 84, 86, 64, 85, 32, 1, 48, 23, 18, 17, 31, 93, 54, 77, 60, 66, 73, 96, 86, 18, 18, 83, 63, 31, 29, 88, 97, 83, 80, 51, 32, 21, 30, 7, 38], [12, 59, 92, 14, 71, 17, 23, 77, 20, 5, 6, 13, 3, 53, 31, 3, 8, 71, 50, 71, 75, 88, 59, 21, 20, 93, 74, 49, 80, 74, 38, 33, 69, 59, 12, 8, 70, 87, 48, 67, 38, 93, 34, 4, 7], [85, 74, 96, 89, 77, 85, 83, 59, 8, 61, 50, 84, 8, 16, 48, 62, 56, 28, 74, 21, 44, 79, 70, 41, 35, 56, 85, 17, 26, 63, 74, 34, 71, 32, 4, 10, 79, 56, 35, 33, 25, 47, 11, 34, 36], [17, 12, 80, 97, 26, 74, 13, 82, 85, 87, 87, 36, 69, 45, 79, 88, 12, 83, 97, 89, 38, 77, 88, 67, 76, 66, 20, 40, 34, 22, 15, 97, 66, 35, 98, 91, 31, 77, 53, 94, 90, 88, 57, 65, 38], [38, 86, 10, 46, 27, 42, 2, 58, 19, 62, 11, 14, 57, 33, 44, 18, 29, 30, 3, 32, 15, 49, 87, 60, 98, 46, 80, 50, 6, 80, 20, 49, 28, 26, 56, 48, 6, 53, 59, 80, 33, 12, 78, 39, 2]], [[19, 98, 9, 31, 79, 4, 63, 46, 32, 81, 5, 39, 97, 92, 13, 68, 28, 13, 92, 57, 99, 24, 9, 7, 22, 3, 72, 4, 42, 2, 53, 46, 6, 57, 86, 3, 17, 74, 88, 60, 39, 28, 45, 94], [92, 4, 82, 39, 3, 65, 97, 16, 46, 94, 40, 55, 97, 36, 60, 95, 36, 36, 47, 48, 10, 22, 28, 36, 32, 13, 34, 63, 65, 80, 91, 22, 31, 48, 93, 22, 71, 55, 40, 4, 78, 43, 81, 65], [2, 82, 3, 56, 85, 77, 49, 27, 60, 67, 69, 37, 48, 66, 94, 70, 27, 77, 5, 52, 58, 25, 91, 62, 16, 48, 71, 52, 67, 15, 81, 67, 61, 66, 69, 24, 95, 44, 71, 25, 20, 89, 66, 66], [10, 50, 70, 11, 93, 30, 85, 27, 42, 36, 45, 97, 27, 56, 37, 70, 39, 8, 76, 47, 67, 54, 9, 43, 12, 40, 3, 97, 77, 12, 37, 7, 70, 41, 4, 87, 4, 67, 38, 27, 11, 93, 93, 37], [58, 8, 32, 78, 84, 88, 93, 60, 65, 10, 19, 39, 45, 48, 18, 71, 88, 86, 16, 6, 71, 82, 99, 49, 88, 80, 19, 83, 65, 22, 31, 14, 30, 95, 51, 32, 43, 17, 92, 98, 62, 17, 61, 6], [93, 9, 31, 30, 59, 73, 10, 64, 33, 3, 93, 53, 41, 78, 15, 10, 80, 97, 92, 39, 24, 79, 13, 83, 11, 13, 40, 59, 96, 54, 61, 90, 59, 80, 17, 13, 13, 15, 11, 1, 35, 82, 44, 58], [1, 86, 52, 66, 94, 53, 82, 65, 3, 74, 48, 15, 67, 77, 62, 88, 30, 43, 32, 99, 35, 55, 15, 34, 98, 82, 99, 23, 32, 50, 50, 83, 93, 40, 44, 12, 68, 22, 43, 79, 85, 42, 99, 19], [72, 79, 4, 25, 51, 60, 37, 26, 73, 44, 55, 50, 31, 70, 25, 60, 6, 19, 5, 69, 59, 54, 5, 49, 20, 54, 77, 73, 78, 13, 97, 48, 87, 94, 63, 82, 82, 43, 78, 12, 39, 91, 57, 93], [71, 79, 83, 9, 84, 62, 22, 36, 96, 3, 82, 16, 3, 76, 88, 58, 75, 23, 33, 68, 61, 14, 38, 73, 98, 53, 61, 33, 83, 67, 56, 61, 38, 27, 40, 6, 96, 48, 18, 32, 84, 36, 79, 23], [14, 85, 46, 3, 7, 17, 68, 58, 50, 99, 70, 96, 99, 46, 59, 22, 72, 91, 28, 2, 59, 54, 66, 63, 27, 7, 12, 8, 9, 86, 18, 92, 38, 34, 70, 95, 15, 61, 68, 5, 87, 77, 61, 27], [45, 58, 95, 19, 30, 63, 94, 5, 62, 75, 74, 41, 65, 79, 85, 86, 96, 26, 77, 69, 78, 54, 55, 68, 8, 9, 95, 3, 27, 9, 93, 98, 29, 74, 77, 65, 40, 78, 96, 80, 56, 26, 33, 95], [72, 25, 97, 94, 1, 1, 27, 68, 37, 24, 44, 88, 6, 39, 65, 93, 88, 77, 92, 15, 64, 31, 86, 76, 17, 26, 77, 53, 41, 45, 81, 26, 51, 92, 38, 50, 42, 42, 32, 85, 9, 80, 5, 38], [9, 70, 79, 82, 69, 41, 74, 80, 27, 40, 53, 23, 92, 75, 4, 68, 80, 28, 29, 58, 17, 70, 18, 13, 64, 60, 61, 35, 89, 55, 35, 42, 11, 76, 54, 38, 32, 78, 25, 97, 98, 59, 70, 57], [41, 4, 7, 99, 19, 31, 20, 21, 25, 12, 98, 17, 96, 1, 79, 65, 63, 25, 71, 34, 44, 70, 1, 79, 77, 21, 77, 40, 17, 17, 76, 34, 39, 75, 14, 79, 87, 4, 33, 25, 41, 86, 32, 1], [63, 88, 53, 7, 43, 37, 70, 15, 34, 63, 65, 72, 35, 76, 46, 24, 1, 77, 79, 34, 37, 13, 16, 36, 70, 98, 76, 54, 44, 38, 47, 49, 36, 64, 63, 24, 68, 89, 11, 46, 3, 7, 54, 11], [65, 41, 55, 59, 26, 54, 14, 47, 16, 12, 93, 59, 32, 10, 93, 83, 55, 73, 89, 19, 39, 9, 17, 91, 8, 87, 55, 77, 41, 8, 13, 77, 55, 81, 20, 69, 25, 16, 43, 82, 59, 73, 35, 10], [99, 19, 13, 89, 69, 81, 34, 43, 87, 67, 10, 32, 97, 71, 13, 38, 11, 15, 87, 83, 8, 49, 88, 66, 30, 44, 54, 97, 83, 31, 24, 86, 39, 93, 34, 61, 4, 50, 53, 81, 28, 38, 4, 16], [42, 43, 64, 31, 79, 9, 68, 83, 34, 88, 11, 35, 28, 92, 11, 38, 98, 15, 61, 8, 65, 24, 50, 10, 17, 78, 1, 11, 41, 3, 17, 64, 75, 88, 33, 32, 25, 91, 47, 43, 81, 81, 57, 40], [68, 82, 75, 41, 40, 76, 37, 74, 15, 58, 58, 11, 98, 99, 8, 31, 15, 93, 79, 64, 31, 7, 94, 89, 79, 77, 74, 19, 49, 15, 3, 18, 22, 96, 95, 74, 45, 21, 34, 93, 74, 28, 54, 10], [32, 78, 32, 52, 30, 56, 72, 19, 22, 88, 28, 41, 43, 69, 73, 72, 59, 56, 82, 40, 77, 70, 16, 18, 42, 81, 2, 82, 64, 11, 55, 2, 2, 57, 18, 86, 16, 27, 17, 54, 17, 6, 97, 13], [6, 90, 83, 19, 61, 90, 86, 11, 86, 96, 7, 86, 6, 15, 38, 41, 56, 18, 35, 98, 45, 29, 69, 88, 32, 94, 5, 44, 98, 50, 82, 21, 22, 61, 39, 85, 99, 5, 33, 71, 24, 39, 72, 15], [70, 5, 87, 48, 20, 76, 21, 86, 89, 12, 66, 30, 7, 58, 18, 60, 18, 92, 48, 34, 72, 83, 6, 45, 60, 71, 84, 24, 93, 92, 69, 17, 62, 33, 62, 6, 3, 74, 54, 11, 87, 46, 4, 7], [26, 97, 35, 28, 41, 50, 99, 39, 80, 10, 71, 7, 25, 69, 90, 30, 11, 71, 39, 26, 57, 55, 22, 12, 64, 86, 66, 60, 62, 52, 62, 76, 65, 15, 40, 7, 55, 37, 86, 97, 33, 29, 19, 69], [14, 9, 5, 35, 85, 28, 45, 2, 6, 31, 32, 75, 59, 14, 74, 59, 1, 55, 31, 59, 8, 66, 99, 95, 12, 31, 99, 96, 81, 57, 8, 19, 53, 11, 57, 69, 59, 28, 2, 11, 64, 18, 47, 53], [5, 19, 5, 40, 83, 76, 92, 48, 99, 23, 55, 34, 87, 97, 58, 77, 98, 93, 30, 61, 82, 56, 99, 5, 4, 69, 39, 79, 73, 50, 72, 74, 22, 88, 24, 73, 22, 34, 48, 76, 81, 4, 57, 63], [30, 65, 97, 91, 78, 4, 35, 33, 51, 12, 68, 98, 78, 2, 91, 95, 33, 91, 45, 56, 28, 98, 30, 34, 1, 52, 13, 82, 40, 65, 9, 70, 72, 72, 88, 49, 25, 26, 26, 40, 34, 8, 2, 82], [16, 92, 72, 63, 18, 39, 42, 83, 32, 62, 32, 85, 93, 69, 84, 22, 27, 1, 13, 97, 6, 13, 78, 72, 67, 37, 76, 8, 93, 20, 62, 23, 68, 25, 32, 58, 25, 69, 10, 64, 31, 4, 57, 71], [34, 21, 83, 7, 98, 58, 33, 42, 53, 85, 55, 50, 38, 81, 46, 81, 15, 8, 49, 53, 37, 83, 93, 38, 97, 28, 61, 97, 7, 99, 72, 7, 59, 21, 25, 67, 32, 48, 55, 75, 85, 96, 66, 23], [45, 10, 78, 55, 60, 9, 83, 3, 32, 54, 87, 83, 76, 23, 14, 36, 48, 67, 10, 86, 68, 79, 52, 99, 49, 44, 5, 92, 91, 15, 94, 8, 55, 20, 77, 6, 1, 46, 42, 82, 70, 49, 90, 34], [57, 17, 89, 63, 61, 59, 92, 79, 4, 91, 33, 20, 21, 41, 74, 44, 32, 64, 37, 61, 26, 22, 40, 59, 50, 77, 96, 73, 39, 16, 98, 74, 88, 10, 45, 90, 34, 63, 68, 93, 86, 89, 11, 84], [88, 95, 25, 69, 31, 57, 87, 53, 81, 66, 56, 66, 91, 22, 81, 53, 57, 33, 5, 13, 17, 43, 84, 84, 92, 12, 84, 71, 56, 69, 29, 25, 11, 41, 11, 96, 38, 82, 62, 79, 81, 24, 44, 19], [37, 5, 4, 1, 94, 17, 43, 50, 30, 64, 82, 36, 1, 69, 82, 29, 81, 85, 66, 36, 62, 20, 83, 54, 82, 13, 47, 75, 97, 28, 55, 43, 44, 21, 94, 53, 47, 96, 87, 25, 96, 41, 31, 13], [6, 1, 8, 56, 62, 87, 69, 93, 22, 64, 69, 17, 18, 45, 54, 39, 65, 95, 88, 54, 16, 69, 32, 26, 35, 53, 43, 41, 24, 44, 79, 23, 75, 94, 45, 94, 55, 70, 69, 64, 14, 30, 4, 6], [39, 18, 51, 56, 89, 57, 59, 61, 17, 97, 38, 76, 81, 89, 37, 17, 91, 31, 14, 53, 36, 86, 5, 40, 70, 69, 88, 22, 14, 25, 84, 65, 49, 35, 52, 92, 29, 58, 72, 82, 31, 21, 6, 9], [30, 18, 30, 84, 60, 55, 10, 13, 41, 2, 5, 33, 65, 37, 61, 58, 12, 41, 28, 82, 36, 94, 42, 54, 54, 38, 85, 71, 69, 58, 99, 79, 9, 48, 18, 12, 27, 78, 77, 94, 36, 49, 9, 34], [76, 50, 89, 50, 22, 5, 15, 18, 77, 15, 89, 98, 66, 21, 87, 81, 61, 4, 48, 1, 7, 61, 53, 95, 35, 21, 60, 76, 5, 3, 59, 76, 10, 46, 50, 62, 59, 94, 17, 56, 44, 19, 18, 26], [28, 49, 32, 20, 85, 46, 58, 16, 76, 1, 46, 32, 14, 14, 83, 65, 25, 42, 13, 53, 68, 60, 84, 68, 41, 6, 26, 91, 22, 29, 40, 66, 36, 87, 19, 16, 88, 34, 63, 25, 75, 69, 84, 14], [21, 90, 44, 52, 79, 85, 80, 75, 48, 78, 85, 62, 80, 2, 42, 66, 28, 5, 8, 73, 81, 83, 42, 26, 95, 98, 93, 74, 58, 11, 97, 95, 22, 54, 93, 41, 85, 40, 12, 16, 43, 26, 94, 87], [97, 88, 6, 98, 19, 23, 25, 93, 16, 2, 93, 58, 97, 18, 44, 54, 9, 2, 55, 5, 20, 4, 5, 17, 5, 50, 72, 96, 25, 25, 89, 42, 31, 92, 47, 79, 51, 55, 60, 27, 39, 78, 13, 96], [35, 48, 14, 36, 53, 39, 5, 72, 10, 2, 95, 39, 25, 34, 79, 56, 81, 22, 33, 70, 58, 82, 30, 63, 67, 95, 12, 10, 62, 63, 36, 56, 6, 31, 33, 74, 63, 38, 26, 16, 24, 24, 73, 25], [23, 54, 67, 32, 74, 47, 35, 86, 14, 25, 59, 54, 79, 94, 95, 78, 8, 8, 95, 3, 97, 12, 32, 96, 21, 74, 41, 42, 57, 90, 77, 62, 73, 97, 95, 56, 12, 56, 58, 23, 89, 93, 33, 18], [41, 12, 62, 58, 4, 13, 31, 22, 39, 58, 30, 34, 95, 6, 90, 49, 45, 77, 93, 50, 26, 39, 86, 52, 4, 35, 5, 28, 21, 73, 10, 55, 33, 40, 5, 73, 81, 33, 81, 70, 91, 91, 78, 5], [81, 4, 71, 37, 78, 13, 29, 98, 98, 39, 48, 89, 35, 62, 20, 95, 59, 44, 54, 89, 58, 93, 52, 50, 46, 98, 10, 19, 11, 40, 40, 36, 87, 55, 44, 89, 44, 45, 85, 63, 91, 2, 6, 99], [73, 20, 55, 97, 47, 93, 27, 1, 13, 67, 65, 84, 58, 90, 76, 70, 50, 9, 55, 36, 20, 10, 10, 31, 84, 89, 45, 31, 9, 88, 4, 45, 24, 78, 72, 91, 53, 94, 78, 40, 58, 82, 77, 29]], [[91, 36, 24, 57], [88, 3, 45, 19], [49, 9, 86, 22], [55, 16, 72, 81]], [[27, 35, 35, 78, 52, 41, 22, 22, 75, 96, 91, 20, 46, 34, 83, 62, 10, 13, 92, 8, 86, 54, 92, 16, 17, 40, 49, 62, 19, 49, 38, 82, 62, 37, 93, 15, 85], [61, 56, 7, 36, 86, 37, 70, 40, 78, 17, 1, 44, 66, 42, 45, 46, 55, 21, 5, 84, 41, 86, 40, 87, 65, 13, 88, 89, 92, 68, 23, 4, 40, 61, 58, 98, 84], [17, 30, 92, 24, 95, 96, 38, 59, 63, 93, 64, 71, 52, 54, 15, 56, 70, 54, 81, 97, 61, 44, 1, 63, 59, 3, 13, 11, 61, 12, 82, 80, 33, 41, 4, 88, 47], [46, 54, 71, 9, 83, 93, 70, 36, 58, 86, 86, 38, 43, 67, 25, 78, 5, 18, 28, 30, 70, 95, 18, 25, 34, 72, 92, 71, 63, 98, 25, 65, 59, 66, 98, 96, 63], [12, 44, 54, 26, 54, 86, 31, 97, 22, 48, 8, 80, 28, 78, 68, 24, 83, 25, 47, 17, 66, 91, 8, 62, 37, 5, 46, 4, 59, 70, 29, 8, 48, 74, 99, 61, 53], [74, 64, 16, 76, 25, 79, 64, 78, 60, 70, 67, 27, 17, 89, 35, 69, 62, 94, 82, 84, 27, 44, 81, 63, 98, 56, 8, 57, 76, 61, 99, 3, 47, 14, 45, 79, 39], [67, 24, 62, 2, 69, 68, 2, 62, 11, 17, 12, 83, 77, 83, 84, 21, 56, 31, 31, 69, 40, 2, 11, 52, 24, 48, 62, 95, 2, 90, 17, 60, 55, 49, 75, 55, 42], [77, 90, 94, 20, 72, 64, 84, 75, 28, 75, 73, 36, 27, 6, 28, 13, 87, 47, 11, 85, 39, 24, 75, 45, 90, 48, 42, 84, 59, 29, 68, 82, 46, 58, 12, 32, 95], [8, 89, 11, 26, 41, 60, 19, 48, 17, 63, 10, 34, 93, 51, 45, 28, 18, 96, 36, 5, 82, 80, 3, 6, 97, 60, 80, 44, 66, 66, 69, 92, 52, 1, 5, 68, 93], [66, 79, 5, 59, 95, 26, 14, 41, 75, 83, 74, 52, 42, 81, 82, 60, 89, 15, 47, 33, 95, 37, 47, 36, 70, 46, 52, 72, 75, 26, 29, 2, 24, 18, 33, 85, 86], [33, 32, 33, 40, 62, 14, 45, 26, 27, 10, 71, 81, 43, 68, 97, 16, 24, 21, 93, 50, 79, 62, 92, 52, 18, 8, 9, 59, 44, 70, 98, 67, 18, 83, 73, 13, 40], [69, 47, 24, 37, 44, 46, 44, 75, 60, 74, 3, 17, 51, 5, 35, 82, 91, 90, 57, 31, 77, 60, 80, 50, 22, 80, 72, 32, 18, 33, 64, 45, 38, 30, 64, 42, 13], [77, 68, 42, 6, 79, 27, 96, 53, 7, 31, 88, 66, 72, 71, 65, 8, 53, 68, 30, 83, 61, 37, 84, 45, 53, 13, 32, 62, 2, 77, 8, 96, 48, 14, 85, 33, 36], [85, 59, 70, 69, 48, 30, 28, 41, 76, 58, 41, 11, 6, 20, 91, 29, 73, 48, 71, 85, 82, 15, 2, 97, 75, 53, 55, 70, 13, 44, 58, 17, 41, 25, 69, 14, 29], [52, 30, 12, 91, 95, 93, 91, 69, 9, 26, 27, 15, 79, 98, 14, 2, 46, 70, 80, 73, 80, 44, 86, 19, 72, 44, 45, 85, 67, 79, 66, 22, 17, 58, 80, 47, 14], [41, 69, 55, 21, 80, 31, 32, 80, 9, 37, 9, 21, 56, 8, 24, 80, 95, 20, 5, 50, 2, 67, 58, 96, 89, 99, 30, 15, 93, 2, 70, 93, 22, 70, 93, 62, 81], [96, 82, 25, 18, 46, 75, 69, 63, 54, 27, 44, 62, 70, 75, 29, 96, 4, 69, 60, 82, 72, 23, 38, 62, 12, 85, 22, 96, 58, 92, 61, 18, 67, 94, 77, 65, 35], [39, 26, 17, 50, 32, 22, 39, 89, 32, 88, 59, 8, 44, 30, 77, 23, 64, 77, 30, 70, 94, 98, 17, 88, 73, 54, 19, 31, 25, 97, 38, 55, 50, 37, 35, 96, 60], [86, 67, 75, 88, 98, 30, 15, 75, 84, 88, 74, 39, 99, 42, 95, 27, 5, 76, 98, 75, 29, 62, 91, 56, 43, 80, 79, 13, 97, 5, 94, 50, 49, 90, 73, 69, 99], [55, 59, 1, 67, 9, 26, 66, 92, 20, 90, 14, 2, 21, 59, 19, 46, 15, 32, 36, 78, 35, 9, 98, 95, 25, 41, 44, 74, 98, 49, 55, 15, 66, 62, 26, 42, 35], [45, 32, 62, 64, 52, 96, 43, 92, 55, 44, 91, 79, 59, 54, 88, 85, 1, 85, 87, 22, 50, 31, 50, 29, 39, 1, 65, 50, 18, 49, 75, 37, 70, 76, 35, 72, 43], [65, 43, 66, 35, 34, 42, 80, 8, 6, 40, 68, 23, 63, 14, 89, 58, 36, 34, 76, 21, 45, 58, 15, 45, 17, 50, 88, 55, 92, 31, 31, 85, 97, 10, 66, 53, 11], [56, 79, 89, 34, 87, 43, 92, 68, 3, 14, 29, 85, 17, 70, 45, 53, 50, 48, 69, 65, 74, 5, 28, 96, 71, 42, 60, 2, 22, 92, 97, 95, 98, 10, 28, 88, 78], [36, 61, 2, 51, 34, 35, 43, 11, 32, 38, 47, 81, 85, 95, 5, 64, 86, 53, 29, 1, 30, 26, 86, 10, 13, 25, 15, 1, 75, 44, 35, 13, 19, 48, 12, 73, 84], [82, 64, 25, 6, 5, 38, 12, 55, 66, 67, 26, 51, 31, 6, 30, 96, 82, 39, 9, 99, 73, 63, 70, 99, 4, 30, 45, 26, 74, 70, 31, 26, 71, 8, 61, 85, 38], [48, 62, 97, 16, 3, 62, 56, 67, 99, 87, 12, 88, 55, 13, 15, 7, 24, 13, 19, 67, 5, 50, 74, 64, 48, 49, 84, 80, 63, 7, 98, 34, 79, 5, 57, 74, 42], [72, 85, 45, 71, 40, 9, 64, 93, 60, 20, 17, 39, 63, 22, 71, 45, 28, 6, 81, 66, 61, 8, 7, 80, 66, 22, 43, 49, 71, 26, 98, 54, 39, 12, 41, 99, 2], [52, 93, 84, 53, 55, 19, 26, 37, 13, 87, 25, 58, 47, 23, 3, 51, 78, 79, 35, 78, 17, 6, 58, 84, 48, 10, 14, 27, 68, 83, 52, 51, 45, 66, 57, 27, 47], [88, 42, 63, 58, 68, 66, 46, 22, 85, 54, 78, 84, 98, 84, 33, 73, 42, 38, 77, 13, 55, 69, 97, 58, 49, 50, 46, 1, 91, 39, 6, 52, 68, 73, 63, 90, 2], [61, 24, 64, 5, 65, 50, 55, 35, 71, 4, 50, 85, 73, 90, 58, 1, 20, 75, 32, 13, 28, 10, 2, 5, 71, 97, 71, 66, 14, 85, 18, 14, 13, 83, 21, 30, 35], [96, 51, 55, 58, 82, 71, 12, 74, 38, 3, 46, 73, 57, 71, 26, 46, 48, 18, 63, 44, 57, 59, 82, 62, 46, 18, 85, 15, 6, 60, 59, 82, 23, 32, 35, 55, 35], [2, 24, 90, 62, 90, 44, 4, 22, 51, 16, 56, 30, 66, 37, 18, 19, 94, 9, 31, 82, 69, 74, 86, 49, 40, 80, 23, 94, 60, 10, 75, 92, 30, 25, 27, 72, 74], [98, 93, 17, 27, 23, 91, 74, 80, 70, 1, 89, 49, 17, 33, 32, 14, 4, 96, 62, 17, 89, 14, 6, 11, 28, 9, 72, 30, 60, 44, 38, 80, 64, 84, 74, 62, 53], [99, 7, 63, 10, 21, 94, 70, 34, 12, 75, 55, 68, 87, 33, 33, 14, 2, 3, 52, 18, 35, 68, 8, 71, 37, 44, 26, 11, 57, 81, 69, 77, 20, 99, 82, 14, 77], [86, 13, 54, 5, 89, 15, 79, 15, 86, 36, 85, 17, 13, 59, 94, 16, 60, 16, 50, 99, 49, 2, 8, 91, 69, 92, 58, 52, 5, 23, 42, 74, 26, 71, 82, 83, 2], [89, 44, 88, 67, 64, 70, 91, 85, 18, 33, 46, 80, 57, 85, 66, 51, 45, 2, 39, 3, 80, 28, 28, 97, 31, 44, 20, 11, 11, 39, 6, 64, 63, 60, 63, 31, 38], [99, 18, 9, 42, 28, 67, 23, 10, 5, 2, 25, 60, 87, 67, 53, 17, 41, 33, 92, 5, 87, 73, 70, 6, 73, 81, 13, 3, 73, 14, 67, 36, 84, 46, 82, 1, 20]]]; int [] param1 = [0, 3, 3, 13, 12, 22, 34, 37, 3, 36]; 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_XOR_VALUE_PAIR_1,"static int f_filled ( int arr [ ] , int n ) { Arrays . parallelSort ( arr ) ; int minXor = Integer . MAX_VALUE ; int val = 0 ; for ( int i = 0 ; i < n - 1 ; i ++ ) { val = arr [ i ] ^ arr [ i + 1 ] ; minXor = Math . min ( minXor , val ) ; } return minXor ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, -4, 0, 0, -28, 0, 0, 10, 0, 1]; int [] [] param0 = [[8, 11, 12, 27, 32, 32, 36, 56, 57, 66, 68, 70, 74, 78, 82, 83, 96], [-60, -8, 4, 38, 40, 42, 48, 66], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [2, 3, 4, 6, 7, 7, 10, 11, 12, 15, 16, 20, 24, 28, 29, 32, 36, 37, 38, 44, 48, 49, 50, 52, 57, 57, 57, 61, 63, 64, 65, 66, 67, 68, 70, 76, 78, 81, 82, 86, 87, 89, 91, 95, 95, 98], [-88, -84, -76, -58, -40, -38, -28, -24, -20, -14, -12, 16, 20, 28, 28, 30, 40, 44, 56, 58, 60, 92, 92], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [6, 6, 19, 31, 41, 45, 49, 56, 78, 96, 98], [-90, -84, -4, 22, 62], [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], [7, 10, 13, 20, 28, 29, 34, 37, 39, 42, 43, 56, 58, 65, 69, 72, 74, 83, 91, 92, 93, 99]]; int [] param1 = [10, 7, 19, 36, 13, 20, 6, 3, 21, 14]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_PRINT_SUM_GIVEN_NTH_TERM_1,"static int f_filled ( long n ) { return (int) Math . pow ( n , 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1764, 1600, 4489, 5329, 324, 256, 5476, 1089, 8464, 484]; long [] param0 = [42, 40, 67, 73, 18, 16, 74, 33, 92, 22]; 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,"static int f_filled ( int n ) { int count = 0 ; if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ; while ( n != 0 ) { n >>= 1 ; count += 1 ; } return 1 << count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [128, 128, 128, 128, 128, 32, 128, 128, 64, 64]; int [] param0 = [74, 70, 85, 78, 71, 32, 97, 90, 64, 48]; 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); } " PADOVAN_SEQUENCE,"static int f_filled ( int n ) { int pPrevPrev = 1 , pPrev = 1 , pCurr = 1 , pNext = 1 ; for ( int i = 3 ; i <= n ; i ++ ) { pNext = pPrevPrev + pPrev ; pPrevPrev = pPrev ; pPrev = pCurr ; pCurr = pNext ; } return pNext ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 351, 151, 3, 4, 9, 49, 4410, 12, 7]; int [] param0 = [1, 22, 19, 5, 6, 9, 15, 31, 10, 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); } " NTH_MULTIPLE_NUMBER_FIBONACCI_SERIES,"static int f_filled ( int k , int n ) { long f1 = 0 , f2 = 1 , f3 ; int i = 2 ; while ( i != 0 ) { f3 = f1 + f2 ; f1 = f2 ; f2 = f3 ; if ( f2 % k == 0 ) { return n * i ; } i ++ ; } return 0 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4500, 1890, 408, 204, 817, 552, 120, 768, 1176, 3840]; int [] param0 = [50, 52, 42, 2, 37, 48, 31, 9, 78, 64]; int [] param1 = [60, 45, 17, 68, 43, 46, 4, 64, 14, 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); } " NTH_NON_FIBONACCI_NUMBER,"static int f_filled ( int n ) { int prevPrev = 1 , prev = 2 , curr = 3 ; while ( n > 0 ) { prevPrev = prev ; prev = curr ; curr = prevPrev + prev ; n = n - ( curr - prev - 1 ) ; } n = n + ( curr - prev - 1 ) ; return prev + n ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [85, 101, 71, 74, 93, 66, 85, 11, 6, 96]; int [] param0 = [76, 91, 62, 65, 83, 57, 76, 6, 2, 86]; 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); } " NTH_PENTAGONAL_NUMBER,"static int f_filled ( int n ) { return ( 3 * n * n - n ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [13776, 12927, 330, 92, 651, 287, 176, 9322, 852, 13207]; int [] param0 = [96, 93, 15, 8, 21, 14, 11, 79, 24, 94]; 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_ORDERED_PAIRS_AI_AJ_0,"static int f_filled ( int a [ ] , int n ) { int count = 0 ; for ( int i = 0 ; i < n ; i ++ ) { for ( int j = i + 1 ; j < n ; j ++ ) if ( ( a [ i ] & a [ j ] ) == 0 ) count += 2 ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [54, 6, 506, 172, 266, 100, 238, 116, 14, 108]; int [] [] param0 = [[17, 20, 32, 35, 35, 36, 43, 47, 59, 59, 68, 69, 70, 70, 75, 82, 88, 94, 96, 99], [-78, -40, 58, -36, 34, -12, -38, 48, -66, 16, 50, -26, -22, 46, -70, -68, -44, -52, -78, -50], [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], [49, 57, 17, 37, 56, 61, 10, 3, 33, 33, 70, 35, 50, 85, 48, 65, 83, 21, 96, 19, 66, 43, 69, 17, 60, 87, 82, 3, 83, 44, 63, 19, 55, 58, 77, 76, 50, 96], [-94, -88, -86, -80, -80, -72, -64, -60, -58, -58, -58, -50, -44, -32, -8, -8, 0, 6, 8, 10, 14, 14, 18, 28, 34, 34, 46, 54, 56, 56, 56, 64, 66, 66, 70, 82, 84, 88, 96], [1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0], [1, 3, 10, 11, 13, 14, 15, 17, 20, 25, 26, 26, 27, 29, 32, 36, 36, 36, 42, 46, 47, 49, 51, 54, 54, 55, 60, 66, 67, 68, 68, 68, 72, 77, 78, 79, 83, 84, 92, 98], [-76, -72, 16, 38, -60, 44, -2, -76, -76, -56, 40, 36, 50, -50, -32, 48, -96, 80, 84, 60, 84, 38, -54, -42, 48, 30, 66, -62, -52, -94, 64, -16, 54, 98], [0, 0, 1, 1, 1, 1], [63, 82, 22, 84, 11, 62, 18, 43, 57, 25, 4, 27, 62, 46, 55, 16, 1, 9, 10, 73, 36, 80, 95, 87, 47, 64, 27, 25, 70]]; int [] param1 = [17, 11, 23, 37, 33, 13, 32, 28, 5, 22]; 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_DIGITS_PRODUCT_TWO_NUMBERS_1,"static int f_filled ( int a , int b ) { if ( a == 0 || b == 0 ) return 1 ; return ( int ) Math . floor ( Math . log10 ( Math . abs ( a ) ) + Math . log10 ( Math . abs ( b ) ) ) + 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4, 4, 4, 4, 4, 4, 4, 4, 3, 4]; int [] param0 = [97, 52, 95, 35, 40, 18, 92, 73, 10, 82]; int [] param1 = [91, 49, 34, 40, 85, 97, 15, 98, 62, 22]; 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_NON_NEGATIVE_INTEGRAL_SOLUTIONS_B_C_N_1,"static int f_filled ( int n ) { return ( ( n + 1 ) * ( n + 2 ) ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [903, 2701, 1540, 2926, 3916, 903, 3160, 3321, 1128, 55]; int [] param0 = [41, 72, 54, 75, 87, 41, 78, 80, 46, 9]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_OCTAL_DECIMAL_CONVERSION,"static int f_filled ( int n ) { int num = n ; int dec_value = 0 ; int base = 1 ; int temp = num ; while ( temp > 0 ) { int last_digit = temp % 10 ; temp = temp / 10 ; dec_value += last_digit * base ; base = base * 8 ; } return dec_value ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [31, 21, 51, 54, 26, 5, 33, 66, 44, 5]; int [] param0 = [37, 25, 63, 66, 32, 5, 41, 82, 54, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROBABILITY_THREE_RANDOMLY_CHOSEN_NUMBERS_AP,"static double f_filled ( int n ) { return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [0.0163062743707905, 0.15151515151515152, 0.017047655947307245, 0.05005561735261402, 0.010417169037858692, 0.4, 0.008721225027887637, 0.04415584415584416, 0.025006946373992776, 0.01785967399007796]; int [] param0 = [46, 5, 44, 15, 72, 2, 86, 17, 30, 42]; 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_SUBSEQUENCES_AB_STRING_REPEATED_K_TIMES,"static int f_filled ( String s , int K ) { int n = s . length ( ) ; int C = 0 , c1 = 0 , c2 = 0 ; for ( int i = 0 ; i < n ; i ++ ) { if ( s . charAt ( i ) == 'a' ) c1 ++ ; if ( s . charAt ( i ) == 'b' ) { c2 ++ ; C += c1 ; } } return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [9312, 49, 75, 7260, 0, 861, 3828, 40, 0, 0]; string [] param0 = [""abbc"", ""abahk"", ""hugbabab"", ""abadbc"", ""nkg9"", ""jh7dab"", ""abd"", ""aabb8yk"", ""1111"", ""pfxahr""]; int [] param1 = [96, 7, 5, 60, 8, 41, 87, 4, 18, 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_SUBSTRINGS_STRING,"static int f_filled ( String str ) { int n = str . length ( ) ; return n * ( n + 1 ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [78, 21, 45, 66, 105, 15, 105, 45, 45, 91]; string [] param0 = [""gzfgzshcimlf"", ""505357"", ""011011101"", ""ovfwp osauz"", ""92132238746026"", ""01100"", ""raowyqrfiwksyc"", ""861330202"", ""001100010"", ""uvpklgublomba""]; 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_VISIBLE_BOXES_PUTTING_ONE_INSIDE_ANOTHER,"static int f_filled ( int [ ] arr , int n ) { Queue < Integer > q = new LinkedList < > ( ) ; Arrays . sort ( arr ) ; q . add ( arr [ 0 ] ) ; for ( int i = 1 ; i < n ; i ++ ) { int now = q . element ( ) ; if ( arr [ i ] >= 2 * now ) q . remove ( ) ; q . add ( arr [ i ] ) ; } return q . size ( ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 6, 17, 9, 8, 11, 25, 8, 9, 22]; int [] [] param0 = [[2, 3, 17, 17, 18, 28, 28, 29, 34, 43, 44, 52, 54, 80, 84, 84, 91, 92, 97], [-94, -90, -90, -78, -34, -26, -10, 4, 24, 28, 64, 70, 72, 74, 80, 82], [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], [2, 3, 5, 8, 12, 16, 20, 30, 37, 53, 55, 62, 76, 81, 83, 87, 88, 96], [-94, -92, -60, -58, -54, -42, -36, -12, -8, -2, 8, 14, 18, 20, 26, 32, 38, 56, 58, 60, 70, 78, 80, 86, 98], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 1, 2, 3, 3, 11, 16, 18, 19, 21, 21, 22, 22, 24, 27, 28, 29, 43, 43, 52, 55, 57, 60, 62, 62, 63, 65, 66, 70, 70, 73, 77, 78, 79, 79, 80, 85, 85, 86, 88, 89, 90, 97, 98], [-94, -82, -80, -78, -68, -60, -58, -44, -44, -42, -30, -30, -22, -18, -18, -14, -14, -10, -8, -6, 4, 4, 6, 12, 12, 14, 18, 30, 44, 48, 50, 52, 54, 80, 86, 88, 88], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [3, 5, 5, 10, 12, 16, 22, 31, 31, 32, 39, 43, 43, 47, 49, 50, 51, 52, 52, 56, 59, 59, 62, 69, 69, 71, 75, 81, 82, 83, 83, 86, 89, 90, 90, 96]]; int [] param1 = [19, 16, 42, 18, 25, 16, 44, 37, 13, 36]; 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); } " N_TH_TERM_SERIES_2_12_36_80_150,"static int f_filled ( int n ) { return ( n * n ) + ( n * n * n ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [737100, 866400, 11132, 25230, 242172, 65600, 143312, 9702, 37026, 1452]; int [] param0 = [90, 95, 22, 29, 62, 40, 52, 21, 33, 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); } " ONE_LINE_FUNCTION_FOR_FACTORIAL_OF_A_NUMBER,"static int f_filled ( int n ) { return ( n == 1 || n == 0 ) ? 1 : n * f_filled ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [40320, 2, 720, 3628800, 362880, 5040, 24, 120, 720, 1]; int [] param0 = [8, 2, 6, 10, 9, 7, 4, 5, 6, 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); } " PROGRAM_FOR_FACTORIAL_OF_A_NUMBER_2,"static int f_filled ( int n ) { return ( n == 1 || n == 0 ) ? 1 : n * f_filled ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 24, 5040, 1, 40320, 362880, 6, 120, 720, 39916800]; int [] param0 = [2, 4, 7, 1, 8, 9, 3, 5, 6, 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); } " PRIMALITY_TEST_SET_1_INTRODUCTION_AND_SCHOOL_METHOD_1,"static boolean f_filled ( int n ) { if ( n <= 1 ) return false ; if ( n <= 3 ) return true ; if ( n % 2 == 0 || n % 3 == 0 ) return false ; for ( int i = 5 ; i * i <= n ; i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, false, false, false, false, false, false, true]; int [] param0 = [15, 90, 38, 65, 91, 16, 48, 74, 14, 47]; 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); } " PRIME_NUMBERS,"static boolean f_filled ( int n ) { if ( n <= 1 ) return false ; for ( int i = 2 ; i < n ; i ++ ) if ( n % i == 0 ) return false ; return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, false, false, false, false, false, false, false, true, false]; int [] param0 = [2, 74, 46, 38, 51, 48, 6, 14, 31, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PYTHON_PROGRAM_FIND_PERIMETER_CIRCUMFERENCE_SQUARE_RECTANGLE_1,"static int f_filled ( int l , int w ) { return ( 2 * ( l + w ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [194, 172, 216, 130, 178, 130, 256, 178, 116, 210]; int [] param0 = [58, 37, 56, 22, 77, 34, 74, 37, 21, 75]; int [] param1 = [39, 49, 52, 43, 12, 31, 54, 52, 37, 30]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_CENSOR_WORD_ASTERISKS_SENTENCE,"static String f_filled ( String text , String word ) { String [ ] word_list = text . split ( ""\\s+"" ) ; String result = """" ; String stars = """" ; for ( int i = 0 ; i < word . length ( ) ; i ++ ) stars += '*' ; int index = 0 ; for ( String i : word_list ) { if ( i . compareTo ( word ) == 0 ) word_list [ index ] = stars ; index ++ ; } for ( String i : word_list ) result += i + ' ' ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""iggvaxtmj "", ""76711241128 "", ""010 "", ""hikon "", ""3680369217 "", ""1111 "", ""zii "", ""06 "", ""111 "", ""njnnrvu ""]; string [] param0 = [""iggvaxtmj"", ""76711241128"", ""010"", ""hikon"", ""3680369217"", ""1111"", ""zii"", ""06"", ""111"", ""njnnrvu""]; string [] param1 = [""kzhdejucao"", ""5"", ""0101001"", ""xlnbwpx"", ""017523"", ""1011"", ""onnxygon"", ""54171617"", ""0010001011001"", ""agwms""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " PROGRAM_FIND_SLOPE_LINE,"static float f_filled ( float x1 , float y1 , float x2 , float y2 ) { return ( y2 - y1 ) / ( x2 - x1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [-0.6486899453998202, -0.12115078452752318, 0.617204628531244, -0.8320918116165706, -38.51013687881985, -0.6052307962095809, -0.7142746798007333, 0.9387777514963889, -4.2964732392719505, 2.85002783720527]; float [] param0 = [236.27324548309292, -9201.144918204123, 3480.4716834445326, -6915.538971485092, 8887.97173657486, -3785.5177159369946, 3037.6696554256832, -7925.458496016523, 1404.2919985268031, -4748.744241168378]; float [] param1 = [5792.493225762838, -2716.3347716140406, 3577.9608612055613, -4113.601103381095, 1678.4080012662428, -3084.67461899163, 4432.445827549, -3350.27411882042, 8971.636233373416, -675.557388148954]; float [] param2 = [7177.837879115863, -5161.142121227645, 8611.515262945342, -748.3462104020822, 8709.574949883017, -7415.76208254121, 8387.304165588026, -5619.767086756504, 3039.112051378511, -5998.241086029875]; float [] param3 = [1289.5700425822731, -3205.784279961129, 6744.864707668983, -9245.271700539257, 8548.492675510739, -887.5389305564152, 611.3373507518394, -1185.7423219907591, 1947.6756252708972, -4236.658178504375]; 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); } " PROGRAM_TO_FIND_REMAINDER_WITHOUT_USING_MODULO_OR_OPERATOR,"static int f_filled ( int num , int divisor ) { return ( num - divisor * ( num / divisor ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [26, 0, 1, 22, 3, 61, 45, 29, 30, 9]; int [] param0 = [80, 63, 1, 22, 66, 61, 45, 29, 95, 9]; int [] param1 = [54, 21, 56, 39, 7, 67, 63, 44, 65, 68]; 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); } " RECURSIVE_C_PROGRAM_LINEARLY_SEARCH_ELEMENT_GIVEN_ARRAY,"static int f_filled ( int arr [ ] , int l , int r , int x ) { if ( r < l ) return - 1 ; if ( arr [ l ] == x ) return l ; if ( arr [ r ] == x ) return r ; return f_filled ( arr , l + 1 , r - 1 , x ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 3, -1, -1, 7, 0, 2, -1, -1, 2]; int [] [] param0 = [[10, 74, 5], [-90, 72, 36, 96, 42, 0, -66, 5], [0, 5], [99, 70, 67, 5], [-98, -98, -26, -26, -24, -18, -16, 80, 5], [1, 1, 1, 1, 0, 1, 5], [1, 5, 12, 12, 17, 17, 12, 95, 96, 98, 5], [50, -70, -30, -54, 6, -10, 70, 84, 5], [0, 1, 5], [59, 21, 28, 3, 14, 5]]; int [] param1 = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; int [] param2 = [2, 7, 1, 3, 8, 6, 10, 8, 2, 5]; int [] param3 = [1, 96, -1, 3, 80, 1, 12, 27, 14, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " REMOVE_BRACKETS_ALGEBRAIC_STRING_CONTAINING_OPERATORS,"static String f_filled ( String str ) { int len = str . length ( ) ; char res [ ] = new char [ len ] ; int index = 0 , i = 0 ; Stack < Integer > s = new Stack < Integer > ( ) ; s . push ( 0 ) ; while ( i < len ) { if ( str . charAt ( i ) == '+' ) { if ( s . peek ( ) == 1 ) res [ index ++ ] = '-' ; if ( s . peek ( ) == 0 ) res [ index ++ ] = '+' ; } else if ( str . charAt ( i ) == '-' ) { if ( s . peek ( ) == 1 ) res [ index ++ ] = '+' ; else if ( s . peek ( ) == 0 ) res [ index ++ ] = '-' ; } else if ( str . charAt ( i ) == '(' && i > 0 ) { if ( str . charAt ( i - 1 ) == '-' ) { int x = ( s . peek ( ) == 1 ) ? 0 : 1 ; s . push ( x ) ; } else if ( str . charAt ( i - 1 ) == '+' ) s . push ( s . peek ( ) ) ; } else if ( str . charAt ( i ) == ')' ) s . pop ( ) ; else res [ index ++ ] = str . charAt ( i ) ; i ++ ; } return new String ( res ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""ggbsmvmzcmovd"", ""384292670"", ""10000100"", ""fdhme"", ""09198832"", ""0011111011"", ""snxwrs"", ""071"", ""01101"", ""xwmqxgba""]; string [] param0 = [""ggbsmvmzcmovd"", ""384292670"", ""10000100"", ""fdhme"", ""09198832"", ""0011111011"", ""snxwrs"", ""071"", ""01101"", ""xwmqxgba""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " REMOVE_MINIMUM_ELEMENTS_EITHER_SIDE_2MIN_MAX,"static int f_filled ( int arr [ ] , int n ) { int longest_start = - 1 , longest_end = 0 ; for ( int start = 0 ; start < n ; start ++ ) { int min = Integer . MAX_VALUE , max = Integer . MIN_VALUE ; for ( int end = start ; end < n ; end ++ ) { int val = arr [ end ] ; if ( val < min ) { min = val ; } if ( val > max ) { max = val ; } if ( 2 * min <= max ) { break ; } if ( end - start > longest_end - longest_start || longest_start == - 1 ) { longest_start = start ; longest_end = end ; } } } if ( longest_start == - 1 ) { return n ; } return ( n - ( longest_end - longest_start + 1 ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 9, 9, 0, 28, 10, 2, 23, 2, 0]; int [] [] param0 = [[32, 50, 66, 73, 76, 87], [68, 74, 16, 40, 6, -44, -36, 94, 6, -24, -4, -58, -16, 24], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [91, 22], [-84, -80, -78, -76, -58, -54, -52, -48, -42, -42, -40, -38, -34, -32, -28, -24, -6, 2, 2, 4, 10, 14, 16, 18, 26, 26, 36, 40, 50, 52, 62, 64, 72, 74, 84, 90, 94, 96, 98], [1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1], [10, 19, 25, 29, 32, 37, 40, 43, 43, 44, 46, 51, 51, 54, 56, 58, 63, 79, 83, 86, 87, 97, 97], [-48, -28, 10, 30, 78, -72, 78, 52, -52, -68, 56, 42, 8, -42, 16, -56, 2, -90, -26, -28, -56, -2, 80, -50, 98, -64, -96, 10, -10, 44, 98, -48, -88, 42, 30, 24, 38, -26, -52, -12, 0, 34, -82, -80, 0, -84, -20], [0, 0, 1, 1, 1, 1, 1, 1], [25, 82]]; int [] param1 = [5, 11, 11, 1, 35, 13, 11, 25, 6, 1]; 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); } " REMOVE_MINIMUM_NUMBER_ELEMENTS_NO_COMMON_ELEMENT_EXIST_ARRAY,"static int f_filled ( int a [ ] , int b [ ] , int n , int m ) { HashMap < Integer , Integer > countA = new HashMap < Integer , Integer > ( ) ; HashMap < Integer , Integer > countB = new HashMap < Integer , Integer > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( countA . containsKey ( a [ i ] ) ) countA . put ( a [ i ] , countA . get ( a [ i ] ) + 1 ) ; else countA . put ( a [ i ] , 1 ) ; } for ( int i = 0 ; i < m ; i ++ ) { if ( countB . containsKey ( b [ i ] ) ) countB . put ( b [ i ] , countB . get ( b [ i ] ) + 1 ) ; else countB . put ( b [ i ] , 1 ) ; } int res = 0 ; Set < Integer > s = countA . keySet ( ) ; for ( int x : s ) if ( countB . containsKey ( x ) ) res += Math . min ( countB . get ( x ) , countA . get ( x ) ) ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 1, 9, 0, 1, 2, 1, 0, 24, 1]; int [] [] param0 = [[4, 7, 10, 12, 12, 24, 29, 38, 45, 51, 53, 54, 59, 68, 72, 73, 85, 86, 88, 92, 92, 95], [-6, 48, -70, 14, -86, 56, 80, -64, 64, -88, -14, 78, 14, -18, 52, 2, 22, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [10, 93, 2, 16, 36, 49, 36, 86, 6, 99, 95, 2], [-98, -96, -80, -64, -42, -30, -6, 10, 62, 66, 82], [1, 1, 0, 1, 1], [7, 11, 13, 15, 21, 33, 36, 39, 66, 99], [-40], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [79, 91, 31, 16, 28, 45, 37, 43, 73, 73, 76, 28, 71, 60, 64, 60, 99, 36, 47, 38, 65, 34, 22, 94, 84, 51, 72, 45, 71, 2]]; int [] [] param1 = [[7, 9, 17, 23, 25, 26, 29, 32, 35, 56, 56, 58, 59, 59, 62, 63, 72, 82, 85, 86, 95, 97], [-62, -58, 60, -30, 42, 8, 66, -48, -18, 64, -76, -90, -48, -90, -24, 64, -88, -98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [99, 28, 7, 21, 62, 89, 82, 41, 43, 77, 8, 14], [-62, -50, -42, 24, 44, 46, 52, 54, 60, 72, 72], [1, 1, 1, 0, 0], [23, 36, 42, 44, 62, 65, 70, 78, 82, 89], [-98], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [58, 94, 12, 27, 98, 38, 75, 20, 94, 43, 32, 90, 23, 41, 88, 2, 62, 96, 53, 57, 48, 79, 6, 16, 11, 46, 73, 57, 67, 7]]; int [] param2 = [15, 15, 10, 6, 9, 4, 9, 0, 31, 18]; int [] param3 = [13, 9, 10, 10, 6, 2, 9, 0, 26, 18]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " REPLACE_CHARACTER_C1_C2_C2_C1_STRING_S,"static String f_filled ( String s , char c1 , char c2 ) { int l = s . length ( ) ; char [ ] arr = s . toCharArray ( ) ; for ( int i = 0 ; i < l ; i ++ ) { if ( arr [ i ] == c1 ) arr [ i ] = c2 ; else if ( arr [ i ] == c2 ) arr [ i ] = c1 ; } return String . valueOf ( arr ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""iztsmw j"", ""7288334"", ""010110000"", ""b gjx"", ""734"", ""1"", ""xcaukdha"", ""4370992544981"", ""10101"", ""znifgshawa""]; string [] param0 = [""iztsmw j"", ""7288334"", ""010110000"", ""b gjx"", ""734"", ""1"", ""xcaukdha"", ""4370992644981"", ""01010"", ""znifgshawa""]; char [] param1 = ['w', '6', '1', 't', '4', '1', 'x', '5', '0', 'q']; char [] param2 = ['k', '9', '1', 'p', '4', '1', 's', '6', '1', 'x']; 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); } " ROUND_THE_GIVEN_NUMBER_TO_NEAREST_MULTIPLE_OF_10,"static int f_filled ( int n ) { int a = ( n / 10 ) * 10 ; int b = a + 10 ; return ( n - a > b - n ) ? b : a ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [30, 80, 20, 40, 80, 90, 90, 20, 90, 0]; int [] param0 = [31, 78, 19, 36, 77, 94, 86, 16, 95, 2]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " ROW_WISE_COMMON_ELEMENTS_TWO_DIAGONALS_SQUARE_MATRIX,"static int f_filled ( int mat [ ] [ ] , int n ) { int res = 0 ; for ( int i = 0 ; i < n ; i ++ ) if ( mat [ i ] [ i ] == mat [ i ] [ n - i - 1 ] ) res ++ ; return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 6, 1, 0, 22, 0, 0, 3, 0]; int [] [] [] param0 = [[[62]], [[-56, -6, -12, 64, 36, 12, -40, -38, 14, 68, 62, -46, -30], [56, 30, -18, -92, -10, 76, 6, 64, 14, -94, 34, 6, 12], [-80, 90, -40, 2, -48, -28, 58, 86, -14, -50, -78, 36, -96], [-92, 84, -86, 60, -18, 18, 24, -16, 42, 66, -10, -70, 16], [68, 12, 78, 8, -44, 2, -76, 4, 4, 8, 24, -74, -60], [36, -34, 90, -76, 92, 48, -6, -46, 46, 0, -8, -68, 24], [54, -62, 10, 10, 88, 28, -92, -4, -92, -74, 86, -52, 24], [22, 0, 24, 98, 2, 76, -76, -76, 72, 66, -88, 28, 48], [14, 10, 78, 34, -64, 88, 48, -12, -8, 80, -66, -4, -92], [-22, -68, 44, 92, 42, 20, 34, -14, 18, -34, -76, 12, -12], [26, 50, 10, 84, -54, -56, 80, -24, 42, -56, 80, 20, -52], [-2, -98, -46, 34, -22, 2, 18, 2, -80, 70, 26, 38, -98], [-70, 44, -54, -12, 78, -10, -80, 44, -34, 16, -54, 24, -36]], [[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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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, 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], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 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], [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], [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], [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]], [[64, 13, 62, 37, 41, 79, 13, 99, 82, 90, 42, 83, 94, 22, 55, 35, 38, 49, 83, 12, 20, 92, 69, 27, 21, 97, 26, 25, 87, 47, 60, 20, 71, 80, 46, 57, 36, 9, 87, 39, 67, 13, 34, 75, 48, 41, 54, 12, 26], [51, 78, 95, 74, 11, 77, 69, 21, 55, 66, 93, 44, 55, 80, 79, 95, 39, 25, 8, 44, 78, 35, 14, 24, 2, 44, 74, 10, 7, 50, 29, 29, 50, 47, 68, 20, 37, 69, 52, 6, 15, 4, 54, 1, 41, 61, 53, 23, 17], [53, 35, 55, 27, 25, 62, 59, 43, 10, 1, 57, 97, 60, 19, 4, 74, 59, 30, 1, 88, 81, 66, 56, 7, 79, 7, 87, 61, 83, 18, 20, 97, 68, 8, 21, 84, 48, 4, 89, 46, 19, 93, 4, 80, 95, 69, 59, 19, 63], [21, 59, 15, 68, 31, 60, 58, 61, 22, 82, 65, 88, 58, 71, 10, 5, 6, 25, 18, 20, 98, 68, 8, 63, 25, 16, 63, 56, 31, 28, 2, 7, 56, 29, 22, 42, 7, 60, 7, 14, 53, 25, 10, 32, 46, 3, 95, 18, 67], [15, 28, 19, 88, 66, 26, 2, 49, 8, 58, 40, 51, 7, 2, 61, 29, 27, 67, 73, 4, 70, 78, 84, 60, 99, 20, 67, 1, 44, 16, 27, 71, 95, 75, 99, 81, 46, 22, 18, 81, 35, 1, 80, 88, 34, 25, 26, 57, 32], [26, 78, 58, 96, 76, 98, 27, 74, 52, 59, 48, 90, 61, 43, 2, 44, 99, 64, 93, 36, 70, 35, 96, 87, 2, 23, 45, 78, 79, 83, 91, 36, 61, 94, 69, 51, 34, 93, 91, 13, 32, 24, 81, 14, 98, 88, 1, 92, 50], [18, 5, 12, 94, 10, 40, 95, 87, 90, 58, 11, 13, 82, 3, 83, 1, 86, 37, 94, 75, 92, 2, 65, 6, 11, 52, 5, 3, 76, 16, 30, 91, 96, 24, 25, 49, 3, 78, 90, 41, 65, 42, 49, 46, 28, 39, 97, 1, 11], [74, 11, 85, 75, 6, 42, 41, 60, 25, 36, 59, 14, 95, 10, 89, 93, 70, 44, 34, 6, 57, 32, 59, 74, 59, 35, 61, 48, 64, 16, 64, 46, 34, 14, 84, 89, 66, 36, 8, 87, 78, 72, 99, 83, 34, 88, 71, 17, 13], [23, 28, 65, 90, 23, 29, 89, 11, 13, 75, 37, 53, 76, 76, 28, 63, 22, 82, 74, 73, 17, 21, 54, 19, 65, 17, 23, 11, 28, 60, 16, 19, 55, 83, 48, 14, 8, 84, 40, 91, 96, 72, 16, 79, 80, 60, 17, 92, 94], [40, 51, 57, 69, 48, 63, 30, 7, 43, 79, 82, 92, 48, 12, 12, 13, 10, 88, 10, 55, 16, 57, 29, 91, 11, 52, 99, 91, 81, 23, 37, 32, 29, 50, 49, 31, 85, 67, 37, 30, 70, 48, 90, 64, 14, 73, 31, 90, 71], [15, 51, 10, 81, 51, 47, 52, 69, 3, 55, 87, 94, 54, 79, 33, 29, 18, 41, 37, 76, 65, 68, 36, 83, 88, 13, 22, 74, 70, 21, 88, 75, 41, 71, 76, 69, 76, 22, 57, 27, 91, 4, 30, 96, 82, 71, 57, 90, 55], [91, 67, 84, 54, 10, 88, 37, 45, 22, 67, 82, 92, 28, 55, 7, 94, 6, 23, 89, 35, 24, 33, 24, 8, 33, 21, 34, 55, 17, 31, 85, 79, 46, 15, 81, 87, 39, 77, 89, 36, 17, 98, 53, 8, 52, 74, 55, 88, 76], [5, 28, 79, 7, 68, 20, 99, 83, 74, 66, 32, 86, 13, 5, 76, 32, 98, 20, 26, 90, 83, 55, 92, 20, 32, 38, 20, 11, 18, 27, 76, 18, 8, 93, 62, 75, 45, 53, 98, 2, 37, 56, 72, 68, 35, 45, 75, 94, 12], [74, 8, 85, 10, 58, 59, 35, 46, 78, 87, 33, 7, 37, 22, 61, 10, 79, 26, 1, 86, 65, 31, 25, 9, 55, 40, 94, 15, 57, 64, 88, 98, 23, 3, 48, 38, 20, 82, 73, 42, 24, 68, 47, 81, 33, 78, 37, 99, 80], [66, 29, 59, 85, 53, 93, 30, 27, 51, 39, 82, 66, 97, 27, 31, 42, 19, 46, 25, 71, 33, 90, 31, 45, 53, 77, 27, 79, 74, 37, 6, 57, 86, 11, 21, 37, 80, 77, 6, 17, 57, 39, 61, 49, 23, 74, 72, 10, 12], [58, 96, 34, 23, 27, 20, 10, 25, 1, 6, 93, 17, 80, 48, 11, 23, 99, 64, 8, 69, 94, 29, 49, 85, 88, 19, 32, 53, 36, 86, 2, 3, 67, 79, 23, 76, 8, 26, 47, 41, 99, 81, 52, 39, 34, 50, 15, 39, 31], [31, 27, 87, 26, 85, 60, 45, 36, 89, 51, 10, 33, 60, 82, 29, 23, 71, 16, 68, 90, 3, 24, 36, 59, 26, 53, 71, 84, 23, 89, 64, 74, 8, 51, 89, 16, 78, 72, 70, 19, 83, 73, 52, 34, 8, 55, 87, 88, 27], [14, 57, 68, 56, 58, 90, 49, 65, 72, 65, 73, 7, 79, 37, 37, 43, 44, 16, 82, 67, 95, 2, 47, 51, 70, 9, 89, 65, 90, 69, 94, 18, 97, 35, 38, 67, 77, 18, 4, 95, 78, 22, 67, 86, 74, 35, 72, 25, 6], [36, 20, 73, 37, 38, 25, 96, 92, 83, 61, 51, 80, 59, 22, 41, 14, 90, 7, 94, 25, 31, 30, 85, 14, 58, 68, 10, 60, 44, 80, 96, 43, 82, 47, 31, 83, 19, 70, 7, 34, 54, 43, 74, 52, 37, 46, 42, 49, 82], [52, 52, 61, 51, 71, 67, 28, 85, 72, 35, 66, 48, 50, 49, 81, 31, 69, 15, 28, 87, 96, 97, 21, 1, 16, 37, 80, 92, 16, 8, 31, 58, 56, 44, 96, 7, 66, 11, 55, 18, 69, 90, 53, 15, 22, 57, 8, 98, 18], [85, 30, 77, 51, 48, 29, 46, 76, 27, 42, 34, 4, 56, 28, 46, 97, 57, 20, 69, 24, 76, 54, 58, 46, 12, 71, 27, 6, 77, 17, 35, 49, 84, 1, 61, 57, 66, 63, 52, 42, 66, 21, 84, 23, 18, 28, 71, 18, 27], [25, 53, 3, 58, 79, 23, 32, 85, 49, 99, 90, 65, 88, 91, 98, 57, 30, 1, 46, 65, 7, 77, 74, 65, 30, 88, 77, 53, 38, 76, 90, 72, 46, 59, 56, 94, 82, 7, 33, 63, 81, 37, 57, 47, 29, 77, 28, 32, 90], [79, 94, 9, 36, 56, 25, 72, 21, 73, 96, 11, 73, 20, 31, 79, 50, 95, 9, 36, 63, 8, 50, 57, 2, 91, 1, 84, 74, 41, 71, 73, 97, 36, 18, 69, 57, 49, 55, 95, 89, 36, 83, 96, 23, 60, 15, 61, 75, 72], [41, 24, 81, 57, 15, 46, 19, 53, 56, 45, 66, 62, 79, 11, 48, 73, 91, 48, 8, 65, 91, 88, 55, 36, 13, 38, 68, 66, 21, 45, 65, 41, 13, 34, 2, 85, 47, 28, 53, 60, 5, 9, 81, 40, 58, 51, 65, 9, 61], [68, 8, 55, 2, 80, 75, 83, 35, 24, 58, 33, 66, 67, 18, 24, 16, 14, 50, 61, 8, 13, 18, 58, 75, 68, 77, 47, 69, 61, 39, 36, 26, 92, 67, 59, 43, 44, 25, 19, 68, 86, 46, 83, 22, 32, 17, 22, 86, 44], [67, 74, 20, 20, 55, 32, 97, 12, 21, 40, 7, 72, 34, 62, 49, 44, 38, 23, 14, 93, 61, 56, 6, 47, 19, 93, 63, 79, 12, 17, 83, 67, 72, 14, 88, 86, 45, 33, 35, 96, 28, 16, 31, 17, 27, 17, 54, 3, 27], [30, 28, 83, 88, 86, 45, 62, 94, 25, 60, 98, 55, 73, 92, 29, 32, 37, 2, 13, 26, 50, 93, 82, 77, 31, 59, 91, 52, 52, 42, 70, 31, 92, 46, 19, 59, 79, 87, 62, 25, 22, 57, 11, 40, 46, 29, 60, 57, 37], [52, 73, 62, 86, 43, 59, 48, 9, 71, 90, 95, 39, 68, 64, 90, 25, 65, 50, 45, 25, 32, 90, 93, 79, 50, 42, 37, 9, 46, 17, 44, 83, 53, 23, 82, 30, 57, 35, 21, 48, 46, 1, 38, 38, 48, 51, 99, 99, 28], [71, 15, 96, 82, 95, 23, 68, 39, 4, 30, 49, 58, 1, 91, 57, 23, 15, 59, 98, 36, 64, 7, 72, 45, 69, 49, 25, 3, 65, 12, 57, 28, 34, 41, 14, 61, 55, 84, 32, 70, 93, 12, 74, 67, 50, 45, 17, 60, 55], [51, 46, 30, 7, 56, 94, 95, 46, 18, 72, 71, 29, 67, 18, 12, 39, 84, 15, 56, 68, 71, 98, 26, 64, 83, 45, 70, 68, 65, 47, 94, 54, 90, 62, 25, 77, 81, 54, 44, 1, 27, 72, 50, 45, 42, 60, 11, 99, 19], [85, 67, 94, 8, 11, 67, 24, 97, 22, 41, 45, 56, 4, 59, 14, 95, 60, 35, 52, 38, 73, 2, 67, 54, 37, 15, 88, 53, 20, 20, 98, 94, 69, 44, 48, 6, 3, 22, 1, 97, 78, 20, 64, 99, 39, 60, 64, 48, 97], [8, 26, 4, 9, 25, 32, 34, 80, 48, 56, 59, 21, 42, 94, 62, 18, 99, 74, 77, 26, 51, 91, 79, 20, 43, 79, 10, 37, 53, 62, 41, 31, 89, 18, 79, 89, 69, 86, 28, 94, 71, 27, 17, 29, 75, 94, 91, 86, 97], [49, 81, 5, 68, 41, 85, 73, 58, 47, 36, 93, 56, 85, 97, 92, 14, 95, 30, 94, 5, 95, 61, 11, 46, 99, 88, 30, 1, 5, 99, 83, 25, 91, 79, 60, 74, 91, 22, 19, 21, 75, 87, 98, 75, 80, 40, 47, 21, 21], [88, 90, 31, 75, 50, 83, 38, 23, 51, 66, 47, 13, 78, 94, 58, 46, 1, 86, 14, 83, 63, 97, 81, 96, 17, 34, 68, 90, 74, 96, 27, 90, 82, 86, 92, 93, 70, 72, 19, 90, 75, 2, 43, 85, 53, 40, 56, 47, 15], [55, 26, 54, 52, 66, 72, 79, 80, 30, 42, 35, 48, 67, 94, 95, 9, 76, 53, 42, 11, 9, 52, 1, 81, 35, 86, 27, 83, 71, 22, 50, 30, 32, 35, 43, 65, 96, 75, 81, 37, 21, 43, 51, 57, 78, 48, 62, 98, 66], [97, 93, 36, 10, 47, 33, 79, 54, 36, 6, 25, 62, 95, 60, 71, 17, 72, 41, 26, 67, 23, 11, 62, 46, 30, 10, 87, 32, 92, 34, 23, 34, 27, 30, 44, 46, 64, 28, 93, 60, 98, 46, 47, 66, 37, 52, 58, 43, 45], [98, 59, 98, 53, 80, 39, 88, 30, 86, 95, 24, 10, 55, 90, 27, 78, 16, 8, 59, 14, 36, 36, 66, 95, 75, 73, 7, 83, 81, 75, 26, 96, 49, 42, 82, 75, 20, 7, 50, 92, 89, 12, 46, 92, 36, 94, 48, 59, 95], [11, 72, 86, 5, 87, 85, 61, 66, 57, 15, 50, 45, 95, 47, 47, 39, 60, 26, 24, 68, 21, 26, 8, 11, 74, 41, 55, 82, 88, 88, 15, 97, 9, 91, 86, 26, 60, 89, 71, 1, 2, 37, 53, 88, 88, 22, 19, 36, 48], [90, 10, 35, 43, 40, 38, 58, 19, 63, 36, 80, 86, 4, 13, 26, 19, 77, 49, 68, 72, 80, 42, 57, 58, 12, 88, 67, 54, 73, 55, 53, 68, 6, 60, 65, 98, 42, 81, 38, 11, 79, 90, 3, 35, 81, 87, 95, 99, 25], [87, 42, 10, 89, 98, 84, 61, 9, 81, 79, 96, 1, 67, 76, 61, 43, 81, 22, 75, 93, 50, 90, 59, 58, 94, 23, 13, 77, 67, 69, 9, 84, 95, 4, 17, 56, 34, 59, 78, 24, 29, 33, 47, 95, 60, 84, 52, 68, 78], [50, 57, 35, 13, 11, 96, 43, 27, 78, 52, 22, 73, 27, 58, 6, 20, 51, 57, 66, 2, 92, 55, 88, 64, 64, 22, 95, 58, 53, 54, 44, 91, 32, 21, 84, 22, 58, 64, 35, 68, 14, 68, 99, 94, 55, 26, 75, 8, 59], [13, 56, 30, 50, 9, 30, 68, 42, 25, 48, 64, 57, 76, 30, 61, 57, 84, 27, 77, 47, 10, 9, 40, 67, 37, 68, 54, 80, 72, 28, 26, 13, 7, 20, 81, 26, 43, 66, 16, 95, 19, 18, 18, 29, 68, 59, 4, 31, 40], [8, 68, 45, 50, 46, 5, 64, 34, 57, 99, 90, 35, 50, 19, 2, 39, 61, 81, 67, 95, 42, 14, 31, 82, 36, 42, 73, 16, 67, 48, 65, 22, 65, 88, 84, 84, 91, 76, 36, 43, 33, 68, 70, 7, 41, 92, 3, 10, 37], [10, 37, 21, 61, 80, 35, 87, 10, 97, 91, 86, 92, 13, 26, 11, 12, 28, 78, 51, 94, 16, 20, 5, 78, 99, 42, 70, 34, 80, 61, 58, 6, 95, 51, 57, 58, 69, 75, 15, 36, 49, 71, 64, 87, 69, 5, 48, 77, 20], [8, 80, 16, 89, 60, 95, 60, 48, 17, 60, 91, 24, 40, 46, 25, 44, 64, 2, 90, 9, 8, 66, 36, 63, 89, 76, 5, 34, 79, 20, 18, 50, 9, 25, 17, 94, 95, 84, 84, 98, 90, 44, 27, 18, 96, 65, 38, 17, 18], [24, 26, 1, 41, 26, 67, 32, 84, 65, 53, 53, 87, 3, 22, 85, 23, 39, 83, 5, 5, 7, 71, 51, 25, 94, 78, 50, 84, 81, 23, 61, 17, 28, 52, 94, 59, 50, 74, 57, 27, 91, 94, 92, 10, 24, 81, 67, 66, 79], [78, 64, 98, 56, 21, 88, 2, 86, 43, 17, 84, 55, 1, 23, 47, 56, 15, 92, 28, 84, 48, 13, 58, 48, 18, 97, 30, 63, 91, 95, 28, 85, 3, 38, 17, 18, 32, 65, 33, 6, 78, 63, 42, 96, 68, 49, 75, 76, 98], [67, 87, 83, 38, 2, 96, 10, 65, 83, 24, 4, 35, 44, 21, 30, 21, 12, 78, 29, 14, 80, 20, 63, 34, 52, 42, 91, 56, 19, 31, 84, 91, 58, 64, 48, 62, 2, 95, 17, 19, 9, 83, 93, 47, 67, 52, 83, 34, 21], [60, 48, 17, 82, 88, 76, 45, 26, 97, 33, 39, 41, 98, 28, 1, 46, 27, 31, 32, 30, 79, 76, 19, 98, 24, 39, 5, 24, 99, 65, 16, 27, 19, 49, 50, 76, 39, 21, 59, 4, 71, 59, 74, 58, 92, 81, 60, 70, 81]], [[18]], [[0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1], [1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0], [1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 0], [0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0], [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0], [0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1], [1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1], [0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1], [1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0], [1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1], [0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0], [0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0], [1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1], [0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0], [1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0], [0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1], [1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1], [1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1], [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1], [0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0], [0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0], [0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1], [1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0], [1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0], [1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0], [1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1], [0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1], [0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 1], [0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1], [0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0], [0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 0], [1, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1], [0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 0], [1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1], [1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1], [0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0], [1, 1, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0], [0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0], [0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1], [1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0], [0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1], [1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1]], [[3, 15, 34, 40, 66, 69, 71, 88], [6, 14, 42, 43, 51, 52, 58, 72], [14, 15, 17, 21, 78, 80, 87, 93], [7, 15, 19, 20, 25, 31, 68, 69], [1, 3, 6, 68, 83, 83, 86, 97], [17, 30, 52, 54, 58, 79, 81, 83], [1, 32, 43, 48, 70, 80, 93, 97], [3, 5, 12, 47, 49, 52, 74, 78]], [[-56, 56, 12, -42, 38, -78, 22, -30], [-24, -28, -80, -6, 18, -2, 76, -8], [-46, -74, -48, -98, 32, 52, 60, 48], [42, -46, -84, 44, -86, 72, 8, 70], [80, 90, 50, -26, -98, 84, 8, -52], [-78, -46, 26, 2, -30, -20, -8, 18], [98, 42, 62, 74, -30, -18, 26, -42], [90, 34, 12, -88, -60, -92, -10, -60]], [[0, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 0, 0, 0, 0, 0, 1], [0, 0, 0, 0, 0, 0, 0, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 0, 0, 0, 1, 1, 1, 1], [0, 0, 0, 0, 0, 0, 1, 1, 1], [0, 0, 0, 1, 1, 1, 1, 1, 1], [0, 0, 1, 1, 1, 1, 1, 1, 1]], [[14, 22, 81, 76, 33, 79, 91, 2, 42, 5, 11, 94, 9, 49, 25, 93, 44, 25, 71, 66, 25, 30, 57, 55, 25, 10, 76, 34, 90, 55, 54, 41], [93, 50, 13, 70, 93, 30, 5, 44, 65, 70, 82, 31, 88, 11, 8, 95, 27, 52, 93, 35, 35, 72, 49, 59, 54, 51, 63, 50, 22, 53, 33, 54], [69, 1, 38, 60, 78, 26, 48, 16, 32, 82, 74, 80, 74, 84, 13, 58, 46, 84, 84, 39, 16, 84, 20, 81, 10, 52, 32, 33, 28, 23, 64, 52], [87, 97, 97, 85, 72, 28, 33, 38, 78, 93, 82, 50, 33, 89, 11, 93, 18, 73, 82, 22, 13, 40, 45, 64, 13, 1, 41, 27, 35, 58, 40, 86], [59, 71, 95, 38, 59, 97, 86, 84, 17, 52, 61, 37, 24, 40, 99, 88, 91, 51, 7, 32, 30, 2, 61, 64, 65, 1, 97, 86, 78, 22, 67, 10], [60, 60, 50, 9, 15, 68, 42, 35, 11, 9, 91, 9, 60, 94, 99, 34, 46, 21, 12, 92, 67, 19, 74, 90, 96, 16, 32, 25, 40, 21, 78, 84], [88, 44, 57, 46, 1, 48, 15, 91, 85, 47, 52, 57, 82, 37, 28, 88, 35, 85, 66, 17, 88, 69, 91, 46, 44, 38, 20, 39, 27, 44, 47, 94], [32, 54, 58, 78, 33, 70, 52, 98, 49, 13, 25, 57, 99, 36, 93, 42, 96, 30, 56, 66, 43, 8, 17, 47, 67, 5, 97, 66, 65, 90, 97, 8], [32, 37, 20, 6, 56, 42, 36, 49, 56, 66, 91, 37, 3, 50, 56, 80, 49, 80, 57, 11, 68, 32, 76, 92, 45, 27, 63, 28, 21, 74, 31, 80], [32, 82, 42, 52, 68, 46, 3, 65, 48, 75, 32, 30, 62, 55, 70, 31, 81, 80, 78, 71, 40, 20, 96, 20, 91, 38, 69, 42, 4, 63, 21, 54], [91, 99, 6, 10, 30, 30, 98, 73, 48, 33, 58, 75, 52, 55, 65, 4, 78, 28, 90, 18, 30, 97, 69, 34, 64, 6, 64, 83, 5, 26, 77, 51], [70, 13, 73, 23, 38, 63, 40, 51, 18, 60, 37, 12, 52, 49, 68, 45, 24, 3, 82, 73, 66, 96, 22, 92, 29, 86, 66, 21, 6, 41, 56, 97], [42, 55, 69, 3, 21, 42, 44, 8, 69, 86, 41, 65, 62, 40, 21, 56, 92, 40, 60, 91, 9, 66, 32, 3, 16, 97, 36, 10, 56, 36, 65, 51], [43, 69, 10, 87, 94, 30, 21, 13, 89, 38, 57, 50, 55, 31, 10, 36, 79, 66, 71, 4, 29, 90, 72, 24, 24, 84, 2, 97, 84, 46, 5, 50], [14, 5, 93, 73, 7, 57, 29, 7, 13, 53, 19, 20, 15, 69, 4, 61, 20, 89, 4, 91, 84, 91, 11, 41, 67, 51, 20, 22, 26, 57, 82, 12], [44, 36, 65, 68, 45, 48, 92, 98, 39, 93, 30, 50, 75, 13, 22, 6, 61, 60, 74, 78, 62, 14, 51, 88, 17, 47, 49, 36, 41, 28, 8, 77], [73, 28, 20, 71, 44, 84, 58, 40, 44, 12, 8, 16, 70, 36, 34, 3, 89, 24, 15, 23, 19, 53, 67, 81, 5, 31, 37, 91, 63, 9, 12, 58], [67, 39, 73, 31, 31, 45, 71, 71, 56, 93, 60, 77, 73, 3, 12, 67, 71, 54, 81, 41, 60, 31, 94, 96, 43, 65, 99, 95, 14, 17, 48, 78], [95, 64, 57, 19, 83, 76, 74, 47, 80, 60, 90, 72, 21, 67, 66, 67, 34, 53, 86, 79, 2, 83, 76, 66, 19, 66, 86, 82, 82, 25, 1, 86], [3, 8, 21, 55, 35, 37, 20, 66, 21, 2, 12, 74, 68, 86, 46, 23, 35, 68, 35, 8, 64, 19, 6, 3, 14, 71, 68, 66, 8, 74, 34, 6], [32, 21, 43, 18, 61, 11, 88, 4, 99, 59, 40, 33, 86, 95, 44, 52, 97, 40, 31, 72, 86, 86, 20, 54, 77, 56, 77, 52, 88, 76, 58, 4], [41, 62, 38, 39, 75, 54, 52, 17, 7, 28, 72, 57, 26, 44, 85, 79, 37, 99, 39, 9, 47, 4, 28, 27, 6, 6, 87, 66, 83, 42, 19, 11], [53, 31, 97, 12, 33, 12, 98, 18, 68, 15, 40, 40, 19, 77, 20, 37, 20, 42, 95, 75, 84, 86, 50, 86, 34, 91, 74, 50, 20, 30, 56, 39], [4, 98, 74, 96, 97, 90, 64, 40, 45, 77, 34, 1, 15, 21, 74, 21, 51, 15, 42, 19, 53, 95, 48, 22, 2, 86, 35, 21, 70, 51, 99, 72], [71, 12, 90, 92, 38, 43, 40, 8, 51, 65, 79, 16, 5, 39, 75, 95, 2, 62, 50, 46, 44, 97, 15, 14, 81, 65, 71, 17, 69, 44, 41, 90], [79, 53, 94, 59, 58, 8, 50, 44, 73, 12, 33, 62, 90, 57, 98, 46, 32, 38, 16, 62, 53, 48, 49, 56, 17, 26, 95, 42, 85, 83, 12, 48], [43, 86, 56, 15, 13, 92, 83, 55, 85, 61, 53, 27, 16, 24, 42, 1, 95, 42, 20, 83, 46, 90, 46, 67, 58, 55, 32, 84, 40, 19, 7, 28], [70, 21, 57, 89, 23, 71, 62, 51, 44, 78, 23, 22, 43, 83, 86, 73, 96, 82, 52, 74, 45, 37, 46, 54, 23, 87, 59, 77, 96, 83, 94, 44], [65, 73, 74, 45, 55, 37, 84, 64, 29, 35, 86, 13, 14, 38, 28, 94, 39, 91, 6, 66, 28, 96, 74, 48, 93, 71, 95, 91, 25, 33, 97, 28], [26, 99, 94, 14, 64, 28, 5, 9, 26, 31, 36, 88, 56, 60, 10, 56, 6, 74, 48, 93, 13, 22, 99, 43, 35, 13, 46, 52, 79, 34, 87, 16], [90, 21, 62, 63, 17, 14, 78, 40, 64, 35, 46, 92, 68, 49, 1, 91, 90, 8, 60, 52, 34, 81, 73, 62, 75, 16, 33, 40, 1, 61, 88, 75], [10, 61, 27, 86, 2, 14, 32, 60, 68, 75, 21, 85, 49, 78, 99, 75, 53, 79, 16, 55, 83, 70, 7, 8, 86, 83, 48, 34, 73, 5, 69, 56]]]; int [] param1 = [0, 10, 31, 48, 0, 40, 4, 4, 4, 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); } " SCHEDULE_JOBS_SERVER_GETS_EQUAL_LOAD,"static int f_filled ( int a [ ] , int b [ ] , int n ) { int i ; int s = 0 ; for ( i = 0 ; i < n ; i ++ ) s += ( a [ i ] + b [ i ] ) ; if ( n == 1 ) return a [ 0 ] + b [ 0 ] ; if ( s % n != 0 ) return - 1 ; int x = s / n ; for ( i = 0 ; i < n ; i ++ ) { if ( a [ i ] > x ) return - 1 ; if ( i > 0 ) { a [ i ] += b [ i - 1 ] ; b [ i - 1 ] = 0 ; } if ( a [ i ] == x ) continue ; int y = a [ i ] + b [ i ] ; if ( i + 1 < n ) y += b [ i + 1 ] ; if ( y == x ) { a [ i ] = y ; b [ i ] = 0 ; continue ; } if ( a [ i ] + b [ i ] == x ) { a [ i ] += b [ i ] ; b [ i ] = 0 ; continue ; } if ( i + 1 < n && a [ i ] + b [ i + 1 ] == x ) { a [ i ] += b [ i + 1 ] ; b [ i + 1 ] = 0 ; continue ; } return - 1 ; } for ( i = 0 ; i < n ; i ++ ) if ( b [ i ] != 0 ) return - 1 ; return x ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, -1, -1, -1, -1, 81, -1, -1, -1]; int [] [] param0 = [[4, 9, 16, 18, 20, 23, 24, 25, 25, 26, 29, 30, 35, 40, 41, 43, 44, 46, 53, 53, 56, 56, 58, 60, 62, 70, 80, 80, 80, 82, 86, 90, 92, 92, 95], [-24, 70, -74, -90, 72, 50, -94, 86, -58, -68, 42, 0, 98, -70, -14, -32, 6, 74, 64, -78, 86, -42, -56, 2, -34, -46, 70, -62, 50, -58, -58, 42, 86, 96, -8, 8, -22, -14, -14, 98, 2, 98, -28], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [98, 18, 50, 36, 88, 75, 2, 40, 74, 19, 63, 82, 77, 5, 59, 97, 70, 50, 71, 90, 90, 61, 63, 99], [-80, -64, -64, -64, -64, -62, -54, -48, -44, -44, -38, -30, -30, -26, -14, -12, -10, -6, -6, 6, 22, 22, 22, 26, 28, 50, 52, 70, 86, 86, 88, 90], [0, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1], [59, 61, 64], [98, 92, 28, 42, -74, -36, 40, -8, 32, -22, -70, -22, -56, 74, 6, 6, -62, 46, 34, 2], [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], [72, 97, 79, 21, 83, 2, 31, 59, 6, 11, 79, 97]]; int [] [] param1 = [[3, 15, 16, 16, 18, 26, 30, 32, 32, 35, 37, 41, 42, 43, 48, 49, 49, 54, 55, 57, 65, 66, 67, 67, 68, 83, 85, 89, 89, 90, 91, 93, 96, 97, 99], [-26, 36, 48, 48, -38, -86, 90, -62, 30, -4, 82, 16, 32, -6, 58, 82, -66, -40, 52, -78, 94, -70, -80, -68, -58, -26, 50, -78, -90, -48, -28, 48, 56, 50, 72, -22, -2, 8, -94, 92, -44, -66, -30], [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [93, 25, 16, 42, 55, 61, 69, 68, 95, 28, 40, 90, 1, 86, 76, 40, 13, 47, 71, 4, 64, 54, 84, 45], [-96, -94, -80, -74, -64, -56, -52, -32, -30, -24, -12, -12, -8, -2, 4, 8, 16, 20, 24, 24, 24, 48, 50, 54, 60, 64, 74, 80, 88, 90, 92, 92], [1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1], [22, 59, 85], [-62, -84, 72, 60, 10, -18, -44, -22, 14, 0, 76, 72, 96, -28, -24, 52, -74, -30, 16, 66], [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, 71, 87, 36, 73, 37, 80, 34, 57, 17, 88, 52]]; int [] param2 = [29, 34, 13, 16, 22, 20, 1, 18, 34, 9]; 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); } " SEARCHING_ARRAY_ADJACENT_DIFFER_K,"static int f_filled ( int arr [ ] , int n , int x , int k ) { int i = 0 ; while ( i < n ) { if ( arr [ i ] == x ) return i ; i = i + Math . max ( 1 , Math . abs ( arr [ i ] - x ) / k ) ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, -1, -1, -1, -1, -1, -1, -1, -1, 0]; int [] [] param0 = [[1, 5, 9, 11, 14, 18, 19, 21, 26, 32, 38, 38, 43, 47, 49, 52, 55, 61, 65, 67, 69, 73, 74, 79, 84, 90, 91, 91, 92, 93, 94, 99], [12, -86, -66, -50, -48, 78, -92, -56, -2, 66, 64], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [10, 87, 39, 87, 45, 33, 5, 37, 70, 69, 88, 78, 90, 3], [-78, -70, -68, -60, -52, -34, -24, -4, 12, 18, 58, 58, 64, 76, 84, 94], [0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0], [5, 5, 7, 11, 11, 15, 22, 23, 28, 38, 41, 53, 54, 57, 59, 68, 71, 89], [-4, 0, 60, -14, -48, 54, -96, -68, -40, 64, -50, -74, -20, -22, 48, -48, 42, 62, 66, 84, 54, -52, -52, 6, 46, -90, -18, 90], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [30, 91, 34, 44, 3, 76, 43, 75, 49, 33, 74, 72, 68, 79, 26, 62, 23, 5, 32, 75, 82, 25, 7, 19, 32, 87, 87, 94, 34, 62, 3, 32, 59]]; int [] param1 = [22, 5, 35, 9, 14, 26, 16, 18, 9, 32]; int [] param2 = [19, 10, 37, 8, 9, 36, 17, 14, 8, 30]; int [] param3 = [26, 5, 43, 10, 13, 32, 16, 23, 9, 24]; 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); } " SEARCH_ALMOST_SORTED_ARRAY,"static int f_filled ( int arr [ ] , int l , int r , int x ) { if ( r >= l ) { int mid = l + ( r - l ) / 2 ; if ( arr [ mid ] == x ) return mid ; if ( mid > l && arr [ mid - 1 ] == x ) return ( mid - 1 ) ; if ( mid < r && arr [ mid + 1 ] == x ) return ( mid + 1 ) ; if ( arr [ mid ] > x ) return f_filled ( arr , l , mid - 2 , x ) ; return f_filled ( arr , mid + 2 , r , x ) ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [12, 11, 1, -1, 2, -1, -1, -1, -1, -1]; int [] [] param0 = [[6, 7, 15, 42, 47, 54, 56, 59, 59, 64, 68, 70, 71, 75, 91, 93], [6, 7, 15, 42, 47, 56, 54, 59, 59, 64, 68, 71, 70, 75, 91, 93], [-92, -96, -68, -40, 70], [-92, -86, -68, -40, 70], [-3, -1, 0, 30, 10, 45, 70, 60], [-3, -1, 0, 10, 5, 45, 60, 50], [-3, -1, 0, 10, 30, 45, 60, 70], [0, 0, 1], [1, 1, 1], [30, 2, 30, 45]]; int [] param1 = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; int [] param2 = [15, 15, 4, 4, 7, 7, 7, 2, 2, 3]; int [] param3 = [71, 71, -96, 20, 0, 12, 18, 20, 17, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SEARCH_AN_ELEMENT_IN_AN_ARRAY_WHERE_DIFFERENCE_BETWEEN_ADJACENT_ELEMENTS_IS_1,"static int f_filled ( int arr [ ] , int n , int x ) { int i = 0 ; while ( i < n ) { if ( arr [ i ] == x ) return i ; i = i + Math . abs ( arr [ i ] - x ) ; } return - 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); } " SEARCH_AN_ELEMENT_IN_A_SORTED_AND_PIVOTED_ARRAY,"static int f_filled ( int arr [ ] , int l , int h , int key ) { if ( l > h ) return - 1 ; int mid = ( l + h ) / 2 ; if ( arr [ mid ] == key ) return mid ; if ( arr [ l ] <= arr [ mid ] ) { if ( key >= arr [ l ] && key <= arr [ mid ] ) return f_filled ( arr , l , mid - 1 , key ) ; return f_filled ( arr , mid + 1 , h , key ) ; } if ( key >= arr [ mid ] && key <= arr [ h ] ) return f_filled ( arr , mid + 1 , h , key ) ; return f_filled ( arr , l , mid - 1 , key ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 1, 3, -1, -1, -1, -1, -1, -1, -1]; int [] [] param0 = [[5, 6, 7, 8, 9, 10, 1, 2, 3], [30, 40, 50, 10, 20], [40, 50, 55, 67, 70, 4, 5, 6, 7], [14, 41, 38, 67, 99, 11, 96, 52, 4, 29, 22, 57, 3, 45, 14, 76, 70, 38, 93, 5, 74, 50, 18, 17, 20, 34, 51, 69, 86, 73], [-90, -88, -88, -82, -62, -44, -38, -38, -36, -34, -34, -32, -30, -28, -28, -26, -24, -20, -16, -16, -16, -6, -6, 2, 6, 8, 10, 14, 18, 18, 46, 50, 50, 54, 56, 58, 58, 60, 62, 70, 70, 74, 82, 84, 88, 94, 96], [1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0], [4, 7, 9, 10, 10, 11, 14, 16, 17, 21, 25, 27, 31, 34, 34, 34, 38, 41, 42, 42, 52, 56, 56, 58, 60, 66, 67, 68, 68, 70, 72, 74, 76, 82, 88, 88, 88, 89, 91, 93, 94, 95, 95], [92, 60, -60, 64, 18, 70, 56, 34, 58, 14, 28, -72, -22, -74, -46, -28, 64, 88, 18, -50, -14, -20, 64, 6, -4, -98, 60, 98, 84, -58, -98, 66, 80, 68, -42, -58, 82, 90, -72, 34, 34, 80, 88, -64, 66, -20, -26], [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], [33, 18, 98, 47, 76, 58, 29, 68, 62, 78, 12, 95, 20, 88, 39, 12, 43, 45, 5, 45, 96, 64, 38, 28, 70, 25, 65, 79, 39]]; int [] param1 = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; int [] param2 = [8, 4, 9, 16, 24, 10, 23, 25, 40, 16]; int [] param3 = [3, 40, 67, 15, 24, 10, 39, 25, 29, 28]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SEARCH_INSERT_AND_DELETE_IN_AN_UNSORTED_ARRAY,"static int f_filled ( int arr [ ] , int n , int key ) { for ( int i = 0 ; i < n ; i ++ ) if ( arr [ i ] == key ) return i ; return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 1, 0, 8, -1, -1, -1, -1, -1, -1]; int [] [] param0 = [[4, 8, 11, 23, 55, 57, 73, 74, 77, 79, 93], [-88, 12, -62, -66, -24, 18, 12, 22, 94, 30, -50, -42, -94, 18, 76, -6, -48, -68, 48, 36, -78, 52, -82, 76, 2, -44, -10, 88], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1], [33, 9, 93, 70, 81, 70, 56, 66, 72, 81, 74, 32, 71, 72, 3, 81, 70, 22, 82, 2, 75, 18, 90, 29, 48], [-98, -70, -62, -60, -60, -54, -48, -48, -46, -44, -34, -26, -18, -6, 4, 18, 28, 32, 34, 40, 50, 54, 56, 62, 64, 64, 98], [1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1], [4, 6, 7, 10, 10, 12, 13, 18, 23, 29, 29, 34, 46, 54, 60, 61, 63, 67, 69, 70, 72, 76, 79, 79, 81, 82, 88, 90, 99], [94, 34, -60, -74, 86, 80, 68, -48, 78, -62, -98, -44, -44, 92, -94, -86, -36, 12, 84, -90, 52, 42, -42, -66, 88, 76, 66], [0, 0, 0, 1], [76, 59, 38, 83, 38, 93, 27, 11, 17, 80, 26, 28, 35, 53, 88, 10, 9, 75]]; int [] param1 = [8, 27, 11, 24, 18, 17, 15, 21, 2, 12]; int [] param2 = [11, 12, 0, 72, 23, 16, 28, 16, 3, 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); } " SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY,"static int f_filled ( int arr [ ] , int low , int high , int key ) { if ( high < low ) return - 1 ; int mid = ( low + high ) / 2 ; if ( key == arr [ mid ] ) return mid ; if ( key > arr [ mid ] ) return f_filled ( arr , ( mid + 1 ) , high , key ) ; return f_filled ( arr , low , ( mid - 1 ) , key ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, -1, -1, -1, -1, -1, -1, -1, -1, -1]; int [] [] param0 = [[2, 10, 73, 91, 98], [30, 24, 24, -8, 64, 50, 46, -76, 26, 8, -92, -78, 40, -86, 96, 14, 60, 38, 6, -72, -6, -20, 26, -26, 0, 2], [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], [30, 79, 3, 76, 18], [-96, -90, -88, -84, -78, -78, -70, -68, -66, -66, -64, -64, -58, -56, -52, -42, -40, -38, -36, -30, -30, -28, -14, -8, 0, 14, 16, 22, 24, 26, 36, 40, 40, 48, 48, 50, 52, 54, 54, 58, 64, 74, 82, 88, 94], [1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1], [2, 8, 8, 14, 15, 16, 17, 17, 18, 18, 24, 25, 25, 26, 36, 37, 39, 39, 40, 44, 46, 47, 51, 54, 56, 57, 57, 61, 61, 67, 68, 69, 72, 76, 77, 81, 82, 82, 82, 85, 85, 87, 94, 94, 98, 99], [-4, 84, 20, -84, -6, -78, 20, 56, 40, 0, 98, 80, -94, 36, -6, -98, 50, 66, -12, -58, -34, 68, -80, -30, -82, -76, -38, -60, 92, 94, 48, -84, 20, -66, -32, -92, 16, -96, -68, 94, -46, 30, 32, -34, 96, -92, -96, -86, -22], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [71, 70, 13, 18, 70, 62, 88, 27, 17, 44, 89, 28, 74, 41, 20, 91, 95, 79, 40, 43, 38, 20, 5]]; int [] param1 = [2, 20, 30, 3, 35, 25, 33, 34, 19, 21]; int [] param2 = [4, 13, 27, 2, 30, 26, 40, 27, 13, 22]; int [] param3 = [4, 21, 29, 2, 40, 30, 26, 34, 19, 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])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SEARCH_INSERT_AND_DELETE_IN_A_SORTED_ARRAY_1,"static int f_filled ( int arr [ ] , int n , int key , int capacity ) { if ( n >= capacity ) return n ; int i ; for ( i = n - 1 ; ( i >= 0 && arr [ i ] > key ) ; i -- ) arr [ i + 1 ] = arr [ i ] ; arr [ i + 1 ] = key ; return ( n + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 7, 13, 21, 30, 12, 13, 38, 3, 24]; int [] [] param0 = [[69], [-34, -38, -72, 90, -84, -40, 6, -52, -12, 80, -4, -58], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1], [96, 34, 11, 1, 36, 79, 64, 75, 75, 96, 32, 18, 25, 79, 63, 80, 90, 75, 44, 71, 48, 1, 62, 53, 17, 98], [-98, -92, -92, -84, -82, -80, -80, -74, -70, -60, -48, -42, -36, -34, -34, -34, -30, -28, -16, -6, -2, -2, 2, 12, 14, 20, 24, 40, 46, 50, 60, 66, 70, 72, 78, 82, 88, 92, 94, 94, 96], [1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0], [10, 12, 12, 13, 19, 20, 21, 24, 27, 37, 47, 50, 54, 58, 61, 63, 63, 68, 73, 75, 87, 90, 90, 92, 92], [-74, 62, 74, 92, -38, -28, -26, 4, 88, -68, -76, -20, -4, 12, 72, 6, 42, 36, 88, -96, -80, 90, 80, -26, -36, -72, -62, 38, -20, 40, -10, -22, -20, 38, 82, -84, 8, 26, 86, -26, 44, -72, -70, -16, -22, 18, -16, 76, -50], [1, 1, 1, 1, 1], [64, 80, 47, 58, 41, 3, 85, 96, 51, 4, 22, 89, 67, 54, 88, 15, 83, 31, 19, 24, 28, 40, 67, 37, 63, 38, 27, 14, 7, 68]]; int [] param1 = [0, 6, 13, 21, 30, 12, 12, 37, 3, 23]; int [] param2 = [0, 6, 19, 20, 32, 9, 13, 26, 4, 24]; int [] param3 = [0, 9, 11, 13, 28, 10, 21, 42, 2, 25]; 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); } " SEQUENCES_GIVEN_LENGTH_EVERY_ELEMENT_EQUAL_TWICE_PREVIOUS,"static int f_filled ( int m , int n ) { if ( m < n ) return 0 ; if ( n == 0 ) return 1 ; return f_filled ( m - 1 , n ) + f_filled ( m / 2 , n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 484, 0, 0, 0, 0, 0]; int [] param0 = [38, 39, 24, 90, 44, 49, 58, 97, 99, 19]; int [] param1 = [34, 29, 99, 23, 2, 70, 84, 34, 72, 67]; 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,"static int f_filled ( int m , int n ) { int T [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ; for ( int i = 0 ; i < m + 1 ; i ++ ) { for ( int j = 0 ; j < n + 1 ; j ++ ) { if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0 ; else if ( i < j ) T [ i ] [ j ] = 0 ; else if ( j == 1 ) T [ i ] [ j ] = i ; else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ] ; } } return T [ m ] [ n ] ; }","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); } " SMALLEST_DIFFERENCE_PAIR_VALUES_TWO_UNSORTED_ARRAYS,"static int f_filled ( int A [ ] , int B [ ] , int m , int n ) { Arrays . sort ( A ) ; Arrays . sort ( B ) ; int a = 0 , b = 0 ; int result = Integer . MAX_VALUE ; while ( a < m && b < n ) { if ( Math . abs ( A [ a ] - B [ b ] ) < result ) result = Math . abs ( A [ a ] - B [ b ] ) ; if ( A [ a ] < B [ b ] ) a ++ ; else b ++ ; } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]; int [] [] param0 = [[2, 2, 11, 13, 18, 18, 23, 25, 28, 28, 37, 39, 53, 56, 67, 70, 74, 74, 75, 79, 80, 82, 84, 89, 94, 95, 95, 98, 98], [-94, -78, -78, -72, -72, -72, -70, -70, -64, -62, -50, -48, -48, -44, -44, -40, -36, -36, -30, -24, -24, -22, -12, -10, -8, -4, -4, 0, 6, 10, 22, 30, 38, 56, 62, 72, 86], [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, 9, 15, 24, 28, 28, 39, 47, 57, 61, 71, 82, 90], [-92, -90, -90, -28, -16, -14, -14, -8, 42, 52, 62, 84], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [6, 7, 7, 12, 15, 15, 21, 24, 26, 26, 28, 36, 38, 42, 46, 52, 55, 56, 59, 62, 63, 65, 65, 66, 68, 71, 73, 77, 77, 77, 77, 85, 87, 87, 88, 90, 93, 94, 98], [-82, -68, -68, -60, -60, -38, -20, -16, 4, 18, 18, 22, 24, 30, 34, 44, 70, 78, 88, 90, 94], [0, 0, 1], [2, 7, 7, 9, 14, 15, 16, 20, 21, 26, 35, 37, 40, 45, 46, 47, 53, 56, 58, 61, 62, 67, 70, 70, 71, 73, 81, 85, 85, 90, 94, 98, 99]]; int [] [] param1 = [[5, 6, 11, 13, 13, 16, 17, 19, 23, 25, 28, 31, 31, 39, 41, 44, 45, 52, 62, 64, 70, 71, 73, 78, 78, 79, 85, 86, 92], [-98, -98, -90, -84, -80, -78, -68, -62, -52, -50, -42, -30, -26, -24, -24, -24, -12, 2, 10, 14, 18, 22, 26, 26, 36, 42, 50, 60, 62, 64, 64, 72, 76, 78, 84, 86, 92], [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], [11, 26, 27, 41, 47, 49, 51, 54, 70, 77, 84, 85, 92], [-98, -98, -58, -6, 14, 16, 18, 46, 52, 52, 52, 56], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 3, 4, 4, 6, 7, 8, 8, 15, 17, 18, 18, 20, 23, 23, 24, 25, 25, 26, 33, 39, 43, 46, 54, 59, 67, 69, 69, 69, 69, 76, 76, 81, 81, 85, 86, 86, 91, 95], [-74, -68, -64, -62, -60, -52, -50, -44, -36, -34, -32, -30, -20, -18, -14, -2, 18, 62, 62, 84, 98], [0, 0, 1], [1, 7, 14, 16, 18, 19, 24, 27, 28, 29, 29, 37, 41, 44, 45, 48, 49, 55, 64, 67, 67, 71, 72, 79, 80, 84, 86, 88, 88, 92, 94, 98, 99]]; int [] param2 = [29, 37, 26, 13, 12, 45, 39, 21, 3, 33]; int [] param3 = [29, 37, 26, 13, 12, 45, 39, 21, 3, 33]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i], param3[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS,"static int f_filled ( int x , int y , int z ) { int c = 0 ; while ( x != 0 && y != 0 && z != 0 ) { x -- ; y -- ; z -- ; c ++ ; } return c ; }","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); } " SMALLEST_OF_THREE_INTEGERS_WITHOUT_COMPARISON_OPERATORS_1,"static int f_filled ( int x , int y , int z ) { int c = 0; while (x != 0 && y != 0 && z != 0) { x--; y--; z--; c++; } return c; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [48, 11, 50, 21, 39, 22, 3, 62, 2, 1]; int [] param0 = [48, 11, 50, 21, 94, 22, 3, 67, 59, 50]; int [] param1 = [63, 55, 89, 71, 39, 44, 41, 62, 2, 11]; int [] param2 = [56, 84, 96, 74, 42, 86, 68, 94, 83, 1]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N,"static int f_filled ( int n ) { int count = 0 ; if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ; while ( n != 0 ) { n >>= 1 ; count += 1 ; } return 1 << count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [16, 32, 1, 32, 128, 128, 64, 64, 128, 64]; int [] param0 = [13, 27, 1, 24, 98, 94, 36, 41, 74, 39]; 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); } " SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_1,"static int f_filled ( int n ) { int p = 1 ; if ( n > 0 && ( n & ( n - 1 ) ) == 0 ) return n ; while ( p < n ) p <<= 1 ; return p ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [32, 128, 128, 128, 64, 64, 32, 32, 64, 32]; int [] param0 = [31, 89, 92, 66, 38, 34, 17, 24, 54, 20]; 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); } " SMALLEST_POWER_OF_2_GREATER_THAN_OR_EQUAL_TO_N_2,"static int f_filled ( int n ) { n -- ; n |= n >> 1 ; n |= n >> 2 ; n |= n >> 4 ; n |= n >> 8 ; n |= n >> 16 ; n ++ ; return n ; }","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); } " SMALLEST_SUM_CONTIGUOUS_SUBARRAY,"static int f_filled ( int arr [ ] , int n ) { int min_ending_here = 2147483647 ; int min_so_far = 2147483647 ; for ( int i = 0 ; i < n ; i ++ ) { if ( min_ending_here > 0 ) min_ending_here = arr [ i ] ; else min_ending_here += arr [ i ] ; min_so_far = Math . min ( min_so_far , min_ending_here ) ; } return min_so_far ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, -58, 0, 1, -316, 0, 3, -402, 0, 1]; int [] [] param0 = [[2, 9, 13, 14, 15, 18, 19, 19, 25, 26, 29, 29, 29, 30, 31, 36, 37, 37, 38, 39, 39, 40, 40, 42, 42, 46, 50, 53, 58, 60, 62, 64, 65, 67, 68, 69, 72, 77, 78, 83, 85, 89, 90, 93, 95, 95, 97], [14, -58, 8, 78, -26, -20, -60, 42, -64, -12], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1], [44, 88, 20, 47, 69, 42, 26, 49, 71, 91, 18, 95, 9, 66, 60, 37, 47, 29, 98, 63, 15, 9, 80, 66, 1, 9, 57, 56, 20, 2, 1], [-78, -64, -62, -60, -52, 4, 8, 46, 72, 74], [0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 1], [3, 7, 16, 17, 23, 23, 23, 28, 29, 30, 34, 38, 40, 41, 43, 43, 44, 46, 51, 51, 51, 55, 57, 58, 61, 62, 66, 66, 67, 69, 70, 73, 75, 77, 79, 80, 85, 85, 87, 87, 93, 96], [80, 22, 38, 26, 62, -48, -48, 46, -54, 4, 76, 46, 48, 40, -92, -98, -88, 12, -42, -94, 76, -16, -82, 62, 18, -24], [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [85, 44, 1, 97, 50, 74, 62, 90, 3, 78, 8, 48, 96, 41, 36, 91, 57, 97, 85, 90, 78, 43, 28, 92, 85, 59, 29, 38, 34, 65, 20, 26, 27, 23, 71, 22, 47, 99, 68, 93, 67, 66, 69, 82, 98, 15, 44, 51, 65]]; int [] param1 = [24, 6, 8, 26, 8, 11, 38, 22, 13, 45]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SPACE_OPTIMIZED_SOLUTION_LCS,"static int f_filled ( String X , String Y ) { int m = X . length ( ) , n = Y . length ( ) ; int L [ ] [ ] = new int [ 2 ] [ n + 1 ] ; int bi = 0 ; for ( int i = 0 ; i < m ; i ++ ) { bi = i & 1 ; for ( int j = 0 ; j <= n ; j ++ ) { if ( i == 0 || j == 0 ) L [ bi ] [ j ] = 0 ; else if ( X . charAt ( i - 1 ) == Y . charAt ( j - 1 ) ) L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1 ; else L [ bi ] [ j ] = Math . max ( L [ 1 - bi ] [ j ] , L [ bi ] [ j - 1 ] ) ; } } return L [ bi ] [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 2, 1, 0, 3, 8, 0, 2, 2, 2]; string [] param0 = [""ynpjsv"", ""736519"", ""11010000100010"", ""v "", ""8311172"", ""100011101011"", ""u"", ""3943042"", ""101"", ""mpbff osizevam""]; string [] param1 = [""qtukjn"", ""07592"", ""0"", ""qgbqt"", ""157219329531"", ""1000001111"", ""yzkubtqlhp"", ""3859"", ""00010000101010"", ""wgsfgaqwtp""]; 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); } " SPLIT_N_MAXIMUM_COMPOSITE_NUMBERS,"static int f_filled ( int n ) { if ( n < 4 ) return - 1 ; int rem = n % 4 ; if ( rem == 0 ) return n / 4 ; if ( rem == 1 ) { if ( n < 9 ) return - 1 ; return ( n - 9 ) / 4 + 1 ; } if ( rem == 2 ) return ( n - 6 ) / 4 + 1 ; if ( rem == 3 ) { if ( n < 15 ) return - 1 ; return ( n - 15 ) / 4 + 2 ; } return 0 ; }","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); } " SQUARED_TRIANGULAR_NUMBER_SUM_CUBES,"static int f_filled ( int s ) { int sum = 0 ; for ( int n = 1 ; sum < s ; n ++ ) { sum += n * n * n ; if ( sum == s ) return n ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [-1, 3, -1, -1, -1, -1, -1, -1, -1, -1]; int [] param0 = [15, 36, 39, 43, 75, 49, 56, 14, 62, 97]; 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); } " SQUARE_PYRAMIDAL_NUMBER_SUM_SQUARES,"static int f_filled ( int s ) { int sum = 0 ; for ( int n = 1 ; sum < s ; n ++ ) { sum += n * n ; if ( sum == s ) return n ; } return - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 2, 3, 7, 8, -1, 11, -1, -1, -1]; int [] param0 = [1, 5, 14, 140, 204, 3, 506, 42, 4, 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); } " SQUARE_ROOT_OF_AN_INTEGER,"static int f_filled ( int x ) { if ( x == 0 || x == 1 ) return x ; int i = 1 , result = 1 ; while ( result <= x ) { i ++ ; result = i * i ; } return i - 1 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [9, 3, 3, 9, 8, 7, 7, 4, 9, 8]; int [] param0 = [89, 11, 14, 92, 76, 63, 51, 16, 83, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SQUARE_ROOT_OF_AN_INTEGER_1,"static int f_filled ( int x ) { if ( x == 0 || x == 1 ) return x ; int start = 1 , end = x , ans = 0 ; while ( start <= end ) { int mid = ( start + end ) / 2 ; if ( mid * mid == x ) return mid ; if ( mid * mid < x ) { start = mid + 1 ; ans = mid ; } else end = mid - 1 ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, 3, 6, 7, 1, 8, 8, 3, 8, 3]; int [] param0 = [40, 10, 46, 54, 1, 67, 64, 10, 75, 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); } " SQUARE_ROOT_OF_A_PERFECT_SQUARE,"static float f_filled ( float n ) { float x = n ; float y = 1 ; double e = 0.000001 ; while ( x - y > e ) { x = ( x + y ) / 2 ; y = n / x ; } return x ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ float [] results = [41.99589376968351, -3544.737136289062, 88.84373605423394, -3008.0331952533734, 78.45502015008492, -5799.751467314729, 90.74222584648552, -1829.5367705266551, 76.01465104349802, -7785.473710863676]; float [] param0 = [1763.655093333857, -3544.737136289062, 7893.209433000695, -3008.0331952533734, 6155.190186637041, -5799.751467314729, 8234.151546380555, -1829.5367705266551, 5778.227173218819, -7785.473710863676]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " STACK_PERMUTATIONS_CHECK_IF_AN_ARRAY_IS_STACK_PERMUTATION_OF_OTHER,"static boolean f_filled ( int ip [ ] , int op [ ] , int n ) { Queue < Integer > input = new LinkedList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { input . add ( ip [ i ] ) ; } Queue < Integer > output = new LinkedList < > ( ) ; for ( int i = 0 ; i < n ; i ++ ) { output . add ( op [ i ] ) ; } Stack < Integer > tempStack = new Stack < > ( ) ; while ( ! input . isEmpty ( ) ) { int ele = input . poll ( ) ; if ( ele == output . peek ( ) ) { output . poll ( ) ; while ( ! tempStack . isEmpty ( ) ) { if ( tempStack . peek ( ) == output . peek ( ) ) { tempStack . pop ( ) ; output . poll ( ) ; } else break ; } } else { tempStack . push ( ele ) ; } } return ( input . isEmpty ( ) && tempStack . isEmpty ( ) ) ; }","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); } " STEINS_ALGORITHM_FOR_FINDING_GCD,"static int f_filled ( int a , int b ) { if ( a == 0 ) return b ; if ( b == 0 ) return a ; int k ; for ( k = 0 ; ( ( a | b ) & 1 ) == 0 ; ++ k ) { a >>= 1 ; b >>= 1 ; } while ( ( a & 1 ) == 0 ) a >>= 1 ; do { while ( ( b & 1 ) == 0 ) b >>= 1 ; if ( a > b ) { int temp = a ; a = b ; b = temp ; } b = ( b - a ) ; } while ( b != 0 ) ; return a << k ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 1, 1, 1, 1, 3, 1, 1, 1, 2]; int [] param0 = [37, 58, 89, 75, 59, 84, 47, 37, 83, 28]; int [] param1 = [93, 13, 27, 14, 47, 39, 76, 75, 62, 58]; 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); } " STEINS_ALGORITHM_FOR_FINDING_GCD_1,"static int f_filled ( int a , int b ) { if ( a == b ) return a ; if ( a == 0 ) return b ; if ( b == 0 ) return a ; if ( ( ~ a & 1 ) == 1 ) { if ( ( b & 1 ) == 1 ) return f_filled ( a >> 1 , b ) ; else return f_filled ( a >> 1 , b >> 1 ) << 1 ; } if ( ( ~ b & 1 ) == 1 ) return f_filled ( a , b >> 1 ) ; if ( a > b ) return f_filled ( ( a - b ) >> 1 , b ) ; return f_filled ( ( b - a ) >> 1 , a ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 2, 6, 1, 1, 1, 5, 2, 3, 1]; int [] param0 = [52, 36, 12, 69, 45, 7, 45, 62, 96, 89]; int [] param1 = [29, 94, 6, 7, 11, 51, 55, 86, 63, 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); } " STOOGE_SORT,"static int f_filled ( int arr [ ] , int l , int h ) { if ( l >= h ) return arr[0]; if ( arr [ l ] > arr [ h ] ) { int t = arr [ l ] ; arr [ l ] = arr [ h ] ; arr [ h ] = t ; } if ( h - l + 1 > 2 ) { int t = ( h - l + 1 ) / 3 ; f_filled ( arr , l , h - t ) ; f_filled ( arr , l + t , h ) ; f_filled ( arr , l , h - t ) ; } return arr[0]; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [6, -13, 0, 7, 88, 1, 2, -31, 0, 77]; int [] [] param0 = [[6, 25, 42, 52, 53, 54, 58, 66, 67, 70], [-13, -98, 50, -63, 48, 3, -76, 12, -35, 93, 29, 17, 16, 5, -97, -54, -45, -25], [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], [7, 49, 26, 33, 48, 79, 2, 71, 32, 4, 20, 36], [88], [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0], [2, 2, 4, 5, 7, 12, 12, 14, 14, 16, 17, 29, 29, 31, 32, 39, 41, 47, 48, 49, 51, 54, 58, 58, 59, 60, 73, 78, 80, 81, 82, 83, 84, 85, 90, 95, 97, 99, 99], [-31, -55, 6, 37, 77, 61, 0, 46, -91, -38, 85, -71, 25, 14, 53, 43, 34], [0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [77, 68, 78, 97, 92, 52, 37, 8, 44, 98, 5, 69, 31, 45, 9, 32, 33, 67, 30, 76, 29, 3, 90, 57, 30, 9, 26, 2, 62, 3, 46, 68, 25, 51, 13, 44, 35, 55]]; int [] param1 = [6, 16, 28, 9, 0, 20, 28, 15, 12, 27]; int [] param2 = [6, 14, 24, 10, 0, 28, 29, 11, 17, 20]; 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); } " STRING_CONTAINING_FIRST_LETTER_EVERY_WORD_GIVEN_STRING_SPACES,"static String f_filled ( String str ) { String result = """" ; boolean v = true ; for ( int i = 0 ; i < str . length ( ) ; i ++ ) { if ( str . charAt ( i ) == ' ' ) { v = true ; } else if ( str . charAt ( i ) != ' ' && v == true ) { result += ( str . charAt ( i ) ) ; v = false ; } } return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""ta"", ""77267"", ""011"", ""kcoi"", ""2"", ""01"", ""ysw"", ""586"", ""0100"", ""q""]; string [] param0 = [""t a"", ""77 78 2 600 7"", ""011 10 10"", ""kv co o ir"", ""2"", ""0 11"", ""y st wghec"", ""58 824 6"", ""00 100 001 0111"", ""q""]; 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); } " STRING_K_DISTINCT_CHARACTERS_NO_CHARACTERS_ADJACENT,"static String f_filled ( int n , int k ) { String res = """" ; for ( int i = 0 ; i < k ; i ++ ) res = res + ( char ) ( 'a' + i ) ; int count = 0 ; for ( int i = 0 ; i < n - k ; i ++ ) { res = res + ( char ) ( 'a' + count ) ; count ++ ; if ( count == k ) count = 0 ; } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""abcdefg"", ""aaaaa"", ""abcdef"", ""abcdef"", ""abcde"", ""abcdefghi"", ""ababab"", ""abababab"", ""abcdab"", ""abc""]; int [] param0 = [6, 5, 1, 4, 5, 3, 6, 8, 6, 2]; int [] param1 = [7, 1, 6, 6, 5, 9, 2, 2, 4, 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); } " SUBARRAYS_DISTINCT_ELEMENTS,"static int f_filled ( int [ ] arr , int n ) { Set < Integer > s = new HashSet < > ( ) ; int j = 0 , ans = 0 ; for ( int i = 0 ; i < n ; i ++ ) { while ( j < n && ! s . contains ( arr [ j ] ) ) { s . add ( arr [ j ] ) ; j ++ ; } ans += ( ( j - i ) * ( j - i + 1 ) ) / 2 ; s . remove ( arr [ i ] ) ; } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [255, 335, 30, 13, 35, 4, 152, 1791, 29, 35]; int [] [] param0 = [[3, 4, 5, 6, 12, 15, 16, 17, 20, 20, 22, 24, 24, 27, 28, 34, 37, 39, 39, 41, 43, 49, 49, 51, 55, 62, 63, 67, 71, 74, 74, 74, 77, 84, 84, 89, 89, 97, 99], [-8, 54, -22, 18, 20, 44, 0, 54, 90, -4, 4, 40, -74, -16], [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], [36, 71, 36, 58, 38, 90, 17], [-90, -32, -16, 18, 38, 82], [1, 0, 1], [3, 11, 21, 25, 28, 28, 38, 42, 48, 53, 55, 55, 55, 58, 71, 75, 79, 80, 80, 94, 96, 99], [-16, -52, -4, -46, 54, 0, 8, -64, -82, -10, -62, -10, 58, 44, -28, 86, -24, 16, 44, 22, -28, -42, -52, 8, 76, -44, -34, 2, 88, -88, -14, -84, -36, -68, 76, 20, 20, -50], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [19, 13, 61, 32, 92, 90, 12, 81, 52]]; int [] param1 = [24, 13, 28, 4, 5, 2, 20, 35, 27, 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); } " SUBSEQUENCES_SIZE_THREE_ARRAY_WHOSE_SUM_DIVISIBLE_M,"static int f_filled ( int A [ ] , int N , int M ) { int sum = 0 ; int ans = 0 ; for ( int i = 0 ; i < N ; i ++ ) { for ( int j = i + 1 ; j < N ; j ++ ) { for ( int k = j + 1 ; k < N ; k ++ ) { sum = A [ i ] + A [ j ] + A [ k ] ; if ( sum % M == 0 ) ans ++ ; } } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 1, 19, 207, 120, 85, 2, 220, 92]; int [] [] param0 = [[14, 35, 56, 70, 88], [-50, -92, 16, -68, -36], [0, 0, 0, 1, 1, 1], [76, 43, 22, 41, 49, 99, 25, 40, 3, 45, 60, 16, 83, 62, 26, 93, 64, 73, 72, 53, 6, 32, 35, 67, 17], [-90, -86, -86, -66, -50, -48, -44, -42, -42, -38, -24, -22, -20, -18, -8, 8, 24, 28, 34, 48, 60, 62, 66, 68, 74, 76, 80, 82, 88], [1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0], [4, 5, 8, 9, 10, 12, 13, 16, 17, 18, 21, 21, 25, 27, 28, 30, 36, 36, 54, 55, 56, 57, 60, 62, 67, 67, 68, 71, 72, 72, 73, 73, 77, 77, 83, 86, 86, 86, 87, 89, 92, 92, 96, 97, 97, 98], [-64, 52, -32, 38, 8, -62, -56, 20, 72, -12, 32, 44], [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], [77, 68, 45, 6, 27, 19, 29, 95, 21, 2, 39, 48, 72, 67, 49, 45, 1, 16, 56, 78, 25, 22, 27, 40, 31, 34, 26, 35, 12]]; int [] param1 = [3, 3, 4, 14, 24, 24, 24, 6, 12, 25]; int [] param2 = [4, 4, 5, 21, 20, 30, 23, 6, 15, 25]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_BINOMIAL_COEFFICIENTS,"static int f_filled ( int n ) { int C [ ] [ ] = new int [ n + 1 ] [ n + 1 ] ; for ( int i = 0 ; i <= n ; i ++ ) { for ( int j = 0 ; j <= Math . min ( i , n ) ; j ++ ) { if ( j == 0 || j == i ) C [ i ] [ j ] = 1 ; else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ] ; } } int sum = 0 ; for ( int i = 0 ; i <= n ; i ++ ) sum += C [ n ] [ i ] ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [256, 512, 32, 16, 4, 64, 128, 4096, 1024, 8]; int [] param0 = [8, 9, 5, 4, 2, 6, 7, 12, 10, 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); } " SUM_BINOMIAL_COEFFICIENTS_1,"static int f_filled ( int n ) { return ( 1 << n ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [256, 4, 32, 128, 8, 2, 64, 512, 32768, 4096]; int [] param0 = [8, 2, 5, 7, 3, 1, 6, 9, 15, 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); } " SUM_DIVISORS_1_N_1,"static int f_filled ( int n ) { int sum = 0 ; for ( int i = 1 ; i <= n ; ++ i ) sum += ( n / i ) * i ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [4406, 1384, 1098, 660, 1987, 491, 5977, 2846, 5561, 1342]; int [] param0 = [73, 41, 36, 28, 49, 24, 85, 59, 82, 40]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_FACTORS_NUMBER,"static int f_filled ( int n ) { int result = 0 ; for ( int i = 2 ; i <= Math . sqrt ( n ) ; i ++ ) { if ( n % i == 0 ) { if ( i == ( n / i ) ) result += i ; else result += ( i + n / i ) ; } } return ( result + n + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [140, 32, 7, 57, 48, 72, 44, 56, 91, 6]; int [] param0 = [76, 21, 4, 49, 35, 55, 43, 39, 36, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_FAI_AJ_PAIRS_ARRAY_N_INTEGERS,"static int f_filled ( int a [ ] , int n ) { Map < Integer , Integer > cnt = new HashMap < Integer , Integer > ( ) ; int ans = 0 , pre_sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) { ans += ( i * a [ i ] ) - pre_sum ; pre_sum += a [ i ] ; if ( cnt . containsKey ( a [ i ] - 1 ) ) ans -= cnt . get ( a [ i ] - 1 ) ; if ( cnt . containsKey ( a [ i ] + 1 ) ) ans += cnt . get ( a [ i ] + 1 ) ; if ( cnt . containsKey ( a [ i ] ) ) { cnt . put ( a [ i ] , cnt . get ( a [ i ] ) + 1 ) ; } else { cnt . put ( a [ i ] , 1 ) ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3278, -112, 0, 2551, 16640, 0, 12408, -6856, 0, 542]; int [] [] param0 = [[2, 8, 12, 19, 23, 23, 26, 39, 54, 56, 57, 57, 73, 78, 83, 83, 89, 91], [62, -34, 10, -28, -42, -12, 4, 20, -20, -84, -76, -16, -44, 26, -78, -40, 50, -10, -56, 76, -88, 24, 64, 10, 64, -8, -68, -42, 26, 24, 62, 36, -68, 8, -68, -2, 8, 38, -18], [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], [23, 14, 44, 29, 93, 56, 22, 29, 97, 71, 43, 72, 74, 8, 92, 40, 18, 34, 78, 79, 93, 63, 79, 44, 35, 72, 88, 83, 40, 89, 66, 66, 54, 56, 44, 62, 72, 94, 79, 79, 24, 55, 72, 37, 27, 55, 16, 58, 83], [-96, -94, -90, -90, -86, -82, -80, -80, -58, -48, -40, -32, -32, -20, -20, -20, -12, -12, -6, -6, -2, 0, 4, 16, 16, 16, 42, 48, 58, 64, 68, 76, 76, 76, 78, 80, 82, 88, 88, 88, 92, 94, 96, 98], [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1], [3, 4, 4, 8, 10, 10, 11, 15, 19, 19, 20, 24, 25, 25, 27, 30, 41, 43, 44, 45, 47, 55, 59, 59, 61, 63, 63, 67, 67, 69, 72, 73, 75, 77, 77, 78, 81, 81, 83, 84, 92, 94, 99], [94, -86, 94, 54, -52, 86, 68, 64, 98, 54, -14, -60, -60, -92, 80, -16, 28, 16, -74, 68, 32, -54, 58, -16, -2, -52, -92, -36, 96, -18, 14, 76, 16], [0, 0, 0, 0, 1, 1, 1, 1], [10, 28, 63, 2, 78, 12, 51, 82, 89, 65, 99]]; int [] param1 = [15, 20, 18, 25, 27, 34, 31, 26, 7, 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); } " SUM_FIBONACCI_NUMBERS,"static int f_filled ( int n ) { if ( n <= 0 ) return 0 ; int fibo [ ] = new int [ n + 1 ] ; fibo [ 0 ] = 0 ; fibo [ 1 ] = 1 ; int sum = fibo [ 0 ] + fibo [ 1 ] ; for ( int i = 2 ; i <= n ; i ++ ) { fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ] ; sum += fibo [ i ] ; } return sum ; }","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); } " SUM_K_TH_GROUP_ODD_POSITIVE_NUMBERS,"static int f_filled ( int k ) { int cur = ( k * ( k - 1 ) ) + 1 ; int sum = 0 ; while ( k -- > 0 ) { sum += cur ; cur += 2 ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [753571, 140608, 474552, 132651, 274625, 59319, 74088, 1728, 175616, 941192]; int [] param0 = [91, 52, 78, 51, 65, 39, 42, 12, 56, 98]; 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_K_TH_GROUP_ODD_POSITIVE_NUMBERS_1,"static int f_filled ( int k ) { return k * k * k ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [185193, 884736, 2744, 262144, 13824, 405224, 614125, 19683, 474552, 1]; int [] param0 = [57, 96, 14, 64, 24, 74, 85, 27, 78, 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); } " SUM_LARGEST_PRIME_FACTOR_NUMBER_LESS_EQUAL_N,"static int f_filled ( int n ) { int prime [ ] = new int [ n + 1 ] , sum = 0 ; Arrays . fill ( prime , 0 ) ; int max = n / 2 ; for ( int p = 2 ; p <= max ; p ++ ) { if ( prime [ p ] == 0 ) { for ( int i = p * 2 ; i <= n ; i += p ) prime [ i ] = p ; } } for ( int p = 2 ; p <= n ; p ++ ) { if ( prime [ p ] != 0 ) sum += prime [ p ] ; else sum += p ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [15, 291, 1554, 1672, 875, 43, 901, 90, 1695, 1334]; int [] param0 = [6, 35, 87, 91, 63, 11, 66, 17, 92, 81]; 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_MANHATTAN_DISTANCES_PAIRS_POINTS,"static int f_filled ( int x [ ] , int y [ ] , int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = i + 1 ; j < n ; j ++ ) sum += ( Math . abs ( x [ i ] - x [ j ] ) + Math . abs ( y [ i ] - y [ j ] ) ) ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [35930, 35216, 4, 19322, 42084, 4, 2776, 28932, 188, 0]; int [] [] param0 = [[2, 4, 6, 6, 8, 11, 12, 13, 14, 19, 20, 22, 24, 28, 29, 30, 32, 35, 37, 44, 48, 49, 51, 51, 56, 59, 59, 62, 65, 68, 68, 68, 72, 75, 77, 78, 89, 89, 91, 93, 95, 99], [16, 76, 2, 42, -24, -82, 68, -2, 98, -42, -72, 28, -22, -52, 28, -38, 36, 66, 84, 64, -28, 86, 52, 84, -98, -30], [0, 0, 0, 0, 0, 1, 1, 1, 1, 1], [61, 37, 57, 99, 22, 72, 38, 85, 23, 85, 15, 4, 49, 9, 15, 25, 7, 63, 79, 6, 85, 30, 12, 34, 38, 6, 59, 62, 59, 34, 72, 97, 70, 44, 95, 58, 99], [-96, -86, -82, -72, -72, -64, -62, -60, -56, -56, -56, -54, -52, -40, -36, -30, -10, 10, 18, 26, 28, 56, 56, 56, 64, 90, 92, 94], [1, 0, 1, 1, 1, 0, 1], [6, 10, 24, 25, 31, 41, 43, 45, 47, 65, 67, 90], [-74, 92, 34, 56, -54, -98, -76, -34, 16, 32, -4, -16, 22, 90, -52, -90, -60, 70, -40, 78, 96, -68, 78, -56, -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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [20, 32]]; int [] [] param1 = [[6, 19, 19, 22, 25, 27, 31, 33, 34, 35, 37, 38, 38, 44, 46, 50, 51, 55, 58, 58, 64, 64, 64, 64, 65, 66, 66, 66, 67, 70, 75, 78, 79, 81, 81, 81, 82, 84, 84, 86, 94, 96], [-34, 92, -24, -62, 28, 72, -10, 10, 8, 90, -72, -24, 50, -46, 52, 58, 68, -62, -64, -78, -12, 24, 62, -30, 62, -60], [0, 0, 0, 0, 1, 1, 1, 1, 1, 1], [72, 41, 77, 62, 78, 36, 75, 28, 91, 39, 32, 56, 60, 64, 21, 15, 80, 85, 28, 22, 53, 58, 69, 62, 60, 48, 66, 91, 38, 66, 54, 5, 24, 1, 49, 71, 49], [-98, -98, -96, -96, -82, -80, -80, -68, -62, -60, -46, -38, -26, -26, -20, -18, 16, 22, 24, 26, 34, 46, 52, 52, 74, 76, 90, 92], [1, 0, 1, 0, 0, 1, 1], [4, 7, 11, 19, 21, 39, 57, 80, 84, 93, 94, 97], [14, 20, 24, -92, 58, 12, 78, 78, -90, 96, -44, 36, 30, -46, -30, -80, 26, -2, 26, 28, -16, -50, -2, -36, -8], [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], [23, 50]]; int [] param2 = [37, 24, 5, 26, 26, 3, 10, 21, 23, 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); } " SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS,"static int f_filled ( int n ) { int [ ] [ ] arr = new int [ n ] [ n ] ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n ; j ++ ) arr [ i ] [ j ] = Math . abs ( i - j ) ; int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < n ; j ++ ) sum += arr [ i ] [ j ] ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [71980, 28380, 124392, 242970, 323400, 30360, 6552, 440, 91520, 46852]; int [] param0 = [60, 44, 72, 90, 99, 45, 27, 11, 65, 52]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_1,"static int f_filled ( int n ) { int sum = 0 ; for ( int i = 0 ; i < n ; i ++ ) sum += i * ( n - i ) ; return 2 * sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [83328, 124392, 7308, 14280, 70, 114310, 2660, 168, 168, 14280]; int [] param0 = [63, 72, 28, 35, 6, 70, 20, 8, 8, 35]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_MATRIX_ELEMENT_ABSOLUTE_DIFFERENCE_ROW_COLUMN_NUMBERS_2,"static int f_filled ( int n ) { n -- ; int sum = 0 ; sum += ( n * ( n + 1 ) ) / 2 ; sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6 ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [572, 234960, 146300, 2, 177120, 440, 5850, 14280, 1360, 95810]; int [] param0 = [12, 89, 76, 2, 81, 11, 26, 35, 16, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN,"static int f_filled ( int n ) { int ans = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = 1 ; j <= n ; j ++ ) ans += ( i / j ) ; return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7021, 11190, 77, 11190, 1974, 8680, 19920, 156, 3697, 10530]; int [] param0 = [60, 74, 8, 74, 34, 66, 96, 11, 45, 72]; 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_MATRIX_ELEMENT_ELEMENT_INTEGER_DIVISION_ROW_COLUMN_1,"static int f_filled ( int n ) { int ans = 0 , temp = 0 , num ; for ( int i = 1 ; i <= n && temp < n ; i ++ ) { temp = i - 1 ; num = 1 ; while ( temp < n ) { if ( temp + i <= n ) ans += ( i * num ) ; else ans += ( ( n - temp ) * num ) ; temp += i ; num ++ ; } } return ans ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [630, 4371, 28, 3321, 3240, 1128, 28, 861, 1770, 595]; int [] param0 = [35, 93, 7, 81, 80, 47, 7, 41, 59, 34]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_NODES_K_TH_LEVEL_TREE_REPRESENTED_STRING,"static int f_filled ( String tree , int k ) { int level = - 1 ; int sum = 0 ; int n = tree . length ( ) ; for ( int i = 0 ; i < n ; i ++ ) { if ( tree . charAt ( i ) == '(' ) level ++ ; else if ( tree . charAt ( i ) == ')' ) level -- ; else { if ( level == k ) sum += ( tree . charAt ( i ) - '0' ) ; } } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [14, 9, 12, 16, 0, 0, 9, 0, 0, 0]; 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); } " SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE,"static long f_filled ( int n ) { long sum = 0 ; for ( int row = 0 ; row < n ; row ++ ) { sum = sum + ( 1 << row ) ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [3, 15, 7, 127, 255, 31, 63, 1023, 4095, 32767]; int [] param0 = [2, 4, 3, 7, 8, 5, 6, 10, 12, 15]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_OF_ALL_ELEMENTS_UP_TO_NTH_ROW_IN_A_PASCALS_TRIANGLE_1,"static long f_filled ( int n ) { long sum = 0 ; sum = 1 << n ; return ( sum - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [31, 7, 2047, 15, 255, 8191, 63, 7, 65535, 511]; int [] param0 = [5, 3, 11, 4, 8, 13, 6, 3, 16, 9]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_OF_ALL_PROPER_DIVISORS_OF_A_NATURAL_NUMBER,"static int f_filled ( int num ) { int result = 0 ; for ( int i = 2 ; i <= Math . sqrt ( num ) ; i ++ ) { if ( num % i == 0 ) { if ( i == ( num / i ) ) result += i ; else result += ( i + num / i ) ; } } return ( result + 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1, 23, 28, 1, 22, 1, 33, 1, 40, 1]; int [] param0 = [2, 57, 28, 43, 38, 29, 45, 47, 44, 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); } " SUM_PAIRWISE_PRODUCTS,"static int f_filled ( int n ) { int sum = 0 ; for ( int i = 1 ; i <= n ; i ++ ) for ( int j = i ; j <= n ; j ++ ) sum = sum + i * j ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [28336, 145112, 9996, 284050, 1155, 25, 140, 601036, 551310, 7438442]; int [] param0 = [21, 32, 16, 38, 9, 3, 5, 46, 45, 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); } " SUM_PAIRWISE_PRODUCTS_1,"static int f_filled ( int n ) { int multiTerms = n * ( n + 1 ) / 2 ; int sum = multiTerms ; for ( int i = 2 ; i <= n ; i ++ ) { multiTerms = multiTerms - ( i - 1 ) ; sum = sum + multiTerms * i ; } return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [382571, 834275, 2645897, 15675, 1711355, 266, 74907, 601036, 834275, 23485]; int [] param0 = [41, 50, 67, 18, 60, 6, 27, 46, 50, 20]; 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_PAIRWISE_PRODUCTS_2,"static int f_filled ( int n ) { return n * ( n + 1 ) * ( n + 2 ) * ( 3 * n + 1 ) / 24 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1397887, 15675, 11449977, 1155, 420497, 2645897, 3327486, 2493271, 2972060, 15675]; int [] param0 = [57, 18, 97, 9, 42, 67, 71, 66, 69, 18]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_SEQUENCE_2_22_222,"static double f_filled ( int n ) { return 0.0246 * ( Math . pow ( 10 , n ) - 1 - ( 9 * n ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [2459998.2042, 24599997.9828, 245998.42560000002, 24598.647, 23.9112, 245999997.7614, 1.9926, 0.0, 245.0898, 2458.8684]; int [] param0 = [8, 9, 7, 6, 3, 10, 2, 1, 4, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_SERIES_0_6_0_06_0_006_0_0006_N_TERMS,"static double f_filled ( int n ) { return ( 0.666 ) * ( 1 - 1 / Math . pow ( 10 , n ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [0.5994, 0.65934, 0.665334, 0.6659334, 0.6659933400000001, 0.666, 0.666, 0.666, 0.665999999334, 0.665999999999334]; int [] param0 = [1, 2, 3, 4, 5, 74, 77, 67, 9, 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); } " SUM_SERIES_12_32_52_2N_12,"static int f_filled ( int n ) { int sum = 0 ; for ( int i = 1 ; i <= n ; i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 ) ; return sum ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3654, 302621, 67525, 848046, 138415, 1254890, 457310, 18424, 585276, 18424]; int [] param0 = [14, 61, 37, 86, 47, 98, 70, 24, 76, 24]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_SERIES_12_32_52_2N_12_1,"static int f_filled ( int n ) { return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [790244, 540274, 1004731, 52394, 62196, 29260, 457310, 455, 18424, 138415]; int [] param0 = [84, 74, 91, 34, 36, 28, 70, 7, 24, 47]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_SERIES_23_45_67_89_UPTO_N_TERMS,"static double f_filled ( int n ) { int i = 1 ; double res = 0.0 ; boolean sign = true ; while ( n > 0 ) { n -- ; if ( sign ) { sign = ! sign ; res = res + ( double ) ++ i / ++ i ; } else { sign = ! sign ; res = res - ( double ) ++ i / ++ i ; } } return res ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ double [] results = [0.7803986631477524, -0.16507936507936516, -0.21050375120783382, -0.21185466678122022, -0.2120245854859959, 0.7770671416747363, -0.21172836828074082, 0.780190394898247, 0.7821931668684383, 0.7825573460049735]; int [] param0 = [49, 4, 60, 90, 96, 29, 86, 47, 77, 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); } " SUM_SERIES_555555_N_TERMS,"static int f_filled ( int n ) { return ( int ) ( 0.6172 * ( Math . pow ( 10 , n ) - 1 ) - 0.55 * n ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [61719994, 5, 6171995, 6169, 617199994, 617196, 5, 614, 60, 61716]; int [] param0 = [8, 1, 7, 4, 9, 6, 1, 3, 2, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " SUM_SUBSETS_SET_FORMED_FIRST_N_NATURAL_NUMBERS,"static long f_filled ( int n ) { return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) ) ; }","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); } " SUM_TWO_LARGE_NUMBERS,"static String f_filled ( String str1 , String str2 ) { if ( str1 . length ( ) > str2 . length ( ) ) { String t = str1 ; str1 = str2 ; str2 = t ; } String str = """" ; int n1 = str1 . length ( ) , n2 = str2 . length ( ) ; str1 = new StringBuilder ( str1 ) . reverse ( ) . toString ( ) ; str2 = new StringBuilder ( str2 ) . reverse ( ) . toString ( ) ; int carry = 0 ; for ( int i = 0 ; i < n1 ; i ++ ) { int sum = ( ( int ) ( str1 . charAt ( i ) - '0' ) + ( int ) ( str2 . charAt ( i ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } for ( int i = n1 ; i < n2 ; i ++ ) { int sum = ( ( int ) ( str2 . charAt ( i ) - '0' ) + carry ) ; str += ( char ) ( sum % 10 + '0' ) ; carry = sum / 10 ; } if ( carry > 0 ) str += ( char ) ( carry + '0' ) ; str = new StringBuilder ( str ) . reverse ( ) . toString ( ) ; return str ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ string [] results = [""575584"", ""0526110507350"", ""121110010"", ""74169"", ""614"", ""01110101112"", ""106743"", ""898423490593"", ""01211112110121"", ""359233""]; string [] param0 = [""12687"", ""0526110506447"", ""011010010"", ""70234"", ""3"", ""0101"", ""98353"", ""2317170"", ""111111000010"", ""2341""]; string [] param1 = [""562897"", ""903"", ""110100000"", ""3935"", ""611"", ""01110101011"", ""8390"", ""898421173423"", ""01100001110111"", ""356892""]; 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); } " SWAP_ALL_ODD_AND_EVEN_BITS,"static int f_filled ( int x ) { int even_bits = x & 0xAAAAAAAA ; int odd_bits = x & 0x55555555 ; even_bits >>= 1 ; odd_bits <<= 1 ; return ( even_bits | odd_bits ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [147, 173, 7, 3, 142, 54, 57, 129, 145, 24]; int [] param0 = [99, 94, 11, 3, 77, 57, 54, 66, 98, 36]; 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); } " SWAP_BITS_IN_A_GIVEN_NUMBER,"static int f_filled ( int x , int p1 , int p2 , int n ) { int set1 = ( x >> p1 ) & ( ( 1 << n ) - 1 ) ; int set2 = ( x >> p2 ) & ( ( 1 << n ) - 1 ) ; int xor = ( set1 ^ set2 ) ; xor = ( xor << p1 ) | ( xor << p2 ) ; int result = x ^ xor ; return result ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5, 1, 5, 5, 129, 65, 192, 65, 3, 6]; int [] param0 = [5, 1, 5, 5, 9, 5, 6, 5, 3, 6]; int [] param1 = [8, 2, 5, 5, 1, 6, 6, 1, 3, 6]; int [] param2 = [7, 5, 4, 9, 5, 2, 1, 5, 9, 6]; int [] param3 = [2, 4, 4, 0, 3, 1, 9, 3, 4, 9]; 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); } " SWAP_TWO_NIBBLES_BYTE,"static int f_filled ( int x ) { return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [147, 54, 36, 22, 245, 162, 245, 149, 48, 69]; int [] param0 = [57, 99, 66, 97, 95, 42, 95, 89, 3, 84]; 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); } " TAIL_RECURSION,"static int f_filled ( int n ) { if ( n == 0 ) return 1 ; return n * f_filled ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [5040, 2, 24, 720, 40320, 6, 362880, 3628800, 39916800, 1]; int [] param0 = [7, 2, 4, 6, 8, 3, 9, 10, 11, 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); } " TAIL_RECURSION_FIBONACCI,"static int f_filled ( int n , int a , int b ) { if ( n == 0 ) return a ; if ( n == 1 ) return b ; return f_filled ( n - 1 , b , a + b ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [18, 104, 327, 176, 8, 120, 14, 568, 1385, 4]; int [] param0 = [4, 6, 9, 7, 2, 8, 3, 10, 12, 1]; int [] param1 = [3, 8, 1, 9, 8, 6, 0, 7, 1, 3]; int [] param2 = [4, 8, 9, 8, 0, 2, 7, 6, 9, 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); } " TEMPLE_OFFERINGS,"static int f_filled ( int n , int templeHeight [ ] ) { int sum = 0 ; for ( int i = 0 ; i < n ; ++ i ) { int left = 0 , right = 0 ; for ( int j = i - 1 ; j >= 0 ; -- j ) { if ( templeHeight [ j ] < templeHeight [ j + 1 ] ) ++ left ; else break ; } for ( int j = i + 1 ; j < n ; ++ j ) { if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right ; else break ; } sum += Math . max ( right , left ) + 1 ; } return sum ; }","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); } " TILING_WITH_DOMINOES,"static int f_filled ( int n ) { int [ ] A = new int [ n + 1 ] ; int [ ] B = new int [ n + 1 ] ; A [ 0 ] = 1 ; A [ 1 ] = 0 ; B [ 0 ] = 0 ; B [ 1 ] = 1 ; for ( int i = 2 ; i <= n ; i ++ ) { A [ i ] = A [ i - 2 ] + 2 * B [ i - 1 ] ; B [ i ] = A [ i - 1 ] + B [ i - 2 ] ; } return A [ n ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 41, 0, 3, 0, 11, 153, 571]; int [] param0 = [9, 13, 5, 6, 7, 2, 19, 4, 8, 10]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS,"static int f_filled ( int n ) { int dp [ ] [ ] = new int [ 10 ] [ n + 1 ] ; for ( int i = 0 ; i < 10 ; i ++ ) dp [ i ] [ 1 ] = 1 ; for ( int digit = 0 ; digit <= 9 ; digit ++ ) { for ( int len = 2 ; len <= n ; len ++ ) { for ( int x = 0 ; x <= digit ; x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ] ; } } int count = 0 ; for ( int i = 0 ; i < 10 ; i ++ ) count += dp [ i ] [ n ] ; return count ; }","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); } " TOTAL_NUMBER_OF_NON_DECREASING_NUMBERS_WITH_N_DIGITS_1,"static long f_filled ( int n ) { int N = 10 ; long count = 1 ; for ( int i = 1 ; i <= n ; i ++ ) { count *= ( N + i - 1 ) ; count /= i ; } return count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ long [] results = [2054455634, 167960, 2509710226100, 293052087900, 5005, 293052087900, 42757703560, 2054455634, 97082021465, 125595622175]; int [] param0 = [40, 11, 94, 73, 6, 73, 58, 40, 64, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " TRIANGULAR_MATCHSTICK_NUMBER,"static int f_filled ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [63, 975, 360, 1395, 459, 9720, 1134, 273, 234, 6834]; int [] param0 = [6, 25, 15, 30, 17, 80, 27, 13, 12, 67]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " TRIANGULAR_NUMBERS,"static boolean f_filled ( int num ) { if ( num < 0 ) return false ; int sum = 0 ; for ( int n = 1 ; sum <= num ; n ++ ) { sum = sum + n ; if ( sum == num ) return true ; } return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, false, false, false, false, false, false, false, true, false]; int [] param0 = [97, 97, 32, 40, 18, 14, 90, 39, 1, 57]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " TRIANGULAR_NUMBERS_1,"static boolean f_filled ( int num ) { if ( num < 0 ) return false ; int c = ( - 2 * num ) ; int b = 1 , a = 1 ; int d = ( b * b ) - ( 4 * a * c ) ; if ( d < 0 ) return false ; float root1 = ( - b + ( float ) Math . sqrt ( d ) ) / ( 2 * a ) ; float root2 = ( - b - ( float ) Math . sqrt ( d ) ) / ( 2 * a ) ; if ( root1 > 0 && Math . floor ( root1 ) == root1 ) return true ; if ( root2 > 0 && Math . floor ( root2 ) == root2 ) return true ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, true, false, false, false, false, false]; int [] param0 = [1, 3, 6, 10, 55, 48, 63, 72, 16, 85]; 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); } " TURN_OFF_THE_RIGHTMOST_SET_BIT,"static int f_filled ( int n ) { return n & ( n - 1 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [8, 52, 56, 0, 40, 0, 0, 50, 56, 88]; int [] param0 = [9, 54, 60, 32, 41, 64, 4, 51, 57, 92]; 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); } " UGLY_NUMBERS,"static int f_filled ( int n ) { int ugly [ ] = new int [ n ] ; int i2 = 0 , i3 = 0 , i5 = 0 ; int next_multiple_of_2 = 2 ; int next_multiple_of_3 = 3 ; int next_multiple_of_5 = 5 ; int next_ugly_no = 1 ; ugly [ 0 ] = 1 ; for ( int i = 1 ; i < n ; i ++ ) { next_ugly_no = Math . min ( next_multiple_of_2 , Math . min ( next_multiple_of_3 , next_multiple_of_5 ) ) ; ugly [ i ] = next_ugly_no ; if ( next_ugly_no == next_multiple_of_2 ) { i2 = i2 + 1 ; next_multiple_of_2 = ugly [ i2 ] * 2 ; } if ( next_ugly_no == next_multiple_of_3 ) { i3 = i3 + 1 ; next_multiple_of_3 = ugly [ i3 ] * 3 ; } if ( next_ugly_no == next_multiple_of_5 ) { i5 = i5 + 1 ; next_multiple_of_5 = ugly [ i5 ] * 5 ; } } return next_ugly_no ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [64, 450, 1250, 1152, 972, 1000, 625, 1000, 90, 1]; int [] param0 = [27, 64, 93, 90, 85, 86, 72, 86, 32, 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); } " UNIQUE_CELLS_BINARY_MATRIX,"static int f_filled ( int mat [ ] [ ] , int n , int m ) { int [ ] rowsum = new int [ n ] ; int [ ] colsum = new int [ m ] ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < m ; j ++ ) if ( mat [ i ] [ j ] != 0 ) { rowsum [ i ] ++ ; colsum [ j ] ++ ; } int uniquecount = 0 ; for ( int i = 0 ; i < n ; i ++ ) for ( int j = 0 ; j < m ; j ++ ) if ( mat [ i ] [ j ] != 0 && rowsum [ i ] == 1 && colsum [ j ] == 1 ) uniquecount ++ ; return uniquecount ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [2, 1, 1, 0, 0, 0, 0, 0, 0]; int [] [] [] param0 = [[[0, 1, 0, 0], [0, 0, 1, 0], [1, 0, 0, 1]], [[0, 1, 0, 0], [0, 0, 1, 1], [1, 0, 1, 1]], [[0, 1, 0, 0], [0, 0, 1, 0], [1, 1, 0, 1]], [[1, 1, 1, 1], [0, 0, 1, 0], [1, 0, 0, 1]], [[0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 72, 33, 13, 43, 21, 83, 34, 30, 20, 82, 85, 36], [7, 69, 9, 45, 18, 47, 1, 78, 72, 53, 37, 20, 95, 71, 58, 41, 38, 44, 15, 35, 81, 27, 21, 40, 44, 90, 44, 5, 97, 49], [69, 92, 21, 8, 66, 37, 14, 34, 60, 61, 46, 21, 91, 18, 61, 69, 34, 82, 54, 99, 90, 29, 41, 92, 70, 90, 58, 82, 30, 33], [63, 96, 90, 86, 34, 49, 12, 22, 85, 24, 56, 25, 66, 1, 74, 34, 5, 17, 1, 78, 21, 6, 75, 39, 59, 20, 84, 85, 64, 24], [41, 90, 67, 38, 38, 28, 10, 24, 62, 52, 71, 87, 87, 24, 95, 50, 86, 91, 38, 69, 18, 72, 99, 49, 17, 76, 86, 53, 6, 94], [66, 5, 2, 62, 99, 5, 31, 81, 63, 91, 95, 74, 76, 18, 77, 57, 72, 99, 62, 4, 62, 46, 71, 21, 60, 45, 79, 98, 22, 65], [6, 65, 83, 27, 10, 55, 78, 34, 41, 32, 67, 51, 80, 39, 97, 5, 58, 99, 17, 23, 90, 46, 7, 62, 7, 15, 30, 20, 67, 86], [54, 50, 71, 95, 49, 50, 3, 64, 46, 81, 22, 52, 37, 60, 67, 48, 30, 88, 97, 43, 10, 71, 80, 96, 2, 72, 79, 67, 84, 98], [46, 41, 4, 87, 8, 10, 5, 74, 90, 80, 59, 58, 23, 61, 17, 28, 18, 52, 58, 41, 75, 98, 79, 1, 97, 73, 17, 79, 4, 46], [70, 6, 83, 23, 94, 1, 73, 61, 22, 65, 57, 36, 25, 16, 26, 92, 5, 22, 14, 73, 78, 80, 94, 96, 70, 17, 1, 18, 75, 11], [92, 12, 34, 80, 74, 8, 90, 42, 14, 51, 9, 83, 98, 38, 29, 29, 28, 88, 92, 76, 83, 6, 2, 53, 31, 37, 56, 93, 40, 12], [55, 97, 57, 45, 25, 42, 18, 30, 18, 7, 79, 30, 5, 69, 33, 6, 48, 4, 13, 26, 49, 20, 32, 96, 65, 89, 89, 53, 65, 3], [21, 43, 25, 85, 67, 93, 35, 86, 23, 13, 98, 23, 63, 99, 83, 15, 79, 26, 67, 81, 94, 61, 28, 34, 16, 43, 11, 24, 87, 25], [77, 19, 34, 66, 72, 5, 75, 66, 54, 96, 24, 76, 80, 51, 24, 50, 54, 17, 96, 84, 35, 30, 47, 42, 22, 31, 51, 37, 88, 88], [13, 89, 31, 14, 84, 39, 92, 89, 38, 75, 18, 39, 83, 67, 41, 46, 49, 27, 23, 35, 13, 26, 78, 35, 41, 6, 72, 52, 53, 79], [8, 47, 80, 93, 64, 34, 29, 35, 48, 74, 65, 69, 67, 14, 46, 27, 46, 29, 1, 82, 3, 26, 21, 24, 45, 84, 29, 18, 3, 51], [97, 18, 37, 63, 85, 19, 23, 84, 55, 24, 83, 26, 97, 96, 54, 99, 89, 33, 88, 57, 9, 64, 75, 85, 59, 81, 16, 5, 44, 46], [10, 77, 58, 70, 64, 80, 70, 93, 60, 25, 87, 11, 93, 85, 63, 26, 41, 53, 75, 24, 81, 73, 72, 94, 7, 87, 73, 83, 64, 72], [46, 78, 51, 92, 99, 71, 6, 30, 16, 57, 65, 61, 17, 63, 7, 35, 69, 91, 30, 44, 99, 80, 6, 80, 56, 8, 84, 95, 20, 73], [30, 62, 77, 26, 66, 61, 61, 45, 46, 24, 77, 16, 82, 16, 66, 1, 74, 25, 14, 81, 82, 7, 21, 93, 91, 49, 4, 12, 22, 34], [26, 28, 19, 31, 14, 87, 81, 23, 81, 8, 38, 10, 30, 7, 2, 22, 5, 67, 73, 69, 56, 20, 93, 70, 68, 57, 21, 17, 79, 27], [39, 83, 67, 92, 86, 70, 95, 69, 13, 98, 50, 10, 56, 44, 28, 85, 37, 36, 56, 92, 77, 57, 36, 1, 43, 9, 84, 81, 67, 32], [99, 70, 58, 52, 70, 89, 28, 65, 40, 80, 20, 88, 79, 10, 76, 62, 37, 99, 60, 91, 77, 94, 67, 52, 35, 62, 12, 29, 30, 22], [81, 53, 91, 22, 60, 49, 49, 7, 46, 11, 16, 54, 57, 36, 51, 22, 37, 3, 35, 38, 55, 41, 38, 88, 34, 99, 11, 79, 14, 81], [21, 28, 86, 60, 34, 65, 87, 96, 4, 56, 70, 80, 10, 35, 88, 10, 76, 63, 97, 91, 25, 74, 89, 32, 56, 26, 68, 73, 27, 73], [90, 11, 53, 32, 59, 30, 9, 11, 87, 17, 96, 11, 57, 86, 50, 96, 73, 81, 53, 89, 80, 97, 66, 43, 39, 42, 76, 34, 25, 78], [9, 94, 12, 10, 88, 34, 76, 26, 96, 35, 77, 83, 56, 77, 56, 86, 48, 23, 65, 8, 98, 13, 49, 10, 3, 28, 27, 85, 11, 88], [12, 7, 42, 96, 10, 61, 64, 28, 26, 93, 91, 52, 74, 4, 22, 10, 4, 7, 63, 87, 67, 88, 30, 76, 21, 48, 17, 67, 79, 96], [9, 40, 86, 96, 59, 69, 41, 68, 48, 61, 5, 7, 75, 6, 29, 51, 81, 28, 57, 63, 38, 83, 49, 12, 45, 83, 97, 45, 5, 65], [35, 35, 31, 36, 40, 99, 40, 61, 12, 82, 92, 13, 30, 40, 17, 73, 22, 56, 62, 57, 15, 93, 54, 16, 84, 89, 24, 80, 80, 25]], [[0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 14, 45, 59, 40, 83, 46, 59, 89, 37, 82, 68, 65, 97, 28, 41, 83, 97, 15, 87, 93, 39, 78, 94, 66, 77, 28, 31, 12, 13, 3], [63, 29, 64, 94, 76, 85, 66, 50, 80, 96, 92, 73, 17, 56, 83, 7, 36, 40, 1, 42, 36, 39, 1, 88, 63, 74, 75, 86, 56, 31, 1, 41, 11, 6, 51, 64, 81, 78, 96, 20, 4, 39, 47, 22, 93, 42, 77, 79], [35, 25, 3, 51, 12, 14, 40, 32, 50, 68, 29, 31, 96, 24, 11, 30, 19, 36, 6, 2, 19, 46, 40, 18, 36, 46, 56, 52, 54, 56, 20, 1, 23, 38, 20, 4, 69, 6, 63, 90, 1, 63, 79, 80, 87, 86, 54, 69], [43, 5, 70, 66, 10, 36, 35, 45, 23, 62, 47, 16, 37, 42, 35, 40, 16, 69, 11, 51, 93, 75, 80, 89, 50, 67, 67, 65, 12, 7, 43, 46, 96, 22, 76, 6, 38, 39, 60, 85, 62, 92, 96, 27, 49, 15, 33, 96], [46, 98, 71, 13, 53, 39, 50, 70, 60, 9, 4, 94, 92, 21, 12, 77, 50, 13, 52, 91, 92, 82, 80, 21, 55, 10, 78, 92, 29, 11, 30, 40, 91, 49, 3, 1, 32, 39, 85, 2, 74, 31, 18, 7, 5, 29, 68, 46], [56, 3, 13, 67, 72, 50, 4, 42, 99, 76, 24, 19, 99, 82, 40, 34, 89, 7, 75, 38, 19, 99, 45, 20, 91, 95, 89, 2, 93, 37, 31, 42, 6, 85, 97, 9, 74, 86, 95, 53, 11, 83, 76, 16, 13, 38, 13, 15], [18, 16, 41, 50, 69, 91, 66, 41, 27, 59, 65, 14, 35, 23, 22, 27, 50, 25, 98, 54, 49, 91, 99, 85, 3, 25, 68, 57, 15, 67, 11, 92, 3, 18, 53, 9, 79, 72, 40, 56, 14, 61, 13, 47, 74, 94, 5, 86], [99, 5, 12, 35, 85, 26, 1, 10, 38, 24, 95, 47, 87, 85, 2, 95, 2, 30, 25, 83, 62, 1, 92, 63, 84, 59, 54, 69, 55, 94, 87, 42, 91, 53, 65, 9, 71, 51, 90, 16, 53, 70, 62, 37, 61, 57, 45, 76], [88, 17, 2, 95, 37, 54, 42, 29, 65, 78, 40, 11, 58, 96, 20, 66, 31, 5, 96, 50, 9, 41, 10, 53, 49, 26, 67, 36, 23, 94, 39, 59, 23, 23, 43, 25, 84, 60, 33, 33, 65, 47, 33, 38, 24, 73, 95, 49], [92, 87, 30, 82, 58, 90, 97, 59, 16, 93, 16, 33, 39, 46, 38, 23, 26, 49, 81, 24, 83, 42, 27, 2, 8, 79, 41, 13, 91, 22, 47, 47, 65, 69, 29, 79, 30, 46, 6, 6, 87, 52, 5, 86, 41, 20, 20, 39], [30, 48, 81, 60, 23, 60, 50, 13, 74, 38, 39, 68, 19, 52, 41, 92, 27, 23, 19, 80, 35, 5, 88, 5, 93, 6, 41, 41, 54, 44, 48, 37, 93, 56, 33, 91, 35, 6, 46, 74, 36, 44, 7, 7, 29, 80, 65, 60], [35, 57, 29, 38, 77, 12, 87, 80, 58, 78, 80, 6, 36, 52, 88, 27, 25, 40, 36, 60, 29, 95, 3, 13, 68, 11, 48, 79, 60, 2, 79, 70, 13, 35, 51, 56, 40, 77, 59, 12, 16, 53, 41, 20, 40, 61, 77, 34], [19, 45, 91, 29, 19, 56, 27, 2, 40, 65, 78, 8, 27, 97, 95, 30, 25, 49, 56, 65, 31, 99, 60, 85, 34, 17, 73, 29, 72, 83, 6, 88, 6, 3, 95, 31, 76, 52, 8, 90, 26, 15, 77, 56, 86, 62, 13, 46], [54, 9, 88, 3, 23, 12, 41, 44, 58, 11, 19, 59, 73, 37, 10, 73, 33, 77, 20, 44, 75, 93, 13, 63, 14, 73, 54, 42, 38, 83, 72, 82, 98, 36, 9, 80, 5, 15, 24, 64, 48, 43, 39, 25, 80, 86, 80, 97], [5, 60, 7, 18, 6, 12, 33, 98, 21, 58, 82, 78, 42, 94, 46, 3, 57, 53, 62, 13, 51, 19, 59, 62, 37, 77, 15, 90, 70, 91, 12, 89, 50, 47, 16, 16, 67, 34, 88, 46, 87, 64, 94, 49, 21, 53, 62, 81], [54, 82, 3, 53, 12, 80, 38, 78, 91, 18, 84, 35, 81, 84, 70, 90, 71, 76, 17, 21, 70, 47, 37, 89, 54, 15, 11, 9, 68, 3, 13, 96, 6, 1, 5, 66, 86, 96, 41, 50, 7, 21, 81, 53, 20, 65, 32, 96], [84, 74, 6, 41, 33, 74, 25, 24, 95, 93, 12, 37, 50, 9, 93, 67, 4, 54, 85, 6, 66, 37, 84, 45, 97, 14, 84, 43, 66, 7, 55, 37, 76, 16, 17, 95, 71, 90, 1, 2, 95, 84, 33, 13, 65, 51, 33, 3], [60, 83, 44, 96, 5, 47, 43, 47, 6, 60, 36, 37, 77, 76, 6, 30, 92, 10, 28, 6, 73, 24, 52, 82, 68, 45, 87, 27, 68, 13, 75, 75, 19, 33, 78, 13, 7, 33, 32, 45, 56, 72, 46, 98, 19, 34, 63, 70], [54, 55, 50, 65, 45, 30, 79, 73, 61, 93, 59, 2, 30, 46, 68, 19, 84, 5, 73, 84, 57, 63, 52, 59, 60, 80, 84, 20, 90, 33, 12, 21, 56, 23, 20, 87, 49, 47, 70, 45, 76, 35, 72, 27, 80, 47, 32, 29], [71, 80, 53, 93, 56, 89, 43, 4, 64, 91, 87, 23, 60, 30, 43, 88, 48, 80, 7, 87, 31, 19, 52, 68, 6, 83, 60, 91, 93, 12, 38, 13, 28, 5, 46, 46, 81, 27, 26, 62, 68, 72, 90, 97, 12, 77, 85, 52], [37, 25, 39, 67, 19, 71, 81, 77, 24, 51, 45, 8, 72, 45, 2, 30, 67, 45, 26, 17, 38, 67, 57, 33, 94, 79, 72, 94, 64, 23, 12, 8, 73, 72, 38, 33, 48, 97, 45, 75, 23, 43, 25, 15, 10, 20, 16, 99], [98, 85, 57, 46, 1, 25, 56, 46, 59, 62, 78, 61, 83, 8, 41, 15, 44, 82, 1, 97, 65, 34, 4, 81, 2, 39, 54, 10, 42, 45, 26, 27, 39, 25, 29, 82, 22, 90, 60, 90, 52, 85, 21, 8, 66, 98, 76, 18], [81, 15, 3, 85, 83, 59, 55, 32, 11, 82, 53, 29, 67, 4, 92, 9, 57, 38, 7, 65, 35, 47, 34, 63, 9, 90, 72, 19, 26, 46, 56, 10, 43, 30, 40, 55, 58, 31, 72, 47, 77, 37, 94, 57, 79, 57, 99, 3], [29, 88, 45, 87, 73, 2, 15, 96, 18, 29, 40, 3, 97, 58, 71, 94, 91, 38, 29, 31, 65, 43, 27, 27, 93, 69, 3, 29, 13, 97, 60, 84, 67, 70, 81, 47, 68, 97, 33, 6, 64, 78, 71, 70, 51, 67, 22, 72], [24, 77, 77, 65, 53, 41, 32, 69, 71, 45, 32, 28, 97, 14, 13, 93, 50, 40, 1, 47, 91, 30, 34, 46, 1, 34, 59, 7, 65, 42, 82, 99, 19, 13, 23, 66, 3, 86, 36, 49, 72, 87, 72, 57, 89, 99, 64, 11], [41, 6, 45, 81, 57, 82, 33, 61, 18, 7, 29, 69, 16, 95, 69, 74, 29, 29, 16, 4, 65, 72, 92, 1, 92, 3, 64, 66, 89, 57, 75, 18, 39, 84, 81, 7, 55, 17, 68, 36, 94, 1, 35, 76, 17, 80, 28, 32], [55, 35, 19, 93, 93, 80, 4, 21, 44, 62, 1, 83, 51, 90, 76, 17, 37, 92, 36, 29, 69, 3, 15, 67, 77, 69, 21, 23, 47, 86, 34, 41, 90, 47, 31, 35, 7, 45, 57, 96, 22, 70, 21, 49, 47, 27, 10, 86], [44, 51, 18, 68, 99, 38, 36, 60, 68, 74, 96, 74, 45, 74, 75, 9, 13, 57, 82, 57, 37, 47, 11, 28, 6, 33, 14, 47, 29, 15, 56, 69, 86, 31, 19, 18, 58, 70, 73, 30, 95, 35, 17, 16, 97, 68, 95, 33], [36, 11, 60, 4, 63, 5, 64, 85, 77, 4, 35, 26, 26, 19, 37, 11, 66, 31, 18, 75, 44, 16, 58, 2, 59, 96, 48, 86, 36, 8, 36, 25, 40, 95, 4, 43, 74, 27, 38, 81, 38, 64, 89, 17, 13, 85, 79, 24], [7, 64, 63, 22, 53, 74, 97, 12, 72, 22, 39, 47, 64, 44, 16, 59, 34, 46, 80, 78, 70, 55, 74, 24, 27, 73, 16, 2, 31, 63, 47, 19, 56, 11, 86, 93, 95, 8, 74, 6, 31, 99, 50, 29, 21, 41, 69, 69], [88, 79, 56, 28, 34, 56, 77, 55, 44, 32, 86, 29, 3, 69, 11, 48, 53, 56, 53, 26, 9, 75, 65, 56, 28, 23, 31, 66, 61, 82, 16, 59, 81, 48, 17, 35, 95, 99, 59, 88, 41, 37, 30, 82, 91, 16, 84, 47], [28, 21, 41, 45, 97, 73, 64, 88, 13, 94, 43, 97, 58, 88, 20, 63, 1, 23, 33, 57, 81, 54, 66, 95, 31, 54, 16, 37, 7, 1, 94, 18, 42, 39, 26, 75, 65, 57, 69, 86, 77, 17, 7, 71, 12, 38, 87, 48], [55, 54, 72, 15, 30, 55, 73, 21, 60, 78, 8, 47, 36, 73, 26, 84, 70, 34, 60, 23, 97, 85, 41, 90, 69, 55, 73, 45, 61, 33, 89, 52, 81, 19, 75, 8, 70, 6, 72, 57, 88, 60, 19, 52, 41, 91, 84, 88], [38, 69, 16, 39, 97, 74, 51, 5, 83, 62, 41, 85, 67, 59, 92, 19, 80, 62, 53, 66, 8, 46, 12, 88, 65, 82, 23, 39, 60, 27, 57, 44, 70, 28, 23, 34, 25, 11, 48, 65, 10, 73, 26, 10, 18, 60, 73, 45], [26, 9, 36, 15, 24, 40, 2, 4, 95, 20, 39, 45, 26, 60, 69, 68, 86, 70, 31, 69, 7, 69, 4, 91, 73, 37, 2, 49, 83, 17, 17, 40, 51, 88, 77, 28, 46, 78, 87, 87, 74, 49, 17, 27, 62, 11, 83, 44], [91, 36, 16, 60, 87, 97, 52, 22, 78, 77, 86, 71, 38, 65, 51, 97, 86, 23, 15, 79, 31, 28, 67, 42, 25, 33, 97, 23, 92, 53, 16, 37, 5, 11, 12, 21, 18, 14, 33, 21, 26, 89, 25, 35, 63, 20, 63, 66], [12, 32, 97, 48, 95, 97, 59, 20, 37, 40, 61, 56, 14, 36, 76, 90, 34, 6, 46, 77, 22, 99, 83, 23, 64, 96, 44, 11, 68, 61, 76, 56, 51, 63, 30, 10, 88, 23, 1, 48, 4, 28, 44, 67, 2, 58, 6, 42], [17, 37, 44, 23, 40, 85, 44, 31, 76, 93, 13, 90, 97, 98, 20, 47, 10, 65, 52, 63, 29, 54, 86, 50, 65, 44, 8, 9, 23, 84, 34, 16, 86, 62, 87, 65, 78, 52, 23, 38, 40, 8, 32, 40, 66, 48, 13, 27], [46, 71, 3, 85, 61, 72, 65, 17, 26, 29, 72, 38, 51, 43, 72, 8, 25, 55, 45, 91, 86, 67, 57, 49, 54, 47, 64, 24, 62, 33, 99, 40, 29, 8, 75, 16, 33, 64, 11, 29, 49, 88, 66, 5, 88, 53, 44, 7], [95, 94, 70, 69, 79, 27, 99, 54, 73, 23, 58, 17, 87, 46, 47, 93, 59, 45, 62, 54, 75, 13, 12, 2, 42, 54, 11, 78, 22, 85, 49, 37, 36, 89, 49, 58, 3, 66, 91, 33, 18, 48, 75, 71, 37, 50, 36, 27], [22, 31, 40, 54, 64, 70, 53, 54, 54, 97, 71, 6, 64, 54, 65, 46, 42, 93, 75, 92, 56, 40, 15, 30, 23, 12, 92, 95, 30, 16, 30, 68, 33, 57, 97, 28, 85, 79, 26, 14, 57, 15, 66, 16, 37, 11, 11, 33], [2, 33, 63, 3, 84, 33, 26, 34, 78, 52, 93, 66, 72, 27, 72, 71, 75, 94, 49, 47, 21, 21, 71, 84, 61, 14, 20, 5, 31, 62, 12, 56, 56, 12, 66, 26, 68, 30, 98, 20, 66, 35, 79, 51, 14, 55, 36, 53], [54, 63, 94, 58, 27, 2, 85, 78, 91, 85, 23, 35, 62, 72, 59, 76, 64, 92, 41, 33, 97, 9, 79, 74, 49, 2, 3, 23, 74, 19, 18, 35, 54, 60, 9, 95, 94, 52, 50, 12, 17, 91, 85, 49, 48, 27, 14, 55], [13, 3, 64, 88, 96, 72, 99, 23, 80, 73, 39, 58, 18, 54, 31, 64, 42, 37, 98, 70, 78, 88, 97, 42, 83, 29, 70, 3, 18, 85, 29, 52, 42, 52, 36, 95, 8, 96, 80, 86, 2, 51, 15, 17, 13, 54, 99, 25], [74, 75, 33, 78, 98, 22, 44, 4, 26, 1, 10, 2, 29, 25, 87, 94, 60, 89, 13, 40, 34, 35, 79, 39, 42, 84, 86, 25, 14, 83, 86, 87, 1, 39, 30, 5, 94, 71, 62, 77, 31, 7, 29, 51, 89, 77, 79, 51], [94, 71, 69, 14, 94, 23, 80, 88, 43, 56, 21, 30, 76, 40, 94, 22, 2, 23, 87, 86, 62, 30, 27, 98, 75, 93, 37, 70, 16, 20, 74, 46, 74, 25, 59, 86, 32, 17, 90, 80, 10, 17, 2, 66, 29, 4, 30, 61], [58, 76, 34, 78, 24, 88, 82, 25, 89, 25, 92, 30, 55, 89, 24, 39, 77, 2, 34, 16, 48, 24, 50, 2, 93, 39, 81, 59, 23, 12, 77, 69, 15, 60, 64, 2, 70, 64, 36, 87, 13, 2, 5, 40, 80, 64, 39, 35], [57, 41, 45, 34, 19, 90, 42, 17, 35, 76, 35, 6, 52, 74, 43, 23, 83, 43, 53, 72, 73, 67, 97, 66, 34, 35, 82, 27, 27, 64, 39, 60, 81, 73, 96, 23, 78, 11, 4, 51, 38, 51, 48, 80, 36, 25, 5, 74]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0], [69, 62, 79, 46, 48, 38, 61, 81, 17, 48, 33, 18, 36, 54, 3, 89, 99, 20], [31, 21, 34, 57, 37, 1, 57, 55, 31, 23, 75, 48, 20, 7, 99, 2, 97, 40], [24, 74, 9, 43, 97, 51, 85, 78, 50, 87, 76, 22, 92, 91, 10, 82, 88, 67], [4, 30, 85, 22, 92, 73, 41, 16, 56, 69, 14, 52, 14, 47, 16, 43, 68, 37], [14, 41, 87, 73, 24, 75, 92, 19, 83, 12, 47, 98, 12, 3, 30, 58, 46, 51], [99, 15, 43, 22, 9, 92, 93, 39, 81, 68, 57, 68, 7, 2, 54, 37, 74, 82], [28, 59, 46, 63, 35, 99, 94, 85, 58, 89, 13, 71, 6, 84, 45, 5, 38, 44], [25, 82, 88, 15, 72, 77, 39, 48, 52, 60, 89, 23, 69, 52, 86, 22, 25, 55], [64, 65, 4, 52, 32, 53, 26, 79, 35, 91, 14, 34, 60, 25, 54, 27, 21, 48], [35, 52, 70, 99, 26, 15, 5, 90, 33, 25, 81, 52, 44, 20, 56, 66, 8, 83], [64, 29, 48, 19, 9, 72, 15, 98, 68, 63, 91, 38, 47, 13, 96, 99, 46, 36], [10, 55, 23, 23, 68, 44, 5, 4, 30, 52, 97, 13, 18, 32, 33, 58, 62, 71], [14, 14, 10, 59, 39, 46, 18, 19, 37, 3, 55, 7, 71, 52, 54, 38, 63, 64], [6, 74, 52, 44, 36, 37, 64, 48, 27, 65, 1, 48, 85, 37, 92, 49, 55, 39], [36, 66, 66, 68, 2, 65, 18, 41, 98, 91, 39, 26, 75, 3, 49, 28, 16, 99], [22, 80, 97, 77, 49, 28, 16, 64, 60, 66, 26, 42, 92, 3, 21, 32, 70, 69], [24, 65, 23, 80, 8, 45, 89, 11, 57, 12, 72, 10, 63, 35, 38, 21, 51, 18]], [[0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 19, 2, 93, 66, 82, 36, 56], [21, 97, 63, 2, 74, 15, 62, 12, 3, 4, 9, 46, 42, 74, 31, 37, 11, 61, 27, 46, 70, 94, 43, 99, 45], [18, 50, 6, 13, 12, 7, 14, 73, 99, 47, 7, 39, 56, 85, 19, 27, 61, 66, 52, 56, 14, 33, 12, 85, 94], [86, 66, 93, 24, 96, 45, 76, 55, 71, 53, 66, 19, 51, 82, 98, 66, 45, 40, 83, 6, 51, 41, 47, 17, 23], [40, 73, 37, 85, 58, 21, 27, 11, 39, 94, 63, 28, 84, 47, 47, 4, 61, 18, 50, 93, 36, 91, 1, 35, 5], [6, 60, 5, 32, 39, 95, 40, 42, 74, 95, 8, 91, 29, 60, 78, 23, 4, 34, 38, 61, 27, 83, 31, 3, 93], [77, 27, 43, 60, 96, 46, 37, 67, 6, 59, 3, 77, 11, 27, 2, 64, 44, 76, 55, 40, 76, 23, 64, 95, 57], [10, 35, 6, 89, 95, 54, 94, 79, 67, 82, 56, 81, 60, 14, 46, 16, 27, 37, 97, 61, 20, 25, 50, 58, 78], [37, 5, 54, 37, 74, 10, 9, 78, 33, 93, 24, 70, 57, 26, 39, 44, 64, 48, 67, 48, 40, 46, 96, 90, 3], [76, 14, 83, 4, 12, 99, 23, 3, 3, 42, 80, 77, 19, 28, 38, 9, 56, 17, 7, 72, 76, 54, 28, 66, 28], [25, 91, 99, 79, 49, 48, 99, 47, 62, 33, 42, 87, 27, 8, 62, 38, 4, 54, 48, 69, 16, 61, 18, 45, 18], [8, 29, 21, 54, 91, 47, 66, 68, 48, 76, 80, 89, 23, 17, 61, 52, 42, 51, 1, 21, 57, 36, 2, 23, 60], [59, 66, 43, 59, 74, 73, 93, 90, 36, 60, 93, 4, 21, 97, 95, 92, 97, 4, 4, 33, 14, 9, 88, 64, 62], [89, 7, 92, 5, 13, 2, 84, 12, 91, 7, 34, 21, 60, 82, 10, 38, 58, 56, 44, 85, 80, 64, 20, 50, 54], [46, 40, 24, 85, 58, 31, 50, 10, 84, 14, 19, 30, 57, 16, 22, 54, 84, 70, 43, 97, 19, 5, 71, 98, 20], [15, 38, 1, 5, 98, 54, 85, 61, 78, 17, 76, 27, 70, 25, 91, 45, 2, 22, 96, 54, 17, 61, 66, 26, 56], [33, 1, 40, 43, 44, 62, 36, 56, 39, 89, 13, 39, 12, 21, 87, 18, 13, 19, 35, 46, 57, 34, 62, 56, 1], [57, 86, 28, 4, 71, 75, 76, 40, 53, 39, 35, 98, 82, 10, 51, 64, 79, 59, 26, 3, 77, 98, 17, 65, 78], [1, 88, 57, 11, 67, 77, 55, 86, 41, 59, 30, 25, 71, 64, 89, 25, 66, 34, 55, 58, 86, 54, 1, 18, 16], [56, 74, 31, 48, 77, 34, 34, 60, 76, 37, 40, 17, 41, 56, 54, 79, 13, 46, 72, 17, 11, 40, 46, 65, 32], [52, 10, 59, 15, 3, 9, 8, 74, 8, 16, 11, 23, 56, 56, 22, 18, 39, 3, 8, 5, 91, 5, 19, 81, 61], [46, 18, 61, 60, 2, 50, 63, 71, 49, 80, 71, 18, 90, 93, 16, 46, 94, 25, 8, 64, 14, 22, 78, 91, 35], [51, 76, 43, 85, 75, 3, 73, 55, 19, 42, 61, 23, 80, 4, 96, 65, 4, 59, 90, 91, 80, 30, 33, 80, 33], [20, 95, 48, 27, 32, 86, 27, 25, 66, 87, 12, 46, 48, 85, 75, 85, 37, 4, 90, 84, 61, 71, 47, 91, 47], [17, 32, 10, 50, 75, 59, 18, 66, 35, 6, 3, 71, 35, 77, 66, 66, 51, 72, 73, 34, 39, 95, 93, 49, 47]], [[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 95, 83, 85, 49, 74], [4, 62, 18, 60, 64, 20, 52, 36, 62, 48, 96, 57, 57, 91, 41, 88, 93, 53, 88, 62, 29, 39, 82], [10, 61, 56, 9, 50, 75, 12, 2, 90, 73, 17, 35, 46, 67, 70, 87, 35, 79, 72, 96, 34, 11, 3], [93, 10, 82, 82, 12, 91, 51, 83, 97, 89, 59, 2, 2, 5, 22, 33, 69, 28, 58, 14, 50, 74, 41], [15, 74, 68, 43, 55, 49, 18, 81, 95, 97, 25, 12, 55, 47, 85, 81, 84, 93, 67, 71, 64, 60, 97], [90, 84, 43, 37, 32, 99, 85, 52, 53, 56, 72, 2, 48, 16, 91, 36, 10, 92, 81, 89, 79, 18, 92], [2, 40, 42, 95, 95, 25, 1, 82, 16, 42, 37, 37, 71, 6, 78, 22, 95, 74, 46, 40, 54, 46, 36], [41, 98, 67, 23, 43, 61, 17, 93, 65, 3, 78, 75, 30, 21, 16, 62, 60, 9, 66, 26, 67, 15, 12], [19, 14, 15, 87, 11, 63, 43, 67, 43, 1, 4, 85, 25, 84, 74, 82, 97, 53, 35, 25, 3, 51, 50], [13, 35, 89, 55, 18, 51, 30, 40, 30, 58, 88, 90, 65, 97, 72, 12, 8, 75, 78, 18, 65, 85, 10], [37, 29, 46, 88, 44, 36, 18, 79, 32, 20, 34, 73, 41, 98, 35, 57, 27, 18, 21, 18, 27, 95, 28], [97, 15, 45, 47, 36, 19, 99, 96, 45, 57, 76, 29, 98, 16, 22, 72, 55, 12, 98, 16, 55, 47, 73], [27, 99, 11, 83, 95, 15, 53, 91, 33, 71, 87, 22, 65, 58, 27, 75, 12, 60, 85, 72, 77, 33, 66], [9, 77, 26, 45, 55, 52, 9, 79, 7, 57, 57, 37, 73, 78, 30, 51, 47, 84, 54, 23, 79, 58, 56], [31, 68, 89, 62, 83, 60, 37, 34, 1, 41, 95, 44, 35, 27, 21, 72, 82, 23, 41, 93, 80, 50, 74], [81, 22, 40, 2, 42, 30, 44, 83, 10, 84, 63, 24, 6, 45, 18, 16, 40, 16, 79, 70, 97, 13, 68], [96, 50, 29, 58, 7, 97, 5, 40, 4, 7, 80, 37, 75, 59, 50, 69, 29, 55, 89, 67, 96, 30, 20], [94, 67, 61, 44, 56, 79, 60, 41, 78, 40, 50, 10, 17, 15, 93, 53, 98, 99, 73, 51, 81, 66, 26], [38, 92, 30, 55, 9, 92, 16, 24, 86, 20, 62, 52, 78, 52, 43, 96, 10, 66, 71, 65, 15, 75, 84], [50, 41, 60, 33, 52, 38, 84, 64, 10, 96, 50, 63, 59, 12, 58, 89, 9, 49, 61, 81, 78, 88, 51], [45, 67, 80, 18, 61, 50, 14, 10, 74, 6, 3, 86, 2, 76, 1, 52, 13, 32, 25, 38, 5, 18, 10], [53, 83, 34, 30, 32, 11, 86, 30, 1, 6, 78, 56, 67, 58, 79, 95, 19, 61, 62, 86, 71, 91, 35], [43, 5, 46, 35, 87, 36, 4, 61, 2, 35, 46, 4, 60, 48, 4, 70, 51, 17, 4, 86, 57, 85, 76]]]; int [] param1 = [3, 3, 3, 3, 1, 1, 10, 15, 17]; int [] param2 = [4, 4, 4, 4, 28, 32, 12, 17, 22]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i], param2[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WAYS_REMOVE_ONE_ELEMENT_BINARY_STRING_XOR_BECOMES_ZERO,"static int f_filled ( String s ) { int one_count = 0 , zero_count = 0 ; char [ ] str = s . toCharArray ( ) ; int n = str . length ; for ( int i = 0 ; i < n ; i ++ ) if ( str [ i ] == '1' ) one_count ++ ; else zero_count ++ ; if ( one_count % 2 == 0 ) return zero_count ; return one_count ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [7, 1, 2, 9, 1, 5, 12, 1, 4, 9]; string [] param0 = [""kfctjnp"", ""05312505872"", ""100111"", ""tdeehkxrq"", ""50824233019"", ""10001110010"", ""t sezanm myq"", ""838415739"", ""01110100"", ""wyqiaey h""]; 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); } " WAYS_TRANSFORMING_ONE_STRING_REMOVING_0_CHARACTERS,"static int f_filled ( String a , String b ) { int n = a . length ( ) , m = b . length ( ) ; if ( m == 0 ) { return 1 ; } int dp [ ] [ ] = new int [ m + 1 ] [ n + 1 ] ; for ( int i = 0 ; i < m ; i ++ ) { for ( int j = i ; j < n ; j ++ ) { if ( i == 0 ) { if ( j == 0 ) { dp [ i ] [ j ] = ( a . charAt ( j ) == b . charAt ( i ) ) ? 1 : 0 ; } else if ( a . charAt ( j ) == b . charAt ( i ) ) { dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + 1 ; } else { dp [ i ] [ j ] = dp [ i ] [ j - 1 ] ; } } else if ( a . charAt ( j ) == b . charAt ( i ) ) { dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i - 1 ] [ j - 1 ] ; } else { dp [ i ] [ j ] = dp [ i ] [ j - 1 ] ; } } } return dp [ m - 1 ] [ n - 1 ] ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [3, 4, 1, 0, 0, 11, 0, 1, 7, 1]; string [] param0 = [""abcccdf"", ""aabba"", ""aabsdfljk"", ""ioniqv"", ""9667771256770"", ""10001011"", ""fczbdtmdt"", ""298746088"", ""01100011000"", ""qk""]; string [] param1 = [""abccdf"", ""ab"", ""aa"", ""xkbbigz"", ""50915176"", ""01"", ""fbx"", ""29888"", ""0"", """"]; 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); } " WILDCARD_CHARACTER_MATCHING,"static boolean f_filled ( String first , String second ) { if ( first . length ( ) == 0 && second . length ( ) == 0 ) return true ; if ( first . length ( ) > 1 && first . charAt ( 0 ) == '*' && second . length ( ) == 0 ) return false ; if ( ( first . length ( ) > 1 && first . charAt ( 0 ) == '?' ) || ( first . length ( ) != 0 && second . length ( ) != 0 && first . charAt ( 0 ) == second . charAt ( 0 ) ) ) return f_filled ( first . substring ( 1 ) , second . substring ( 1 ) ) ; if ( first . length ( ) > 0 && first . charAt ( 0 ) == '*' ) return f_filled ( first . substring ( 1 ) , second ) || f_filled ( first , second . substring ( 1 ) ) ; return false ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, false, false, true, false, true, true, true, false]; string [] param0 = [""g*ks"", ""ge?ks*"", ""g*k"", ""*pqrs"", ""abc*bcd"", ""abc*c?d"", ""*c*d"", ""*?c*d"", ""?*1"", ""a*""]; string [] param1 = [""geeks"", ""geeksforgeeks"", ""gee"", ""pqrst"", ""abcdhghgbcd"", ""abcd"", ""abcd"", ""abcd"", ""010111111001"", ""cbzhmjugcujd""]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WRITE_AN_EFFICIENT_METHOD_TO_CHECK_IF_A_NUMBER_IS_MULTIPLE_OF_3,"static int f_filled ( int n ) { int odd_count = 0 ; int even_count = 0 ; if ( n < 0 ) n = - n ; if ( n == 0 ) return 1 ; if ( n == 1 ) return 0 ; while ( n != 0 ) { if ( ( n & 1 ) != 0 ) odd_count ++ ; if ( ( n & 2 ) != 0 ) even_count ++ ; n = n >> 2 ; } return f_filled ( Math . abs ( odd_count - even_count ) ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [0, 0, 0, 1, 0, 1, 0, 0, 0, 0]; int [] param0 = [94, 94, 79, 39, 16, 90, 64, 76, 83, 47]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WRITE_A_C_PROGRAM_TO_CALCULATE_POWXN,"static int f_filled ( int x , int y ) { if ( y == 0 ) return 1 ; else if ( y % 2 == 0 ) return f_filled ( x , y / 2 ) * f_filled ( x , y / 2 ) ; else return x * f_filled ( x , y / 2 ) * f_filled ( x , y / 2 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [36, 4782969, 0, 1, 6, 1, 117649, 100, 1679616, 1]; int [] param0 = [6, 9, 0, 1, 6, 1, 7, 10, 6, 9]; int [] param1 = [2, 7, 2, 6, 1, 9, 6, 2, 8, 0]; 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); } " WRITE_A_C_PROGRAM_TO_FIND_THE_PARITY_OF_AN_UNSIGNED_INTEGER,"static boolean f_filled ( int n ) { boolean parity = false ; while ( n != 0 ) { parity = ! parity ; n = n & ( n - 1 ) ; } return parity ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [false, true, false, false, false, false, true, true, true, true]; int [] param0 = [3, 64, 85, 36, 20, 63, 42, 19, 62, 97]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO,"static boolean f_filled ( int n ) { if ( n == 0 ) return false ; while ( n != 1 ) { if ( n % 2 != 0 ) return false ; n = n / 2 ; } return true ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, false, false, false, false, false, false]; int [] param0 = [1, 2, 8, 1024, 24, 7, 46, 61, 73, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WRITE_ONE_LINE_C_FUNCTION_TO_FIND_WHETHER_A_NO_IS_POWER_OF_TWO_1,"static boolean f_filled ( int x ) { return x != 0 && ( ( x & ( x - 1 ) ) == 0 ) ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ bool [] results = [true, true, true, true, false, false, false, false, false, false]; int [] param0 = [1, 2, 8, 1024, 24, 7, 46, 61, 73, 66]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " WRITE_YOU_OWN_POWER_WITHOUT_USING_MULTIPLICATION_AND_DIVISION,"static int f_filled ( int a , int b ) { if ( b == 0 ) return 1 ; int answer = a ; int increment = a ; int i , j ; for ( i = 1 ; i < b ; i ++ ) { for ( j = 1 ; j < a ; j ++ ) { answer += increment ; } increment = answer ; } return answer ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [1296, 262144, 256, 125, 4096, 100, 19683, 2401, 10077696, 371293]; int [] param0 = [6, 8, 2, 5, 4, 10, 3, 7, 6, 13]; int [] param1 = [4, 6, 8, 3, 6, 2, 9, 4, 9, 5]; int n_success = 0; for (int i = 0; i < param0.length; i++) { if (results[i] == f_filled(param0[i], param1[i])) { n_success += 1; }} writefln(""#Results:%d, %d"", n_success, param0.length); } " ZECKENDORFS_THEOREM_NON_NEIGHBOURING_FIBONACCI_REPRESENTATION,"static int f_filled ( int n ) { if ( n == 0 || n == 1 ) return n ; int f1 = 0 , f2 = 1 , f3 = 1 ; while ( f3 <= n ) { f1 = f2 ; f2 = f3 ; f3 = f1 + f2 ; } return f2 ; }","import std.stdio; import std.math; import std.conv; import std.algorithm; //TOFILL// void main(){ int [] results = [34, 55, 55, 55, 89, 34, 55, 89, 89, 55]; int [] param0 = [54, 71, 64, 71, 96, 43, 70, 94, 95, 69]; 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); } "