type
stringclasses 4
values | content_without_mask
stringlengths 610
1.37M
| content_masked
stringlengths 609
1.37M
| label
stringclasses 362
values | options
sequencelengths 5
5
| correct
stringclasses 5
values |
---|---|---|---|---|---|
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int n ) {
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 );
}
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int n ) {
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,5,44,15,72,2,86,17,30,42};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( int n [MASK] { return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 ); }
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int n ) {
return ( 3.0 * n ) / ( 4.0 * ( n * n ) - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,5,44,15,72,2,86,17,30,42};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) ])",
"b) :",
"c) ],",
"d) \"0\"",
"e) )"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string N ) {
int len = N . length ( );
int l = ( len ) / 2;
int count = 0;
for ( int i = 1;
i <= l;
i ++ ) {
string s = N . substr ( 0, i );
int l1 = s . length ( );
string t = N . substr ( i, l1 );
if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue;
if ( s . compare ( t ) == 0 ) count ++;
}
return count;
}
( 0, i );
int l1 = s . length ( );
string t = N . substr ( i, l1 );
if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue;
if ( s . compare ( t ) == 0 ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZCoQhuM","2674377254","11","LbuGlvRyWAPBpo","26382426486138","111010111010","hUInqJXNdbfP","5191","1110101101","2202200"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string N ) { int len = N . length ( ); int l = ( len ) / 2; int count = 0; for ( int i = 1; i <= l; i ++ ) { string s = N . substr ( 0, i ); int l1 = s . length ( ); [MASK] t = N . substr ( i, l1 ); if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue; if ( s . compare ( t ) == 0 ) count ++; } return count; } ( 0, i );
int l1 = s . length ( );
string t = N . substr ( i, l1 );
if ( s [ 0 ] == '0' || t [ 0 ] == '0' ) continue;
if ( s . compare ( t ) == 0 ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZCoQhuM","2674377254","11","LbuGlvRyWAPBpo","26382426486138","111010111010","hUInqJXNdbfP","5191","1110101101","2202200"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | string | [
"a) javafx.util.Pair;",
"b) 2",
"c) <<",
"d) string",
"e) n"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
return max ( ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ), n );
}
<iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
return max ( ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ), n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {39,79,7,76,48,18,58,17,36,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { if ( n == 0 || n == 1 ) return n; return max [MASK] ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ), n ); }<iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
return max ( ( f_gold ( n / 2 ) + f_gold ( n / 3 ) + f_gold ( n / 4 ) ), n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {39,79,7,76,48,18,58,17,36,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) (",
"b) {",
"c) #include",
"d) return",
"e) 2"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int k ) {
int sorted1 [ 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 ];
}
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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {27,18,30,11,19,24,1,22,42,14};
vector<int> param3 {21,11,31,11,26,17,1,19,40,22};
vector<int> param4 {23,12,42,13,28,23,1,24,42,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int k ) { int sorted1 [ 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 [ [MASK] ++ ] = arr1 [ i ++ ]; while ( j < n ) sorted1 [ d ++ ] = arr2 [ j ++ ]; return sorted1 [ k - 1 ]; } 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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {27,18,30,11,19,24,1,22,42,14};
vector<int> param3 {21,11,31,11,26,17,1,19,40,22};
vector<int> param4 {23,12,42,13,28,23,1,24,42,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | d | [
"a) ],",
"b) (",
"c) if",
"d) {",
"e) d"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
return arr [ n - 1 ] + arr [ n - 2 ] + arr [ n - 3 ];
}
de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
return arr [ n - 1 ] + arr [ n - 2 ] + arr [ n - 3 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{24,24,44,28,-88,18,34,92,-84,94,-12,30,-82,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{95,75,5,51,67,63,26,47,70,11,21,9,18,31,76,66,81,73,63,55,16,72,15,28,25,25,35,79,4,73,23,87,2,1,92,94,18,70,87,27,34,84,12},{-86,-86,-78,-56,-24,-14,-10,-6,12,12,18,22,22,26,50,50,72,78,94},{0,1,1,1,1,1,0,0,0,1,1,1,0,0,0},{2,13,17,19,20,23,28,28,29,40,45,51,52,58,58,68,70,75,79,81,92,96,97},{94,6,52,6,-78,40,-46,-20,64,76,-36,-62,50,-4,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{34,11,15,42,32,4,6,25,52,44,14,57,3,44,7,89,35,3,70,66,58,22,5,17,33,11}};
vector<int> param1 {26,8,15,37,9,9,15,13,27,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { sort ( arr, arr + n ); return arr [ n - 1 ] + arr [MASK] n - 2 ] + arr [ n - 3 ]; }de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
return arr [ n - 1 ] + arr [ n - 2 ] + arr [ n - 3 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{24,24,44,28,-88,18,34,92,-84,94,-12,30,-82,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{95,75,5,51,67,63,26,47,70,11,21,9,18,31,76,66,81,73,63,55,16,72,15,28,25,25,35,79,4,73,23,87,2,1,92,94,18,70,87,27,34,84,12},{-86,-86,-78,-56,-24,-14,-10,-6,12,12,18,22,22,26,50,50,72,78,94},{0,1,1,1,1,1,0,0,0,1,1,1,0,0,0},{2,13,17,19,20,23,28,28,29,40,45,51,52,58,58,68,70,75,79,81,92,96,97},{94,6,52,6,-78,40,-46,-20,64,76,-36,-62,50,-4,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{34,11,15,42,32,4,6,25,52,44,14,57,3,44,7,89,35,3,70,66,58,22,5,17,33,11}};
vector<int> param1 {26,8,15,37,9,9,15,13,27,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) import",
"b) return",
"c) %",
"d) [",
"e) 0.0246"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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;
}
) 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {37,31,8,16,17,11,31,42,25,9};
vector<int> param2 {23,29,12,13,14,10,35,26,21,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int x ) { int curr_sum [MASK] 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; } ) 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {37,31,8,16,17,11,31,42,25,9};
vector<int> param2 {23,29,12,13,14,10,35,26,21,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) n;",
"b) =",
"c) sum",
"d) )",
"e) i"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( const vector < vector < int > > & matrix ) {
int rows = matrix . size ( );
if ( rows == 0 ) return false;
int columns = matrix [ 0 ] . size ( );
unordered_map < int, unordered_set < int > > table;
for ( int i = 0;
i < rows;
++ i ) {
for ( int j = 0;
j < columns - 1;
++ j ) {
for ( int k = j + 1;
k < columns;
++ k ) {
if ( matrix [ i ] [ j ] == 1 && matrix [ i ] [ k ] == 1 ) {
if ( table . find ( j ) != table . end ( ) && table [ j ] . find ( k ) != table [ j ] . end ( ) ) return true;
table [ j ] . insert ( k );
}
}
}
}
return false;
}
if ( table . find ( j ) != table . end ( ) && table [ j ] . find ( k ) != table [ j ] . end ( ) ) return true;
table [ j ] . insert ( k );
}
}
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<vector<int>>> param0 {{{48,25,59,46,32,28,36,78,51,68,32,63,94,45,90,93,95,29,66,1,55,53,49,16,51,17,18,84,42,99,81,70,8,40,38,24,15,69,87,65,62,15,13,34,47,97,25,79,89},{59,6,26,37,34,82,74,80,97,4,74,32,65,10,20,91,19,66,32,12,6,20,61,43,86,65,61,57,20,34,75,83,94,60,18,17,28,64,32,15,64,2,73,25,17,58},{53,73,23,77,38,21,75,40,32,24,71,27,77,18,79,76,40,76,7,32,33,52,19,34,29,64,73,13,6,54,1,27,38,78,68,29,25,29,74,8},{2,64,70,65,78,75,79,86,6,23,42,53,55,41,19,65,85,26,47,78,90,51,43},{63,34,35,15,75,35,20,41,85,7,97,95,11,7,13},{64,9,44,1,49,51,44,6,54,73,37,89,29,73,50,36,15,92,1,51,33,83,89,95,61,50,70,73,75,67,42,81,21,86,80,76,97,47,28,54},{41,2,65,77,25,93,77,12,49,35,56,48,73,75,89,41,52,11,81,5,11,92,22,3,61,99,68,69,31,41,74,9,92,58,53,12,65,93},{76,91,13,62,90,27,53,8,87,71,9,8,96,40,8,24,72,96,50,23,58,49,88,83,60,84,75,49,80,95,29,69,77,24,7,96,72,5,73,6,62,54,42,94,8,97,57},{23,16,32,72,45,56,85,70,14,10,55},{8,51,31,64,57,39,52,31,76,83,69,27,35,35,71,36,87,2,34,99,17,83,60,4,8,5,19,81,96,77,94,73,39,37,2,11,12}},{{1,79,87,97,7,62,65},{6,56,66,48,88,75,72,4,97,12,88,82,26,35,82,94,1,43,57,80,49},{29,75,9,81,88,75,77,18,89,29,9,22,17,52,45,53,30,93,15,76,70,35,33,8,26,29,36,26,94,16,74,89,19,54,89,61,44,33,73,45,72,57,78,64,70,49}},{{92,95,14,97,59,45,51,87,26,68,28,6,91,2,10,45,21,2,75,21,28,95,59,37,13,27,98,66,86,73,5,93,45,91,14,93},{2,44,43,32,58,69,78,77,55,87,7,18,22,65,25,73,52,94},{48,11,61},{94,25,96,99,21,46,6,61,7,81,46},{40,64,19,36,72,69,69,62,88,40,92,57,81,70,80,24,41,90,24,95,30,61,30,59,8,6,5,40,20,80,42,29,20,26,19,27,68,48,81,17,99,63,28,66,10,73,9,89},{9,64,15,86,39,36,9,1,55,66,73,63,66,16,17,76,10,39,93,70},{43,65,31,46,94,41,83,89,95,3,43,12,6,49,8,28,64,42,16,3,95,43,94,76,16,31},{9,56,14,88,77,91,26,49,32,51,89,79,30,77,85,37,69,70,86,20,5,35,29,90,17,97,80,16,13,25,71,31,33,8,21,65,99,24,53,20,20,62},{97,23,62,90,61,89,20,47,83,56,3,34,8},{53,41,27},{94,24,80,16,31,5,31,66,1,13,77,88,40,34,15,90,46,8,26,39,52,22,33,3,30,49,51},{50,39,59,41,79},{75,82,35,14,61,77,79,9,71,25,21,58,40,44,80,92,45,46,80,74,62,71,56,59,46,35,53,31,86,65,33,47,31,20,55,73,9,96,37,51,53,98,73,21},{3,91,78,78,96,77,32,50,59,34,1,28},{50,11},{8,57,96,5,68,47,18,63,62,64,68,2,88,70,68,2,38,39,21,36,37,26,73,85,51,18,88,3,67,9,7,97,7,44,9,13,91,20,83,11,66,43,62,34,40,96,13},{4,37,63,82,19,41,18,75,56,26,44,64,97,25,44,9,72,75,14,44,91,46,2,41,22,66,26,94,73,35,60,28,49,94,73,40,83,52,39,69,4,2,98,90},{81,15,33,85,24,4,76,32,67,63,46,21,31,26,61,77,32,59,89,70,79,68,68,8},{36,36,60,94,41,69,75,36,71,3,22,13,7,74,42,2,81,35,46,44,63,11,94,45,81,10,51,59,72,74,12,55,41,72,87,82,84,19,52,13,52,1,61,59,49},{70,57,5,6,65,66,78,65,61},{2,49,22,44,27,25,1},{56,85,62,45,35,14,97,81,14,27,32,90,73,98,23,35,93,8,40,18,71,12,11,32,92,52,11,89,58,10,74,54,3,67,17,23,61,24,54,12,36,22,88,64,73,89,76,48},{27,63,60,19,6,70,11,1,66,90,29,71,18,25,21,61,52,9,84,28,10,99,42,31,69,49,5,19,28,47,48,27,62},{6,30,86,95,8,8,23,25,50,21,12,76,56,77,82,91,44,2,55,56,18,4,22,35,88,33,66,28,4,84,2,64,59},{23,33,81,16,79,14,15,4,32,77,17,43,18,37,1,13,53,52,5,66,96,30,51,61,29,62,12,55,66},{63,81,85,16,23,90,26,65,49,96,91,55,78,92,50,2,98,44,34,6,5,82},{2,67,52,5,47,22,30,25,90,76,18,15,40,45,48,79,90,24,63,33,90,25,45,93,3,5,76,6,83,76,12,2,88,78,12,7,54,74,61,97,88,90,91,20,46,33,5,12},{28,38,21,36,66,32,87,78,53,57,87,80,79,61,65,4,43,96,13},{57,44,10,43,74,3,59,35,69,25,66,92,66,57,66,3,45,9,16,7,47,50,57,46,53,90,67,89,16,82,48,81,51,80,83,84,90},{1,97,93,55,52,20,3,28,49,38,38,11,59,98,22,87,7,73,18,91,72,26,71,59,50,91},{5,26,37,44,57,84,73,13,18,96,51,33,75,36,21,56,25,99,18},{90,90,26,61},{61,21,32,48,64,48,7,69,40,63,50,63,83,80,16},{51,19,94,14,63,34,21,4,91,96,75,85,7,22,63,48,64,1,63,83,71,8,97,67,84,41,76,40,68,7,94,96,73},{33,21,45,12,24,20,4,97,31,30,17,98,73,79,63,57,28,20,86},{82,86,3,87,17,7,19,63,93,70,99,26,46,37,24,10,77,9,79,39,2,51,79,3,39},{2,77,66,19,22,51,7,28,18,19,37,28,9,69,76,16,60,78,95,77,52,99,66,82,50,37,60},{78,75,87,13,10,11,40,11,17,28,79,26,32},{95,92,17,70,28,20,42,33,60,97,52,81,79,68,32,6,40,46,75,75,84,39},{14,5,34,98,57,38,88,51,5,70,20,6,7,19,47,12,26,53,60,60,34,48,7},{19,63,38,57,85,36,13}},{{52,56,26,61,68,41,84,98,51,57,79,92,33,85,71,78,55,22,96,27,6,55,37,20,62,2,56,41,31,83,81,44,80,4,98,62,83,28},{39,93,63,3,14,44,18,95,42,14,55,54,54,87,85,57,57,27,62,73,9,13,26,14,72,37,90,42,42},{43,26,54,83,96,93,93,16,8,32,17,34,56},{59,95,94,10,62,40,36,10,6,34,7,86,71,45,82,74,96,46,15,73,35,39,76,77,69,59,7,70,75,20,67,27,5},{45,79,16,85,58,19,14,43,35,33,51,28,74,40,69,25,55,28,6,96,38,90,69,27,33,95,68,58,65,56,89,69,98,61,48,83,84,11,5,89,38,57,13,31,99,6,43},{78,61,19,19,68,83,50,72,61,90,13,28,94,79,39,78,97,13,23,54,88},{34,56,16,73,59,66,89,36,62,66,77,19,93,49,16,64,60,19,83},{25,20,66,5,51,14,98,98,57,14,76,96,8,69,91,94,46,26,44,14,67,50,1,56,21,86,36,7,68,25,51,64,27,22,84,7,31,53,71,66},{39,80,18,31,31,7,87,62,71,5,34,87,33,51,53,55,66,11,58,45,92,50,77,50,43,82,16,29,33},{33,15,80,56,82,63,24,41,77,82,19,32,21,24,45,7,70,89,37,79,14,25,51,21,58,52},{77,6,17,14,83,67,37,8,71,21,88,16,72,46,96,98,11,57,99,56,68,65,98,29,59,11,60,36,24,75,23,21,97,58,80,97,40,8,7,5,4,38},{77,26},{75,96,87,50,64,88,66,94,1,19,88,1,18,96,1,91,68,91,85,1,20,99,2,9,68},{11,7,69,96,8,58,95,89,5,87,74,61,19,3,55,72,78,36},{77,13,44,85,54,3,79,23,44,40,70,67,78,28,32,51,12,58,52,2,68,23,38,62,40,85,78,95,72,78,49},{85,42,73},{73,68,18,36,3,24,12,22,77,1,46},{60,34,33,80,37,51,42,3,2,97,7,51,97,26,46,74,31,2,40,2,67,90,43,14,4,51,6,24,26},{58,87,20,27,20,71,36,22,55,6},{16,68,60,55,44,32,99,18,83,29,79,6,45,86,30,17,98,14},{8,45,41,74,35,20,97,30,52,19,87,93,75,25,34,58,27,41,74,14,96,3,21,77,16,5,62,25,14,35,57,24,54},{12,84,26,80,68,70,8,51,2,4,38,52,8,80,14,59,72,53,63,68,61,9,84,63,46,34,31,69,3,32,53,51,61,57,48,81,5,54,3,19,31,50},{85,92,84,94,24,62,90,89,9,90,73,89,22,80,21,88,20,13,48,6,9,78,76,15,50,23,23,42,31,8,86,35,68,59,92,89,92,10,4,32,73},{72,43,43,57,37,28,69,47},{89,32,87,42,68,35,58,53,70,16,47},{73,62,55,45,25,51,77,90,50,6,56,77,81,42,24,97,25,58,91,35,22},{18,45,40,60,53,25,28,23,20,71,57,81,12,64,32,20,41,82,98,78,53,77,96,60,20,3,39,36,74,81},{91,13,77,95,17,60,98,90,92,32,14,51,2,43,78,76,8,62,84,26,42,54,7,38},{63,69,64,80,50,51,77,12,27,49,57,89,2,84,92,67,85,45,14,90,53,33,83,88,86,28,81,17,51,94,64,24,75,11,71,25,67},{13,36,67,30,47,47,51,52,30,44,20,72,53,85,10,13,43,77,6,1,16,77,53,11,23,85,39,7,63,96,32,7},{99,93,66,53,33,80,12,19,6,59,65,34,34,62,27},{85,26,38,18,35,84,24,95,3,42,3,96,37,64},{68},{86,66,83,19,20,49,97,62,84,27,57,83,46,60,92,55,88,41,37,93,41,50,18},{78,81,58,12,78,28,82,20,34,29,22,26,98,87,48,27,14,37,40,94,42,12,43,46,72,7,23,9},{4,22,78,80,32,75,84,1,66,82,73,47,34,98,41,91,67,34,62},{79,21,86,40,17,5,49,93,10,43,99,64,8,56,72,15,10,30,30,14,80,31,27,57,60,33,75,14,92,37,1,6,43,1,51,73,83},{92,57,14,51},{6,31,18,83,40,82,84,36,75,52,93,87,49,16,53,45,87,68,77,79,71,84,27,26,15,5,8,92,92,16,77,39,35,69,61,52,61},{18,91,29,92,26,43,84,31,11,83,67,18,1,54,30,93,40,35,12,31,48,82,99,71,81,22,57,44,55,8,23,45,7,82,63,37,13,98,53},{32,2,97,38,5,17,8,7},{58,94,32,44,32,95,3,16,58,45,73,89,70,64,92,30,17,94,86,5,92,38,6,9,60,83,55,56},{42,19,31,55,51,40,85,81,83,89,62},{99,19,20,28,94},{36,90,94,37,56,29,7,66,75,66,90,8,39,72,43,23,95}},{{49,88,86,47,6,1,20,49,89,17,82,98,57,51,87,75,43},{66,32,51,49,75,33,66,35,91,46,35,52,58,57,71,86,77,50,68,10,11,22,72,48,21,68,77,30,37,66,9,66,98,17,9,24,76,24,15,12},{58,83,35,37,64,27,82,97,91,51,35,39,86,85,22,60,89,14,78,61,60,76,29,21,13,52,79,4,52,96,14,91,26,88,12,54,72,56,27,84,94,23,79,54,6},{95,30,62,38,80,47,92,95,21,51,98,14,68,94,50,51,52,41,37,32,51,53,55,35,7,70,80,12,16,51,13,14,60,45,11,39,60,94},{54,88,92,62,80,72},{25,11,71,39,81,14,43,69,62,18,68,88,22,74,62,78,17,39,40,16,50,98,94,49,40,59,95,89},{48},{29,37,74,25,41,39,11,33,96,85,10,2,23,73,62,93,8,38,61,62,41,59,56,34,34,98,55,82,40,31,13,95},{81,45,51,86,54,85,12},{19,75,88,72,19,52,22,59,57,6,30,55,9,72,36,71},{48,19,30,48,53,12,73,71,45,83,36,92,32,61,28,57,40,11,92,2,41,13,64,81,98,75,96,69,62,17,19,6,52,96,66,72,36,54,6,1,34,62,81},{9,1,27,12,85,33,87,39,62,74,45}},{{80,69,6,27,11,59,18,95,25,93,9,27,26,32,98,17,38,14,76,64,95,93,29,5,12,44,8,37,39,86,82,4,35,16,86,15,92,33,99},{50,22,41,83},{77,41,89,68,74,22,90,11,12,86,37,53,8,95,65,13,84,90,35,82,20,67,29,26,35,38,84,20,57,38,90,16,82,66,23,12,40,54,57,11,16},{27,27,7,39,50,81,9,73,68,92,5,91,97,61,82,7,46,79,88,89,60,14,38,79,52,85,81,25,82,17,99,82,36,27,6},{52,97,39,73,62,35,1,38,84,71,78,84,64,39,61,78,99,20,46,27,3,65,84,40,11,37,83,92,67,2,93,20,24,20,37,49},{26,20,97,14,75,43,99,32,77,73,13,8,84,54,48,67,65,98,75,12,97,42,42,63,35,28,75,75,86,17,70,48,77,31,8,18,50,30,33,40,71,56,5,64,51,33,45,25,97},{41,44,5,95,42,19,71,73,76,32,92,69,48,93,32,30,19,51},{47,36,32,2,28,99,65,84,27,71,83,96,62,21,52,94,27,91,9,85,71,29,24,11,45,40,21,5,15,7,15,81,15,82},{43,67,4,5,90,70,21,72,40,83,24,95,34,4,47,2,93,10,80,15,79,27,60,59,46,49,32,44,45,8,91,85,28,86,64,89,70,94,50},{75,13,2,45,25,44,16,9,48,77,67,63,3,56,84,58,64,34,95,85,82,48,85},{17,74,75,16,65,14,58,60,1,60,23,71,38,37,99,65,34,12,8,25,45,1}},{{91},{14,11,41,41,98,17,76,17,18,65,89,92,17,87,8,41,18,33,7,85,68},{82,59,42,79,36,7,41,36,38,85,94,95,43},{64,55,31,36,78,74,64,36,78,24,84,10,53,75,56,91,31,3,9,19,46,92,11,39,57,63,36,88,99,46,10,71,29,33,62,29,58,98,26},{87,62,3,74,9,3},{36,8,48,42,65,2,32,60,33,55,48,2,69,93,60,49,57,61,78,46,13,40,26,26,71,80,46,65,60,50,89,35,25,19,75,13,80,87,31,93,21,99,74,49,62,65,25},{25},{94,92,53,64,15,57,27,95,4,12,81,49,23,2,50,29,29,19,95,27,77},{27,5,50,22,42,92,98,27,1,3,79,8,57,64,40,6,31,78,91,94,91,31,38,4,30,86,64,92,62,42,8,53,47,56,48,88,6,96,50,61,4,94},{62,80,11},{44,61,44,14,44,3,62,95,69,44,67,29,96,36,88,80,59,35,33,57},{5,96,55,4,54,40,67},{84,76,63,40,53,73,19,94,66,12,46,2,53,42,86,33,83,54,56,49,28,60,84,53,49,53,53,44,50,96},{55,15,82,59,39,39,72,26,57,86,18,32,26,23,37,21,54,10,71,34,95,43,38,85,60,98,28,76,7,49,48,46,59,90,45,30,6,95,15,95,18,55,43,65,76,66},{59,49,3,60,53,36,3,12,67,69,39,89,40,66,78,89,64,86,91,7},{1,95,52},{94,14,8,16,47,59,22,94,74,44,50,4,29,13,26,16,3,45,78,81,70,41,15,82,35,61,89,93,57,7,45,20,85,88,31,33,87,26,73,25,89,10,24,8},{82,90,54,75,16,22,37,57,49,99,83,41,66,75,56,82,55,95,36,74,99,34,70,37,8,39,10,98,20,2,2,45,66},{53,58,37,84,36,26,18,40,67,18,68,17,43,88,40,48,74,59,8,43,93,87,76,35,88,93,75,17,55,21,16,16,24},{85,97,20,99,92,97,55,83,61},{71,3,14,95,1,13,27,7,5,71,78,97,24,25,23,42,55,17,77,28,4,8,3,37,18,24,73,95,48,40,52,76,3,49,16,15,67,55},{82,37,65,71,34},{26,1,83,26,6,99,24,70,94,57,93,88,98,42,42,22,52,56,19,87,16,15,79,51},{2,83,91,20,45,33,5,63,89,17,4,51,12,25,6,73,72,5,26},{32,21,10,56,16,53,11,9,3,42,40,64,1,57,30,49,92,57,19,20,37,35,88,92,88,24},{43,65,42,41},{94,86,30,12,51,64,57,35,20,6,40,86,77,98,90,79,33,31,37,48,13,50,22,53,5,24,12,97,8,10,72,55,99,86,97,18,47},{22,4,24,98,94,9,31,11,64,39,45,37,74,7,6,37,10,43,66,54},{43,73,30,1,66,57,38,76,84,12,22,34,62,8,33,67,20,32,66,91,23,96,14,69,50,66,7,81,65,51,90,92,46,54,66,9,31,63,43,79,73,70,50,40,47,83},{25,40,47,67,93,59,15,6,98,28,49,9,32,97,70,51,20,50,64,40,9,73,61,93,49},{9,86,54,68,29,8,26,74,30,24,62,73,23,98,46,2},{2,34,28,57,29,2,67,78,45,86,23,9,45,63,4,6,1,78,69,46,3,82,68,56,26,7,42,79,98,64,76,6,21,91,68,35,15,50,14,64,20,2},{30,91,56,33,23,48,20,41,98,50,83,21,65,97,30,48,75,17,3,64,22,97,64,99,98,39,6,19,8,98,83,6,12},{98,58,19,21,92,81,71,69,27,39,26,23,65,76,3,4,88,9,46,80,42,45,94,69,24,20,4,94,17,4,99,99,48,38,32,95,63,96,54,87,72,65,49,32,8,42,10,17},{59,84,3,26,22,25,1,61,39,74,94,38,20,5,80,68,80,54,17,33,94,55,28},{62,76,61,55,33,38,86,90,63,72,23,82,42,44,27,87,12,27,79,83,6,25,93,37,40,5,3,53,82,76,81,43,99,79,90,68,96,50,95,40,58,5,96,83,68,72},{70,71,67,68,89,88,47,57,60,48,88,88,54,50,31,62,37,51,44,3,48,42,24,70,92,51},{75,14,18,20,46,3,53,87,48,81,6,80,85,98,88,69,70,18},{79,3,39,97,20,21,82,79,12,93},{21,69,53,54,99,25,12,79,28,40,94,7,48,53,23,6,69,7,21,17,76,47},{50,67,76,80,45,2,97,34,98,70,50,15,60,42,75,47,64,24,77,16},{27,29,77,85,69,51,46,52,69,50,65,83,30,46,56,37,42,59,83,8,29,60,39,79,95,53,26,46,63,42,46,41,24,95,79,74},{30,53,62,3,52,43,20,50,31,40,50,68,41,40,80,66,15,77},{16,42,66,74,37,62,60,45,1,40,59,35,63,12,25,74,63,53,27,37,58,22,12,51,4,2,54,17,48,14,47,45,68,67,83,28,12,39,7,90,75},{45,73,4,90,62,95,57,60,33,13,76,36,24,60,39,5,47,56,92,83,4,6,11,98,51,18,39},{93,85,94,70,30,12,61,71,97,53,94,62,92,42,43,41,94,37,16,87,89,30,16,16,26,44,6,74,53,53,67,58,7,89,31,53,87,87,75,77,5},{42,66,60,49,89,63,51,56,68,74,87,69,5,28,54,3,5,54,89,40,96,36,44,35,4,63,33,78,84,10,86,25}},{{56,83,53,71,33,13,1,84,77,26,59,37,93,34,20},{2,31,43,92,53,5,85,14,13,86,15,78,43,63,34,2,13,2,30,17,32,26,61,58,61,87},{89,95,26,54,50,76,92,86,3,62,86,40,77,32,3,61,12,61,91,78,45,65,32,42,51,62,46,20},{41,8,47,91,48,33,79,48,86},{49,52,28,42,64,32,44,54,4,84,38,52,46,67,70,23,38,53,96,47,99,98,88,54,44,95,65,37,39,91,64,49,81,8,67,70},{62,9,38,62,93,12,29,35,40,64,62,6,40,7,70,83,19,76,38,43,68,82,47,96,71,61,9,82,74,6,84,95,87,24,11,72,90,28,97,75},{60,47,82,39,70,35,93,10,22,67,56,47,11,7,21,48,74,58,9,47,52,8,39,89,64,94,26,62,94,78,8,81,44,58,9,66,21,16,96},{59,23,42,85,84,56,78,56,47,5,37,67,93,7,19,49,62,86,71,42,68,31,46,42,28,42},{62,2,90,86,8,34,20,45,53,71,19,10,53,61,84,13,55,89,79,62,6,5,44,84,4,29,62,63,97,43,66,42,43,35,94,65,8,86,67,12,81,34,55,95,26,77},{25,62},{26,73,20,85,56,2,30,73,94,7,8,86,34,75,59,90,71,62,7,22,12,5,66,63},{22,27,1,54,93,81,58,78,48,48,45,27,80,8,44,74,57,32,85,40,31,2,87,13,51,20,91},{52,80,24,20,66,10,28},{2,33,63,50,88,23,36,38,8,86,92,45},{69,5,59,20,10,58,20,10,50,36,53,29,2,73,15,61,93,26,47,2,82,82,10,3,96,59,42,35},{71,49,46,15,76,7,85,14,59,94,98,54,35,83,53,60,43,73,37,45,6},{17,6,14,10,69,77,43,80,81,54},{27,50,89,67,55,75,49,39,6,19,29,5,71,17,58,55,39,16,71,76,2,23,8,42,55,58,68,12,69,97,71,57,82,55,66,37,67},{54,11,49,78,22,43,23,73,46,51,75,19,80,85,67,68,40,1,22,77,24,15,48,39,7,62,22,44,72,6,6,71,78,57,15,25,26,15,33,9,20,38,9,10},{89,65,67,92,8,53,65,98,56,80,3,83,80,26,96,55,71,34,74},{29,57,95,2,96,41,95,94},{73,93,10,64,5,94,31,53,59,61,2,80,49,3,85,83,59,83,20,46},{86,84,26,57,29,42,15,79,72,89,61,52,58,38,65,23,14,82,61,77,2,40,66,26,20,94,45,78,85,23,29,73,65,76,91,97,41,77,98,66,77,68,70},{41,53,23,59,65,1,18,94,4,28,61,39,81,73,37,44,90},{72,15,95,49,11,56,87,86,79,86,80,39,7,88,54,74,40,31,43,75,51,94,75,60,58,11,20,5,11,10,79,8,57,26,65,13,39,8,82,9,8,48,17,35,71,81},{48,53,33,24,18,93},{94,16,72,19,10,93,84,36,26,38,54,53,87,36,44,20,4,37,9,2,72,77,16,61,2,84,4,56,64,29,25,73,80,62,49,21,14,44,73,47,65,84,33,73,8},{79,10,51,57,62,87,35,83,83,72,59,80,24,6,41,35,82,33,46,99,49,35,31,10,56,14,87,72,12},{3,5,22,51,52,5,81,61,3},{39,72,3,60,30,60,50,66,62,89,54,52,99},{20,79,87,27,69,21,11,34,8,92,23,92,33},{94,87,74,63,4,84,7,87,94,62,56,97,98,52,50,48,24,5,90,32,86,58,3,21,15,22,97,60,39,72,61,72,95,74,10,54,27},{8,48,46,62,49,28,87,10,55,56,48,33,26,54,21,79,87,57,91,84,64,27,56,32,36,47,22,7,32,46,51,74,27,66,13,61,12,52,81,71,50},{81,14,14,8,21,61,31,39,29,51,16,85,44,62,2,71,88,60,78,32,46,17,47,65,78,65,94,18,3,15,9,61,73,3,62,87,1,54,97,61,37,23,65,84,62,33,34,78,23},{3,69,92,41,72,82,69,9,20,32,24,27,15,24,48,54,42,23,91,75,30,15,66,30,93,45,8,94,59,35,94,23,79,84,39,4,24,90,62},{65,19,57,24,78,96,61,40,94,74,33,18,97,68,44,68,82,45,75,44,62,16,65,38,55,61,53,98},{11,90,89,57,89,86,83,87,15,14,76,27,52,22,12,28,4,28,49,67,81,60,29,65,25,2,91,90,34,39,74,91,36,36,11,79,51,15,92,37,27},{96,53,99},{56,55,30,39,79,3,90,99,93,68,16,93,61,76,40,49,87,14,93,90,11,57,81,55,97,17,89,64,96,46,73,38,83,86,14,5,62,39,80,89,16,99},{40,72,2,54,95,50,99,38,16,34,19,50,20,63,1,26,87,79,76,50,54,32,86,26,84,83,45,16,93,90,82,44,81,28,36},{55,78,19,48,3,55,81,47,6,88,8,85,76,94,51,45,3},{68,15,80,27,28,1,40,78,80,85,21,63,27,44,30,60,62,66},{49,42,84,79,26,75,58,2,41,36,85,9,85,6,68,45,63,58,16,87,83,53},{6,21,86,58,48,27,18,73,16,79,51,33,63,26,37,88,48,58,44,32,58,23,31},{87,77,44,15,70,89,36,79,82,3,18,76,37,79,85,97,19,53,17,74,87,58,49,76,10,9,39,36,11,75,99,10,50,70,1,47,36,7},{64,95,33,47,20,98,54,94,1,78,27,75,69,19,73,68},{94,73,97,58,51,89,18,87,72,61,98,24,83,93,13,80,48,78,33,60},{53,81,89,64,14,47,67,85,67,31,45,93,36,54,7,65,5}},{{38,67,78,64,72,89,83,96,92,65,99,92,34,51,57,98,28,57,31,62,49,60,50,81,18,62,6,84,53,52,4,26,54,39,73,75,10,12,99,87,99,24,91,15},{96,97,87,80,9,6,57},{29,78,80,91,74,17,77,10,83,17,53,30,60,61,6,78,59,68,26,24,73,52,36,98,14,32,5,7,74,97,51,65,68,11,80,48,91,66,90,38},{5,88,21,92,18,47,48,56,31,51},{48,88,70,15,82,94,64,98,47,10,14,28,34,18,51,42,33,23,98,38,71,61,72,53,92,28,29,1,11,2,65,86,44,59,4,16,26,2,58,39,32,38,83,10,80},{68,53,68,93,45,41,8,51,53,31,94,54,55,36,46,52,10,35,54,38,41},{12,30,80,25,68,48,8,18,16,88,83,74,53,16,29,43,46,42,46,78,11,10,43,72,69,2,39,66,9},{5,55,58,20,42,42,11,99,42,76,47,67,30,75,5,31,27,45,39,17,86,24,69,95,67,44,28,47,50,40,31,93,63,82},{70,95,37,49,36,56,61,43,25,19,34,21,2,54,63,24,81,3,39,49,4,49,81,78,91,83,97,11,96,14,42,16,69,28,68,98,24,67},{2,18,22,44,77,52,62,24,46,40,44,30,29,49,47,20,85,99,47,16,34,50},{29,42,24,58,44,59,24,48,96,6,88,89,8,86,69,33,79,95,3,2,57,7,91,85,88,79,44,47,98,78,16,15,3,65,41,58,21},{28,8,36,76,17,41,2,67},{67,62,33,39,36,62,95,11,40},{67,38,49,22,76,82,26,78,79,7},{54,6,71,82,1,60,34,89,9,19,97,37,22,37,65,71,21,74,33},{34,1,41,10,87,39,9,70,18,79,41,18,67,28,9,27,81,10,12,66,72,34,99,37},{58,93,24,14,5,35,53,84,61,13,80,22,26,88,87,7,14},{97,9,67,61,4,72,63,91,77,57,14,98,99,20,6,71,66,39,76,80,45,21,82,41,20,88,24,10,11,7,93,38,71,92,40,81,69,15,52,49,54,18,92,33,21,91,21,5},{77,92,26,58,72,55,76,18,13,59,9,12,31,24,36,33,71,87,55,19,42,25,82,66,34},{81,4,22,35,98,59,27,67,72,4,69,88,39,73,55,96,25,56,70,49,88,61,34,20},{66,64,38,47,88,86,78,12,4},{48,13,19,77,49,93,58,15,20,1,98,11,86,96,43,28,87,84,82,16,64,55,99,65,26,85,35,54,17,97,63,12,43,74,65,13},{63,16,94,97,94,85},{5,50,19,79,48,73,85,65,37,95,50,83,33,80,43,87,4,34,96,60,25,44,45,71,25,11,47,5,13,4,90,64,20,98,44,26,61},{20,42,31,16,76,4,88,97,36,81,37,69,43,83},{15,76,8,82,90,32,89,23,24,47,50,61,38,29,27,91,86,78,91,4,79,35,58,25,7,64},{35,71,14,29,11,35,61,21,61,26,27,93,95,77,5,33,94,67,57,61,28,90,60,2,67,94,18,79,62,48,89,61},{93,46,35,32,25,59,87,24,46,98,20,5},{42,77,82,41,35,8,91,12,44,22,91,56,85,79,65,36,3,94,73,75,48,17,96,23,61,6,28,63,33},{75,98,72,69,35,90,42,44,28,64,4,58,76,2,28,33,14,7,98,36,19,52,33,66,35},{88,57,47,21,50,83,48,93,25,25,35,39,34,98,80,22,14,48,64,77,87,56,27,33,15,81,55,72,5,25,2,88,17,73,12,3,92,80,5,8,27,44,50,4,69},{90,94,15,78,79,78,16,22,85,33,39,30,26,22,73,37,25,16,70,62,26,3,30,46,33,68,91,93,26,60,85,45,62,75,2,10,33,7,69,30,29,46,94},{35,58,73,81,93,12,83,37,63,60,89,40,32},{54,63,76,76,77,50,2,53,82,50,46,5,49,37},{77,16,95},{6,66,1,16,10,52,61,28,95,56,49,60,46,75,4,49,9,81,93,5},{93,71,54,16,35,58,91,36,98,76,65,98,45,69,19,1,49,38,85,91,52,9,20,95,38,81,32,1,70,71,50,93,62,3,23,34,35,63,55,62,12,14,3,48,31,35,10,90},{76,14,65,74,49,58,56,26,27,5,22,82,85,18,26,71,71,73,27,9,86,98,78},{97,68,59,18,81,34,52,55,15,59,22,35,64,87,96,23,24,17,30,20,15,16,84,32,32,24,5}},{{2,95,2},{92,62,11,25,66,2,91,54,77,28,94,15,90,63},{1,58,34,7,40,62,94,25,30,33,53,33,92,4,55,4,82,32,62,36,24,84},{54,63,7,55,37,64,44,55,55,28,2,42,97,3,99,99,24,86,84,17,41,87,68,34,17,70,23,84,74,4,78,84,83,48,75},{73,99,81,84,54,2,23,11,8},{75,17,49,12,17,53,58,1,64,83,29,36,96,34,89,62,95,38,41,95,16,31,62,52,2,91,5,90,35,20},{88,82,21,25,94,12,88,85,42,76,59,72,23,20,41,15,5,42,52,45,20},{56,69,48,44,39,97,32,88,70,71,75,39,42,32,45,87,43,9,70,38,39,60,70,19,90,45,57},{80,81,38,79,44,94,9,59,20,31,64,67,70,37,94,68,94,69,26,63,54,2,76,95,27,7,6,32,19,27,44,44,59,81,94,4,92,19,92,14,55,74,2,29,28,98,16,34},{94,5,74,9,55,74,73,32,92,11,90,97},{78,65,56,81,62,51,99,11,94,42,35,94,73,85,75,65,25,27,81,94,3,6,75,5},{10,35,64,71,9,86,93,13,40,23,39,65,48,76,53,5,87,63,62,74,38,90,21,31,38,14,86,61,78,65,96,29,53,81,79,8,36,28,53,60,64,9,35,79,40,69,5,5,56},{63,89,75,22,83,98,97,16,76,2,55,50},{20,98,48,99,69,23,73,99,53,81,74,40,74,71,29,34,51,37,68,96,83,12,97,68,59,34,70},{62,3,97,59,36,26,42,66,92,60,1,80,4,66,9,76,45,41,65,67,87,78,49,60,7,33,53,55},{58,24,52,50,98,4,4,10,32,6,18,71,42,32,27,63,72,18,85,83,45,95,31,97,94,82,39,74,12,85,22,40,34,17,2},{1,48,96,7,6,56,62,88,39,77,5,98,20,69,26,13,57,4,57,64,24,16,27,81,7,49,46,93,13,17,26,13,81,65},{51,47,12,60,89,15,93,53},{21,6,26,25,28,44,73,28,63,27,64,21,50,85,75,44,86,97,34,69,36,27,26,86},{21,3,65,94,90,72,71,83,39,78,41,90,82,70,23,72,99,48,97,87},{56,35,92,24,99,1,5,82,51,68},{72,44,64,59},{77,58,8,45,22,83,81,65,23,56,81},{28,93,96,10,24,13,24,60,37,17,91,54,69,46,8,93,15,96,17,25,75,9,36,76,34,29,8,28,56,8,71,37,20,38,45,47,73,86,52,13,96,90,35,11},{96,29,14,84,59,14,28,52,80,22,10,94,18,67,39,52,72},{17,45,48,54,57,68,56,17,86,24,1,67,87,60,58,98,45,80,32},{84,89,7,59,5,20,40,81,80,5,80}}};
for (int i =0; i < param0.size(); i+=2 )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k]= param0[i][j][k] %2;
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( const vector < vector < int > > & matrix ) { int rows = matrix . size ( ); if ( rows == 0 ) return false; int columns = matrix [ 0 ] . size ( ); unordered_map < int, unordered_set < int > > table; for ( int i = 0; i < rows; ++ i ) { for ( int j = 0; j < columns - 1; ++ j ) { for ( int k = j + 1; k < columns; ++ k ) { if ( matrix [ i [MASK] [ j ] == 1 && matrix [ i ] [ k ] == 1 ) { if ( table . find ( j ) != table . end ( ) && table [ j ] . find ( k ) != table [ j ] . end ( ) ) return true; table [ j ] . insert ( k ); } } } } return false; } if ( table . find ( j ) != table . end ( ) && table [ j ] . find ( k ) != table [ j ] . end ( ) ) return true;
table [ j ] . insert ( k );
}
}
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<vector<int>>> param0 {{{48,25,59,46,32,28,36,78,51,68,32,63,94,45,90,93,95,29,66,1,55,53,49,16,51,17,18,84,42,99,81,70,8,40,38,24,15,69,87,65,62,15,13,34,47,97,25,79,89},{59,6,26,37,34,82,74,80,97,4,74,32,65,10,20,91,19,66,32,12,6,20,61,43,86,65,61,57,20,34,75,83,94,60,18,17,28,64,32,15,64,2,73,25,17,58},{53,73,23,77,38,21,75,40,32,24,71,27,77,18,79,76,40,76,7,32,33,52,19,34,29,64,73,13,6,54,1,27,38,78,68,29,25,29,74,8},{2,64,70,65,78,75,79,86,6,23,42,53,55,41,19,65,85,26,47,78,90,51,43},{63,34,35,15,75,35,20,41,85,7,97,95,11,7,13},{64,9,44,1,49,51,44,6,54,73,37,89,29,73,50,36,15,92,1,51,33,83,89,95,61,50,70,73,75,67,42,81,21,86,80,76,97,47,28,54},{41,2,65,77,25,93,77,12,49,35,56,48,73,75,89,41,52,11,81,5,11,92,22,3,61,99,68,69,31,41,74,9,92,58,53,12,65,93},{76,91,13,62,90,27,53,8,87,71,9,8,96,40,8,24,72,96,50,23,58,49,88,83,60,84,75,49,80,95,29,69,77,24,7,96,72,5,73,6,62,54,42,94,8,97,57},{23,16,32,72,45,56,85,70,14,10,55},{8,51,31,64,57,39,52,31,76,83,69,27,35,35,71,36,87,2,34,99,17,83,60,4,8,5,19,81,96,77,94,73,39,37,2,11,12}},{{1,79,87,97,7,62,65},{6,56,66,48,88,75,72,4,97,12,88,82,26,35,82,94,1,43,57,80,49},{29,75,9,81,88,75,77,18,89,29,9,22,17,52,45,53,30,93,15,76,70,35,33,8,26,29,36,26,94,16,74,89,19,54,89,61,44,33,73,45,72,57,78,64,70,49}},{{92,95,14,97,59,45,51,87,26,68,28,6,91,2,10,45,21,2,75,21,28,95,59,37,13,27,98,66,86,73,5,93,45,91,14,93},{2,44,43,32,58,69,78,77,55,87,7,18,22,65,25,73,52,94},{48,11,61},{94,25,96,99,21,46,6,61,7,81,46},{40,64,19,36,72,69,69,62,88,40,92,57,81,70,80,24,41,90,24,95,30,61,30,59,8,6,5,40,20,80,42,29,20,26,19,27,68,48,81,17,99,63,28,66,10,73,9,89},{9,64,15,86,39,36,9,1,55,66,73,63,66,16,17,76,10,39,93,70},{43,65,31,46,94,41,83,89,95,3,43,12,6,49,8,28,64,42,16,3,95,43,94,76,16,31},{9,56,14,88,77,91,26,49,32,51,89,79,30,77,85,37,69,70,86,20,5,35,29,90,17,97,80,16,13,25,71,31,33,8,21,65,99,24,53,20,20,62},{97,23,62,90,61,89,20,47,83,56,3,34,8},{53,41,27},{94,24,80,16,31,5,31,66,1,13,77,88,40,34,15,90,46,8,26,39,52,22,33,3,30,49,51},{50,39,59,41,79},{75,82,35,14,61,77,79,9,71,25,21,58,40,44,80,92,45,46,80,74,62,71,56,59,46,35,53,31,86,65,33,47,31,20,55,73,9,96,37,51,53,98,73,21},{3,91,78,78,96,77,32,50,59,34,1,28},{50,11},{8,57,96,5,68,47,18,63,62,64,68,2,88,70,68,2,38,39,21,36,37,26,73,85,51,18,88,3,67,9,7,97,7,44,9,13,91,20,83,11,66,43,62,34,40,96,13},{4,37,63,82,19,41,18,75,56,26,44,64,97,25,44,9,72,75,14,44,91,46,2,41,22,66,26,94,73,35,60,28,49,94,73,40,83,52,39,69,4,2,98,90},{81,15,33,85,24,4,76,32,67,63,46,21,31,26,61,77,32,59,89,70,79,68,68,8},{36,36,60,94,41,69,75,36,71,3,22,13,7,74,42,2,81,35,46,44,63,11,94,45,81,10,51,59,72,74,12,55,41,72,87,82,84,19,52,13,52,1,61,59,49},{70,57,5,6,65,66,78,65,61},{2,49,22,44,27,25,1},{56,85,62,45,35,14,97,81,14,27,32,90,73,98,23,35,93,8,40,18,71,12,11,32,92,52,11,89,58,10,74,54,3,67,17,23,61,24,54,12,36,22,88,64,73,89,76,48},{27,63,60,19,6,70,11,1,66,90,29,71,18,25,21,61,52,9,84,28,10,99,42,31,69,49,5,19,28,47,48,27,62},{6,30,86,95,8,8,23,25,50,21,12,76,56,77,82,91,44,2,55,56,18,4,22,35,88,33,66,28,4,84,2,64,59},{23,33,81,16,79,14,15,4,32,77,17,43,18,37,1,13,53,52,5,66,96,30,51,61,29,62,12,55,66},{63,81,85,16,23,90,26,65,49,96,91,55,78,92,50,2,98,44,34,6,5,82},{2,67,52,5,47,22,30,25,90,76,18,15,40,45,48,79,90,24,63,33,90,25,45,93,3,5,76,6,83,76,12,2,88,78,12,7,54,74,61,97,88,90,91,20,46,33,5,12},{28,38,21,36,66,32,87,78,53,57,87,80,79,61,65,4,43,96,13},{57,44,10,43,74,3,59,35,69,25,66,92,66,57,66,3,45,9,16,7,47,50,57,46,53,90,67,89,16,82,48,81,51,80,83,84,90},{1,97,93,55,52,20,3,28,49,38,38,11,59,98,22,87,7,73,18,91,72,26,71,59,50,91},{5,26,37,44,57,84,73,13,18,96,51,33,75,36,21,56,25,99,18},{90,90,26,61},{61,21,32,48,64,48,7,69,40,63,50,63,83,80,16},{51,19,94,14,63,34,21,4,91,96,75,85,7,22,63,48,64,1,63,83,71,8,97,67,84,41,76,40,68,7,94,96,73},{33,21,45,12,24,20,4,97,31,30,17,98,73,79,63,57,28,20,86},{82,86,3,87,17,7,19,63,93,70,99,26,46,37,24,10,77,9,79,39,2,51,79,3,39},{2,77,66,19,22,51,7,28,18,19,37,28,9,69,76,16,60,78,95,77,52,99,66,82,50,37,60},{78,75,87,13,10,11,40,11,17,28,79,26,32},{95,92,17,70,28,20,42,33,60,97,52,81,79,68,32,6,40,46,75,75,84,39},{14,5,34,98,57,38,88,51,5,70,20,6,7,19,47,12,26,53,60,60,34,48,7},{19,63,38,57,85,36,13}},{{52,56,26,61,68,41,84,98,51,57,79,92,33,85,71,78,55,22,96,27,6,55,37,20,62,2,56,41,31,83,81,44,80,4,98,62,83,28},{39,93,63,3,14,44,18,95,42,14,55,54,54,87,85,57,57,27,62,73,9,13,26,14,72,37,90,42,42},{43,26,54,83,96,93,93,16,8,32,17,34,56},{59,95,94,10,62,40,36,10,6,34,7,86,71,45,82,74,96,46,15,73,35,39,76,77,69,59,7,70,75,20,67,27,5},{45,79,16,85,58,19,14,43,35,33,51,28,74,40,69,25,55,28,6,96,38,90,69,27,33,95,68,58,65,56,89,69,98,61,48,83,84,11,5,89,38,57,13,31,99,6,43},{78,61,19,19,68,83,50,72,61,90,13,28,94,79,39,78,97,13,23,54,88},{34,56,16,73,59,66,89,36,62,66,77,19,93,49,16,64,60,19,83},{25,20,66,5,51,14,98,98,57,14,76,96,8,69,91,94,46,26,44,14,67,50,1,56,21,86,36,7,68,25,51,64,27,22,84,7,31,53,71,66},{39,80,18,31,31,7,87,62,71,5,34,87,33,51,53,55,66,11,58,45,92,50,77,50,43,82,16,29,33},{33,15,80,56,82,63,24,41,77,82,19,32,21,24,45,7,70,89,37,79,14,25,51,21,58,52},{77,6,17,14,83,67,37,8,71,21,88,16,72,46,96,98,11,57,99,56,68,65,98,29,59,11,60,36,24,75,23,21,97,58,80,97,40,8,7,5,4,38},{77,26},{75,96,87,50,64,88,66,94,1,19,88,1,18,96,1,91,68,91,85,1,20,99,2,9,68},{11,7,69,96,8,58,95,89,5,87,74,61,19,3,55,72,78,36},{77,13,44,85,54,3,79,23,44,40,70,67,78,28,32,51,12,58,52,2,68,23,38,62,40,85,78,95,72,78,49},{85,42,73},{73,68,18,36,3,24,12,22,77,1,46},{60,34,33,80,37,51,42,3,2,97,7,51,97,26,46,74,31,2,40,2,67,90,43,14,4,51,6,24,26},{58,87,20,27,20,71,36,22,55,6},{16,68,60,55,44,32,99,18,83,29,79,6,45,86,30,17,98,14},{8,45,41,74,35,20,97,30,52,19,87,93,75,25,34,58,27,41,74,14,96,3,21,77,16,5,62,25,14,35,57,24,54},{12,84,26,80,68,70,8,51,2,4,38,52,8,80,14,59,72,53,63,68,61,9,84,63,46,34,31,69,3,32,53,51,61,57,48,81,5,54,3,19,31,50},{85,92,84,94,24,62,90,89,9,90,73,89,22,80,21,88,20,13,48,6,9,78,76,15,50,23,23,42,31,8,86,35,68,59,92,89,92,10,4,32,73},{72,43,43,57,37,28,69,47},{89,32,87,42,68,35,58,53,70,16,47},{73,62,55,45,25,51,77,90,50,6,56,77,81,42,24,97,25,58,91,35,22},{18,45,40,60,53,25,28,23,20,71,57,81,12,64,32,20,41,82,98,78,53,77,96,60,20,3,39,36,74,81},{91,13,77,95,17,60,98,90,92,32,14,51,2,43,78,76,8,62,84,26,42,54,7,38},{63,69,64,80,50,51,77,12,27,49,57,89,2,84,92,67,85,45,14,90,53,33,83,88,86,28,81,17,51,94,64,24,75,11,71,25,67},{13,36,67,30,47,47,51,52,30,44,20,72,53,85,10,13,43,77,6,1,16,77,53,11,23,85,39,7,63,96,32,7},{99,93,66,53,33,80,12,19,6,59,65,34,34,62,27},{85,26,38,18,35,84,24,95,3,42,3,96,37,64},{68},{86,66,83,19,20,49,97,62,84,27,57,83,46,60,92,55,88,41,37,93,41,50,18},{78,81,58,12,78,28,82,20,34,29,22,26,98,87,48,27,14,37,40,94,42,12,43,46,72,7,23,9},{4,22,78,80,32,75,84,1,66,82,73,47,34,98,41,91,67,34,62},{79,21,86,40,17,5,49,93,10,43,99,64,8,56,72,15,10,30,30,14,80,31,27,57,60,33,75,14,92,37,1,6,43,1,51,73,83},{92,57,14,51},{6,31,18,83,40,82,84,36,75,52,93,87,49,16,53,45,87,68,77,79,71,84,27,26,15,5,8,92,92,16,77,39,35,69,61,52,61},{18,91,29,92,26,43,84,31,11,83,67,18,1,54,30,93,40,35,12,31,48,82,99,71,81,22,57,44,55,8,23,45,7,82,63,37,13,98,53},{32,2,97,38,5,17,8,7},{58,94,32,44,32,95,3,16,58,45,73,89,70,64,92,30,17,94,86,5,92,38,6,9,60,83,55,56},{42,19,31,55,51,40,85,81,83,89,62},{99,19,20,28,94},{36,90,94,37,56,29,7,66,75,66,90,8,39,72,43,23,95}},{{49,88,86,47,6,1,20,49,89,17,82,98,57,51,87,75,43},{66,32,51,49,75,33,66,35,91,46,35,52,58,57,71,86,77,50,68,10,11,22,72,48,21,68,77,30,37,66,9,66,98,17,9,24,76,24,15,12},{58,83,35,37,64,27,82,97,91,51,35,39,86,85,22,60,89,14,78,61,60,76,29,21,13,52,79,4,52,96,14,91,26,88,12,54,72,56,27,84,94,23,79,54,6},{95,30,62,38,80,47,92,95,21,51,98,14,68,94,50,51,52,41,37,32,51,53,55,35,7,70,80,12,16,51,13,14,60,45,11,39,60,94},{54,88,92,62,80,72},{25,11,71,39,81,14,43,69,62,18,68,88,22,74,62,78,17,39,40,16,50,98,94,49,40,59,95,89},{48},{29,37,74,25,41,39,11,33,96,85,10,2,23,73,62,93,8,38,61,62,41,59,56,34,34,98,55,82,40,31,13,95},{81,45,51,86,54,85,12},{19,75,88,72,19,52,22,59,57,6,30,55,9,72,36,71},{48,19,30,48,53,12,73,71,45,83,36,92,32,61,28,57,40,11,92,2,41,13,64,81,98,75,96,69,62,17,19,6,52,96,66,72,36,54,6,1,34,62,81},{9,1,27,12,85,33,87,39,62,74,45}},{{80,69,6,27,11,59,18,95,25,93,9,27,26,32,98,17,38,14,76,64,95,93,29,5,12,44,8,37,39,86,82,4,35,16,86,15,92,33,99},{50,22,41,83},{77,41,89,68,74,22,90,11,12,86,37,53,8,95,65,13,84,90,35,82,20,67,29,26,35,38,84,20,57,38,90,16,82,66,23,12,40,54,57,11,16},{27,27,7,39,50,81,9,73,68,92,5,91,97,61,82,7,46,79,88,89,60,14,38,79,52,85,81,25,82,17,99,82,36,27,6},{52,97,39,73,62,35,1,38,84,71,78,84,64,39,61,78,99,20,46,27,3,65,84,40,11,37,83,92,67,2,93,20,24,20,37,49},{26,20,97,14,75,43,99,32,77,73,13,8,84,54,48,67,65,98,75,12,97,42,42,63,35,28,75,75,86,17,70,48,77,31,8,18,50,30,33,40,71,56,5,64,51,33,45,25,97},{41,44,5,95,42,19,71,73,76,32,92,69,48,93,32,30,19,51},{47,36,32,2,28,99,65,84,27,71,83,96,62,21,52,94,27,91,9,85,71,29,24,11,45,40,21,5,15,7,15,81,15,82},{43,67,4,5,90,70,21,72,40,83,24,95,34,4,47,2,93,10,80,15,79,27,60,59,46,49,32,44,45,8,91,85,28,86,64,89,70,94,50},{75,13,2,45,25,44,16,9,48,77,67,63,3,56,84,58,64,34,95,85,82,48,85},{17,74,75,16,65,14,58,60,1,60,23,71,38,37,99,65,34,12,8,25,45,1}},{{91},{14,11,41,41,98,17,76,17,18,65,89,92,17,87,8,41,18,33,7,85,68},{82,59,42,79,36,7,41,36,38,85,94,95,43},{64,55,31,36,78,74,64,36,78,24,84,10,53,75,56,91,31,3,9,19,46,92,11,39,57,63,36,88,99,46,10,71,29,33,62,29,58,98,26},{87,62,3,74,9,3},{36,8,48,42,65,2,32,60,33,55,48,2,69,93,60,49,57,61,78,46,13,40,26,26,71,80,46,65,60,50,89,35,25,19,75,13,80,87,31,93,21,99,74,49,62,65,25},{25},{94,92,53,64,15,57,27,95,4,12,81,49,23,2,50,29,29,19,95,27,77},{27,5,50,22,42,92,98,27,1,3,79,8,57,64,40,6,31,78,91,94,91,31,38,4,30,86,64,92,62,42,8,53,47,56,48,88,6,96,50,61,4,94},{62,80,11},{44,61,44,14,44,3,62,95,69,44,67,29,96,36,88,80,59,35,33,57},{5,96,55,4,54,40,67},{84,76,63,40,53,73,19,94,66,12,46,2,53,42,86,33,83,54,56,49,28,60,84,53,49,53,53,44,50,96},{55,15,82,59,39,39,72,26,57,86,18,32,26,23,37,21,54,10,71,34,95,43,38,85,60,98,28,76,7,49,48,46,59,90,45,30,6,95,15,95,18,55,43,65,76,66},{59,49,3,60,53,36,3,12,67,69,39,89,40,66,78,89,64,86,91,7},{1,95,52},{94,14,8,16,47,59,22,94,74,44,50,4,29,13,26,16,3,45,78,81,70,41,15,82,35,61,89,93,57,7,45,20,85,88,31,33,87,26,73,25,89,10,24,8},{82,90,54,75,16,22,37,57,49,99,83,41,66,75,56,82,55,95,36,74,99,34,70,37,8,39,10,98,20,2,2,45,66},{53,58,37,84,36,26,18,40,67,18,68,17,43,88,40,48,74,59,8,43,93,87,76,35,88,93,75,17,55,21,16,16,24},{85,97,20,99,92,97,55,83,61},{71,3,14,95,1,13,27,7,5,71,78,97,24,25,23,42,55,17,77,28,4,8,3,37,18,24,73,95,48,40,52,76,3,49,16,15,67,55},{82,37,65,71,34},{26,1,83,26,6,99,24,70,94,57,93,88,98,42,42,22,52,56,19,87,16,15,79,51},{2,83,91,20,45,33,5,63,89,17,4,51,12,25,6,73,72,5,26},{32,21,10,56,16,53,11,9,3,42,40,64,1,57,30,49,92,57,19,20,37,35,88,92,88,24},{43,65,42,41},{94,86,30,12,51,64,57,35,20,6,40,86,77,98,90,79,33,31,37,48,13,50,22,53,5,24,12,97,8,10,72,55,99,86,97,18,47},{22,4,24,98,94,9,31,11,64,39,45,37,74,7,6,37,10,43,66,54},{43,73,30,1,66,57,38,76,84,12,22,34,62,8,33,67,20,32,66,91,23,96,14,69,50,66,7,81,65,51,90,92,46,54,66,9,31,63,43,79,73,70,50,40,47,83},{25,40,47,67,93,59,15,6,98,28,49,9,32,97,70,51,20,50,64,40,9,73,61,93,49},{9,86,54,68,29,8,26,74,30,24,62,73,23,98,46,2},{2,34,28,57,29,2,67,78,45,86,23,9,45,63,4,6,1,78,69,46,3,82,68,56,26,7,42,79,98,64,76,6,21,91,68,35,15,50,14,64,20,2},{30,91,56,33,23,48,20,41,98,50,83,21,65,97,30,48,75,17,3,64,22,97,64,99,98,39,6,19,8,98,83,6,12},{98,58,19,21,92,81,71,69,27,39,26,23,65,76,3,4,88,9,46,80,42,45,94,69,24,20,4,94,17,4,99,99,48,38,32,95,63,96,54,87,72,65,49,32,8,42,10,17},{59,84,3,26,22,25,1,61,39,74,94,38,20,5,80,68,80,54,17,33,94,55,28},{62,76,61,55,33,38,86,90,63,72,23,82,42,44,27,87,12,27,79,83,6,25,93,37,40,5,3,53,82,76,81,43,99,79,90,68,96,50,95,40,58,5,96,83,68,72},{70,71,67,68,89,88,47,57,60,48,88,88,54,50,31,62,37,51,44,3,48,42,24,70,92,51},{75,14,18,20,46,3,53,87,48,81,6,80,85,98,88,69,70,18},{79,3,39,97,20,21,82,79,12,93},{21,69,53,54,99,25,12,79,28,40,94,7,48,53,23,6,69,7,21,17,76,47},{50,67,76,80,45,2,97,34,98,70,50,15,60,42,75,47,64,24,77,16},{27,29,77,85,69,51,46,52,69,50,65,83,30,46,56,37,42,59,83,8,29,60,39,79,95,53,26,46,63,42,46,41,24,95,79,74},{30,53,62,3,52,43,20,50,31,40,50,68,41,40,80,66,15,77},{16,42,66,74,37,62,60,45,1,40,59,35,63,12,25,74,63,53,27,37,58,22,12,51,4,2,54,17,48,14,47,45,68,67,83,28,12,39,7,90,75},{45,73,4,90,62,95,57,60,33,13,76,36,24,60,39,5,47,56,92,83,4,6,11,98,51,18,39},{93,85,94,70,30,12,61,71,97,53,94,62,92,42,43,41,94,37,16,87,89,30,16,16,26,44,6,74,53,53,67,58,7,89,31,53,87,87,75,77,5},{42,66,60,49,89,63,51,56,68,74,87,69,5,28,54,3,5,54,89,40,96,36,44,35,4,63,33,78,84,10,86,25}},{{56,83,53,71,33,13,1,84,77,26,59,37,93,34,20},{2,31,43,92,53,5,85,14,13,86,15,78,43,63,34,2,13,2,30,17,32,26,61,58,61,87},{89,95,26,54,50,76,92,86,3,62,86,40,77,32,3,61,12,61,91,78,45,65,32,42,51,62,46,20},{41,8,47,91,48,33,79,48,86},{49,52,28,42,64,32,44,54,4,84,38,52,46,67,70,23,38,53,96,47,99,98,88,54,44,95,65,37,39,91,64,49,81,8,67,70},{62,9,38,62,93,12,29,35,40,64,62,6,40,7,70,83,19,76,38,43,68,82,47,96,71,61,9,82,74,6,84,95,87,24,11,72,90,28,97,75},{60,47,82,39,70,35,93,10,22,67,56,47,11,7,21,48,74,58,9,47,52,8,39,89,64,94,26,62,94,78,8,81,44,58,9,66,21,16,96},{59,23,42,85,84,56,78,56,47,5,37,67,93,7,19,49,62,86,71,42,68,31,46,42,28,42},{62,2,90,86,8,34,20,45,53,71,19,10,53,61,84,13,55,89,79,62,6,5,44,84,4,29,62,63,97,43,66,42,43,35,94,65,8,86,67,12,81,34,55,95,26,77},{25,62},{26,73,20,85,56,2,30,73,94,7,8,86,34,75,59,90,71,62,7,22,12,5,66,63},{22,27,1,54,93,81,58,78,48,48,45,27,80,8,44,74,57,32,85,40,31,2,87,13,51,20,91},{52,80,24,20,66,10,28},{2,33,63,50,88,23,36,38,8,86,92,45},{69,5,59,20,10,58,20,10,50,36,53,29,2,73,15,61,93,26,47,2,82,82,10,3,96,59,42,35},{71,49,46,15,76,7,85,14,59,94,98,54,35,83,53,60,43,73,37,45,6},{17,6,14,10,69,77,43,80,81,54},{27,50,89,67,55,75,49,39,6,19,29,5,71,17,58,55,39,16,71,76,2,23,8,42,55,58,68,12,69,97,71,57,82,55,66,37,67},{54,11,49,78,22,43,23,73,46,51,75,19,80,85,67,68,40,1,22,77,24,15,48,39,7,62,22,44,72,6,6,71,78,57,15,25,26,15,33,9,20,38,9,10},{89,65,67,92,8,53,65,98,56,80,3,83,80,26,96,55,71,34,74},{29,57,95,2,96,41,95,94},{73,93,10,64,5,94,31,53,59,61,2,80,49,3,85,83,59,83,20,46},{86,84,26,57,29,42,15,79,72,89,61,52,58,38,65,23,14,82,61,77,2,40,66,26,20,94,45,78,85,23,29,73,65,76,91,97,41,77,98,66,77,68,70},{41,53,23,59,65,1,18,94,4,28,61,39,81,73,37,44,90},{72,15,95,49,11,56,87,86,79,86,80,39,7,88,54,74,40,31,43,75,51,94,75,60,58,11,20,5,11,10,79,8,57,26,65,13,39,8,82,9,8,48,17,35,71,81},{48,53,33,24,18,93},{94,16,72,19,10,93,84,36,26,38,54,53,87,36,44,20,4,37,9,2,72,77,16,61,2,84,4,56,64,29,25,73,80,62,49,21,14,44,73,47,65,84,33,73,8},{79,10,51,57,62,87,35,83,83,72,59,80,24,6,41,35,82,33,46,99,49,35,31,10,56,14,87,72,12},{3,5,22,51,52,5,81,61,3},{39,72,3,60,30,60,50,66,62,89,54,52,99},{20,79,87,27,69,21,11,34,8,92,23,92,33},{94,87,74,63,4,84,7,87,94,62,56,97,98,52,50,48,24,5,90,32,86,58,3,21,15,22,97,60,39,72,61,72,95,74,10,54,27},{8,48,46,62,49,28,87,10,55,56,48,33,26,54,21,79,87,57,91,84,64,27,56,32,36,47,22,7,32,46,51,74,27,66,13,61,12,52,81,71,50},{81,14,14,8,21,61,31,39,29,51,16,85,44,62,2,71,88,60,78,32,46,17,47,65,78,65,94,18,3,15,9,61,73,3,62,87,1,54,97,61,37,23,65,84,62,33,34,78,23},{3,69,92,41,72,82,69,9,20,32,24,27,15,24,48,54,42,23,91,75,30,15,66,30,93,45,8,94,59,35,94,23,79,84,39,4,24,90,62},{65,19,57,24,78,96,61,40,94,74,33,18,97,68,44,68,82,45,75,44,62,16,65,38,55,61,53,98},{11,90,89,57,89,86,83,87,15,14,76,27,52,22,12,28,4,28,49,67,81,60,29,65,25,2,91,90,34,39,74,91,36,36,11,79,51,15,92,37,27},{96,53,99},{56,55,30,39,79,3,90,99,93,68,16,93,61,76,40,49,87,14,93,90,11,57,81,55,97,17,89,64,96,46,73,38,83,86,14,5,62,39,80,89,16,99},{40,72,2,54,95,50,99,38,16,34,19,50,20,63,1,26,87,79,76,50,54,32,86,26,84,83,45,16,93,90,82,44,81,28,36},{55,78,19,48,3,55,81,47,6,88,8,85,76,94,51,45,3},{68,15,80,27,28,1,40,78,80,85,21,63,27,44,30,60,62,66},{49,42,84,79,26,75,58,2,41,36,85,9,85,6,68,45,63,58,16,87,83,53},{6,21,86,58,48,27,18,73,16,79,51,33,63,26,37,88,48,58,44,32,58,23,31},{87,77,44,15,70,89,36,79,82,3,18,76,37,79,85,97,19,53,17,74,87,58,49,76,10,9,39,36,11,75,99,10,50,70,1,47,36,7},{64,95,33,47,20,98,54,94,1,78,27,75,69,19,73,68},{94,73,97,58,51,89,18,87,72,61,98,24,83,93,13,80,48,78,33,60},{53,81,89,64,14,47,67,85,67,31,45,93,36,54,7,65,5}},{{38,67,78,64,72,89,83,96,92,65,99,92,34,51,57,98,28,57,31,62,49,60,50,81,18,62,6,84,53,52,4,26,54,39,73,75,10,12,99,87,99,24,91,15},{96,97,87,80,9,6,57},{29,78,80,91,74,17,77,10,83,17,53,30,60,61,6,78,59,68,26,24,73,52,36,98,14,32,5,7,74,97,51,65,68,11,80,48,91,66,90,38},{5,88,21,92,18,47,48,56,31,51},{48,88,70,15,82,94,64,98,47,10,14,28,34,18,51,42,33,23,98,38,71,61,72,53,92,28,29,1,11,2,65,86,44,59,4,16,26,2,58,39,32,38,83,10,80},{68,53,68,93,45,41,8,51,53,31,94,54,55,36,46,52,10,35,54,38,41},{12,30,80,25,68,48,8,18,16,88,83,74,53,16,29,43,46,42,46,78,11,10,43,72,69,2,39,66,9},{5,55,58,20,42,42,11,99,42,76,47,67,30,75,5,31,27,45,39,17,86,24,69,95,67,44,28,47,50,40,31,93,63,82},{70,95,37,49,36,56,61,43,25,19,34,21,2,54,63,24,81,3,39,49,4,49,81,78,91,83,97,11,96,14,42,16,69,28,68,98,24,67},{2,18,22,44,77,52,62,24,46,40,44,30,29,49,47,20,85,99,47,16,34,50},{29,42,24,58,44,59,24,48,96,6,88,89,8,86,69,33,79,95,3,2,57,7,91,85,88,79,44,47,98,78,16,15,3,65,41,58,21},{28,8,36,76,17,41,2,67},{67,62,33,39,36,62,95,11,40},{67,38,49,22,76,82,26,78,79,7},{54,6,71,82,1,60,34,89,9,19,97,37,22,37,65,71,21,74,33},{34,1,41,10,87,39,9,70,18,79,41,18,67,28,9,27,81,10,12,66,72,34,99,37},{58,93,24,14,5,35,53,84,61,13,80,22,26,88,87,7,14},{97,9,67,61,4,72,63,91,77,57,14,98,99,20,6,71,66,39,76,80,45,21,82,41,20,88,24,10,11,7,93,38,71,92,40,81,69,15,52,49,54,18,92,33,21,91,21,5},{77,92,26,58,72,55,76,18,13,59,9,12,31,24,36,33,71,87,55,19,42,25,82,66,34},{81,4,22,35,98,59,27,67,72,4,69,88,39,73,55,96,25,56,70,49,88,61,34,20},{66,64,38,47,88,86,78,12,4},{48,13,19,77,49,93,58,15,20,1,98,11,86,96,43,28,87,84,82,16,64,55,99,65,26,85,35,54,17,97,63,12,43,74,65,13},{63,16,94,97,94,85},{5,50,19,79,48,73,85,65,37,95,50,83,33,80,43,87,4,34,96,60,25,44,45,71,25,11,47,5,13,4,90,64,20,98,44,26,61},{20,42,31,16,76,4,88,97,36,81,37,69,43,83},{15,76,8,82,90,32,89,23,24,47,50,61,38,29,27,91,86,78,91,4,79,35,58,25,7,64},{35,71,14,29,11,35,61,21,61,26,27,93,95,77,5,33,94,67,57,61,28,90,60,2,67,94,18,79,62,48,89,61},{93,46,35,32,25,59,87,24,46,98,20,5},{42,77,82,41,35,8,91,12,44,22,91,56,85,79,65,36,3,94,73,75,48,17,96,23,61,6,28,63,33},{75,98,72,69,35,90,42,44,28,64,4,58,76,2,28,33,14,7,98,36,19,52,33,66,35},{88,57,47,21,50,83,48,93,25,25,35,39,34,98,80,22,14,48,64,77,87,56,27,33,15,81,55,72,5,25,2,88,17,73,12,3,92,80,5,8,27,44,50,4,69},{90,94,15,78,79,78,16,22,85,33,39,30,26,22,73,37,25,16,70,62,26,3,30,46,33,68,91,93,26,60,85,45,62,75,2,10,33,7,69,30,29,46,94},{35,58,73,81,93,12,83,37,63,60,89,40,32},{54,63,76,76,77,50,2,53,82,50,46,5,49,37},{77,16,95},{6,66,1,16,10,52,61,28,95,56,49,60,46,75,4,49,9,81,93,5},{93,71,54,16,35,58,91,36,98,76,65,98,45,69,19,1,49,38,85,91,52,9,20,95,38,81,32,1,70,71,50,93,62,3,23,34,35,63,55,62,12,14,3,48,31,35,10,90},{76,14,65,74,49,58,56,26,27,5,22,82,85,18,26,71,71,73,27,9,86,98,78},{97,68,59,18,81,34,52,55,15,59,22,35,64,87,96,23,24,17,30,20,15,16,84,32,32,24,5}},{{2,95,2},{92,62,11,25,66,2,91,54,77,28,94,15,90,63},{1,58,34,7,40,62,94,25,30,33,53,33,92,4,55,4,82,32,62,36,24,84},{54,63,7,55,37,64,44,55,55,28,2,42,97,3,99,99,24,86,84,17,41,87,68,34,17,70,23,84,74,4,78,84,83,48,75},{73,99,81,84,54,2,23,11,8},{75,17,49,12,17,53,58,1,64,83,29,36,96,34,89,62,95,38,41,95,16,31,62,52,2,91,5,90,35,20},{88,82,21,25,94,12,88,85,42,76,59,72,23,20,41,15,5,42,52,45,20},{56,69,48,44,39,97,32,88,70,71,75,39,42,32,45,87,43,9,70,38,39,60,70,19,90,45,57},{80,81,38,79,44,94,9,59,20,31,64,67,70,37,94,68,94,69,26,63,54,2,76,95,27,7,6,32,19,27,44,44,59,81,94,4,92,19,92,14,55,74,2,29,28,98,16,34},{94,5,74,9,55,74,73,32,92,11,90,97},{78,65,56,81,62,51,99,11,94,42,35,94,73,85,75,65,25,27,81,94,3,6,75,5},{10,35,64,71,9,86,93,13,40,23,39,65,48,76,53,5,87,63,62,74,38,90,21,31,38,14,86,61,78,65,96,29,53,81,79,8,36,28,53,60,64,9,35,79,40,69,5,5,56},{63,89,75,22,83,98,97,16,76,2,55,50},{20,98,48,99,69,23,73,99,53,81,74,40,74,71,29,34,51,37,68,96,83,12,97,68,59,34,70},{62,3,97,59,36,26,42,66,92,60,1,80,4,66,9,76,45,41,65,67,87,78,49,60,7,33,53,55},{58,24,52,50,98,4,4,10,32,6,18,71,42,32,27,63,72,18,85,83,45,95,31,97,94,82,39,74,12,85,22,40,34,17,2},{1,48,96,7,6,56,62,88,39,77,5,98,20,69,26,13,57,4,57,64,24,16,27,81,7,49,46,93,13,17,26,13,81,65},{51,47,12,60,89,15,93,53},{21,6,26,25,28,44,73,28,63,27,64,21,50,85,75,44,86,97,34,69,36,27,26,86},{21,3,65,94,90,72,71,83,39,78,41,90,82,70,23,72,99,48,97,87},{56,35,92,24,99,1,5,82,51,68},{72,44,64,59},{77,58,8,45,22,83,81,65,23,56,81},{28,93,96,10,24,13,24,60,37,17,91,54,69,46,8,93,15,96,17,25,75,9,36,76,34,29,8,28,56,8,71,37,20,38,45,47,73,86,52,13,96,90,35,11},{96,29,14,84,59,14,28,52,80,22,10,94,18,67,39,52,72},{17,45,48,54,57,68,56,17,86,24,1,67,87,60,58,98,45,80,32},{84,89,7,59,5,20,40,81,80,5,80}}};
for (int i =0; i < param0.size(); i+=2 )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k]= param0[i][j][k] %2;
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) ]",
"b) n)",
"c) for",
"d) 4",
"e) or"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str ) {
int i = 0, j = str . length ( ) - 1;
while ( i < j ) {
if ( str [ i ] != str [ j ] ) return false;
i ++;
j --;
}
return true;
}
sing namespace std;
bool f_gold ( string str ) {
int i = 0, j = str . length ( ) - 1;
while ( i < j ) {
if ( str [ i ] != str [ j ] ) return false;
i ++;
j --;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ab","303","11110000","aba","404","10101","abab","6366","001",""};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str ) { int i = 0, j = str . length ( ) - 1; while [MASK] i < j ) { if ( str [ i ] != str [ j ] ) return false; i ++; j --; } return true; }sing namespace std;
bool f_gold ( string str ) {
int i = 0, j = str . length ( ) - 1;
while ( i < j ) {
if ( str [ i ] != str [ j ] ) return false;
i ++;
j --;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ab","303","11110000","aba","404","10101","abab","6366","001",""};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) *",
"b) =",
"c) (",
"d) count",
"e) i"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
while ( n > 0 ) {
sum += ( n % 10 );
n /= 10;
}
if ( sum == 1 ) return 10;
return sum;
}
omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
while ( n > 0 ) {
sum += ( n % 10 );
n /= 10;
}
if ( sum == 1 ) return 10;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,39,31,45,35,94,67,50,4,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> [MASK] <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int sum = 0; while ( n > 0 ) { sum += ( n % 10 ); n /= 10; } if ( sum == 1 ) return 10; return sum; }omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
while ( n > 0 ) {
sum += ( n % 10 );
n /= 10;
}
if ( sum == 1 ) return 10;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,39,31,45,35,94,67,50,4,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) {",
"b) //",
"c) #include",
"d) void",
"e) return"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = 0;
int leftsum = 0;
for ( int i = 0;
i < n;
++ i ) sum += arr [ i ];
for ( int i = 0;
i < n;
++ i ) {
sum -= arr [ i ];
if ( leftsum == sum ) return i;
leftsum += arr [ i ];
}
return - 1;
}
for ( int i = 0;
i < n;
++ i ) sum += arr [ i ];
for ( int i = 0;
i < n;
++ i ) {
sum -= arr [ i ];
if ( leftsum == sum ) return i;
leftsum += arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{24,31,44,52,78,95},{-78,-38,22,58,68,-60,-30,6,58,20,-64,-40,-14,80,-2,-88,-68,-16,-4,78,-38,-74,78,-72,46,-12,82,-76,-98,-28,-32,88,72,72,64,-10,98,-24,-96},{0,0,0,0,0,0,0,0,1,1,1,1},{98,69,41,48,40,90,76,61,17,81,74,92,54,16,11,15,8,16,84,86,34,34,75,92,67,54,93,19,31,62,89,26,96,91,32,78,42,84,66,79,29,48,49,5},{-28,42},{1,1,1,1,0,0,0,0,0,1,0,1,1,0,1,1,0,1,0,1,0,0,0,1,0,1},{18,21,23,24,36,37,39,49,55,68,80,81,88,90},{94,22,42,-42,78,50,96,98,46,74,98,84,-2,-76,48,18,28,-62,78,6,-76,-12,46,62,14,76,44,-26,-92,12,62,-72,-42},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{1,23,18,91,65,2,73,12,91,47,14,48,1,69,95,81,59,36,79,35,9,52,55,73,54,25,8,41,64,96}};
vector<int> param1 {4,19,11,27,1,25,11,32,14,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int sum = 0; int leftsum = 0; for ( int i = 0; i < n; ++ i ) sum [MASK] arr [ i ]; for ( int i = 0; i < n; ++ i ) { sum -= arr [ i ]; if ( leftsum == sum ) return i; leftsum += arr [ i ]; } return - 1; } for ( int i = 0;
i < n;
++ i ) sum += arr [ i ];
for ( int i = 0;
i < n;
++ i ) {
sum -= arr [ i ];
if ( leftsum == sum ) return i;
leftsum += arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{24,31,44,52,78,95},{-78,-38,22,58,68,-60,-30,6,58,20,-64,-40,-14,80,-2,-88,-68,-16,-4,78,-38,-74,78,-72,46,-12,82,-76,-98,-28,-32,88,72,72,64,-10,98,-24,-96},{0,0,0,0,0,0,0,0,1,1,1,1},{98,69,41,48,40,90,76,61,17,81,74,92,54,16,11,15,8,16,84,86,34,34,75,92,67,54,93,19,31,62,89,26,96,91,32,78,42,84,66,79,29,48,49,5},{-28,42},{1,1,1,1,0,0,0,0,0,1,0,1,1,0,1,1,0,1,0,1,0,0,0,1,0,1},{18,21,23,24,36,37,39,49,55,68,80,81,88,90},{94,22,42,-42,78,50,96,98,46,74,98,84,-2,-76,48,18,28,-62,78,6,-76,-12,46,62,14,76,44,-26,-92,12,62,-72,-42},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{1,23,18,91,65,2,73,12,91,47,14,48,1,69,95,81,59,36,79,35,9,52,55,73,54,25,8,41,64,96}};
vector<int> param1 {4,19,11,27,1,25,11,32,14,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | += | [
"a) arr",
"b) [",
"c) {",
"d) +=",
"e) if"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
mespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {13,27,1,24,98,94,36,41,74,39};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { unsigned count = 0; if ( n && ! ( n & ( n - 1 ) ) ) return n; while ( n != 0 ) { n >>= 1; count += 1; } [MASK] 1 << count; }mespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {13,27,1,24,98,94,36,41,74,39};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | return | [
"a) return",
"b) ;",
"c) -",
"d) int",
"e) n"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s ) {
int n = s . length ( );
int lps [ n ];
lps [ 0 ] = 0;
int len = 0;
int i = 1;
while ( i < n ) {
if ( s [ i ] == s [ 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;
}
if ( len != 0 ) {
len = lps [ len - 1 ];
}
else {
lps [ i ] = 0;
i ++;
}
}
}
int res = lps [ n - 1 ];
return ( res > n / 2 ) ? n / 2 : res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"aabcdaabc","1372494598","110000100001","abcab","488938","011010101011","aaaa","3356203205","1010","kkXiiTZkGeh"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string s ) { int n = [MASK] . length ( ); int lps [ n ]; lps [ 0 ] = 0; int len = 0; int i = 1; while ( i < n ) { if ( s [ i ] == s [ 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; } if ( len != 0 ) {
len = lps [ len - 1 ];
}
else {
lps [ i ] = 0;
i ++;
}
}
}
int res = lps [ n - 1 ];
return ( res > n / 2 ) ? n / 2 : res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"aabcdaabc","1372494598","110000100001","abcab","488938","011010101011","aaaa","3356203205","1010","kkXiiTZkGeh"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | s | [
"a) for",
"b) +",
"c) ],",
"d) y",
"e) s"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int N = str . length ( );
int cps [ N + 1 ] [ N + 1 ];
memset ( cps, 0, sizeof ( cps ) );
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 ( str [ i ] == str [ 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 ];
}
] [ 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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"R","2956350","11100111110101","TZTDLIIfAD","98","1100100001","oKwGeatf","19","00010110100","Cyq"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { int N = str . length ( ); int cps [ N + 1 ] [ N + 1 ]; memset ( cps, 0, sizeof ( cps ) ); for ( int i = 0; i [MASK] 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 ( str [ i ] == str [ 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 ]; }] [ 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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"R","2956350","11100111110101","TZTDLIIfAD","98","1100100001","oKwGeatf","19","00010110100","Cyq"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | < | [
"a) (",
"b) <",
"c) [",
"d) )",
"e) y;"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s, char c ) {
int res = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) if ( s [ i ] == c ) res ++;
return res;
}
omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s, char c ) {
int res = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) if ( s [ i ] == c ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"mhjnKfd","716662107","01","wPHSxIbnHakGRO","721106","111","TIBFU","0","10","lqq"};
vector<char> param1 {'l','6','1','n','8','0','Q','3','0','d'};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string s, char c [MASK] { int res = 0; for ( int i = 0; i < s . length ( ); i ++ ) if ( s [ i ] == c ) res ++; return res; }omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s, char c ) {
int res = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) if ( s [ i ] == c ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"mhjnKfd","716662107","01","wPHSxIbnHakGRO","721106","111","TIBFU","0","10","lqq"};
vector<char> param1 {'l','6','1','n','8','0','Q','3','0','d'};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) '",
"b) )",
"c) [",
"d) times",
"e) ="
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
int count = 1;
for ( int i = 0;
i < n - 1;
i ++ ) {
if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++;
}
return count;
}
;
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
int count = 1;
for ( int i = 0;
i < n - 1;
i ++ ) {
if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {42,24,1,26,42,27,29,25,21,46};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { sort ( arr, arr + n ); int count = 1; for ( int i = 0; i < n - 1; i ++ ) { if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++; } [MASK] count; };
int f_gold ( int arr [ ], int n ) {
sort ( arr, arr + n );
int count = 1;
for ( int i = 0;
i < n - 1;
i ++ ) {
if ( arr [ i ] + 1 != arr [ i + 1 ] ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {42,24,1,26,42,27,29,25,21,46};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | return | [
"a) java.lang.*;",
"b) )",
"c) return",
"d) (",
"e) <"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
char f_gold ( string str ) {
int n = str . length ( );
int count = 0;
char res = str [ 0 ];
int cur_count = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( i < n - 1 && str [ i ] == str [ i + 1 ] ) cur_count ++;
else {
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
cur_count = 1;
}
}
return res;
}
&& str [ i ] == str [ i + 1 ] ) cur_count ++;
else {
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
cur_count = 1;
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeekk","3786868","110","aaaabbcbbb","11","011101","WoHNyJYLC","3141711779","10111101101","aabbabababcc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; char f_gold ( string str ) { int n = str . length ( ); int count = 0; char res = str [ 0 ]; int cur_count [MASK] 1; for ( int i = 0; i < n; i ++ ) { if ( i < n - 1 && str [ i ] == str [ i + 1 ] ) cur_count ++; else { if ( cur_count > count ) { count = cur_count; res = str [ i ]; } cur_count = 1; } } return res; }&& str [ i ] == str [ i + 1 ] ) cur_count ++;
else {
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
cur_count = 1;
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeekk","3786868","110","aaaabbcbbb","11","011101","WoHNyJYLC","3141711779","10111101101","aabbabababcc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) ?",
"b) )",
"c) return",
"d) =",
"e) )"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long long int A, long long int B ) {
int variable = 1;
if ( A == B ) return 1;
else if ( ( B - A ) >= 5 ) return 0;
else {
for ( long long int i = A + 1;
i <= B;
i ++ ) variable = ( variable * ( i % 10 ) ) % 10;
return variable % 10;
}
}
= B ) return 1;
else if ( ( B - A ) >= 5 ) return 0;
else {
for ( long long int i = A + 1;
i <= B;
i ++ ) variable = ( variable * ( i % 10 ) ) % 10;
return variable % 10;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {79,61,39,39,61,86,7,86,86,11};
vector<long> param1 {84,29,77,65,78,73,92,50,63,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( long long int A, long long int B ) { int variable = 1; if ( A == B ) return 1; else if ( ( B - A ) >= 5 ) return 0; else { for ( long long int i = A + 1; i <= B; i ++ ) [MASK] = ( variable * ( i % 10 ) ) % 10; return variable % 10; } }= B ) return 1;
else if ( ( B - A ) >= 5 ) return 0;
else {
for ( long long int i = A + 1;
i <= B;
i ++ ) variable = ( variable * ( i % 10 ) ) % 10;
return variable % 10;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {79,61,39,39,61,86,7,86,86,11};
vector<long> param1 {84,29,77,65,78,73,92,50,63,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | variable | [
"a) int",
"b) (",
"c) variable",
"d) j",
"e) res"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( - ( ~ x ) );
}
ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( - ( ~ x ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,68,52,61,3,88,41,78,94,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int [MASK] ( int x ) { return ( - ( ~ x ) ); }ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( - ( ~ x ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,68,52,61,3,88,41,78,94,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | f_gold | [
"a) 0",
"b) if",
"c) j",
"d) ;",
"e) f_gold"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i = 0;
while ( i <= n - 1 ) {
if ( arr [ i ] == x ) return i;
i += abs ( arr [ i ] - x );
}
return - 1;
}
c++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i = 0;
while ( i <= n - 1 ) {
if ( arr [ i ] == x ) return i;
i += abs ( arr [ i ] - x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {8,8,15,7,6,27,0,24,35,0};
vector<int> param2 {6,3,1,49,6,22,0,34,1,0};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int x ) { int i = 0; while ( i [MASK] n - 1 ) { if ( arr [ i ] == x ) return i; i += abs ( arr [ i ] - x ); } return - 1; }c++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i = 0;
while ( i <= n - 1 ) {
if ( arr [ i ] == x ) return i;
i += abs ( arr [ i ] - x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {8,8,15,7,6,27,0,24,35,0};
vector<int> param2 {6,3,1,49,6,22,0,34,1,0};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <= | [
"a) <=",
"b) <limits.h>",
"c) index",
"d) #include",
"e) x,"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int arr [ ], int n ) {
vector < int > evenArr;
vector < int > oddArr;
for ( int i = 0;
i < n;
i ++ ) {
if ( ! ( i % 2 ) ) evenArr . push_back ( arr [ i ] );
else oddArr . push_back ( arr [ i ] );
}
sort ( evenArr . begin ( ), evenArr . end ( ) );
sort ( oddArr . begin ( ), oddArr . end ( ), greater < int > ( ) );
int i = 0;
for ( int j = 0;
j < evenArr . size ( );
j ++ ) arr [ i ++ ] = evenArr [ j ];
for ( int j = 0;
j < oddArr . size ( );
j ++ ) arr [ i ++ ] = oddArr [ j ];
}
< int > ( ) );
int i = 0;
for ( int j = 0;
j < evenArr . size ( );
j ++ ) arr [ i ++ ] = evenArr [ j ];
for ( int j = 0;
j < oddArr . size ( );
j ++ ) arr [ i ++ ] = oddArr [ j ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,6,10,15,21,38,50,51,72,79,81,82,84,85,86,87},{82,-36,18,-88,-24,20,26,-52,28,2},{0,0,0,1,1,1},{81,47,38,70,35,43,94,30,57,55,78,97,72,1},{-80,-78,-72,-46,-26,-24,-20,8,16,26,38,44,54,68,68,78,86,92},{0,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0},{3,4,9,12,20,30,33,34,37,38,50,51,52,54,60,69,73,74,92,93,94,97,98},{86,-32,64,-36,-36,-30,-66,-60,-76,-56,-60,-16,-60,-98,-18,72,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,11,46,40,82,35,37,41,52,76,13,53,53,3,40,29,7,51,20,51,87,1,80,73,89,93,1,71,33,50,62,85,46,1,71,54,81,85}};
vector<int> param1 {15,7,3,8,11,21,13,10,29,36};
vector<vector<int>> filled_function_param0 {{6,6,6,10,15,21,38,50,51,72,79,81,82,84,85,86,87},{82,-36,18,-88,-24,20,26,-52,28,2},{0,0,0,1,1,1},{81,47,38,70,35,43,94,30,57,55,78,97,72,1},{-80,-78,-72,-46,-26,-24,-20,8,16,26,38,44,54,68,68,78,86,92},{0,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0},{3,4,9,12,20,30,33,34,37,38,50,51,52,54,60,69,73,74,92,93,94,97,98},{86,-32,64,-36,-36,-30,-66,-60,-76,-56,-60,-16,-60,-98,-18,72,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,11,46,40,82,35,37,41,52,76,13,53,53,3,40,29,7,51,20,51,87,1,80,73,89,93,1,71,33,50,62,85,46,1,71,54,81,85}};
vector<int> filled_function_param1 {15,7,3,8,11,21,13,10,29,36};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i]);
f_gold(¶m0[i].front(),param1[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int arr [ ], int n ) { vector < int > evenArr; vector < int > oddArr; for ( int i = 0; i < n; i ++ ) { if ( ! ( i % 2 ) ) evenArr . push_back ( arr [ i ] ); else oddArr . push_back ( arr [ i ] ); } sort ( evenArr . begin ( ), evenArr . end ( ) ); sort ( oddArr . begin ( ), oddArr . end ( ), greater < int > ( ) ); int i = 0; for ( int j = 0; j < evenArr . size ( ); j ++ ) arr [ i ++ ] = evenArr [ j ]; for ( int j = 0; j < oddArr . size ( ); j ++ ) arr [ i ++ ] = oddArr [ j ]; } < int > ( ) );
int i = 0;
for ( int j = 0;
j < evenArr . size ( );
j ++ ) arr [ i ++ ] = evenArr [ j ];
for ( int j = 0;
j < oddArr . size ( );
j ++ ) arr [ i ++ ] = oddArr [ j ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,6,10,15,21,38,50,51,72,79,81,82,84,85,86,87},{82,-36,18,-88,-24,20,26,-52,28,2},{0,0,0,1,1,1},{81,47,38,70,35,43,94,30,57,55,78,97,72,1},{-80,-78,-72,-46,-26,-24,-20,8,16,26,38,44,54,68,68,78,86,92},{0,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0},{3,4,9,12,20,30,33,34,37,38,50,51,52,54,60,69,73,74,92,93,94,97,98},{86,-32,64,-36,-36,-30,-66,-60,-76,-56,-60,-16,-60,-98,-18,72,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,11,46,40,82,35,37,41,52,76,13,53,53,3,40,29,7,51,20,51,87,1,80,73,89,93,1,71,33,50,62,85,46,1,71,54,81,85}};
vector<int> param1 {15,7,3,8,11,21,13,10,29,36};
vector<vector<int>> filled_function_param0 {{6,6,6,10,15,21,38,50,51,72,79,81,82,84,85,86,87},{82,-36,18,-88,-24,20,26,-52,28,2},{0,0,0,1,1,1},{81,47,38,70,35,43,94,30,57,55,78,97,72,1},{-80,-78,-72,-46,-26,-24,-20,8,16,26,38,44,54,68,68,78,86,92},{0,0,1,1,1,0,1,1,1,1,0,1,1,1,1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0},{3,4,9,12,20,30,33,34,37,38,50,51,52,54,60,69,73,74,92,93,94,97,98},{86,-32,64,-36,-36,-30,-66,-60,-76,-56,-60,-16,-60,-98,-18,72,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,11,46,40,82,35,37,41,52,76,13,53,53,3,40,29,7,51,20,51,87,1,80,73,89,93,1,71,33,50,62,85,46,1,71,54,81,85}};
vector<int> filled_function_param1 {15,7,3,8,11,21,13,10,29,36};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i]);
f_gold(¶m0[i].front(),param1[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <string> | [
"a) <iomanip>",
"b) x",
"c) <string>",
"d) -",
"e) ="
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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 = min ( ans, 2 * abs ( 180 - sum ) );
sum -= arr [ l ];
l ++;
}
ans = min ( ans, 2 * abs ( 180 - sum ) );
}
return ans;
}
+= arr [ i ];
while ( sum >= 180 ) {
ans = min ( ans, 2 * abs ( 180 - sum ) );
sum -= arr [ l ];
l ++;
}
ans = min ( ans, 2 * abs ( 180 - sum ) );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {27,29,25,1,4,10,2,20,37,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( 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 = min ( ans, 2 * abs ( 180 - sum ) ); sum -= arr [ l ]; [MASK] ++; } ans = min ( ans, 2 * abs ( 180 - sum ) ); } return ans; }+= arr [ i ];
while ( sum >= 180 ) {
ans = min ( ans, 2 * abs ( 180 - sum ) );
sum -= arr [ l ];
l ++;
}
ans = min ( ans, 2 * abs ( 180 - sum ) );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {27,29,25,1,4,10,2,20,37,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | l | [
"a) x:",
"b) fract_bit",
"c) 1",
"d) l",
"e) ])"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int arr [ ], int l, int h ) {
if ( l >= h ) return;
if ( arr [ l ] > arr [ h ] ) swap ( arr [ l ], arr [ h ] );
if ( h - l + 1 > 2 ) {
int t = ( h - l + 1 ) / 3;
f_gold ( arr, l, h - t );
f_gold ( arr, l + t, h );
f_gold ( arr, l, h - t );
}
}
> arr [ h ] ) swap ( arr [ l ], arr [ h ] );
if ( h - l + 1 > 2 ) {
int t = ( h - l + 1 ) / 3;
f_gold ( arr, l, h - t );
f_gold ( arr, l + t, h );
f_gold ( arr, l, h - t );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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,1,1,1,1,1,0,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}};
vector<int> param1 {6,16,28,9,0,20,28,15,12,27};
vector<int> param2 {6,14,24,10,0,28,29,11,17,20};
vector<vector<int>> filled_function_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,1,1,1,1,1,0,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}};
vector<int> filled_function_param1 {6,16,28,9,0,20,28,15,12,27};
vector<int> filled_function_param2 {6,14,24,10,0,28,29,11,17,20};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i],filled_function_param2[i]);
f_gold(¶m0[i].front(),param1[i],param2[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i] && param2[i] == filled_function_param2[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int arr [ ], int l, int h ) { if ( l >= h ) return; if ( arr [ l ] > arr [ h ] ) swap [MASK] arr [ l ], arr [ h ] ); if ( h - l + 1 > 2 ) { int t = ( h - l + 1 ) / 3; f_gold ( arr, l, h - t ); f_gold ( arr, l + t, h ); f_gold ( arr, l, h - t ); } }> arr [ h ] ) swap ( arr [ l ], arr [ h ] );
if ( h - l + 1 > 2 ) {
int t = ( h - l + 1 ) / 3;
f_gold ( arr, l, h - t );
f_gold ( arr, l + t, h );
f_gold ( arr, l, h - t );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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,1,1,1,1,1,0,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}};
vector<int> param1 {6,16,28,9,0,20,28,15,12,27};
vector<int> param2 {6,14,24,10,0,28,29,11,17,20};
vector<vector<int>> filled_function_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,1,1,1,1,1,0,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}};
vector<int> filled_function_param1 {6,16,28,9,0,20,28,15,12,27};
vector<int> filled_function_param2 {6,14,24,10,0,28,29,11,17,20};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i],filled_function_param2[i]);
f_gold(¶m0[i].front(),param1[i],param2[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i] && param2[i] == filled_function_param2[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) len",
"b) start",
"c) (",
"d) )",
"e) ]"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 1 ) return 2;
return 2 * f_gold ( n - 1 );
}
ude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 1 ) return 2;
return 2 * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {72,28,45,41,94,97,97,36,91,84};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; [MASK] f_gold ( int n ) { if ( n == 1 ) return 2; return 2 * f_gold ( n - 1 ); }ude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 1 ) return 2;
return 2 * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {72,28,45,41,94,97,97,36,91,84};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) return",
"b) (",
"c) static",
"d) 1;",
"e) int"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( 3 * x * ( x + 1 ) ) / 2;
}
clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( 3 * x * ( x + 1 ) ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,25,15,30,17,80,27,13,12,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [MASK] <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x ) { return ( 3 * x * ( x + 1 ) ) / 2; }clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( 3 * x * ( x + 1 ) ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,25,15,30,17,80,27,13,12,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) (",
"b) n",
"c) int",
"d) #include",
"e) s"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double s ) {
return ( ( 3 * sqrt ( 3 ) * ( s * s ) ) / 2 );
}
clude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double s ) {
return ( ( 3 * sqrt ( 3 ) * ( s * s ) ) / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1772.6589509256596,-599.737107809315,1074.1765931782,-1182.4087746714795,8083.035797247716,-6126.414356565494,5370.057504189614,-6947.020794285176,2110.5107873533325,-6458.751326919488};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( double s ) { return ( ( 3 * sqrt ( 3 ) * ( s [MASK] s ) ) / 2 ); }clude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double s ) {
return ( ( 3 * sqrt ( 3 ) * ( s * s ) ) / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1772.6589509256596,-599.737107809315,1074.1765931782,-1182.4087746714795,8083.035797247716,-6126.414356565494,5370.057504189614,-6947.020794285176,2110.5107873533325,-6458.751326919488};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | * | [
"a) 1",
"b) (int",
"c) *",
"d) return",
"e) cmpfunc);}"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
<iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,74,46,38,51,48,6,14,31,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int n ) { if ( n <= 1 ) return false; for ( int i = 2; i < n; i ++ ) if ( n % i == 0 ) return false; return [MASK] } <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,74,46,38,51,48,6,14,31,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | true; | [
"a) n",
"b) [",
"c) return",
"d) int",
"e) true;"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string seq ) {
int n = seq . length ( );
if ( n >= 9 ) return "-1";
string result ( n + 1, ' ' );
int count = 1;
for ( int i = 0;
i <= n;
i ++ ) {
if ( i == n || seq [ i ] == 'I' ) {
for ( int j = i - 1;
j >= - 1;
j -- ) {
result [ j + 1 ] = '0' + count ++;
if ( j >= 0 && seq [ j ] == 'I' ) break;
}
}
}
return result;
}
= 'I' ) {
for ( int j = i - 1;
j >= - 1;
j -- ) {
result [ j + 1 ] = '0' + count ++;
if ( j >= 0 && seq [ j ] == 'I' ) break;
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"D","I","DD","II","DIDI","IIDDD","DDIDDIID","176297","1","XHkhZq"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string seq ) { int n = seq . length ( ); if ( n >= 9 ) return "-1"; string result ( n + 1, ' ' ); int count = 1; for ( int i = 0; i <= n; i ++ ) { if ( i == n || seq [ i ] == 'I' ) { for ( int j = i - [MASK] j >= - 1; j -- ) { result [ j + 1 ] = '0' + count ++; if ( j >= 0 && seq [ j ] == 'I' ) break; } } } return result; }= 'I' ) {
for ( int j = i - 1;
j >= - 1;
j -- ) {
result [ j + 1 ] = '0' + count ++;
if ( j >= 0 && seq [ j ] == 'I' ) break;
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"D","I","DD","II","DIDI","IIDDD","DDIDDIID","176297","1","XHkhZq"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 1; | [
"a) math.ceil",
"b) .",
"c) *",
"d) 1;",
"e) i"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string num ) {
int length = num . size ( );
if ( length == 1 && num [ 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 [ i -- ] - '0';
group += ( num [ i -- ] - '0' ) * 10;
group += ( num [ i ] - '0' ) * 100;
sum = sum + group * p;
p *= ( - 1 );
}
sum = abs ( sum );
return ( sum % 13 == 0 );
}
i -- ] - '0';
group += ( num [ i -- ] - '0' ) * 10;
group += ( num [ i ] - '0' ) * 100;
sum = sum + group * p;
p *= ( - 1 );
}
sum = abs ( sum );
return ( sum % 13 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"vzTUaItpCpLnjY","33855","0011110101011","MMQ","439340517954","000000000","UugAuRRJbjEgl","6406553695441","011001","yjFqEEvgiNjEX"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> [MASK] <bits/stdc++.h> using namespace std; bool f_gold ( string num ) { int length = num . size ( ); if ( length == 1 && num [ 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 [ i -- ] - '0'; group += ( num [ i -- ] - '0' ) * 10; group += ( num [ i ] - '0' ) * 100; sum = sum + group * p; p *= ( - 1 ); } sum = abs ( sum ); return ( sum % 13 == 0 ); } i -- ] - '0';
group += ( num [ i -- ] - '0' ) * 10;
group += ( num [ i ] - '0' ) * 100;
sum = sum + group * p;
p *= ( - 1 );
}
sum = abs ( sum );
return ( sum % 13 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"vzTUaItpCpLnjY","33855","0011110101011","MMQ","439340517954","000000000","UugAuRRJbjEgl","6406553695441","011001","yjFqEEvgiNjEX"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) int",
"b) n",
"c) 2",
"d) a",
"e) #include"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 9 == 0 );
}
g namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 9 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"69354","43347276812854","0111111111","9999918","333","1011011101","1","2284737","011001","cc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { int n = str . length ( ); int digitSum = 0; for ( int i = 0; i < n; i ++ ) digitSum += ( str [ i ] - '0' ); return ( digitSum % 9 [MASK] 0 ); }g namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 9 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"69354","43347276812854","0111111111","9999918","333","1011011101","1","2284737","011001","cc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | == | [
"a) )",
"b) [",
"c) arr",
"d) )",
"e) =="
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s, int K ) {
int n = s . length ( );
int C, c1 = 0, c2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s [ i ] == 'a' ) c1 ++;
if ( s [ i ] == 'b' ) {
c2 ++;
C += c1;
}
}
return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2;
}
2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s [ i ] == 'a' ) c1 ++;
if ( s [ i ] == 'b' ) {
c2 ++;
C += c1;
}
}
return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"KdJ","031","11000","zPbB","9","1010","c","06064629743411","1111","PFXAhru"};
vector<int> param1 {96,70,59,60,80,41,87,4,18,83};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string s, int K ) { int n = s . length ( ); int C, [MASK] = 0, c2 = 0; for ( int i = 0; i < n; i ++ ) { if ( s [ i ] == 'a' ) c1 ++; if ( s [ i ] == 'b' ) { c2 ++; C += c1; } } return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2; }2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s [ i ] == 'a' ) c1 ++;
if ( s [ i ] == 'b' ) {
c2 ++;
C += c1;
}
}
return C * K + ( K * ( K - 1 ) / 2 ) * c1 * c2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"KdJ","031","11000","zPbB","9","1010","c","06064629743411","1111","PFXAhru"};
vector<int> param1 {96,70,59,60,80,41,87,4,18,83};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | c1 | [
"a) min(int",
"b) -",
"c) c1",
"d) arr",
"e) int"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
long int dp [ n + 1 ] [ 27 ];
memset ( dp, 0, sizeof ( dp ) );
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 int sum = 0;
for ( int i = 0;
i <= 25;
i ++ ) sum = ( sum + dp [ n ] [ i ] );
return sum;
}
+ 1 ];
else dp [ i ] [ j ] = ( dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] );
}
long int sum = 0;
for ( int i = 0;
i <= 25;
i ++ ) sum = ( sum + dp [ n ] [ i ] );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {7,47,72,66,71,56,61,68,78,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { long int dp [ n + 1 ] [ 27 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 0; i <= 25; i ++ ) dp [ [MASK] ] [ 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 int sum = 0; for ( int i = 0; i <= 25; i ++ ) sum = ( sum + dp [ n ] [ i ] ); return sum; }+ 1 ];
else dp [ i ] [ j ] = ( dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ] );
}
long int sum = 0;
for ( int i = 0;
i <= 25;
i ++ ) sum = ( sum + dp [ n ] [ i ] );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {7,47,72,66,71,56,61,68,78,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 1 | [
"a) ;",
"b) 1",
"c) )",
"d) namespace",
"e) #include"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int dp [ n ];
if ( n == 1 ) return arr [ 0 ];
if ( n == 2 ) return min ( arr [ 0 ], arr [ 1 ] );
if ( n == 3 ) return min ( arr [ 0 ], min ( arr [ 1 ], arr [ 2 ] ) );
if ( n == 4 ) return min ( min ( arr [ 0 ], arr [ 1 ] ), 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 ] + min ( min ( dp [ i - 1 ], dp [ i - 2 ] ), min ( dp [ i - 3 ], dp [ i - 4 ] ) );
return min ( min ( dp [ n - 1 ], dp [ n - 2 ] ), min ( dp [ n - 4 ], dp [ n - 3 ] ) );
}
) dp [ i ] = arr [ i ] + min ( min ( dp [ i - 1 ], dp [ i - 2 ] ), min ( dp [ i - 3 ], dp [ i - 4 ] ) );
return min ( min ( dp [ n - 1 ], dp [ n - 2 ] ), min ( dp [ n - 4 ], dp [ n - 3 ] ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {30,40,14,33,1,5,25,22,20,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int dp [ n ]; if ( n == 1 ) return arr [ 0 ]; if ( n == 2 ) return min ( arr [ 0 ], arr [ 1 ] ); if ( n == 3 ) return min ( arr [ 0 ], min ( arr [ 1 ], arr [ 2 ] ) ); if ( n == 4 ) return min ( min ( arr [ 0 ], arr [ 1 ] ), min ( arr [ 2 ], arr [ 3 ] ) ); dp [ 0 ] = arr [ 0 ]; dp [ 1 ] = arr [ 1 ]; dp [ 2 ] = arr [ 2 ]; dp [ 3 ] = arr [ 3 ]; [MASK] ( int i = 4; i < n; i ++ ) dp [ i ] = arr [ i ] + min ( min ( dp [ i - 1 ], dp [ i - 2 ] ), min ( dp [ i - 3 ], dp [ i - 4 ] ) ); return min ( min ( dp [ n - 1 ], dp [ n - 2 ] ), min ( dp [ n - 4 ], dp [ n - 3 ] ) ); } ) dp [ i ] = arr [ i ] + min ( min ( dp [ i - 1 ], dp [ i - 2 ] ), min ( dp [ i - 3 ], dp [ i - 4 ] ) );
return min ( min ( dp [ n - 1 ], dp [ n - 2 ] ), min ( dp [ n - 4 ], dp [ n - 3 ] ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {30,40,14,33,1,5,25,22,20,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | for | [
"a) =",
"b) l1",
"c) ]",
"d) +=",
"e) for"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > mp;
int max_dist = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( mp . find ( arr [ i ] ) == mp . end ( ) ) mp [ arr [ i ] ] = i;
else max_dist = max ( max_dist, i - mp [ arr [ i ] ] );
}
return max_dist;
}
for ( int i = 0;
i < n;
i ++ ) {
if ( mp . find ( arr [ i ] ) == mp . end ( ) ) mp [ arr [ i ] ] = i;
else max_dist = max ( max_dist, i - mp [ arr [ i ] ] );
}
return max_dist;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {27,34,11,1,12,29,9,2,22,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_map < int, int > mp; int max_dist = 0; for ( int i = 0; i [MASK] n; i ++ ) { if ( mp . find ( arr [ i ] ) == mp . end ( ) ) mp [ arr [ i ] ] = i; else max_dist = max ( max_dist, i - mp [ arr [ i ] ] ); } return max_dist; } for ( int i = 0;
i < n;
i ++ ) {
if ( mp . find ( arr [ i ] ) == mp . end ( ) ) mp [ arr [ i ] ] = i;
else max_dist = max ( max_dist, i - mp [ arr [ i ] ] );
}
return max_dist;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {27,34,11,1,12,29,9,2,22,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | < | [
"a) <",
"b) )",
"c) *;",
"d) \"",
"e) //"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str ) {
string result = "";
bool v = true;
for ( int i = 0;
i < str . length ( );
i ++ ) {
if ( str [ i ] == ' ' ) v = true;
else if ( str [ i ] != ' ' && v == true ) {
result . push_back ( str [ i ] );
v = false;
}
}
return result;
}
. length ( );
i ++ ) {
if ( str [ i ] == ' ' ) v = true;
else if ( str [ i ] != ' ' && v == true ) {
result . push_back ( str [ i ] );
v = false;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"t a","77 78 2 600 7","011 10 10","kVCo kV Co O iR","2","0 11","Y sT wgheC","58 824 6","00 100 001 0111","Q"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str ) { string result = ""; [MASK] v = true; for ( int i = 0; i < str . length ( ); i ++ ) { if ( str [ i ] == ' ' ) v = true; else if ( str [ i ] != ' ' && v == true ) { result . push_back ( str [ i ] ); v = false; } } return result; }. length ( );
i ++ ) {
if ( str [ i ] == ' ' ) v = true;
else if ( str [ i ] != ' ' && v == true ) {
result . push_back ( str [ i ] );
v = false;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"t a","77 78 2 600 7","011 10 10","kVCo kV Co O iR","2","0 11","Y sT wgheC","58 824 6","00 100 001 0111","Q"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | bool | [
"a) j",
"b) arr1",
"c) bool",
"d) int",
"e) size"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return accumulate ( arr, arr + n, 0 ) - ( ( n - 1 ) * n / 2 );
}
<vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return accumulate ( arr, arr + n, 0 ) - ( ( n - 1 ) * n / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {5,9,8,31,28,25,27,11,15,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { return accumulate ( arr, arr + n, 0 ) - ( ( [MASK] - 1 ) * n / 2 ); } <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return accumulate ( arr, arr + n, 0 ) - ( ( n - 1 ) * n / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {5,9,8,31,28,25,27,11,15,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) 1",
"b) }",
"c) sizeof",
"d) n",
"e) ["
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int a, unsigned int b ) {
int res = 0;
while ( b > 0 ) {
if ( b & 1 ) res = res + a;
a = a << 1;
b = b >> 1;
}
return res;
}
using namespace std;
unsigned int f_gold ( unsigned int a, unsigned int b ) {
int res = 0;
while ( b > 0 ) {
if ( b & 1 ) res = res + a;
a = a << 1;
b = b >> 1;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,36,65,55,35,69,84,5,15,67};
vector<int> param1 {33,67,52,37,76,98,62,80,36,84};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int a, [MASK] int b ) { int res = 0; while ( b > 0 ) { if ( b & 1 ) res = res + a; a = a << 1; b = b >> 1; } return res; }using namespace std;
unsigned int f_gold ( unsigned int a, unsigned int b ) {
int res = 0;
while ( b > 0 ) {
if ( b & 1 ) res = res + a;
a = a << 1;
b = b >> 1;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,36,65,55,35,69,84,5,15,67};
vector<int> param1 {33,67,52,37,76,98,62,80,36,84};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | unsigned | [
"a) :",
"b) //",
"c) return",
"d) <",
"e) unsigned"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long n ) {
return pow ( n, 2 );
}
ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long n ) {
return pow ( n, 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {42,40,67,73,18,16,74,33,92,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold [MASK] long n ) { return pow ( n, 2 ); }ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long n ) {
return pow ( n, 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {42,40,67,73,18,16,74,33,92,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) return",
"b) [",
"c) {}",
"d) {",
"e) ("
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int answer [ n + 1 ] = {
0 };
answer [ 0 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2;
return answer [ n ];
}
int f_gold ( int n ) {
int answer [ n + 1 ] = {
0 };
answer [ 0 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2;
return answer [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {33,72,81,93,8,76,97,91,61,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int answer [ n + 1 ] = [MASK] 0 }; answer [ 0 ] = 1; for ( int i = 1; i <= n; i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2; return answer [ n ]; }int f_gold ( int n ) {
int answer [ n + 1 ] = {
0 };
answer [ 0 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) answer [ i ] = answer [ i - 1 ] * 3 + 2;
return answer [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {33,72,81,93,8,76,97,91,61,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) import",
"b) ++",
"c) }",
"d) {",
"e) int"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
return k * k * k;
}
e <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
return k * k * k;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,96,14,64,24,74,85,27,78,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int [MASK] ) { return k * k * k; }e <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
return k * k * k;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,96,14,64,24,74,85,27,78,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | k | [
"a) long",
"b) (l",
"c) k",
"d) arr2",
"e) !="
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string n ) {
int i = 0, pos = 0;
while ( n [ i ] != '\0' ) {
switch ( n [ i ] ) {
case '4' : pos = pos * 2 + 1;
break;
case '7' : pos = pos * 2 + 2;
break;
}
i ++;
}
return pos;
}
os = 0;
while ( n [ i ] != '\0' ) {
switch ( n [ i ] ) {
case '4' : pos = pos * 2 + 1;
break;
case '7' : pos = pos * 2 + 2;
break;
}
i ++;
}
return pos;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"7","305745689","444","4","2074","27","447","255","10000111111011","fAKcSDRTNz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; [MASK] f_gold ( string n ) { int i = 0, pos = 0; while ( n [ i ] != '\0' ) { switch ( n [ i ] ) { case '4' : pos = pos * 2 + 1; break; case '7' : pos = pos * 2 + 2; break; } i ++; } return pos; }os = 0;
while ( n [ i ] != '\0' ) {
switch ( n [ i ] ) {
case '4' : pos = pos * 2 + 1;
break;
case '7' : pos = pos * 2 + 2;
break;
}
i ++;
}
return pos;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"7","305745689","444","4","2074","27","447","255","10000111111011","fAKcSDRTNz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) ;",
"b) ;",
"c) -",
"d) i",
"e) int"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int size ) {
int max_so_far = a [ 0 ];
int curr_max = a [ 0 ];
for ( int i = 1;
i < size;
i ++ ) {
curr_max = max ( a [ i ], curr_max + a [ i ] );
max_so_far = max ( max_so_far, curr_max );
}
return max_so_far;
}
];
int curr_max = a [ 0 ];
for ( int i = 1;
i < size;
i ++ ) {
curr_max = max ( a [ i ], curr_max + a [ i ] );
max_so_far = max ( max_so_far, curr_max );
}
return max_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {38,10,18,25,35,22,34,20,22,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int size ) { int max_so_far = a [ 0 ]; int curr_max = a [ 0 ]; for ( int i = 1; i < size; i ++ ) { curr_max = max ( a [ i ], curr_max + a [ i ] ); max_so_far = max ( max_so_far, curr_max ); } return max_so_far; [MASK]];
int curr_max = a [ 0 ];
for ( int i = 1;
i < size;
i ++ ) {
curr_max = max ( a [ i ], curr_max + a [ i ] );
max_so_far = max ( max_so_far, curr_max );
}
return max_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {38,10,18,25,35,22,34,20,22,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) f_gold",
"b) ]",
"c) }",
"d) java.lang.*;",
"e) sum"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int key ) {
int i;
for ( i = 0;
i < n;
i ++ ) if ( arr [ i ] == key ) return i;
return - 1;
}
ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int key ) {
int i;
for ( i = 0;
i < n;
i ++ ) if ( arr [ i ] == key ) return i;
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {8,27,11,24,18,17,15,21,2,12};
vector<int> param2 {11,12,0,72,23,16,28,16,3,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include <string> [MASK] <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int key ) { int i; for ( i = 0; i < n; i ++ ) if ( arr [ i ] == key ) return i; return - 1; }ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int key ) {
int i;
for ( i = 0;
i < n;
i ++ ) if ( arr [ i ] == key ) return i;
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {8,27,11,24,18,17,15,21,2,12};
vector<int> param2 {11,12,0,72,23,16,28,16,3,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include | [
"a) while",
"b) #include",
"c) (",
"d) x",
"e) ("
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int W, int wt [ ], int val [ ], int n ) {
if ( n == 0 || W == 0 ) return 0;
if ( wt [ n - 1 ] > W ) return f_gold ( W, wt, val, n - 1 );
else return max ( val [ n - 1 ] + f_gold ( W - wt [ n - 1 ], wt, val, n - 1 ), f_gold ( W, wt, val, n - 1 ) );
}
W == 0 ) return 0;
if ( wt [ n - 1 ] > W ) return f_gold ( W, wt, val, n - 1 );
else return max ( val [ n - 1 ] + f_gold ( W - wt [ n - 1 ], wt, val, n - 1 ), f_gold ( W, wt, val, n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {5,9,26,7,46,28,25,9,13,4};
vector<vector<int>> param1 {{6,14,18,36,40,47,54,58},{42,60,-4,24,54,42,-72,-92,48,-94,-36,18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{56,53,85,73,93,75,21,22,39,13,92},{-96,-96,-94,-84,-78,-76,-74,-74,-72,-70,-70,-50,-48,-38,-30,-28,-28,-24,-14,-10,-4,-2,6,6,18,28,30,30,34,36,42,48,50,52,54,58,58,60,62,74,74,86,86,88,88,94,96,96,98},{1,1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,0,0,0,1,1,1,1,1,0},{7,16,18,21,22,26,30,32,34,37,37,38,39,40,44,54,55,56,56,58,59,60,62,62,64,66,75,80,82,83,84,85,88,89,89,90,93,96,97},{64,-38,76,-24,-10,78,-76,78,-32,20},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{10,87,55,78,11}};
vector<vector<int>> param2 {{9,15,23,24,41,45,50,92},{-20,56,20,-82,84,-90,54,50,82,92,-32,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{17,27,34,86,49,89,79,70,32,23,64},{-92,-72,-72,-68,-60,-58,-52,-48,-46,-46,-44,-44,-42,-36,-32,-30,-30,-24,-22,-18,-16,-8,-6,-6,-4,-2,6,8,16,20,20,30,32,32,36,40,42,44,44,46,54,56,56,58,82,82,86,90,90},{1,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,0,0,1,1,0,0,0,0,1,0,0,0,0,0},{1,7,9,10,11,21,23,25,29,32,35,35,35,36,37,38,42,47,47,48,51,52,55,58,64,70,72,73,74,76,77,80,86,91,92,92,92,92,96},{64,50,-78,78,78,44,-14,-70,-76,90},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{29,43,93,2,42}};
vector<int> param3 {7,7,15,9,28,21,31,6,14,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i]) == f_gold(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int W, int wt [ ], int val [ ], int n ) { if ( n == 0 || W == 0 ) return 0; if ( wt [ n - 1 ] > W ) return f_gold ( W, wt, val, n - 1 ); else return max ( val [ n - 1 ] + f_gold ( [MASK] - wt [ n - 1 ], wt, val, n - 1 ), f_gold ( W, wt, val, n - 1 ) ); }W == 0 ) return 0;
if ( wt [ n - 1 ] > W ) return f_gold ( W, wt, val, n - 1 );
else return max ( val [ n - 1 ] + f_gold ( W - wt [ n - 1 ], wt, val, n - 1 ), f_gold ( W, wt, val, n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {5,9,26,7,46,28,25,9,13,4};
vector<vector<int>> param1 {{6,14,18,36,40,47,54,58},{42,60,-4,24,54,42,-72,-92,48,-94,-36,18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{56,53,85,73,93,75,21,22,39,13,92},{-96,-96,-94,-84,-78,-76,-74,-74,-72,-70,-70,-50,-48,-38,-30,-28,-28,-24,-14,-10,-4,-2,6,6,18,28,30,30,34,36,42,48,50,52,54,58,58,60,62,74,74,86,86,88,88,94,96,96,98},{1,1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0,0,1,1,1,0,0,0,1,1,1,1,1,0},{7,16,18,21,22,26,30,32,34,37,37,38,39,40,44,54,55,56,56,58,59,60,62,62,64,66,75,80,82,83,84,85,88,89,89,90,93,96,97},{64,-38,76,-24,-10,78,-76,78,-32,20},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{10,87,55,78,11}};
vector<vector<int>> param2 {{9,15,23,24,41,45,50,92},{-20,56,20,-82,84,-90,54,50,82,92,-32,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{17,27,34,86,49,89,79,70,32,23,64},{-92,-72,-72,-68,-60,-58,-52,-48,-46,-46,-44,-44,-42,-36,-32,-30,-30,-24,-22,-18,-16,-8,-6,-6,-4,-2,6,8,16,20,20,30,32,32,36,40,42,44,44,46,54,56,56,58,82,82,86,90,90},{1,0,0,1,1,1,0,1,0,1,1,0,1,0,1,0,0,0,1,1,0,0,0,0,1,0,0,0,0,0},{1,7,9,10,11,21,23,25,29,32,35,35,35,36,37,38,42,47,47,48,51,52,55,58,64,70,72,73,74,76,77,80,86,91,92,92,92,92,96},{64,50,-78,78,78,44,-14,-70,-76,90},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{29,43,93,2,42}};
vector<int> param3 {7,7,15,9,28,21,31,6,14,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i]) == f_gold(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | W | [
"a) max(int",
"b) W",
"c) (sizeof",
"d) l",
"e) (arr,"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int x, int y ) {
vector < bool > arr ( n + 1, false );
if ( x <= n ) arr [ x ] = true;
if ( y <= n ) arr [ y ] = true;
int result = 0;
for ( int i = 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;
}
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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,56,30,51,21,69,12,44,99,46};
vector<int> param1 {16,95,63,89,99,63,69,52,65,58};
vector<int> param2 {16,6,1,46,38,50,73,9,10,37};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> [MASK] <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int x, int y ) { vector < bool > arr ( n + 1, false ); if ( x <= n ) arr [ x ] = true; if ( y <= n ) arr [ y ] = true; int result = 0; for ( int i = 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; } 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,56,30,51,21,69,12,44,99,46};
vector<int> param1 {16,95,63,89,99,63,69,52,65,58};
vector<int> param2 {16,6,1,46,38,50,73,9,10,37};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) {",
"b) ]",
"c) profit",
"d) if",
"e) #include"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return * max_element ( arr, arr + n );
}
nclude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return * max_element ( arr, arr + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,25,11,40,33,29,28,14,33,34};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold [MASK] int arr [ ], int n ) { return * max_element ( arr, arr + n ); }nclude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
return * max_element ( arr, arr + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,25,11,40,33,29,28,14,33,34};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) import",
"b) 11",
"c) =",
"d) (",
"e) =="
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {15,7,16,67,71,16,77,27,37,73};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { int res [MASK] 1, i; for ( i = 2; i <= n; i ++ ) res *= i; return res; }de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {15,7,16,67,71,16,77,27,37,73};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) (",
"b) ,",
"c) class",
"d) =",
"e) =="
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int * jumps = new int [ n ];
int i, j;
if ( n == 0 || arr [ 0 ] == 0 ) return INT_MAX;
jumps [ 0 ] = 0;
for ( i = 1;
i < n;
i ++ ) {
jumps [ i ] = INT_MAX;
for ( j = 0;
j < i;
j ++ ) {
if ( i <= j + arr [ j ] && jumps [ j ] != INT_MAX ) {
jumps [ i ] = min ( jumps [ i ], jumps [ j ] + 1 );
break;
}
}
}
return jumps [ n - 1 ];
}
i;
j ++ ) {
if ( i <= j + arr [ j ] && jumps [ j ] != INT_MAX ) {
jumps [ i ] = min ( jumps [ i ], jumps [ j ] + 1 );
break;
}
}
}
return jumps [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,9,9,12,13,13,13,15,16,17,18,20,20,20,25,28,30,30,33,34,34,37,42,45,49,50,52,52,54,65,68,72,74,75,82,85,87,91,91,94,95},{-28,90,30,-80,-10,26,-12,24,12,44,-38,20,26,38,-8,-40,88,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,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},{74,37,37,71,85,89,44,72,55,8,5,98,54,37,7,76,93,74,84,51,18,37},{-68,14,76},{0,0,1,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,1,1},{3,4,6,6,7,14,28,36,37,44,46,47,50,51,52,55,55,61,68,69,70,73,74,77,86,90,90,91,98,99},{-4,-24,-84,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{78,88,1,98,26,31,56,12,71}};
vector<int> param1 {22,9,37,20,1,27,23,2,32,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> [MASK] <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int * jumps = new int [ n ]; int i, j; if ( n == 0 || arr [ 0 ] == 0 ) return INT_MAX; jumps [ 0 ] = 0; for ( i = 1; i < n; i ++ ) { jumps [ i ] = INT_MAX; for ( j = 0; j < i; j ++ ) { if ( i <= j + arr [ j ] && jumps [ j ] != INT_MAX ) { jumps [ i ] = min ( jumps [ i ], jumps [ j ] + 1 ); break; } } } return jumps [ n - 1 ]; }i;
j ++ ) {
if ( i <= j + arr [ j ] && jumps [ j ] != INT_MAX ) {
jumps [ i ] = min ( jumps [ i ], jumps [ j ] + 1 );
break;
}
}
}
return jumps [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,9,9,12,13,13,13,15,16,17,18,20,20,20,25,28,30,30,33,34,34,37,42,45,49,50,52,52,54,65,68,72,74,75,82,85,87,91,91,94,95},{-28,90,30,-80,-10,26,-12,24,12,44,-38,20,26,38,-8,-40,88,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,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},{74,37,37,71,85,89,44,72,55,8,5,98,54,37,7,76,93,74,84,51,18,37},{-68,14,76},{0,0,1,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,0,0,1,0,1,1,0,1,0,0,1,1,1},{3,4,6,6,7,14,28,36,37,44,46,47,50,51,52,55,55,61,68,69,70,73,74,77,86,90,90,91,98,99},{-4,-24,-84,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{78,88,1,98,26,31,56,12,71}};
vector<int> param1 {22,9,37,20,1,27,23,2,32,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) #include",
"b) {",
"c) 0;",
"d) ]",
"e) i"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int m ) {
if ( m == 0 || n == 0 ) return 0;
sort ( arr, arr + n );
if ( n < m ) return - 1;
int min_diff = INT_MAX;
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 ] );
}
{
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 ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,11,23,33,35,39,51,52,56,74,76,76,79,85,88,93,98},{-42,76,-34,-74,16,4,88,-70,-88,-94,-24,4,-14,-56,56,-18,84,0,-48,-94,72,42,36,52,74,-84,-50,16,30},{0,0,1,1,1,1},{29,49,88,44,92,43,12,5,38,75,57,3,85,16,86,62,16,40,76,37,5,69,16,63,84,78,74,18,4,89,73,67,60},{-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,1,0,1,1,1,0,1,0,0,1,1,1,1,1},{13,15,62,65,87},{-50,58,78,28,4,18,-8,18,-88,-48,-26,-32,64,48,60,94,-92,48,-36,30,-80,-60,82,-62,32,-36,-76,-88,-60,22,-14,72,30},{0,0,0,0,1,1,1,1,1,1,1},{25,17,58,40,53,73,23,77,38}};
vector<int> param1 {16,15,5,25,16,13,3,31,9,8};
vector<int> param2 {13,28,5,18,12,14,4,17,6,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int m ) { if ( m == 0 || n == 0 ) return 0; sort ( arr, arr + n ); if ( n < m ) return - 1; int min_diff = INT_MAX; int first = 0, last = 0; for ( int i = 0; i + m - 1 < n; i ++ ) { int diff = arr [ i + [MASK] - 1 ] - arr [ i ]; if ( diff < min_diff ) { min_diff = diff; first = i; last = i + m - 1; } } return ( arr [ last ] - arr [ first ] ); } {
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 ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,11,23,33,35,39,51,52,56,74,76,76,79,85,88,93,98},{-42,76,-34,-74,16,4,88,-70,-88,-94,-24,4,-14,-56,56,-18,84,0,-48,-94,72,42,36,52,74,-84,-50,16,30},{0,0,1,1,1,1},{29,49,88,44,92,43,12,5,38,75,57,3,85,16,86,62,16,40,76,37,5,69,16,63,84,78,74,18,4,89,73,67,60},{-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,1,0,1,1,1,0,1,0,0,1,1,1,1,1},{13,15,62,65,87},{-50,58,78,28,4,18,-8,18,-88,-48,-26,-32,64,48,60,94,-92,48,-36,30,-80,-60,82,-62,32,-36,-76,-88,-60,22,-14,72,30},{0,0,0,0,1,1,1,1,1,1,1},{25,17,58,40,53,73,23,77,38}};
vector<int> param1 {16,15,5,25,16,13,3,31,9,8};
vector<int> param2 {13,28,5,18,12,14,4,17,6,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | m | [
"a) #include",
"b) (",
"c) m",
"d) )",
"e) <"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( long long int n ) {
while ( n / 100 ) {
int last_digit = n % 10;
n /= 10;
n += last_digit * 3;
}
return ( n % 29 == 0 );
}
lude <bits/stdc++.h>
using namespace std;
bool f_gold ( long long int n ) {
while ( n / 100 ) {
int last_digit = n % 10;
n /= 10;
n += last_digit * 3;
}
return ( n % 29 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {50,11,65,32,8,54,7,44,34,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( long long int n ) { while ( n / 100 ) { int last_digit = n % 10; n /= 10; n += last_digit * [MASK] } return ( n % 29 == 0 ); }lude <bits/stdc++.h>
using namespace std;
bool f_gold ( long long int n ) {
while ( n / 100 ) {
int last_digit = n % 10;
n /= 10;
n += last_digit * 3;
}
return ( n % 29 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {50,11,65,32,8,54,7,44,34,63};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 3; | [
"a) !=",
"b) 3;",
"c) {",
"d) d",
"e) eq_root"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n == 0 || n == 9 ) return true;
if ( n < 9 ) return false;
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) );
}
clude <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n == 0 || n == 9 ) return true;
if ( n < 9 ) return false;
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {96,85,54,14,47,11,49,99,28,82};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace [MASK] bool f_gold ( int n ) { if ( n == 0 || n == 9 ) return true; if ( n < 9 ) return false; return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) ); }clude <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n == 0 || n == 9 ) return true;
if ( n < 9 ) return false;
return f_gold ( ( int ) ( n >> 3 ) - ( int ) ( n & 7 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {96,85,54,14,47,11,49,99,28,82};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | std; | [
"a) s",
"b) =",
"c) std;",
"d) b)",
"e) }"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int bell [ 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 ];
}
{
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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,78,9,73,4,53,85,38,39,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) [MASK] int bell [ 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 ]; } {
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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,78,9,73,4,53,85,38,39,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) (",
"b) <=",
"c) digit",
"d) {",
"e) best"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( char str [ ], int n ) {
int dp [ n ] [ n ];
memset ( dp, 0, sizeof ( dp ) );
bool P [ n ] [ n ];
memset ( P, false, sizeof ( P ) );
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 ];
}
[ 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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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'}};
vector<int> param1 {11,27,23,27,35,43,9,16,32,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( char str [ ], int n ) { int dp [ n ] [ n ]; memset ( dp, 0, sizeof ( dp ) ); bool P [ n ] [ n ]; memset ( P, false, sizeof ( P ) ); 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 [MASK] 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 ]; } [ 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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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'}};
vector<int> param1 {11,27,23,27,35,43,9,16,32,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) /",
"b) )",
"c) (",
"d) \"\"",
"e) max"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
char f_gold ( string strA, string strB ) {
int res = 0, i;
for ( i = 0;
i < strA . length ( );
i ++ ) {
res ^= strA [ i ];
}
for ( i = 0;
i < strB . length ( );
i ++ ) {
res ^= strB [ i ];
}
return ( ( char ) ( res ) );
}
= 0, i;
for ( i = 0;
i < strA . length ( );
i ++ ) {
res ^= strA [ i ];
}
for ( i = 0;
i < strB . length ( );
i ++ ) {
res ^= strB [ i ];
}
return ( ( char ) ( res ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"obfLA mmMYvghH","2941","0111111","oWvbFstI","4937516500","101110100","hYZscJQFBE","58443","1100","ZUdYuIBVNaeeb"};
vector<string> param1 {"obfLA mmMYvghH","23941","01011111","oWvsbFstI","49376516500","1011210100","hYZscJQQFBE","584443","11000","ZUdYVuIBVNaeeb"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; char f_gold ( string strA, string strB ) { int res = 0, i; for ( i = 0; i < strA . length [MASK] ); i ++ ) { res ^= strA [ i ]; } for ( i = 0; i < strB . length ( ); i ++ ) { res ^= strB [ i ]; } return ( ( char ) ( res ) ); }= 0, i;
for ( i = 0;
i < strA . length ( );
i ++ ) {
res ^= strA [ i ];
}
for ( i = 0;
i < strB . length ( );
i ++ ) {
res ^= strB [ i ];
}
return ( ( char ) ( res ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"obfLA mmMYvghH","2941","0111111","oWvbFstI","4937516500","101110100","hYZscJQFBE","58443","1100","ZUdYuIBVNaeeb"};
vector<string> param1 {"obfLA mmMYvghH","23941","01011111","oWvsbFstI","49376516500","1011210100","hYZscJQQFBE","584443","11000","ZUdYVuIBVNaeeb"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) return",
"b) int",
"c) (",
"d) *;",
"e) int"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( 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;
}
;
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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {15,90,38,65,91,16,48,74,14,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( 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; [MASK];
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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {15,90,38,65,91,16,48,74,14,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) .",
"b) b,",
"c) sizeof",
"d) dp",
"e) }"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 ) return 0;
else return 1 + f_gold ( n & ( n - 1 ) );
}
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 ) return 0;
else return 1 + f_gold ( n & ( n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,58,90,69,15,54,60,51,46,91};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { if ( [MASK] == 0 ) return 0; else return 1 + f_gold ( n & ( n - 1 ) ); }#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 ) return 0;
else return 1 + f_gold ( n & ( n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,58,90,69,15,54,60,51,46,91};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) n",
"b) curr_ele",
"c) if",
"d) b)",
"e) ["
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
if ( n == 1 ) return a [ 0 ];
int max_neg = INT_MIN;
int min_pos = INT_MAX;
int count_neg = 0, count_zero = 0;
int prod = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] == 0 ) {
count_zero ++;
continue;
}
if ( a [ i ] < 0 ) {
count_neg ++;
max_neg = max ( max_neg, a [ i ] );
}
if ( a [ i ] > 0 ) min_pos = min ( min_pos, a [ i ] );
prod = prod * a [ i ];
}
if ( count_zero == n || ( count_neg == 0 && count_zero > 0 ) ) return 0;
if ( count_neg == 0 ) return min_pos;
if ( ! ( count_neg & 1 ) && count_neg != 0 ) {
prod = prod / max_neg;
}
return prod;
}
ro == n || ( count_neg == 0 && count_zero > 0 ) ) return 0;
if ( count_neg == 0 ) return min_pos;
if ( ! ( count_neg & 1 ) && count_neg != 0 ) {
prod = prod / max_neg;
}
return prod;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {23,10,25,30,3,36,18,15,20,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { if ( n == 1 ) return a [ 0 ]; int max_neg = INT_MIN; int [MASK] = INT_MAX; int count_neg = 0, count_zero = 0; int prod = 1; for ( int i = 0; i < n; i ++ ) { if ( a [ i ] == 0 ) { count_zero ++; continue; } if ( a [ i ] < 0 ) { count_neg ++; max_neg = max ( max_neg, a [ i ] ); } if ( a [ i ] > 0 ) min_pos = min ( min_pos, a [ i ] ); prod = prod * a [ i ]; } if ( count_zero == n || ( count_neg == 0 && count_zero > 0 ) ) return 0; if ( count_neg == 0 ) return min_pos; if ( ! ( count_neg & 1 ) && count_neg != 0 ) { prod = prod / max_neg; } return prod; }ro == n || ( count_neg == 0 && count_zero > 0 ) ) return 0;
if ( count_neg == 0 ) return min_pos;
if ( ! ( count_neg & 1 ) && count_neg != 0 ) {
prod = prod / max_neg;
}
return prod;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {23,10,25,30,3,36,18,15,20,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | min_pos | [
"a) len",
"b) public",
"c) the_sum",
"d) if",
"e) min_pos"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int len = str . length ( );
int num, rem = 0;
for ( int i = 0;
i < len;
i ++ ) {
num = rem * 10 + ( str [ i ] - '0' );
rem = num % 11;
}
return rem;
}
f_gold ( string str ) {
int len = str . length ( );
int num, rem = 0;
for ( int i = 0;
i < len;
i ++ ) {
num = rem * 10 + ( str [ i ] - '0' );
rem = num % 11;
}
return rem;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"DvsNZVNZ","1170","10","evsPwREbSY","09219178704","1001010","SkZbWSajDKmiG","0287976763","011011000111","lUn"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { int [MASK] = str . length ( ); int num, rem = 0; for ( int i = 0; i < len; i ++ ) { num = rem * 10 + ( str [ i ] - '0' ); rem = num % 11; } return rem; }f_gold ( string str ) {
int len = str . length ( );
int num, rem = 0;
for ( int i = 0;
i < len;
i ++ ) {
num = rem * 10 + ( str [ i ] - '0' );
rem = num % 11;
}
return rem;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"DvsNZVNZ","1170","10","evsPwREbSY","09219178704","1001010","SkZbWSajDKmiG","0287976763","011011000111","lUn"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | len | [
"a) )",
"b) int",
"c) ]",
"d) len",
"e) ])"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int num ) {
if ( num < 0 ) return f_gold ( - num );
if ( num == 0 || num == 7 ) return 1;
if ( num < 10 ) return 0;
return f_gold ( num / 10 - 2 * ( num - num / 10 * 10 ) );
}
int f_gold ( int num ) {
if ( num < 0 ) return f_gold ( - num );
if ( num == 0 || num == 7 ) return 1;
if ( num < 10 ) return 0;
return f_gold ( num / 10 - 2 * ( num - num / 10 * 10 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {0,-21,7,63,84,73,81,-10,47,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace [MASK] int f_gold ( int num ) { if ( num < 0 ) return f_gold ( - num ); if ( num == 0 || num == 7 ) return 1; if ( num < 10 ) return 0; return f_gold ( num / 10 - 2 * ( num - num / 10 * 10 ) ); }int f_gold ( int num ) {
if ( num < 0 ) return f_gold ( - num );
if ( num == 0 || num == 7 ) return 1;
if ( num < 10 ) return 0;
return f_gold ( num / 10 - 2 * ( num - num / 10 * 10 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {0,-21,7,63,84,73,81,-10,47,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | std; | [
"a) std;",
"b) return",
"c) <iostream>",
"d) *",
"e) base1"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str1, string str2 ) {
if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 );
string str = "";
int n1 = str1 . length ( ), n2 = str2 . length ( );
int diff = n2 - n1;
int carry = 0;
for ( int i = n1 - 1;
i >= 0;
i -- ) {
int sum = ( ( str1 [ i ] - '0' ) + ( str2 [ i + diff ] - '0' ) + carry );
str . push_back ( sum % 10 + '0' );
carry = sum / 10;
}
for ( int i = n2 - n1 - 1;
i >= 0;
i -- ) {
int sum = ( ( str2 [ i ] - '0' ) + carry );
str . push_back ( sum % 10 + '0' );
carry = sum / 10;
}
if ( carry ) str . push_back ( carry + '0' );
reverse ( str . begin ( ), str . end ( ) );
return str;
}
] - '0' ) + carry );
str . push_back ( sum % 10 + '0' );
carry = sum / 10;
}
if ( carry ) str . push_back ( carry + '0' );
reverse ( str . begin ( ), str . end ( ) );
return str;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"G","48578","010","KkGp","48928969618416","0101011010","X","10073867","01110000000","k "};
vector<string> param1 {"FcAiuKhw","5117561223135","00000","nSE","88497275","11","MomtbuxLRR","28","0110","aSSlhOYp"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str1, string str2 ) { if ( str1 . length ( ) > str2 . length ( ) ) swap ( str1, str2 ); string str = ""; int n1 = str1 . length ( ), n2 = str2 . length ( ); int diff = n2 - n1; int carry = 0; for ( int i = n1 - 1; i >= 0; i -- ) { int sum = ( ( str1 [ i ] - '0' ) + ( str2 [ i + diff ] - '0' ) + carry ); str . push_back ( sum % 10 + '0' ); carry = sum / 10; } for ( int i = n2 - n1 - 1; i >= 0; i -- ) { int sum = ( ( str2 [ i ] - '0' ) + carry ); str . push_back ( sum % 10 + '0' ); carry = sum / 10; } if ( carry ) str . push_back ( carry + '0' ); reverse ( str . begin ( ), str . end [MASK] ) ); return str; }] - '0' ) + carry );
str . push_back ( sum % 10 + '0' );
carry = sum / 10;
}
if ( carry ) str . push_back ( carry + '0' );
reverse ( str . begin ( ), str . end ( ) );
return str;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"G","48578","010","KkGp","48928969618416","0101011010","X","10073867","01110000000","k "};
vector<string> param1 {"FcAiuKhw","5117561223135","00000","nSE","88497275","11","MomtbuxLRR","28","0110","aSSlhOYp"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) def",
"b) return",
"c) max",
"d) (",
"e) int"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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;
}
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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {37,31,30,26,17,30,42,14,19,1};
vector<int> param2 {32,27,34,21,31,36,35,12,31,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( 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 [MASK] idx ] && i < idx ) result ++; } return result; } 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {37,31,30,26,17,30,42,14,19,1};
vector<int> param2 {32,27,34,21,31,36,35,12,31,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) /",
"b) res",
"c) [",
"d) M",
"e) f_gold"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
n --;
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n ++;
return n;
}
ip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
n --;
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n ++;
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {63,78,13,5,34,69,63,78,80,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { n --; n |= n >> 1; n |= n >> 2; n |= n >> 4; n |= n >> 8; n |= n >> 16; n ++; return [MASK] }ip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
n --;
n |= n >> 1;
n |= n >> 2;
n |= n >> 4;
n |= n >> 8;
n |= n >> 16;
n ++;
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {63,78,13,5,34,69,63,78,80,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n; | [
"a) if",
"b) b)",
"c) count",
"d) 0",
"e) n;"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str ) {
int n = str . length ( );
int dp [ n + 1 ] [ 10 ];
memset ( dp, 0, sizeof ( dp ) );
int arr [ n + 1 ];
for ( int i = 1;
i <= n;
i ++ ) arr [ i ] = str [ i - 1 ] - '0';
for ( int i = 1;
i <= n;
i ++ ) {
dp [ i ] [ arr [ i ] % 8 ] = 1;
for ( int j = 0;
j < 8;
j ++ ) {
if ( dp [ i - 1 ] [ j ] > dp [ i ] [ ( j * 10 + arr [ i ] ) % 8 ] ) dp [ i ] [ ( j * 10 + arr [ i ] ) % 8 ] = dp [ i - 1 ] [ j ];
if ( dp [ i - 1 ] [ j ] > dp [ i ] [ j ] ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ];
}
}
for ( int i = 1;
i <= n;
i ++ ) {
if ( dp [ i ] [ 0 ] == 1 ) return true;
}
return false;
}
if ( dp [ i - 1 ] [ j ] > dp [ i ] [ j ] ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ];
}
}
for ( int i = 1;
i <= n;
i ++ ) {
if ( dp [ i ] [ 0 ] == 1 ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"n jcjfyMoJEK","70507","0000111","YjRiCqr","4730248784","010101110","nLJV duUNH","27","1000","L"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str ) { int n = str . length ( ); int dp [ n + 1 ] [ 10 ]; memset ( dp, 0, sizeof ( dp ) ); int arr [ n + 1 ]; for ( int i = 1; i <= n; i ++ ) arr [ i ] = str [ i - 1 ] - '0'; for ( int i = 1; i <= n; i ++ ) { dp [ i ] [ arr [ i ] % 8 ] = 1; for ( int j = 0; j < 8; j ++ ) { if ( dp [ i - 1 ] [ j ] > dp [ i ] [ ( j * 10 + arr [ i ] ) % 8 ] ) dp [ i ] [ ( j * 10 + arr [ i ] ) % 8 ] = dp [ i - 1 ] [ j ]; if ( dp [ i - 1 ] [ j ] > dp [ i ] [ j ] ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ]; } } for ( int i = 1; i <= n; i ++ ) { if ( dp [ i ] [ 0 ] == 1 ) return true; [MASK] return false; } if ( dp [ i - 1 ] [ j ] > dp [ i ] [ j ] ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ];
}
}
for ( int i = 1;
i <= n;
i ++ ) {
if ( dp [ i ] [ 0 ] == 1 ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"n jcjfyMoJEK","70507","0000111","YjRiCqr","4730248784","010101110","nLJV duUNH","27","1000","L"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) (",
"b) <",
"c) )",
"d) -",
"e) }"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
string temp = "";
int sum = 0;
for ( char ch : str ) {
if ( isdigit ( ch ) ) temp += ch;
else {
sum += atoi ( temp . c_str ( ) );
temp = "";
}
}
return sum + atoi ( temp . c_str ( ) );
}
t sum = 0;
for ( char ch : str ) {
if ( isdigit ( ch ) ) temp += ch;
else {
sum += atoi ( temp . c_str ( ) );
temp = "";
}
}
return sum + atoi ( temp . c_str ( ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"FpuZdXbJ","8248545127035","00101111101","WuaZuohxsww","77298","101110","HiHCWcmzqGMdE","9661651","000110100111","nwuNyyVBJFWvO"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { string temp = ""; int sum = 0; for ( char ch : str ) { if ( isdigit ( ch ) [MASK] temp += ch; else { sum += atoi ( temp . c_str ( ) ); temp = ""; } } return sum + atoi ( temp . c_str ( ) ); }t sum = 0;
for ( char ch : str ) {
if ( isdigit ( ch ) ) temp += ch;
else {
sum += atoi ( temp . c_str ( ) );
temp = "";
}
}
return sum + atoi ( temp . c_str ( ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"FpuZdXbJ","8248545127035","00101111101","WuaZuohxsww","77298","101110","HiHCWcmzqGMdE","9661651","000110100111","nwuNyyVBJFWvO"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) )",
"b) f_gold",
"c) #include",
"d) [",
"e) return"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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;
}
ile ( left <= right ) {
int mid = ( left + right ) / 2;
if ( arr2 [ mid ] == arr1 [ mid ] ) left = mid + 1;
else {
index = mid;
right = mid - 1;
}
}
return index;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {11,26,31,13,29,19,5,28,14,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( 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 [MASK] == arr1 [ mid ] ) left = mid + 1; else { index = mid; right = mid - 1; } } return index; }ile ( left <= right ) {
int mid = ( left + right ) / 2;
if ( arr2 [ mid ] == arr1 [ mid ] ) left = mid + 1;
else {
index = mid;
right = mid - 1;
}
}
return index;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {11,26,31,13,29,19,5,28,14,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) ]",
"b) j",
"c) *",
"d) }",
"e) else"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int BT [ n + 1 ];
memset ( BT, 0, sizeof ( BT ) );
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 ];
}
memset ( BT, 0, sizeof ( BT ) );
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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {87,69,15,11,11,15,47,65,50,58};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int BT [ n + 1 ]; memset ( BT, 0, sizeof ( BT ) ); BT [ 0 ] = BT [ 1 ] = 1; for ( int i = 2; i <= n; ++ i ) for [MASK] int j = 0; j < i; j ++ ) BT [ i ] += BT [ j ] * BT [ i - j - 1 ]; return BT [ n ]; } memset ( BT, 0, sizeof ( BT ) );
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 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {87,69,15,11,11,15,47,65,50,58};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) b",
"b) def",
"c) (",
"d) {",
"e) true"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6;
}
e <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,58,67,60,4,97,9,16,83,87};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; [MASK] f_gold ( int n ) { return n * ( n - 1 ) * ( n - 2 ) / 6; }e <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 ) * ( n - 2 ) / 6;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,58,67,60,4,97,9,16,83,87};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) ans",
"b) void",
"c) int",
"d) const",
"e) ("
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
if ( ! ( y / x ) ) return ( ! ( y / z ) ) ? y : z;
return ( ! ( x / z ) ) ? x : z;
}
ream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
if ( ! ( y / x ) ) return ( ! ( y / z ) ) ? y : z;
return ( ! ( x / z ) ) ? x : z;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {48,11,50,21,94,22,3,67,59,50};
vector<int> param1 {63,55,89,71,39,44,41,62,2,11};
vector<int> param2 {56,84,96,74,42,86,68,94,83,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int [MASK] int y, int z ) { if ( ! ( y / x ) ) return ( ! ( y / z ) ) ? y : z; return ( ! ( x / z ) ) ? x : z; }ream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
if ( ! ( y / x ) ) return ( ! ( y / z ) ) ? y : z;
return ( ! ( x / z ) ) ? x : z;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {48,11,50,21,94,22,3,67,59,50};
vector<int> param1 {63,55,89,71,39,44,41,62,2,11};
vector<int> param2 {56,84,96,74,42,86,68,94,83,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | x, | [
"a) }",
"b) x,",
"c) n)",
"d) )",
"e) ;"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int c [ 3 ] = {
0 },
i;
int res = 0;
for ( i = 0;
i < n;
i ++ ) c [ arr [ i ] % 3 ] ++;
res += ( ( c [ 0 ] * ( c [ 0 ] - 1 ) ) >> 1 );
res += c [ 1 ] * c [ 2 ];
res += ( c [ 0 ] * ( c [ 0 ] - 1 ) * ( c [ 0 ] - 2 ) ) / 6;
res += ( c [ 1 ] * ( c [ 1 ] - 1 ) * ( c [ 1 ] - 2 ) ) / 6;
res += ( ( c [ 2 ] * ( c [ 2 ] - 1 ) * ( c [ 2 ] - 2 ) ) / 6 );
res += c [ 0 ] * c [ 1 ] * c [ 2 ];
return res;
}
6;
res += ( c [ 1 ] * ( c [ 1 ] - 1 ) * ( c [ 1 ] - 2 ) ) / 6;
res += ( ( c [ 2 ] * ( c [ 2 ] - 1 ) * ( c [ 2 ] - 2 ) ) / 6 );
res += c [ 0 ] * c [ 1 ] * c [ 2 ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,6,12,18,31,36,43,47,59,64,64,69,69,94,98,98},{94,46,64,18,70,22,-98,52,-26,34,-22,22,40,66,-72,-66,86,84,12,-38,28,-60,-10,-30,-78,76,62,74,24,-64,0,92,-20,-66,-52},{0,0,0,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},{68,96,74,38,70,70},{-88,-74,-70,-64,-64,-64,-58,-52,-18,-10,-6,4,4,28,44,48,52,54,64,72,76,94},{0,1,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,0,1,0,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,0,0,0,1,0,0,1},{9,12,14,21,27,28,45,50,54,57,58,62,78,82,91,92,95},{16,-46,-32,-36,-84,-14,-18,16,54,90,-4},{0,0,1,1},{53,32,54,84,79,37,44,30,92,53,89,95}};
vector<int> param1 {12,23,29,5,18,36,9,8,3,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int c [ 3 ] = { 0 }, i; int res = 0; for ( i = 0; i < n; i ++ ) c [ arr [ i ] % 3 ] ++; res += [MASK] ( c [ 0 ] * ( c [ 0 ] - 1 ) ) >> 1 ); res += c [ 1 ] * c [ 2 ]; res += ( c [ 0 ] * ( c [ 0 ] - 1 ) * ( c [ 0 ] - 2 ) ) / 6; res += ( c [ 1 ] * ( c [ 1 ] - 1 ) * ( c [ 1 ] - 2 ) ) / 6; res += ( ( c [ 2 ] * ( c [ 2 ] - 1 ) * ( c [ 2 ] - 2 ) ) / 6 ); res += c [ 0 ] * c [ 1 ] * c [ 2 ]; return res; }6;
res += ( c [ 1 ] * ( c [ 1 ] - 1 ) * ( c [ 1 ] - 2 ) ) / 6;
res += ( ( c [ 2 ] * ( c [ 2 ] - 1 ) * ( c [ 2 ] - 2 ) ) / 6 );
res += c [ 0 ] * c [ 1 ] * c [ 2 ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,6,12,18,31,36,43,47,59,64,64,69,69,94,98,98},{94,46,64,18,70,22,-98,52,-26,34,-22,22,40,66,-72,-66,86,84,12,-38,28,-60,-10,-30,-78,76,62,74,24,-64,0,92,-20,-66,-52},{0,0,0,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},{68,96,74,38,70,70},{-88,-74,-70,-64,-64,-64,-58,-52,-18,-10,-6,4,4,28,44,48,52,54,64,72,76,94},{0,1,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,0,1,0,0,0,1,1,0,1,1,0,1,1,0,0,1,1,0,0,0,0,1,0,0,1},{9,12,14,21,27,28,45,50,54,57,58,62,78,82,91,92,95},{16,-46,-32,-36,-84,-14,-18,16,54,90,-4},{0,0,1,1},{53,32,54,84,79,37,44,30,92,53,89,95}};
vector<int> param1 {12,23,29,5,18,36,9,8,3,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) (",
"b) [",
"c) using",
"d) for",
"e) import"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int A [ ], int N, int M ) {
int ans = 0;
int h [ M ] = {
0 };
for ( int i = 0;
i < N;
i ++ ) {
A [ i ] = A [ i ] % M;
h [ A [ i ] ] ++;
}
for ( int i = 0;
i < M;
i ++ ) {
for ( int j = i;
j < M;
j ++ ) {
int rem = ( M - ( i + j ) % M ) % M;
if ( rem < j ) continue;
if ( i == j && rem == j ) ans += h [ i ] * ( h [ i ] - 1 ) * ( h [ i ] - 2 ) / 6;
else if ( i == j ) ans += h [ i ] * ( h [ i ] - 1 ) * h [ rem ] / 2;
else if ( i == rem ) ans += h [ i ] * ( h [ i ] - 1 ) * h [ j ] / 2;
else if ( rem == j ) ans += h [ j ] * ( h [ j ] - 1 ) * h [ i ] / 2;
else ans = ans + h [ i ] * h [ j ] * h [ rem ];
}
}
return ans;
}
[ i ] - 1 ) * h [ j ] / 2;
else if ( rem == j ) ans += h [ j ] * ( h [ j ] - 1 ) * h [ i ] / 2;
else ans = ans + h [ i ] * h [ j ] * h [ rem ];
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,13,16,19,20,21,25,28,31,36,38,42,44,50,54,55,56,63,63,63,65,65,65,67,71,73,73,76,78,87,90,91,99},{28,-8,-86,-6,-28,74,82,88,-62,-24,-14,68,36,-54,-16,-52,-78,-24,68,-2,30,-56,30,-86,-54,54,62,-30,-82,66,94,12,10,4,40,-72,20,-2,-90,-90},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{45,14,91,37,91},{-88,-78,-74,-50,-44,-34,-26,-22,14,46,48,80,82,86,88},{1,1,0,0,0,0,1,0,0,0,0,0,1,0,1,1,1,1,0,1,1},{9,14,16,18,23,36,37,58,78},{-56,86,58,-58,46,-62,8,-22,80,96,-74,-94,-94,-2,-4},{0,0,0,0,0,0,0,0,0,0,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},{62,36,66,84,20,43,93,47,85,70,50,96,3,8,38,96,15,31,97,90,1,69,77,20,68,11,2,92,50,8,23,83,76,6,32,43,92}};
vector<int> param1 {27,29,29,3,13,11,7,13,37,18};
vector<int> param2 {21,21,43,4,12,15,4,14,34,35};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int A [ ], int N, int M ) { int ans = 0; int h [ M ] = { 0 }; for ( int i = 0; i < N; i ++ ) { A [ i ] = A [ i ] % M; h [ A [ i ] ] ++; } for ( int i = 0; i < M; i ++ ) { for ( int j = i; j < M; j ++ ) { int rem = ( M - ( i + j ) % M ) % M; if ( rem < j ) continue; if ( i == j && rem == j ) ans += h [ i ] * ( h [ i ] - 1 ) * ( h [ i ] - 2 ) / 6; else if ( i == j ) ans += h [ i ] * ( h [ i ] - 1 ) * h [ rem ] / 2; else if ( i == rem ) ans += h [ i ] * ( h [ i ] - 1 ) * h [ j ] / 2; else if ( rem == j ) ans += h [ j ] * ( h [ j ] - 1 ) * h [ i ] [MASK] 2; else ans = ans + h [ i ] * h [ j ] * h [ rem ]; } } return ans; } [ i ] - 1 ) * h [ j ] / 2;
else if ( rem == j ) ans += h [ j ] * ( h [ j ] - 1 ) * h [ i ] / 2;
else ans = ans + h [ i ] * h [ j ] * h [ rem ];
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,13,16,19,20,21,25,28,31,36,38,42,44,50,54,55,56,63,63,63,65,65,65,67,71,73,73,76,78,87,90,91,99},{28,-8,-86,-6,-28,74,82,88,-62,-24,-14,68,36,-54,-16,-52,-78,-24,68,-2,30,-56,30,-86,-54,54,62,-30,-82,66,94,12,10,4,40,-72,20,-2,-90,-90},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{45,14,91,37,91},{-88,-78,-74,-50,-44,-34,-26,-22,14,46,48,80,82,86,88},{1,1,0,0,0,0,1,0,0,0,0,0,1,0,1,1,1,1,0,1,1},{9,14,16,18,23,36,37,58,78},{-56,86,58,-58,46,-62,8,-22,80,96,-74,-94,-94,-2,-4},{0,0,0,0,0,0,0,0,0,0,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},{62,36,66,84,20,43,93,47,85,70,50,96,3,8,38,96,15,31,97,90,1,69,77,20,68,11,2,92,50,8,23,83,76,6,32,43,92}};
vector<int> param1 {27,29,29,3,13,11,7,13,37,18};
vector<int> param2 {21,21,43,4,12,15,4,14,34,35};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | / | [
"a) using",
"b) <",
"c) *",
"d) i",
"e) /"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( 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 ) swap ( arr [ i ], arr [ i + 1 ] );
else return false;
}
}
return true;
}
0;
i < n - 1;
i ++ ) {
if ( arr [ i ] > arr [ i + 1 ] ) {
if ( arr [ i ] - arr [ i + 1 ] == 1 ) swap ( arr [ i ], arr [ i + 1 ] );
else return false;
}
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{1,0,0,0,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}};
vector<int> param1 {15,18,31,13,10,4,9,8,2,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int arr [ ], int n ) { for ( int i = 0; i < n [MASK] 1; i ++ ) { if ( arr [ i ] > arr [ i + 1 ] ) { if ( arr [ i ] - arr [ i + 1 ] == 1 ) swap ( arr [ i ], arr [ i + 1 ] ); else return false; } } return true; }0;
i < n - 1;
i ++ ) {
if ( arr [ i ] > arr [ i + 1 ] ) {
if ( arr [ i ] - arr [ i + 1 ] == 1 ) swap ( arr [ i ], arr [ i + 1 ] );
else return false;
}
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{1,0,0,0,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}};
vector<int> param1 {15,18,31,13,10,4,9,8,2,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | - | [
"a) int",
"b) import",
"c) true;",
"d) ]",
"e) -"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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 );
}
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 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{69},{-34,-38,-72,90,-84,-40,-40,-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,19,20,21,24,27,37,47,50,54,55,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,-60,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,28,40,67,37,13,63,38,27,14,7,68}};
vector<int> param1 {0,6,13,21,30,12,12,37,3,23};
vector<int> param2 {0,6,19,20,32,9,13,26,4,24};
vector<int> param3 {0,9,11,13,28,10,21,42,2,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int key, int capacity ) { if ( n >= capacity ) return n; int i; for [MASK] i = n - 1; ( i >= 0 && arr [ i ] > key ); i -- ) arr [ i + 1 ] = arr [ i ]; arr [ i + 1 ] = key; return ( n + 1 ); }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 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{69},{-34,-38,-72,90,-84,-40,-40,-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,19,20,21,24,27,37,47,50,54,55,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,-60,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,28,40,67,37,13,63,38,27,14,7,68}};
vector<int> param1 {0,6,13,21,30,12,12,37,3,23};
vector<int> param2 {0,6,19,20,32,9,13,26,4,24};
vector<int> param3 {0,9,11,13,28,10,21,42,2,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) std;",
"b) def",
"c) int",
"d) (",
"e) ["
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
int c = 0;
while ( x && y && z ) {
x --;
y --;
z --;
c ++;
}
return c;
}
nclude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
int c = 0;
while ( x && y && z ) {
x --;
y --;
z --;
c ++;
}
return c;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,87,35,25,93,52,95,91,75,96};
vector<int> param1 {98,55,90,9,22,42,88,64,1,44};
vector<int> param2 {25,94,29,41,39,96,26,51,6,76};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x, int y, int z ) { int c = 0; while ( x && y && z ) { x --; y --; z --; c ++; } return [MASK] }nclude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y, int z ) {
int c = 0;
while ( x && y && z ) {
x --;
y --;
z --;
c ++;
}
return c;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,87,35,25,93,52,95,91,75,96};
vector<int> param1 {98,55,90,9,22,42,88,64,1,44};
vector<int> param2 {25,94,29,41,39,96,26,51,6,76};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | c; | [
"a) c;",
"b) (",
"c) )",
"d) (",
"e) int"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int min_xor = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) min_xor = min ( min_xor, arr [ i ] ^ arr [ j ] );
return min_xor;
}
( int arr [ ], int n ) {
int min_xor = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) min_xor = min ( min_xor, arr [ i ] ^ arr [ j ] );
return min_xor;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{-68,-58,52,88,90,66,-66,-84,-70,-64,56,42,94,-10,0,80,8,28,-94,36,90,56,56,80,-94,50,90,-28,-22,-2,-96,74,-16,-14},{0,0,0,0,0,0,1,1,1,1,1,1},{57,63,11,73,60,73,25,65,39,48,31,17,23,94,10,97,42,45,83,75,97,96},{-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},{1,1,1,0,0,0,1,0,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},{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},{-14,20,36,12,-54,-50,92,-28,44,-46,6,96,82,70,-20,24,-96,-14,46,-28,-46,-28,22,-82,36,-94,-48,-92,96,74,14},{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},{50,48,94,64,60,48,79,75,77,62,33,42,22,78,32,99,27,23,76,51,34,54,70,12,19,17,13,82,96,70,4,12,5,11,23,23,18,93,38,69}};
vector<int> param1 {34,17,9,21,18,36,36,20,39,30};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> [MASK] namespace std; int f_gold ( int arr [ ], int n ) { int min_xor = INT_MAX; for ( int i = 0; i < n; i ++ ) for ( int j = i + 1; j < n; j ++ ) min_xor = min ( min_xor, arr [ i ] ^ arr [ j ] ); return min_xor; } ( int arr [ ], int n ) {
int min_xor = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) min_xor = min ( min_xor, arr [ i ] ^ arr [ j ] );
return min_xor;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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},{-68,-58,52,88,90,66,-66,-84,-70,-64,56,42,94,-10,0,80,8,28,-94,36,90,56,56,80,-94,50,90,-28,-22,-2,-96,74,-16,-14},{0,0,0,0,0,0,1,1,1,1,1,1},{57,63,11,73,60,73,25,65,39,48,31,17,23,94,10,97,42,45,83,75,97,96},{-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},{1,1,1,0,0,0,1,0,1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,0,1,1,1,1,1,0,0},{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},{-14,20,36,12,-54,-50,92,-28,44,-46,6,96,82,70,-20,24,-96,-14,46,-28,-46,-28,22,-82,36,-94,-48,-92,96,74,14},{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},{50,48,94,64,60,48,79,75,77,62,33,42,22,78,32,99,27,23,76,51,34,54,70,12,19,17,13,82,96,70,4,12,5,11,23,23,18,93,38,69}};
vector<int> param1 {34,17,9,21,18,36,36,20,39,30};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | using | [
"a) int",
"b) int",
"c) ,",
"d) using",
"e) ]"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int n ) {
return ( 0.666 ) * ( 1 - 1 / pow ( 10, n ) );
}
>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int n ) {
return ( 0.666 ) * ( 1 - 1 / pow ( 10, n ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,2,3,4,5,74,77,67,9,12};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; float f_gold ( int n ) { return ( 0.666 ) * [MASK] 1 - 1 / pow ( 10, n ) ); }>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int n ) {
return ( 0.666 ) * ( 1 - 1 / pow ( 10, n ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,2,3,4,5,74,77,67,9,12};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) return",
"b) cmpfunc);}",
"c) str2",
"d) /",
"e) ("
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int result = 0;
set < int > Hash;
for ( int i = 0;
i < n;
i ++ ) Hash . insert ( 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 . find ( product ) != Hash . end ( ) ) result ++;
}
}
return result;
}
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) {
int product = arr [ i ] * arr [ j ];
if ( Hash . find ( product ) != Hash . end ( ) ) result ++;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,0,9,8,22,42,35,3,12,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include [MASK] #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int result = 0; set < int > Hash; for ( int i = 0; i < n; i ++ ) Hash . insert ( 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 . find ( product ) != Hash . end ( ) ) result ++; } } return result; } i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) {
int product = arr [ i ] * arr [ j ];
if ( Hash . find ( product ) != Hash . end ( ) ) result ++;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,0,9,8,22,42,35,3,12,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <fstream> | [
"a) <fstream>",
"b) for",
"c) :",
"d) ++",
"e) str"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
x = x % 10;
if ( y != 0 ) y = y % 4 + 4;
return ( ( ( int ) ( pow ( x, y ) ) ) % 10 );
}
tream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
x = x % 10;
if ( y != 0 ) y = y % 4 + 4;
return ( ( ( int ) ( pow ( x, y ) ) ) % 10 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,70,26,9,82,95,43,7,19,49};
vector<int> param1 {17,52,23,96,71,36,40,27,56,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include [MASK] #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x, int y ) { x = x % 10; if ( y != 0 ) y = y % 4 + 4; return ( ( ( int ) ( pow ( x, y ) ) ) % 10 ); }tream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
x = x % 10;
if ( y != 0 ) y = y % 4 + 4;
return ( ( ( int ) ( pow ( x, y ) ) ) % 10 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,70,26,9,82,95,43,7,19,49};
vector<int> param1 {17,52,23,96,71,36,40,27,56,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <fstream> | [
"a) <fstream>",
"b) import",
"c) )",
"d) arr",
"e) ;"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int low, int high ) {
int max = arr [ low ];
int i;
for ( i = low + 1;
i <= high;
i ++ ) {
if ( arr [ i ] > max ) max = arr [ i ];
else break;
}
return max;
}
( int arr [ ], int low, int high ) {
int max = arr [ low ];
int i;
for ( i = low + 1;
i <= high;
i ++ ) {
if ( arr [ i ] > max ) max = arr [ i ];
else break;
}
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {15,1,23,8,31,2,20,3,19,28};
vector<int> param2 {21,1,15,13,34,2,31,5,18,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high [MASK] { int max = arr [ low ]; int i; for ( i = low + 1; i <= high; i ++ ) { if ( arr [ i ] > max ) max = arr [ i ]; else break; } return max; } ( int arr [ ], int low, int high ) {
int max = arr [ low ];
int i;
for ( i = low + 1;
i <= high;
i ++ ) {
if ( arr [ i ] > max ) max = arr [ i ];
else break;
}
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {15,1,23,8,31,2,20,3,19,28};
vector<int> param2 {21,1,15,13,34,2,31,5,18,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) (",
"b) if",
"c) (int",
"d) ++",
"e) )"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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;
}
namespace std;
int f_gold ( 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {12,3,0,0,11,9,15,5,15,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int ans = 0; for ( int i = 0; i < n; i ++ ) for ( int j = i [MASK] 1; j < n; j ++ ) if ( arr [ i ] == arr [ j ] ) ans ++; return ans; } namespace std;
int f_gold ( 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {12,3,0,0,11,9,15,5,15,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | + | [
"a) =",
"b) f_gold",
"c) java.util.",
"d) +",
"e) f_gold"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int table [ n + 1 ];
memset ( table, 0, sizeof ( table ) );
table [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) table [ j ] += table [ j - i ];
return table [ n ];
}
+ 1 ];
memset ( table, 0, sizeof ( table ) );
table [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) table [ j ] += table [ j - i ];
return table [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,90,8,77,44,20,34,22,50,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int table [ n + 1 ]; memset ( table, 0, sizeof ( table ) ); table [ 0 ] = 1; for ( int i = 1; i < n; i ++ ) for ( int j = i; j <= n; j ++ ) table [MASK] j ] += table [ j - i ]; return table [ n ]; } + 1 ];
memset ( table, 0, sizeof ( table ) );
table [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) table [ j ] += table [ j - i ];
return table [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,90,8,77,44,20,34,22,50,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) <",
"b) ]",
"c) (",
"d) [",
"e) long"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
int i, total = 1;
for ( i = 2;
i <= ( n + 1 );
i ++ ) {
total += i;
total -= a [ i - 2 ];
}
return total;
}
its/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
int i, total = 1;
for ( i = 2;
i <= ( n + 1 );
i ++ ) {
total += i;
total -= a [ i - 2 ];
}
return total;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {6,38,15,22,18,25,24,12,29,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { int i, total = 1; for ( i = 2; i <= ( n + 1 ); i [MASK] ) { total += i; total -= a [ i - 2 ]; } return total; }its/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
int i, total = 1;
for ( i = 2;
i <= ( n + 1 );
i ++ ) {
total += i;
total -= a [ i - 2 ];
}
return total;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {6,38,15,22,18,25,24,12,29,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ++ | [
"a) )",
"b) n",
"c) --",
"d) sizeof(int),",
"e) ++"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
int cur = ( k * ( k - 1 ) ) + 1;
int sum = 0;
while ( k -- ) {
sum += cur;
cur += 2;
}
return sum;
}
iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
int cur = ( k * ( k - 1 ) ) + 1;
int sum = 0;
while ( k -- ) {
sum += cur;
cur += 2;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {91,52,78,51,65,39,42,12,56,98};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int k ) { int cur = ( k * ( k - 1 ) ) + 1; int sum = 0; while ( k -- ) { sum += cur; cur += 2; } return sum; }iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k ) {
int cur = ( k * ( k - 1 ) ) + 1;
int sum = 0;
while ( k -- ) {
sum += cur;
cur += 2;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {91,52,78,51,65,39,42,12,56,98};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <string> | [
"a) j",
"b) import",
"c) <string>",
"d) for",
"e) ["
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
if ( k <= 0 ) return n;
return ( n & ~ ( 1 << ( k - 1 ) ) );
}
nclude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
if ( k <= 0 ) return n;
return ( n & ~ ( 1 << ( k - 1 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {49,59,76,27,61,67,63,85,90,24};
vector<int> param1 {15,69,20,76,60,27,71,25,64,55};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int k ) [MASK] if ( k <= 0 ) return n; return ( n & ~ ( 1 << ( k - 1 ) ) ); }nclude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
if ( k <= 0 ) return n;
return ( n & ~ ( 1 << ( k - 1 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {49,59,76,27,61,67,63,85,90,24};
vector<int> param1 {15,69,20,76,60,27,71,25,64,55};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) ;",
"b) sizeof",
"c) {",
"d) )",
"e) ["
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum [ n ];
if ( n >= 1 ) sum [ 0 ] = arr [ 0 ];
if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ];
if ( n > 2 ) sum [ 2 ] = max ( sum [ 1 ], max ( arr [ 1 ] + arr [ 2 ], arr [ 0 ] + arr [ 2 ] ) );
for ( int i = 3;
i < n;
i ++ ) sum [ i ] = max ( max ( sum [ i - 1 ], sum [ i - 2 ] + arr [ i ] ), arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] );
return sum [ n - 1 ];
}
0 ] + arr [ 2 ] ) );
for ( int i = 3;
i < n;
i ++ ) sum [ i ] = max ( max ( sum [ i - 1 ], sum [ i - 2 ] + arr [ i ] ), arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] );
return sum [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {35,7,7,12,9,16,31,22,7,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int sum [ n ]; if ( n >= 1 ) sum [ 0 ] = arr [ 0 ]; if ( n >= 2 ) sum [ 1 ] = arr [ 0 ] + arr [ 1 ]; if ( n > 2 ) sum [ 2 ] = max ( sum [ 1 ], max ( arr [ 1 ] + arr [ 2 ], arr [ 0 ] + arr [ 2 ] ) ); for ( int i = 3; i < n; i ++ ) sum [ i ] = max ( max ( sum [ i - 1 ], sum [ i - 2 ] + arr [ i ] ), arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] ); return sum [ n - 1 ]; }0 ] + arr [ 2 ] ) );
for ( int i = 3;
i < n;
i ++ ) sum [ i ] = max ( max ( sum [ i - 1 ], sum [ i - 2 ] + arr [ i ] ), arr [ i ] + arr [ i - 1 ] + sum [ i - 3 ] );
return sum [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {35,7,7,12,9,16,31,22,7,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <cstdlib> | [
"a) curr_rem",
"b) [",
"c) ==",
"d) m",
"e) <cstdlib>"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int dep [ ], int n ) {
sort ( arr, arr + n );
sort ( dep, dep + n );
int plat_needed = 1, result = 1;
int i = 1, j = 0;
while ( i < n && j < n ) {
if ( arr [ i ] <= dep [ j ] ) {
plat_needed ++;
i ++;
if ( plat_needed > result ) result = plat_needed;
}
else {
plat_needed --;
j ++;
}
}
return result;
}
arr [ i ] <= dep [ j ] ) {
plat_needed ++;
i ++;
if ( plat_needed > result ) result = plat_needed;
}
else {
plat_needed --;
j ++;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {6,18,6,8,3,17,6,20,22,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int dep [ ], int n ) { sort [MASK] arr, arr + n ); sort ( dep, dep + n ); int plat_needed = 1, result = 1; int i = 1, j = 0; while ( i < n && j < n ) { if ( arr [ i ] <= dep [ j ] ) { plat_needed ++; i ++; if ( plat_needed > result ) result = plat_needed; } else { plat_needed --; j ++; } } return result; }arr [ i ] <= dep [ j ] ) {
plat_needed ++;
i ++;
if ( plat_needed > result ) result = plat_needed;
}
else {
plat_needed --;
j ++;
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {6,18,6,8,3,17,6,20,22,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) );",
"b) (",
"c) ]",
"d) cmpfunc",
"e) //"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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 = max ( maxvalue, i * j * k );
}
}
return maxvalue;
}
for ( int i = 1;
i <= s - 2;
i ++ ) {
for ( int j = 1;
j <= s - 1;
j ++ ) {
int k = s - i - j;
maxvalue = max ( maxvalue, i * j * k );
}
}
return maxvalue;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,48,59,22,14,66,1,75,58,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( 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 = [MASK] ( maxvalue, i * j * k ); } } return maxvalue; }
for ( int i = 1;
i <= s - 2;
i ++ ) {
for ( int j = 1;
j <= s - 1;
j ++ ) {
int k = s - i - j;
maxvalue = max ( maxvalue, i * j * k );
}
}
return maxvalue;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,48,59,22,14,66,1,75,58,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | max | [
"a) );}",
"b) =",
"c) 1",
"d) max",
"e) )"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( 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;
}
urn 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,14,8,2,19,12,31,22,3,19};
vector<int> param2 {29,9,4,3,19,17,24,16,5,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using [MASK] std; int f_gold ( 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; }urn 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {17,14,8,2,19,12,31,22,3,19};
vector<int> param2 {29,9,4,3,19,17,24,16,5,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | namespace | [
"a) namespace",
"b) )",
"c) *;",
"d) =",
"e) )"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int p [ ], int n ) {
int m [ n ] [ n ];
int i, j, k, L, q;
for ( i = 1;
i < n;
i ++ ) m [ i ] [ i ] = 0;
for ( L = 2;
L < n;
L ++ ) {
for ( i = 1;
i < n - L + 1;
i ++ ) {
j = i + L - 1;
m [ i ] [ j ] = INT_MAX;
for ( k = i;
k <= j - 1;
k ++ ) {
q = m [ i ] [ k ] + m [ k + 1 ] [ j ] + p [ i - 1 ] * p [ k ] * p [ j ];
if ( q < m [ i ] [ j ] ) m [ i ] [ j ] = q;
}
}
}
return m [ 1 ] [ n - 1 ];
}
k ++ ) {
q = m [ i ] [ k ] + m [ k + 1 ] [ j ] + p [ i - 1 ] * p [ k ] * p [ j ];
if ( q < m [ i ] [ j ] ) m [ i ] [ j ] = q;
}
}
}
return m [ 1 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,11,17,26,33,37,51,62,70,71,73,74,74,81,82,83,90,95,98,98},{-50,74,-8,2,-24,28,-86,34,-36,92,-70,-98},{0,0,0,1,1,1,1},{4,73,3,88,79,40,25,58,39,53,32,20,95,60,60,98,23,95,42,26,95,14,43,97,30,83,29,37,74,72,37,31,32,83,57,40,56,95,8,79,67,62},{-92,-88,-88,-88,-86,-84,-80,-78,-76,-74,-72,-68,-68,-66,-62,-42,-34,-30,-28,-24,-20,-14,-12,-10,-8,-8,-8,6,10,26,26,36,38,42,46,48,48,54,54,58,60,66,70,76,78,80,82,98},{1,1,0,1,0,0,1},{8,25,38,39,41,57,71,89},{76,-28,20,62,-44,8,-46,52,26,76,22,38,-36,10,2,-86,42,-62,-68,-56,10},{0,0,0,0,1,1,1},{98,96,76,76,8,4,53,34,54,10,98,46,58,7,36,72,32,59,52,99,40,52,50,43,26,93,76,90,12,82,31,50,55,34,61,78}};
vector<int> param1 {20,10,3,41,47,4,6,18,5,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int p [ ], int n ) { int m [ n ] [ n ]; int i, j, k, L, q; for ( i = 1; i < n; i ++ ) m [ i ] [ i ] = 0; for ( L = 2; L < n; L ++ ) { for ( i = 1; i < n - L + 1; i ++ ) { j = i + L - 1; m [ i ] [ j ] = INT_MAX; for ( k = i; k <= j - 1; [MASK] ++ ) { q = m [ i ] [ k ] + m [ k + 1 ] [ j ] + p [ i - 1 ] * p [ k ] * p [ j ]; if ( q < m [ i ] [ j ] ) m [ i ] [ j ] = q; } } } return m [ 1 ] [ n - 1 ]; }
k ++ ) {
q = m [ i ] [ k ] + m [ k + 1 ] [ j ] + p [ i - 1 ] * p [ k ] * p [ j ];
if ( q < m [ i ] [ j ] ) m [ i ] [ j ] = q;
}
}
}
return m [ 1 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,11,17,26,33,37,51,62,70,71,73,74,74,81,82,83,90,95,98,98},{-50,74,-8,2,-24,28,-86,34,-36,92,-70,-98},{0,0,0,1,1,1,1},{4,73,3,88,79,40,25,58,39,53,32,20,95,60,60,98,23,95,42,26,95,14,43,97,30,83,29,37,74,72,37,31,32,83,57,40,56,95,8,79,67,62},{-92,-88,-88,-88,-86,-84,-80,-78,-76,-74,-72,-68,-68,-66,-62,-42,-34,-30,-28,-24,-20,-14,-12,-10,-8,-8,-8,6,10,26,26,36,38,42,46,48,48,54,54,58,60,66,70,76,78,80,82,98},{1,1,0,1,0,0,1},{8,25,38,39,41,57,71,89},{76,-28,20,62,-44,8,-46,52,26,76,22,38,-36,10,2,-86,42,-62,-68,-56,10},{0,0,0,0,1,1,1},{98,96,76,76,8,4,53,34,54,10,98,46,58,7,36,72,32,59,52,99,40,52,50,43,26,93,76,90,12,82,31,50,55,34,61,78}};
vector<int> param1 {20,10,3,41,47,4,6,18,5,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | k | [
"a) arr",
"b) k",
"c) (",
"d) -",
"e) ]"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( 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;
}
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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,56,16,42,55,64,68,88,64,42};
vector<int> param1 {71,17,16,60,56,59,24,2,94,79};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( int n, int k ) { string res = ""; for ( int i = 0; i < k; i ++ ) res = res + ( [MASK] ) ( '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; }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;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,56,16,42,55,64,68,88,64,42};
vector<int> param1 {71,17,16,60,56,59,24,2,94,79};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | char | [
"a) char",
"b) A",
"c) (",
"d) import",
"e) javafx.util.Pair;"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int mls [ 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 ( 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;
}
++ ) if ( 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {12,15,29,13,19,3,34,1,38,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int mls [ n ], max = 0; for ( int i = 0; i < n; i ++ ) mls [ i ] = 1; for ( int i = 1; i < n; i ++ ) for [MASK] int j = 0; j < i; j ++ ) if ( 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; } ++ ) if ( 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;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {12,15,29,13,19,3,34,1,38,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) n",
"b) pow",
"c) (",
"d) [",
"e) int"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int fw [ n ], bw [ n ];
int cur_max = arr [ 0 ], max_so_far = arr [ 0 ];
fw [ 0 ] = arr [ 0 ];
for ( int i = 1;
i < n;
i ++ ) {
cur_max = max ( arr [ i ], cur_max + arr [ i ] );
max_so_far = 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 = max ( arr [ i ], cur_max + arr [ i ] );
max_so_far = max ( max_so_far, cur_max );
bw [ i ] = cur_max;
}
int fans = max_so_far;
for ( int i = 1;
i < n - 1;
i ++ ) fans = max ( fans, fw [ i - 1 ] + bw [ i + 1 ] );
return fans;
}
_far = max ( max_so_far, cur_max );
bw [ i ] = cur_max;
}
int fans = max_so_far;
for ( int i = 1;
i < n - 1;
i ++ ) fans = max ( fans, fw [ i - 1 ] + bw [ i + 1 ] );
return fans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {13,22,6,11,32,8,34,25,9,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int fw [ n ], bw [ n ]; int cur_max = arr [ 0 ], max_so_far = arr [ 0 ]; fw [ 0 ] = arr [ 0 ]; for ( int i = 1; i < n; i ++ ) { cur_max = max ( arr [ i ], cur_max + arr [ i ] ); max_so_far = 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 = max ( arr [ i ], cur_max + arr [ i ] ); max_so_far [MASK] max ( max_so_far, cur_max ); bw [ i ] = cur_max; } int fans = max_so_far; for ( int i = 1; i < n - 1; i ++ ) fans = max ( fans, fw [ i - 1 ] + bw [ i + 1 ] ); return fans; }_far = max ( max_so_far, cur_max );
bw [ i ] = cur_max;
}
int fans = max_so_far;
for ( int i = 1;
i < n - 1;
i ++ ) fans = max ( fans, fw [ i - 1 ] + bw [ i + 1 ] );
return fans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {13,22,6,11,32,8,34,25,9,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) {",
"b) return",
"c) #include",
"d) =",
"e) if"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr1 [ i ] != arr2 [ i ] ) return i;
return n;
}
manip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr1 [ i ] != arr2 [ i ] ) return i;
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {36,16,0,3,14,22,26,17,24,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr1 [ ], [MASK] arr2 [ ], int n ) { for ( int i = 0; i < n; i ++ ) if ( arr1 [ i ] != arr2 [ i ] ) return i; return n; }manip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr1 [ i ] != arr2 [ i ] ) return i;
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {36,16,0,3,14,22,26,17,24,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) i",
"b) i",
"c) {",
"d) l",
"e) int"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int A [ ], int B [ ], int n ) {
unordered_set < int > mp;
int result = 0;
int curr_sum = 0, curr_begin = 0;
for ( int i = 0;
i < n;
++ i ) {
while ( mp . find ( A [ i ] ) != mp . end ( ) ) {
mp . erase ( A [ curr_begin ] );
curr_sum -= B [ curr_begin ];
curr_begin ++;
}
mp . insert ( A [ i ] );
curr_sum += B [ i ];
result = max ( result, curr_sum );
}
return result;
}
[ curr_begin ] );
curr_sum -= B [ curr_begin ];
curr_begin ++;
}
mp . insert ( A [ i ] );
curr_sum += B [ i ];
result = max ( result, curr_sum );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {20,30,2,20,4,22,22,17,39,34};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int A [ ], int B [ ], int n ) { unordered_set < int > mp; int result = 0; int curr_sum = 0, curr_begin = 0; for ( int i = 0; i < n; ++ i ) { while ( mp . find ( A [ i ] ) != mp . end ( ) ) { mp . erase ( A [ curr_begin ] ); curr_sum -= B [ curr_begin ]; curr_begin ++; } mp . insert ( A [ i [MASK] ); curr_sum += B [ i ]; result = max ( result, curr_sum ); } return result; }[ curr_begin ] );
curr_sum -= B [ curr_begin ];
curr_begin ++;
}
mp . insert ( A [ i ] );
curr_sum += B [ i ];
result = max ( result, curr_sum );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<int> param2 {20,30,2,20,4,22,22,17,39,34};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) ]",
"b) #include",
"c) int",
"d) s",
"e) ("
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int ar [ ], int n ) {
if ( n <= 4 ) return * min_element ( ar, ar + n );
int sum [ 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 ] + ( * min_element ( sum + i - 4, sum + i ) );
return * min_element ( sum + n - 4, sum + n );
}
[ 2 ] = ar [ 2 ];
sum [ 3 ] = ar [ 3 ];
for ( int i = 4;
i < n;
i ++ ) sum [ i ] = ar [ i ] + ( * min_element ( sum + i - 4, sum + i ) );
return * min_element ( sum + n - 4, sum + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {19,5,43,15,16,7,16,26,7,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int ar [ ], int n ) { if ( n <= 4 ) return * min_element ( ar, ar + n ); int sum [ n ]; sum [ 0 ] = ar [ 0 ]; sum [ 1 ] = ar [ 1 ]; sum [ 2 ] = ar [ 2 ]; sum [ 3 ] = ar [ 3 ]; for ( int i = 4; i < n; i ++ [MASK] sum [ i ] = ar [ i ] + ( * min_element ( sum + i - 4, sum + i ) ); return * min_element ( sum + n - 4, sum + n ); }[ 2 ] = ar [ 2 ];
sum [ 3 ] = ar [ 3 ];
for ( int i = 4;
i < n;
i ++ ) sum [ i ] = ar [ i ] + ( * min_element ( sum + i - 4, sum + i ) );
return * min_element ( sum + n - 4, sum + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<int> param1 {19,5,43,15,16,7,16,26,7,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) )",
"b) %",
"c) int",
"d) true;",
"e) ("
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( char str [ ], int k ) {
int n = strlen ( str );
int c = 0;
for ( int i = 0;
i < k;
i ++ ) if ( str [ n - i - 1 ] == '0' ) c ++;
return ( c == k );
}
using namespace std;
bool f_gold ( char str [ ], int k ) {
int n = strlen ( str );
int c = 0;
for ( int i = 0;
i < k;
i ++ ) if ( str [ n - i - 1 ] == '0' ) c ++;
return ( c == k );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"111010100","111010100","111010100","111010000","111010000","10110001","tPPdXrYQSI","58211787","011","IkSMGqgzOrteVO"};
vector<int> param1 {2,2,4,3,4,1,61,73,88,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include [MASK] using namespace std; bool f_gold ( char str [ ], int k ) { int n = strlen ( str ); int c = 0; for ( int i = 0; i < k; i ++ ) if ( str [ n - i - 1 ] == '0' ) c ++; return ( c == k ); }
using namespace std;
bool f_gold ( char str [ ], int k ) {
int n = strlen ( str );
int c = 0;
for ( int i = 0;
i < k;
i ++ ) if ( str [ n - i - 1 ] == '0' ) c ++;
return ( c == k );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"111010100","111010100","111010100","111010000","111010000","10110001","tPPdXrYQSI","58211787","011","IkSMGqgzOrteVO"};
vector<int> param1 {2,2,4,3,4,1,61,73,88,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <bits/stdc++.h> | [
"a) ==",
"b) using",
"c) >",
"d) (int",
"e) <bits/stdc++.h>"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str ) {
string mx = "";
for ( int i = 0;
i < str . length ( );
++ i ) mx = max ( mx, str . substr ( i ) );
return mx;
}
nclude <bits/stdc++.h>
using namespace std;
string f_gold ( string str ) {
string mx = "";
for ( int i = 0;
i < str . length ( );
++ i ) mx = max ( mx, str . substr ( i ) );
return mx;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"HCoAefoaan","80336005","01111111110","qIH","4210598472796","10101","imqmKdatcgXjs","950509666021","10111101101","wasqgYFvz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str ) { string mx = ""; for ( int i = 0; i < str . length ( ); ++ i [MASK] mx = max ( mx, str . substr ( i ) ); return mx; }nclude <bits/stdc++.h>
using namespace std;
string f_gold ( string str ) {
string mx = "";
for ( int i = 0;
i < str . length ( );
++ i ) mx = max ( mx, str . substr ( i ) );
return mx;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"HCoAefoaan","80336005","01111111110","qIH","4210598472796","10101","imqmKdatcgXjs","950509666021","10111101101","wasqgYFvz"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) j",
"b) )",
"c) x",
"d) [",
"e) int"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( char s [ ], int n ) {
int dp [ n ] [ n ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < n - 1;
i ++ ) if ( s [ i ] == '(' && s [ i + 1 ] == ')' ) dp [ i ] [ i + 1 ] = 2;
for ( int l = 2;
l < n;
l ++ ) {
for ( int i = 0, j = l;
j < n;
i ++, j ++ ) {
if ( s [ i ] == '(' && s [ j ] == ')' ) dp [ i ] [ j ] = 2 + dp [ i + 1 ] [ j - 1 ];
for ( int k = i;
k < j;
k ++ ) dp [ i ] [ j ] = max ( dp [ i ] [ j ], dp [ i ] [ k ] + dp [ k + 1 ] [ j ] );
}
}
return dp [ 0 ] [ n - 1 ];
}
2 + dp [ i + 1 ] [ j - 1 ];
for ( int k = i;
k < j;
k ++ ) dp [ i ] [ j ] = max ( dp [ i ] [ j ], dp [ i ] [ k ] + dp [ k + 1 ] [ j ] );
}
}
return dp [ 0 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()()(()))()","(()(()))","(())()()","(())()))()","((()))(((","kjbcwkjebc","KZPNX","82050","010)()fkhj","ndPKtu"};
vector<int> param1 {11,8,8,10,9,10,5,5,10,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( char s [ ], int n ) { int dp [ n ] [ n ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 0; i < n - 1; i ++ ) [MASK] ( s [ i ] == '(' && s [ i + 1 ] == ')' ) dp [ i ] [ i + 1 ] = 2; for ( int l = 2; l < n; l ++ ) { for ( int i = 0, j = l; j < n; i ++, j ++ ) { if ( s [ i ] == '(' && s [ j ] == ')' ) dp [ i ] [ j ] = 2 + dp [ i + 1 ] [ j - 1 ]; for ( int k = i; k < j; k ++ ) dp [ i ] [ j ] = max ( dp [ i ] [ j ], dp [ i ] [ k ] + dp [ k + 1 ] [ j ] ); } } return dp [ 0 ] [ n - 1 ]; } 2 + dp [ i + 1 ] [ j - 1 ];
for ( int k = i;
k < j;
k ++ ) dp [ i ] [ j ] = max ( dp [ i ] [ j ], dp [ i ] [ k ] + dp [ k + 1 ] [ j ] );
}
}
return dp [ 0 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()()(()))()","(()(()))","(())()()","(())()))()","((()))(((","kjbcwkjebc","KZPNX","82050","010)()fkhj","ndPKtu"};
vector<int> param1 {11,8,8,10,9,10,5,5,10,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| if | [
"a) {",
"b) public",
"c) i",
"d) n",
"e) if"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
sort ( a, a + n );
int count = 1;
int answer = 0;
for ( int i = 1;
i < n;
i ++ ) {
if ( a [ i ] == a [ i - 1 ] ) {
count += 1;
}
else {
answer = answer + ( count * ( count - 1 ) ) / 2;
count = 1;
}
}
answer = answer + ( count * ( count - 1 ) ) / 2;
return answer;
}
- 1 ] ) {
count += 1;
}
else {
answer = answer + ( count * ( count - 1 ) ) / 2;
count = 1;
}
}
answer = answer + ( count * ( count - 1 ) ) / 2;
return answer;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98},{42,-20,52,34,58,62,-60,70,36,-8,-26,68,34,-92,42,94,56,84,-70,70},{0,0,0,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},{31,87,75,69,11,65,25,27},{-92,-88,-86,-74,-72,-70,-70,-66,-62,-60,-52,-42,-42,8,14,30,36,84,88},{1,0,0,0},{2,8,9,12,21,23,30,31,33,34,34,41,43,45,52,53,53,55,56,61,73,73,73,74,76,79,81,81,81,90,91,92,92,97,99,99},{84,6,-36,62,-2,-32,-82,-78,20,8,-50,-70,20,-58,94,-28,-84,-22,-44,-84,2,-68,-34,58,-64,-86,-40,-80,74,-26,12,2,-20,20,76,-14,-40,56,24,-16,-66,14,-42,0,72,82,-70},{0,0,0,0,0,0,0,1,1},{67,93,54,91,74,88,48,68,17,6,15,25}};
vector<int> param1 {24,17,37,5,13,3,30,31,8,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { sort ( a, a + n ); int count = 1; int answer = 0; for ( int i = 1; i < n; i ++ ) { if ( a [ [MASK] ] == a [ i - 1 ] ) { count += 1; } else { answer = answer + ( count * ( count - 1 ) ) / 2; count = 1; } } answer = answer + ( count * ( count - 1 ) ) / 2; return answer; }- 1 ] ) {
count += 1;
}
else {
answer = answer + ( count * ( count - 1 ) ) / 2;
count = 1;
}
}
answer = answer + ( count * ( count - 1 ) ) / 2;
return answer;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,9,12,13,13,14,16,19,23,24,25,28,29,38,38,41,42,44,51,55,56,58,59,61,62,62,63,63,64,67,68,69,71,78,78,80,82,82,82,83,85,86,92,94,98},{42,-20,52,34,58,62,-60,70,36,-8,-26,68,34,-92,42,94,56,84,-70,70},{0,0,0,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},{31,87,75,69,11,65,25,27},{-92,-88,-86,-74,-72,-70,-70,-66,-62,-60,-52,-42,-42,8,14,30,36,84,88},{1,0,0,0},{2,8,9,12,21,23,30,31,33,34,34,41,43,45,52,53,53,55,56,61,73,73,73,74,76,79,81,81,81,90,91,92,92,97,99,99},{84,6,-36,62,-2,-32,-82,-78,20,8,-50,-70,20,-58,94,-28,-84,-22,-44,-84,2,-68,-34,58,-64,-86,-40,-80,74,-26,12,2,-20,20,76,-14,-40,56,24,-16,-66,14,-42,0,72,82,-70},{0,0,0,0,0,0,0,1,1},{67,93,54,91,74,88,48,68,17,6,15,25}};
vector<int> param1 {24,17,37,5,13,3,30,31,8,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | i | [
"a) f_gold",
"b) i",
"c) l,",
"d) class",
"e) ("
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str, int n ) {
string reverseAlphabet = "zyxwvutsrqponmlkjihgfedcba";
int l = str . length ( );
for ( int i = n;
i < l;
i ++ ) str [ i ] = reverseAlphabet [ str [ i ] - 'a' ];
return str;
}
int n ) {
string reverseAlphabet = "zyxwvutsrqponmlkjihgfedcba";
int l = str . length ( );
for ( int i = n;
i < l;
i ++ ) str [ i ] = reverseAlphabet [ str [ i ] - 'a' ];
return str;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"oncL","678","1000101101100","J","533740","000101","hZ","368838","011101","pMFMw"};
vector<int> param1 {17,38,78,37,55,77,3,11,88,89};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str, int n ) { string reverseAlphabet = "zyxwvutsrqponmlkjihgfedcba"; int l = str . length ( ); for ( int i = n; i < l; i ++ ) str [ i ] = reverseAlphabet [ str [ i ] - 'a' ]; return str; }int n ) {
string reverseAlphabet = "zyxwvutsrqponmlkjihgfedcba";
int l = str . length ( );
for ( int i = n;
i < l;
i ++ ) str [ i ] = reverseAlphabet [ str [ i ] - 'a' ];
return str;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"oncL","678","1000101101100","J","533740","000101","hZ","368838","011101","pMFMw"};
vector<int> param1 {17,38,78,37,55,77,3,11,88,89};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <cstdlib> | [
"a) MINIMUM_SUM_TWO_NUMBERS_FORMED_DIGITS_ARRAY_2{",
"b) <cstdlib>",
"c) ],",
"d) a",
"e) ["
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int A [ ], int B [ ], int n ) {
sort ( A, A + n );
sort ( B, B + n );
int result = 0;
for ( int i = 0;
i < n;
i ++ ) result += ( A [ i ] * B [ n - i - 1 ] );
return result;
}
_gold ( int A [ ], int B [ ], int n ) {
sort ( A, A + n );
sort ( B, B + n );
int result = 0;
for ( int i = 0;
i < n;
i ++ ) result += ( A [ i ] * B [ n - i - 1 ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{31,85},{22,-6,84,70,84,6,28,-74,-14,68,22,90,-10},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{12,33,93,2,83,9,61,84,9,69,2},{-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},{1,0,1,1,0,1,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,0,1,1,0,1,0,1,1,0,0,0,1,0},{4,6,6,20,22,23,26,39,40,47,50,68,68,70,73,77,80,82,85},{78,60,-8,46,-12},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{60,66,84,99,85,89,28,97,85,71,53,93,23,9,45,26,49,95,64,33,70,34,10,1,68,39,53,12}};
vector<vector<int>> param1 {{18,33},{2,-48,-36,-4,-22,-98,-74,-92,-72,-4,48,-32,94},{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{85,92,92,1,54,31,69,4,39,81,52},{-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,1,1,1,0,0,0,0,0,1,0,1,0,0,0,0,1,0,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1},{2,3,15,21,22,26,35,37,37,38,57,59,62,63,64,76,81,85,91},{-72,-80,-30,16,-38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{37,33,33,77,78,34,28,1,63,15,51,50,90,22,71,23,68,55,2,22,31,54,76,36,2,27,96,89}};
vector<int> param2 {1,6,14,7,26,32,17,2,17,15};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int A [ ], int B [ ], int n ) { sort ( A, A + n ); sort ( B, B + n ); int result = 0; for ( int i = 0; i < n; i ++ ) result += ( A [ i ] * B [ n - i - 1 ] ); [MASK] result; }_gold ( int A [ ], int B [ ], int n ) {
sort ( A, A + n );
sort ( B, B + n );
int result = 0;
for ( int i = 0;
i < n;
i ++ ) result += ( A [ i ] * B [ n - i - 1 ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{31,85},{22,-6,84,70,84,6,28,-74,-14,68,22,90,-10},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{12,33,93,2,83,9,61,84,9,69,2},{-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},{1,0,1,1,0,1,1,0,1,0,0,1,1,1,0,0,0,0,0,0,1,0,1,1,0,1,0,1,1,0,0,0,1,0},{4,6,6,20,22,23,26,39,40,47,50,68,68,70,73,77,80,82,85},{78,60,-8,46,-12},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{60,66,84,99,85,89,28,97,85,71,53,93,23,9,45,26,49,95,64,33,70,34,10,1,68,39,53,12}};
vector<vector<int>> param1 {{18,33},{2,-48,-36,-4,-22,-98,-74,-92,-72,-4,48,-32,94},{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{85,92,92,1,54,31,69,4,39,81,52},{-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,1,1,1,0,0,0,0,0,1,0,1,0,0,0,0,1,0,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1},{2,3,15,21,22,26,35,37,37,38,57,59,62,63,64,76,81,85,91},{-72,-80,-30,16,-38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{37,33,33,77,78,34,28,1,63,15,51,50,90,22,71,23,68,55,2,22,31,54,76,36,2,27,96,89}};
vector<int> param2 {1,6,14,7,26,32,17,2,17,15};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | return | [
"a) y)?",
"b) std;",
"c) return",
"d) )",
"e) i"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int a1 [ ], int a2 [ ], int a3 [ ], int n1, int n2, int n3, int sum ) {
unordered_set < int > s;
for ( int i = 0;
i < n1;
i ++ ) s . insert ( a1 [ i ] );
for ( int i = 0;
i < n2;
i ++ ) {
for ( int j = 0;
j < n3;
j ++ ) {
if ( s . find ( sum - a2 [ i ] - a3 [ j ] ) != s . end ( ) ) return true;
}
}
return false;
}
);
for ( int i = 0;
i < n2;
i ++ ) {
for ( int j = 0;
j < n3;
j ++ ) {
if ( s . find ( sum - a2 [ i ] - a3 [ j ] ) != s . end ( ) ) return true;
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<vector<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}};
vector<int> param3 {21,41,26,15,15,5,12,23,38,6};
vector<int> param4 {16,42,20,16,10,7,17,18,22,6};
vector<int> param5 {17,34,30,23,15,9,13,29,40,8};
vector<int> param6 {18,32,16,15,15,6,9,19,32,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int a1 [ ], int a2 [ ], int a3 [ ], int n1, int n2, int n3, int sum ) { unordered_set < int > s; for ( int i = 0; i < n1; i ++ ) s . insert ( a1 [ i ] ); for ( int i = 0; i < n2; i ++ ) { for ( int j = 0; j < n3; j ++ ) { if ( s . find ( sum - a2 [ i ] - a3 [ j ] ) != [MASK] . end ( ) ) return true; } } return false; });
for ( int i = 0;
i < n2;
i ++ ) {
for ( int j = 0;
j < n3;
j ++ ) {
if ( s . find ( sum - a2 [ i ] - a3 [ j ] ) != s . end ( ) ) return true;
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<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}};
vector<vector<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}};
vector<vector<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}};
vector<int> param3 {21,41,26,15,15,5,12,23,38,6};
vector<int> param4 {16,42,20,16,10,7,17,18,22,6};
vector<int> param5 {17,34,30,23,15,9,13,29,40,8};
vector<int> param6 {18,32,16,15,15,6,9,19,32,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | s | [
"a) cmpfunc);}",
"b) -",
"c) <bits/stdc++.h>",
"d) )",
"e) s"
] | e |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.