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;
int f_gold ( int arr [ ], int n ) {
if ( n == 1 || n == 0 ) return 1;
if ( arr [ n - 1 ] < arr [ n - 2 ] ) return 0;
return f_gold ( arr, n - 1 );
}
lude <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
if ( n == 1 || n == 0 ) return 1;
if ( arr [ n - 1 ] < arr [ n - 2 ] ) return 0;
return f_gold ( arr, n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,19,21,28,32,35,44,51,55,62,80,80,83,90,93,93},{84,-28,-42,38,-94,-70,34,54,38,-58,-54,-6,72,-32,-18,80,-6,-38,-30,-86,-10,14,92,-56,40,-58,-2,-6,-46,-80,72,-12,2,-64,36,98,-24},{0,1,1,1},{74,75,9,13,57,82,57,37,47,11,28,6,33,14,47,29,15,56,69,86,31,19,18,58,70,73,30,95,35,17,16,97,68,95,33,36,11,60,4,63,5,64,85,77,4},{-96,-92,-84,-78,-74,-68,-66,-64,-62,-50,-48,-48,-46,-38,-28,-28,-26,-24,-24,-20,-14,-12,-4,16,18,28,32,48,50,62,70,72,78,90,92},{0,1,0,1,0,0,0,1,1,1,1,1,0,1,0,1,1,1,0,1,0,0,0,1,1,1,0,1,1,1,1,1,1,0,1,0,1,1,1,0,0,1,0,1,1,1,0,0},{6,8,11,21,29,31,41,50,56,56,69,69,74,79,86,88,93,95,99},{10,-12,-36,72,-42,-94,38,-78,-4,6,12,6,-48},{0,0,0,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},{97,58,88,20,63,1,23,33,57,81,54,66,95,31,54,16,37,7,1,94,18,42,39,26,75,65,57,69,86,77,17,7,71,12,38,87,48,55,54,72,15,30,55}};
vector<int> param1 {8,21,2,31,31,38,10,6,35,29};
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 ) { if ( n == 1 || n == 0 ) [MASK] 1; if ( arr [ n - 1 ] < arr [ n - 2 ] ) return 0; return f_gold ( arr, n - 1 ); }lude <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
if ( n == 1 || n == 0 ) return 1;
if ( arr [ n - 1 ] < arr [ n - 2 ] ) return 0;
return f_gold ( arr, n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,19,21,28,32,35,44,51,55,62,80,80,83,90,93,93},{84,-28,-42,38,-94,-70,34,54,38,-58,-54,-6,72,-32,-18,80,-6,-38,-30,-86,-10,14,92,-56,40,-58,-2,-6,-46,-80,72,-12,2,-64,36,98,-24},{0,1,1,1},{74,75,9,13,57,82,57,37,47,11,28,6,33,14,47,29,15,56,69,86,31,19,18,58,70,73,30,95,35,17,16,97,68,95,33,36,11,60,4,63,5,64,85,77,4},{-96,-92,-84,-78,-74,-68,-66,-64,-62,-50,-48,-48,-46,-38,-28,-28,-26,-24,-24,-20,-14,-12,-4,16,18,28,32,48,50,62,70,72,78,90,92},{0,1,0,1,0,0,0,1,1,1,1,1,0,1,0,1,1,1,0,1,0,0,0,1,1,1,0,1,1,1,1,1,1,0,1,0,1,1,1,0,0,1,0,1,1,1,0,0},{6,8,11,21,29,31,41,50,56,56,69,69,74,79,86,88,93,95,99},{10,-12,-36,72,-42,-94,38,-78,-4,6,12,6,-48},{0,0,0,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},{97,58,88,20,63,1,23,33,57,81,54,66,95,31,54,16,37,7,1,94,18,42,39,26,75,65,57,69,86,77,17,7,71,12,38,87,48,55,54,72,15,30,55}};
vector<int> param1 {8,21,2,31,31,38,10,6,35,29};
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) <vector>",
"b) )",
"c) <cstdlib>",
"d) (",
"e) return"
] | 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 p ) {
int first = 1, second = 1, number = 2, next = 1;
while ( next ) {
next = ( first + second ) % p;
first = second;
second = next;
number ++;
}
return number;
}
ld ( int p ) {
int first = 1, second = 1, number = 2, next = 1;
while ( next ) {
next = ( first + second ) % p;
first = second;
second = next;
number ++;
}
return number;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {51,40,68,7,8,32,93,75,71,15};
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 p ) { int first = 1, second = 1, number = 2, next = 1; while ( next ) { next = ( first + second ) % p; first = second; second [MASK] next; number ++; } return number; }ld ( int p ) {
int first = 1, second = 1, number = 2, next = 1;
while ( next ) {
next = ( first + second ) % p;
first = second;
second = next;
number ++;
}
return number;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {51,40,68,7,8,32,93,75,71,15};
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) x:",
"b) ]",
"c) i",
"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 ) {
unordered_map < int, int > um;
int curr_sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
curr_sum += ( arr [ i ] == 0 ) ? - 1 : arr [ i ];
um [ curr_sum ] ++;
}
int count = 0;
for ( auto itr = um . begin ( );
itr != um . end ( );
itr ++ ) {
if ( itr -> second > 1 ) count += ( ( itr -> second * ( itr -> second - 1 ) ) / 2 );
}
if ( um . find ( 0 ) != um . end ( ) ) count += um [ 0 ];
return count;
}
m . end ( );
itr ++ ) {
if ( itr -> second > 1 ) count += ( ( itr -> second * ( itr -> second - 1 ) ) / 2 );
}
if ( um . find ( 0 ) != um . end ( ) ) count += um [ 0 ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,12,18,19,19,20,20,21,25,29,38,54,54,71,72,72,74,75,77,78,80,80,81,84,97,97},{10,70,24,-38,32,-68,88,-28,-24,-70,-64,50,-30,64,54,-6,18,-30,-30,-62,-10,94,-54,-22,-88,96,22,26,-92,-40,-76,46,36,30,24,-52,0},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{66,50,17,15,86,84,87,24,81,23,71,31,13,72,58,19,29,28,40,14,48,48,81,4,52,88,54,56,10,12,58,55,7,66,15,73,22,2,20,27,57,56,56,31,9,55},{-98,-62,-60,16,78,82},{1,0,1},{2,31,34,64},{-70,90,-10,-64,-76,-74,-12,-44,-48,-54,76,-78,8,0,0,78,-28,6,98,-84,60,60,2,48,-96,-28,-78,-76,-56,-26,-60,50,44,34,-90,80,-30,-98,62,36,-46,-72},{1,1,1},{37,70,80,61,86,10,17,98,54,89,87,84,11,55,3,52,4,90,98,31,20,62,71,58,58,6,92,5,99,99,72,40,82,54,23,19,85,91,62,98,62,72,93,74}};
vector<int> param1 {24,24,11,40,5,2,2,25,1,27};
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 > um; int curr_sum = 0; for ( int i = 0; i < n; i ++ ) { curr_sum += ( arr [ i ] == 0 ) ? - 1 : arr [ i ]; um [ curr_sum ] ++; } int count = 0; for ( auto itr = um . begin ( ); itr != um . end ( ); itr ++ ) { if ( itr -> second > 1 ) count += ( ( itr -> second * ( itr -> second - 1 ) ) / 2 ); } if ( um . find ( 0 ) != um . end ( ) ) count += um [ 0 ]; return [MASK] }m . end ( );
itr ++ ) {
if ( itr -> second > 1 ) count += ( ( itr -> second * ( itr -> second - 1 ) ) / 2 );
}
if ( um . find ( 0 ) != um . end ( ) ) count += um [ 0 ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,12,18,19,19,20,20,21,25,29,38,54,54,71,72,72,74,75,77,78,80,80,81,84,97,97},{10,70,24,-38,32,-68,88,-28,-24,-70,-64,50,-30,64,54,-6,18,-30,-30,-62,-10,94,-54,-22,-88,96,22,26,-92,-40,-76,46,36,30,24,-52,0},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{66,50,17,15,86,84,87,24,81,23,71,31,13,72,58,19,29,28,40,14,48,48,81,4,52,88,54,56,10,12,58,55,7,66,15,73,22,2,20,27,57,56,56,31,9,55},{-98,-62,-60,16,78,82},{1,0,1},{2,31,34,64},{-70,90,-10,-64,-76,-74,-12,-44,-48,-54,76,-78,8,0,0,78,-28,6,98,-84,60,60,2,48,-96,-28,-78,-76,-56,-26,-60,50,44,34,-90,80,-30,-98,62,36,-46,-72},{1,1,1},{37,70,80,61,86,10,17,98,54,89,87,84,11,55,3,52,4,90,98,31,20,62,71,58,58,6,92,5,99,99,72,40,82,54,23,19,85,91,62,98,62,72,93,74}};
vector<int> param1 {24,24,11,40,5,2,2,25,1,27};
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;
} | count; | [
"a) ;",
"b) ]",
"c) count;",
"d) <",
"e) (l"
] | c |
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 = strlen ( s );
int count = 0;
for ( int i = 0;
i < n;
++ i ) if ( s [ i ] == '4' || s [ i ] == '8' || s [ i ] == '0' ) count ++;
for ( int i = 0;
i < n - 1;
++ i ) {
int h = ( s [ i ] - '0' ) * 10 + ( s [ i + 1 ] - '0' );
if ( h % 4 == 0 ) count = count + i + 1;
}
return count;
}
s [ i ] == '0' ) count ++;
for ( int i = 0;
i < n - 1;
++ i ) {
int h = ( s [ i ] - '0' ) * 10 + ( s [ i + 1 ] - '0' );
if ( h % 4 == 0 ) count = count + i + 1;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"Qaq","9400761825850","0011001111","lasWqrLRq","5662","110"," tOYKf","6536991235305","11111","uZftT iDHcYiCt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front()) == f_gold(¶m0[i].front()))
{
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 = strlen ( s ); int count = 0; for ( int i = 0; i < n; ++ i ) if ( s [ i ] == '4' || s [ i ] == '8' || s [ i ] == '0' ) count ++; for ( int i = 0; i < n - 1; ++ i ) { int h = ( s [ i ] - '0' ) * 10 + ( s [ i + 1 [MASK] - '0' ); if ( h % 4 == 0 ) count = count + i + 1; } return count; }s [ i ] == '0' ) count ++;
for ( int i = 0;
i < n - 1;
++ i ) {
int h = ( s [ i ] - '0' ) * 10 + ( s [ i + 1 ] - '0' );
if ( h % 4 == 0 ) count = count + i + 1;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"Qaq","9400761825850","0011001111","lasWqrLRq","5662","110"," tOYKf","6536991235305","11111","uZftT iDHcYiCt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front()) == f_gold(¶m0[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) }",
"b) if",
"c) x:",
"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 arr1 [ ], int n, int arr2 [ ], int m ) {
int table [ m ];
for ( int j = 0;
j < m;
j ++ ) table [ j ] = 0;
for ( int i = 0;
i < n;
i ++ ) {
int current = 0;
for ( int j = 0;
j < m;
j ++ ) {
if ( arr1 [ i ] == arr2 [ j ] ) if ( current + 1 > table [ j ] ) table [ j ] = current + 1;
if ( arr1 [ i ] > arr2 [ j ] ) if ( table [ j ] > current ) current = table [ j ];
}
}
int result = 0;
for ( int i = 0;
i < m;
i ++ ) if ( table [ i ] > result ) result = table [ i ];
return result;
}
r2 [ j ] ) if ( table [ j ] > current ) current = table [ j ];
}
}
int result = 0;
for ( int i = 0;
i < m;
i ++ ) if ( table [ i ] > result ) result = table [ i ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,7,9,35,43,51,51,66,88},{-52,52,-92,-46,-94,30,-36,18,-98,22,-36,96,-88,-50,50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,74,29},{-84,-74,-70,-62,-56,-56,-52,-2,6,24,28,44,44,52},{0,0,0,1,0,1,0,0,1,1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0},{3,4,4,7,15,15,16,22,32,32,37,39,39,41,43,46,47,47,49,75,79,80,86,88,93},{70,-64,0,52,32,-98,38,-8,34,70,98,58,-48,-60,-28,-22,-72,82,-98,-36},{0,0,1,1,1,1,1,1},{46,87,98}};
vector<int> param1 {5,7,36,1,8,17,19,16,7,2};
vector<vector<int>> param2 {{10,21,38,50,65,67,87,93,99},{-58,40,56,-62,-92,-94,40,18,-2,-76,-78,-14,44,84,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,33,48},{-98,-96,-88,-66,-32,-26,-24,-20,-4,20,48,74,90,96},{1,0,1,1,0,0,0,0,1,1,1,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,0},{9,12,15,20,22,27,28,28,30,31,35,39,47,58,58,60,73,74,76,78,80,86,95,96,98},{-18,88,-40,-52,30,-10,-18,-56,84,-22,-64,80,-14,-64,40,92,48,-8,24,82},{0,1,1,1,1,1,1,1},{67,31,54}};
vector<int> param3 {8,10,22,1,12,15,14,12,7,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],¶m2[i].front(),param3[i]) == f_gold(¶m0[i].front(),param1[i],¶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 arr1 [ ], int n, int arr2 [ ], int m ) { int table [ m ]; for ( int j = 0; j < m; j ++ ) table [ j ] = 0; for ( int i = 0; i < n; i ++ ) { int current = 0; for ( int j [MASK] 0; j < m; j ++ ) { if ( arr1 [ i ] == arr2 [ j ] ) if ( current + 1 > table [ j ] ) table [ j ] = current + 1; if ( arr1 [ i ] > arr2 [ j ] ) if ( table [ j ] > current ) current = table [ j ]; } } int result = 0; for ( int i = 0; i < m; i ++ ) if ( table [ i ] > result ) result = table [ i ]; return result; }r2 [ j ] ) if ( table [ j ] > current ) current = table [ j ];
}
}
int result = 0;
for ( int i = 0;
i < m;
i ++ ) if ( table [ i ] > result ) result = table [ i ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,7,9,35,43,51,51,66,88},{-52,52,-92,-46,-94,30,-36,18,-98,22,-36,96,-88,-50,50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,74,29},{-84,-74,-70,-62,-56,-56,-52,-2,6,24,28,44,44,52},{0,0,0,1,0,1,0,0,1,1,1,1,0,0,1,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0},{3,4,4,7,15,15,16,22,32,32,37,39,39,41,43,46,47,47,49,75,79,80,86,88,93},{70,-64,0,52,32,-98,38,-8,34,70,98,58,-48,-60,-28,-22,-72,82,-98,-36},{0,0,1,1,1,1,1,1},{46,87,98}};
vector<int> param1 {5,7,36,1,8,17,19,16,7,2};
vector<vector<int>> param2 {{10,21,38,50,65,67,87,93,99},{-58,40,56,-62,-92,-94,40,18,-2,-76,-78,-14,44,84,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,33,48},{-98,-96,-88,-66,-32,-26,-24,-20,-4,20,48,74,90,96},{1,0,1,1,0,0,0,0,1,1,1,0,1,0,0,0,0,1,0,0,0,0,1,1,1,1,1,1,1,0},{9,12,15,20,22,27,28,28,30,31,35,39,47,58,58,60,73,74,76,78,80,86,95,96,98},{-18,88,-40,-52,30,-10,-18,-56,84,-22,-64,80,-14,-64,40,92,48,-8,24,82},{0,1,1,1,1,1,1,1},{67,31,54}};
vector<int> param3 {8,10,22,1,12,15,14,12,7,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],¶m2[i].front(),param3[i]) == f_gold(¶m0[i].front(),param1[i],¶m2[i].front(),param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) i",
"b) =",
"c) n",
"d) import",
"e) max"
] | 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 low, int high ) {
int fact = 1, x = 1;
while ( fact < low ) {
fact = fact * x;
x ++;
}
int res = 0;
while ( fact <= high ) {
res ++;
fact = fact * x;
x ++;
}
return res;
}
high ) {
int fact = 1, x = 1;
while ( fact < low ) {
fact = fact * x;
x ++;
}
int res = 0;
while ( fact <= high ) {
res ++;
fact = fact * x;
x ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,57,31,62,49,82,31,5,76,55};
vector<int> param1 {79,21,37,87,98,76,45,52,43,6};
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 [MASK] #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int low, int high ) { int fact = 1, x = 1; while ( fact < low ) { fact = fact * x; x ++; } int res = 0; while ( fact <= high ) { res ++; fact = fact * x; x ++; } return res; }high ) {
int fact = 1, x = 1;
while ( fact < low ) {
fact = fact * x;
x ++;
}
int res = 0;
while ( fact <= high ) {
res ++;
fact = fact * x;
x ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,57,31,62,49,82,31,5,76,55};
vector<int> param1 {79,21,37,87,98,76,45,52,43,6};
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;
} | <vector> | [
"a) ;",
"b) i",
"c) {",
"d) <vector>",
"e) #include"
] | d |
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 ) {
return ( ! ( n & 1 ) );
}
ream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return ( ! ( n & 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,73,79,36,71,23,41,66,46,50};
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> [MASK] <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int n ) { return ( ! ( n & 1 ) ); }ream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return ( ! ( n & 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,73,79,36,71,23,41,66,46,50};
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) import",
"c) :",
"d) #include",
"e) j"
] | 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 k ) {
int max_so_far = INT_MIN, max_ending_here = 0;
for ( int i = 0;
i < n * k;
i ++ ) {
max_ending_here = max_ending_here + a [ i % n ];
if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
if ( max_ending_here < 0 ) max_ending_here = 0;
}
return max_so_far;
}
ax_ending_here = max_ending_here + a [ i % n ];
if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
if ( max_ending_here < 0 ) max_ending_here = 0;
}
return max_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,6,12,20,23,28,33,37,47,51,53,56,63,65,65,68,69,76,76,78,83},{68,10,52,-44,34,-4,-34,2,50,-60,50,94,-98,-98,-44,-36,-4,-62,-2,-92,-70,-48,-78,-10,94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,59,21,82,73,29,30,25,21,10,85,22,60,43,49,20,34,39,69,6,44,27,50,33,57,29,65,18,68,56,50,28},{-84,-74,-74,-56,-54,-48,-48,-46,-42,-34,-32,-30,-18,-16,-16,6,12,20,24,26,30,32,34,42,42,42,44,46,46,50,50,62,72,78,90},{0,1,1,1,1,1,1,1,1,0,1,1,0,0,1,1,0,1,1,1,0,1,1,0,0,0,1,1,1,0},{3,7,11,11,26,60,68,71,77,91,95},{28,48,-86,-52,6,4,30,18,-32,60,-2,16,-88,-36},{1},{76}};
vector<int> param1 {18,22,34,23,17,16,8,8,0,0};
vector<int> param2 {20,22,29,30,23,25,10,11,0,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 a [ ], int n, [MASK] k ) { int max_so_far = INT_MIN, max_ending_here = 0; for ( int i = 0; i < n * k; i ++ ) { max_ending_here = max_ending_here + a [ i % n ]; if ( max_so_far < max_ending_here ) max_so_far = max_ending_here; if ( max_ending_here < 0 ) max_ending_here = 0; } return max_so_far; }ax_ending_here = max_ending_here + a [ i % n ];
if ( max_so_far < max_ending_here ) max_so_far = max_ending_here;
if ( max_ending_here < 0 ) max_ending_here = 0;
}
return max_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,6,12,20,23,28,33,37,47,51,53,56,63,65,65,68,69,76,76,78,83},{68,10,52,-44,34,-4,-34,2,50,-60,50,94,-98,-98,-44,-36,-4,-62,-2,-92,-70,-48,-78,-10,94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,59,21,82,73,29,30,25,21,10,85,22,60,43,49,20,34,39,69,6,44,27,50,33,57,29,65,18,68,56,50,28},{-84,-74,-74,-56,-54,-48,-48,-46,-42,-34,-32,-30,-18,-16,-16,6,12,20,24,26,30,32,34,42,42,42,44,46,46,50,50,62,72,78,90},{0,1,1,1,1,1,1,1,1,0,1,1,0,0,1,1,0,1,1,1,0,1,1,0,0,0,1,1,1,0},{3,7,11,11,26,60,68,71,77,91,95},{28,48,-86,-52,6,4,30,18,-32,60,-2,16,-88,-36},{1},{76}};
vector<int> param1 {18,22,34,23,17,16,8,8,0,0};
vector<int> param2 {20,22,29,30,23,25,10,11,0,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;
} | int | [
"a) ++",
"b) +=",
"c) n",
"d) ,",
"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 ( char str [ ], int n ) {
char last = ' ';
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( last != str [ i ] ) res ++;
last = str [ i ];
}
return res / 2;
}
td;
int f_gold ( char str [ ], int n ) {
char last = ' ';
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( last != str [ i ] ) res ++;
last = str [ i ];
}
return res / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"VrTpXWR","2","00011111","adAIqCcOkao","6696836653","0010111","jGYH","4374","0","cNM"};
vector<int> param1 {46,58,84,85,52,78,60,52,56,35};
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 ) [MASK] char last = ' '; int res = 0; for ( int i = 0; i < n; i ++ ) { if ( last != str [ i ] ) res ++; last = str [ i ]; } return res / 2; }td;
int f_gold ( char str [ ], int n ) {
char last = ' ';
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( last != str [ i ] ) res ++;
last = str [ i ];
}
return res / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"VrTpXWR","2","00011111","adAIqCcOkao","6696836653","0010111","jGYH","4374","0","cNM"};
vector<int> param1 {46,58,84,85,52,78,60,52,56,35};
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) int",
"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 a [ ], int n, int k ) {
unordered_map < int, int > b;
for ( int i = 0;
i < n;
i ++ ) {
int x = a [ i ];
int d = min ( 1 + i, n - i );
if ( b . find ( x ) == b . end ( ) ) b [ x ] = d;
else b [ x ] = min ( d, b [ x ] );
}
int ans = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) {
int x = a [ i ];
if ( x != k - x && b . find ( k - x ) != b . end ( ) ) ans = min ( max ( b [ x ], b [ k - x ] ), ans );
}
return ans;
}
INT_MAX;
for ( int i = 0;
i < n;
i ++ ) {
int x = a [ i ];
if ( x != k - x && b . find ( k - x ) != b . end ( ) ) ans = min ( max ( b [ x ], b [ k - x ] ), ans );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,27,66,89,96,96},{84,-38,-56,-20,-98,-40,-16,22,20,98,-56,-32,-44,30,-58,26,-44,-32,50,46,92},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{20,71,66,58,74,2,63,13,1,36,28,83,24,20,85,30,59,56,8,97,58,28,28,42},{-94,-88,-86,-68,-66,-64,-28,-12,4,18,22,28,32,34,34,40,44,46,60,68,72,78,80,84,88,96},{0,0,0,0,0,1,1,1,1,0,0,0,1,1,1},{8,13,54,59,61,69,89,90,92},{-58,50,-74,-8,-50,90,90,-2,-22,8,-76,16,4,56,94,36,28,-42,80,-88,88,52,74,40,12,-72,-50,50,88,-54,32,-24,-48,-66,-86,40,-6,14,10,-88,56,80,-34},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{2,60,66,39,18,60,37,75,3,64,24,16,72,95,96,44,23,58,58,33,24,96}};
vector<int> param1 {4,13,23,23,16,8,4,27,9,21};
vector<int> param2 {4,11,13,17,15,13,8,42,12,17};
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 k ) { unordered_map < int, int > b; for ( int i = 0; i < n; i ++ ) { int x = a [ i ]; int d = min ( 1 + i, n - i [MASK] if ( b . find ( x ) == b . end ( ) ) b [ x ] = d; else b [ x ] = min ( d, b [ x ] ); } int ans = INT_MAX; for ( int i = 0; i < n; i ++ ) { int x = a [ i ]; if ( x != k - x && b . find ( k - x ) != b . end ( ) ) ans = min ( max ( b [ x ], b [ k - x ] ), ans ); } return ans; }INT_MAX;
for ( int i = 0;
i < n;
i ++ ) {
int x = a [ i ];
if ( x != k - x && b . find ( k - x ) != b . end ( ) ) ans = min ( max ( b [ x ], b [ k - x ] ), ans );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,27,66,89,96,96},{84,-38,-56,-20,-98,-40,-16,22,20,98,-56,-32,-44,30,-58,26,-44,-32,50,46,92},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{20,71,66,58,74,2,63,13,1,36,28,83,24,20,85,30,59,56,8,97,58,28,28,42},{-94,-88,-86,-68,-66,-64,-28,-12,4,18,22,28,32,34,34,40,44,46,60,68,72,78,80,84,88,96},{0,0,0,0,0,1,1,1,1,0,0,0,1,1,1},{8,13,54,59,61,69,89,90,92},{-58,50,-74,-8,-50,90,90,-2,-22,8,-76,16,4,56,94,36,28,-42,80,-88,88,52,74,40,12,-72,-50,50,88,-54,32,-24,-48,-66,-86,40,-6,14,10,-88,56,80,-34},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{2,60,66,39,18,60,37,75,3,64,24,16,72,95,96,44,23,58,58,33,24,96}};
vector<int> param1 {4,13,23,23,16,8,4,27,9,21};
vector<int> param2 {4,11,13,17,15,13,8,42,12,17};
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) );",
"c) ;",
"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 ( string tree, int k ) {
int level = - 1;
int sum = 0;
int n = tree . length ( );
for ( int i = 0;
i < n;
i ++ ) {
if ( tree [ i ] == '(' ) level ++;
else if ( tree [ i ] == ')' ) level --;
else {
if ( level == k ) sum += ( tree [ i ] - '0' );
}
}
return sum;
}
0;
i < n;
i ++ ) {
if ( tree [ i ] == '(' ) level ++;
else if ( tree [ i ] == ')' ) level --;
else {
if ( level == k ) sum += ( tree [ i ] - '0' );
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"0010",
"kjtdgmy"};
vector<int> param1 {2,3,1,2,4,100,3,0,12,97};
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 tree, int k ) { int level = - 1; int sum = 0; int n = tree . length ( ); for ( int i = 0; i < n; i ++ ) { if ( tree [ i ] == '(' ) level ++; else if ( tree [ i ] == ')' ) level --; else { if ( level [MASK] k ) sum += ( tree [ i ] - '0' ); } } return sum; } 0;
i < n;
i ++ ) {
if ( tree [ i ] == '(' ) level ++;
else if ( tree [ i ] == ')' ) level --;
else {
if ( level == k ) sum += ( tree [ i ] - '0' );
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(8(3(2()())(6(5()())()))(5(10()())(7(13()())())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"(0(5(6()())(4()(9()())))(7(1()())(3()())))",
"0010",
"kjtdgmy"};
vector<int> param1 {2,3,1,2,4,100,3,0,12,97};
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) f_filled",
"c) (",
"d) if",
"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 b, int c ) {
if ( a > b ) {
if ( b > c ) return b;
else if ( a > c ) return c;
else return a;
}
else {
if ( a > c ) return a;
else if ( b > c ) return c;
else return b;
}
}
) {
if ( a > b ) {
if ( b > c ) return b;
else if ( a > c ) return c;
else return a;
}
else {
if ( a > c ) return a;
else if ( b > c ) return c;
else return b;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {43,76,57,10,59,92,49,16,33,66};
vector<int> param1 {24,54,5,13,47,14,62,95,41,63};
vector<int> param2 {7,66,40,4,56,50,65,12,90,46};
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 a, int b, int c ) { if ( a > b ) { if ( b > c ) return b; else if ( a > c ) return c; else return a; } else { if ( a > c ) return a; else if ( b > c ) return c; else return b; } } ) {
if ( a > b ) {
if ( b > c ) return b;
else if ( a > c ) return c;
else return a;
}
else {
if ( a > c ) return a;
else if ( b > c ) return c;
else return b;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {43,76,57,10,59,92,49,16,33,66};
vector<int> param1 {24,54,5,13,47,14,62,95,41,63};
vector<int> param2 {7,66,40,4,56,50,65,12,90,46};
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) count",
"d) b;",
"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 n ) {
int count = 0;
for ( int curr = 1;
;
curr ++ ) {
int sum = 0;
for ( int x = curr;
x > 0;
x = x / 10 ) sum = sum + x % 10;
if ( sum == 10 ) count ++;
if ( count == n ) return curr;
}
return - 1;
}
1;
;
curr ++ ) {
int sum = 0;
for ( int x = curr;
x > 0;
x = x / 10 ) sum = sum + x % 10;
if ( sum == 10 ) count ++;
if ( count == n ) return curr;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,13,51,69,76,10,97,40,69,4};
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] n ) { int count = 0; for ( int curr = 1; ; curr ++ ) { int sum = 0; for ( int x = curr; x > 0; x = x / 10 ) sum = sum + x % 10; if ( sum == 10 ) count ++; if ( count == n ) return curr; } return - 1; } 1;
;
curr ++ ) {
int sum = 0;
for ( int x = curr;
x > 0;
x = x / 10 ) sum = sum + x % 10;
if ( sum == 10 ) count ++;
if ( count == n ) return curr;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,13,51,69,76,10,97,40,69,4};
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) hash",
"d) void",
"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 arr [ ], int n, int x ) {
int i = 0;
while ( i < n ) {
if ( arr [ i ] == x ) return i;
i = i + abs ( arr [ i ] - x );
}
cout << "number is not present!";
return - 1;
}
gold ( int arr [ ], int n, int x ) {
int i = 0;
while ( i < n ) {
if ( arr [ i ] == x ) return i;
i = i + abs ( arr [ i ] - x );
}
cout << "number is not present!";
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3} ,{6,90},{1, 2, 3, 4, 5, 4},{97,35,60,96,3,67,72,95,55,9,69,28,15,91,31,59},{-84,-78,-74,-70,-68,-60,-56,-54,-48,-46,-28,-16,-6,0,0,8,8,8,12,16,26,30,32,34,36,40,46,48,70,70,72,76,78,78,80,84,84,86},{1,0,1,1,1,1,0,1,1,1,1},{55,64,76,79,93,96},{66,-90,98,-50,0,46,42,64,-96,-80,-96,20,-10,-84},{0,0,0,0,0,0,1},{94,4,34,87,32,3,92,68,57,76,24,33,3,4,30,70,49,30,72,82,16,53,6,24,92,96,89,28,21,8,36,9,40,85,51,1,63,68,74,26,40,3,9,32,67,4,6,73}};
vector<int> param1 {12,1,6,15,22,5,4,8,6,25};
vector<int> param2 {3,1,5,9,31,7,4,13,5,25};
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 ) { [MASK] i = 0; while ( i < n ) { if ( arr [ i ] == x ) return i; i = i + abs ( arr [ i ] - x ); } cout << "number is not present!"; return - 1; }gold ( int arr [ ], int n, int x ) {
int i = 0;
while ( i < n ) {
if ( arr [ i ] == x ) return i;
i = i + abs ( arr [ i ] - x );
}
cout << "number is not present!";
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8, 7, 6, 7, 6, 5, 4, 3, 2, 3, 4, 3} ,{6,90},{1, 2, 3, 4, 5, 4},{97,35,60,96,3,67,72,95,55,9,69,28,15,91,31,59},{-84,-78,-74,-70,-68,-60,-56,-54,-48,-46,-28,-16,-6,0,0,8,8,8,12,16,26,30,32,34,36,40,46,48,70,70,72,76,78,78,80,84,84,86},{1,0,1,1,1,1,0,1,1,1,1},{55,64,76,79,93,96},{66,-90,98,-50,0,46,42,64,-96,-80,-96,20,-10,-84},{0,0,0,0,0,0,1},{94,4,34,87,32,3,92,68,57,76,24,33,3,4,30,70,49,30,72,82,16,53,6,24,92,96,89,28,21,8,36,9,40,85,51,1,63,68,74,26,40,3,9,32,67,4,6,73}};
vector<int> param1 {12,1,6,15,22,5,4,8,6,25};
vector<int> param2 {3,1,5,9,31,7,4,13,5,25};
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;
}
| int | [
"a) class",
"b) j",
"c) int",
"d) return",
"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 str ) {
int len = str . size ( );
bool oneSeen = 0;
int count = 0;
for ( int i = 0;
i < len;
i ++ ) {
if ( str [ i ] == '1' && oneSeen == 1 ) if ( str [ i - 1 ] == '0' ) count ++;
if ( str [ i ] == '1' && oneSeen == 0 ) {
oneSeen = 1;
continue;
}
if ( str [ i ] != '0' && str [ i ] != '1' ) oneSeen = 0;
}
return count;
}
i - 1 ] == '0' ) count ++;
if ( str [ i ] == '1' && oneSeen == 0 ) {
oneSeen = 1;
continue;
}
if ( str [ i ] != '0' && str [ i ] != '1' ) oneSeen = 0;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"1001ab010abc01001","1001010001","010100010100","DLCu","7072430592","011","pnJpypYOza","1037","111","HxK"};
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 [MASK] { int len = str . size ( ); bool oneSeen = 0; int count = 0; for ( int i = 0; i < len; i ++ ) { if ( str [ i ] == '1' && oneSeen == 1 ) if ( str [ i - 1 ] == '0' ) count ++; if ( str [ i ] == '1' && oneSeen == 0 ) { oneSeen = 1; continue; } if ( str [ i ] != '0' && str [ i ] != '1' ) oneSeen = 0; } return count; }i - 1 ] == '0' ) count ++;
if ( str [ i ] == '1' && oneSeen == 0 ) {
oneSeen = 1;
continue;
}
if ( str [ i ] != '0' && str [ i ] != '1' ) oneSeen = 0;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"1001ab010abc01001","1001010001","010100010100","DLCu","7072430592","011","pnJpypYOza","1037","111","HxK"};
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) return",
"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 arr [ n ] [ n ];
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n;
j ++ ) arr [ i ] [ j ] = abs ( i - j );
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n;
j ++ ) sum += arr [ i ] [ j ];
return sum;
}
) for ( int j = 0;
j < n;
j ++ ) arr [ i ] [ j ] = abs ( i - j );
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n;
j ++ ) sum += arr [ i ] [ j ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,44,72,90,99,45,27,11,65,52};
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 arr [ n ] [ n ]; for ( int i = 0; i < n; i ++ ) for ( int j = 0; j < n; j ++ ) arr [ i ] [ j ] = abs ( i - j ); [MASK] sum = 0; for ( int i = 0; i < n; i ++ ) for ( int j = 0; j < n; j ++ ) sum += arr [ i ] [ j ]; return sum; }) for ( int j = 0;
j < n;
j ++ ) arr [ i ] [ j ] = abs ( i - j );
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n;
j ++ ) sum += arr [ i ] [ j ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,44,72,90,99,45,27,11,65,52};
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) int",
"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 arr [ ], int n, int k ) {
unordered_map < int, int > count_map;
for ( int i = 0;
i < n;
i ++ ) count_map [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( count_map [ arr [ i ] ] == k ) return arr [ i ];
return - 1;
}
< int, int > count_map;
for ( int i = 0;
i < n;
i ++ ) count_map [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( count_map [ arr [ i ] ] == k ) return arr [ i ];
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,4,4,7,18,20,23,27,30,31,31,32,35,36,43,45,46,49,50,53,55,59,60,64,64,65,68,78,80,80,85,95},{-26,32,36,6,64,24,-28,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{38,40,43,70,20,40,95,96,81,82},{-68,-8,-8,16,24,54},{1,0,1,0,0,0,1,0,1,0,0,0,1},{13,18,19,28,31,34,49,49,53,57,58,62,75,76,77,78,80,84,84,85,87,91,98,99},{-4,24,-86,-84,30,-16,12,-92,-68,22},{0,0,0,0,0,0,0,0,0,1,1,1,1},{55,44,75,97,25,65,76,53,20,78,25,59,61,29,81,35,15,78,41,44,31,33,39,93,26,67}};
vector<int> param1 {30,6,15,9,3,6,20,6,8,23};
vector<int> param2 {2,3,7,1,2,4,2,5,10,20};
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 [MASK] #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int k ) { unordered_map < int, int > count_map; for ( int i = 0; i < n; i ++ ) count_map [ arr [ i ] ] ++; for ( int i = 0; i < n; i ++ ) if ( count_map [ arr [ i ] ] == k ) return arr [ i ]; return - 1; } < int, int > count_map;
for ( int i = 0;
i < n;
i ++ ) count_map [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( count_map [ arr [ i ] ] == k ) return arr [ i ];
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,4,4,7,18,20,23,27,30,31,31,32,35,36,43,45,46,49,50,53,55,59,60,64,64,65,68,78,80,80,85,95},{-26,32,36,6,64,24,-28,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{38,40,43,70,20,40,95,96,81,82},{-68,-8,-8,16,24,54},{1,0,1,0,0,0,1,0,1,0,0,0,1},{13,18,19,28,31,34,49,49,53,57,58,62,75,76,77,78,80,84,84,85,87,91,98,99},{-4,24,-86,-84,30,-16,12,-92,-68,22},{0,0,0,0,0,0,0,0,0,1,1,1,1},{55,44,75,97,25,65,76,53,20,78,25,59,61,29,81,35,15,78,41,44,31,33,39,93,26,67}};
vector<int> param1 {30,6,15,9,3,6,20,6,8,23};
vector<int> param2 {2,3,7,1,2,4,2,5,10,20};
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;
} | <fstream> | [
"a) ;",
"b) <fstream>",
"c) i",
"d) n",
"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 num1, string num2 ) {
int len1 = num1 . size ( );
int len2 = num2 . size ( );
if ( len1 == 0 || len2 == 0 ) return "0";
vector < int > result ( len1 + len2, 0 );
int i_n1 = 0;
int i_n2 = 0;
for ( int i = len1 - 1;
i >= 0;
i -- ) {
int carry = 0;
int n1 = num1 [ i ] - '0';
i_n2 = 0;
for ( int j = len2 - 1;
j >= 0;
j -- ) {
int n2 = num2 [ j ] - '0';
int sum = n1 * n2 + result [ i_n1 + i_n2 ] + carry;
carry = sum / 10;
result [ i_n1 + i_n2 ] = sum % 10;
i_n2 ++;
}
if ( carry > 0 ) result [ i_n1 + i_n2 ] += carry;
i_n1 ++;
}
int i = result . size ( ) - 1;
while ( i >= 0 && result [ i ] == 0 ) i --;
if ( i == - 1 ) return "0";
string s = "";
while ( i >= 0 ) s += std :: to_string ( result [ i -- ] );
return s;
}
i = result . size ( ) - 1;
while ( i >= 0 && result [ i ] == 0 ) i --;
if ( i == - 1 ) return "0";
string s = "";
while ( i >= 0 ) s += std :: to_string ( result [ i -- ] );
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"OaITtzE","88111031","1100111","eiWPbMrFx","43701248","100001111110","jVgOapMp","68337672","00110101","JqSh"};
vector<string> param1 {"RnYlJUqzk","558471","11111110111101","tBAJaI","4027","11","Xm","56939","1","iAfjQRwuVyost"};
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 num1, string num2 ) { int len1 = num1 . size ( ); int len2 = num2 . size [MASK] ); if ( len1 == 0 || len2 == 0 ) return "0"; vector < int > result ( len1 + len2, 0 ); int i_n1 = 0; int i_n2 = 0; for ( int i = len1 - 1; i >= 0; i -- ) { int carry = 0; int n1 = num1 [ i ] - '0'; i_n2 = 0; for ( int j = len2 - 1; j >= 0; j -- ) { int n2 = num2 [ j ] - '0'; int sum = n1 * n2 + result [ i_n1 + i_n2 ] + carry; carry = sum / 10; result [ i_n1 + i_n2 ] = sum % 10; i_n2 ++; } if ( carry > 0 ) result [ i_n1 + i_n2 ] += carry; i_n1 ++; } int i = result . size ( ) - 1; while ( i >= 0 && result [ i ] == 0 ) i --; if ( i == - 1 ) return "0"; string s = ""; while ( i >= 0 ) s += std :: to_string ( result [ i -- ] ); return s; } i = result . size ( ) - 1;
while ( i >= 0 && result [ i ] == 0 ) i --;
if ( i == - 1 ) return "0";
string s = "";
while ( i >= 0 ) s += std :: to_string ( result [ i -- ] );
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"OaITtzE","88111031","1100111","eiWPbMrFx","43701248","100001111110","jVgOapMp","68337672","00110101","JqSh"};
vector<string> param1 {"RnYlJUqzk","558471","11111110111101","tBAJaI","4027","11","Xm","56939","1","iAfjQRwuVyost"};
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) x,",
"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 n ) {
int i = 0;
int ans = 0;
while ( ( 1 << i ) <= n ) {
bool k = 0;
int change = 1 << i;
for ( int j = 0;
j <= n;
j ++ ) {
ans += k;
if ( change == 1 ) {
k = ! k;
change = 1 << i;
}
else {
change --;
}
}
i ++;
}
return ans;
}
0;
j <= n;
j ++ ) {
ans += k;
if ( change == 1 ) {
k = ! k;
change = 1 << i;
}
else {
change --;
}
}
i ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {90,56,43,31,77,35,43,66,15,95};
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 n ) { int i = 0; int ans = 0; while ( ( 1 << i ) <= n ) { bool k = 0; int change = 1 << i; for ( int j = 0; j <= n; j ++ ) { ans += k; if ( change == 1 ) { k = ! k; change = 1 << i; } else { change --; } } i ++; } return ans; }0;
j <= n;
j ++ ) {
ans += k;
if ( change == 1 ) {
k = ! k;
change = 1 << i;
}
else {
change --;
}
}
i ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {90,56,43,31,77,35,43,66,15,95};
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) #include",
"b) {",
"c) =",
"d) i",
"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 ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
int res = 0;
for ( auto x : mp ) res = max ( res, x . second );
return res;
}
nt arr [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
int res = 0;
for ( auto x : mp ) res = max ( res, x . second );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,9,12,15,19,21,23,24,24,25,27,29,35,36,37,41,44,44,47,48,51,56,59,59,59,60,64,64,66,67,68,68,69,73,74,77,78,81,82,83,85,89,94,95,96,98,99},{96,20,-40,74,-44,98,-24,92,58,-84,-76,-14,64,-2,-84,52,-8,38,-26,-10,-62,-30,-76,58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{35,16,42,3,57,70,4,31,93,60,98,97,81,57,62,98,88,51,5,58,48,14,58,22,40,26,66,41,9,78,62,32,79,88,65,75,80,12,15,93,92,13,83,26},{-62,-44,-36,-18,-16,-6,4,14,22,42,68,90},{1,0,1,0,1,1,1,1,0,1,0,1,0,0,0,0},{20,25,27,29,47,47,49,53,59,66,74,82,86,86,94,94,97},{92,50,76,46,14,40,22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{8,82,92,42,55,4,94,73,57,7,21,71,68,97}};
vector<int> param1 {30,20,31,37,11,12,13,3,27,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 ) { unordered_map < int, int > mp; for ( int i = 0; i < n; i ++ ) mp [ arr [ i ] [MASK] ++; int res = 0; for ( auto x : mp ) res = max ( res, x . second ); return res; }nt arr [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
int res = 0;
for ( auto x : mp ) res = max ( res, x . second );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,9,12,15,19,21,23,24,24,25,27,29,35,36,37,41,44,44,47,48,51,56,59,59,59,60,64,64,66,67,68,68,69,73,74,77,78,81,82,83,85,89,94,95,96,98,99},{96,20,-40,74,-44,98,-24,92,58,-84,-76,-14,64,-2,-84,52,-8,38,-26,-10,-62,-30,-76,58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{35,16,42,3,57,70,4,31,93,60,98,97,81,57,62,98,88,51,5,58,48,14,58,22,40,26,66,41,9,78,62,32,79,88,65,75,80,12,15,93,92,13,83,26},{-62,-44,-36,-18,-16,-6,4,14,22,42,68,90},{1,0,1,0,1,1,1,1,0,1,0,1,0,0,0,0},{20,25,27,29,47,47,49,53,59,66,74,82,86,86,94,94,97},{92,50,76,46,14,40,22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{8,82,92,42,55,4,94,73,57,7,21,71,68,97}};
vector<int> param1 {30,20,31,37,11,12,13,3,27,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) java.util.",
"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 arr [ ], int n, int k ) {
int result = INT_MAX;
sort ( arr, arr + n );
for ( int i = 0;
i <= n - k;
i ++ ) result = min ( result, arr [ i + k - 1 ] - arr [ i ] );
return result;
}
int arr [ ], int n, int k ) {
int result = INT_MAX;
sort ( arr, arr + n );
for ( int i = 0;
i <= n - k;
i ++ ) result = min ( result, arr [ i + k - 1 ] - arr [ i ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,7,8,14,16,20,20,23,24,24,29,30,32,34,35,37,38,43,44,46,50,52,55,57,61,71,79,86,86,89,91,91,95},{78,-4,76,0,-62,54,-70,62,90,-80,-68,90,-34,-66,-46,34,-18,-74,-66,34,34,-28,6,80,58,-50,-60,54,8,-52,-60,68,42,16,42,72,54,88,44,46,84,-34},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{32},{-96,-78,-76,-72,-72,-70,-54,-46,-40,-34,-30,-26,-24,-22,-18,-16,-6,-4,-4,2,6,14,16,18,30,30,36,54,54,58,66,72,78,80,80,82,88,98},{0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,0,1},{3,13,14,18,23,32,67,72,75,76,87,95},{8,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{31,15,19,41,73,29,67,36,87,74,95,27,36,83,37,33,30,86,94,93,9,42,3,95,3,69,67,63,16,53,35,52,2,57,57,25,21,7,72,52,78,40}};
vector<int> param1 {33,33,8,0,26,39,10,1,27,36};
vector<int> param2 {17,33,13,0,25,41,8,1,33,37};
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 k ) { int result = INT_MAX; sort ( arr, arr + n ); for ( int i = 0; i <= n - k; i ++ ) result = [MASK] ( result, arr [ i + k - 1 ] - arr [ i ] ); return result; } int arr [ ], int n, int k ) {
int result = INT_MAX;
sort ( arr, arr + n );
for ( int i = 0;
i <= n - k;
i ++ ) result = min ( result, arr [ i + k - 1 ] - arr [ i ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,7,8,14,16,20,20,23,24,24,29,30,32,34,35,37,38,43,44,46,50,52,55,57,61,71,79,86,86,89,91,91,95},{78,-4,76,0,-62,54,-70,62,90,-80,-68,90,-34,-66,-46,34,-18,-74,-66,34,34,-28,6,80,58,-50,-60,54,8,-52,-60,68,42,16,42,72,54,88,44,46,84,-34},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{32},{-96,-78,-76,-72,-72,-70,-54,-46,-40,-34,-30,-26,-24,-22,-18,-16,-6,-4,-4,2,6,14,16,18,30,30,36,54,54,58,66,72,78,80,80,82,88,98},{0,1,1,1,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,1,1,1,0,1,0,1,1,1,0,0,0,0,1,1,0,1,1,0,1,1,0,0,1},{3,13,14,18,23,32,67,72,75,76,87,95},{8,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{31,15,19,41,73,29,67,36,87,74,95,27,36,83,37,33,30,86,94,93,9,42,3,95,3,69,67,63,16,53,35,52,2,57,57,25,21,7,72,52,78,40}};
vector<int> param1 {33,33,8,0,26,39,10,1,27,36};
vector<int> param2 {17,33,13,0,25,41,8,1,33,37};
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;
} | min | [
"a) +=",
"b) string",
"c) min",
"d) n)",
"e) sort"
] | 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 ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
int ans = 0;
for ( auto it = mp . begin ( );
it != mp . end ( );
it ++ ) {
int count = it -> second;
ans += ( count * ( count - 1 ) ) / 2;
}
return ans;
}
mp [ arr [ i ] ] ++;
int ans = 0;
for ( auto it = mp . begin ( );
it != mp . end ( );
it ++ ) {
int count = it -> second;
ans += ( count * ( count - 1 ) ) / 2;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,11,18,22,40,46,50,51,53,55,64,67,73,78,86},{14,-98,98,58,-82,90,-80,-56,-30,-36,-56,-30,-58,68,72,-76,38,-90,-72,4,-32,32,-28,2,12,-72,54,2,0,-74,8,12,46,72,-84,-66,70,18,26,72,-26,44,-8,20,-32,-56,28},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{93,23,62,64,31,78,99},{-94,-94,-92,-86,-84,-76,-76,-68,-66,-56,-56,-54,-50,-46,-38,-34,-34,-30,-26,-18,-16,2,8,42,52,54,56,64,68,82,82,82,94,96,98},{0},{3,18,18,20,21,23,24,27,35,36,38,40,46,50,50,51,52,53,59,61,63,63,65,66,68,68,70,71,74,75,96,98},{-68,40,16,50,36,42,-20,-46,-92,4,-18,-12,48,0,-46,64,-74,-50,42,44,-56,28,-10,78,62,70,-60,12,-44,-78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{31,5}};
vector<int> param1 {14,24,13,4,19,0,19,23,30,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 ) { unordered_map < int, int > mp; for ( int i = 0; i < n; i ++ ) mp [ arr [ i ] ] ++; int ans = 0; for ( auto it = mp . begin ( ); it != mp . end ( ); it ++ ) { int count = it -> second; ans += ( [MASK] * ( count - 1 ) ) / 2; } return ans; } mp [ arr [ i ] ] ++;
int ans = 0;
for ( auto it = mp . begin ( );
it != mp . end ( );
it ++ ) {
int count = it -> second;
ans += ( count * ( count - 1 ) ) / 2;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,11,18,22,40,46,50,51,53,55,64,67,73,78,86},{14,-98,98,58,-82,90,-80,-56,-30,-36,-56,-30,-58,68,72,-76,38,-90,-72,4,-32,32,-28,2,12,-72,54,2,0,-74,8,12,46,72,-84,-66,70,18,26,72,-26,44,-8,20,-32,-56,28},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{93,23,62,64,31,78,99},{-94,-94,-92,-86,-84,-76,-76,-68,-66,-56,-56,-54,-50,-46,-38,-34,-34,-30,-26,-18,-16,2,8,42,52,54,56,64,68,82,82,82,94,96,98},{0},{3,18,18,20,21,23,24,27,35,36,38,40,46,50,50,51,52,53,59,61,63,63,65,66,68,68,70,71,74,75,96,98},{-68,40,16,50,36,42,-20,-46,-92,4,-18,-12,48,0,-46,64,-74,-50,42,44,-56,28,-10,78,62,70,-60,12,-44,-78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{31,5}};
vector<int> param1 {14,24,13,4,19,0,19,23,30,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;
} | count | [
"a) )",
"b) <string>",
"c) count",
"d) x,",
"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 x ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97},{-24,-78,-32,-48,0,4,-42},{0,0,0,0,0,0,0,1,1,1,1},{38,14,75,16,91,11,98,43,67,9,21,10,82,72,32,81,48,60,2,91,10,90,12,83},{-92,-92,-82,-80,-76,-66,-64,-64,-56,-48,-38,-38,-34,-32,-32,-10,-8,-6,-2,0,8,10,18,20,22,22,30,34,38,38,38,44,50,52,56,64,64,66,70,76,88},{0,1,1,0,0,1,1,0,0,0,1,1,1,1},{1,4,4,4,4,8,12,13,14,14,22,25,25,27,29,33,36,38,40,40,40,41,47,47,47,48,48,50,51,52,52,52,55,56,59,59,62,64,66,77,82,84,90,91,91,93},{-90,-60,-58,-72,92,54,-32,-70,-94,18,64,-90,-90,-56,82,-14,-74,-96,-90,-8,-48,76,-28,10,-52,-8,-46,-32,82,46,58,92,4,48,-96,-66,60,60,62,-68},{0,0,0,0,0,0,1,1,1,1},{42,17,77,96,72,36,74,97,7,94,80,7,27,58,49,81,51,9}};
vector<int> param1 {17,4,6,17,25,11,38,22,8,16};
vector<int> param2 {5,0,0,75,25,-1,4,22,8,11};
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; for ( i = 0; i [MASK] n; i ++ ) { if ( arr [ i ] == x ) return i; } return - 1; }omanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,5,11,13,14,15,19,22,22,23,26,29,29,36,44,48,49,65,65,67,68,70,76,79,79,81,85,88,91,91,92,92,97},{-24,-78,-32,-48,0,4,-42},{0,0,0,0,0,0,0,1,1,1,1},{38,14,75,16,91,11,98,43,67,9,21,10,82,72,32,81,48,60,2,91,10,90,12,83},{-92,-92,-82,-80,-76,-66,-64,-64,-56,-48,-38,-38,-34,-32,-32,-10,-8,-6,-2,0,8,10,18,20,22,22,30,34,38,38,38,44,50,52,56,64,64,66,70,76,88},{0,1,1,0,0,1,1,0,0,0,1,1,1,1},{1,4,4,4,4,8,12,13,14,14,22,25,25,27,29,33,36,38,40,40,40,41,47,47,47,48,48,50,51,52,52,52,55,56,59,59,62,64,66,77,82,84,90,91,91,93},{-90,-60,-58,-72,92,54,-32,-70,-94,18,64,-90,-90,-56,82,-14,-74,-96,-90,-8,-48,76,-28,10,-52,-8,-46,-32,82,46,58,92,4,48,-96,-66,60,60,62,-68},{0,0,0,0,0,0,1,1,1,1},{42,17,77,96,72,36,74,97,7,94,80,7,27,58,49,81,51,9}};
vector<int> param1 {17,4,6,17,25,11,38,22,8,16};
vector<int> param2 {5,0,0,75,25,-1,4,22,8,11};
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) <stdio.h>",
"b) arr_size",
"c) f2",
"d) <",
"e) %d\","
] | d |
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 ) {
unordered_set < int > us;
for ( int i = 0;
i < n;
i ++ ) us . insert ( arr [ i ] );
int count = 1;
int curr_ele = arr [ 0 ] - 1;
while ( us . find ( curr_ele ) != us . end ( ) ) {
count ++;
curr_ele --;
}
curr_ele = arr [ 0 ] + 1;
while ( us . find ( curr_ele ) != us . end ( ) ) {
count ++;
curr_ele ++;
}
return ( count == ( int ) ( us . size ( ) ) );
}
ount ++;
curr_ele --;
}
curr_ele = arr [ 0 ] + 1;
while ( us . find ( curr_ele ) != us . end ( ) ) {
count ++;
curr_ele ++;
}
return ( count == ( int ) ( us . size ( ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,19,38,59,71},{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76},{0,0,1,1,1},{40,38,17,50,16,35,34,23,3,12,97,53,75,36,3,73,99,11,70,9,23,3,11,9,64,44,62,94,55,69,44,59,57,99,69,12,27,42,14,83,53,4,4},{-78,-36,-28,-16,-8,-4,4,4,10,14,30,30,32,32,38,46,54,72},{1,0,1,0,0,1,1,0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1},{7,32,54,70,79,88},{-38,48,-96,-84,10,70,-28,-66,40,-26,-24,-8,28,-6,6,-14,-2,-58,-6,-14,-58,-74,20,32,98,-24,-10,42,-4,-96,-56,-40,74,-98,-86,-94,12,80,10,-54,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1},{49,87,18,19,56,25,64,94,43,97,74,79,13,36,72,46,10,84,2,11,41,87,55,38,89,92,65,57,62,16}};
vector<int> param1 {3,26,4,26,16,38,5,30,12,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; bool f_gold ( int arr [ ], int n ) { unordered_set < int > us; for ( int i = 0; i < n; i ++ ) us . insert ( arr [ i ] ); int count = 1; int curr_ele = arr [ 0 ] - 1; while ( us . find ( curr_ele ) != us . end ( ) ) { count ++; curr_ele --; } curr_ele = arr [ 0 ] + 1; while ( us . find ( curr_ele ) != us . end ( ) ) { count ++; curr_ele ++; } return ( count [MASK] ( int ) ( us . size ( ) ) ); }ount ++;
curr_ele --;
}
curr_ele = arr [ 0 ] + 1;
while ( us . find ( curr_ele ) != us . end ( ) ) {
count ++;
curr_ele ++;
}
return ( count == ( int ) ( us . size ( ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,19,38,59,71},{-20,66,-22,-56,-6,94,70,-80,24,-26,-58,-76,-20,-8,-62,18,-56,-20,42,-40,-88,-74,64,-26,-92,66,-18,-64,66,12,24,-8,78,-82,14,-76},{0,0,1,1,1},{40,38,17,50,16,35,34,23,3,12,97,53,75,36,3,73,99,11,70,9,23,3,11,9,64,44,62,94,55,69,44,59,57,99,69,12,27,42,14,83,53,4,4},{-78,-36,-28,-16,-8,-4,4,4,10,14,30,30,32,32,38,46,54,72},{1,0,1,0,0,1,1,0,0,1,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,1,1,1,0,1,1,0,1,1},{7,32,54,70,79,88},{-38,48,-96,-84,10,70,-28,-66,40,-26,-24,-8,28,-6,6,-14,-2,-58,-6,-14,-58,-74,20,32,98,-24,-10,42,-4,-96,-56,-40,74,-98,-86,-94,12,80,10,-54,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1},{49,87,18,19,56,25,64,94,43,97,74,79,13,36,72,46,10,84,2,11,41,87,55,38,89,92,65,57,62,16}};
vector<int> param1 {3,26,4,26,16,38,5,30,12,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) }",
"b) 0.0246",
"c) =",
"d) ==",
"e) yCount"
] | 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 price [ ], int n, int k ) {
int profit [ k + 1 ] [ n + 1 ];
for ( int i = 0;
i <= k;
i ++ ) profit [ i ] [ 0 ] = 0;
for ( int j = 0;
j <= n;
j ++ ) profit [ 0 ] [ j ] = 0;
for ( int i = 1;
i <= k;
i ++ ) {
for ( int j = 1;
j < n;
j ++ ) {
int max_so_far = INT_MIN;
for ( int m = 0;
m < j;
m ++ ) max_so_far = max ( max_so_far, price [ j ] - price [ m ] + profit [ i - 1 ] [ m ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], max_so_far );
}
}
return profit [ k ] [ n - 1 ];
}
so_far = max ( max_so_far, price [ j ] - price [ m ] + profit [ i - 1 ] [ m ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], max_so_far );
}
}
return profit [ k ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,9,11,18,27,46,49,60,70,83,96},{44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{53,72,2,6,99,56,73,2,72,14,23,5,66,73,45,38,96,35,75,48,73,68,41,53,10,18,95,68,48,70,87,53,95,26,35,37,56,35,93,3,44,38,3,16,62,63,21,65},{-98,-92,-84,-80,-78,-74,-56,-54,-52,-48,-48,-30,-26,-20,-16,-12,-10,-8,-2,0,8,26,34,36,44,46,48,56,60,60,66,68,72,72,78,80,84,84,94,96},{1,1,1,0,1,0,1,1,0,1,0,1,0},{3,3,7,8,9,13,14,14,18,19,20,22,23,23,24,25,27,30,33,34,34,35,39,40,41,43,43,47,48,50,54,55,59,64,68,70,74,74,74,76,90,90,91,94,94,94,96,99},{78,78,-12,32,-12,-12,-4,-8,12,60,12,-74,-52,-60,-62,76,12,24,32,-6,-70,-34,-44,50,62,-52,-32,18,44,-74,18,94,78,-44,-90,-32,44,-72,28,-34,56,98,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,81,12,65}};
vector<int> param1 {10,0,18,47,30,11,24,40,44,2};
vector<int> param2 {10,0,22,25,23,8,26,24,24,2};
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 price [ ], int n, int k ) { int profit [ k + 1 ] [ n + 1 ]; for ( int i = 0; i <= k; i ++ ) profit [ i ] [ 0 ] = 0; for ( int j = 0; j <= n; j ++ [MASK] profit [ 0 ] [ j ] = 0; for ( int i = 1; i <= k; i ++ ) { for ( int j = 1; j < n; j ++ ) { int max_so_far = INT_MIN; for ( int m = 0; m < j; m ++ ) max_so_far = max ( max_so_far, price [ j ] - price [ m ] + profit [ i - 1 ] [ m ] ); profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], max_so_far ); } } return profit [ k ] [ n - 1 ]; }so_far = max ( max_so_far, price [ j ] - price [ m ] + profit [ i - 1 ] [ m ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], max_so_far );
}
}
return profit [ k ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,9,11,18,27,46,49,60,70,83,96},{44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{53,72,2,6,99,56,73,2,72,14,23,5,66,73,45,38,96,35,75,48,73,68,41,53,10,18,95,68,48,70,87,53,95,26,35,37,56,35,93,3,44,38,3,16,62,63,21,65},{-98,-92,-84,-80,-78,-74,-56,-54,-52,-48,-48,-30,-26,-20,-16,-12,-10,-8,-2,0,8,26,34,36,44,46,48,56,60,60,66,68,72,72,78,80,84,84,94,96},{1,1,1,0,1,0,1,1,0,1,0,1,0},{3,3,7,8,9,13,14,14,18,19,20,22,23,23,24,25,27,30,33,34,34,35,39,40,41,43,43,47,48,50,54,55,59,64,68,70,74,74,74,76,90,90,91,94,94,94,96,99},{78,78,-12,32,-12,-12,-4,-8,12,60,12,-74,-52,-60,-62,76,12,24,32,-6,-70,-34,-44,50,62,-52,-32,18,44,-74,18,94,78,-44,-90,-32,44,-72,28,-34,56,98,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,81,12,65}};
vector<int> param1 {10,0,18,47,30,11,24,40,44,2};
vector<int> param2 {10,0,22,25,23,8,26,24,24,2};
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) )",
"c) {",
"d) DIVISIBILITY_BY_7{",
"e) if"
] | 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 min_prefix_sum = 0;
int res = numeric_limits < int > :: min ( );
int prefix_sum [ n ];
prefix_sum [ 0 ] = arr [ 0 ];
for ( int i = 1;
i < n;
i ++ ) prefix_sum [ i ] = prefix_sum [ i - 1 ] + arr [ i ];
for ( int i = 0;
i < n;
i ++ ) {
res = max ( res, prefix_sum [ i ] - min_prefix_sum );
min_prefix_sum = min ( min_prefix_sum, prefix_sum [ i ] );
}
return res;
}
1 ] + arr [ i ];
for ( int i = 0;
i < n;
i ++ ) {
res = max ( res, prefix_sum [ i ] - min_prefix_sum );
min_prefix_sum = min ( min_prefix_sum, prefix_sum [ i ] );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,9,11,17,18,19,23,24,27,30,31,31,35,44,46,47,49,51,55,58,59,61,65,67,71,71,71,71,78,78,82,91,98},{-82,-28,-66,-52,-36,36,-88,52,-62,46,42,26,-60,18,-52,38,94,-68,44,-94,14,36,-70},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,36,42,42,5,52,74,86,55,82,59,81,4,90,24,34,20,99,86,25,52,48,62,5,67,83,60,72,80,73,38,55,8,70,95},{-92,-52,-24,36,56},{0,1,1,1,0,1,0,1,0,0,1,1,0,1,1,0,0,0},{1,1,4,4,7,7,17,18,20,26,26,32,37,38,42,44,44,46,50,53,57,58,58,60,61,61,64,74,75,77,83,83,84,84,85,87,88,90,95,96,97,98,99,99},{-86,2,26,54,-16,16,48,24,50,-10,-32,-62,48,-12,-66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{58,14,79,11,31,28,61,86,25,27,75,78,32,55,86,48,15,51,6,78,23,82,16,62,35,51,91,16,79,38,97,30,23,58,95,57,82,35,57,43,22,41,58,69,25,65,13,79}};
vector<int> param1 {20,15,19,19,3,13,25,13,14,39};
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> [MASK] <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int min_prefix_sum = 0; int res = numeric_limits < int > :: min ( ); int prefix_sum [ n ]; prefix_sum [ 0 ] = arr [ 0 ]; for ( int i = 1; i < n; i ++ ) prefix_sum [ i ] = prefix_sum [ i - 1 ] + arr [ i ]; for ( int i = 0; i < n; i ++ ) { res = max ( res, prefix_sum [ i ] - min_prefix_sum ); min_prefix_sum = min ( min_prefix_sum, prefix_sum [ i ] ); } return res; }1 ] + arr [ i ];
for ( int i = 0;
i < n;
i ++ ) {
res = max ( res, prefix_sum [ i ] - min_prefix_sum );
min_prefix_sum = min ( min_prefix_sum, prefix_sum [ i ] );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,9,11,17,18,19,23,24,27,30,31,31,35,44,46,47,49,51,55,58,59,61,65,67,71,71,71,71,78,78,82,91,98},{-82,-28,-66,-52,-36,36,-88,52,-62,46,42,26,-60,18,-52,38,94,-68,44,-94,14,36,-70},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,36,42,42,5,52,74,86,55,82,59,81,4,90,24,34,20,99,86,25,52,48,62,5,67,83,60,72,80,73,38,55,8,70,95},{-92,-52,-24,36,56},{0,1,1,1,0,1,0,1,0,0,1,1,0,1,1,0,0,0},{1,1,4,4,7,7,17,18,20,26,26,32,37,38,42,44,44,46,50,53,57,58,58,60,61,61,64,74,75,77,83,83,84,84,85,87,88,90,95,96,97,98,99,99},{-86,2,26,54,-16,16,48,24,50,-10,-32,-62,48,-12,-66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{58,14,79,11,31,28,61,86,25,27,75,78,32,55,86,48,15,51,6,78,23,82,16,62,35,51,91,16,79,38,97,30,23,58,95,57,82,35,57,43,22,41,58,69,25,65,13,79}};
vector<int> param1 {20,15,19,19,3,13,25,13,14,39};
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) 3",
"c) +",
"d) res",
"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 ar [ ], int ar_size ) {
int res = 0;
for ( int i = 0;
i < ar_size;
i ++ ) res = res ^ ar [ i ];
return res;
}
ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int ar [ ], int ar_size ) {
int res = 0;
for ( int i = 0;
i < ar_size;
i ++ ) res = res ^ ar [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,7,10,12,19,20,22,23,25,27,32,33,39,43,44,45,46,47,47,48,49,50,51,55,58,68,69,73,76,77,79,81,84,92,95,99},{-12,-40,-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,1,1,1},{86,56,98,58,7,40,84,45,69,77,36,50,72,99,95},{-90,-68,-66,-66,-58,-54,-52,-48,-40,-30,-26,-24,-20,-14,-10,-8,-6,-6,-6,18,30,34,36,42,50,56,64,68,70,74,92,92,98},{0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,1,0,1,0,1,1,1,1,0,0,1,0,0,0},{3,21,47,51,78,84,84,85,86,99},{-26,-72,44,62,-22,22,28,-28,32,-72,72,96,92,-52,-2,-22,-76,-88,-74,-8,-30,54,0,-62,14,-92,-58,72,40,46,96,86,-54,-92,46,92,20,-96,-92,-70,-94,78,-92,-54,-90},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,1,12,81,78,18,81,47,49,19,99,40,52,47,71,69,80,72,66,84,72,6,98,89,3,87,81,85,37,14,5,36,26,74}};
vector<int> param1 {36,2,21,9,26,27,9,33,9,22};
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 ar [ ], int ar_size ) { int res = 0; for ( int i = 0; i < ar_size; i ++ ) res = res ^ ar [ i ]; return res; }ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int ar [ ], int ar_size ) {
int res = 0;
for ( int i = 0;
i < ar_size;
i ++ ) res = res ^ ar [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,7,10,12,19,20,22,23,25,27,32,33,39,43,44,45,46,47,47,48,49,50,51,55,58,68,69,73,76,77,79,81,84,92,95,99},{-12,-40,-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,1,1,1},{86,56,98,58,7,40,84,45,69,77,36,50,72,99,95},{-90,-68,-66,-66,-58,-54,-52,-48,-40,-30,-26,-24,-20,-14,-10,-8,-6,-6,-6,18,30,34,36,42,50,56,64,68,70,74,92,92,98},{0,0,1,0,0,0,1,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,1,1,0,1,0,1,1,1,1,0,0,1,0,0,0},{3,21,47,51,78,84,84,85,86,99},{-26,-72,44,62,-22,22,28,-28,32,-72,72,96,92,-52,-2,-22,-76,-88,-74,-8,-30,54,0,-62,14,-92,-58,72,40,46,96,86,-54,-92,46,92,20,-96,-92,-70,-94,78,-92,-54,-90},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,1,12,81,78,18,81,47,49,19,99,40,52,47,71,69,80,72,66,84,72,6,98,89,3,87,81,85,37,14,5,36,26,74}};
vector<int> param1 {36,2,21,9,26,27,9,33,9,22};
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) [",
"b) using",
"c) (",
"d) {return",
"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 n, int a [ ] ) {
return n * ( a [ 0 ] * a [ 0 ] - a [ 2 * n - 1 ] * a [ 2 * n - 1 ] ) / ( 2 * n - 1 );
}
stream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int a [ ] ) {
return n * ( a [ 0 ] * a [ 0 ] - a [ 2 * n - 1 ] * a [ 2 * n - 1 ] ) / ( 2 * n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,23,15,25,21,26,23,27,15,18};
vector<vector<int>> param1 {{2,3,5,12,17,25,73,88},{60,-90,-84,-46,-12,0,-92,38,-14,80,88,-70,56,58,56,-68,-56,70,-34,-22,-40,-48,-56,46,-26,-50,-68,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{81,93,12,83,37,63,60,89,40,32,78,54,63,76,76,77,50,2,53,82,50,46,5,49,37,67,77,16,95,84,6,66,1,16,10},{-98,-92,-90,-82,-68,-62,-30,-28,-10,-8,-2,-2,-2,8,16,20,28,30,38,42,50,52,62,82,86,86,96,96},{0,0,1,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,1,0,1,1,0},{5,9,15,18,18,22,22,26,27,34,52,55,59,59,68,71,71,73,78,81,82,85,86,91,97,98},{-30,28,74,92,-54,-52,-66,-40,-60,-70,-68,68,-36,-36,-52,-90,82,34,-96,90,-96,56,84,24,-78,-50,32,-96,82,8,54,-44,88,-70,80,26,72,-98,16,-32,-86,-20,24,88,-50},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,99,24,86,84,17,41,87,68,34,17,70,23,84,74,4,78,84,83,48,75,9,73,99,81,84,54,2,23,11,8,61,30}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front()) == f_gold(param0[i],¶m1[i].front()))
{
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 a [ ] ) { return n * ( a [ 0 ] [MASK] a [ 0 ] - a [ 2 * n - 1 ] * a [ 2 * n - 1 ] ) / ( 2 * n - 1 ); }stream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int a [ ] ) {
return n * ( a [ 0 ] * a [ 0 ] - a [ 2 * n - 1 ] * a [ 2 * n - 1 ] ) / ( 2 * n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,23,15,25,21,26,23,27,15,18};
vector<vector<int>> param1 {{2,3,5,12,17,25,73,88},{60,-90,-84,-46,-12,0,-92,38,-14,80,88,-70,56,58,56,-68,-56,70,-34,-22,-40,-48,-56,46,-26,-50,-68,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{81,93,12,83,37,63,60,89,40,32,78,54,63,76,76,77,50,2,53,82,50,46,5,49,37,67,77,16,95,84,6,66,1,16,10},{-98,-92,-90,-82,-68,-62,-30,-28,-10,-8,-2,-2,-2,8,16,20,28,30,38,42,50,52,62,82,86,86,96,96},{0,0,1,1,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,0,0,1,0,0,0,1,1,1,1,0,1,0,0,1,1,0,1,1,0,1,1,0},{5,9,15,18,18,22,22,26,27,34,52,55,59,59,68,71,71,73,78,81,82,85,86,91,97,98},{-30,28,74,92,-54,-52,-66,-40,-60,-70,-68,68,-36,-36,-52,-90,82,34,-96,90,-96,56,84,24,-78,-50,32,-96,82,8,54,-44,88,-70,80,26,72,-98,16,-32,-86,-20,24,88,-50},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,99,24,86,84,17,41,87,68,34,17,70,23,84,74,4,78,84,83,48,75,9,73,99,81,84,54,2,23,11,8,61,30}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front()) == f_gold(param0[i],¶m1[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | * | [
"a) +=",
"b) int",
"c) -",
"d) *",
"e) i"
] | 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 C [ n + 1 ] [ n + 1 ];
int i, j;
for ( i = 0;
i <= n;
i ++ ) {
for ( j = 0;
j <= min ( i, n );
j ++ ) {
if ( j == 0 || j == i ) C [ i ] [ j ] = 1;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int sum = 0;
for ( int i = 0;
i <= n;
i ++ ) sum += ( C [ n ] [ i ] * C [ n ] [ i ] );
return sum;
}
= 1;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int sum = 0;
for ( int i = 0;
i <= n;
i ++ ) sum += ( C [ n ] [ i ] * C [ n ] [ i ] );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,44,19,24,64,60,57,22,15,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; int f_gold ( int n ) { int C [ n + 1 ] [ n + 1 ]; int i, j; for ( i = 0; i <= n; i ++ ) { for ( j = 0; j <= min ( i, n ); j ++ ) { if ( j == 0 [MASK] j == i ) C [ i ] [ j ] = 1; else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ]; } } int sum = 0; for ( int i = 0; i <= n; i ++ ) sum += ( C [ n ] [ i ] * C [ n ] [ i ] ); return sum; } = 1;
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int sum = 0;
for ( int i = 0;
i <= n;
i ++ ) sum += ( C [ n ] [ i ] * C [ n ] [ i ] );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,44,19,24,64,60,57,22,15,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;
} | || | [
"a) i",
"b) else",
"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 a, int b, int k ) {
int c1 = ( b - a ) - 1;
int c2 = ( k - b ) + ( a - 1 );
if ( c1 == c2 ) return 0;
return min ( c1, c2 );
}
include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, int k ) {
int c1 = ( b - a ) - 1;
int c2 = ( k - b ) + ( a - 1 );
if ( c1 == c2 ) return 0;
return min ( c1, c2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,3,11,50,40,62,40,66,6,25};
vector<int> param1 {98,39,96,67,16,86,78,11,9,5};
vector<int> param2 {86,87,30,48,32,76,71,74,19,5};
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 a, int b, int k ) { int c1 = ( b - a ) - 1; int c2 = ( k - b ) + ( a - 1 ); if ( c1 == c2 ) [MASK] 0; return min ( c1, c2 ); }include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, int k ) {
int c1 = ( b - a ) - 1;
int c2 = ( k - b ) + ( a - 1 );
if ( c1 == c2 ) return 0;
return min ( c1, c2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,3,11,50,40,62,40,66,6,25};
vector<int> param1 {98,39,96,67,16,86,78,11,9,5};
vector<int> param2 {86,87,30,48,32,76,71,74,19,5};
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;
} | return | [
"a) return",
"b) ]",
"c) ],",
"d) import",
"e) small"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( char arr [ ], int n, int k ) {
int res = 0;
vector < int > thi;
vector < int > pol;
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == 'P' ) pol . push_back ( i );
else if ( arr [ i ] == 'T' ) thi . push_back ( i );
}
int l = 0, r = 0;
while ( l < thi . size ( ) && r < pol . size ( ) ) {
if ( abs ( thi [ l ] - pol [ r ] ) <= k ) {
res ++;
l ++;
r ++;
}
else if ( thi [ l ] < pol [ r ] ) l ++;
else r ++;
}
return res;
}
&& r < pol . size ( ) ) {
if ( abs ( thi [ l ] - pol [ r ] ) <= k ) {
res ++;
l ++;
r ++;
}
else if ( thi [ l ] < pol [ r ] ) l ++;
else r ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'A','B','B','D','E','E','F','G','G','G','I','J','O','P','Q','Q','Q','Q','R','R','S','U','X','Y','Y','c','d','h','i','i','i','i','k','k','l','l','l','l','m','p','r','r','s','t','t','u','x','z'},{'7','6','0','1','0','1'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'y','k','S','i','s','r','i','z','y','f','E','U','y','G','f','f','s','v','v','D','v','V','S','D','K','S','f','V','g','I','J','p','j','k','R','n','m','O','L','X','y','U','y','k','w'},{'1','1','5','8','8'},{'0','1','0','0','1','1','1','0','0','0','1','0','1','0','1','0','0','0','0','0','1','0','0','0','0','1','1','1','0','0','0','0','0','0'},{'A','I','K','Q','Q','X','Z','f','g'},{'7','0','6','9','7','5','1','3','9','8','0','0','1','3','9','2','5','5','2','7','9','3','3','9','3','8','5','5','0','4','6','2','7','4','0','4','6','4','2','3'},{'0','0','0','1','1','1','1','1','1','1','1'},{'D','C','P','H','G','o','u','P','T','G','E','U','n','E','U'}};
vector<int> param1 {33,3,9,24,2,23,5,35,8,11};
vector<int> param2 {45,3,10,44,2,18,8,28,10,12};
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 [MASK] ( char arr [ ], int n, int k ) { int res = 0; vector < int > thi; vector < int > pol; for ( int i = 0; i < n; i ++ ) { if ( arr [ i ] == 'P' ) pol . push_back ( i ); else if ( arr [ i ] == 'T' ) thi . push_back ( i ); } int l = 0, r = 0; while ( l < thi . size ( ) && r < pol . size ( ) ) { if ( abs ( thi [ l ] - pol [ r ] ) <= k ) { res ++; l ++; r ++; } else if ( thi [ l ] < pol [ r ] ) l ++; else r ++; } return res; }&& r < pol . size ( ) ) {
if ( abs ( thi [ l ] - pol [ r ] ) <= k ) {
res ++;
l ++;
r ++;
}
else if ( thi [ l ] < pol [ r ] ) l ++;
else r ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'A','B','B','D','E','E','F','G','G','G','I','J','O','P','Q','Q','Q','Q','R','R','S','U','X','Y','Y','c','d','h','i','i','i','i','k','k','l','l','l','l','m','p','r','r','s','t','t','u','x','z'},{'7','6','0','1','0','1'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'y','k','S','i','s','r','i','z','y','f','E','U','y','G','f','f','s','v','v','D','v','V','S','D','K','S','f','V','g','I','J','p','j','k','R','n','m','O','L','X','y','U','y','k','w'},{'1','1','5','8','8'},{'0','1','0','0','1','1','1','0','0','0','1','0','1','0','1','0','0','0','0','0','1','0','0','0','0','1','1','1','0','0','0','0','0','0'},{'A','I','K','Q','Q','X','Z','f','g'},{'7','0','6','9','7','5','1','3','9','8','0','0','1','3','9','2','5','5','2','7','9','3','3','9','3','8','5','5','0','4','6','2','7','4','0','4','6','4','2','3'},{'0','0','0','1','1','1','1','1','1','1','1'},{'D','C','P','H','G','o','u','P','T','G','E','U','n','E','U'}};
vector<int> param1 {33,3,9,24,2,23,5,35,8,11};
vector<int> param2 {45,3,10,44,2,18,8,28,10,12};
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;
} | f_gold | [
"a) *;",
"b) if",
"c) f_gold",
"d) return",
"e) ["
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int a, int b ) {
double AM, GM, HM;
AM = ( a + b ) / 2;
GM = sqrt ( a * b );
HM = ( GM * GM ) / AM;
return HM;
}
e <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int a, int b ) {
double AM, GM, HM;
AM = ( a + b ) / 2;
GM = sqrt ( a * b );
HM = ( GM * GM ) / AM;
return HM;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {54,42,63,19,41,7,39,11,96,15};
vector<int> param1 {83,56,12,76,50,26,42,64,81,54};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i])) )/ (abs(f_filled(param0[i],param1[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 a, int b ) { double AM, GM, HM; AM = ( a + b ) / 2; GM = sqrt ( [MASK] * b ); HM = ( GM * GM ) / AM; return HM; }e <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int a, int b ) {
double AM, GM, HM;
AM = ( a + b ) / 2;
GM = sqrt ( a * b );
HM = ( GM * GM ) / AM;
return HM;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {54,42,63,19,41,7,39,11,96,15};
vector<int> param1 {83,56,12,76,50,26,42,64,81,54};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i])) )/ (abs(f_filled(param0[i],param1[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | a | [
"a) n",
"b) a",
"c) n",
"d) 3",
"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 ( int arr1 [ ], int arr2 [ ], int m, int n ) {
int i = 0;
int j = 0;
for ( i = 0;
i < n;
i ++ ) {
for ( j = 0;
j < m;
j ++ ) {
if ( arr2 [ i ] == arr1 [ j ] ) break;
}
if ( j == m ) return 0;
}
return 1;
}
int i = 0;
int j = 0;
for ( i = 0;
i < n;
i ++ ) {
for ( j = 0;
j < m;
j ++ ) {
if ( arr2 [ i ] == arr1 [ j ] ) break;
}
if ( j == m ) return 0;
}
return 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96},{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58,-54,62,-94,94,0,8,82,-68,-88,-18,8,-80,-42,18,62,-8,56,-76,-42,56,44,-2,-20,62,-14,74,-86,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{94,26,32,20,46,55,9,51,57,80,45,38,68,12,90,10,80,65,12,52,51,86,64,57,93,19,30,92,85,82,24,26,36,56},{-98,-90,-86,-86,-84,-84,-82,-80,-78,-72,-70,-68,-66,-64,-52,-52,-50,-38,-28,-26,-24,-14,-8,16,26,26,28,34,36,40,42,44,44,46,50,60,68,78,80,86,90,92,98},{1,0,1,0,1,0,0,0,1,0,0,0,0,1,1,0,1,1},{6,8,11,13,14,26,26,41,48,70,82,83,84,88,96},{-88,80,62,76,48,92,18,-94,-62,98,-46,-50,70,32,68,-54,26,16,94,0,-84,2,-16,88,26,-38,18,64,90,80,76,2,14,-90,50,4,76,30},{0,0,0,0,0,1,1,1,1,1,1,1},{54,44,97,92,13,54,27,8,43,70,77,84,55,64,5,59,27,19,65,68,66,26,33,38,7}};
vector<vector<int>> param1 {
{10,13,17,63},
{12, -18, 44},
{0,0,0},
{80,58,32,2},
{-99,-90,-90,-86},
{0,0,1,1},
{1,9,12,16},
{-76,-54,4,78},
{0,1,0,1},
{93,5,9,13}};
vector<int> param2 {29,46,34,17,23,10,10,27,10,19};
vector<int> param3 {4,3,3,4,4,4,4,4,4,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),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; bool f_gold ( int arr1 [ ], int arr2 [ ], int [MASK] int n ) { int i = 0; int j = 0; for ( i = 0; i < n; i ++ ) { for ( j = 0; j < m; j ++ ) { if ( arr2 [ i ] == arr1 [ j ] ) break; } if ( j == m ) return 0; } return 1; }int i = 0;
int j = 0;
for ( i = 0;
i < n;
i ++ ) {
for ( j = 0;
j < m;
j ++ ) {
if ( arr2 [ i ] == arr1 [ j ] ) break;
}
if ( j == m ) return 0;
}
return 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,10,10,10,13,17,23,24,25,28,30,33,37,49,49,50,57,60,60,63,63,64,65,65,72,81,84,85,85,94,96},{12,30,-94,-92,-62,-18,-56,44,-50,-92,6,2,56,-90,0,0,18,86,-58,58,-54,62,-94,94,0,8,82,-68,-88,-18,8,-80,-42,18,62,-8,56,-76,-42,56,44,-2,-20,62,-14,74,-86,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{94,26,32,20,46,55,9,51,57,80,45,38,68,12,90,10,80,65,12,52,51,86,64,57,93,19,30,92,85,82,24,26,36,56},{-98,-90,-86,-86,-84,-84,-82,-80,-78,-72,-70,-68,-66,-64,-52,-52,-50,-38,-28,-26,-24,-14,-8,16,26,26,28,34,36,40,42,44,44,46,50,60,68,78,80,86,90,92,98},{1,0,1,0,1,0,0,0,1,0,0,0,0,1,1,0,1,1},{6,8,11,13,14,26,26,41,48,70,82,83,84,88,96},{-88,80,62,76,48,92,18,-94,-62,98,-46,-50,70,32,68,-54,26,16,94,0,-84,2,-16,88,26,-38,18,64,90,80,76,2,14,-90,50,4,76,30},{0,0,0,0,0,1,1,1,1,1,1,1},{54,44,97,92,13,54,27,8,43,70,77,84,55,64,5,59,27,19,65,68,66,26,33,38,7}};
vector<vector<int>> param1 {
{10,13,17,63},
{12, -18, 44},
{0,0,0},
{80,58,32,2},
{-99,-90,-90,-86},
{0,0,1,1},
{1,9,12,16},
{-76,-54,4,78},
{0,1,0,1},
{93,5,9,13}};
vector<int> param2 {29,46,34,17,23,10,10,27,10,19};
vector<int> param3 {4,3,3,4,4,4,4,4,4,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | m, | [
"a) m",
"b) m,",
"c) (",
"d) in",
"e) (arr)[0]));}"
] | 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 n ) {
sort ( a, a + n );
int num1 = 0;
int num2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ];
else num2 = num2 * 10 + a [ i ];
}
return num2 + num1;
}
, a + n );
int num1 = 0;
int num2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ];
else num2 = num2 * 10 + a [ i ];
}
return num2 + num1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,16,29,30,38,83},{58,74,-28,-60,-6,66,-76,46,0,-24,28,-16,-14,24,-94,-56,-80,40,-18,-68,-8,-94,-88,-12,-20,-8},{0,1},{7,12,78,8},{-78,-48,-48,-26,8,34},{1,1,1,1,0,1,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,0,1,0,0,1,1,0},{2,3,5,7,25,30,31,38,42,45,52,53,56,59,60,71,74,76,80,90,91,98},{40,-62,-2,-58,60,38,48,-4,0,62,-52,-80,56,38,58,-72,32,-26,-14,70,58,-86,-32,56,-40,84,24,60,-46,-32,78,78,-66,20,-32,98,84,44,48,4,54,-66,6,-62,58},{0,0,0,0,0,0,1,1,1},{59,9,3,20,83,87,48,4,86,67,89,96,17,36,39,45,99,8,56,92,63,81,7,75,32,10,71,82,97,92,65,23,22,47,70,79,57,81,65,50}};
vector<int> param1 {5,16,1,3,4,27,13,34,8,35};
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 + [MASK] ); int num1 = 0; int num2 = 0; for ( int i = 0; i < n; i ++ ) { if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ]; else num2 = num2 * 10 + a [ i ]; } return num2 + num1; }, a + n );
int num1 = 0;
int num2 = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) num1 = num1 * 10 + a [ i ];
else num2 = num2 * 10 + a [ i ];
}
return num2 + num1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,16,29,30,38,83},{58,74,-28,-60,-6,66,-76,46,0,-24,28,-16,-14,24,-94,-56,-80,40,-18,-68,-8,-94,-88,-12,-20,-8},{0,1},{7,12,78,8},{-78,-48,-48,-26,8,34},{1,1,1,1,0,1,1,1,0,1,0,1,0,0,0,0,1,1,1,1,1,0,0,0,1,0,0,1,1,0},{2,3,5,7,25,30,31,38,42,45,52,53,56,59,60,71,74,76,80,90,91,98},{40,-62,-2,-58,60,38,48,-4,0,62,-52,-80,56,38,58,-72,32,-26,-14,70,58,-86,-32,56,-40,84,24,60,-46,-32,78,78,-66,20,-32,98,84,44,48,4,54,-66,6,-62,58},{0,0,0,0,0,0,1,1,1},{59,9,3,20,83,87,48,4,86,67,89,96,17,36,39,45,99,8,56,92,63,81,7,75,32,10,71,82,97,92,65,23,22,47,70,79,57,81,65,50}};
vector<int> param1 {5,16,1,3,4,27,13,34,8,35};
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) ==",
"b) +=",
"c) }",
"d) n",
"e) ("
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( unsigned int n ) {
bool parity = 0;
while ( n ) {
parity = ! parity;
n = n & ( n - 1 );
}
return parity;
}
ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( unsigned int n ) {
bool parity = 0;
while ( n ) {
parity = ! parity;
n = n & ( n - 1 );
}
return parity;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {63,64,85,36,20,63,42,19,62,97};
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 ( unsigned int n ) { bool parity = 0; while ( n ) { parity = ! parity; n = n & ( n - 1 ); } return parity; [MASK]ude <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( unsigned int n ) {
bool parity = 0;
while ( n ) {
parity = ! parity;
n = n & ( n - 1 );
}
return parity;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {63,64,85,36,20,63,42,19,62,97};
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) #include",
"b) }",
"c) best",
"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 ( int n ) {
if ( n <= 1 ) return false;
if ( n <= 3 ) return false;
if ( n % 2 == 0 || n % 3 == 0 ) return true;
for ( int i = 5;
i * i <= n;
i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true;
return false;
}
;
if ( n <= 3 ) return false;
if ( n % 2 == 0 || n % 3 == 0 ) return true;
for ( int i = 5;
i * i <= n;
i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {62,13,29,72,30,20,10,47,91,52};
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 false; if ( n % 2 == 0 || n % 3 == 0 ) return true; for ( int i = 5; i * i <= n; i = i + 6 ) if ( n % i == 0 [MASK] n % ( i + 2 ) == 0 ) return true; return false; };
if ( n <= 3 ) return false;
if ( n % 2 == 0 || n % 3 == 0 ) return true;
for ( int i = 5;
i * i <= n;
i = i + 6 ) if ( n % i == 0 || n % ( i + 2 ) == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {62,13,29,72,30,20,10,47,91,52};
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) n",
"b) i",
"c) count",
"d) max(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 arr [ ], int n ) {
int SubsetSum_1 = 0, SubsetSum_2 = 0;
for ( int i = 0;
i <= n - 1;
i ++ ) {
bool isSingleOccurance = true;
for ( int j = i + 1;
j <= n - 1;
j ++ ) {
if ( arr [ i ] == arr [ j ] ) {
isSingleOccurance = false;
arr [ i ] = arr [ j ] = 0;
break;
}
}
if ( isSingleOccurance ) {
if ( arr [ i ] > 0 ) SubsetSum_1 += arr [ i ];
else SubsetSum_2 += arr [ i ];
}
}
return abs ( SubsetSum_1 - SubsetSum_2 );
}
reak;
}
}
if ( isSingleOccurance ) {
if ( arr [ i ] > 0 ) SubsetSum_1 += arr [ i ];
else SubsetSum_2 += arr [ i ];
}
}
return abs ( SubsetSum_1 - SubsetSum_2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,14,15,21,42,42,42,46,46,48,48,48,52,52,53,60,62,69,69,79,82,86,96},{-54,4,-22,94,58,-28,-12,84,64,4,-34,16,-10,-32,50,-78,68,-52,-64,66,64,-28,-38,-18,-84,-66,-36,64,-12,44,48,8,42},{0,0,0,1},{63,49,18,36,21,30,45,87},{-96,-78,-78,-72,-62,-56,-52,-44,-38,-38,-28,-22,-20,-12,-6,-6,-2,2,2,4,36,44,46,50,50,54,66,92},{0,1,1,0,0,1,1,0,1,1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0,1,1,1,0},{1,2,8,12,13,13,14,17,18,27,28,31,34,37,38,42,43,45,49,52,53,56,56,58,62,66,71,74,87,93,96,99},{30,-28,-30,86,-8,-80,76,-2,28,30,82,84,-32,82,-88,-24,42,16,-32,-8,78,-8,-46,-6,-86,-86,-24,-12,-32,-72,84,-82,76,-84,80,-50,90,-50,-14,-82,78,48,-10,86,34,-20,-76,58},{0,1},{83,86,57,18,98,52,1,37,11,49,10,67,2,60,30,42,8,97,25,55,5,75,9,67}};
vector<int> param1 {15,28,2,6,18,34,25,28,1,16};
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 SubsetSum_1 = 0, SubsetSum_2 = 0; for ( int i = 0; i <= n - 1; i ++ ) { [MASK] isSingleOccurance = true; for ( int j = i + 1; j <= n - 1; j ++ ) { if ( arr [ i ] == arr [ j ] ) { isSingleOccurance = false; arr [ i ] = arr [ j ] = 0; break; } } if ( isSingleOccurance ) { if ( arr [ i ] > 0 ) SubsetSum_1 += arr [ i ]; else SubsetSum_2 += arr [ i ]; } } return abs ( SubsetSum_1 - SubsetSum_2 ); }reak;
}
}
if ( isSingleOccurance ) {
if ( arr [ i ] > 0 ) SubsetSum_1 += arr [ i ];
else SubsetSum_2 += arr [ i ];
}
}
return abs ( SubsetSum_1 - SubsetSum_2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,14,15,21,42,42,42,46,46,48,48,48,52,52,53,60,62,69,69,79,82,86,96},{-54,4,-22,94,58,-28,-12,84,64,4,-34,16,-10,-32,50,-78,68,-52,-64,66,64,-28,-38,-18,-84,-66,-36,64,-12,44,48,8,42},{0,0,0,1},{63,49,18,36,21,30,45,87},{-96,-78,-78,-72,-62,-56,-52,-44,-38,-38,-28,-22,-20,-12,-6,-6,-2,2,2,4,36,44,46,50,50,54,66,92},{0,1,1,0,0,1,1,0,1,1,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,0,1,0,0,1,0,0,1,0,1,0,0,1,1,1,0},{1,2,8,12,13,13,14,17,18,27,28,31,34,37,38,42,43,45,49,52,53,56,56,58,62,66,71,74,87,93,96,99},{30,-28,-30,86,-8,-80,76,-2,28,30,82,84,-32,82,-88,-24,42,16,-32,-8,78,-8,-46,-6,-86,-86,-24,-12,-32,-72,84,-82,76,-84,80,-50,90,-50,-14,-82,78,48,-10,86,34,-20,-76,58},{0,1},{83,86,57,18,98,52,1,37,11,49,10,67,2,60,30,42,8,97,25,55,5,75,9,67}};
vector<int> param1 {15,28,2,6,18,34,25,28,1,16};
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;
} | bool | [
"a) #include",
"b) =",
"c) bool",
"d) <math.h>",
"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 l, int r, int x ) {
if ( r >= l ) {
int mid = l + ( r - l ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( mid > l && arr [ mid - 1 ] == x ) return ( mid - 1 );
if ( mid < r && arr [ mid + 1 ] == x ) return ( mid + 1 );
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 2, x );
return f_gold ( arr, mid + 2, r, x );
}
return - 1;
}
- 1 );
if ( mid < r && arr [ mid + 1 ] == x ) return ( mid + 1 );
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 2, x );
return f_gold ( arr, mid + 2, r, x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,15,42,47,54,56,59,59,64,68,70,71,75,91,93},{6,7,15,42,47,56,54,59,59,64,68,71,70, 75,91,93},{-92,-96,-68,-40,70},{-92,-86,-68,-40,70},{-3,-1,0,30,10,45,70,60},{-3,-1,0,10,5,45,60,50},{-3,-1,0,10,30,45,60,70},{0,0,1},{1,1,1},{30,2,30,45}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {15,15,4,4,7,7,7,2,2,3};
vector<int> param3 {71,71,-96,20,0,12,18,20,17,28};
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 l, int r, int x ) { if ( r >= l ) { int mid = l + ( r - l ) / 2; if ( arr [ mid ] == x ) return mid; if ( mid > l && arr [ mid - 1 ] == x ) return ( mid - 1 ); if ( mid < r && arr [ mid + 1 ] == x ) return ( mid + 1 ); if ( arr [ [MASK] ] > x ) return f_gold ( arr, l, mid - 2, x ); return f_gold ( arr, mid + 2, r, x ); } return - 1; }- 1 );
if ( mid < r && arr [ mid + 1 ] == x ) return ( mid + 1 );
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 2, x );
return f_gold ( arr, mid + 2, r, x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,15,42,47,54,56,59,59,64,68,70,71,75,91,93},{6,7,15,42,47,56,54,59,59,64,68,71,70, 75,91,93},{-92,-96,-68,-40,70},{-92,-86,-68,-40,70},{-3,-1,0,30,10,45,70,60},{-3,-1,0,10,5,45,60,50},{-3,-1,0,10,30,45,60,70},{0,0,1},{1,1,1},{30,2,30,45}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {15,15,4,4,7,7,7,2,2,3};
vector<int> param3 {71,71,-96,20,0,12,18,20,17,28};
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;
}
| mid | [
"a) return",
"b) 10",
"c) /",
"d) mid",
"e) x"
] | 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 x ) {
unsigned int even_bits = x & 0xAAAAAAAA;
unsigned int odd_bits = x & 0x55555555;
even_bits >>= 1;
odd_bits <<= 1;
return ( even_bits | odd_bits );
}
igned int f_gold ( unsigned int x ) {
unsigned int even_bits = x & 0xAAAAAAAA;
unsigned int odd_bits = x & 0x55555555;
even_bits >>= 1;
odd_bits <<= 1;
return ( even_bits | odd_bits );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,94,11,3,77,57,54,66,98,36};
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 [MASK] #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int x ) { unsigned int even_bits = x & 0xAAAAAAAA; unsigned int odd_bits = x & 0x55555555; even_bits >>= 1; odd_bits <<= 1; return ( even_bits | odd_bits ); }igned int f_gold ( unsigned int x ) {
unsigned int even_bits = x & 0xAAAAAAAA;
unsigned int odd_bits = x & 0x55555555;
even_bits >>= 1;
odd_bits <<= 1;
return ( even_bits | odd_bits );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,94,11,3,77,57,54,66,98,36};
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;
} | <vector> | [
"a) int",
"b) #include",
"c) <vector>",
"d) #include",
"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 ( unsigned int n ) {
int count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) {
while ( n > 1 ) {
n >>= 1;
count += 1;
}
return ( count % 2 == 0 ) ? 1 : 0;
}
return 0;
}
gold ( unsigned int n ) {
int count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) {
while ( n > 1 ) {
n >>= 1;
count += 1;
}
return ( count % 2 == 0 ) ? 1 : 0;
}
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,64,-64,128,1024,45,33,66,74};
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 ( unsigned int n ) { int count = 0; if ( n && ! ( n & ( n - 1 ) ) ) { while ( n > 1 ) { n >>= 1; count += 1; } return ( count % 2 == 0 ) ? 1 [MASK] 0; } return 0; }gold ( unsigned int n ) {
int count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) {
while ( n > 1 ) {
n >>= 1;
count += 1;
}
return ( count % 2 == 0 ) ? 1 : 0;
}
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,64,-64,128,1024,45,33,66,74};
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) {qsort",
"b) :",
"c) a",
"d) return",
"e) max"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) sum = sum + i * j;
return sum;
}
tdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) sum = sum + i * j;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,32,16,38,9,3,5,46,45,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; long long int f_gold ( int n ) { long long [MASK] sum = 0; for ( int i = 1; i <= n; i ++ ) for ( int j = i; j <= n; j ++ ) sum = sum + i * j; return sum; }tdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= n;
j ++ ) sum = sum + i * j;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,32,16,38,9,3,5,46,45,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) int",
"b) arr",
"c) :",
"d) )",
"e) A"
] | 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 position = 1;
int m = 1;
while ( ! ( n & m ) ) {
m = m << 1;
position ++;
}
return position;
}
<iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int position = 1;
int m = 1;
while ( ! ( n & m ) ) {
m = m << 1;
position ++;
}
return position;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,97,73,68,6,84,72,66,57,11};
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 position = 1; int m = 1; while ( ! ( n & m ) ) [MASK] m = m << 1; position ++; } return position; } <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int position = 1;
int m = 1;
while ( ! ( n & m ) ) {
m = m << 1;
position ++;
}
return position;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,97,73,68,6,84,72,66,57,11};
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) range",
"b) return",
"c) {",
"d) f_gold",
"e) j"
] | 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 boxes [ ], int n ) {
sort ( boxes, boxes + n );
int ans = 1;
int prev_width = boxes [ 0 ];
int prev_count = 1;
int curr_count = 0;
int curr_width = 0;
for ( int i = 1;
i < n;
i ++ ) {
curr_width += boxes [ i ];
curr_count += 1;
if ( curr_width > prev_width && curr_count > prev_count ) {
prev_width = curr_width;
prev_count = curr_count;
curr_count = 0;
curr_width = 0;
ans ++;
}
}
return ans;
}
_width > prev_width && curr_count > prev_count ) {
prev_width = curr_width;
prev_count = curr_count;
curr_count = 0;
curr_width = 0;
ans ++;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,8,11,11,14,19,25,27,41,42,46,52,53,54,55,58,59,62,63,66,67,69,74,75,77,81,83,84,88,88,93,93,94},{80,72,40,-78,-72,20,-28,-18,-96,14,20,-60,-56,-92,12,86,16,76,30,76,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,85,16,78,85,48,91,1,65,22,15,84,67,14,73,19,40,98,4,33,43,37,66,27,45,81,50,95,63,6,95,67,67,97,59,13,21,64,37,80},{-98,-92,-90,-88,-88,-74,-64,-64,-64,-62,-60,-52,-48,-46,-42,-42,-38,-34,-28,-26,-20,-20,-18,-4,0,2,2,6,18,18,18,20,24,24,26,32,40,46,58,66,74,78,90,96},{1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0},{8,12,13,13,13,16,16,17,19,20,22,23,26,29,29,30,31,37,38,39,39,41,45,45,46,49,49,53,56,62,62,66,67,68,68,69,69,73,77,78,82,85,85,88,88,97},{36,-30,-84,4,-20,-28,-88,72,40,46,-68,-8,18,-24,94,-64,-76,8,82,-6,-98,-70,82,60,-58,-98,86,34,-76,-44,-22,-26,90,20,-38,16,94,94,-78,-42,78,-74,2,8,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{70,54,71,85,51,28,64,85,21,88,27,27,77,50,29,39,57,92,37,93,64,48,22,30,28,23,97,4,3,61,96}};
vector<int> param1 {22,12,35,35,30,21,26,25,26,18};
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 boxes [ ], int n ) { sort ( boxes, boxes + n ); int ans = 1; int prev_width = boxes [ 0 ]; int prev_count = 1; int curr_count = 0; int curr_width = 0; for ( int i = 1; i < n; i ++ ) { curr_width += boxes [ i ]; curr_count += 1; if ( curr_width > prev_width && curr_count > prev_count ) { prev_width = curr_width; prev_count = curr_count; curr_count = 0; curr_width = 0; ans ++; } } return ans; }_width > prev_width && curr_count > prev_count ) {
prev_width = curr_width;
prev_count = curr_count;
curr_count = 0;
curr_width = 0;
ans ++;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,8,11,11,14,19,25,27,41,42,46,52,53,54,55,58,59,62,63,66,67,69,74,75,77,81,83,84,88,88,93,93,94},{80,72,40,-78,-72,20,-28,-18,-96,14,20,-60,-56,-92,12,86,16,76,30,76,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,85,16,78,85,48,91,1,65,22,15,84,67,14,73,19,40,98,4,33,43,37,66,27,45,81,50,95,63,6,95,67,67,97,59,13,21,64,37,80},{-98,-92,-90,-88,-88,-74,-64,-64,-64,-62,-60,-52,-48,-46,-42,-42,-38,-34,-28,-26,-20,-20,-18,-4,0,2,2,6,18,18,18,20,24,24,26,32,40,46,58,66,74,78,90,96},{1,1,1,0,0,1,1,0,1,0,1,1,0,0,1,0,1,0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,1,0},{8,12,13,13,13,16,16,17,19,20,22,23,26,29,29,30,31,37,38,39,39,41,45,45,46,49,49,53,56,62,62,66,67,68,68,69,69,73,77,78,82,85,85,88,88,97},{36,-30,-84,4,-20,-28,-88,72,40,46,-68,-8,18,-24,94,-64,-76,8,82,-6,-98,-70,82,60,-58,-98,86,34,-76,-44,-22,-26,90,20,-38,16,94,94,-78,-42,78,-74,2,8,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{70,54,71,85,51,28,64,85,21,88,27,27,77,50,29,39,57,92,37,93,64,48,22,30,28,23,97,4,3,61,96}};
vector<int> param1 {22,12,35,35,30,21,26,25,26,18};
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) (",
"c) (const",
"d) return",
"e) f_gold"
] | 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 weight [ ], int n, int c ) {
int res = 0, bin_rem = c;
for ( int i = 0;
i < n;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
res ++;
bin_rem = c - weight [ i ];
}
else bin_rem -= weight [ i ];
}
return res;
}
bin_rem = c;
for ( int i = 0;
i < n;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
res ++;
bin_rem = c - weight [ i ];
}
else bin_rem -= weight [ i ];
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,14,16,19,24,29,31,33,34,41,43,47,53,53,59,64,70,70,71,72,73,74,80,81,89,90},{-88,-26,70,-92,96,84,-24,-18,84,62,-72,42,72,2,30,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,1,1,1,1},{51,7,6,24,19,83,9,36,40,93,24,48,63,69,53,54,42,45,90,14,29,6,7,37,53,18,87,38,59,1,68,44,47,35,87,91,60,90,52,8,80,41,3,96},{-98,-90,-78,-48,-36,-20,2,8,16,40,54,54,60,92},{1,1,1,1,0,0,1,1,0,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1,1,0,1,1,0,0,1,0,0,0,0},{8,14,16,35,40,45,54,57,58,59,87,88,93,95,97},{-46,-6,60,-88,10,94,-12,-64,-68,-76,-60,-10,28,18,86,88,80,-56,94,-6,-42,72,-10,54,-82,-52,-70,-28,-74,82,-12,42,44,56,52,-28,22,62,-20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{48,57,21,82,99}};
vector<int> param1 {21,11,27,26,11,32,11,19,26,4};
vector<int> param2 {16,14,23,41,7,28,12,38,23,2};
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 weight [ ], int n, int c ) { int res = 0, [MASK] = c; for ( int i = 0; i < n; i ++ ) { if ( weight [ i ] > bin_rem ) { res ++; bin_rem = c - weight [ i ]; } else bin_rem -= weight [ i ]; } return res; } bin_rem = c;
for ( int i = 0;
i < n;
i ++ ) {
if ( weight [ i ] > bin_rem ) {
res ++;
bin_rem = c - weight [ i ];
}
else bin_rem -= weight [ i ];
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,14,16,19,24,29,31,33,34,41,43,47,53,53,59,64,70,70,71,72,73,74,80,81,89,90},{-88,-26,70,-92,96,84,-24,-18,84,62,-72,42,72,2,30,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,1,1,1,1},{51,7,6,24,19,83,9,36,40,93,24,48,63,69,53,54,42,45,90,14,29,6,7,37,53,18,87,38,59,1,68,44,47,35,87,91,60,90,52,8,80,41,3,96},{-98,-90,-78,-48,-36,-20,2,8,16,40,54,54,60,92},{1,1,1,1,0,0,1,1,0,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,0,1,1,1,1,1,0,1,1,0,0,1,0,0,0,0},{8,14,16,35,40,45,54,57,58,59,87,88,93,95,97},{-46,-6,60,-88,10,94,-12,-64,-68,-76,-60,-10,28,18,86,88,80,-56,94,-6,-42,72,-10,54,-82,-52,-70,-28,-74,82,-12,42,44,56,52,-28,22,62,-20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{48,57,21,82,99}};
vector<int> param1 {21,11,27,26,11,32,11,19,26,4};
vector<int> param2 {16,14,23,41,7,28,12,38,23,2};
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;
} | bin_rem | [
"a) sizeof",
"b) bin_rem",
"c) abs",
"d) ]",
"e) 1"
] | 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 left, int right ) {
if ( left <= right ) {
int mid = ( left + right ) / 2;
if ( arr [ mid - 1 ] < arr [ mid ] && arr [ mid ] > arr [ mid + 1 ] ) return mid;
if ( arr [ mid ] < arr [ mid + 1 ] ) return f_gold ( arr, mid + 1, right );
else return f_gold ( arr, left, mid - 1 );
}
return - 1;
}
] && arr [ mid ] > arr [ mid + 1 ] ) return mid;
if ( arr [ mid ] < arr [ mid + 1 ] ) return f_gold ( arr, mid + 1, right );
else return f_gold ( arr, left, mid - 1 );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,10,33,44,50,50,53,58,64,68,76,83,90,98},{-96,-20,20,4,-76,-96,-44,64,-30,-12,48,-84,-16,-28,84},{0,0,0,0,1,1},{46,24,32,6,23,66,21,78,11,97,35,51,3,56,14,5,43,19,67,15,87,28,28,97,52,91,70,72,97,73,67,48,68,33,50,34,78,75},{-88,-6,38,44,44,46,50},{1},{7,7,10,13,15,17,18,25,26,30,40,41,42,45,47,47,55,61,62,62,63,64,66,67,69,79,79,82,82,88,91,94,97},{-18,-4,-66,-38,-68,-80,40,62,0,92,86,62,8,-22,72,-12,18,-72,-86,-84,70,-78,46,72,72,46,42,70,12,20,46,46},{0,0,0,0,0,1,1,1,1,1},{11,36,74,82,70,8,7,78,91,59,86,36}};
vector<int> param1 {8,11,4,30,6,0,26,22,6,11};
vector<int> param2 {9,14,4,28,6,0,32,25,7,7};
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 left, int right ) { if ( left <= right ) { int mid = ( left + right ) / 2; if ( arr [ mid - 1 ] < arr [ mid ] && arr [ mid ] > arr [ mid + 1 ] ) return mid; if ( arr [ mid ] < arr [ mid + 1 ] ) return f_gold ( arr, mid + 1, right ); else return f_gold ( arr, left, mid [MASK] 1 ); } return - 1; } ] && arr [ mid ] > arr [ mid + 1 ] ) return mid;
if ( arr [ mid ] < arr [ mid + 1 ] ) return f_gold ( arr, mid + 1, right );
else return f_gold ( arr, left, mid - 1 );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,10,33,44,50,50,53,58,64,68,76,83,90,98},{-96,-20,20,4,-76,-96,-44,64,-30,-12,48,-84,-16,-28,84},{0,0,0,0,1,1},{46,24,32,6,23,66,21,78,11,97,35,51,3,56,14,5,43,19,67,15,87,28,28,97,52,91,70,72,97,73,67,48,68,33,50,34,78,75},{-88,-6,38,44,44,46,50},{1},{7,7,10,13,15,17,18,25,26,30,40,41,42,45,47,47,55,61,62,62,63,64,66,67,69,79,79,82,82,88,91,94,97},{-18,-4,-66,-38,-68,-80,40,62,0,92,86,62,8,-22,72,-12,18,-72,-86,-84,70,-78,46,72,72,46,42,70,12,20,46,46},{0,0,0,0,0,1,1,1,1,1},{11,36,74,82,70,8,7,78,91,59,86,36}};
vector<int> param1 {8,11,4,30,6,0,26,22,6,11};
vector<int> param2 {9,14,4,28,6,0,32,25,7,7};
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) ans",
"b) table",
"c) -",
"d) count",
"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 result = 0;
sort ( arr, arr + n );
for ( int i = 0;
i < n - 1;
i ++ ) {
if ( arr [ i ] != arr [ i + 1 ] ) result += abs ( arr [ i ] );
else i ++;
}
if ( arr [ n - 2 ] != arr [ n - 1 ] ) result += abs ( arr [ n - 1 ] );
return result;
}
n - 1;
i ++ ) {
if ( arr [ i ] != arr [ i + 1 ] ) result += abs ( arr [ i ] );
else i ++;
}
if ( arr [ n - 2 ] != arr [ n - 1 ] ) result += abs ( arr [ n - 1 ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19,20,22,23,25,28,33,33,35,35,36,44,44,52,54,54,56,57,57,63,78,78,79,81,89,93,93,93,93,93,93,97},{-20,96,-32,-8,4,14,-26,-58,-68,-68,42,-12,-28,-68,-72,88,-94,-84,20,-58,-50,-78,-4,-22,-54,90,78,2,40,-78,98,52,-48,40,12,6,54,28,-96,-88,98,-34,-66,42,-18,4,-20,-34},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{21,50,15,2,59,79,52,55,78,55,73,9,1,58,48,13,71,1},{-98,-74,-68,-60,-58,-56,-42,-36,-36,-34,-30,-28,-18,-16,-16,-10,-8,-6,-4,0,2,2,10,16,18,30,34,34,36,38,42,46,60,60,62,76,78,88,96},{1},{6,6,6,9,10,11,14,19,19,21,23,23,24,29,30,43,45,46,55,55,63,69,71,78,80,81,85,86,87,97,98},{86,-14,-64,88,28,40,30,92,-2,-52,-14,-96,-30,-54,-88,-8,-48,32,-60,-68,-62,52,52,-28,58,82,68,30,-24,52,74,-20,-62,-98,26,58,-30,76,48,-14,88,58,-40,-20,-50,-70,-92,-84},{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},{36,12,61,15,31,7,76,79,27,60,81,2,3,83,96,29,23,30,78,86,86,25,89,96,67,38,24,58,80,13,51,30,45,65,85,48,51,44,16,87,17,28,66,97,16}};
vector<int> param1 {23,47,13,16,37,0,19,32,29,36};
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 [MASK] ( int arr [ ], int n ) { int result = 0; sort ( arr, arr + n ); for ( int i = 0; i < n - 1; i ++ ) { if ( arr [ i ] != arr [ i + 1 ] ) result += abs ( arr [ i ] ); else i ++; } if ( arr [ n - 2 ] != arr [ n - 1 ] ) result += abs ( arr [ n - 1 ] ); return result; } n - 1;
i ++ ) {
if ( arr [ i ] != arr [ i + 1 ] ) result += abs ( arr [ i ] );
else i ++;
}
if ( arr [ n - 2 ] != arr [ n - 1 ] ) result += abs ( arr [ n - 1 ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19,20,22,23,25,28,33,33,35,35,36,44,44,52,54,54,56,57,57,63,78,78,79,81,89,93,93,93,93,93,93,97},{-20,96,-32,-8,4,14,-26,-58,-68,-68,42,-12,-28,-68,-72,88,-94,-84,20,-58,-50,-78,-4,-22,-54,90,78,2,40,-78,98,52,-48,40,12,6,54,28,-96,-88,98,-34,-66,42,-18,4,-20,-34},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{21,50,15,2,59,79,52,55,78,55,73,9,1,58,48,13,71,1},{-98,-74,-68,-60,-58,-56,-42,-36,-36,-34,-30,-28,-18,-16,-16,-10,-8,-6,-4,0,2,2,10,16,18,30,34,34,36,38,42,46,60,60,62,76,78,88,96},{1},{6,6,6,9,10,11,14,19,19,21,23,23,24,29,30,43,45,46,55,55,63,69,71,78,80,81,85,86,87,97,98},{86,-14,-64,88,28,40,30,92,-2,-52,-14,-96,-30,-54,-88,-8,-48,32,-60,-68,-62,52,52,-28,58,82,68,30,-24,52,74,-20,-62,-98,26,58,-30,76,48,-14,88,58,-40,-20,-50,-70,-92,-84},{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},{36,12,61,15,31,7,76,79,27,60,81,2,3,83,96,29,23,30,78,86,86,25,89,96,67,38,24,58,80,13,51,30,45,65,85,48,51,44,16,87,17,28,66,97,16}};
vector<int> param1 {23,47,13,16,37,0,19,32,29,36};
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;
} | f_gold | [
"a) char",
"b) f_gold",
"c) [",
"d) 1",
"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 k ) {
priority_queue < int, vector < int >, greater < int > > pq;
for ( int i = 0;
i < n;
i ++ ) pq . push ( arr [ i ] );
int count = 0, ans = 1;
while ( pq . empty ( ) == false && count < k ) {
ans = ans * pq . top ( );
pq . pop ( );
count ++;
}
return ans;
}
n;
i ++ ) pq . push ( arr [ i ] );
int count = 0, ans = 1;
while ( pq . empty ( ) == false && count < k ) {
ans = ans * pq . top ( );
pq . pop ( );
count ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{57,66,91},{-44,86,28,-70,-12,96,-10,74,-50,-52,-6,64,-62,92,-24,90,-26,-4,-92,-24,-84,76,-92,62,-62,-86,-86,-14,50,30,62,2,-88,-78,-48},{0,0,1,1},{99,85,37,27,55,20,76,38,33,78,24,80,74,42,15,16,97,51,71,92,18,63,47,10,6,72,40,21,14,68,98,49,48,64,50,66,44,1,26,55,61,43,9,16,8,42,51,98,1},{-58,-12,16,18,24},{0,0,1,0,0,1,0,1,0,0,0,0,0,1,1,1},{5,10,13,14,19,21,22,25,28,36,39,44,46,53,54,55,55,67,73,75,77,78,80,84,91,94,96},{18,-44,46,64,86,-36,8,-10,-50,-98,-6,-38,-34,14,-34,86,58,-30,76,6,38,98,78,56,-56,-66,-58,62,92,-94},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,74,28,75,84,52,5,19,80,12,76,14,28,63,30,29,16,74,28,48,97,77,62,19,67,26,14,44,52,86,9,31,41,14,66,27,36,98,48,37,2,12,2}};
vector<int> param1 {2,29,3,36,2,8,23,23,13,27};
vector<int> param2 {2,21,3,47,3,15,23,20,17,23};
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 [MASK] #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int k ) { priority_queue < int, vector < int >, greater < int > > pq; for ( int i = 0; i < n; i ++ ) pq . push ( arr [ i ] ); int count = 0, ans = 1; while ( pq . empty ( ) == false && count < k ) { ans = ans * pq . top ( ); pq . pop ( ); count ++; } return ans; } n;
i ++ ) pq . push ( arr [ i ] );
int count = 0, ans = 1;
while ( pq . empty ( ) == false && count < k ) {
ans = ans * pq . top ( );
pq . pop ( );
count ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{57,66,91},{-44,86,28,-70,-12,96,-10,74,-50,-52,-6,64,-62,92,-24,90,-26,-4,-92,-24,-84,76,-92,62,-62,-86,-86,-14,50,30,62,2,-88,-78,-48},{0,0,1,1},{99,85,37,27,55,20,76,38,33,78,24,80,74,42,15,16,97,51,71,92,18,63,47,10,6,72,40,21,14,68,98,49,48,64,50,66,44,1,26,55,61,43,9,16,8,42,51,98,1},{-58,-12,16,18,24},{0,0,1,0,0,1,0,1,0,0,0,0,0,1,1,1},{5,10,13,14,19,21,22,25,28,36,39,44,46,53,54,55,55,67,73,75,77,78,80,84,91,94,96},{18,-44,46,64,86,-36,8,-10,-50,-98,-6,-38,-34,14,-34,86,58,-30,76,6,38,98,78,56,-56,-66,-58,62,92,-94},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,74,28,75,84,52,5,19,80,12,76,14,28,63,30,29,16,74,28,48,97,77,62,19,67,26,14,44,52,86,9,31,41,14,66,27,36,98,48,37,2,12,2}};
vector<int> param1 {2,29,3,36,2,8,23,23,13,27};
vector<int> param2 {2,21,3,47,3,15,23,20,17,23};
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;
} | <fstream> | [
"a) <fstream>",
"b) n",
"c) ==",
"d) y;",
"e) java.util."
] | 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 s, int n ) {
string s1 = s;
for ( int i = 1;
i < n;
i ++ ) s += s1;
return s;
}
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string s, int n ) {
string s1 = s;
for ( int i = 1;
i < n;
i ++ ) s += s1;
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LPWsaI","9037515104","00100010010111","SbwipuE","574314109","1101","f","068","000011001","BWbUtIkC"};
vector<int> param1 {41,72,95,27,5,70,91,50,38,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 [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string s, int n ) { string s1 = s; for ( int i = 1; i < n; i ++ ) s += s1; return s; }#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string s, int n ) {
string s1 = s;
for ( int i = 1;
i < n;
i ++ ) s += s1;
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LPWsaI","9037515104","00100010010111","SbwipuE","574314109","1101","f","068","000011001","BWbUtIkC"};
vector<int> param1 {41,72,95,27,5,70,91,50,38,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;
} | <cstdlib> | [
"a) <cstdlib>",
"b) int",
"c) )",
"d) j",
"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 n ) {
int result = - 1;
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] );
return result;
}
0;
i < n;
i ++ ) for ( int j = 0;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,78,84},{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25},{-90,-52,-10,12,72},{1,0,0},{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97},{4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77}};
vector<int> param1 {2,26,22,10,3,2,27,0,16,22};
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 [MASK] [ ], int n ) { int result = - 1; for ( int i = 0; i < n; i ++ ) for ( int j = 0; j < n - 1; j ++ ) for ( int k = j + 1; k < n; k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] ); return result; } 0;
i < n;
i ++ ) for ( int j = 0;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) if ( arr [ j ] * arr [ k ] == arr [ i ] ) result = max ( result, arr [ i ] );
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,78,84},{-54,64,60,14,18,-68,-54,-58,38,-72,-84,46,74,76,28,-2,54,24,18,-74,-78,14,-38,-70,26,-54,-36,-96,-12,8,62,-42,-84,10,-6,36,-72,10,10,-20,16,92,-64,-34,74,-98,18},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,49,94,80,48,34,63,82,47,51,60,68,79,23,97,22,54,53,40,2,25},{-90,-52,-10,12,72},{1,0,0},{2,9,11,14,16,17,17,18,19,21,24,25,28,29,30,33,33,39,41,41,43,46,50,51,60,62,67,80,84,86,91,92,97},{4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{52,8,31,92,20,18,34,5,15,8,73,20,40,61,80,51,95,73,38,30,21,69,52,38,68,77}};
vector<int> param1 {2,26,22,10,3,2,27,0,16,22};
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;
} | arr | [
"a) *",
"b) arr",
"c) public",
"d) <iomanip>",
"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 ) {
unordered_map < int, int > freq;
for ( int i = 0;
i < n;
i ++ ) freq [ arr [ i ] ] ++;
int ans = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = 0;
j < n;
j ++ ) {
if ( freq [ arr [ i ] ] > freq [ arr [ j ] ] && arr [ i ] > arr [ j ] ) ans = max ( ans, freq [ arr [ i ] ] - freq [ arr [ j ] ] );
else if ( freq [ arr [ i ] ] < freq [ arr [ j ] ] && arr [ i ] < arr [ j ] ) ans = max ( ans, freq [ arr [ j ] ] - freq [ arr [ i ] ] );
}
}
return ans;
}
] ] - freq [ arr [ j ] ] );
else if ( freq [ arr [ i ] ] < freq [ arr [ j ] ] && arr [ i ] < arr [ j ] ) ans = max ( ans, freq [ arr [ j ] ] - freq [ arr [ i ] ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,16,22,33,37,46,49,50,51,65,82,94},{-4,-16,92,-28,-44,50,54,24,-28,-32,20,-94,-78,-20,26,90,-90,10,36,-52,60,-96,-64,-34,10,-12,86,78,32,-46,92,-66,18,-78,-28,14,-26,26,4,16,-96,86,-50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{98,54,41,62,95,18,74,57,37,90,35,45,10,14,90,88,58,8,85,58,97,59,13,94,40,3,89,62,45,90,8,31,93,5,40,78,43,75,79,74,17,38,62},{-88,-78,-76,-66,-56,-54,-54,-52,-34,-24,2,58,76,78},{1,1,1,1,1,0,0,1,0,0,1,0,1,1,0},{8,43,44,86},{54,92,-46,6,-38},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{54,47,56,2,23,40,15,18,31,48,53,77,83,29,62,86}};
vector<int> param1 {9,25,35,40,8,12,2,4,12,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 arr [ ], int n ) { unordered_map < int, int > freq; for ( int i = 0; i < n; i ++ ) freq [ arr [ i ] ] ++; int ans = 0; for ( int i = 0; i < n; i ++ ) { for ( int j = 0; j [MASK] n; j ++ ) { if ( freq [ arr [ i ] ] > freq [ arr [ j ] ] && arr [ i ] > arr [ j ] ) ans = max ( ans, freq [ arr [ i ] ] - freq [ arr [ j ] ] ); else if ( freq [ arr [ i ] ] < freq [ arr [ j ] ] && arr [ i ] < arr [ j ] ) ans = max ( ans, freq [ arr [ j ] ] - freq [ arr [ i ] ] ); } } return ans; }] ] - freq [ arr [ j ] ] );
else if ( freq [ arr [ i ] ] < freq [ arr [ j ] ] && arr [ i ] < arr [ j ] ) ans = max ( ans, freq [ arr [ j ] ] - freq [ arr [ i ] ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,6,16,22,33,37,46,49,50,51,65,82,94},{-4,-16,92,-28,-44,50,54,24,-28,-32,20,-94,-78,-20,26,90,-90,10,36,-52,60,-96,-64,-34,10,-12,86,78,32,-46,92,-66,18,-78,-28,14,-26,26,4,16,-96,86,-50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{98,54,41,62,95,18,74,57,37,90,35,45,10,14,90,88,58,8,85,58,97,59,13,94,40,3,89,62,45,90,8,31,93,5,40,78,43,75,79,74,17,38,62},{-88,-78,-76,-66,-56,-54,-54,-52,-34,-24,2,58,76,78},{1,1,1,1,1,0,0,1,0,0,1,0,1,1,0},{8,43,44,86},{54,92,-46,6,-38},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{54,47,56,2,23,40,15,18,31,48,53,77,83,29,62,86}};
vector<int> param1 {9,25,35,40,8,12,2,4,12,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) (",
"d) import",
"e) <"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long int f_gold ( int n ) {
if ( n == 1 ) return 1;
long int z;
float e = 2.71;
z = sqrt ( 2 * 3.14 * n ) * pow ( ( n / e ), n );
return z;
}
include <bits/stdc++.h>
using namespace std;
long int f_gold ( int n ) {
if ( n == 1 ) return 1;
long int z;
float e = 2.71;
z = sqrt ( 2 * 3.14 * n ) * pow ( ( n / e ), n );
return z;
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1.0,5.0,10.0,20.0,40.0,2.0,3.0,-1.0,4663.43115050185,-3722.039522409859};
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; long int f_gold ( int n ) { if ( n == 1 ) return 1; long int z; float e [MASK] 2.71; z = sqrt ( 2 * 3.14 * n ) * pow ( ( n / e ), n ); return z; }include <bits/stdc++.h>
using namespace std;
long int f_gold ( int n ) {
if ( n == 1 ) return 1;
long int z;
float e = 2.71;
z = sqrt ( 2 * 3.14 * n ) * pow ( ( n / e ), n );
return z;
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1.0,5.0,10.0,20.0,40.0,2.0,3.0,-1.0,4663.43115050185,-3722.039522409859};
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) #include",
"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 ) {
return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3;
}
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,74,91,34,36,28,70,7,24,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; int f_gold ( int n ) { return ( n * ( 2 * n - 1 ) * [MASK] 2 * n + 1 ) ) / 3; }#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return ( n * ( 2 * n - 1 ) * ( 2 * n + 1 ) ) / 3;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,74,91,34,36,28,70,7,24,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) false;",
"b) s",
"c) .",
"d) (",
"e) {"
] | d |
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 ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
sing namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97},{2,-90,66,24,-18,70,34,18,84,-62},{1,1},{12,88,65,82,23,39,60,27,57,44,70,28,23,34,25,11,48,65,10,73,26,10,18,60,73,45,26,9,36,15,24,40,2,4,95,20,39,45},{-38,38,40,72},{1,0,0,0,1},{11,15,16,17,17,17,22,23,23,25,27,28,28,31,33,36,38,40,42,44,46,49,51,51,52,60,62,65,67,71,74,77,77,78,78,79,83,83,86,86,87,87,87,88,91,92,97,97,97},{-26,-90,-78,-76,-58,-64,-72,-34,-58,-48,78,-50,-30,26,-60,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{56,51,63,30,10,88,23,1,48,4,28,44}};
vector<int> param1 {22,9,1,23,2,3,44,9,23,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; bool f_gold ( int arr [ ], int n ) { if ( n == 0 || n == [MASK] ) return true; for ( int i = 1; i < n; i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false; return true; }sing namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,8,8,16,19,19,21,23,26,33,34,36,38,39,41,41,45,47,52,52,55,57,60,60,60,61,69,69,70,70,72,73,73,75,78,81,84,84,85,88,88,89,90,91,97},{2,-90,66,24,-18,70,34,18,84,-62},{1,1},{12,88,65,82,23,39,60,27,57,44,70,28,23,34,25,11,48,65,10,73,26,10,18,60,73,45,26,9,36,15,24,40,2,4,95,20,39,45},{-38,38,40,72},{1,0,0,0,1},{11,15,16,17,17,17,22,23,23,25,27,28,28,31,33,36,38,40,42,44,46,49,51,51,52,60,62,65,67,71,74,77,77,78,78,79,83,83,86,86,87,87,87,88,91,92,97,97,97},{-26,-90,-78,-76,-58,-64,-72,-34,-58,-48,78,-50,-30,26,-60,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{56,51,63,30,10,88,23,1,48,4,28,44}};
vector<int> param1 {22,9,1,23,2,3,44,9,23,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;
} | 1 | [
"a) 1",
"b) (x",
"c) f_gold",
"d) i",
"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 ( string n ) {
int len = n . length ( );
if ( len == 1 ) {
int oneDigit = n . at ( 0 ) - '0';
if ( oneDigit % 4 == 0 ) return 1;
return 0;
}
int twoDigit, count = 0;
for ( int i = 0;
i < ( len - 1 );
i ++ ) {
twoDigit = ( n . at ( i ) - '0' ) * 10 + ( n . at ( i + 1 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
}
twoDigit = ( n . at ( len - 1 ) - '0' ) * 10 + ( n . at ( 0 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
return count;
}
n . at ( i + 1 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
}
twoDigit = ( n . at ( len - 1 ) - '0' ) * 10 + ( n . at ( 0 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"MRRuQJvxe","87395768","10111100110111","aVDUEfzG","55794792","111010","cndMLMJVmzuH","487717559382","11110","dRMDPyr"};
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 ( ); if ( len == 1 ) { int oneDigit = n . at ( 0 ) - '0'; if ( oneDigit % 4 == 0 ) return 1; return 0; } int twoDigit, count = 0; for ( int i = 0; i < ( len - 1 ); i ++ ) { twoDigit = ( n . at ( i ) - '0' ) * 10 + ( n . at ( i + 1 ) - '0' ); [MASK] ( twoDigit % 4 == 0 ) count ++; } twoDigit = ( n . at ( len - 1 ) - '0' ) * 10 + ( n . at ( 0 ) - '0' ); if ( twoDigit % 4 == 0 ) count ++; return count; }n . at ( i + 1 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
}
twoDigit = ( n . at ( len - 1 ) - '0' ) * 10 + ( n . at ( 0 ) - '0' );
if ( twoDigit % 4 == 0 ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"MRRuQJvxe","87395768","10111100110111","aVDUEfzG","55794792","111010","cndMLMJVmzuH","487717559382","11110","dRMDPyr"};
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;
} | if | [
"a) const",
"b) [",
"c) {",
"d) if",
"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 n ) {
for ( int i = 0;
i < n;
i ++ ) {
arr [ i ] = i + 1;
}
}
vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int arr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) {
arr [ i ] = i + 1;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96},{66,-28,6,25,-65,19,-86,-86,-90,40,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,84,8,36,93,76,14,54,85,86},{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90},{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1},{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94},{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24},{0,0,0,0,0,1,1,1,1,1,1},{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}};
vector<int> param1 {19,8,26,9,31,29,21,12,6,18};
vector<vector<int>> filled_function_param0 {{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96},{66,-28,6,25,-65,19,-86,-86,-90,40,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,84,8,36,93,76,14,54,85,86},{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90},{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1},{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94},{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24},{0,0,0,0,0,1,1,1,1,1,1},{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}};
vector<int> filled_function_param1 {19,8,26,9,31,29,21,12,6,18};
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 <string> #include [MASK] #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int arr [ ], int n ) { for ( int i = 0; i < n; i ++ ) { arr [ i ] = i + 1; } }vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int arr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) {
arr [ i ] = i + 1;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96},{66,-28,6,25,-65,19,-86,-86,-90,40,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,84,8,36,93,76,14,54,85,86},{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90},{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1},{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94},{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24},{0,0,0,0,0,1,1,1,1,1,1},{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}};
vector<int> param1 {19,8,26,9,31,29,21,12,6,18};
vector<vector<int>> filled_function_param0 {{3,3,6,7,9,11,15,15,17,19,21,23,26,27,37,48,48,51,53,53,59,64,69,69,70,71,72,84,93,96},{66,-28,6,25,-65,19,-86,-86,-90,40,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,84,8,36,93,76,14,54,85,86},{-90,-82,-80,-73,-67,-62,-62,-61,-58,-56,-56,-52,-50,-49,-49,-43,-43,-30,-26,-26,-15,-14,-13,-4,10,19,20,22,26,29,34,35,37,45,49,52,54,66,67,80,84,87,89,90},{1,1,0,0,0,1,0,1,1,1,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,0,0,1,0,1,1,1},{10,11,13,19,19,30,33,36,40,42,44,47,49,52,53,58,66,68,72,82,87,89,90,94},{-46,-35,40,-76,-66,-47,36,-82,-43,12,-95,54,58,82,-87,-17,-71,-97,-10,4,23,86,-24},{0,0,0,0,0,1,1,1,1,1,1},{88,76,16,23,40,60,73,32,15,13,5,75,74,52,77,41,53,50,15,7,40,28,32,99,15,85}};
vector<int> filled_function_param1 {19,8,26,9,31,29,21,12,6,18};
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;
} | <vector> | [
"a) <vector>",
"b) b",
"c) (",
"d) n",
"e) return"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( char s1 [ ], char s2 [ ], int index = 0 ) {
s2 [ index ] = s1 [ index ];
if ( s1 [ index ] == '\0' ) return;
f_gold ( s1, s2, index + 1 );
}
bits/stdc++.h>
using namespace std;
void f_gold ( char s1 [ ], char s2 [ ], int index = 0 ) {
s2 [ index ] = s1 [ index ];
if ( s1 [ index ] == '\0' ) return;
f_gold ( s1, s2, index + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'v'},{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'},{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'},{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'},{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'},{'4'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'},{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}};
vector<vector<char>> param1 {{'Z'},{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'},{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'},{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'},{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'},{'8'},{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}};
vector<int> param2 {0,11,34,41,33,13,40,0,12,7};
vector<vector<char>> filled_function_param0 {{'v'},{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'},{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'},{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'},{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'},{'4'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'},{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}};
vector<vector<char>> filled_function_param1 {{'Z'},{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'},{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'},{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'},{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'},{'8'},{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}};
vector<int> filled_function_param2 {0,11,34,41,33,13,40,0,12,7};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),&filled_function_param1[i].front(),filled_function_param2[i]);
f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && equal(begin(param1[i]), end(param1[i]), begin(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 ( char s1 [ ], char s2 [ ], int [MASK] = 0 ) { s2 [ index ] = s1 [ index ]; if ( s1 [ index ] == '\0' ) return; f_gold ( s1, s2, index + 1 ); }bits/stdc++.h>
using namespace std;
void f_gold ( char s1 [ ], char s2 [ ], int index = 0 ) {
s2 [ index ] = s1 [ index ];
if ( s1 [ index ] == '\0' ) return;
f_gold ( s1, s2, index + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'v'},{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'},{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'},{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'},{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'},{'4'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'},{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}};
vector<vector<char>> param1 {{'Z'},{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'},{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'},{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'},{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'},{'8'},{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}};
vector<int> param2 {0,11,34,41,33,13,40,0,12,7};
vector<vector<char>> filled_function_param0 {{'v'},{'6','8','3','3','5','2','5','6','9','9','2','6','2','1','9','3','7'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'e','G','a','r','F','U','W','k','u','z','y','v','A','W','m','G','H','O','I','a','u','V','f','B','q','e','E','e','L','c',' ','w','K',' ','K','j','j','s','q','u','n','i','T','a','Y'},{'0','0','0','0','1','1','1','2','2','2','2','2','2','3','3','3','3','4','4','4','4','5','5','6','6','6','7','7','7','7','7','7','8','8','9','9','9','9'},{'1','0','0','1','0','1','1','1','0','0','0','1','0','0','0','1','1','0','0','0','0','1','1'},{' ','B','D','D','D','E','E','E','G','H','J','K','K','K','L','N','O','S','V','W','Y','Z','b','c','d','d','f','f','f','f','f','f','i','k','k','o','t','u','v','x','x','z'},{'4'},{'0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1'},{'D','I','u','K','e','s','n','z','d','y','S','P','y','r'}};
vector<vector<char>> filled_function_param1 {{'Z'},{'8','6','0','2','8','0','8','7','0','5','4','5','9','4','5','4','4'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'S','m','d','a','W','N','F','H','B','E','h','M','z','H','c','X','l','a','R','e','D','D','q','V','U','w','o','K','u','n','b','k','Y','M','L','H','L','X','H','r','D','o','A','Y','H'},{'0','0','0','0','0','1','1','1','2','2','2','3','3','4','4','4','5','5','5','5','6','6','7','7','7','7','7','8','8','8','8','9','9','9','9','9','9','9'},{'1','1','0','0','0','1','0','1','1','0','0','0','1','0','1','0','1','1','0','1','1','0','1'},{'G','G','J','K','L','N','Q','R','R','S','U','W','X','Y','Y','a','b','b','b','c','d','e','e','f','f','h','j','j','k','k','l','m','m','n','o','s','t','t','w','z','z','z'},{'8'},{'0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1'},{'N','h','M','N','n','F','Y','L','G','w','o','G','y','q'}};
vector<int> filled_function_param2 {0,11,34,41,33,13,40,0,12,7};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),&filled_function_param1[i].front(),filled_function_param2[i]);
f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && equal(begin(param1[i]), end(param1[i]), begin(filled_function_param1[i])) && param2[i] == filled_function_param2[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | index | [
"a) =",
"b) index",
"c) ;",
"d) <<",
"e) f_gold"
] | 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 str [ ], int l, int h ) {
if ( l > h ) return INT_MAX;
if ( l == h ) return 0;
if ( l == h - 1 ) return ( str [ l ] == str [ h ] ) ? 0 : 1;
return ( str [ l ] == str [ h ] ) ? f_gold ( str, l + 1, h - 1 ) : ( min ( f_gold ( str, l, h - 1 ), f_gold ( str, l + 1, h ) ) + 1 );
}
( l == h - 1 ) return ( str [ l ] == str [ h ] ) ? 0 : 1;
return ( str [ l ] == str [ h ] ) ? f_gold ( str, l + 1, h - 1 ) : ( min ( f_gold ( str, l, h - 1 ), f_gold ( str, l + 1, h ) ) + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'F','F','J','K','K','L','P','S','T','V','W','Y','b','d','j','l','t','u','x','y'},{'0','1','8','8','8','4','4','3','9','6','5','2','8','2','0','2','6','0','7','7','3','2','4','5','9','7','2','4','1','8','7','9','8','0','8','5','4','2','3'},{'1'},{'g','y','r','M','v','z',' ','k','S','P','x','p','E','z','T','K','k','B','s','P','p','e','G','t','r','M','p',' ','H','a'},{'0','1','1','1','1','1','1','2','2','2','2','3','3','3','3','3','4','4','4','5','5','5','5','5','6','6','6','6','6','6','6','7','8','8','8','9','9'},{'1','1','0','1','0','1','0','1','0','1','1','1','1','1','1','0'},{' ',' ',' ','B','C','C','D','I','K','O','P','R','T','V','W','a','b','d','j','y'},{'5','0','8','6','9','3','0','3','2','0','6','2','3','7','8','9','2','0','1','9','4','1','3','1','9','2','3','4','1','2','3','8','1'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'X','B','E','v','K','t','k','K','Q','s','V','N','l','k','T','N','J','z','f','p','J','g','S','P','M','b','H','L','v','E','A','n','D','U','c','s','M','Q','P','g','g',' '}};
vector<int> param1 {11,19,0,24,33,13,16,31,37,26};
vector<int> param2 {11,22,0,27,34,8,14,25,35,27};
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 ( char str [ ], int l, int h ) { if ( l > h ) return INT_MAX; if ( l == h ) return 0; if ( l == h - 1 ) return ( str [ l ] == str [ h ] ) ? 0 : 1; return ( str [ l ] == str [ h ] ) ? f_gold ( str, l + [MASK] h - 1 ) : ( min ( f_gold ( str, l, h - 1 ), f_gold ( str, l + 1, h ) ) + 1 ); }( l == h - 1 ) return ( str [ l ] == str [ h ] ) ? 0 : 1;
return ( str [ l ] == str [ h ] ) ? f_gold ( str, l + 1, h - 1 ) : ( min ( f_gold ( str, l, h - 1 ), f_gold ( str, l + 1, h ) ) + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<char>> param0 {{'F','F','J','K','K','L','P','S','T','V','W','Y','b','d','j','l','t','u','x','y'},{'0','1','8','8','8','4','4','3','9','6','5','2','8','2','0','2','6','0','7','7','3','2','4','5','9','7','2','4','1','8','7','9','8','0','8','5','4','2','3'},{'1'},{'g','y','r','M','v','z',' ','k','S','P','x','p','E','z','T','K','k','B','s','P','p','e','G','t','r','M','p',' ','H','a'},{'0','1','1','1','1','1','1','2','2','2','2','3','3','3','3','3','4','4','4','5','5','5','5','5','6','6','6','6','6','6','6','7','8','8','8','9','9'},{'1','1','0','1','0','1','0','1','0','1','1','1','1','1','1','0'},{' ',' ',' ','B','C','C','D','I','K','O','P','R','T','V','W','a','b','d','j','y'},{'5','0','8','6','9','3','0','3','2','0','6','2','3','7','8','9','2','0','1','9','4','1','3','1','9','2','3','4','1','2','3','8','1'},{'0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','0','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1','1'},{'X','B','E','v','K','t','k','K','Q','s','V','N','l','k','T','N','J','z','f','p','J','g','S','P','M','b','H','L','v','E','A','n','D','U','c','s','M','Q','P','g','g',' '}};
vector<int> param1 {11,19,0,24,33,13,16,31,37,26};
vector<int> param2 {11,22,0,27,34,8,14,25,35,27};
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;
} | 1, | [
"a) (",
"b) ]",
"c) {",
"d) [",
"e) 1,"
] | 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 input, int unlock_code ) {
int rotation = 0;
int input_digit, code_digit;
while ( input || unlock_code ) {
input_digit = input % 10;
code_digit = unlock_code % 10;
rotation += min ( abs ( input_digit - code_digit ), 10 - abs ( input_digit - code_digit ) );
input /= 10;
unlock_code /= 10;
}
return rotation;
}
code_digit = unlock_code % 10;
rotation += min ( abs ( input_digit - code_digit ), 10 - abs ( input_digit - code_digit ) );
input /= 10;
unlock_code /= 10;
}
return rotation;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,90,28,41,32,39,33,89,50,92};
vector<int> param1 {46,65,84,23,58,82,58,32,51,77};
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 input, int unlock_code ) { int rotation = 0; int input_digit, code_digit; while ( input || unlock_code [MASK] { input_digit = input % 10; code_digit = unlock_code % 10; rotation += min ( abs ( input_digit - code_digit ), 10 - abs ( input_digit - code_digit ) ); input /= 10; unlock_code /= 10; } return rotation; } code_digit = unlock_code % 10;
rotation += min ( abs ( input_digit - code_digit ), 10 - abs ( input_digit - code_digit ) );
input /= 10;
unlock_code /= 10;
}
return rotation;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,90,28,41,32,39,33,89,50,92};
vector<int> param1 {46,65,84,23,58,82,58,32,51,77};
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) (int",
"c) def",
"d) )",
"e) int"
] | d |
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 ) {
return 1162261467 % n == 0;
}
>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return 1162261467 % n == 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,27,9,-9,11,57,21,60,44};
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 [MASK] { return 1162261467 % n == 0; }>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return 1162261467 % n == 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,27,9,-9,11,57,21,60,44};
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) for",
"b) int",
"c) )",
"d) (",
"e) len"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( unsigned int n ) {
return n & ( n - 1 );
}
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( unsigned int n ) {
return n & ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,54,60,32,41,64,4,51,57,92};
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 ( unsigned int n ) { [MASK] n & ( n - 1 ); }#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( unsigned int n ) {
return n & ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,54,60,32,41,64,4,51,57,92};
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) arr",
"b) '0'",
"c) i",
"d) [",
"e) return"
] | 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 maxA = INT_MIN, maxB = INT_MIN, maxC = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] > maxA ) {
maxC = maxB;
maxB = maxA;
maxA = arr [ i ];
}
else if ( arr [ i ] > maxB ) {
maxC = maxB;
maxB = arr [ i ];
}
else if ( arr [ i ] > maxC ) maxC = arr [ i ];
}
return ( maxA + maxB + maxC );
}
axA = arr [ i ];
}
else if ( arr [ i ] > maxB ) {
maxC = maxB;
maxB = arr [ i ];
}
else if ( arr [ i ] > maxC ) maxC = arr [ i ];
}
return ( maxA + maxB + maxC );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,12,21,22,25,27,28,28,31,32,32,41,45,47,51,53,60,61,61,63,71,74,82,83,85,88,92,96,96},{-52,26,74,-62,-76},{0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{63,71,15,28,31,84,8,17,24,42,66,95,30},{-94,-92,-92,-90,-88,-88,-86,-82,-80,-78,-66,-54,-52,-52,-46,-46,-42,-36,-32,-24,-24,-14,-14,-14,-12,-10,0,6,8,20,24,24,28,38,38,52,54,56,64,74,74,76,82,94,94},{0,0,0,1,1,0,1,0,1,1,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0,1,0,0,0,1,0},{15,19,80},{4,80,18,74,36,-30,-72,-28,-32,-16,-8,38,78,-48,98,-64,86,-60,-44,84,-98,40,14,30,44,90,-30,-42,24,-28,24,40,-96,98,90,-68,-54,-52,62,34,-98,68,-56,-94,-78,-12,28},{0,1,1,1,1,1},{2,18,96,7,99,83,3,88,23,77,6,28,55,49,69,55,48,76,43,11,43,44,17,74,27,64,76,77,53,26,73,12,19,62,18,34,13,31,97,96,85,27,30,97,89,25}};
vector<int> param1 {28,2,11,6,31,30,2,41,3,41};
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 maxA = INT_MIN, maxB = INT_MIN, maxC = INT_MIN; for ( int i = 0; i < n; i ++ ) { if ( arr [ i ] > maxA ) { maxC = maxB; maxB = maxA; maxA = arr [ i ]; } else if ( arr [ i ] > maxB ) { maxC = maxB; maxB = arr [ i ]; } else if ( arr [ i ] > maxC ) maxC = arr [ i ]; } return ( maxA + maxB + maxC ); [MASK]axA = arr [ i ];
}
else if ( arr [ i ] > maxB ) {
maxC = maxB;
maxB = arr [ i ];
}
else if ( arr [ i ] > maxC ) maxC = arr [ i ];
}
return ( maxA + maxB + maxC );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,12,21,22,25,27,28,28,31,32,32,41,45,47,51,53,60,61,61,63,71,74,82,83,85,88,92,96,96},{-52,26,74,-62,-76},{0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{63,71,15,28,31,84,8,17,24,42,66,95,30},{-94,-92,-92,-90,-88,-88,-86,-82,-80,-78,-66,-54,-52,-52,-46,-46,-42,-36,-32,-24,-24,-14,-14,-14,-12,-10,0,6,8,20,24,24,28,38,38,52,54,56,64,74,74,76,82,94,94},{0,0,0,1,1,0,1,0,1,1,0,1,0,1,0,0,0,1,0,1,1,1,0,1,0,0,0,0,1,1,0,0,0,0,1,0,1,1,0,1,0,0,0,1,0},{15,19,80},{4,80,18,74,36,-30,-72,-28,-32,-16,-8,38,78,-48,98,-64,86,-60,-44,84,-98,40,14,30,44,90,-30,-42,24,-28,24,40,-96,98,90,-68,-54,-52,62,34,-98,68,-56,-94,-78,-12,28},{0,1,1,1,1,1},{2,18,96,7,99,83,3,88,23,77,6,28,55,49,69,55,48,76,43,11,43,44,17,74,27,64,76,77,53,26,73,12,19,62,18,34,13,31,97,96,85,27,30,97,89,25}};
vector<int> param1 {28,2,11,6,31,30,2,41,3,41};
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) <bits/stdc++.h>",
"c) <cstdlib>",
"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 lioes [ n ];
int maxLen = 0;
for ( int i = 0;
i < n;
i ++ ) lioes [ i ] = 1;
for ( int i = 1;
i < n;
i ++ ) for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && ( arr [ i ] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1;
for ( int i = 0;
i < n;
i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ];
return maxLen;
}
] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1;
for ( int i = 0;
i < n;
i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ];
return maxLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,8,9,16,16,27,32,33,35,35,39,39,41,42,44,47,48,50,56,59,66,69,70,73,74,76,78,87,87,89,94,96,96,98,98},{40,76,-54,-92,-28,-96,8,60,28,-38,-62,-40,-16,16,52,28,70,-56,-50,46,68,-16,-56,46,42,70,52,-34,86,-32,-50,64,36,54,20,82,84},{0,0,0,0,1,1,1},{15,19,87,44,15,48,21,85,90,30,88,95,48,92,29,52,46,46,7,23,96,97,43},{-98,-96,-94,-94,-94,-80,-80,-78,-64,-62,-62,-46,-42,-38,-36,-36,-34,-32,-20,-18,-16,-12,-8,-4,-4,-2,-2,2,6,12,34,40,42,44,46,46,50,54,58,58,70,72,72,76,78,86},{0,0,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1},{6,7,19,36,44,63,68,72,83},{-64,12,56,50,94,6,0,70,-70,46,-84,-64,4,76,28,94,-8,24,76,64,-62,-34},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,57,20,8,90,69,15,62,45,14,65,20,48,9}};
vector<int> param1 {32,25,4,19,33,13,8,15,21,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 ) { int lioes [ n ]; int maxLen = 0; for ( int i = 0; i < n; i ++ ) lioes [ i ] = 1; for ( int i = 1; i < n; i ++ ) for ( [MASK] j = 0; j < i; j ++ ) if ( arr [ i ] > arr [ j ] && ( arr [ i ] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1; for ( int i = 0; i < n; i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ]; return maxLen; }] + arr [ j ] ) % 2 != 0 && lioes [ i ] < lioes [ j ] + 1 ) lioes [ i ] = lioes [ j ] + 1;
for ( int i = 0;
i < n;
i ++ ) if ( maxLen < lioes [ i ] ) maxLen = lioes [ i ];
return maxLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,8,9,16,16,27,32,33,35,35,39,39,41,42,44,47,48,50,56,59,66,69,70,73,74,76,78,87,87,89,94,96,96,98,98},{40,76,-54,-92,-28,-96,8,60,28,-38,-62,-40,-16,16,52,28,70,-56,-50,46,68,-16,-56,46,42,70,52,-34,86,-32,-50,64,36,54,20,82,84},{0,0,0,0,1,1,1},{15,19,87,44,15,48,21,85,90,30,88,95,48,92,29,52,46,46,7,23,96,97,43},{-98,-96,-94,-94,-94,-80,-80,-78,-64,-62,-62,-46,-42,-38,-36,-36,-34,-32,-20,-18,-16,-12,-8,-4,-4,-2,-2,2,6,12,34,40,42,44,46,46,50,54,58,58,70,72,72,76,78,86},{0,0,1,1,0,1,0,1,0,1,1,0,1,0,0,1,0,1,0,1,0,0,0,1,0,0,1},{6,7,19,36,44,63,68,72,83},{-64,12,56,50,94,6,0,70,-70,46,-84,-64,4,76,28,94,-8,24,76,64,-62,-34},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,57,20,8,90,69,15,62,45,14,65,20,48,9}};
vector<int> param1 {32,25,4,19,33,13,8,15,21,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;
} | int | [
"a) n;",
"b) #include",
"c) y)?",
"d) )",
"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 n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 );
}
lude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {55,36,69,92,73,16,88,19,66,68};
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 ) { return 1 + ( n * 2 ) [MASK] ( n * ( ( n * n ) - 1 ) / 2 ); }lude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return 1 + ( n * 2 ) + ( n * ( ( n * n ) - 1 ) / 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {55,36,69,92,73,16,88,19,66,68};
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) #include"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string num ) {
int series [ ] = {
1, 3, 2, - 1, - 3, - 2 };
int series_index = 0;
int result = 0;
for ( int i = num . size ( ) - 1;
i >= 0;
i -- ) {
int digit = num [ i ] - '0';
result += digit * series [ series_index ];
series_index = ( series_index + 1 ) % 6;
result %= 7;
}
if ( result < 0 ) result = ( result + 7 ) % 7;
return result;
}
result += digit * series [ series_index ];
series_index = ( series_index + 1 ) % 6;
result %= 7;
}
if ( result < 0 ) result = ( result + 7 ) % 7;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"K","850076","00111","X","1","10010001100"," pgPeLz","53212456821275","101","V"};
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 num ) { int series [ ] = { 1, 3, 2, - 1, - 3, - 2 }; int series_index = 0; int result = 0; for ( int i = num . size ( ) - 1; i >= 0; i -- ) { int digit [MASK] num [ i ] - '0'; result += digit * series [ series_index ]; series_index = ( series_index + 1 ) % 6; result %= 7; } if ( result < 0 ) result = ( result + 7 ) % 7; return result; } result += digit * series [ series_index ];
series_index = ( series_index + 1 ) % 6;
result %= 7;
}
if ( result < 0 ) result = ( result + 7 ) % 7;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"K","850076","00111","X","1","10010001100"," pgPeLz","53212456821275","101","V"};
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) java.util.stream.*;",
"d) return",
"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 i, j, max = 0;
int msis [ n ];
for ( i = 0;
i < n;
i ++ ) msis [ i ] = arr [ i ];
for ( i = 1;
i < n;
i ++ ) for ( j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ];
for ( i = 0;
i < n;
i ++ ) if ( max < msis [ i ] ) max = msis [ i ];
return max;
}
if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ];
for ( i = 0;
i < n;
i ++ ) if ( max < msis [ i ] ) max = msis [ i ];
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,7,12,23,31,31,45,47,60,67,70,84,85,91,96},{-88,-38,-50,-14,36,-32,0,-8,-12,-62,-46,66,-46,-26,6,-44,14,-74,-84,52,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,42,7,35,35,21,97,59,88,50,12,44,85,22,38,23,42,61,44,63,23,69,28,17,73,20,71,80,15,42,28,10,56,77,43},{-92,-82,-82,-74,-72,-68,-68,-66,-60,-54,-42,-38,-36,-32,-30,-16,-14,-12,-10,14,24,28,34,34,38,42,44,52,70,72,80,84,86,94},{0,1,1,1,1,1,0,1,1,0,1,0,0,0},{33},{76,86,46,-70,92,6,70,-66,64,46,86,-42,-46,-24,8,76,4,-96,-86,18,70,-72,-56,-88,-96,62,22,20,42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{25,46,41,61,93,29,65,24,10,89,22,51,18,65,70,59,87,82,97,99,15,64,20,97,12,23,76}};
vector<int> param1 {11,18,39,26,32,8,0,21,24,20};
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 i, j, max = 0; int msis [ n ]; for ( i = 0; i < n; i ++ ) msis [ i ] = arr [ i ]; for ( i = 1; i < n; i ++ ) for ( j = 0; j < i; j ++ ) if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ]; for ( i = [MASK] i < n; i ++ ) if ( max < msis [ i ] ) max = msis [ i ]; return max; } if ( arr [ i ] > arr [ j ] && msis [ i ] < msis [ j ] + arr [ i ] ) msis [ i ] = msis [ j ] + arr [ i ];
for ( i = 0;
i < n;
i ++ ) if ( max < msis [ i ] ) max = msis [ i ];
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,5,7,12,23,31,31,45,47,60,67,70,84,85,91,96},{-88,-38,-50,-14,36,-32,0,-8,-12,-62,-46,66,-46,-26,6,-44,14,-74,-84,52,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,42,7,35,35,21,97,59,88,50,12,44,85,22,38,23,42,61,44,63,23,69,28,17,73,20,71,80,15,42,28,10,56,77,43},{-92,-82,-82,-74,-72,-68,-68,-66,-60,-54,-42,-38,-36,-32,-30,-16,-14,-12,-10,14,24,28,34,34,38,42,44,52,70,72,80,84,86,94},{0,1,1,1,1,1,0,1,1,0,1,0,0,0},{33},{76,86,46,-70,92,6,70,-66,64,46,86,-42,-46,-24,8,76,4,-96,-86,18,70,-72,-56,-88,-96,62,22,20,42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{25,46,41,61,93,29,65,24,10,89,22,51,18,65,70,59,87,82,97,99,15,64,20,97,12,23,76}};
vector<int> param1 {11,18,39,26,32,8,0,21,24,20};
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;
} | 0; | [
"a) x",
"b) 0;",
"c) rightOne",
"d) s",
"e) 2"
] | 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 sum = 0;
for ( int n = 1;
sum < s;
n ++ ) {
sum += n * n;
if ( sum == s ) return n;
}
return - 1;
}
ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int s ) {
int sum = 0;
for ( int n = 1;
sum < s;
n ++ ) {
sum += n * n;
if ( sum == s ) return n;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,5,14,140,204,3,506,42,4,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; int f_gold ( int s ) { int sum = 0; [MASK] ( int n = 1; sum < s; n ++ ) { sum += n * n; if ( sum == s ) return n; } return - 1; }ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int s ) {
int sum = 0;
for ( int n = 1;
sum < s;
n ++ ) {
sum += n * n;
if ( sum == s ) return n;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,5,14,140,204,3,506,42,4,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;
} | for | [
"a) :",
"b) ]",
"c) (",
"d) in",
"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 n, int m ) {
return ( n == m ) ? n : 1;
}
clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int m ) {
return ( n == m ) ? n : 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,22,17,74,93,56,5,5,9,98};
vector<int> param1 {57,22,17,74,22,54,33,68,75,21};
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 [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int m ) { return ( n == m ) ? n : 1; }clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int m ) {
return ( n == m ) ? n : 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,22,17,74,93,56,5,5,9,98};
vector<int> param1 {57,22,17,74,22,54,33,68,75,21};
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;
} | <string> | [
"a) #include",
"b) n",
"c) (",
"d) <string>",
"e) y)?"
] | 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 k ) {
unordered_map < int, int > um;
int mod_arr [ n ], max = 0;
int curr_sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
curr_sum += arr [ i ];
mod_arr [ i ] = ( ( curr_sum % k ) + k ) % k;
}
for ( int i = 0;
i < n;
i ++ ) {
if ( mod_arr [ i ] == 0 ) max = i + 1;
else if ( um . find ( mod_arr [ i ] ) == um . end ( ) ) um [ mod_arr [ i ] ] = i;
else if ( max < ( i - um [ mod_arr [ i ] ] ) ) max = i - um [ mod_arr [ i ] ];
}
return max;
}
i + 1;
else if ( um . find ( mod_arr [ i ] ) == um . end ( ) ) um [ mod_arr [ i ] ] = i;
else if ( max < ( i - um [ mod_arr [ i ] ] ) ) max = i - um [ mod_arr [ i ] ];
}
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,16,17,17,31,32,34,35,37,38,39,46,47,52,57,58,60,61,69,75,76,77,81,88,97},{-16,64,-62,-86,10,-40,52,50,-42,34,-32,-32,90,72,-96,-46,-6,92,14,98,-66,96,-48,-80,-22,-82,-50,-60,-70,82,-78,-68,88,-56,24,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{33,1,92,27,17,46,79,78,95,34,3,56,12,26,24,60,58,63,98,8,76,73,26,58,38,49,43,59,83,21,13,99,3,89,32,21,14,95,8,7,99,83,59,2,69,44,66},{-92,-76,-58,-56,-54,-20,-18,-16,-14,8,20,52,72,82,82,84},{1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0,0,0,0},{7,7,8,9,13,14,16,18,19,20,24,24,30,32,32,45,49,55,62,62,84,90,90,93,95,98},{-28,-52,-84,-98,48,74,48,-34,-38,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,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{30,44,9,92,82,11,66,22,87,20}};
vector<int> param1 {23,35,13,40,15,34,22,7,28,9};
vector<int> param2 {23,21,13,37,15,26,14,8,37,9};
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 k ) { unordered_map < int, int > um; int mod_arr [ n ], max = 0; int curr_sum = 0; for ( int i = 0; i < n; i ++ ) { curr_sum += arr [ i ]; mod_arr [ i ] = ( ( curr_sum % k ) + k ) % k; } for ( int i = 0; i < n; i ++ ) { if ( mod_arr [ i ] == 0 ) max = i + 1; else if ( um . find ( mod_arr [ i ] ) == um . end ( ) ) um [ mod_arr [ i ] ] = i; else if ( max < ( i - um [ mod_arr [ i ] [MASK] ) ) max = i - um [ mod_arr [ i ] ]; } return max; } i + 1;
else if ( um . find ( mod_arr [ i ] ) == um . end ( ) ) um [ mod_arr [ i ] ] = i;
else if ( max < ( i - um [ mod_arr [ i ] ] ) ) max = i - um [ mod_arr [ i ] ];
}
return max;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,16,17,17,31,32,34,35,37,38,39,46,47,52,57,58,60,61,69,75,76,77,81,88,97},{-16,64,-62,-86,10,-40,52,50,-42,34,-32,-32,90,72,-96,-46,-6,92,14,98,-66,96,-48,-80,-22,-82,-50,-60,-70,82,-78,-68,88,-56,24,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{33,1,92,27,17,46,79,78,95,34,3,56,12,26,24,60,58,63,98,8,76,73,26,58,38,49,43,59,83,21,13,99,3,89,32,21,14,95,8,7,99,83,59,2,69,44,66},{-92,-76,-58,-56,-54,-20,-18,-16,-14,8,20,52,72,82,82,84},{1,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0,1,0,0,0,0},{7,7,8,9,13,14,16,18,19,20,24,24,30,32,32,45,49,55,62,62,84,90,90,93,95,98},{-28,-52,-84,-98,48,74,48,-34,-38,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,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{30,44,9,92,82,11,66,22,87,20}};
vector<int> param1 {23,35,13,40,15,34,22,7,28,9};
vector<int> param2 {23,21,13,37,15,26,14,8,37,9};
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) int",
"b) cmpfunc",
"c) 1",
"d) r",
"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 m, int n ) {
int path = 1;
for ( int i = n;
i < ( m + n - 1 );
i ++ ) {
path *= i;
path /= ( i - n + 1 );
}
return path;
}
<bits/stdc++.h>
using namespace std;
int f_gold ( int m, int n ) {
int path = 1;
for ( int i = n;
i < ( m + n - 1 );
i ++ ) {
path *= i;
path /= ( i - n + 1 );
}
return path;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {10,52,5,84,27,77,52,3,5,14};
vector<int> param1 {3,8,23,56,30,90,50,25,75,18};
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 [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int m, int n ) { int path = 1; for ( int i = n; i < ( m + n - 1 ); i ++ ) { path *= i; path /= ( i - n + 1 ); } return path; }<bits/stdc++.h>
using namespace std;
int f_gold ( int m, int n ) {
int path = 1;
for ( int i = n;
i < ( m + n - 1 );
i ++ ) {
path *= i;
path /= ( i - n + 1 );
}
return path;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {10,52,5,84,27,77,52,3,5,14};
vector<int> param1 {3,8,23,56,30,90,50,25,75,18};
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;
} | <string> | [
"a) d",
"b) =",
"c) )",
"d) <string>",
"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 ) {
return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 );
}
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,99,66,97,95,42,95,89,3,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; int f_gold ( int x ) { return ( ( [MASK] & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 ); }#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( ( x & 0x0F ) << 4 | ( x & 0xF0 ) >> 4 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,99,66,97,95,42,95,89,3,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;
} | x | [
"a) x",
"b) HashMap",
"c) )",
"d) ;",
"e) <string>"
] | 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 [ ], int n ) {
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) sum += ( abs ( x [ i ] - x [ j ] ) + abs ( y [ i ] - y [ j ] ) );
return sum;
}
], int y [ ], int n ) {
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) sum += ( abs ( x [ i ] - x [ j ] ) + abs ( y [ i ] - y [ j ] ) );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,6,8,11,12,13,14,19,20,22,24,28,29,30,32,35,37,44,48,49,51,51,56,59,59,62,65,68,68,68,72,75,77,78,89,89,91,93,95,99},{16,76,2,42,-24,-82,68,-2,98,-42,-72,28,-22,-52,28,-38,36,66,84,64,-28,86,52,84,-98,-30},{0,0,0,0,0,1,1,1,1,1},{61,37,57,99,22,72,38,85,23,85,15,4,49,9,15,25,7,63,79,6,85,30,12,34,38,6,59,62,59,34,72,97,70,44,95,58,99},{-96,-86,-82,-72,-72,-64,-62,-60,-56,-56,-56,-54,-52,-40,-36,-30,-10,10,18,26,28,56,56,56,64,90,92,94},{1,0,1,1,1,0,1},{6,10,24,25,31,41,43,45,47,65,67,90},{-74,92,34,56,-54,-98,-76,-34,16,32,-4,-16,22,90,-52,-90,-60,70,-40,78,96,-68,78,-56,-94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{20,32}};
vector<vector<int>> param1 {{6,19,19,22,25,27,31,33,34,35,37,38,38,44,46,50,51,55,58,58,64,64,64,64,65,66,66,66,67,70,75,78,79,81,81,81,82,84,84,86,94,96},{-34,92,-24,-62,28,72,-10,10,8,90,-72,-24,50,-46,52,58,68,-62,-64,-78,-12,24,62,-30,62,-60},{0,0,0,0,1,1,1,1,1,1},{72,41,77,62,78,36,75,28,91,39,32,56,60,64,21,15,80,85,28,22,53,58,69,62,60,48,66,91,38,66,54,5,24,1,49,71,49},{-98,-98,-96,-96,-82,-80,-80,-68,-62,-60,-46,-38,-26,-26,-20,-18,16,22,24,26,34,46,52,52,74,76,90,92},{1,0,1,0,0,1,1},{4,7,11,19,21,39,57,80,84,93,94,97},{14,20,24,-92,58,12,78,78,-90,96,-44,36,30,-46,-30,-80,26,-2,26,28,-16,-50,-2,-36,-8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{23,50}};
vector<int> param2 {37,24,5,26,26,3,10,21,23,1};
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 x [ ], int y [ ], int n ) { int sum = 0; for ( int i = [MASK] i < n; i ++ ) for ( int j = i + 1; j < n; j ++ ) sum += ( abs ( x [ i ] - x [ j ] ) + abs ( y [ i ] - y [ j ] ) ); return sum; }], int y [ ], int n ) {
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) sum += ( abs ( x [ i ] - x [ j ] ) + abs ( y [ i ] - y [ j ] ) );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,6,8,11,12,13,14,19,20,22,24,28,29,30,32,35,37,44,48,49,51,51,56,59,59,62,65,68,68,68,72,75,77,78,89,89,91,93,95,99},{16,76,2,42,-24,-82,68,-2,98,-42,-72,28,-22,-52,28,-38,36,66,84,64,-28,86,52,84,-98,-30},{0,0,0,0,0,1,1,1,1,1},{61,37,57,99,22,72,38,85,23,85,15,4,49,9,15,25,7,63,79,6,85,30,12,34,38,6,59,62,59,34,72,97,70,44,95,58,99},{-96,-86,-82,-72,-72,-64,-62,-60,-56,-56,-56,-54,-52,-40,-36,-30,-10,10,18,26,28,56,56,56,64,90,92,94},{1,0,1,1,1,0,1},{6,10,24,25,31,41,43,45,47,65,67,90},{-74,92,34,56,-54,-98,-76,-34,16,32,-4,-16,22,90,-52,-90,-60,70,-40,78,96,-68,78,-56,-94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{20,32}};
vector<vector<int>> param1 {{6,19,19,22,25,27,31,33,34,35,37,38,38,44,46,50,51,55,58,58,64,64,64,64,65,66,66,66,67,70,75,78,79,81,81,81,82,84,84,86,94,96},{-34,92,-24,-62,28,72,-10,10,8,90,-72,-24,50,-46,52,58,68,-62,-64,-78,-12,24,62,-30,62,-60},{0,0,0,0,1,1,1,1,1,1},{72,41,77,62,78,36,75,28,91,39,32,56,60,64,21,15,80,85,28,22,53,58,69,62,60,48,66,91,38,66,54,5,24,1,49,71,49},{-98,-98,-96,-96,-82,-80,-80,-68,-62,-60,-46,-38,-26,-26,-20,-18,16,22,24,26,34,46,52,52,74,76,90,92},{1,0,1,0,0,1,1},{4,7,11,19,21,39,57,80,84,93,94,97},{14,20,24,-92,58,12,78,78,-90,96,-44,36,30,-46,-30,-80,26,-2,26,28,-16,-50,-2,-36,-8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{23,50}};
vector<int> param2 {37,24,5,26,26,3,10,21,23,1};
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;
} | 0; | [
"a) 0;",
"b) n,",
"c) res",
"d) )",
"e) 1"
] | 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 m ) {
int dp [ m + 1 ] [ n + 1 ];
for ( int i = 0;
i <= m;
i ++ ) dp [ i ] [ 0 ] = 1;
for ( int i = 0;
i <= m;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= m;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] + dp [ i ] [ j - 1 ];
return dp [ m ] [ n ];
}
] [ i ] = 1;
for ( int i = 1;
i <= m;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] + dp [ i ] [ j - 1 ];
return dp [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,80,33,31,34,3,11,70,67,91};
vector<int> param1 {52,66,49,64,63,1,58,69,61,72};
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 m ) { int dp [ m + 1 ] [ n + 1 ]; for ( int i = 0; i <= m; i ++ ) dp [ i ] [ 0 ] = 1; for ( int i = [MASK] i <= m; i ++ ) dp [ 0 ] [ i ] = 1; for ( int i = 1; i <= m; i ++ ) for ( int j = 1; j <= n; j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] + dp [ i ] [ j - 1 ]; return dp [ m ] [ n ]; }] [ i ] = 1;
for ( int i = 1;
i <= m;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i - 1 ] [ j - 1 ] + dp [ i ] [ j - 1 ];
return dp [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,80,33,31,34,3,11,70,67,91};
vector<int> param1 {52,66,49,64,63,1,58,69,61,72};
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;
} | 0; | [
"a) x",
"b) 0;",
"c) #include",
"d) int",
"e) java.util.stream.*;"
] | 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 num ) {
if ( num < 0 ) return false;
int sum = 0;
for ( int n = 1;
sum <= num;
n ++ ) {
sum = sum + n;
if ( sum == num ) return true;
}
return false;
}
std;
bool f_gold ( int num ) {
if ( num < 0 ) return false;
int sum = 0;
for ( int n = 1;
sum <= num;
n ++ ) {
sum = sum + n;
if ( sum == num ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {97,97,32,40,18,14,90,39,1,57};
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 [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int num ) { if ( num < 0 ) return false; int sum = 0; for ( int n = 1; sum <= num; n ++ ) { sum = sum + n; if ( sum == num ) return true; } return false; }std;
bool f_gold ( int num ) {
if ( num < 0 ) return false;
int sum = 0;
for ( int n = 1;
sum <= num;
n ++ ) {
sum = sum + n;
if ( sum == num ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {97,97,32,40,18,14,90,39,1,57};
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;
} | <cstdlib> | [
"a) =",
"b) #include",
"c) <cstdlib>",
"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 ) {
n --;
int sum = 0;
sum += ( n * ( n + 1 ) ) / 2;
sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6;
return sum;
}
iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
n --;
int sum = 0;
sum += ( n * ( n + 1 ) ) / 2;
sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,89,76,2,81,11,26,35,16,66};
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 [MASK] #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { n --; int sum = 0; sum += ( n * ( n + 1 ) ) / 2; sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6; return sum; }iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
n --;
int sum = 0;
sum += ( n * ( n + 1 ) ) / 2;
sum += ( n * ( n + 1 ) * ( 2 * n + 1 ) ) / 6;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,89,76,2,81,11,26,35,16,66};
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;
} | <iomanip> | [
"a) <iomanip>",
"b) }",
"c) ,",
"d) l",
"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 n, int x ) {
int curr_sum = 0, min_len = n + 1;
int start = 0, end = 0;
while ( end < n ) {
while ( curr_sum <= x && end < n ) {
if ( curr_sum <= 0 && x > 0 ) {
start = end;
curr_sum = 0;
}
curr_sum += arr [ end ++ ];
}
while ( curr_sum > x && start < n ) {
if ( end - start < min_len ) min_len = end - start;
curr_sum -= arr [ start ++ ];
}
}
return min_len;
}
r_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 {{2,4,5,10,14,15,16,20,23,28,31,35,36,36,43,48,49,55,57,57,58,61,64,64,68,70,70,73,74,76,76,77,81,81,82,87,89,92,99},{66,-20,12,-48,22,28,40,-30,-6,-96,10,-88,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,19,38,31,17,27,60,35,19,47,34,51,3,95,33,29,84,46,74,87},{-48,-2},{1,1,0,1,1,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1},{1,4,4,6,8,10,12,12,13,15,18,20,21,23,25,28,28,33,33,35,35,36,37,38,42,44,63,63,65,65,65,66,70,74,77,78,80,80,84,87,87,89,92,93,94,97,98,99},{-82,-12,-40,58,22,-76,-94,-28,42,36,64},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{76,65,96,76,1,91,22,29,95,21,73,68,30,52,73,86,52,66,67,37,76,53,68,6,95,81,98,42,63,38,92,78,59,86,10,38,18,15,52,62,16,66}};
vector<int> param1 {33,11,42,15,1,12,42,10,10,23};
vector<int> param2 {28,12,23,15,1,15,27,6,14,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 arr [ ], int n, int x ) [MASK] int curr_sum = 0, min_len = n + 1; int start = 0, end = 0; while ( end < n ) { while ( curr_sum <= x && end < n ) { if ( curr_sum <= 0 && x > 0 ) { start = end; curr_sum = 0; } curr_sum += arr [ end ++ ]; } while ( curr_sum > x && start < n ) { if ( end - start < min_len ) min_len = end - start; curr_sum -= arr [ start ++ ]; } } return min_len; }r_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 {{2,4,5,10,14,15,16,20,23,28,31,35,36,36,43,48,49,55,57,57,58,61,64,64,68,70,70,73,74,76,76,77,81,81,82,87,89,92,99},{66,-20,12,-48,22,28,40,-30,-6,-96,10,-88,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,19,38,31,17,27,60,35,19,47,34,51,3,95,33,29,84,46,74,87},{-48,-2},{1,1,0,1,1,1,1,0,1,0,1,1,0,1,1,0,1,1,0,1,1,1},{1,4,4,6,8,10,12,12,13,15,18,20,21,23,25,28,28,33,33,35,35,36,37,38,42,44,63,63,65,65,65,66,70,74,77,78,80,80,84,87,87,89,92,93,94,97,98,99},{-82,-12,-40,58,22,-76,-94,-28,42,36,64},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{76,65,96,76,1,91,22,29,95,21,73,68,30,52,73,86,52,66,67,37,76,53,68,6,95,81,98,42,63,38,92,78,59,86,10,38,18,15,52,62,16,66}};
vector<int> param1 {33,11,42,15,1,12,42,10,10,23};
vector<int> param2 {28,12,23,15,1,15,27,6,14,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) count",
"b) .",
"c) {",
"d) if",
"e) mid"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( int n ) {
int N = 10;
long long count = 1;
for ( int i = 1;
i <= n;
i ++ ) {
count *= ( N + i - 1 );
count /= i;
}
return count;
}
using namespace std;
long long int f_gold ( int n ) {
int N = 10;
long long count = 1;
for ( int i = 1;
i <= n;
i ++ ) {
count *= ( N + i - 1 );
count /= i;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,11,94,73,6,73,58,40,64,66};
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> [MASK] <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; long long int f_gold ( int n ) { int N = 10; long long count = 1; for ( int i = 1; i <= n; i ++ ) { count *= ( N + i - 1 ); count /= i; } return count; }using namespace std;
long long int f_gold ( int n ) {
int N = 10;
long long count = 1;
for ( int i = 1;
i <= n;
i ++ ) {
count *= ( N + i - 1 );
count /= i;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,11,94,73,6,73,58,40,64,66};
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) #include",
"b) i",
"c) ;",
"d) return",
"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 ( int a, int b, int c ) {
if ( a + b <= c || a + c <= b || b + c <= a ) return false;
else return true;
}
<fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int a, int b, int c ) {
if ( a + b <= c || a + c <= b || b + c <= a ) return false;
else return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {29,83,48,59,56,68,63,95,2,11};
vector<int> param1 {19,34,14,12,39,85,36,34,90,16};
vector<int> param2 {52,49,65,94,22,9,41,37,27,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; bool f_gold ( int a, int b, int c ) { if ( a + b <= c || a + c <= b || b + c <= a ) [MASK] false; else return true; }<fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int a, int b, int c ) {
if ( a + b <= c || a + c <= b || b + c <= a ) return false;
else return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {29,83,48,59,56,68,63,95,2,11};
vector<int> param1 {19,34,14,12,39,85,36,34,90,16};
vector<int> param2 {52,49,65,94,22,9,41,37,27,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;
} | return | [
"a) return",
"b) )",
"c) int",
"d) unordered_map",
"e) arr"
] | 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 max_len = 0;
for ( int i = 0;
i < n;
i ++ ) {
int curr_sum = 0;
for ( int j = i;
j < n;
j ++ ) {
curr_sum += arr [ j ];
if ( curr_sum == 0 ) max_len = max ( max_len, j - i + 1 );
}
}
return max_len;
}
+ ) {
int curr_sum = 0;
for ( int j = i;
j < n;
j ++ ) {
curr_sum += arr [ j ];
if ( curr_sum == 0 ) max_len = max ( max_len, j - i + 1 );
}
}
return max_len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,6,6,15,23,26,27,30,34,35,38,42,43,44,46,50,53,53,57,62,65,67,70,76,79,81,82,85,90},{72,-6,-24,-82,16,78,-82,38,-2,78,-60,40,26,-82,-32,-56,52,14,62,-18,-84,-94,48,54,2,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{14,67,44,5,60,87,23,37,44,70,47,52,38,30,78,60,95,62,3,45,96,35,81,8,82,75,76,64,33,65,65,49,1,63,99,53,40,12,46,93,88,27,89,89,60,3,92,63},{-98,-98,-96,-86,-74,-74,-72,-70,-70,-66,-66,-66,-64,-64,-50,-50,-48,-38,-28,-24,-24,-18,-16,-14,-8,-6,-2,-2,10,28,32,38,42,54,54,62,68,84,88},{0,1,0,0,0,1,1,1,0,0,0,0,1,1,0,0,0,0,0,1,1,0},{6,14,26,27,37,50,51,54,55,67,68,72,83,84,95,99},{-6,-96,-46,4,-50,-56,-34,6,-72,-68,92,88,-80,18,58,20,34,-22,-18,-90,-80,-24,-82,6,54,70,22,94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{65,34,82,43,15,94,34,50,70,77,83,26,85,5}};
vector<int> param1 {19,24,18,39,25,12,10,22,45,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 ) { int max_len = 0; for ( int i = 0; i < n; i ++ ) { int curr_sum = 0; for ( int j = i; j < n; j ++ ) { curr_sum += arr [ j ]; if ( curr_sum == 0 ) max_len = max ( max_len, j - i + 1 ); } [MASK] return max_len; }+ ) {
int curr_sum = 0;
for ( int j = i;
j < n;
j ++ ) {
curr_sum += arr [ j ];
if ( curr_sum == 0 ) max_len = max ( max_len, j - i + 1 );
}
}
return max_len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,6,6,15,23,26,27,30,34,35,38,42,43,44,46,50,53,53,57,62,65,67,70,76,79,81,82,85,90},{72,-6,-24,-82,16,78,-82,38,-2,78,-60,40,26,-82,-32,-56,52,14,62,-18,-84,-94,48,54,2,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{14,67,44,5,60,87,23,37,44,70,47,52,38,30,78,60,95,62,3,45,96,35,81,8,82,75,76,64,33,65,65,49,1,63,99,53,40,12,46,93,88,27,89,89,60,3,92,63},{-98,-98,-96,-86,-74,-74,-72,-70,-70,-66,-66,-66,-64,-64,-50,-50,-48,-38,-28,-24,-24,-18,-16,-14,-8,-6,-2,-2,10,28,32,38,42,54,54,62,68,84,88},{0,1,0,0,0,1,1,1,0,0,0,0,1,1,0,0,0,0,0,1,1,0},{6,14,26,27,37,50,51,54,55,67,68,72,83,84,95,99},{-6,-96,-46,4,-50,-56,-34,6,-72,-68,92,88,-80,18,58,20,34,-22,-18,-90,-80,-24,-82,6,54,70,22,94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{65,34,82,43,15,94,34,50,70,77,83,26,85,5}};
vector<int> param1 {19,24,18,39,25,12,10,22,45,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) <bits/stdc++.h>",
"c) f_gold",
"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 result = 0;
int n = s . length ( );
for ( int i = 0;
i < n;
i ++ ) for ( int j = i;
j < n;
j ++ ) if ( s [ i ] == s [ j ] ) result ++;
return result;
}
nt f_gold ( string s ) {
int result = 0;
int n = s . length ( );
for ( int i = 0;
i < n;
i ++ ) for ( int j = i;
j < n;
j ++ ) if ( s [ i ] == s [ j ] ) result ++;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LZIKA","0556979952","110010","kGaYfd","413567670657","01001","EQPuFa","48848378","110","PLehNeP"};
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 result = 0; int n = s . length [MASK] ); for ( int i = 0; i < n; i ++ ) for ( int j = i; j < n; j ++ ) if ( s [ i ] == s [ j ] ) result ++; return result; }nt f_gold ( string s ) {
int result = 0;
int n = s . length ( );
for ( int i = 0;
i < n;
i ++ ) for ( int j = i;
j < n;
j ++ ) if ( s [ i ] == s [ j ] ) result ++;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LZIKA","0556979952","110010","kGaYfd","413567670657","01001","EQPuFa","48848378","110","PLehNeP"};
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) i",
"b) :",
"c) y)?",
"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 n ) {
if ( n < 0 ) return 0;
if ( n <= 1 ) return 1;
double digits = 0;
for ( int i = 2;
i <= n;
i ++ ) digits += log10 ( i );
return floor ( digits ) + 1;
}
ce std;
int f_gold ( int n ) {
if ( n < 0 ) return 0;
if ( n <= 1 ) return 1;
double digits = 0;
for ( int i = 2;
i <= n;
i ++ ) digits += log10 ( i );
return floor ( digits ) + 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,7,55,37,76,16,17,95,71,90};
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 n ) { if ( n < 0 ) return 0; if ( n <= 1 ) return 1; double digits = 0; for ( int i = 2; i <= n; i ++ ) digits += log10 ( i ); return floor ( digits ) + 1; }ce std;
int f_gold ( int n ) {
if ( n < 0 ) return 0;
if ( n <= 1 ) return 1;
double digits = 0;
for ( int i = 2;
i <= n;
i ++ ) digits += log10 ( i );
return floor ( digits ) + 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,7,55,37,76,16,17,95,71,90};
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) 3",
"b) :",
"c) {",
"d) n",
"e) <string>"
] | 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 a = 1, b = 2, c = 0;
if ( n <= 2 ) {
return n;
}
for ( int i = 3;
i <= n;
i ++ ) {
c = b + ( i - 1 ) * a;
a = b;
b = c;
}
return c;
}
td;
int f_gold ( int n ) {
int a = 1, b = 2, c = 0;
if ( n <= 2 ) {
return n;
}
for ( int i = 3;
i <= n;
i ++ ) {
c = b + ( i - 1 ) * a;
a = b;
b = c;
}
return c;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {24,1,91,90,89,29,3,60,75,14};
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 a = 1, b = 2, c = 0; if ( n <= 2 ) { return n; } for ( int i = 3; i <= n; i ++ ) { c = b + ( i - 1 ) * a; a = b; b = c; } return c; }td;
int f_gold ( int n ) {
int a = 1, b = 2, c = 0;
if ( n <= 2 ) {
return n;
}
for ( int i = 3;
i <= n;
i ++ ) {
c = b + ( i - 1 ) * a;
a = b;
b = c;
}
return c;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {24,1,91,90,89,29,3,60,75,14};
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) table",
"b) while",
"c) charAt",
"d) k",
"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 slots [ ], int n, int m ) {
int counts [ m ] = {
0 };
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < m;
j ++ ) if ( slots [ i ] [ j ] == '1' ) counts [ j ] ++;
return * max_element ( counts, counts + m );
}
{
0 };
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < m;
j ++ ) if ( slots [ i ] [ j ] == '1' ) counts [ j ] ++;
return * max_element ( counts, counts + m );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<string>> param0 {{"pECmwnMblBFWx","CZPrc","mPCbBVdYeMOeh","yA","ZgJF","UrbTP","RPXLB","RxGMlM","ZowRSvJjB","ICedYoDz","MCvIVUr","TGg","jx","VRAXfWhuO","HMQ","mPU MBf","lcVtOPShz","BIROOQ","bgOyYX"," kjIRdPbRBQT","RCbHGtUDPztaay","w","RonaGfwzcTf","ZyUqBFCw","pFzGVsOqL","nruTMPVMBtf","zfMzqNbYugR","cJQR","YsDkmGLVbTwXWt","YD","Dy"},
{ "0101011", "0011001", "0110111" },
{"111010011100","11001","000","0101101011010","001001011101","111010000","1011011001001","000","0","011110","01100101","0"},{"ZLateNR","S","OZNSbEUTYz","YDTheMdNJ","GzNMk","VvWKg","mtoLHJ TyC","ndLgmqCqJszZ","ibtwrzZyqMWjy","BzlRWswnqouLDs","vtLLJasQzgHJf","v iQC","Zq","mqjyrWRoAsoS","QNZpxwk","eMVDptCq","zoy","tDuUIRfZKkw","MirTJNVJBsDL","oRl","iI","T","EBSKgTpXnGfu","FfbMWAnwMu","YDy xkIdK","miBT","fAjwuz","cQIgAPGdzhtqe","i","gKJcheeq","UANMWlBdZByXJ","cEKlKKdDLP","AvaVQL","rfWl"," ","rjxtld","ezJpezsfxE","gjMvn","PZvFknERdSvC","mts","ztJ","odfbJX","NROgvhZPkbDd","yuyih","TBbuW","HwoAbBkT","uPFFgvnmuvHjaa","cEQYOmdZ"},{"173900830","265","60283247","1","6049752624619","1628","50976022265","14510333026","1708","13265","83265496483","9","400007186283","2435840","4487441836954","46181839950","58882","3771768414148","6085610","38820188080","3474438786","4905959","1028","049580401149","5418","9785441311733","3882562","0869","8574790","387","71625353213916","0","60341","3709003"},
{"10111110000010","0010","1000100101111","010","01011001110","00001111111010","111000010011","0110","01111000100100","101","0001","101011101","10110100001010","110111000000"},
{"BVHCVc","pRIkQw","VeZhQQXYjBJjnL","UefDs","WnkT","SERFx"},{"3589","355","0813224","6628597","03682572588540","234","78695289082","907583458","813230","39","4807","877","346162555"},
{"100111100","0111"},{"cbXnCeRTfhMMRC","RApAMNa","YGXMAqovsBwJW","VWtUi w","gEYkNqJzJrEWI","BzfHBRUiC","lp","EG gcte","ULo","wGb","unnP"}};
vector<int> param1 {18,3,11,46,33,8,5,7,1,7};
vector<int> param2 {30,7,10,29,21,7,4,12,1,8};
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 ( string slots [ ], int n, int m ) { int counts [ m ] = { 0 }; for ( int i = 0; i < n; i ++ ) for ( int j = 0; j < m; [MASK] ++ ) if ( slots [ i ] [ j ] == '1' ) counts [ j ] ++; return * max_element ( counts, counts + m ); }{
0 };
for ( int i = 0;
i < n;
i ++ ) for ( int j = 0;
j < m;
j ++ ) if ( slots [ i ] [ j ] == '1' ) counts [ j ] ++;
return * max_element ( counts, counts + m );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<string>> param0 {{"pECmwnMblBFWx","CZPrc","mPCbBVdYeMOeh","yA","ZgJF","UrbTP","RPXLB","RxGMlM","ZowRSvJjB","ICedYoDz","MCvIVUr","TGg","jx","VRAXfWhuO","HMQ","mPU MBf","lcVtOPShz","BIROOQ","bgOyYX"," kjIRdPbRBQT","RCbHGtUDPztaay","w","RonaGfwzcTf","ZyUqBFCw","pFzGVsOqL","nruTMPVMBtf","zfMzqNbYugR","cJQR","YsDkmGLVbTwXWt","YD","Dy"},
{ "0101011", "0011001", "0110111" },
{"111010011100","11001","000","0101101011010","001001011101","111010000","1011011001001","000","0","011110","01100101","0"},{"ZLateNR","S","OZNSbEUTYz","YDTheMdNJ","GzNMk","VvWKg","mtoLHJ TyC","ndLgmqCqJszZ","ibtwrzZyqMWjy","BzlRWswnqouLDs","vtLLJasQzgHJf","v iQC","Zq","mqjyrWRoAsoS","QNZpxwk","eMVDptCq","zoy","tDuUIRfZKkw","MirTJNVJBsDL","oRl","iI","T","EBSKgTpXnGfu","FfbMWAnwMu","YDy xkIdK","miBT","fAjwuz","cQIgAPGdzhtqe","i","gKJcheeq","UANMWlBdZByXJ","cEKlKKdDLP","AvaVQL","rfWl"," ","rjxtld","ezJpezsfxE","gjMvn","PZvFknERdSvC","mts","ztJ","odfbJX","NROgvhZPkbDd","yuyih","TBbuW","HwoAbBkT","uPFFgvnmuvHjaa","cEQYOmdZ"},{"173900830","265","60283247","1","6049752624619","1628","50976022265","14510333026","1708","13265","83265496483","9","400007186283","2435840","4487441836954","46181839950","58882","3771768414148","6085610","38820188080","3474438786","4905959","1028","049580401149","5418","9785441311733","3882562","0869","8574790","387","71625353213916","0","60341","3709003"},
{"10111110000010","0010","1000100101111","010","01011001110","00001111111010","111000010011","0110","01111000100100","101","0001","101011101","10110100001010","110111000000"},
{"BVHCVc","pRIkQw","VeZhQQXYjBJjnL","UefDs","WnkT","SERFx"},{"3589","355","0813224","6628597","03682572588540","234","78695289082","907583458","813230","39","4807","877","346162555"},
{"100111100","0111"},{"cbXnCeRTfhMMRC","RApAMNa","YGXMAqovsBwJW","VWtUi w","gEYkNqJzJrEWI","BzfHBRUiC","lp","EG gcte","ULo","wGb","unnP"}};
vector<int> param1 {18,3,11,46,33,8,5,7,1,7};
vector<int> param2 {30,7,10,29,21,7,4,12,1,8};
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;
} | j | [
"a) j",
"b) ]",
"c) <",
"d) int",
"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 ( string str ) {
int N = str . length ( );
int dp [ N + 1 ] [ N + 1 ];
for ( int i = 0;
i <= N;
i ++ ) for ( int j = 0;
j <= N;
j ++ ) dp [ i ] [ j ] = 0;
for ( int len = 1;
len <= N;
len ++ ) {
for ( int i = 0, j = len - 1;
j < N;
i ++, j ++ ) {
if ( len == 1 ) dp [ i ] [ j ] = 1;
else {
dp [ i ] [ j ] = 1 + dp [ i + 1 ] [ j ];
if ( str [ i ] == str [ i + 1 ] ) dp [ i ] [ j ] = min ( 1 + dp [ i + 2 ] [ j ], dp [ i ] [ j ] );
for ( int K = i + 2;
K <= j;
K ++ ) if ( str [ i ] == str [ K ] ) dp [ i ] [ j ] = min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ], dp [ i ] [ j ] );
}
}
}
return dp [ 0 ] [ N - 1 ];
}
K <= j;
K ++ ) if ( str [ i ] == str [ K ] ) dp [ i ] [ j ] = min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ], dp [ i ] [ j ] );
}
}
}
return dp [ 0 ] [ N - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"YCtLQtHLwr","47713514383248","0100101001111","XfdIYVn","45499225407","000100111001","ZoUQhQwoap","18579027952","00000001111","JD"};
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 dp [ N + 1 ] [ N + 1 ]; for ( int i = 0; i <= N; i ++ ) for ( int j = 0; j <= N; j ++ ) dp [ i ] [ j ] = 0; for ( int len = 1; len <= N; len ++ ) { for ( int i = 0, j = len - 1; j < N; i ++, j ++ ) { if ( len == 1 ) dp [ i ] [ j ] = 1; else { dp [ i ] [ j ] = 1 + dp [ i + 1 ] [ j ]; if ( str [ i ] == str [ i + 1 ] ) dp [ i ] [ j ] = min ( 1 + dp [ i + 2 ] [ j ], dp [ i ] [ j ] ); for ( int K = i + 2; K <= j; K ++ ) if ( str [ i ] == str [ K ] ) dp [ i ] [ j ] = min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ], dp [ i ] [ j ] ); } } } return dp [ 0 ] [ N - [MASK] ]; }
K <= j;
K ++ ) if ( str [ i ] == str [ K ] ) dp [ i ] [ j ] = min ( dp [ i + 1 ] [ K - 1 ] + dp [ K + 1 ] [ j ], dp [ i ] [ j ] );
}
}
}
return dp [ 0 ] [ N - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"YCtLQtHLwr","47713514383248","0100101001111","XfdIYVn","45499225407","000100111001","ZoUQhQwoap","18579027952","00000001111","JD"};
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) 1",
"b) (arr)",
"c) sizeof",
"d) y;",
"e) i"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int pre [ ], int n ) {
stack < int > s;
int root = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( pre [ i ] < root ) return false;
while ( ! s . empty ( ) && s . top ( ) < pre [ i ] ) {
root = s . top ( );
s . pop ( );
}
s . push ( pre [ i ] );
}
return true;
}
if ( pre [ i ] < root ) return false;
while ( ! s . empty ( ) && s . top ( ) < pre [ i ] ) {
root = s . top ( );
s . pop ( );
}
s . push ( pre [ i ] );
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,9,21,25,33,36,44,48,55,55,56,58,66,66,66,66,78,92,96,97},{-16,80,70,72,-86,-28,42,28,-28,56,-32,40,-78,32,22,-52,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,85,45,52,98,9,59,58,61,91,4,90,43,48,47},{-92,-90,-88,-50,-48,-48,-44,-42,-40,-34,-28,-26,-26,-24,-8,-6,4,8,12,20,32,36,38,40,46,52,58,88,92},{1,0,1,1,1},{1,2,3,4,14,16,17,18,19,19,21,21,22,25,25,28,29,33,34,40,41,42,44,50,52,58,61,62,67,70,74,74,75,75,76,77,77,77,81,83,87,90,90,90,96,98,99,99},{-98,40,84,-8,42,-52,2,16,-68,-28,-54,88,8,-4,-98,-40,-32,-64,54,32,-76,-10,-48,-88,80,32,-2,-94,-26,-54,30,-56},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{9,35,62,78,55,29,55,36,77,89,73,31,53,94,22,23,87,96,7,15,71,61,25,61,99,34,1,87,21,14,58,69,61,49,54,7,89,52,78,97,11,78,27,37,56,19,20,21}};
vector<int> param1 {18,16,35,8,17,2,30,26,17,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; bool f_gold ( int pre [ ], int n ) { stack < int > s; int root = INT_MIN; for ( int i = 0; i < n; i ++ ) { if ( pre [ i ] < root ) return false; while ( ! s . empty ( ) && s . top ( ) < pre [ i ] ) { root [MASK] s . top ( ); s . pop ( ); } s . push ( pre [ i ] ); } return true; }if ( pre [ i ] < root ) return false;
while ( ! s . empty ( ) && s . top ( ) < pre [ i ] ) {
root = s . top ( );
s . pop ( );
}
s . push ( pre [ i ] );
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,9,21,25,33,36,44,48,55,55,56,58,66,66,66,66,78,92,96,97},{-16,80,70,72,-86,-28,42,28,-28,56,-32,40,-78,32,22,-52,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,85,45,52,98,9,59,58,61,91,4,90,43,48,47},{-92,-90,-88,-50,-48,-48,-44,-42,-40,-34,-28,-26,-26,-24,-8,-6,4,8,12,20,32,36,38,40,46,52,58,88,92},{1,0,1,1,1},{1,2,3,4,14,16,17,18,19,19,21,21,22,25,25,28,29,33,34,40,41,42,44,50,52,58,61,62,67,70,74,74,75,75,76,77,77,77,81,83,87,90,90,90,96,98,99,99},{-98,40,84,-8,42,-52,2,16,-68,-28,-54,88,8,-4,-98,-40,-32,-64,54,32,-76,-10,-48,-88,80,32,-2,-94,-26,-54,30,-56},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{9,35,62,78,55,29,55,36,77,89,73,31,53,94,22,23,87,96,7,15,71,61,25,61,99,34,1,87,21,14,58,69,61,49,54,7,89,52,78,97,11,78,27,37,56,19,20,21}};
vector<int> param1 {18,16,35,8,17,2,30,26,17,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) int",
"b) =",
"c) A",
"d) ;",
"e) n)"
] | 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 ) {
if ( s . length ( ) == 0 ) cout << 0 << endl;
int ans = 0;
int o = 0, c = 0;
for ( int i = 0;
i < s . length ( );
i ++ ) {
if ( s [ i ] == '(' ) o ++;
if ( s [ i ] == ')' ) c ++;
}
if ( o != c ) return - 1;
int a [ s . size ( ) ];
if ( s [ 0 ] == '(' ) a [ 0 ] = 1;
else a [ 0 ] = - 1;
if ( a [ 0 ] < 0 ) ans += abs ( a [ 0 ] );
for ( int i = 1;
i < s . length ( );
i ++ ) {
if ( s [ i ] == '(' ) a [ i ] = a [ i - 1 ] + 1;
else a [ i ] = a [ i - 1 ] - 1;
if ( a [ i ] < 0 ) ans += abs ( a [ i ] );
}
return ans;
}
i = 1;
i < s . length ( );
i ++ ) {
if ( s [ i ] == '(' ) a [ i ] = a [ i - 1 ] + 1;
else a [ i ] = a [ i - 1 ] - 1;
if ( a [ i ] < 0 ) ans += abs ( a [ i ] );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()","))((","())","(()","(()()())","))())(()(())","))(())((","49","00001111","KDahByG "};
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 ) { if ( s . length ( ) == 0 ) cout << 0 << endl; int ans = 0; int o = 0, c = 0; for ( int i = 0; i < s . length ( ); i ++ ) { if ( s [ i ] == '(' ) o ++; if ( s [ i ] == ')' ) c ++; } if ( o != c ) return - 1; int a [ s . size ( ) ]; if ( s [ 0 [MASK] == '(' ) a [ 0 ] = 1; else a [ 0 ] = - 1; if ( a [ 0 ] < 0 ) ans += abs ( a [ 0 ] ); for ( int i = 1; i < s . length ( ); i ++ ) { if ( s [ i ] == '(' ) a [ i ] = a [ i - 1 ] + 1; else a [ i ] = a [ i - 1 ] - 1; if ( a [ i ] < 0 ) ans += abs ( a [ i ] ); } return ans; } i = 1;
i < s . length ( );
i ++ ) {
if ( s [ i ] == '(' ) a [ i ] = a [ i - 1 ] + 1;
else a [ i ] = a [ i - 1 ] - 1;
if ( a [ i ] < 0 ) ans += abs ( a [ i ] );
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()","))((","())","(()","(()()())","))())(()(())","))(())((","49","00001111","KDahByG "};
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) java.lang.*;",
"b) (",
"c) ]",
"d) if",
"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 ( int n ) {
return ( n % 15 == 0 );
}
ream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return ( n % 15 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {30,-30,60,90,99,32,21,65,21,99};
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 % 15 == 0 ); }ream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
return ( n % 15 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {30,-30,60,90,99,32,21,65,21,99};
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) <",
"b) bool",
"c) ;",
"d) <stdio.h>",
"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 min_ending_here = INT_MAX;
int min_so_far = INT_MAX;
for ( int i = 0;
i < n;
i ++ ) {
if ( min_ending_here > 0 ) min_ending_here = arr [ i ];
else min_ending_here += arr [ i ];
min_so_far = min ( min_so_far, min_ending_here );
}
return min_so_far;
}
< n;
i ++ ) {
if ( min_ending_here > 0 ) min_ending_here = arr [ i ];
else min_ending_here += arr [ i ];
min_so_far = min ( min_so_far, min_ending_here );
}
return min_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,9,13,14,15,18,19,19,25,26,29,29,29,30,31,36,37,37,38,39,39,40,40,42,42,46,50,53,58,60,62,64,65,67,68,69,72,77,78,83,85,89,90,93,95,95,97},{14,-58,8,78,-26,-20,-60,42,-64,-12},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{44,88,20,47,69,42,26,49,71,91,18,95,9,66,60,37,47,29,98,63,15,9,80,66,1,9,57,56,20,2,1},{-78,-64,-62,-60,-52,4,8,46,72,74},{0,0,1,0,0,0,0,1,1,0,0,1,1,0,1,1},{3,7,16,17,23,23,23,28,29,30,34,38,40,41,43,43,44,46,51,51,51,55,57,58,61,62,66,66,67,69,70,73,75,77,79,80,85,85,87,87,93,96},{80,22,38,26,62,-48,-48,46,-54,4,76,46,48,40,-92,-98,-88,12,-42,-94,76,-16,-82,62,18,-24},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{85,44,1,97,50,74,62,90,3,78,8,48,96,41,36,91,57,97,85,90,78,43,28,92,85,59,29,38,34,65,20,26,27,23,71,22,47,99,68,93,67,66,69,82,98,15,44,51,65}};
vector<int> param1 {24,6,8,26,8,11,38,22,13,45};
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 [ [MASK] int n ) { int min_ending_here = INT_MAX; int min_so_far = INT_MAX; for ( int i = 0; i < n; i ++ ) { if ( min_ending_here > 0 ) min_ending_here = arr [ i ]; else min_ending_here += arr [ i ]; min_so_far = min ( min_so_far, min_ending_here ); } return min_so_far; } < n;
i ++ ) {
if ( min_ending_here > 0 ) min_ending_here = arr [ i ];
else min_ending_here += arr [ i ];
min_so_far = min ( min_so_far, min_ending_here );
}
return min_so_far;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,9,13,14,15,18,19,19,25,26,29,29,29,30,31,36,37,37,38,39,39,40,40,42,42,46,50,53,58,60,62,64,65,67,68,69,72,77,78,83,85,89,90,93,95,95,97},{14,-58,8,78,-26,-20,-60,42,-64,-12},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{44,88,20,47,69,42,26,49,71,91,18,95,9,66,60,37,47,29,98,63,15,9,80,66,1,9,57,56,20,2,1},{-78,-64,-62,-60,-52,4,8,46,72,74},{0,0,1,0,0,0,0,1,1,0,0,1,1,0,1,1},{3,7,16,17,23,23,23,28,29,30,34,38,40,41,43,43,44,46,51,51,51,55,57,58,61,62,66,66,67,69,70,73,75,77,79,80,85,85,87,87,93,96},{80,22,38,26,62,-48,-48,46,-54,4,76,46,48,40,-92,-98,-88,12,-42,-94,76,-16,-82,62,18,-24},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{85,44,1,97,50,74,62,90,3,78,8,48,96,41,36,91,57,97,85,90,78,43,28,92,85,59,29,38,34,65,20,26,27,23,71,22,47,99,68,93,67,66,69,82,98,15,44,51,65}};
vector<int> param1 {24,6,8,26,8,11,38,22,13,45};
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) 2",
"b) ||",
"c) ],",
"d) [",
"e) def"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int a ) {
float area = ( M_PI * a * a ) / 4.0;
return area;
}
lude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int a ) {
float area = ( M_PI * a * a ) / 4.0;
return area;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {77,18,83,39,68,28,71,14,21,73};
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.001F)
{
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 a ) { float area = ( M_PI * a * a ) / 4.0; return [MASK] }lude <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( int a ) {
float area = ( M_PI * a * a ) / 4.0;
return area;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {77,18,83,39,68,28,71,14,21,73};
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.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | area; | [
"a) {return",
"b) [",
"c) )",
"d) area;",
"e) <"
] | 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 str ) {
int n = str . length ( );
if ( ( str [ n - 1 ] - '0' ) % 2 != 0 ) return false;
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
tr . length ( );
if ( ( str [ n - 1 ] - '0' ) % 2 != 0 ) return false;
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"2112","1124","1110","O","65530186","132","UqOE","587","1010","QETUfLQ"};
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 ( ); if ( ( str [ n - 1 ] - '0' ) % 2 != 0 ) return false; int digitSum = 0; [MASK] ( int i = 0; i < n; i ++ ) digitSum += ( str [ i ] - '0' ); return ( digitSum % 3 == 0 ); }tr . length ( );
if ( ( str [ n - 1 ] - '0' ) % 2 != 0 ) return false;
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"2112","1124","1110","O","65530186","132","UqOE","587","1010","QETUfLQ"};
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;
} | for | [
"a) *",
"b) l",
"c) 1",
"d) <limits.h>",
"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 x ) {
return ( x << 1 ) + x + ( x >> 1 );
}
ude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( x << 1 ) + x + ( x >> 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,16,82,33,88,51,81,38,79,89};
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 x ) { return ( x << 1 ) + [MASK] + ( x >> 1 ); }ude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
return ( x << 1 ) + x + ( x >> 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,16,82,33,88,51,81,38,79,89};
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;
} | x | [
"a) (",
"b) return",
"c) x",
"d) ]",
"e) ="
] | 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 ) {
if ( n == 0 ) return 1;
return n * f_gold ( n - 1 );
}
ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 ) return 1;
return n * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,41,5,38,79,80,64,62,24,12};
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; unsigned int f_gold ( unsigned int n ) { if ( n == 0 ) return 1; return n * f_gold ( n - 1 ); }ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 ) return 1;
return n * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {84,41,5,38,79,80,64,62,24,12};
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) )",
"b) )",
"c) )",
"d) class",
"e) <string>"
] | 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 ans = 2 * ( pow ( 3, n ) ) - 1;
return ans;
}
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 2 * ( pow ( 3, n ) ) - 1;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {78,89,46,56,79,71,80,77,48,16};
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; int f_gold ( int n ) { int ans = 2 * ( [MASK] ( 3, n ) ) - 1; return ans; }#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 2 * ( pow ( 3, n ) ) - 1;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {78,89,46,56,79,71,80,77,48,16};
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;
} | pow | [
"a) of",
"b) {",
"c) len",
"d) pow",
"e) charAt"
] | 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 str1, string str2, int k ) {
if ( ( str1 . length ( ) + str2 . length ( ) ) < k ) return true;
int commonLength = 0;
for ( int i = 0;
i < min ( str1 . length ( ), str2 . length ( ) );
i ++ ) {
if ( str1 [ i ] == str2 [ i ] ) commonLength ++;
else break;
}
if ( ( k - str1 . length ( ) - str2 . length ( ) + 2 * commonLength ) % 2 == 0 ) return true;
return false;
}
i ++ ) {
if ( str1 [ i ] == str2 [ i ] ) commonLength ++;
else break;
}
if ( ( k - str1 . length ( ) - str2 . length ( ) + 2 * commonLength ) % 2 == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZNHGro","382880806774","0","lxHTRFCTSQ","6399914758","01100011100000","WkGqlob","46974006151","1001001","IJQ"};
vector<string> param1 {"jAdbtDUYQu","65565","00100010100","sViXYE","780990121","0100","NpQVdXzEtUZy","74438","1000010","nFOHAeYEAp"};
vector<int> param2 {3,10,2,89,9,0,6,11,15,42};
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; bool f_gold ( string str1, string str2, int k ) { if ( ( str1 . length ( ) + str2 . length ( ) ) < [MASK] ) return true; int commonLength = 0; for ( int i = 0; i < min ( str1 . length ( ), str2 . length ( ) ); i ++ ) { if ( str1 [ i ] == str2 [ i ] ) commonLength ++; else break; } if ( ( k - str1 . length ( ) - str2 . length ( ) + 2 * commonLength ) % 2 == 0 ) return true; return false; } i ++ ) {
if ( str1 [ i ] == str2 [ i ] ) commonLength ++;
else break;
}
if ( ( k - str1 . length ( ) - str2 . length ( ) + 2 * commonLength ) % 2 == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZNHGro","382880806774","0","lxHTRFCTSQ","6399914758","01100011100000","WkGqlob","46974006151","1001001","IJQ"};
vector<string> param1 {"jAdbtDUYQu","65565","00100010100","sViXYE","780990121","0100","NpQVdXzEtUZy","74438","1000010","nFOHAeYEAp"};
vector<int> param2 {3,10,2,89,9,0,6,11,15,42};
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;
} | k | [
"a) ;",
"b) ]",
"c) [",
"d) k",
"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 n ) {
int dp [ n + 1 ];
dp [ 0 ] = 0;
for ( int i = 1;
i <= n;
i ++ ) {
if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
else if ( i == 4 ) dp [ i ] = 2;
else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
}
return dp [ n ];
}
0;
for ( int i = 1;
i <= n;
i ++ ) {
if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
else if ( i == 4 ) dp [ i ] = 2;
else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {61,22,65,57,36,25,16,26,92,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 ) { int dp [ n + 1 ]; dp [ 0 ] = 0; for ( int i = 1; i <= n; i ++ ) { if ( [MASK] >= 1 && i <= 3 ) dp [ i ] = 1; else if ( i == 4 ) dp [ i ] = 2; else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ]; } return dp [ n ]; } 0;
for ( int i = 1;
i <= n;
i ++ ) {
if ( i >= 1 && i <= 3 ) dp [ i ] = 1;
else if ( i == 4 ) dp [ i ] = 2;
else dp [ i ] = dp [ i - 1 ] + dp [ i - 4 ];
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {61,22,65,57,36,25,16,26,92,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;
} | i | [
"a) arr",
"b) i",
"c) 0;",
"d) f_gold",
"e) ],"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long f_gold ( int n, int k ) {
long total = k;
int mod = 1000000007;
int same = 0, diff = k;
for ( int i = 2;
i <= n;
i ++ ) {
same = diff;
diff = total * ( k - 1 );
diff = diff % mod;
total = ( same + diff ) % mod;
}
return total;
}
07;
int same = 0, diff = k;
for ( int i = 2;
i <= n;
i ++ ) {
same = diff;
diff = total * ( k - 1 );
diff = diff % mod;
total = ( same + diff ) % mod;
}
return total;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,23,89,63,23,44,81,43,9,41};
vector<int> param1 {30,87,31,36,68,66,18,73,42,98};
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; long f_gold ( int n, int k ) { long total = k; int mod = 1000000007; int same = 0, diff = k; for [MASK] int i = 2; i <= n; i ++ ) { same = diff; diff = total * ( k - 1 ); diff = diff % mod; total = ( same + diff ) % mod; } return total; }07;
int same = 0, diff = k;
for ( int i = 2;
i <= n;
i ++ ) {
same = diff;
diff = total * ( k - 1 );
diff = diff % mod;
total = ( same + diff ) % mod;
}
return total;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,23,89,63,23,44,81,43,9,41};
vector<int> param1 {30,87,31,36,68,66,18,73,42,98};
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) int",
"b) [",
"c) [",
"d) (",
"e) for"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( double p ) {
return ceil ( sqrt ( 2 * 365 * log ( 1 / ( 1 - p ) ) ) );
}
tring>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( double p ) {
return ceil ( sqrt ( 2 * 365 * log ( 1 / ( 1 - p ) ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {0.9303713975220877,0.48126843587453595,0.48776789524757905,0.35184405927337793,0.8000415444743662,0.3528645948885943,0.33594265260473667,0.3603861267753616,7218.247044923335,-4701.904717953173};
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; int f_gold ( [MASK] p ) { return ceil ( sqrt ( 2 * 365 * log ( 1 / ( 1 - p ) ) ) ); }tring>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( double p ) {
return ceil ( sqrt ( 2 * 365 * log ( 1 / ( 1 - p ) ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {0.9303713975220877,0.48126843587453595,0.48776789524757905,0.35184405927337793,0.8000415444743662,0.3528645948885943,0.33594265260473667,0.3603861267753616,7218.247044923335,-4701.904717953173};
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;
} | double | [
"a) i",
"b) double",
"c) if",
"d) java.lang.*;",
"e) <"
] | b |
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 ) {
int max_ele = arr [ n - 1 ];
int min_ele = arr [ 0 ];
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) {
arr [ i ] = max_ele;
max_ele -= 1;
}
else {
arr [ i ] = min_ele;
min_ele += 1;
}
}
}
arr [ 0 ];
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) {
arr [ i ] = max_ele;
max_ele -= 1;
}
else {
arr [ i ] = min_ele;
min_ele += 1;
}
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99},{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,84,16},{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90},{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0},{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98},{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85},{0,0,0,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},{20,75,12,62,18,94,63,84,25,12}};
vector<int> param1 {40,23,28,2,13,12,12,13,31,9};
vector<vector<int>> filled_function_param0 {{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99},{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,84,16},{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90},{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0},{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98},{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85},{0,0,0,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},{20,75,12,62,18,94,63,84,25,12}};
vector<int> filled_function_param1 {40,23,28,2,13,12,12,13,31,9};
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 <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int arr [ ], int n ) { int max_ele = arr [ n - 1 ]; int min_ele = arr [ 0 ]; for ( int i = 0; i < n; i ++ ) { if ( i % 2 == 0 ) { arr [ i ] = max_ele; max_ele -= 1; } else { arr [ i ] = min_ele; min_ele [MASK] 1; } } }arr [ 0 ];
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) {
arr [ i ] = max_ele;
max_ele -= 1;
}
else {
arr [ i ] = min_ele;
min_ele += 1;
}
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99},{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,84,16},{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90},{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0},{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98},{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85},{0,0,0,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},{20,75,12,62,18,94,63,84,25,12}};
vector<int> param1 {40,23,28,2,13,12,12,13,31,9};
vector<vector<int>> filled_function_param0 {{3,4,8,10,12,14,14,17,18,19,20,25,28,29,30,31,34,35,37,38,40,41,42,45,47,49,54,54,55,58,58,63,65,66,66,67,67,72,74,75,75,80,82,86,92,95,96,99},{45,42,-91,90,-6,49,65,39,-80,-65,-47,75,10,80,36,-96,55,72,68,2,-53,-6,72,-52,-9,80,-16,-32,39,25,-27,-96,-24,-27,-23,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{12,84,16},{-85,-77,-70,-67,-55,-51,-49,-41,-37,-24,-18,-8,-6,77,87,90},{0,0,1,1,1,1,1,1,1,0,1,1,0,0,0},{5,8,15,16,20,22,25,33,46,48,52,54,55,57,57,61,61,66,72,73,83,87,88,89,98},{31,2,-46,-86,-64,5,-18,-33,-90,-51,11,-35,-43,-73,13,33,-29,-17,-43,20,-7,-85},{0,0,0,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},{20,75,12,62,18,94,63,84,25,12}};
vector<int> filled_function_param1 {40,23,28,2,13,12,12,13,31,9};
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;
} | += | [
"a) push",
"b) +=",
"c) ;",
"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 LIS [ n ], len = 0;
for ( int i = 0;
i < n;
i ++ ) LIS [ i ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
for ( int j = 0;
j < i;
j ++ ) {
if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) {
LIS [ i ] = max ( LIS [ i ], LIS [ j ] + 1 );
}
}
len = max ( len, LIS [ i ] );
}
return n - len;
}
( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) {
LIS [ i ] = max ( LIS [ i ], LIS [ j ] + 1 );
}
}
len = max ( len, LIS [ i ] );
}
return n - len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,12,14,15,18,20,24,25,25,27,33,34,42,46,48,49,50,50,52,55,56,57,58,64,65,66,69,72,75,78,80,84,90,92,95,99},{-56,6,-74,-30,34,40,-76,-10,-12,-86,-76,36,-72,82,38,68,28,84,98,-84,6,16,-46,8,2,-18,-50,4,-96,88,-84,-38,-82,-54},{0,0,0,0,0,0,1,1,1,1,1,1},{68,79,87,44,3,99,80,6,46,67,72,40,11,18,73,48,18,72,10,38,3,39,26,76,47,15,85,69},{-96,-94,-94,-74,-68,-60,-58,-56,-56,-52,-52,-50,-44,-40,-26,-24,-10,-8,-6,-2,2,2,12,14,20,24,26,30,38,40,52,52,62,62,68,70,74,76,80,82,90,92},{1,1,1,0,1},{1,5,11,20,24,28,29,31,54,58,63,65,66,71,77,80,83,92,93,93},{-50,-46,-44,-90,2,-38,88,-26,60},{1,1},{2,1,19,26,65,47,3,65,9,12,84,59,74,59,30,83,73,67,13,5,64,83,81,92,80,14,58,84,92}};
vector<int> param1 {21,22,6,15,31,3,12,7,1,16};
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 [MASK] { int LIS [ n ], len = 0; for ( int i = 0; i < n; i ++ ) LIS [ i ] = 1; for ( int i = 1; i < n; i ++ ) { for ( int j = 0; j < i; j ++ ) { if ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) { LIS [ i ] = max ( LIS [ i ], LIS [ j ] + 1 ); } } len = max ( len, LIS [ i ] ); } return n - len; } ( arr [ i ] > arr [ j ] && ( i - j ) <= ( arr [ i ] - arr [ j ] ) ) {
LIS [ i ] = max ( LIS [ i ], LIS [ j ] + 1 );
}
}
len = max ( len, LIS [ i ] );
}
return n - len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,4,12,14,15,18,20,24,25,25,27,33,34,42,46,48,49,50,50,52,55,56,57,58,64,65,66,69,72,75,78,80,84,90,92,95,99},{-56,6,-74,-30,34,40,-76,-10,-12,-86,-76,36,-72,82,38,68,28,84,98,-84,6,16,-46,8,2,-18,-50,4,-96,88,-84,-38,-82,-54},{0,0,0,0,0,0,1,1,1,1,1,1},{68,79,87,44,3,99,80,6,46,67,72,40,11,18,73,48,18,72,10,38,3,39,26,76,47,15,85,69},{-96,-94,-94,-74,-68,-60,-58,-56,-56,-52,-52,-50,-44,-40,-26,-24,-10,-8,-6,-2,2,2,12,14,20,24,26,30,38,40,52,52,62,62,68,70,74,76,80,82,90,92},{1,1,1,0,1},{1,5,11,20,24,28,29,31,54,58,63,65,66,71,77,80,83,92,93,93},{-50,-46,-44,-90,2,-38,88,-26,60},{1,1},{2,1,19,26,65,47,3,65,9,12,84,59,74,59,30,83,73,67,13,5,64,83,81,92,80,14,58,84,92}};
vector<int> param1 {21,22,6,15,31,3,12,7,1,16};
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) i"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long f_gold ( int n ) {
int dp [ n + 1 ] [ 10 ];
if ( n == 1 ) return 10;
for ( int j = 0;
j <= 9;
j ++ ) dp [ 1 ] [ j ] = 1;
for ( int i = 2;
i <= n;
i ++ ) {
for ( int j = 0;
j <= 9;
j ++ ) {
if ( j == 0 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ];
else if ( j == 9 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ];
}
}
long long sum = 0;
for ( int j = 1;
j <= 9;
j ++ ) sum += dp [ n ] [ j ];
return sum;
}
[ j - 1 ];
else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ];
}
}
long long sum = 0;
for ( int j = 1;
j <= 9;
j ++ ) sum += dp [ n ] [ j ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,66,73,70,26,41,20,25,52,13};
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; long long f_gold ( int n ) { int dp [ n + 1 ] [ 10 ]; if ( n == 1 ) [MASK] 10; for ( int j = 0; j <= 9; j ++ ) dp [ 1 ] [ j ] = 1; for ( int i = 2; i <= n; i ++ ) { for ( int j = 0; j <= 9; j ++ ) { if ( j == 0 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j + 1 ]; else if ( j == 9 ) dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ]; else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ]; } } long long sum = 0; for ( int j = 1; j <= 9; j ++ ) sum += dp [ n ] [ j ]; return sum; } [ j - 1 ];
else dp [ i ] [ j ] = dp [ i - 1 ] [ j - 1 ] + dp [ i - 1 ] [ j + 1 ];
}
}
long long sum = 0;
for ( int j = 1;
j <= 9;
j ++ ) sum += dp [ n ] [ j ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,66,73,70,26,41,20,25,52,13};
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) sort",
"c) table",
"d) ==",
"e) <bits/stdc++.h>"
] | 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 res = 0;
for ( int i = 0;
i < n - 1;
i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ];
res = res ^ arr [ n - 1 ];
return res;
}
.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int res = 0;
for ( int i = 0;
i < n - 1;
i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ];
res = res ^ arr [ n - 1 ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,4,5,5,7,7,7,8,11,14,15,18,19,20,25,25,29,29,31,32,32,33,38,42,48,52,55,60,61,63,71,74,78,82,82,84,84,87,87,88,90,93,94,94},{46,2,62,60,92,4,26,66,66,90,26,-14,76,-20,-68},{0,0,0,1,1,1,1,1},{87,67,11,47,64,81,94,75,58,77,18,2,85,26,6,44,55,19,46,49,5,69,44,12,42,66,46,9,26,49,68,95,6,9,11,72,5,67},{-98,-94,-92,-82,-78,-64,-62,-58,-52,-44,-40,-38,-8,6,10,20,22,28,30,30,36,54,54,58,64,68,76,78,84,88,90,94,96},{1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,1},{1,14,15,15,21,34,38,39,41,50,60,74,96,97},{96,-12,-16,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{66,21,21,59,78,8,46,41,16,32,97,93,32,86,91,61,67,61,97,49,66,35,24,35,65,45,83}};
vector<int> param1 {31,8,4,34,29,17,7,3,21,25};
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 res = 0; for ( int i = 0; i < n - [MASK] i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ]; res = res ^ arr [ n - 1 ]; return res; }.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int res = 0;
for ( int i = 0;
i < n - 1;
i ++ ) res = res ^ ( i + 1 ) ^ arr [ i ];
res = res ^ arr [ n - 1 ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,4,5,5,7,7,7,8,11,14,15,18,19,20,25,25,29,29,31,32,32,33,38,42,48,52,55,60,61,63,71,74,78,82,82,84,84,87,87,88,90,93,94,94},{46,2,62,60,92,4,26,66,66,90,26,-14,76,-20,-68},{0,0,0,1,1,1,1,1},{87,67,11,47,64,81,94,75,58,77,18,2,85,26,6,44,55,19,46,49,5,69,44,12,42,66,46,9,26,49,68,95,6,9,11,72,5,67},{-98,-94,-92,-82,-78,-64,-62,-58,-52,-44,-40,-38,-8,6,10,20,22,28,30,30,36,54,54,58,64,68,76,78,84,88,90,94,96},{1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,1},{1,14,15,15,21,34,38,39,41,50,60,74,96,97},{96,-12,-16,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{66,21,21,59,78,8,46,41,16,32,97,93,32,86,91,61,67,61,97,49,66,35,24,35,65,45,83}};
vector<int> param1 {31,8,4,34,29,17,7,3,21,25};
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;
} | 1; | [
"a) .",
"b) 2",
"c) 1;",
"d) [",
"e) d"
] | c |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.