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;
void f_gold ( int arr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
sort ( arr, arr + n );
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
}
rr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
sort ( arr, arr + n );
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4},{8,-74,89,65,51,-15,68,51,23,44,89},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{51,74,43,15,38,15,5,93},{-96,-75,-64,-20,-5,-2,1,40,46,64},{0,0,1,0,0,1,0,0,0},{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98},{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}};
vector<int> param1 {0,8,28,6,7,5,34,24,14,13};
vector<vector<int>> filled_function_param0 {{4},{8,-74,89,65,51,-15,68,51,23,44,89},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{51,74,43,15,38,15,5,93},{-96,-75,-64,-20,-5,-2,1,40,46,64},{0,0,1,0,0,1,0,0,0},{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98},{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}};
vector<int> filled_function_param1 {0,8,28,6,7,5,34,24,14,13};
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 [ ], [MASK] n ) { for ( int i = 0; i < n; i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1; sort ( arr, arr + n ); for ( int i = 0; i < n; i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1; }rr [ ], int n ) {
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
sort ( arr, arr + n );
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] & 1 ) arr [ i ] *= - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4},{8,-74,89,65,51,-15,68,51,23,44,89},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{51,74,43,15,38,15,5,93},{-96,-75,-64,-20,-5,-2,1,40,46,64},{0,0,1,0,0,1,0,0,0},{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98},{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}};
vector<int> param1 {0,8,28,6,7,5,34,24,14,13};
vector<vector<int>> filled_function_param0 {{4},{8,-74,89,65,51,-15,68,51,23,44,89},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{51,74,43,15,38,15,5,93},{-96,-75,-64,-20,-5,-2,1,40,46,64},{0,0,1,0,0,1,0,0,0},{1,2,4,4,17,22,23,28,35,38,39,39,41,42,42,45,46,49,49,49,50,59,62,68,69,71,73,76,78,79,80,87,88,88,90,90,91,93,95,96,98},{11,68,-52,-49,-57,-2,83,77,24,-20,85,11,43,-73,96,92,58,64,95,13,-14,14,24,-51,-24,-45,-44,96,-5,-56,59},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{44,7,44,68,34,66,69,55,10,96,42,41,77,69,10,10,91,60,51}};
vector<int> filled_function_param1 {0,8,28,6,7,5,34,24,14,13};
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;
} | int | [
"a) ]",
"b) =",
"c) index",
"d) int",
"e) static"
] | 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 ) {
int dp [ k ] [ n ], sum = 0;
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < n;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int l = 1;
l < k;
l ++ ) {
for ( int i = l;
i < n;
i ++ ) {
dp [ l ] [ i ] = 0;
for ( int j = l - 1;
j < i;
j ++ ) {
if ( arr [ j ] < arr [ i ] ) dp [ l ] [ i ] += dp [ l - 1 ] [ j ];
}
}
}
for ( int i = k - 1;
i < n;
i ++ ) sum += dp [ k - 1 ] [ i ];
return sum;
}
< i;
j ++ ) {
if ( arr [ j ] < arr [ i ] ) dp [ l ] [ i ] += dp [ l - 1 ] [ j ];
}
}
}
for ( int i = k - 1;
i < n;
i ++ ) sum += dp [ k - 1 ] [ i ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,18,66,68,83,86,97},{-30,-16,-70,80,68,96,54,64,-56,96,46,-70,-14,28,-38,-52,-96,-4,-8,16,24,-10,4,54},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,72,75,50,57,64,74,99,41,12,11,10,20,1,28,74,92,33,14,18,31,63,52,62,35,97,61,51,39,64,37,12,16,60,72,58,95,41,80,4,50,95,38,60,53},{-94,-88,-74,-74,-72,-68,-62,-60,-60,-54,-54,-36,-30,-18,-6,12,28,32,32,44,50,52,72,74,84,84,88,92},{1},{2,2,10,11,16,23,32,34,34,35,35,41,42,43,44,44,44,45,46,47,49,51,52,52,54,56,59,60,64,65,66,66,67,69,71,77,78,79,82,86,88,89,90,93,95,95,98},{-42,90,18,42,72,88,58,62,-86,14,76,-34,-64,12,-4,90,96,-34,-90,-84,54,-70,96,30,-26,44,-50,-14,50},{0,0,0,0,1,1,1,1,1,1,1,1},{44,19,10,19,84,31,68,2,35,94,18,83,93,84,37,79,50,22,77,3,60,4,70,26,58,60,59,22,75,92}};
vector<int> param1 {6,18,14,35,17,0,24,18,9,20};
vector<int> param2 {5,15,17,31,15,0,38,21,8,15};
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 dp [ k ] [ n ], sum = 0; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 0; i < n; i ++ ) dp [ 0 ] [ i ] = 1; for ( int l = 1; l < k; l ++ ) { for ( int i = l; i < n; i ++ ) { dp [ l ] [ i ] = 0; for ( int j = l - 1; j < i; j ++ ) { if ( arr [ j ] < arr [ i ] ) dp [ l ] [ i ] += dp [ l - 1 ] [ j ]; } } } for ( int i = k - 1; i < n; i ++ ) sum += dp [ k - 1 ] [ i ]; [MASK] sum; }< i;
j ++ ) {
if ( arr [ j ] < arr [ i ] ) dp [ l ] [ i ] += dp [ l - 1 ] [ j ];
}
}
}
for ( int i = k - 1;
i < n;
i ++ ) sum += dp [ k - 1 ] [ i ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,18,66,68,83,86,97},{-30,-16,-70,80,68,96,54,64,-56,96,46,-70,-14,28,-38,-52,-96,-4,-8,16,24,-10,4,54},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,72,75,50,57,64,74,99,41,12,11,10,20,1,28,74,92,33,14,18,31,63,52,62,35,97,61,51,39,64,37,12,16,60,72,58,95,41,80,4,50,95,38,60,53},{-94,-88,-74,-74,-72,-68,-62,-60,-60,-54,-54,-36,-30,-18,-6,12,28,32,32,44,50,52,72,74,84,84,88,92},{1},{2,2,10,11,16,23,32,34,34,35,35,41,42,43,44,44,44,45,46,47,49,51,52,52,54,56,59,60,64,65,66,66,67,69,71,77,78,79,82,86,88,89,90,93,95,95,98},{-42,90,18,42,72,88,58,62,-86,14,76,-34,-64,12,-4,90,96,-34,-90,-84,54,-70,96,30,-26,44,-50,-14,50},{0,0,0,0,1,1,1,1,1,1,1,1},{44,19,10,19,84,31,68,2,35,94,18,83,93,84,37,79,50,22,77,3,60,4,70,26,58,60,59,22,75,92}};
vector<int> param1 {6,18,14,35,17,0,24,18,9,20};
vector<int> param2 {5,15,17,31,15,0,38,21,8,15};
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;
} | return | [
"a) +",
"b) (",
"c) return",
"d) }",
"e) ("
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int result = 0;
for ( int i = 0;
i < str . size ( );
i ++ ) if ( i == ( str [ i ] - 'a' ) || i == ( str [ i ] - 'A' ) ) result ++;
return result;
}
space std;
int f_gold ( string str ) {
int result = 0;
for ( int i = 0;
i < str . size ( );
i ++ ) if ( i == ( str [ i ] - 'a' ) || i == ( str [ i ] - 'A' ) ) result ++;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"lLkhFeZGcb","ABcED","geeksforgeeks","Alphabetical","abababab","bcdefgxyz","cBzaqx L"," bcd","11","MqqKY"};
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 result = 0; for ( [MASK] i = 0; i < str . size ( ); i ++ ) if ( i == ( str [ i ] - 'a' ) || i == ( str [ i ] - 'A' ) ) result ++; return result; }space std;
int f_gold ( string str ) {
int result = 0;
for ( int i = 0;
i < str . size ( );
i ++ ) if ( i == ( str [ i ] - 'a' ) || i == ( str [ i ] - 'A' ) ) result ++;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"lLkhFeZGcb","ABcED","geeksforgeeks","Alphabetical","abababab","bcdefgxyz","cBzaqx L"," bcd","11","MqqKY"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) [",
"b) =",
"c) [",
"d) int",
"e) }"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == i ) return i;
}
return - 1;
}
lude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == i ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,16,21,26,27,29,34,35,35,37,38,40,48,52,58,59,60,61,63,63,65,66,69,75,79,83,86,88,91,91,96},{22,-70,34,-44,84,54,14,-88},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{59,67,70,34,18,22,52,95,11,66,60,24,7,71,52,88,32,52,85,81,32,44,25,51,47,97,81,33,88,38,36,54,80,25,70,27,75,29,94},{-96,-96,-94,-88,-88,-82,-72,-72,-70,-70,-66,-64,-64,-62,-58,-54,-46,-44,-30,-26,-22,-8,-6,-2,0,26,30,30,34,42,42,48,64,76,90,96},{0,1,0,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,1,0,1,1},{2,2,4,7,10,15,16,16,23,24,27,39,42,58,60,64,72,74,78,78,78,80,80,84,85,86,88,88,90,92,93,94,95,96},{-68,-48,36,22,-80,-48,-74,-14,44,-46,-76,18,-16,-36,-68,0,-30,-56,42,92,82,64,-18,-6,-78,-86,26,86,36,-66,-50,18,-26,48,8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,76,99,1,1,29,9,12,57,12,74,22,83,77,39,84,50,60,36,90,88,62,79,58,58,40,44,99,84,63,23,21,16,98,68,8,46}};
vector<int> param1 {23,7,31,37,34,15,22,20,23,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 arr [ ], int n ) { int i; for ( i = 0; i [MASK] n; i ++ ) { if ( arr [ i ] == i ) return i; } return - 1; }lude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == i ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,16,21,26,27,29,34,35,35,37,38,40,48,52,58,59,60,61,63,63,65,66,69,75,79,83,86,88,91,91,96},{22,-70,34,-44,84,54,14,-88},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{59,67,70,34,18,22,52,95,11,66,60,24,7,71,52,88,32,52,85,81,32,44,25,51,47,97,81,33,88,38,36,54,80,25,70,27,75,29,94},{-96,-96,-94,-88,-88,-82,-72,-72,-70,-70,-66,-64,-64,-62,-58,-54,-46,-44,-30,-26,-22,-8,-6,-2,0,26,30,30,34,42,42,48,64,76,90,96},{0,1,0,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,1,0,1,1},{2,2,4,7,10,15,16,16,23,24,27,39,42,58,60,64,72,74,78,78,78,80,80,84,85,86,88,88,90,92,93,94,95,96},{-68,-48,36,22,-80,-48,-74,-14,44,-46,-76,18,-16,-36,-68,0,-30,-56,42,92,82,64,-18,-6,-78,-86,26,86,36,-66,-50,18,-26,48,8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,76,99,1,1,29,9,12,57,12,74,22,83,77,39,84,50,60,36,90,88,62,79,58,58,40,44,99,84,63,23,21,16,98,68,8,46}};
vector<int> param1 {23,7,31,37,34,15,22,20,23,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) f_gold",
"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;
bool f_gold ( int A [ ], int arr_size, int sum ) {
int l, r;
sort ( A, A + arr_size );
for ( int i = 0;
i < arr_size - 2;
i ++ ) {
l = i + 1;
r = arr_size - 1;
while ( l < r ) {
if ( A [ i ] + A [ l ] + A [ r ] == sum ) {
printf ( "Triplet is %d, %d, %d", A [ i ], A [ l ], A [ r ] );
return true;
}
else if ( A [ i ] + A [ l ] + A [ r ] < sum ) l ++;
else r --;
}
}
return false;
}
printf ( "Triplet is %d, %d, %d", A [ i ], A [ l ], A [ r ] );
return true;
}
else if ( A [ i ] + A [ l ] + A [ r ] < sum ) l ++;
else r --;
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{28,47,65,89},{-26,-64,-2,96,-52,-14,-56,52,-70,70,-64,74,-8,18,78,14,6,-16,50,84,-90,12,-88,52,52,-40,58,-48,98,-66,46,-88,68,12,0,70,-42},{0},{49,66,22,93,52,54,80,87},{-96,-92,-86,-74,-62,-60,-56,-54,-46,-38,-32,-26,-16,-16,-8,-4,0,6,20,28,42,44,56},{1,0,0,0,0,0,1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,0,1},{1,2,16,16,20,24,24,38,41,54,57,72,79,83,89,90,96,97,98},{52,22,78,-30},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{72,40,92,11,98,20,4,58,49,11,58,28,16,16,44,10,50,23,83,41,41,92,1,28,26,83,6,52,48,9,77,51}};
vector<int> param1 {3,22,0,5,13,39,12,2,21,29};
vector<int> param2 {3,24,0,7,19,39,12,3,16,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; bool f_gold ( int A [ ], int arr_size, int sum ) { int l, r; sort ( A, A + arr_size ); for ( int i = 0; i < arr_size - 2; i ++ ) { l = i + 1; r = arr_size - 1; while ( l < r ) { if ( A [ i ] + A [ l ] + A [ r ] == sum ) { printf ( "Triplet is %d, %d, [MASK] A [ i ], A [ l ], A [ r ] ); return true; } else if ( A [ i ] + A [ l ] + A [ r ] < sum ) l ++; else r --; } } return false; } printf ( "Triplet is %d, %d, %d", A [ i ], A [ l ], A [ r ] );
return true;
}
else if ( A [ i ] + A [ l ] + A [ r ] < sum ) l ++;
else r --;
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{28,47,65,89},{-26,-64,-2,96,-52,-14,-56,52,-70,70,-64,74,-8,18,78,14,6,-16,50,84,-90,12,-88,52,52,-40,58,-48,98,-66,46,-88,68,12,0,70,-42},{0},{49,66,22,93,52,54,80,87},{-96,-92,-86,-74,-62,-60,-56,-54,-46,-38,-32,-26,-16,-16,-8,-4,0,6,20,28,42,44,56},{1,0,0,0,0,0,1,0,1,0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,0,1},{1,2,16,16,20,24,24,38,41,54,57,72,79,83,89,90,96,97,98},{52,22,78,-30},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{72,40,92,11,98,20,4,58,49,11,58,28,16,16,44,10,50,23,83,41,41,92,1,28,26,83,6,52,48,9,77,51}};
vector<int> param1 {3,22,0,5,13,39,12,2,21,29};
vector<int> param2 {3,24,0,7,19,39,12,3,16,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;
} | %d", | [
"a) d",
"b) n",
"c) neg",
"d) %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 n ) {
int prime [ n + 1 ], sum = 0;
memset ( prime, 0, sizeof ( prime ) );
int max = n / 2;
for ( int p = 2;
p <= max;
p ++ ) {
if ( prime [ p ] == 0 ) {
for ( int i = p * 2;
i <= n;
i += p ) prime [ i ] = p;
}
}
for ( int p = 2;
p <= n;
p ++ ) {
if ( prime [ p ] ) sum += prime [ p ];
else sum += p;
}
return sum;
}
r ( int i = p * 2;
i <= n;
i += p ) prime [ i ] = p;
}
}
for ( int p = 2;
p <= n;
p ++ ) {
if ( prime [ p ] ) sum += prime [ p ];
else sum += p;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,35,87,91,63,11,66,17,92,81};
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 prime [ n + 1 ], sum = 0; memset ( prime, 0, sizeof ( prime ) ); int max = n / 2; for ( int p = 2; p <= max; p [MASK] ) { if ( prime [ p ] == 0 ) { for ( int i = p * 2; i <= n; i += p ) prime [ i ] = p; } } for ( int p = 2; p <= n; p ++ ) { if ( prime [ p ] ) sum += prime [ p ]; else sum += p; } return sum; }r ( int i = p * 2;
i <= n;
i += p ) prime [ i ] = p;
}
}
for ( int p = 2;
p <= n;
p ++ ) {
if ( prime [ p ] ) sum += prime [ p ];
else sum += p;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,35,87,91,63,11,66,17,92,81};
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) y)?",
"d) ++",
"e) ]"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
int res = 1;
for ( int i = 0;
i < y;
i ++ ) res = ( res * x ) % 10;
return res;
}
<fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
int res = 1;
for ( int i = 0;
i < y;
i ++ ) res = ( res * x ) % 10;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {33,95,21,3,40,64,17,58,44,27};
vector<int> param1 {55,7,63,62,53,24,23,74,13,54};
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 x, int y ) { int res = 1; for ( int i = 0; i < y; i ++ ) res = ( res * x ) [MASK] 10; return res; }<fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x, int y ) {
int res = 1;
for ( int i = 0;
i < y;
i ++ ) res = ( res * x ) % 10;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {33,95,21,3,40,64,17,58,44,27};
vector<int> param1 {55,7,63,62,53,24,23,74,13,54};
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) CHECK_TWO_GIVEN_CIRCLES_TOUCH_INTERSECT{",
"c) a,",
"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 p [ ], int i, int j ) {
if ( i == j ) return 0;
int k;
int min = INT_MAX;
int count;
for ( k = i;
k < j;
k ++ ) {
count = f_gold ( p, i, k ) + f_gold ( p, k + 1, j ) + p [ i - 1 ] * p [ k ] * p [ j ];
if ( count < min ) min = count;
}
return min;
}
;
int count;
for ( k = i;
k < j;
k ++ ) {
count = f_gold ( p, i, k ) + f_gold ( p, k + 1, j ) + p [ i - 1 ] * p [ k ] * p [ j ];
if ( count < min ) min = count;
}
return min;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,16,30,31,31,33,34,45,48,57,63,81,83},{30,-78,42,-6,42,56,-38,28,-96,-96,84,-18,0,20,-56,-40,-58,-74,64,62,-22,78,10,-22,16,-48,2,14,82,-92,-64,-18,42,24,22,-50,12,-76,38,-30,-86,-58,-6,-4,10,28},{0,0,0,0,0,0,1,1,1,1,1,1,1},{54,46},{-80,-76,-68,-66,-54,-12,-10,-6,6,8,20,20,22,60,66,78,78,82,98},{0,0,1,0,0,1,0,1,1,1,0,0,1,1,0,1,1,1,0,1,0},{14,21,29,31,37,50,51,54,57,62,64,72,85,98},{-86,98,90,-20,90,68,70,-24,-10,-80,70,-42,14,56,-26,-42,2,-62,24,10,-46,-66,-82,-98,-84,-2,-52,-50,0,-18,90,-32,98,86},{0,0,1,1,1,1},{52,15,61,73,45,5,15,54,69,90,5,56,13,54,27,72,58,21,35,2,59,55,64,92,54,63,50,95,38,53,38,53,73,27,86,86,99,42,85,80,43,32,80,57,78}};
vector<int> param1 {10,30,7,1,13,20,7,23,5,26};
vector<int> param2 {9,27,7,1,10,17,11,26,4,42};
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 p [ ], int i, int j ) { if ( i == j ) return 0; int k; int min = INT_MAX; int count; for ( k = i; k [MASK] j; k ++ ) { count = f_gold ( p, i, k ) + f_gold ( p, k + 1, j ) + p [ i - 1 ] * p [ k ] * p [ j ]; if ( count < min ) min = count; } return min; };
int count;
for ( k = i;
k < j;
k ++ ) {
count = f_gold ( p, i, k ) + f_gold ( p, k + 1, j ) + p [ i - 1 ] * p [ k ] * p [ j ];
if ( count < min ) min = count;
}
return min;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,12,16,30,31,31,33,34,45,48,57,63,81,83},{30,-78,42,-6,42,56,-38,28,-96,-96,84,-18,0,20,-56,-40,-58,-74,64,62,-22,78,10,-22,16,-48,2,14,82,-92,-64,-18,42,24,22,-50,12,-76,38,-30,-86,-58,-6,-4,10,28},{0,0,0,0,0,0,1,1,1,1,1,1,1},{54,46},{-80,-76,-68,-66,-54,-12,-10,-6,6,8,20,20,22,60,66,78,78,82,98},{0,0,1,0,0,1,0,1,1,1,0,0,1,1,0,1,1,1,0,1,0},{14,21,29,31,37,50,51,54,57,62,64,72,85,98},{-86,98,90,-20,90,68,70,-24,-10,-80,70,-42,14,56,-26,-42,2,-62,24,10,-46,-66,-82,-98,-84,-2,-52,-50,0,-18,90,-32,98,86},{0,0,1,1,1,1},{52,15,61,73,45,5,15,54,69,90,5,56,13,54,27,72,58,21,35,2,59,55,64,92,54,63,50,95,38,53,38,53,73,27,86,86,99,42,85,80,43,32,80,57,78}};
vector<int> param1 {10,30,7,1,13,20,7,23,5,26};
vector<int> param2 {9,27,7,1,10,17,11,26,4,42};
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) return",
"b) <",
"c) for",
"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 sum ) {
int curr_sum, i, j;
for ( i = 0;
i < n;
i ++ ) {
curr_sum = arr [ i ];
for ( j = i + 1;
j <= n;
j ++ ) {
if ( curr_sum == sum ) {
cout << "Sum found between indexes " << i << " and " << j - 1;
return 1;
}
if ( curr_sum > sum || j == n ) break;
curr_sum = curr_sum + arr [ j ];
}
}
cout << "No subarray found";
return 0;
}
xes " << i << " and " << j - 1;
return 1;
}
if ( curr_sum > sum || j == n ) break;
curr_sum = curr_sum + arr [ j ];
}
}
cout << "No subarray found";
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,8,10,15,18,19,22,25,26,30,32,35,36,40,41,43,48,53,57,59,63,64,68,71,76,76,77,78,89,96,97},{-78,16,-16,-10,-2,-38,58,-72,-78,50,-68,-16,-96,82,70,2,-20},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{16,10,55,43,46,74,57,65,86,60,28,6,92},{-98,-98,-90,-84,-84,-80,-76,-76,-70,-54,-48,-46,-44,-42,-38,-14,-12,-4,6,8,24,28,32,40,40,42,64,84,98},{0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0,1},{2,10,40,45,56,66,66,70,75,83,93,98},{-20,30,56,-68,54,-6,78,-86,88,-66,76,-66,62,78,22,46,-94,-10,18,16,-36,34,-98,-84,-40,98,82,10,12,54,-88},{0,0,1,1},{38,24,12}};
vector<int> param1 {26,9,9,10,23,12,10,30,2,1};
vector<int> param2 {23,12,11,6,19,8,10,17,2,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int sum ) { int curr_sum, i, j; for ( i = 0; i < n; i ++ ) { curr_sum = arr [ i ]; for ( j = i + 1; j <= n; j ++ ) { if ( curr_sum == sum ) { cout << "Sum found between indexes " << i << " and " << j - 1; return 1; } if ( curr_sum > sum || j == n ) break; curr_sum = curr_sum + arr [ j ]; } } cout << "No subarray found"; return 0; }xes " << i << " and " << j - 1;
return 1;
}
if ( curr_sum > sum || j == n ) break;
curr_sum = curr_sum + arr [ j ];
}
}
cout << "No subarray found";
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,8,8,10,15,18,19,22,25,26,30,32,35,36,40,41,43,48,53,57,59,63,64,68,71,76,76,77,78,89,96,97},{-78,16,-16,-10,-2,-38,58,-72,-78,50,-68,-16,-96,82,70,2,-20},{0,0,0,0,0,0,0,0,1,1,1,1,1,1},{16,10,55,43,46,74,57,65,86,60,28,6,92},{-98,-98,-90,-84,-84,-80,-76,-76,-70,-54,-48,-46,-44,-42,-38,-14,-12,-4,6,8,24,28,32,40,40,42,64,84,98},{0,1,0,0,0,1,1,0,0,0,1,0,0,0,0,0,1},{2,10,40,45,56,66,66,70,75,83,93,98},{-20,30,56,-68,54,-6,78,-86,88,-66,76,-66,62,78,22,46,-94,-10,18,16,-36,34,-98,-84,-40,98,82,10,12,54,-88},{0,0,1,1},{38,24,12}};
vector<int> param1 {26,9,9,10,23,12,10,30,2,1};
vector<int> param2 {23,12,11,6,19,8,10,17,2,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <string> | [
"a) )",
"b) <string>",
"c) /",
"d) (",
"e) ("
] | 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 multiTerms = n * ( n + 1 ) / 2;
long long int sum = multiTerms;
for ( int i = 2;
i <= n;
i ++ ) {
multiTerms = multiTerms - ( i - 1 );
sum = sum + multiTerms * i;
}
return sum;
}
ltiTerms = n * ( n + 1 ) / 2;
long long int sum = multiTerms;
for ( int i = 2;
i <= n;
i ++ ) {
multiTerms = multiTerms - ( i - 1 );
sum = sum + multiTerms * i;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,50,67,18,60,6,27,46,50,20};
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 int multiTerms = n * ( n + 1 ) / 2; [MASK] long int sum = multiTerms; for ( int i = 2; i <= n; i ++ ) { multiTerms = multiTerms - ( i - 1 ); sum = sum + multiTerms * i; } return sum; }ltiTerms = n * ( n + 1 ) / 2;
long long int sum = multiTerms;
for ( int i = 2;
i <= n;
i ++ ) {
multiTerms = multiTerms - ( i - 1 );
sum = sum + multiTerms * i;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,50,67,18,60,6,27,46,50,20};
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;
} | long | [
"a) 2",
"b) }",
"c) long",
"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 ( string & X, string & Y ) {
int m = X . length ( ), n = Y . length ( );
int L [ 2 ] [ n + 1 ];
bool bi;
for ( int i = 0;
i <= m;
i ++ ) {
bi = i & 1;
for ( int j = 0;
j <= n;
j ++ ) {
if ( i == 0 || j == 0 ) L [ bi ] [ j ] = 0;
else if ( X [ i - 1 ] == Y [ j - 1 ] ) L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1;
else L [ bi ] [ j ] = max ( L [ 1 - bi ] [ j ], L [ bi ] [ j - 1 ] );
}
}
return L [ bi ] [ n ];
}
else if ( X [ i - 1 ] == Y [ j - 1 ] ) L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1;
else L [ bi ] [ j ] = max ( L [ 1 - bi ] [ j ], L [ bi ] [ j - 1 ] );
}
}
return L [ bi ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"YNpjSv","736519","11010000100010","v ","8311172","100011101011","u","3943042","101","MpbfF OsizevaM"};
vector<string> param1 {"qtUkJn","07592","0","qGBQT","157219329531","1000001111","YzkubTqLhP","3859","00010000101010","WgsFGaQwtp"};
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 & X, string & Y ) { int m = X . length ( ), n = Y . length ( ); int L [ 2 ] [ n + 1 ]; bool bi; for ( int i = 0; i <= m; i ++ ) { bi = i & 1; for ( int j = 0; j <= n; j ++ ) { if ( i == 0 || j == 0 ) L [ bi ] [ j ] = 0; else if ( X [ i - 1 ] == Y [ j - 1 ] [MASK] L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1; else L [ bi ] [ j ] = max ( L [ 1 - bi ] [ j ], L [ bi ] [ j - 1 ] ); } } return L [ bi ] [ n ]; }else if ( X [ i - 1 ] == Y [ j - 1 ] ) L [ bi ] [ j ] = L [ 1 - bi ] [ j - 1 ] + 1;
else L [ bi ] [ j ] = max ( L [ 1 - bi ] [ j ], L [ bi ] [ j - 1 ] );
}
}
return L [ bi ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"YNpjSv","736519","11010000100010","v ","8311172","100011101011","u","3943042","101","MpbfF OsizevaM"};
vector<string> param1 {"qtUkJn","07592","0","qGBQT","157219329531","1000001111","YzkubTqLhP","3859","00010000101010","WgsFGaQwtp"};
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) i",
"b) *;",
"c) )",
"d) #include",
"e) for"
] | 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 num ) {
int result = 0;
for ( int i = 2;
i <= sqrt ( num );
i ++ ) {
if ( num % i == 0 ) {
if ( i == ( num / i ) ) result += i;
else result += ( i + num / i );
}
}
return ( result + 1 );
}
;
for ( int i = 2;
i <= sqrt ( num );
i ++ ) {
if ( num % i == 0 ) {
if ( i == ( num / i ) ) result += i;
else result += ( i + num / i );
}
}
return ( result + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,57,28,43,38,29,45,47,44,3};
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 num ) { int result = 0; for ( int i = 2; i <= sqrt ( num ); i ++ ) { if ( num % [MASK] == 0 ) { if ( i == ( num / i ) ) result += i; else result += ( i + num / i ); } } return ( result + 1 ); };
for ( int i = 2;
i <= sqrt ( num );
i ++ ) {
if ( num % i == 0 ) {
if ( i == ( num / i ) ) result += i;
else result += ( i + num / i );
}
}
return ( result + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,57,28,43,38,29,45,47,44,3};
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) x,",
"c) (int",
"d) str",
"e) i"
] | 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 ) {
if ( k > n ) return - 1;
int * csum = new int [ n ];
csum [ 0 ] = arr [ 0 ];
for ( int i = 1;
i < n;
i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ];
int max_sum = csum [ k - 1 ], max_end = k - 1;
for ( int i = k;
i < n;
i ++ ) {
int curr_sum = csum [ i ] - csum [ i - k ];
if ( curr_sum > max_sum ) {
max_sum = curr_sum;
max_end = i;
}
}
delete [ ] csum;
return max_end - k + 1;
}
n;
i ++ ) {
int curr_sum = csum [ i ] - csum [ i - k ];
if ( curr_sum > max_sum ) {
max_sum = curr_sum;
max_end = i;
}
}
delete [ ] csum;
return max_end - k + 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,19,21,23,32,34,47,51,56,57,57,65,68,68,69,70,71,73,74,74,77,77,79,82,82,86,87,87,88,89,90,91,92},{24,62,-32,-28,42,-46,-96,-70,-68,60,44,34,-30,96,-26,92,62,42,-46,-38,44,54,-94,52,66,68,-96,-58,84,-2,66,30,42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{94,6,48,34,31},{-98,-88,-82,-80,-76,-70,-70,-60,-60,-52,-50,-46,-44,-44,-44,-20,-18,-12,-12,-12,-10,-8,-6,-4,4,4,18,28,32,34,42,42,44,46,48,54,60,70,70,72,78,78,78,78,84,86,90,96,98},{0,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0},{1,5,13,17,26,26,32,35,38,38,39,45,52,58,60,61,62,63,82,83,85,89,89,91},{-68,-52,4,-90,90,88,38,-18,86,4,14,-32,-14,-44,-88,-50,-12,-26,-68,-20,-30,22,0,14,-40,58,-6,28,-44,8,28,96,-46,-12},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{17,33,36,34,32,10,37,48,47,32,21,18,75,8,18,52,21,73,25,25,80,32,10,24,1,89,7,42,86,85,73,12,20,20,1,74,77,4,24,74,8}};
vector<int> param1 {29,23,32,4,45,15,13,32,13,20};
vector<int> param2 {20,31,31,3,30,8,22,22,11,28};
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 ) { if ( k > n ) return - 1; int * csum = new int [ n ]; csum [ 0 ] = arr [ 0 ]; for ( int i = 1; i < n; i ++ ) csum [ i ] = csum [ i - 1 ] + arr [ i ]; int max_sum = csum [ k - 1 ], max_end = k - [MASK] for ( int i = k; i < n; i ++ ) { int curr_sum = csum [ i ] - csum [ i - k ]; if ( curr_sum > max_sum ) { max_sum = curr_sum; max_end = i; } } delete [ ] csum; return max_end - k + 1; } n;
i ++ ) {
int curr_sum = csum [ i ] - csum [ i - k ];
if ( curr_sum > max_sum ) {
max_sum = curr_sum;
max_end = i;
}
}
delete [ ] csum;
return max_end - k + 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,19,21,23,32,34,47,51,56,57,57,65,68,68,69,70,71,73,74,74,77,77,79,82,82,86,87,87,88,89,90,91,92},{24,62,-32,-28,42,-46,-96,-70,-68,60,44,34,-30,96,-26,92,62,42,-46,-38,44,54,-94,52,66,68,-96,-58,84,-2,66,30,42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{94,6,48,34,31},{-98,-88,-82,-80,-76,-70,-70,-60,-60,-52,-50,-46,-44,-44,-44,-20,-18,-12,-12,-12,-10,-8,-6,-4,4,4,18,28,32,34,42,42,44,46,48,54,60,70,70,72,78,78,78,78,84,86,90,96,98},{0,1,0,0,1,0,1,1,0,0,1,1,0,0,0,0,0},{1,5,13,17,26,26,32,35,38,38,39,45,52,58,60,61,62,63,82,83,85,89,89,91},{-68,-52,4,-90,90,88,38,-18,86,4,14,-32,-14,-44,-88,-50,-12,-26,-68,-20,-30,22,0,14,-40,58,-6,28,-44,8,28,96,-46,-12},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{17,33,36,34,32,10,37,48,47,32,21,18,75,8,18,52,21,73,25,25,80,32,10,24,1,89,7,42,86,85,73,12,20,20,1,74,77,4,24,74,8}};
vector<int> param1 {29,23,32,4,45,15,13,32,13,20};
vector<int> param2 {20,31,31,3,30,8,22,22,11,28};
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) 1;",
"c) (",
"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 l, int h, int key ) {
if ( l > h ) return - 1;
int mid = ( l + h ) / 2;
if ( arr [ mid ] == key ) return mid;
if ( arr [ l ] <= arr [ mid ] ) {
if ( key >= arr [ l ] && key <= arr [ mid ] ) return f_gold ( arr, l, mid - 1, key );
return f_gold ( arr, mid + 1, h, key );
}
if ( key >= arr [ mid ] && key <= arr [ h ] ) return f_gold ( arr, mid + 1, h, key );
return f_gold ( arr, l, mid - 1, key );
}
mid - 1, key );
return f_gold ( arr, mid + 1, h, key );
}
if ( key >= arr [ mid ] && key <= arr [ h ] ) return f_gold ( arr, mid + 1, h, key );
return f_gold ( arr, l, mid - 1, key );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5, 6, 7, 8, 9, 10, 1, 2, 3},{30, 40, 50, 10, 20},{40,50,55,67,70,4,5,6,7},{14,41,38,67,99,11,96,52,4,29,22,57,3,45,14,76,70,38,93,5,74,50,18,17,20,34,51,69,86,73},{-90,-88,-88,-82,-62,-44,-38,-38,-36,-34,-34,-32,-30,-28,-28,-26,-24,-20,-16,-16,-16,-6,-6,2,6,8,10,14,18,18,46,50,50,54,56,58,58,60,62,70,70,74,82,84,88,94,96},{1,1,1,1,0,0,1,1,1,1,1,1,1,0},{4,7,9,10,10,11,14,16,17,21,25,27,31,34,34,34,38,41,42,42,52,56,56,58,60,66,67,68,68,70,72,74,76,82,88,88,88,89,91,93,94,95,95},{92,60,-60,64,18,70,56,34,58,14,28,-72,-22,-74,-46,-28,64,88,18,-50,-14,-20,64,6,-4,-98,60,98,84,-58,-98,66,80,68,-42,-58,82,90,-72,34,34,80,88,-64,66,-20,-26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,18,98,47,76,58,29,68,62,78,12,95,20,88,39,12,43,45,5,45,96,64,38,28,70,25,65,79,39}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {8,4,9,16,24,10,23,25,40,16};
vector<int> param3 {3,40,67,15,24,10,39,25,29,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 h, int key ) { if ( l > h ) [MASK] - 1; int mid = ( l + h ) / 2; if ( arr [ mid ] == key ) return mid; if ( arr [ l ] <= arr [ mid ] ) { if ( key >= arr [ l ] && key <= arr [ mid ] ) return f_gold ( arr, l, mid - 1, key ); return f_gold ( arr, mid + 1, h, key ); } if ( key >= arr [ mid ] && key <= arr [ h ] ) return f_gold ( arr, mid + 1, h, key ); return f_gold ( arr, l, mid - 1, key ); } mid - 1, key );
return f_gold ( arr, mid + 1, h, key );
}
if ( key >= arr [ mid ] && key <= arr [ h ] ) return f_gold ( arr, mid + 1, h, key );
return f_gold ( arr, l, mid - 1, key );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5, 6, 7, 8, 9, 10, 1, 2, 3},{30, 40, 50, 10, 20},{40,50,55,67,70,4,5,6,7},{14,41,38,67,99,11,96,52,4,29,22,57,3,45,14,76,70,38,93,5,74,50,18,17,20,34,51,69,86,73},{-90,-88,-88,-82,-62,-44,-38,-38,-36,-34,-34,-32,-30,-28,-28,-26,-24,-20,-16,-16,-16,-6,-6,2,6,8,10,14,18,18,46,50,50,54,56,58,58,60,62,70,70,74,82,84,88,94,96},{1,1,1,1,0,0,1,1,1,1,1,1,1,0},{4,7,9,10,10,11,14,16,17,21,25,27,31,34,34,34,38,41,42,42,52,56,56,58,60,66,67,68,68,70,72,74,76,82,88,88,88,89,91,93,94,95,95},{92,60,-60,64,18,70,56,34,58,14,28,-72,-22,-74,-46,-28,64,88,18,-50,-14,-20,64,6,-4,-98,60,98,84,-58,-98,66,80,68,-42,-58,82,90,-72,34,34,80,88,-64,66,-20,-26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,18,98,47,76,58,29,68,62,78,12,95,20,88,39,12,43,45,5,45,96,64,38,28,70,25,65,79,39}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {8,4,9,16,24,10,23,25,40,16};
vector<int> param3 {3,40,67,15,24,10,39,25,29,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;
}
| return | [
"a) 1;",
"b) ;",
"c) return",
"d) f_gold(k):",
"e) *(int*)b"
] | 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 ar [ ], int n ) {
int res = 0;
sort ( ar, ar + n );
for ( int i = 0;
i < n;
i ++ ) {
int count = 1;
for (;
i < n - 1;
i ++ ) {
if ( ar [ i ] == ar [ i + 1 ] ) count ++;
else break;
}
res = max ( res, count );
}
return res;
}
< n;
i ++ ) {
int count = 1;
for (;
i < n - 1;
i ++ ) {
if ( ar [ i ] == ar [ i + 1 ] ) count ++;
else break;
}
res = max ( res, count );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,8,16,21,21,22,23,26,26,27,27,29,31,33,36,37,37,38,42,45,47,50,57,58,60,60,62,63,66,66,76,84,84,88,96,99},{-30,-60,34,4,86,80,-96,-94,52,46,8,82,-94,-96,78,82,-22,-36,78,50,-46,-36,80,24,-14,94,-46,-38,82,4,-24,2,4,-82,-82,-18,-62,12,8,92,70,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{38,47,84,49,48,62,48,41,38,48,92,16,99},{-88,-64,-40,-38,-38,-16,16,20,28,40,56,58,60,68,74,92},{1,1,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,1,0,1,0,0,1,0,0,0,1,0,0,0,0,0,1,1,1,1,1},{14,24,82,87,95},{-34,62,40,-84,52,-76,2,-58,94,22,2,-18,-88,62,-14,46,50,-58,-80,68,-64,90,-58,12,76,-40,40,-46,8,-80,4,-90,14,-10,64,-68},{0,1,1,1},{43,41,90,5,6,17,68,68,86,89}};
vector<int> param1 {25,35,34,6,12,29,3,34,3,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int ar [ ], int n ) { int res = 0; sort ( ar, ar + n ); for ( int i = 0; i < n; i ++ ) { int count = 1; for (; i < n - 1; [MASK] ++ ) { if ( ar [ i ] == ar [ i + 1 ] ) count ++; else break; } res = max ( res, count ); } return res; } < n;
i ++ ) {
int count = 1;
for (;
i < n - 1;
i ++ ) {
if ( ar [ i ] == ar [ i + 1 ] ) count ++;
else break;
}
res = max ( res, count );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,8,16,21,21,22,23,26,26,27,27,29,31,33,36,37,37,38,42,45,47,50,57,58,60,60,62,63,66,66,76,84,84,88,96,99},{-30,-60,34,4,86,80,-96,-94,52,46,8,82,-94,-96,78,82,-22,-36,78,50,-46,-36,80,24,-14,94,-46,-38,82,4,-24,2,4,-82,-82,-18,-62,12,8,92,70,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{38,47,84,49,48,62,48,41,38,48,92,16,99},{-88,-64,-40,-38,-38,-16,16,20,28,40,56,58,60,68,74,92},{1,1,0,1,0,0,1,0,1,0,0,1,1,0,1,0,1,1,1,1,0,0,0,1,0,1,0,0,1,0,0,0,1,0,0,0,0,0,1,1,1,1,1},{14,24,82,87,95},{-34,62,40,-84,52,-76,2,-58,94,22,2,-18,-88,62,-14,46,50,-58,-80,68,-64,90,-58,12,76,-40,40,-46,8,-80,4,-90,14,-10,64,-68},{0,1,1,1},{43,41,90,5,6,17,68,68,86,89}};
vector<int> param1 {25,35,34,6,12,29,3,34,3,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | i | [
"a) x",
"b) i",
"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 ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1;
return dp [ n ];
}
h>
using namespace std;
int f_gold ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1;
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {75,76,55,14,43,10,16,30,44,65};
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> [MASK] <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 ] = dp [ 1 ] = 1; for ( int i = 2; i <= n; i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1; return dp [ n ]; }h>
using namespace std;
int f_gold ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = dp [ i - 1 ] + dp [ i - 2 ] + 1;
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {75,76,55,14,43,10,16,30,44,65};
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) x",
"d) arr.sort",
"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 ) {
int len = str . length ( );
int dp [ len ] [ n ];
memset ( dp, 0, sizeof ( dp ) );
dp [ 0 ] [ ( str [ 0 ] - '0' ) % n ] ++;
for ( int i = 1;
i < len;
i ++ ) {
dp [ i ] [ ( str [ i ] - '0' ) % n ] ++;
for ( int j = 0;
j < n;
j ++ ) {
dp [ i ] [ j ] += dp [ i - 1 ] [ j ];
dp [ i ] [ ( j * 10 + ( str [ i ] - '0' ) ) % n ] += dp [ i - 1 ] [ j ];
}
}
return dp [ len - 1 ] [ 0 ];
}
j = 0;
j < n;
j ++ ) {
dp [ i ] [ j ] += dp [ i - 1 ] [ j ];
dp [ i ] [ ( j * 10 + ( str [ i ] - '0' ) ) % n ] += dp [ i - 1 ] [ j ];
}
}
return dp [ len - 1 ] [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"fYqkPLSWBgFy","151587","111111110","JQJHaUkkTrt","736592575580","10","L","3476601","0110001001","YimayLFU"};
vector<int> param1 {55,84,9,97,68,3,74,2,53,45};
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 str, int n ) { int len = str . length [MASK] ); int dp [ len ] [ n ]; memset ( dp, 0, sizeof ( dp ) ); dp [ 0 ] [ ( str [ 0 ] - '0' ) % n ] ++; for ( int i = 1; i < len; i ++ ) { dp [ i ] [ ( str [ i ] - '0' ) % n ] ++; for ( int j = 0; j < n; j ++ ) { dp [ i ] [ j ] += dp [ i - 1 ] [ j ]; dp [ i ] [ ( j * 10 + ( str [ i ] - '0' ) ) % n ] += dp [ i - 1 ] [ j ]; } } return dp [ len - 1 ] [ 0 ]; }j = 0;
j < n;
j ++ ) {
dp [ i ] [ j ] += dp [ i - 1 ] [ j ];
dp [ i ] [ ( j * 10 + ( str [ i ] - '0' ) ) % n ] += dp [ i - 1 ] [ j ];
}
}
return dp [ len - 1 ] [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"fYqkPLSWBgFy","151587","111111110","JQJHaUkkTrt","736592575580","10","L","3476601","0110001001","YimayLFU"};
vector<int> param1 {55,84,9,97,68,3,74,2,53,45};
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) res;",
"c) (",
"d) return",
"e) (const"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int prevPrev = 1, prev = 2, curr = 3;
while ( n > 0 ) {
prevPrev = prev;
prev = curr;
curr = prevPrev + prev;
n = n - ( curr - prev - 1 );
}
n = n + ( curr - prev - 1 );
return prev + n;
}
, prev = 2, curr = 3;
while ( n > 0 ) {
prevPrev = prev;
prev = curr;
curr = prevPrev + prev;
n = n - ( curr - prev - 1 );
}
n = n + ( curr - prev - 1 );
return prev + n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,91,62,65,83,57,76,6,2,86};
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 prevPrev = 1, prev = 2, curr = 3; while ( n > 0 ) { prevPrev = prev; prev = curr; curr = prevPrev + prev; n = n - ( curr - prev - 1 ); } [MASK] = n + ( curr - prev - 1 ); return prev + n; }, prev = 2, curr = 3;
while ( n > 0 ) {
prevPrev = prev;
prev = curr;
curr = prevPrev + prev;
n = n - ( curr - prev - 1 );
}
n = n + ( curr - prev - 1 );
return prev + n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,91,62,65,83,57,76,6,2,86};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) *;",
"b) n",
"c) ]",
"d) i",
"e) int"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string num, int a ) {
int res = 0;
for ( int i = 0;
i < num . length ( );
i ++ ) res = ( res * 10 + ( int ) num [ i ] - '0' ) % a;
return res;
}
dc++.h>
using namespace std;
int f_gold ( string num, int a ) {
int res = 0;
for ( int i = 0;
i < num . length ( );
i ++ ) res = ( res * 10 + ( int ) num [ i ] - '0' ) % a;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"RElCP","0139035510","00011110","TwanZWwLNXhFN","6247009752778","0100001011011","NCh","00714746542","101000100","MSTkXmlbPkV"};
vector<int> param1 {13,44,86,66,55,33,75,54,93,78};
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 num, int a ) { int res = 0; for ( int i = 0; i < num . length ( [MASK] i ++ ) res = ( res * 10 + ( int ) num [ i ] - '0' ) % a; return res; }dc++.h>
using namespace std;
int f_gold ( string num, int a ) {
int res = 0;
for ( int i = 0;
i < num . length ( );
i ++ ) res = ( res * 10 + ( int ) num [ i ] - '0' ) % a;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"RElCP","0139035510","00011110","TwanZWwLNXhFN","6247009752778","0100001011011","NCh","00714746542","101000100","MSTkXmlbPkV"};
vector<int> param1 {13,44,86,66,55,33,75,54,93,78};
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) 10",
"b) [",
"c) #include",
"d) (",
"e) );"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned f_gold ( unsigned n ) {
unsigned ugly [ n ];
unsigned i2 = 0, i3 = 0, i5 = 0;
unsigned next_multiple_of_2 = 2;
unsigned next_multiple_of_3 = 3;
unsigned next_multiple_of_5 = 5;
unsigned next_ugly_no = 1;
ugly [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
next_ugly_no = min ( next_multiple_of_2, min ( next_multiple_of_3, next_multiple_of_5 ) );
ugly [ i ] = next_ugly_no;
if ( next_ugly_no == next_multiple_of_2 ) {
i2 = i2 + 1;
next_multiple_of_2 = ugly [ i2 ] * 2;
}
if ( next_ugly_no == next_multiple_of_3 ) {
i3 = i3 + 1;
next_multiple_of_3 = ugly [ i3 ] * 3;
}
if ( next_ugly_no == next_multiple_of_5 ) {
i5 = i5 + 1;
next_multiple_of_5 = ugly [ i5 ] * 5;
}
}
return next_ugly_no;
}
next_multiple_of_3 = ugly [ i3 ] * 3;
}
if ( next_ugly_no == next_multiple_of_5 ) {
i5 = i5 + 1;
next_multiple_of_5 = ugly [ i5 ] * 5;
}
}
return next_ugly_no;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,64,93,90,85,86,72,86,32,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned f_gold ( unsigned n ) { unsigned [MASK] [ n ]; unsigned i2 = 0, i3 = 0, i5 = 0; unsigned next_multiple_of_2 = 2; unsigned next_multiple_of_3 = 3; unsigned next_multiple_of_5 = 5; unsigned next_ugly_no = 1; ugly [ 0 ] = 1; for ( int i = 1; i < n; i ++ ) { next_ugly_no = min ( next_multiple_of_2, min ( next_multiple_of_3, next_multiple_of_5 ) ); ugly [ i ] = next_ugly_no; if ( next_ugly_no == next_multiple_of_2 ) { i2 = i2 + 1; next_multiple_of_2 = ugly [ i2 ] * 2; } if ( next_ugly_no == next_multiple_of_3 ) { i3 = i3 + 1; next_multiple_of_3 = ugly [ i3 ] * 3; } if ( next_ugly_no == next_multiple_of_5 ) { i5 = i5 + 1; next_multiple_of_5 = ugly [ i5 ] * 5; } } return next_ugly_no; }
next_multiple_of_3 = ugly [ i3 ] * 3;
}
if ( next_ugly_no == next_multiple_of_5 ) {
i5 = i5 + 1;
next_multiple_of_5 = ugly [ i5 ] * 5;
}
}
return next_ugly_no;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,64,93,90,85,86,72,86,32,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ugly | [
"a) <bits/stdc++.h>",
"b) ugly",
"c) <",
"d) ]",
"e) sum"
] | 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 r ) {
return ( 2 * r * r );
}
ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int r ) {
return ( 2 * r * r );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {14,78,45,66,18,32,60,16,99,65};
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 r ) { return ( 2 * [MASK] * r ); }ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int r ) {
return ( 2 * r * r );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {14,78,45,66,18,32,60,16,99,65};
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;
} | r | [
"a) :",
"b) (sizeof",
"c) r",
"d) ,",
"e) (x"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float r1, float r2, float r3 ) {
float pi = 3.14;
return 1.33 * pi * r1 * r2 * r3;
}
<vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float r1, float r2, float r3 ) {
float pi = 3.14;
return 1.33 * pi * r1 * r2 * r3;
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {3287.4842316041018F,-3707.427510963942F,8980.643174783816F,-2698.0187368852694F,8627.156664162168F,-7316.329924623669F,7857.3846206400485F,-6502.657905007728F,4468.400513325576F,-7231.864791620428F};
vector<float> param1 {4503.332888443404F,-6671.335781753231F,3584.781688607942F,-1004.7289573934537F,9572.27618966978F,-6591.043206581106F,3671.761679299217F,-1412.2240121470609F,2272.1999139470304F,-8036.087711033032F};
vector<float> param2 {8590.24729914204F,-2780.4954870801926F,2818.469507143102F,-9602.530725071243F,4783.930377855004F,-9760.465488363216F,2534.5825334137794F,-6135.238350044512F,4753.075799180736F,-6456.263512521035F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i])) + 0.0000001)) < 0.001F)
{
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; float f_gold ( float r1, float r2, float r3 ) { float pi = 3.14; return 1.33 * pi * r1 * r2 * r3; }<vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float r1, float r2, float r3 ) {
float pi = 3.14;
return 1.33 * pi * r1 * r2 * r3;
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {3287.4842316041018F,-3707.427510963942F,8980.643174783816F,-2698.0187368852694F,8627.156664162168F,-7316.329924623669F,7857.3846206400485F,-6502.657905007728F,4468.400513325576F,-7231.864791620428F};
vector<float> param1 {4503.332888443404F,-6671.335781753231F,3584.781688607942F,-1004.7289573934537F,9572.27618966978F,-6591.043206581106F,3671.761679299217F,-1412.2240121470609F,2272.1999139470304F,-8036.087711033032F};
vector<float> param2 {8590.24729914204F,-2780.4954870801926F,2818.469507143102F,-9602.530725071243F,4783.930377855004F,-9760.465488363216F,2534.5825334137794F,-6135.238350044512F,4753.075799180736F,-6456.263512521035F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i])) + 0.0000001)) < 0.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) i",
"b) #include",
"c) (",
"d) x:",
"e) ="
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str ) {
int n = str . length ( );
int i;
for ( i = 0;
i < n;
i ++ ) if ( str [ i ] != 'a' ) break;
if ( i * 2 != n ) return false;
int j;
for ( j = i;
j < n;
j ++ ) if ( str [ j ] != 'b' ) return false;
return true;
}
;
for ( i = 0;
i < n;
i ++ ) if ( str [ i ] != 'a' ) break;
if ( i * 2 != n ) return false;
int j;
for ( j = i;
j < n;
j ++ ) if ( str [ j ] != 'b' ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ba","aabb","abab","aaabb","aabbb","abaabbaa","abaababb","bbaa","11001000","ZWXv te"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str ) { int n = str . length ( ); int i; for ( i = 0; i < n; i ++ ) if ( str [ i ] != 'a' ) break; if ( i * 2 != n ) return false; int j; [MASK] ( j = i; j < n; j ++ ) if ( str [ j ] != 'b' ) return false; return true; };
for ( i = 0;
i < n;
i ++ ) if ( str [ i ] != 'a' ) break;
if ( i * 2 != n ) return false;
int j;
for ( j = i;
j < n;
j ++ ) if ( str [ j ] != 'b' ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ba","aabb","abab","aaabb","aabbb","abaabbaa","abaababb","bbaa","11001000","ZWXv te"};
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) jumps",
"b) for",
"c) int",
"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 ( char s [ ], char t [ ] ) {
int count = 0;
for ( int i = 0;
i < strlen ( t );
i ++ ) {
if ( count == strlen ( s ) ) break;
if ( t [ i ] == s [ count ] ) count ++;
}
return count;
}
r s [ ], char t [ ] ) {
int count = 0;
for ( int i = 0;
i < strlen ( t );
i ++ ) {
if ( count == strlen ( s ) ) break;
if ( t [ i ] == s [ count ] ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"nObYIOjEQZ","84574","1010001010010","DjZtAfUudk","550","1110","GywyxwH","67318370914755","11011000000101","G"};
vector<string> param1 {"uARTDTQbmGI","8538229","11","OewGm","132744553919","0101","LPQqEqrDZiwY","9928","00000","V"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front()) == f_gold(¶m0[i].front(),¶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 ( char s [ ], char t [ ] ) { int count = 0; for ( int i = 0; i < strlen ( t ); i ++ ) { if ( count == strlen ( s ) [MASK] break; if ( t [ i ] == s [ count ] ) count ++; } return count; }r s [ ], char t [ ] ) {
int count = 0;
for ( int i = 0;
i < strlen ( t );
i ++ ) {
if ( count == strlen ( s ) ) break;
if ( t [ i ] == s [ count ] ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"nObYIOjEQZ","84574","1010001010010","DjZtAfUudk","550","1110","GywyxwH","67318370914755","11011000000101","G"};
vector<string> param1 {"uARTDTQbmGI","8538229","11","OewGm","132744553919","0101","LPQqEqrDZiwY","9928","00000","V"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front()) == f_gold(¶m0[i].front(),¶m1[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) (",
"b) )",
"c) res",
"d) int",
"e) #include"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int i;
int ans = INT_MIN;
int maxval = 1;
int minval = 1;
int prevMax;
for ( i = 0;
i < n;
i ++ ) {
if ( arr [ i ] > 0 ) {
maxval = maxval * arr [ i ];
minval = min ( 1, minval * arr [ i ] );
}
else if ( arr [ i ] == 0 ) {
minval = 1;
maxval = 0;
}
else if ( arr [ i ] < 0 ) {
prevMax = maxval;
maxval = minval * arr [ i ];
minval = prevMax * arr [ i ];
}
ans = max ( ans, maxval );
if ( maxval <= 0 ) {
maxval = 1;
}
}
return ans;
}
prevMax = maxval;
maxval = minval * arr [ i ];
minval = prevMax * arr [ i ];
}
ans = max ( ans, maxval );
if ( maxval <= 0 ) {
maxval = 1;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19,25,34,39,41,51,52,53,54,56,64,67,72,87,92,93,95},{10},{0,0,0,0,0,0,1,1},{84,81,14,15,34,52,54,1,16,65,54,71,15,40,53,35,62,84,81,85,28,90,74,97,64,3,7,38},{-94,-86,-56,-52,-52,-46,-40,-36,-36,-30,-12,18,20,32,44,50,54,64,68,74,74,74,82},{0,0,0,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,1,0,0,0,1,1,0,0,1,0},{2,3,4,8,11,16,16,18,20,22,24,26,26,27,29,31,37,38,45,45,46,50,50,59,59,59,60,61,63,65,68,69,71,74,74,76,79,82,88,88,89,91,93,93,99,99},{2,-24,-8,-82,76,-62,38,6,-92,30,68,98,-68,8,24,-34,-34,64,-4,-2,-56,-30,92,10,-60,88,4,14,90,-44,-54,4,-4,-26,14,-2,0,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{70,92,76,56,93,55,12,80,56,36,83,14,16,12,70,55,93,28,84,28,49,66,15,49,98}};
vector<int> param1 {15,0,5,14,21,29,45,23,19,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int i; int ans = INT_MIN; int maxval = 1; int minval = 1; int prevMax; for ( i = 0; i < n; i ++ ) { if ( arr [ i ] > 0 ) { maxval = maxval * arr [ i ]; minval = min ( 1, minval * arr [ i ] ); } else if ( arr [ i ] == 0 ) { minval = 1; maxval = 0; } else if ( arr [ i ] < 0 ) { prevMax = maxval; maxval = minval * arr [ i ]; minval = prevMax * arr [ i ]; } ans = max ( ans, maxval ); if ( maxval <= 0 ) { maxval = 1; } } return ans; } prevMax = maxval;
maxval = minval * arr [ i ];
minval = prevMax * arr [ i ];
}
ans = max ( ans, maxval );
if ( maxval <= 0 ) {
maxval = 1;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19,25,34,39,41,51,52,53,54,56,64,67,72,87,92,93,95},{10},{0,0,0,0,0,0,1,1},{84,81,14,15,34,52,54,1,16,65,54,71,15,40,53,35,62,84,81,85,28,90,74,97,64,3,7,38},{-94,-86,-56,-52,-52,-46,-40,-36,-36,-30,-12,18,20,32,44,50,54,64,68,74,74,74,82},{0,0,0,0,1,0,0,1,1,1,0,1,0,1,1,0,1,1,1,1,1,1,0,0,0,1,1,0,0,1,0},{2,3,4,8,11,16,16,18,20,22,24,26,26,27,29,31,37,38,45,45,46,50,50,59,59,59,60,61,63,65,68,69,71,74,74,76,79,82,88,88,89,91,93,93,99,99},{2,-24,-8,-82,76,-62,38,6,-92,30,68,98,-68,8,24,-34,-34,64,-4,-2,-56,-30,92,10,-60,88,4,14,90,-44,-54,4,-4,-26,14,-2,0,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{70,92,76,56,93,55,12,80,56,36,83,14,16,12,70,55,93,28,84,28,49,66,15,49,98}};
vector<int> param1 {15,0,5,14,21,29,45,23,19,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <cstdlib> | [
"a) -",
"b) ++",
"c) ]",
"d) =",
"e) <cstdlib>"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
if ( x == 0 || x == 1 ) return x;
int i = 1, result = 1;
while ( result <= x ) {
i ++;
result = i * i;
}
return i - 1;
}
its/stdc++.h>
using namespace std;
int f_gold ( int x ) {
if ( x == 0 || x == 1 ) return x;
int i = 1, result = 1;
while ( result <= x ) {
i ++;
result = i * i;
}
return i - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {89,11,14,92,76,63,51,16,83,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 <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x ) { if ( x == 0 || x == 1 ) return x; int i = 1, result = 1; while ( result [MASK] x ) { i ++; result = i * i; } return i - 1; }its/stdc++.h>
using namespace std;
int f_gold ( int x ) {
if ( x == 0 || x == 1 ) return x;
int i = 1, result = 1;
while ( result <= x ) {
i ++;
result = i * i;
}
return i - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {89,11,14,92,76,63,51,16,83,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;
} | <= | [
"a) (",
"b) N",
"c) (",
"d) 2",
"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 a, int b ) {
int count = 0;
int p = abs ( a * b );
if ( p == 0 ) return 1;
while ( p > 0 ) {
count ++;
p = p / 10;
}
return count;
}
++.h>
using namespace std;
int f_gold ( int a, int b ) {
int count = 0;
int p = abs ( a * b );
if ( p == 0 ) return 1;
while ( p > 0 ) {
count ++;
p = p / 10;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {86,81,48,64,56,5,25,94,5,46};
vector<int> param1 {39,87,84,80,20,70,13,83,55,46};
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 [MASK] ( int a, int b ) { int count = 0; int p = abs ( a * b ); if ( p == 0 ) return 1; while ( p > 0 ) { count ++; p = p / 10; } return count; }++.h>
using namespace std;
int f_gold ( int a, int b ) {
int count = 0;
int p = abs ( a * b );
if ( p == 0 ) return 1;
while ( p > 0 ) {
count ++;
p = p / 10;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {86,81,48,64,56,5,25,94,5,46};
vector<int> param1 {39,87,84,80,20,70,13,83,55,46};
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;
} | f_gold | [
"a) for",
"b) x,",
"c) +",
"d) >",
"e) f_gold"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a ) {
return 4 * a;
}
clude <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a ) {
return 4 * a;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {98,9,18,38,84,8,39,6,60,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 [MASK] using namespace std; int f_gold ( int a ) { return 4 * a; }clude <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a ) {
return 4 * a;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {98,9,18,38,84,8,39,6,60,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;
} | <bits/stdc++.h> | [
"a) =",
"b) ]",
"c) <bits/stdc++.h>",
"d) #include",
"e) arr"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned long long f_gold ( int n ) {
return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) );
}
>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned long long f_gold ( int n ) {
return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,26,45,35,34,22,3,25,22,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned long long f_gold ( int n ) { return ( n * ( n + 1 ) / 2 ) * ( 1 [MASK] ( n - 1 ) ); }>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned long long f_gold ( int n ) {
return ( n * ( n + 1 ) / 2 ) * ( 1 << ( n - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,26,45,35,34,22,3,25,22,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | << | [
"a) yCount",
"b) <<",
"c) );}",
"d) 1;",
"e) r"
] | 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 set [ ], int n ) {
if ( n <= 2 ) return n;
int L [ n ] [ n ];
int llap = 2;
for ( int i = 0;
i < n;
i ++ ) L [ i ] [ n - 1 ] = 2;
for ( int j = n - 2;
j >= 1;
j -- ) {
int i = j - 1, k = j + 1;
while ( i >= 0 && k <= n - 1 ) {
if ( set [ i ] + set [ k ] < 2 * set [ j ] ) k ++;
else if ( set [ i ] + set [ k ] > 2 * set [ j ] ) {
L [ i ] [ j ] = 2, i --;
}
else {
L [ i ] [ j ] = L [ j ] [ k ] + 1;
llap = max ( llap, L [ i ] [ j ] );
i --;
k ++;
}
}
while ( i >= 0 ) {
L [ i ] [ j ] = 2;
i --;
}
}
return llap;
}
] = L [ j ] [ k ] + 1;
llap = max ( llap, L [ i ] [ j ] );
i --;
k ++;
}
}
while ( i >= 0 ) {
L [ i ] [ j ] = 2;
i --;
}
}
return llap;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,7,8,19,21,22,25,27,28,29,38,40,41,42,43,46,50,50,53,53,54,55,60,64,64,69,70,75,77,81,81,82,86,87,87,88,91,94,97},{40,-6,50,-18,42,78,38,-90,-44,-42,-86,78,-68,2,-32,-20,-44,54,80,54,70,26,82,-14,-74,-20,74,82},{0,0,0,0,1,1,1},{76,80},{-92,-90,-88,-76,-76,-60,-46,-40,-24,-8,-8,-6,2,12,36,38,58,76,80},{1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1},{5,8,11,27,27,32,32,37,50,51,55,61,62,68,73,83},{52,-74,-32,-64,-52,-60,-70,36,70,40,40,-18,90,-70,-82,-64,-8,-6,36,4,-58,62,-96,78,36,90,-70,-6,-84,24,84,32,-90,36,70,-60,-56,78,48,34,-16,80,82,58,14,-6,-8,76},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{11,21,76,45,8,49,97,66,17,11,87,4,34,89,79,88,6,91,19,56,91,25,17,90,26,59,34,32,43,17,98,39,72,78,93,43}};
vector<int> param1 {27,21,5,1,13,15,8,29,27,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int set [ ], int n ) { if ( n <= 2 ) return n; int L [ [MASK] ] [ n ]; int llap = 2; for ( int i = 0; i < n; i ++ ) L [ i ] [ n - 1 ] = 2; for ( int j = n - 2; j >= 1; j -- ) { int i = j - 1, k = j + 1; while ( i >= 0 && k <= n - 1 ) { if ( set [ i ] + set [ k ] < 2 * set [ j ] ) k ++; else if ( set [ i ] + set [ k ] > 2 * set [ j ] ) { L [ i ] [ j ] = 2, i --; } else { L [ i ] [ j ] = L [ j ] [ k ] + 1; llap = max ( llap, L [ i ] [ j ] ); i --; k ++; } } while ( i >= 0 ) { L [ i ] [ j ] = 2; i --; } } return llap; } ] = L [ j ] [ k ] + 1;
llap = max ( llap, L [ i ] [ j ] );
i --;
k ++;
}
}
while ( i >= 0 ) {
L [ i ] [ j ] = 2;
i --;
}
}
return llap;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,7,8,19,21,22,25,27,28,29,38,40,41,42,43,46,50,50,53,53,54,55,60,64,64,69,70,75,77,81,81,82,86,87,87,88,91,94,97},{40,-6,50,-18,42,78,38,-90,-44,-42,-86,78,-68,2,-32,-20,-44,54,80,54,70,26,82,-14,-74,-20,74,82},{0,0,0,0,1,1,1},{76,80},{-92,-90,-88,-76,-76,-60,-46,-40,-24,-8,-8,-6,2,12,36,38,58,76,80},{1,1,1,0,0,0,0,1,1,1,0,0,0,1,0,1,1},{5,8,11,27,27,32,32,37,50,51,55,61,62,68,73,83},{52,-74,-32,-64,-52,-60,-70,36,70,40,40,-18,90,-70,-82,-64,-8,-6,36,4,-58,62,-96,78,36,90,-70,-6,-84,24,84,32,-90,36,70,-60,-56,78,48,34,-16,80,82,58,14,-6,-8,76},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{11,21,76,45,8,49,97,66,17,11,87,4,34,89,79,88,6,91,19,56,91,25,17,90,26,59,34,32,43,17,98,39,72,78,93,43}};
vector<int> param1 {27,21,5,1,13,15,8,29,27,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) return",
"b) thi",
"c) ==",
"d) n",
"e) Math"
] | 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 += 2 ) sum += C [ n ] [ i ];
return sum;
}
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 += 2 ) sum += C [ n ] [ i ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,54,67,17,47,99,26,93,57,98};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold [MASK] 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 += 2 ) sum += C [ n ] [ i ]; return sum; } 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 += 2 ) sum += C [ n ] [ i ];
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,54,67,17,47,99,26,93,57,98};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) (",
"b) [",
"c) return",
"d) %",
"e) k,"
] | 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, pair < int, int > > mp;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) mp [ arr [ i ] + arr [ j ] ] = {
i, j };
int d = INT_MIN;
for ( int i = 0;
i < n - 1;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) {
int abs_diff = abs ( arr [ i ] - arr [ j ] );
if ( mp . find ( abs_diff ) != mp . end ( ) ) {
pair < int, int > p = mp [ abs_diff ];
if ( p . first != i && p . first != j && p . second != i && p . second != j ) d = max ( d, max ( arr [ i ], arr [ j ] ) );
}
}
}
return d;
}
= mp [ abs_diff ];
if ( p . first != i && p . first != j && p . second != i && p . second != j ) d = max ( d, max ( arr [ i ], arr [ j ] ) );
}
}
}
return d;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,5,7,10,35,35,45,49,50,57,58,60,64,69,83,83,87,88,89,93,94},{94,90,88,0,-90,-68,94,-2,-50,-92,66,32,10,8,-14,-96,80,-60,48,-96,46,24,64,2,-30,28},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{83,72,91,22,96,38,71,18,58,39,7,8,65,67},{-96,-92,-88,-86,-82,-80,-78,-76,-74,-72,-62,-54,-42,-40,-38,-36,-36,-34,-32,-32,-26,-26,-22,-14,-14,2,16,24,26,32,32,34,48,48,64,66,70,74,82,90},{1,0,0,1,0,0,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,1,0,1,1,0,0,1,1},{2,2,4,10,11,13,15,20,32,33,33,42,46,46,50,54,55,55,56,57,58,63,68,79,87,94},{58,78,28,54,-10,46,-78,-68,-44,64,78,80,-54,-38,-54,60,26,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,55,98,18,11,55,2,95,84,14,75,12,43,54,78,34,69,24,82,65,11,49,34,60,99,71,1,17,88,12,45,46,56,28,70,34,7,55,40,12,38,56,54,53,28}};
vector<int> param1 {12,15,17,7,28,29,18,13,28,24};
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, pair < int, int > > mp; for ( int i = 0; i < n - 1; i ++ ) for ( int j = i + 1; j < n; j ++ ) mp [ arr [ i ] + arr [ j ] ] = { i, j }; int d = INT_MIN; for ( int i = 0; i < n - 1; i ++ ) { for ( int j = i + 1; j < n; j ++ ) { int abs_diff = [MASK] ( arr [ i ] - arr [ j ] ); if ( mp . find ( abs_diff ) != mp . end ( ) ) { pair < int, int > p = mp [ abs_diff ]; if ( p . first != i && p . first != j && p . second != i && p . second != j ) d = max ( d, max ( arr [ i ], arr [ j ] ) ); } } } return d; } = mp [ abs_diff ];
if ( p . first != i && p . first != j && p . second != i && p . second != j ) d = max ( d, max ( arr [ i ], arr [ j ] ) );
}
}
}
return d;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,5,7,10,35,35,45,49,50,57,58,60,64,69,83,83,87,88,89,93,94},{94,90,88,0,-90,-68,94,-2,-50,-92,66,32,10,8,-14,-96,80,-60,48,-96,46,24,64,2,-30,28},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{83,72,91,22,96,38,71,18,58,39,7,8,65,67},{-96,-92,-88,-86,-82,-80,-78,-76,-74,-72,-62,-54,-42,-40,-38,-36,-36,-34,-32,-32,-26,-26,-22,-14,-14,2,16,24,26,32,32,34,48,48,64,66,70,74,82,90},{1,0,0,1,0,0,1,1,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,0,1,1,1,1,0,1,1,1,0,1,1,0,0,1,1},{2,2,4,10,11,13,15,20,32,33,33,42,46,46,50,54,55,55,56,57,58,63,68,79,87,94},{58,78,28,54,-10,46,-78,-68,-44,64,78,80,-54,-38,-54,60,26,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,55,98,18,11,55,2,95,84,14,75,12,43,54,78,34,69,24,82,65,11,49,34,60,99,71,1,17,88,12,45,46,56,28,70,34,7,55,40,12,38,56,54,53,28}};
vector<int> param1 {12,15,17,7,28,29,18,13,28,24};
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;
} | abs | [
"a) (",
"b) return",
"c) arr",
"d) abs",
"e) rows"
] | 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 ) {
vector < char > list;
for ( int i = 0;
i < str . length ( );
i ++ ) {
auto pos = find ( list . begin ( ), list . end ( ), str [ i ] );
if ( pos != list . end ( ) ) {
auto posi = find ( list . begin ( ), list . end ( ), str [ i ] );
list . erase ( posi );
}
else list . push_back ( str [ i ] );
}
if ( str . length ( ) % 2 == 0 && list . empty ( ) || ( str . length ( ) % 2 == 1 && list . size ( ) == 1 ) ) return true;
else return false;
}
}
else list . push_back ( str [ i ] );
}
if ( str . length ( ) % 2 == 0 && list . empty ( ) || ( str . length ( ) % 2 == 1 && list . size ( ) == 1 ) ) return true;
else return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"abccba","2674377254","11","abcdecba","26382426486138","111010111010","hUInqJXNdbfP","5191","1110101101","NupSrU xz"};
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 ) { vector < char > list; for ( int i = 0; i < str . length ( ); i ++ ) { auto pos = find ( list . begin ( ), list . end ( ), str [ i ] ); if [MASK] pos != list . end ( ) ) { auto posi = find ( list . begin ( ), list . end ( ), str [ i ] ); list . erase ( posi ); } else list . push_back ( str [ i ] ); } if ( str . length ( ) % 2 == 0 && list . empty ( ) || ( str . length ( ) % 2 == 1 && list . size ( ) == 1 ) ) return true; else return false; } }
else list . push_back ( str [ i ] );
}
if ( str . length ( ) % 2 == 0 && list . empty ( ) || ( str . length ( ) % 2 == 1 && list . size ( ) == 1 ) ) return true;
else return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"abccba","2674377254","11","abcdecba","26382426486138","111010111010","hUInqJXNdbfP","5191","1110101101","NupSrU xz"};
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) 4",
"b) :",
"c) <bits/stdc++.h>",
"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 ( string str1, string str2 ) {
if ( str1 . length ( ) != str2 . length ( ) ) return false;
string clock_rot = "";
string anticlock_rot = "";
int len = str2 . length ( );
anticlock_rot = anticlock_rot + str2 . substr ( len - 2, 2 ) + str2 . substr ( 0, len - 2 );
clock_rot = clock_rot + str2 . substr ( 2 ) + str2 . substr ( 0, 2 );
return ( str1 . compare ( clock_rot ) == 0 || str1 . compare ( anticlock_rot ) == 0 );
}
) + str2 . substr ( 0, len - 2 );
clock_rot = clock_rot + str2 . substr ( 2 ) + str2 . substr ( 0, 2 );
return ( str1 . compare ( clock_rot ) == 0 || str1 . compare ( anticlock_rot ) == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"amazon","onamaz","amazon","ab","737009","000110","l","4420318628","11011111000000"," pvFHANc"};
vector<string> param1 {"azonam","amazon","azoman","ab","239119","01111","YVo hqvnGxow","52856","10","xBIDFbiGb"};
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; bool f_gold ( string str1, string str2 ) { if ( str1 . length ( ) != str2 . length ( ) ) return false; string [MASK] = ""; string anticlock_rot = ""; int len = str2 . length ( ); anticlock_rot = anticlock_rot + str2 . substr ( len - 2, 2 ) + str2 . substr ( 0, len - 2 ); clock_rot = clock_rot + str2 . substr ( 2 ) + str2 . substr ( 0, 2 ); return ( str1 . compare ( clock_rot ) == 0 || str1 . compare ( anticlock_rot ) == 0 ); }) + str2 . substr ( 0, len - 2 );
clock_rot = clock_rot + str2 . substr ( 2 ) + str2 . substr ( 0, 2 );
return ( str1 . compare ( clock_rot ) == 0 || str1 . compare ( anticlock_rot ) == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"amazon","onamaz","amazon","ab","737009","000110","l","4420318628","11011111000000"," pvFHANc"};
vector<string> param1 {"azonam","amazon","azoman","ab","239119","01111","YVo hqvnGxow","52856","10","xBIDFbiGb"};
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;
} | clock_rot | [
"a) -",
"b) clock_rot",
"c) x,",
"d) int",
"e) ("
] | b |
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 ( n == 0 ) return false;
if ( n == 1 ) return ( ( str [ 0 ] - '0' ) % 4 == 0 );
int last = str [ n - 1 ] - '0';
int second_last = str [ n - 2 ] - '0';
return ( ( second_last * 10 + last ) % 4 == 0 );
}
turn false;
if ( n == 1 ) return ( ( str [ 0 ] - '0' ) % 4 == 0 );
int last = str [ n - 1 ] - '0';
int second_last = str [ n - 2 ] - '0';
return ( ( second_last * 10 + last ) % 4 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"PjAFZXQgN","12325195609714","00101111101","xOtbXZiA","980","000000100","zFacc W","8","110011","afiutekeSfYrX"};
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 ( n == 0 ) return false; if ( n == 1 ) return ( ( str [ 0 ] - '0' ) % 4 == 0 ); int last = str [ n - 1 ] - '0'; int second_last = str [ n - [MASK] ] - '0'; return ( ( second_last * 10 + last ) % 4 == 0 ); }turn false;
if ( n == 1 ) return ( ( str [ 0 ] - '0' ) % 4 == 0 );
int last = str [ n - 1 ] - '0';
int second_last = str [ n - 2 ] - '0';
return ( ( second_last * 10 + last ) % 4 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"PjAFZXQgN","12325195609714","00101111101","xOtbXZiA","980","000000100","zFacc W","8","110011","afiutekeSfYrX"};
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;
} | 2 | [
"a) arr.sort",
"b) ]",
"c) max",
"d) return",
"e) 2"
] | 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 b, int m ) {
return ( b / m - 1 ) * ( b / m ) / 2;
}
lib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int b, int m ) {
return ( b / m - 1 ) * ( b / m ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,38,47,52,21,50,8,56,93,21};
vector<int> param1 {74,35,71,29,9,33,82,80,5,90};
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 b, int m ) [MASK] return ( b / m - 1 ) * ( b / m ) / 2; }lib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int b, int m ) {
return ( b / m - 1 ) * ( b / m ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,38,47,52,21,50,8,56,93,21};
vector<int> param1 {74,35,71,29,9,33,82,80,5,90};
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) y",
"c) *(int*)b",
"d) #include",
"e) res"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
unordered_set < int > s ( a, a + n );
int arr_sum = accumulate ( a, a + n, 0 );
int set_sum = accumulate ( s . begin ( ), s . end ( ), 0 );
return ( 3 * set_sum - arr_sum ) / 2;
}
nt n ) {
unordered_set < int > s ( a, a + n );
int arr_sum = accumulate ( a, a + n, 0 );
int set_sum = accumulate ( s . begin ( ), s . end ( ), 0 );
return ( 3 * set_sum - arr_sum ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,3,12,16,28,31,44,48,57,59,60,68,69,70,70,72,73,76,78,78,79,84,86,93,96},{-2,-62,8,-96,-50,-70,-48,-20,76,-54,-62,8,30,-68,-64,-94,-10,-78,-68,-98,0,30,62,-40,-36,90,-46,38,28,-86,-20,12,56,-50,82,-18,-28,-62,88,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,33,83,92,40,53,18,39,17,71,15,85,44,12,56,77,54,87,11,74,11,9,73,72,64,98,18,13,74,64,59,44,95,56,6,96,47,36,35,51,30,39,91,74,68},{-94,-90,-82,-80,-74,-40,-40,-38,-36,-28,-26,-20,-16,-14,-14,-10,-8,-8,10,14,18,22,22,28,28,30,74,82},{1,1,1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,1,1,0,1,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1},{2,6,6,12,13,13,15,16,24,25,29,36,42,44,47,47,47,48,51,51,55,55,55,58,58,60,61,62,62,64,66,70,70,75,76,77,78,78,79,80,80,82,83,83,84,85,90,99},{-94,50,-86,-94,92,-50,74,-54,54,-20,-28,-44,-94,-80,-12,-38,64,-22,38,70,-4,62,66,88,-94,72,88,32,-80,60,-70,-74,-66,82,82},{0,0,0,1,1,1,1,1,1,1,1,1,1,1},{62,29,76,58,16,7,83,45,17,67,88,78,6,36,33,99,39,59,77,64,32,20,10,92,3,20,7,14,11,28}};
vector<int> param1 {14,26,18,35,27,35,42,34,7,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> [MASK] <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { unordered_set < int > s ( a, a + n ); int arr_sum = accumulate ( a, a + n, 0 ); int set_sum = accumulate ( s . begin ( ), s . end ( ), 0 ); return ( 3 * set_sum - arr_sum ) / 2; }nt n ) {
unordered_set < int > s ( a, a + n );
int arr_sum = accumulate ( a, a + n, 0 );
int set_sum = accumulate ( s . begin ( ), s . end ( ), 0 );
return ( 3 * set_sum - arr_sum ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,3,12,16,28,31,44,48,57,59,60,68,69,70,70,72,73,76,78,78,79,84,86,93,96},{-2,-62,8,-96,-50,-70,-48,-20,76,-54,-62,8,30,-68,-64,-94,-10,-78,-68,-98,0,30,62,-40,-36,90,-46,38,28,-86,-20,12,56,-50,82,-18,-28,-62,88,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,33,83,92,40,53,18,39,17,71,15,85,44,12,56,77,54,87,11,74,11,9,73,72,64,98,18,13,74,64,59,44,95,56,6,96,47,36,35,51,30,39,91,74,68},{-94,-90,-82,-80,-74,-40,-40,-38,-36,-28,-26,-20,-16,-14,-14,-10,-8,-8,10,14,18,22,22,28,28,30,74,82},{1,1,1,1,1,0,1,0,1,1,0,0,0,0,1,0,1,1,1,0,1,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1},{2,6,6,12,13,13,15,16,24,25,29,36,42,44,47,47,47,48,51,51,55,55,55,58,58,60,61,62,62,64,66,70,70,75,76,77,78,78,79,80,80,82,83,83,84,85,90,99},{-94,50,-86,-94,92,-50,74,-54,54,-20,-28,-44,-94,-80,-12,-38,64,-22,38,70,-4,62,66,88,-94,72,88,32,-80,60,-70,-74,-66,82,82},{0,0,0,1,1,1,1,1,1,1,1,1,1,1},{62,29,76,58,16,7,83,45,17,67,88,78,6,36,33,99,39,59,77,64,32,20,10,92,3,20,7,14,11,28}};
vector<int> param1 {14,26,18,35,27,35,42,34,7,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) #include",
"b) .",
"c) (",
"d) num",
"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 arr1 [ ], int arr2 [ ], int m, int n, int x ) {
int count = 0;
int l = 0, r = n - 1;
while ( l < m && r >= 0 ) {
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) {
l ++;
r --;
count ++;
}
else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++;
else r --;
}
return count;
}
&& r >= 0 ) {
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) {
l ++;
r --;
count ++;
}
else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++;
else r --;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,5,7,10,14,14,17,21,32,34,37,40,40,40,46,46,50,50,51,55,57,62,65,67,67,69,70,70,72,73,76,77,77,78,84,85,85,86,87,88,88,89,89,90,93,99},{-84,52,-34,96,16,92,-64,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{60,92,42,83,55,76,29,62},{-94,-94,-58,-40,-40,-26,-24,-22,-22,-22,-2,0,4,8,12,16,16,18,22,32,42,44,50,58,64,78,80,90},{0,0,1,1,1,0,0,1,1,1},{1,5,7,7,7,14,15,16,17,18,18,19,20,25,27,31,36,42,47,51,56,56,56,58,58,59,63,63,63,65,66,67,76,83,93,94,97},{78,-74,52,56,-8,92,14,56,-72,-92,32,-94,-26,-8,-66,72,-24,36,-84,-4,-68,14,78,40,-82,-10,16,56,6,-16,30,24,-32},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{17,50,65,4,19,10,45,70,76,81,28,97,55,70,38,2,40,67,36,33,6,85,25}};
vector<vector<int>> param1 {{2,5,8,8,10,12,13,15,17,18,20,20,21,27,28,31,34,37,40,46,48,52,53,54,54,58,59,60,66,68,68,69,70,71,72,73,77,77,80,84,84,92,92,95,97,97},{-22,26,-12,-54,66,86,38,76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,2,74,42,80,71,26,76},{-86,-84,-78,-76,-72,-70,-62,-58,-54,-54,-50,-46,-44,-40,-30,-28,-16,-10,10,36,36,48,70,84,84,90,94,98},{1,1,1,0,1,1,0,0,0,0},{2,3,7,8,9,10,17,18,21,28,29,29,33,35,46,47,47,49,49,49,53,56,58,59,59,60,65,67,70,78,81,85,85,87,90,92,96},{-74,22,-14,-2,36,86,-70,-20,-76,-84,-40,-36,42,22,-60,-94,-18,8,-14,-42,-68,62,-60,2,40,-66,68,96,70,98,-38,-74,-92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{78,92,65,23,7,94,18,4,2,53,31,58,98,18,46,16,17,92,80,92,43,70,50}};
vector<int> param2 {28,6,37,4,17,5,28,16,25,16};
vector<int> param3 {29,5,26,7,27,8,34,30,33,22};
vector<int> param4 {23,7,42,7,17,9,31,24,33,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) { int count = 0; int l = 0, r = n - 1; while ( l < m && r >= 0 ) { if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) { l ++; r --; count ++; } else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++; else r --; } return count; [MASK]&& r >= 0 ) {
if ( ( arr1 [ l ] + arr2 [ r ] ) == x ) {
l ++;
r --;
count ++;
}
else if ( ( arr1 [ l ] + arr2 [ r ] ) < x ) l ++;
else r --;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,5,7,10,14,14,17,21,32,34,37,40,40,40,46,46,50,50,51,55,57,62,65,67,67,69,70,70,72,73,76,77,77,78,84,85,85,86,87,88,88,89,89,90,93,99},{-84,52,-34,96,16,92,-64,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{60,92,42,83,55,76,29,62},{-94,-94,-58,-40,-40,-26,-24,-22,-22,-22,-2,0,4,8,12,16,16,18,22,32,42,44,50,58,64,78,80,90},{0,0,1,1,1,0,0,1,1,1},{1,5,7,7,7,14,15,16,17,18,18,19,20,25,27,31,36,42,47,51,56,56,56,58,58,59,63,63,63,65,66,67,76,83,93,94,97},{78,-74,52,56,-8,92,14,56,-72,-92,32,-94,-26,-8,-66,72,-24,36,-84,-4,-68,14,78,40,-82,-10,16,56,6,-16,30,24,-32},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{17,50,65,4,19,10,45,70,76,81,28,97,55,70,38,2,40,67,36,33,6,85,25}};
vector<vector<int>> param1 {{2,5,8,8,10,12,13,15,17,18,20,20,21,27,28,31,34,37,40,46,48,52,53,54,54,58,59,60,66,68,68,69,70,71,72,73,77,77,80,84,84,92,92,95,97,97},{-22,26,-12,-54,66,86,38,76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,2,74,42,80,71,26,76},{-86,-84,-78,-76,-72,-70,-62,-58,-54,-54,-50,-46,-44,-40,-30,-28,-16,-10,10,36,36,48,70,84,84,90,94,98},{1,1,1,0,1,1,0,0,0,0},{2,3,7,8,9,10,17,18,21,28,29,29,33,35,46,47,47,49,49,49,53,56,58,59,59,60,65,67,70,78,81,85,85,87,90,92,96},{-74,22,-14,-2,36,86,-70,-20,-76,-84,-40,-36,42,22,-60,-94,-18,8,-14,-42,-68,62,-60,2,40,-66,68,96,70,98,-38,-74,-92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{78,92,65,23,7,94,18,4,2,53,31,58,98,18,46,16,17,92,80,92,43,70,50}};
vector<int> param2 {28,6,37,4,17,5,28,16,25,16};
vector<int> param3 {29,5,26,7,27,8,34,30,33,22};
vector<int> param4 {23,7,42,7,17,9,31,24,33,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) )",
"b) }",
"c) #include",
"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 n, int a [ ] ) {
int res = 0;
for ( int i = 0;
i < 2 * n;
i ++ ) {
if ( i % 2 == 0 ) res += a [ i ] * a [ i ];
else res -= a [ i ] * a [ i ];
}
return res;
}
;
int f_gold ( int n, int a [ ] ) {
int res = 0;
for ( int i = 0;
i < 2 * n;
i ++ ) {
if ( i % 2 == 0 ) res += a [ i ] * a [ i ];
else res -= a [ i ] * a [ i ];
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,18,18,11,21,26,6,1,13,11};
vector<vector<int>> param1 {{4,4,5,11,13,14,19,20,25,25,26,33,34,37,43,44,44,45,47,48,50,50,60,61,64,65,71,73,79,80,83,85,87,90,95,96,98},{-16,-38,-68,52,-92,76,94,-28,62,-26,38,-14,66,80,-70,52,-84,64,80,-36},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{11,35,61,21,61,26,27,93,95,77,5,33,94,67},{-96,-90,-64,-60,-52,-50,-42,-36,-30,-16,-8,-8,-4,18,20,22,24,34,52,54,58,64,74,78,80,86,88,96},{0,0,1,0,1,1,1,1,1,0,1,0,0,0,0,1,1,1,0,1,0,0,1,0,0,0,1,0,0,0,1,1,1,0,0,1,0,0,1,1,0},{4,28,35,42,44,58,64,69,72,76,90},{-44,-34},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{83,48,93,25,25,35,39,34,98,80,22,14,48,64,77,87,56,27,33,15,81}};
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 [ ] ) { int res = 0; for ( int i = 0; i < 2 * [MASK] i ++ ) { if ( i % 2 == 0 ) res += a [ i ] * a [ i ]; else res -= a [ i ] * a [ i ]; } return res; };
int f_gold ( int n, int a [ ] ) {
int res = 0;
for ( int i = 0;
i < 2 * n;
i ++ ) {
if ( i % 2 == 0 ) res += a [ i ] * a [ i ];
else res -= a [ i ] * a [ i ];
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,18,18,11,21,26,6,1,13,11};
vector<vector<int>> param1 {{4,4,5,11,13,14,19,20,25,25,26,33,34,37,43,44,44,45,47,48,50,50,60,61,64,65,71,73,79,80,83,85,87,90,95,96,98},{-16,-38,-68,52,-92,76,94,-28,62,-26,38,-14,66,80,-70,52,-84,64,80,-36},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{11,35,61,21,61,26,27,93,95,77,5,33,94,67},{-96,-90,-64,-60,-52,-50,-42,-36,-30,-16,-8,-8,-4,18,20,22,24,34,52,54,58,64,74,78,80,86,88,96},{0,0,1,0,1,1,1,1,1,0,1,0,0,0,0,1,1,1,0,1,0,0,1,0,0,0,1,0,0,0,1,1,1,0,0,1,0,0,1,1,0},{4,28,35,42,44,58,64,69,72,76,90},{-44,-34},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{83,48,93,25,25,35,39,34,98,80,22,14,48,64,77,87,56,27,33,15,81}};
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;
} | n; | [
"a) (",
"b) n",
"c) =",
"d) int",
"e) n;"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, int m ) {
int n = ( int ) sqrt ( m ) + 1;
int an = 1;
for ( int i = 0;
i < n;
++ i ) an = ( an * a ) % m;
unordered_map < int, int > value;
for ( int i = 1, cur = an;
i <= n;
++ i ) {
if ( ! value [ cur ] ) value [ cur ] = i;
cur = ( cur * an ) % m;
}
for ( int i = 0, cur = b;
i <= n;
++ i ) {
if ( value [ cur ] ) {
int ans = value [ cur ] * n - i;
if ( ans < m ) return ans;
}
cur = ( cur * a ) % m;
}
return - 1;
}
r ( int i = 0, cur = b;
i <= n;
++ i ) {
if ( value [ cur ] ) {
int ans = value [ cur ] * n - i;
if ( ans < m ) return ans;
}
cur = ( cur * a ) % m;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,10,55,3,80,65,47,50,44,47};
vector<int> param1 {81,97,63,18,48,87,79,74,86,8};
vector<int> param2 {29,69,15,41,77,97,19,90,56,77};
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 m ) { int n = ( int ) sqrt ( m ) + 1; int an = 1; for ( int i = 0; i < n; ++ i ) an = ( an * a ) % m; unordered_map < int, int > value; for ( int i = 1, cur = an; i <= n; ++ i ) { if ( ! value [ cur ] ) value [ cur ] = i; cur = ( cur * an ) % m; } for ( int i = 0, cur = b; i <= n; ++ i ) { if ( value [ cur ] ) { int [MASK] = value [ cur ] * n - i; if ( ans < m ) return ans; } cur = ( cur * a ) % m; } return - 1; }r ( int i = 0, cur = b;
i <= n;
++ i ) {
if ( value [ cur ] ) {
int ans = value [ cur ] * n - i;
if ( ans < m ) return ans;
}
cur = ( cur * a ) % m;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,10,55,3,80,65,47,50,44,47};
vector<int> param1 {81,97,63,18,48,87,79,74,86,8};
vector<int> param2 {29,69,15,41,77,97,19,90,56,77};
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;
} | ans | [
"a) arr.sort",
"b) [",
"c) )",
"d) ans",
"e) :"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str ) {
int n = str . length ( );
string arr [ n ];
string concat = str + str;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = concat . substr ( i, n );
sort ( arr, arr + n );
return arr [ 0 ];
}
int n = str . length ( );
string arr [ n ];
string concat = str + str;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = concat . substr ( i, n );
sort ( arr, arr + n );
return arr [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"onWEchl","2","100","GHbCZA","50568798206105","001011110001","lljpYhznnyu","54499921759984","11101","qvypgCYEjsyjwZ"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str ) { int n = str . length ( ); string arr [ n ]; string concat = str + str; for ( int i = [MASK] i < n; i ++ ) arr [ i ] = concat . substr ( i, n ); sort ( arr, arr + n ); return arr [ 0 ]; }int n = str . length ( );
string arr [ n ];
string concat = str + str;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = concat . substr ( i, n );
sort ( arr, arr + n );
return arr [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"onWEchl","2","100","GHbCZA","50568798206105","001011110001","lljpYhznnyu","54499921759984","11101","qvypgCYEjsyjwZ"};
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;
} | 0; | [
"a) 0;",
"b) void",
"c) <iomanip>",
"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 arr [ ], int n, int k ) {
int count = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++;
}
return count;
}
int count = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,14,17,19,22,23,23,27,30,31,34,37,37,39,39,42,57,61,68,73,77,79,91,96,97},{-78,-42,28,-88,18,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{8,46,57,28,80,2,75,57,83,45,32,49,77,30,94,33,23,29,35,81,85},{-90,-72,-72,-62,-62,-54,-54,-52,-48,-38,-22,-22,-22,-12,-12,-8,-8,-8,-6,-6,-2,6,12,26,26,28,28,38,40,48,52,52,58,60,68,70,72,76,76,76,92},{0,0,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0,0,1,0,0,1,0,1},{3,13,19,23,27,32,49,52,54,57,58,58,63,67,68,68,69,70,75,80,86,90,91,95},{-56,40,-66,42,8,-40,-8,-42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{99,12,90,10,86,86,81,19,1,1,98,82,34,39,34,1,54,47,39,82,21,50,82,41,98,47,88,46,72,28,28,29,60,87,92,53,93,29,74,75,11,32,48,47,85,16,20}};
vector<int> param1 {19,3,16,15,22,45,19,7,16,24};
vector<int> param2 {19,4,14,11,25,39,21,6,28,45};
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 count = 0; for ( int i = 0; [MASK] < n; i ++ ) { for ( int j = i + 1; j < n; j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++; } return count; }int count = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] - arr [ j ] == k || arr [ j ] - arr [ i ] == k ) count ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,14,17,19,22,23,23,27,30,31,34,37,37,39,39,42,57,61,68,73,77,79,91,96,97},{-78,-42,28,-88,18,-52},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{8,46,57,28,80,2,75,57,83,45,32,49,77,30,94,33,23,29,35,81,85},{-90,-72,-72,-62,-62,-54,-54,-52,-48,-38,-22,-22,-22,-12,-12,-8,-8,-8,-6,-6,-2,6,12,26,26,28,28,38,40,48,52,52,58,60,68,70,72,76,76,76,92},{0,0,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,1,1,0,0,1,0,1,1,1,1,1,0,0,0,0,0,0,1,0,1,0,1,0,0,1,0,0,1,0,1},{3,13,19,23,27,32,49,52,54,57,58,58,63,67,68,68,69,70,75,80,86,90,91,95},{-56,40,-66,42,8,-40,-8,-42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{99,12,90,10,86,86,81,19,1,1,98,82,34,39,34,1,54,47,39,82,21,50,82,41,98,47,88,46,72,28,28,29,60,87,92,53,93,29,74,75,11,32,48,47,85,16,20}};
vector<int> param1 {19,3,16,15,22,45,19,7,16,24};
vector<int> param2 {19,4,14,11,25,39,21,6,28,45};
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;
} | i | [
"a) >",
"b) #include",
"c) (",
"d) class",
"e) i"
] | 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 low, int high ) {
if ( high < low ) return arr [ 0 ];
if ( high == low ) return arr [ low ];
int mid = low + ( high - low ) / 2;
if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return arr [ mid + 1 ];
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return arr [ mid ];
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
id + 1 ];
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return arr [ mid ];
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,22,50,64,68,79,84,88,89},{88,-38,46,24,-52,-12,-90,28,18,14,-72,58,-98,28,-84,44,-42,-32,-22,-22,-82,-30,90,18,62,62,92,6,60,28,-90,92,82,62,98,-68,48,-74,-8,50,62,24,30,-86,98,-96,-98},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,66,94,28,38,31,92,66,81,8,36,64,80,32,48,71,72,54,61,60,89},{-46,-26,-22,-14,46,62},{0,1,1,1},{14,81,87},{4},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{3,41,40,53,82,9,90,43,90,59,37,21,92,98,36,99,35,67,24,29,40,31,46,12,29,8,93,67,44,83,71,29,22,32,33,11,44,97,84,44,8,10,31,50,22,8}};
vector<int> param1 {4,42,28,19,4,2,1,0,15,42};
vector<int> param2 {6,31,21,17,4,2,1,0,17,31};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high ) { if ( high < low ) return arr [ 0 ]; if ( high == low ) return arr [ low ]; int mid = low + ( high - low ) / 2; if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return arr [ mid + 1 ]; if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return arr [ mid ]; if ( arr [ high ] > arr [ mid ] ) [MASK] f_gold ( arr, low, mid - 1 ); return f_gold ( arr, mid + 1, high ); }id + 1 ];
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return arr [ mid ];
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,22,50,64,68,79,84,88,89},{88,-38,46,24,-52,-12,-90,28,18,14,-72,58,-98,28,-84,44,-42,-32,-22,-22,-82,-30,90,18,62,62,92,6,60,28,-90,92,82,62,98,-68,48,-74,-8,50,62,24,30,-86,98,-96,-98},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,66,94,28,38,31,92,66,81,8,36,64,80,32,48,71,72,54,61,60,89},{-46,-26,-22,-14,46,62},{0,1,1,1},{14,81,87},{4},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{3,41,40,53,82,9,90,43,90,59,37,21,92,98,36,99,35,67,24,29,40,31,46,12,29,8,93,67,44,83,71,29,22,32,33,11,44,97,84,44,8,10,31,50,22,8}};
vector<int> param1 {4,42,28,19,4,2,1,0,15,42};
vector<int> param2 {6,31,21,17,4,2,1,0,17,31};
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;
} | return | [
"a) ]",
"b) W",
"c) arr.sort",
"d) return",
"e) 1;"
] | 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 S, string T ) {
int m = T . length ( ), n = S . length ( );
if ( m > n ) return 0;
int mat [ m + 1 ] [ n + 1 ];
for ( int i = 1;
i <= m;
i ++ ) mat [ i ] [ 0 ] = 0;
for ( int j = 0;
j <= n;
j ++ ) mat [ 0 ] [ j ] = 1;
for ( int i = 1;
i <= m;
i ++ ) {
for ( int j = 1;
j <= n;
j ++ ) {
if ( T [ i - 1 ] != S [ j - 1 ] ) mat [ i ] [ j ] = mat [ i ] [ j - 1 ];
else mat [ i ] [ j ] = mat [ i ] [ j - 1 ] + mat [ i - 1 ] [ j - 1 ];
}
}
return mat [ m ] [ n ];
}
) {
if ( T [ i - 1 ] != S [ j - 1 ] ) mat [ i ] [ j ] = mat [ i ] [ j - 1 ];
else mat [ i ] [ j ] = mat [ i ] [ j - 1 ] + mat [ i - 1 ] [ j - 1 ];
}
}
return mat [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"banana","49597223","1000010000011","BTlzufK","3474007","0010","dKHhoTD","9123259723","11001000111110","iY WJlIZ"};
vector<string> param1 {"ban","42","010","lf","370","00000","doT","123","0","iI"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string S, string T ) { int m = T . length ( ), n = S . length ( ); if ( m > n ) return 0; int mat [ m + 1 ] [ n + 1 ]; for ( int i = 1; i <= m; i ++ ) mat [ i ] [ 0 ] = 0; for ( int j = 0; j <= n; j ++ ) mat [ 0 ] [ j ] = 1; for ( int i = 1; i <= m; i ++ ) { for ( int j = 1; j <= n; j ++ ) { if ( T [ i - 1 ] != [MASK] [ j - 1 ] ) mat [ i ] [ j ] = mat [ i ] [ j - 1 ]; else mat [ i ] [ j ] = mat [ i ] [ j - 1 ] + mat [ i - 1 ] [ j - 1 ]; } } return mat [ m ] [ n ]; }) {
if ( T [ i - 1 ] != S [ j - 1 ] ) mat [ i ] [ j ] = mat [ i ] [ j - 1 ];
else mat [ i ] [ j ] = mat [ i ] [ j - 1 ] + mat [ i - 1 ] [ j - 1 ];
}
}
return mat [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"banana","49597223","1000010000011","BTlzufK","3474007","0010","dKHhoTD","9123259723","11001000111110","iY WJlIZ"};
vector<string> param1 {"ban","42","010","lf","370","00000","doT","123","0","iI"};
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;
} | S | [
"a) b)",
"b) !=",
"c) -",
"d) void",
"e) S"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
i < n;
i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true;
return false;
}
ce std;
bool f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
i < n;
i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,5,5,6,11,18,29,29,30,35,36,38,38,40,43,43,43,50,53,58,61,62,63,64,64,65,72,73,77,78,78,84,90,94,96},{-72,16,0,68,-58,58,46,38,-28,-56,-28,-14,-56,40,30,80,94,-52,0,-88,8,-96,-52,-96,48,-10,-32,-74,88,18,70},{0,0,0,0,0,1,1,1,1},{78,49,30,28,71,70,29,43,91,56,51,47,21,57,69,28,68,78,38,31,35,33,55,18,88,15,69,7,51,75,8,64,6,84,79,23,62,10,71,52,77},{-90,-86,-76,-72,-70,-62,-56,-50,-18,-12,-10,4,16,26,42,48,52,54,54,70,84,86,88,98},{1},{4,7,14,14,16,18,19,20,22,24,29,38,38,38,40,40,46,46,47,51,51,52,55,56,56,62,62,62,78,79,81,84,86,88,89,89,89},{72,80,-82,24,-98,90,-32,-56,-22,8,-12,8,-78,60,-62,50,12,-60,10,-54,74,98,26,56,24},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{93,40,48,99,95,59,43,58,79,70,28}};
vector<int> param1 {28,25,7,35,23,0,23,21,22,9};
vector<int> param2 {26,16,8,25,23,0,32,19,18,5};
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> [MASK] <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int arr [ ], int n, int x ) { for ( int i = 0; i < n - 1; i ++ ) for ( int j = i + 1; i < n; i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true; return false; }ce std;
bool f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
i < n;
i ++ ) if ( arr [ i ] * arr [ j ] == x ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,5,5,6,11,18,29,29,30,35,36,38,38,40,43,43,43,50,53,58,61,62,63,64,64,65,72,73,77,78,78,84,90,94,96},{-72,16,0,68,-58,58,46,38,-28,-56,-28,-14,-56,40,30,80,94,-52,0,-88,8,-96,-52,-96,48,-10,-32,-74,88,18,70},{0,0,0,0,0,1,1,1,1},{78,49,30,28,71,70,29,43,91,56,51,47,21,57,69,28,68,78,38,31,35,33,55,18,88,15,69,7,51,75,8,64,6,84,79,23,62,10,71,52,77},{-90,-86,-76,-72,-70,-62,-56,-50,-18,-12,-10,4,16,26,42,48,52,54,54,70,84,86,88,98},{1},{4,7,14,14,16,18,19,20,22,24,29,38,38,38,40,40,46,46,47,51,51,52,55,56,56,62,62,62,78,79,81,84,86,88,89,89,89},{72,80,-82,24,-98,90,-32,-56,-22,8,-12,8,-78,60,-62,50,12,-60,10,-54,74,98,26,56,24},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{93,40,48,99,95,59,43,58,79,70,28}};
vector<int> param1 {28,25,7,35,23,0,23,21,22,9};
vector<int> param2 {26,16,8,25,23,0,32,19,18,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) y)",
"b) )",
"c) =",
"d) #include",
"e) (const"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string str, int k ) {
string palin = str;
int l = 0;
int r = str . length ( ) - 1;
while ( l < r ) {
if ( str [ l ] != str [ r ] ) {
palin [ l ] = palin [ r ] = max ( str [ l ], str [ r ] );
k --;
}
l ++;
r --;
}
if ( k < 0 ) return "Not possible";
l = 0;
r = str . length ( ) - 1;
while ( l <= r ) {
if ( l == r ) {
if ( k > 0 ) palin [ l ] = '9';
}
if ( palin [ l ] < '9' ) {
if ( k >= 2 && palin [ l ] == str [ l ] && palin [ r ] == str [ r ] ) {
k -= 2;
palin [ l ] = palin [ r ] = '9';
}
else if ( k >= 1 && ( palin [ l ] != str [ l ] || palin [ r ] != str [ r ] ) ) {
k --;
palin [ l ] = palin [ r ] = '9';
}
}
l ++;
r --;
}
return palin;
}
else if ( k >= 1 && ( palin [ l ] != str [ l ] || palin [ r ] != str [ r ] ) ) {
k --;
palin [ l ] = palin [ r ] = '9';
}
}
l ++;
r --;
}
return palin;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"wUJmbRlwogtFv","43435","43435","12345","5032","0100000001101","sBrbNQiRwQd","7549384614","10000001","VqrTsaoD"};
vector<int> param1 {5,3,1,1,3,5,4,3,4,4};
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 str, int k ) { string palin = str; int l = 0; int r = str . length ( ) - 1; while ( l < r ) { if ( str [ l ] != str [ r ] ) { palin [ l ] = palin [ r ] = max ( str [ l ], str [ r ] ); k --; } l ++; r --; } if ( k < 0 ) return "Not possible"; l = 0; r = str . length ( ) - 1; while ( l <= r ) { if ( l == r ) { if ( k > 0 ) palin [ l ] = '9'; } if ( palin [ l ] < '9' ) { if ( k >= 2 && palin [MASK] l ] == str [ l ] && palin [ r ] == str [ r ] ) { k -= 2; palin [ l ] = palin [ r ] = '9'; } else if ( k >= 1 && ( palin [ l ] != str [ l ] || palin [ r ] != str [ r ] ) ) { k --; palin [ l ] = palin [ r ] = '9'; } } l ++; r --; } return palin; } else if ( k >= 1 && ( palin [ l ] != str [ l ] || palin [ r ] != str [ r ] ) ) {
k --;
palin [ l ] = palin [ r ] = '9';
}
}
l ++;
r --;
}
return palin;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"wUJmbRlwogtFv","43435","43435","12345","5032","0100000001101","sBrbNQiRwQd","7549384614","10000001","VqrTsaoD"};
vector<int> param1 {5,3,1,1,3,5,4,3,4,4};
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) return",
"c) i",
"d) n",
"e) *"
] | a |
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 {77,62,42,16,82,37,29,32,82,91};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> [MASK] <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 {77,62,42,16,82,37,29,32,82,91};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) )",
"b) #include",
"c) *",
"d) java.util.stream.*;",
"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 n, int k ) {
unordered_map < int, int > h;
for ( int i = 0;
i < n;
i ++ ) h [ arr [ i ] ] ++;
if ( h . size ( ) < k ) return - 1;
int dist_count = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( h [ arr [ i ] ] == 1 ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
e ( ) < k ) return - 1;
int dist_count = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( h [ arr [ i ] ] == 1 ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{17,25,27,27,73,91},{-86,-74,-88,28,-32,20,-34,32},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,11,36,27,6,24,58,44,14,68},{-98,-98,-94,-92,-86,-86,-70,-66,-64,-64,-58,-52,-46,-44,-44,-38,-38,-28,-24,-12,-10,-4,-2,2,8,10,12,20,22,26,26,36,42,52,54,60,60,68,82,82,92,98},{0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,1,1,1,0,0,0,1,0,0,1,0,1,1,1,1},{3,8,9,10,10,13,14,16,18,23,24,25,27,28,30,33,36,39,42,42,44,45,45,48,52,52,55,55,59,59,59,60,61,61,66,66,67,68,71,72,75,76,79,80,94,94},{-12,56,-48,52,-96,-84,32,-12,-6,82,70,18,66,-6,-22,-46,-54,18,-14,-32,68,82,-44,-42,10,56,8,-56,24,20,-38,30,-52,-66,82,-64,68,-82,52,-88,-34,-26,94,58,-4,-84,-60},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{1,23,75,84,28,34,15,13,51,69,94,45,38,38}};
vector<int> param1 {5,5,33,7,27,27,44,37,22,13};
vector<int> param2 {3,6,32,5,27,20,26,46,21,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 f_gold ( int arr [ ], int n, int k ) { [MASK] < int, int > h; for ( int i = 0; i < n; i ++ ) h [ arr [ i ] ] ++; if ( h . size ( ) < k ) return - 1; int dist_count = 0; for ( int i = 0; i < n; i ++ ) { if ( h [ arr [ i ] ] == 1 ) dist_count ++; if ( dist_count == k ) return arr [ i ]; } return - 1; }e ( ) < k ) return - 1;
int dist_count = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( h [ arr [ i ] ] == 1 ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{17,25,27,27,73,91},{-86,-74,-88,28,-32,20,-34,32},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,11,36,27,6,24,58,44,14,68},{-98,-98,-94,-92,-86,-86,-70,-66,-64,-64,-58,-52,-46,-44,-44,-38,-38,-28,-24,-12,-10,-4,-2,2,8,10,12,20,22,26,26,36,42,52,54,60,60,68,82,82,92,98},{0,1,0,0,1,1,1,0,0,0,1,1,1,0,0,1,1,1,0,0,0,1,0,0,1,0,1,1,1,1},{3,8,9,10,10,13,14,16,18,23,24,25,27,28,30,33,36,39,42,42,44,45,45,48,52,52,55,55,59,59,59,60,61,61,66,66,67,68,71,72,75,76,79,80,94,94},{-12,56,-48,52,-96,-84,32,-12,-6,82,70,18,66,-6,-22,-46,-54,18,-14,-32,68,82,-44,-42,10,56,8,-56,24,20,-38,30,-52,-66,82,-64,68,-82,52,-88,-34,-26,94,58,-4,-84,-60},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{1,23,75,84,28,34,15,13,51,69,94,45,38,38}};
vector<int> param1 {5,5,33,7,27,27,44,37,22,13};
vector<int> param2 {3,6,32,5,27,20,26,46,21,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;
} | unordered_map | [
"a) max(int",
"b) unordered_map",
"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 n ) {
int count = 0, ans = 1;
while ( n % 2 == 0 ) {
count ++;
n /= 2;
}
if ( count % 2 ) ans *= 2;
for ( int i = 3;
i <= sqrt ( n );
i += 2 ) {
count = 0;
while ( n % i == 0 ) {
count ++;
n /= i;
}
if ( count % 2 ) ans *= i;
}
if ( n > 2 ) ans *= n;
return ans;
}
int i = 3;
i <= sqrt ( n );
i += 2 ) {
count = 0;
while ( n % i == 0 ) {
count ++;
n /= i;
}
if ( count % 2 ) ans *= i;
}
if ( n > 2 ) ans *= n;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,48,3,10,82,1,77,99,23,61};
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 count = 0, ans = 1; while ( n % 2 == 0 ) { count ++; n /= 2; } if ( count % 2 ) ans *= 2; for ( int i = 3; i <= sqrt ( n ); i += 2 ) { count = 0; while ( n % i [MASK] 0 ) { count ++; n /= i; } if ( count % 2 ) ans *= i; } if ( n > 2 ) ans *= n; return ans; }int i = 3;
i <= sqrt ( n );
i += 2 ) {
count = 0;
while ( n % i == 0 ) {
count ++;
n /= i;
}
if ( count % 2 ) ans *= i;
}
if ( n > 2 ) ans *= n;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,48,3,10,82,1,77,99,23,61};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | == | [
"a) import",
"b) if",
"c) {",
"d) ==",
"e) sizeof(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 X [ ], int Y [ ], int m, int n ) {
int res = 0;
sort ( X, X + m, greater < int > ( ) );
sort ( Y, Y + n, greater < int > ( ) );
int hzntl = 1, vert = 1;
int i = 0, j = 0;
while ( i < m && j < n ) {
if ( X [ i ] > Y [ j ] ) {
res += X [ i ] * vert;
hzntl ++;
i ++;
}
else {
res += Y [ j ] * hzntl;
vert ++;
j ++;
}
}
int total = 0;
while ( i < m ) total += X [ i ++ ];
res += total * vert;
total = 0;
while ( j < n ) total += Y [ j ++ ];
res += total * hzntl;
return res;
}
++;
j ++;
}
}
int total = 0;
while ( i < m ) total += X [ i ++ ];
res += total * vert;
total = 0;
while ( j < n ) total += Y [ j ++ ];
res += total * hzntl;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,9,9,16,18,20,22,22,23,25,25,26,28,32,33,33,33,34,37,40,44,46,46,52,53,56,58,58,59,60,61,67,67,69,70,70,73,75,77,83,87,87,87,90,90,93,97,98},{-52,66,66,-4,-74,78,52,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{58,78,48,44,63,37,89,76,66,83,52,97,19,28,67,38,54,77,2,96,28,87},{-84,-78,-76,-72,-68,-62,-62,-60,-58,-44,-34,-10,-8,-4,-2,-2,14,16,20,26,26,32,70,78,86,90,96},{0,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,1,0,0,0,1,1,0},{30,75},{70,78,-60,-10,-8,46,38,60,-54,-68,16,10,36,-10,38,-96,-52,-82,-56,22,-56,0,96,-60,24,70,40,62,-20,-36,74,32,44,14,-18,50,58},{0,0,0,1},{81,40,29,74,13,67,10,25,24,81,90}};
vector<vector<int>> param1 {{2,3,9,10,13,16,17,19,20,23,25,27,29,30,30,35,37,39,39,45,47,50,55,55,55,56,59,60,62,63,67,70,70,71,72,73,73,74,77,86,87,88,91,92,95,96,97,99},{-40,30,-34,-76,84,88,-78,72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{37,36,26,5,83,75,33,33,72,63,91,94,75,92,9,19,79,29,40,47,63,36},{-98,-98,-86,-82,-76,-62,-60,-48,-32,-32,-24,-18,-10,-4,0,16,16,26,36,42,48,50,64,66,78,92,98},{1,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,0,0,1,0},{10,39},{64,-42,-50,-76,46,32,-66,86,-6,46,94,70,-62,90,78,4,6,-20,92,-18,-34,-96,92,-24,-90,-94,62,40,-14,-28,80,-86,-86,-56,40,-92,-22},{0,1,1,1},{51,45,23,7,53,14,49,58,25,75,74}};
vector<int> param2 {25,6,15,13,15,25,1,19,2,8};
vector<int> param3 {27,7,19,14,24,26,1,19,2,10};
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; int f_gold ( int X [ ], int Y [ ], int m, int n ) { int res = 0; sort ( X, X + m, greater < int > ( ) ); sort ( Y, Y + n, greater < int > ( ) ); int hzntl = 1, vert = 1; int i = 0, j = 0; while ( i < m && j < n ) { if ( X [ i ] > Y [ j ] ) { res += X [ i ] * vert; hzntl ++; i ++; } else { res += Y [ j ] * hzntl; vert ++; j ++; } } int total = 0; while ( i < m ) total += X [ i ++ ]; res += total * vert; total = 0; while ( j < n ) total += Y [ j ++ ]; res += total * hzntl; return [MASK] }++;
j ++;
}
}
int total = 0;
while ( i < m ) total += X [ i ++ ];
res += total * vert;
total = 0;
while ( j < n ) total += Y [ j ++ ];
res += total * hzntl;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,9,9,16,18,20,22,22,23,25,25,26,28,32,33,33,33,34,37,40,44,46,46,52,53,56,58,58,59,60,61,67,67,69,70,70,73,75,77,83,87,87,87,90,90,93,97,98},{-52,66,66,-4,-74,78,52,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{58,78,48,44,63,37,89,76,66,83,52,97,19,28,67,38,54,77,2,96,28,87},{-84,-78,-76,-72,-68,-62,-62,-60,-58,-44,-34,-10,-8,-4,-2,-2,14,16,20,26,26,32,70,78,86,90,96},{0,1,1,0,0,1,1,0,1,0,1,0,1,1,1,1,1,0,0,1,1,1,1,0,0,0,1,1,0},{30,75},{70,78,-60,-10,-8,46,38,60,-54,-68,16,10,36,-10,38,-96,-52,-82,-56,22,-56,0,96,-60,24,70,40,62,-20,-36,74,32,44,14,-18,50,58},{0,0,0,1},{81,40,29,74,13,67,10,25,24,81,90}};
vector<vector<int>> param1 {{2,3,9,10,13,16,17,19,20,23,25,27,29,30,30,35,37,39,39,45,47,50,55,55,55,56,59,60,62,63,67,70,70,71,72,73,73,74,77,86,87,88,91,92,95,96,97,99},{-40,30,-34,-76,84,88,-78,72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{37,36,26,5,83,75,33,33,72,63,91,94,75,92,9,19,79,29,40,47,63,36},{-98,-98,-86,-82,-76,-62,-60,-48,-32,-32,-24,-18,-10,-4,0,16,16,26,36,42,48,50,64,66,78,92,98},{1,0,1,1,1,0,1,1,1,0,1,0,1,1,0,0,0,1,1,1,1,0,1,1,1,0,0,1,0},{10,39},{64,-42,-50,-76,46,32,-66,86,-6,46,94,70,-62,90,78,4,6,-20,92,-18,-34,-96,92,-24,-90,-94,62,40,-14,-28,80,-86,-86,-56,40,-92,-22},{0,1,1,1},{51,45,23,7,53,14,49,58,25,75,74}};
vector<int> param2 {25,6,15,13,15,25,1,19,2,8};
vector<int> param3 {27,7,19,14,24,26,1,19,2,10};
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;
} | res; | [
"a) (x",
"b) [",
"c) }",
"d) res;",
"e) 3;"
] | 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 W, int n, int val [ ], int wt [ ] ) {
int dp [ W + 1 ];
memset ( dp, 0, sizeof dp );
int ans = 0;
for ( int i = 0;
i <= W;
i ++ ) for ( int j = 0;
j < n;
j ++ ) if ( wt [ j ] <= i ) dp [ i ] = max ( dp [ i ], dp [ i - wt [ j ] ] + val [ j ] );
return dp [ W ];
}
p );
int ans = 0;
for ( int i = 0;
i <= W;
i ++ ) for ( int j = 0;
j < n;
j ++ ) if ( wt [ j ] <= i ) dp [ i ] = max ( dp [ i ], dp [ i - wt [ j ] ] + val [ j ] );
return dp [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,1,30,25,10,20,2,23,13,18};
vector<int> param1 {19,1,24,22,12,32,3,25,13,28};
vector<vector<int>> param2 {{2,12,13,13,13,24,29,34,45,47,53,55,58,64,66,74,78,80,82,83,83,84,88,91,91},{54,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,72,57,18,31,44,81,13,75,91,16,96,55,8,65,47,98,7,88,89,28,78,91,41,34,78,38,71,79,61,37,99,16,87,13,93,20,84,30,53,26,54,23,33,54},{-80,-70,-40,-38,-38,-36,-34,24,26,38,44,62,64,92},{1,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,0,1,0,1,1,0,0,0,0,1,1,1,1},{30,50,64,71},{8,96,72,-88,42,-40,64,-24,68,46,-84,-58,66,-86,-12,78,-24,50,-34,88,-30,74,-82,-68,-54,72},{0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{4,76,50,27,10,35,96,98,59,77,52,52,80,61,12,49,51,15,30,27,29,2,45,27,57,90,47,56,45}};
vector<vector<int>> param3 {{5,5,5,28,30,33,36,37,43,50,60,61,67,70,74,79,80,81,84,85,86,86,92,92,99},{12,14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,70,43,47,9,27,30,30,16,91,34,12,98,36,66,91,79,53,16,52,87,99,83,71,79,8,9,55,66,76,77,28,85,82,56,57,11,41,19,48,76,49,83,21,21},{-98,-88,-78,-70,-58,-10,-2,8,20,38,40,56,66,86},{0,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,0,0,0},{6,10,23,97},{-42,48,66,-84,98,-14,84,80,-20,-76,-74,44,-44,18,86,58,68,80,-72,-52,-2,58,90,64,54,80},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{73,26,38,19,54,61,62,52,40,49,93,1,73,55,31,77,75,84,73,54,93,57,15,67,54,43,17,16,89}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],¶m2[i].front(),¶m3[i].front()) == f_gold(param0[i],param1[i],¶m2[i].front(),¶m3[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 W, int n, int val [ ], int wt [ ] ) { int dp [MASK] W + 1 ]; memset ( dp, 0, sizeof dp ); int ans = 0; for ( int i = 0; i <= W; i ++ ) for ( int j = 0; j < n; j ++ ) if ( wt [ j ] <= i ) dp [ i ] = max ( dp [ i ], dp [ i - wt [ j ] ] + val [ j ] ); return dp [ W ]; }p );
int ans = 0;
for ( int i = 0;
i <= W;
i ++ ) for ( int j = 0;
j < n;
j ++ ) if ( wt [ j ] <= i ) dp [ i ] = max ( dp [ i ], dp [ i - wt [ j ] ] + val [ j ] );
return dp [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,1,30,25,10,20,2,23,13,18};
vector<int> param1 {19,1,24,22,12,32,3,25,13,28};
vector<vector<int>> param2 {{2,12,13,13,13,24,29,34,45,47,53,55,58,64,66,74,78,80,82,83,83,84,88,91,91},{54,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,72,57,18,31,44,81,13,75,91,16,96,55,8,65,47,98,7,88,89,28,78,91,41,34,78,38,71,79,61,37,99,16,87,13,93,20,84,30,53,26,54,23,33,54},{-80,-70,-40,-38,-38,-36,-34,24,26,38,44,62,64,92},{1,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,1,0,1,0,1,1,0,0,0,0,1,1,1,1},{30,50,64,71},{8,96,72,-88,42,-40,64,-24,68,46,-84,-58,66,-86,-12,78,-24,50,-34,88,-30,74,-82,-68,-54,72},{0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{4,76,50,27,10,35,96,98,59,77,52,52,80,61,12,49,51,15,30,27,29,2,45,27,57,90,47,56,45}};
vector<vector<int>> param3 {{5,5,5,28,30,33,36,37,43,50,60,61,67,70,74,79,80,81,84,85,86,86,92,92,99},{12,14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,70,43,47,9,27,30,30,16,91,34,12,98,36,66,91,79,53,16,52,87,99,83,71,79,8,9,55,66,76,77,28,85,82,56,57,11,41,19,48,76,49,83,21,21},{-98,-88,-78,-70,-58,-10,-2,8,20,38,40,56,66,86},{0,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,1,0,1,1,0,1,1,1,1,0,1,1,0,0,0},{6,10,23,97},{-42,48,66,-84,98,-14,84,80,-20,-76,-74,44,-44,18,86,58,68,80,-72,-52,-2,58,90,64,54,80},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{73,26,38,19,54,61,62,52,40,49,93,1,73,55,31,77,75,84,73,54,93,57,15,67,54,43,17,16,89}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],¶m2[i].front(),¶m3[i].front()) == f_gold(param0[i],param1[i],¶m2[i].front(),¶m3[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) 0;",
"b) {",
"c) [",
"d) res;",
"e) while"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k, int a [ ] ) {
sort ( a, a + n, greater < int > ( ) );
int f_gold = 0;
for ( int i = 0;
i < n;
i += k ) f_gold += ( 2 * a [ i ] );
return f_gold;
}
space std;
int f_gold ( int n, int k, int a [ ] ) {
sort ( a, a + n, greater < int > ( ) );
int f_gold = 0;
for ( int i = 0;
i < n;
i += k ) f_gold += ( 2 * a [ i ] );
return f_gold;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,2,0,16,31,28,9,32,17,19};
vector<int> param1 {15,2,0,27,23,33,10,26,22,15};
vector<vector<int>> param2 {{1,4,8,18,24,34,38,38,39,39,41,53,56,57,63,72,73,77,79,99},{-8,70,-90,-74},{0},{3,66,11,21,82,75,19,39,1,55,7,26,10,87,11,94,91,76,21,91,83,18,44,29,47,84,6,10,83,74,26,50},{-96,-84,-80,-72,-60,-60,-58,-58,-52,-46,-36,-34,-32,-26,-22,-22,-20,-18,-14,-14,-6,-2,-2,0,2,4,18,22,24,38,42,46,50,58,72,78,82,84,90,96,96,96},{0,0,1,1,0,1,1,1,0,0,1,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,1,1,1,0,0,1,0,1},{8,13,17,19,24,33,43,54,63,74,79,83},{0,52,20,40,-2,74,12,10,-56,68,-52,36,8,34,82,-64,-78,-22,-24,74,-54,62,-70,-76,-80,8,-24,84,-84,-74,-90,6,22,58,62,24,-74,50,92},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{97,4,69,27,23,97,26,67,72,26,15,67,66,73,27,68,27,60,53,80,20,59,96,9,94,66,5,32}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],¶m2[i].front()) == f_gold(param0[i],param1[i],¶m2[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 k, int a [ ] ) [MASK] sort ( a, a + n, greater < int > ( ) ); int f_gold = 0; for ( int i = 0; i < n; i += k ) f_gold += ( 2 * a [ i ] ); return f_gold; }space std;
int f_gold ( int n, int k, int a [ ] ) {
sort ( a, a + n, greater < int > ( ) );
int f_gold = 0;
for ( int i = 0;
i < n;
i += k ) f_gold += ( 2 * a [ i ] );
return f_gold;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,2,0,16,31,28,9,32,17,19};
vector<int> param1 {15,2,0,27,23,33,10,26,22,15};
vector<vector<int>> param2 {{1,4,8,18,24,34,38,38,39,39,41,53,56,57,63,72,73,77,79,99},{-8,70,-90,-74},{0},{3,66,11,21,82,75,19,39,1,55,7,26,10,87,11,94,91,76,21,91,83,18,44,29,47,84,6,10,83,74,26,50},{-96,-84,-80,-72,-60,-60,-58,-58,-52,-46,-36,-34,-32,-26,-22,-22,-20,-18,-14,-14,-6,-2,-2,0,2,4,18,22,24,38,42,46,50,58,72,78,82,84,90,96,96,96},{0,0,1,1,0,1,1,1,0,0,1,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,1,1,0,1,0,0,1,0,1,1,1,1,0,0,1,0,1},{8,13,17,19,24,33,43,54,63,74,79,83},{0,52,20,40,-2,74,12,10,-56,68,-52,36,8,34,82,-64,-78,-22,-24,74,-54,62,-70,-76,-80,8,-24,84,-84,-74,-90,6,22,58,62,24,-74,50,92},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{97,4,69,27,23,97,26,67,72,26,15,67,66,73,27,68,27,60,53,80,20,59,96,9,94,66,5,32}};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],¶m2[i].front()) == f_gold(param0[i],param1[i],¶m2[i].front()))
{
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 ( int n, int p ) {
int ans = 0;
int temp = p;
while ( temp <= n ) {
ans += n / temp;
temp = temp * p;
}
return ans;
}
ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int p ) {
int ans = 0;
int temp = p;
while ( temp <= n ) {
ans += n / temp;
temp = temp * p;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {49,80,10,81,11,45,86,27,80,97};
vector<int> param1 {30,25,9,57,4,34,90,78,60,31};
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 p ) { int ans = 0; int temp = p; while ( temp <= n ) { ans += n / temp; temp [MASK] temp * p; } return ans; }ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int p ) {
int ans = 0;
int temp = p;
while ( temp <= n ) {
ans += n / temp;
temp = temp * p;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {49,80,10,81,11,45,86,27,80,97};
vector<int> param1 {30,25,9,57,4,34,90,78,60,31};
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) i",
"b) ;",
"c) int",
"d) =",
"e) math.ceil"
] | 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 ) {
float fibo = 2.078087 * log ( n ) + 1.672276;
return round ( fibo );
}
clude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
float fibo = 2.078087 * log ( n ) + 1.672276;
return round ( fibo );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,95,39,21,94,79,56,62,23,3};
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 ) { float fibo = 2.078087 * log ( n ) + 1.672276; return round ( fibo ); }clude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
float fibo = 2.078087 * log ( n ) + 1.672276;
return round ( fibo );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,95,39,21,94,79,56,62,23,3};
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) n1",
"b) <string>",
"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 n ) {
int sum = 0;
for ( int i = 1;
i <= n;
++ i ) sum += ( n / i ) * i;
return sum;
}
include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
for ( int i = 1;
i <= n;
++ i ) sum += ( n / i ) * i;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {73,41,36,28,49,24,85,59,82,40};
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 sum = [MASK] for ( int i = 1; i <= n; ++ i ) sum += ( n / i ) * i; return sum; }include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
for ( int i = 1;
i <= n;
++ i ) sum += ( n / i ) * i;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {73,41,36,28,49,24,85,59,82,40};
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;
} | 0; | [
"a) mid",
"b) n",
"c) 0;",
"d) x:",
"e) min"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int a [ ], int n ) {
unordered_map < int, int > count;
for ( int i = 0;
i < n;
i ++ ) count [ a [ i ] ] ++;
int next_missing = 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( count [ a [ i ] ] != 1 || a [ i ] > n || a [ i ] < 1 ) {
count [ a [ i ] ] --;
while ( count . find ( next_missing ) != count . end ( ) ) next_missing ++;
a [ i ] = next_missing;
count [ next_missing ] = 1;
}
}
}
] < 1 ) {
count [ a [ i ] ] --;
while ( count . find ( next_missing ) != count . end ( ) ) next_missing ++;
a [ i ] = next_missing;
count [ next_missing ] = 1;
}
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19},{-47,72},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{93,3,20,59,36,19,90,67,19,20,96,71,52,33,40,39},{-98,-93,-91,-89,-63,-58,-52,-52,-46,-40,-25,-16,-10,-1,-1,4,12,12,13,13,16,20,29,29,31,40,44,47,48,51,52,52,59,60,61,64,66,78,85,97},{0,1,1,1,1,1,1,0,1,0,0,1,0,1,0,1,0,1,1,1,1,1,0,0,0},{4,6,8,17,19,21,22,24,27,27,28,30,30,30,32,33,35,37,38,44,46,46,48,49,51,53,54,59,60,61,63,64,64,69,76,85,86,87,92,93,93,95,97,97,97,98,99,99},{-75,-46,-42,-33,4,74,-76,14,-68,75,-14,51,94,27,55,30,-83,4},{0,0,0,0,0,1,1,1,1},{24,13,60,7,57,36,45,20,65,8,16,14,76,87,15,92,98,66,32,87,63,86,51,25,58}};
vector<int> param1 {0,1,18,9,22,12,26,9,5,24};
vector<vector<int>> filled_function_param0 {{19},{-47,72},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{93,3,20,59,36,19,90,67,19,20,96,71,52,33,40,39},{-98,-93,-91,-89,-63,-58,-52,-52,-46,-40,-25,-16,-10,-1,-1,4,12,12,13,13,16,20,29,29,31,40,44,47,48,51,52,52,59,60,61,64,66,78,85,97},{0,1,1,1,1,1,1,0,1,0,0,1,0,1,0,1,0,1,1,1,1,1,0,0,0},{4,6,8,17,19,21,22,24,27,27,28,30,30,30,32,33,35,37,38,44,46,46,48,49,51,53,54,59,60,61,63,64,64,69,76,85,86,87,92,93,93,95,97,97,97,98,99,99},{-75,-46,-42,-33,4,74,-76,14,-68,75,-14,51,94,27,55,30,-83,4},{0,0,0,0,0,1,1,1,1},{24,13,60,7,57,36,45,20,65,8,16,14,76,87,15,92,98,66,32,87,63,86,51,25,58}};
vector<int> filled_function_param1 {0,1,18,9,22,12,26,9,5,24};
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 a [ ], int [MASK] ) { unordered_map < int, int > count; for ( int i = 0; i < n; i ++ ) count [ a [ i ] ] ++; int next_missing = 1; for ( int i = 0; i < n; i ++ ) { if ( count [ a [ i ] ] != 1 || a [ i ] > n || a [ i ] < 1 ) { count [ a [ i ] ] --; while ( count . find ( next_missing ) != count . end ( ) ) next_missing ++; a [ i ] = next_missing; count [ next_missing ] = 1; } } } ] < 1 ) {
count [ a [ i ] ] --;
while ( count . find ( next_missing ) != count . end ( ) ) next_missing ++;
a [ i ] = next_missing;
count [ next_missing ] = 1;
}
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{19},{-47,72},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{93,3,20,59,36,19,90,67,19,20,96,71,52,33,40,39},{-98,-93,-91,-89,-63,-58,-52,-52,-46,-40,-25,-16,-10,-1,-1,4,12,12,13,13,16,20,29,29,31,40,44,47,48,51,52,52,59,60,61,64,66,78,85,97},{0,1,1,1,1,1,1,0,1,0,0,1,0,1,0,1,0,1,1,1,1,1,0,0,0},{4,6,8,17,19,21,22,24,27,27,28,30,30,30,32,33,35,37,38,44,46,46,48,49,51,53,54,59,60,61,63,64,64,69,76,85,86,87,92,93,93,95,97,97,97,98,99,99},{-75,-46,-42,-33,4,74,-76,14,-68,75,-14,51,94,27,55,30,-83,4},{0,0,0,0,0,1,1,1,1},{24,13,60,7,57,36,45,20,65,8,16,14,76,87,15,92,98,66,32,87,63,86,51,25,58}};
vector<int> param1 {0,1,18,9,22,12,26,9,5,24};
vector<vector<int>> filled_function_param0 {{19},{-47,72},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{93,3,20,59,36,19,90,67,19,20,96,71,52,33,40,39},{-98,-93,-91,-89,-63,-58,-52,-52,-46,-40,-25,-16,-10,-1,-1,4,12,12,13,13,16,20,29,29,31,40,44,47,48,51,52,52,59,60,61,64,66,78,85,97},{0,1,1,1,1,1,1,0,1,0,0,1,0,1,0,1,0,1,1,1,1,1,0,0,0},{4,6,8,17,19,21,22,24,27,27,28,30,30,30,32,33,35,37,38,44,46,46,48,49,51,53,54,59,60,61,63,64,64,69,76,85,86,87,92,93,93,95,97,97,97,98,99,99},{-75,-46,-42,-33,4,74,-76,14,-68,75,-14,51,94,27,55,30,-83,4},{0,0,0,0,0,1,1,1,1},{24,13,60,7,57,36,45,20,65,8,16,14,76,87,15,92,98,66,32,87,63,86,51,25,58}};
vector<int> filled_function_param1 {0,1,18,9,22,12,26,9,5,24};
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;
} | n | [
"a) =",
"b) -",
"c) n",
"d) 2",
"e) int"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int N, int k ) {
int MS [ N ];
MS [ N - 1 ] = arr [ N - 1 ];
for ( int i = N - 2;
i >= 0;
i -- ) {
if ( i + k + 1 >= N ) MS [ i ] = max ( arr [ i ], MS [ i + 1 ] );
else MS [ i ] = max ( arr [ i ] + MS [ i + k + 1 ], MS [ i + 1 ] );
}
return MS [ 0 ];
}
= N - 2;
i >= 0;
i -- ) {
if ( i + k + 1 >= N ) MS [ i ] = max ( arr [ i ], MS [ i + 1 ] );
else MS [ i ] = max ( arr [ i ] + MS [ i + k + 1 ], MS [ i + 1 ] );
}
return MS [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,20,21,23,26,27,31,33,38,39,41,48,48,50,51,56,57,64,68,69,70,71,74,76,86,97},{32,34,-40,90,-82,-70,30,26,-76,-46,-84,76,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{96,15,30,25,83},{-90,-82,-80,-76,-62,-58,-50,-48,-46,-38,-38,-38,-38,-38,-34,-32,-24,-22,-16,-16,-4,-2,10,10,20,26,26,32,38,38,44,44,46,48,58,62,64,66,76,78,78,82,92,96,96,98},{1,1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,1,0,0},{1,2,9,17,24,31,31,33,56,57,61,71,73,74,76,77,79,83,86,95,99},{-12,52,-44,80,-66,34,42,-46,8,12,-22,-56,74,-98,-44,2,-24,-14,-54,-56,-26,-18,-72},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{65,1,34,38,15,6,55,21,32,90,39,25,43,48,64,66,88,70,82,75,25,56,23,27,41,33,33,55,60,90,41,58,42,53,38,90,7,15}};
vector<int> param1 {23,9,22,2,27,9,12,13,13,37};
vector<int> param2 {15,10,34,3,30,9,10,19,13,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int N, int k ) { int MS [ N ]; MS [ N - 1 ] = arr [ N - 1 ]; for ( int i = N - 2; i >= 0; i -- ) { if ( i + k + 1 >= N ) MS [ i ] = max ( arr [ i ], MS [ i + 1 ] ); else MS [ i ] = [MASK] ( arr [ i ] + MS [ i + k + 1 ], MS [ i + 1 ] ); } return MS [ 0 ]; }= N - 2;
i >= 0;
i -- ) {
if ( i + k + 1 >= N ) MS [ i ] = max ( arr [ i ], MS [ i + 1 ] );
else MS [ i ] = max ( arr [ i ] + MS [ i + k + 1 ], MS [ i + 1 ] );
}
return MS [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,20,21,23,26,27,31,33,38,39,41,48,48,50,51,56,57,64,68,69,70,71,74,76,86,97},{32,34,-40,90,-82,-70,30,26,-76,-46,-84,76,-76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{96,15,30,25,83},{-90,-82,-80,-76,-62,-58,-50,-48,-46,-38,-38,-38,-38,-38,-34,-32,-24,-22,-16,-16,-4,-2,10,10,20,26,26,32,38,38,44,44,46,48,58,62,64,66,76,78,78,82,92,96,96,98},{1,1,1,1,1,0,0,0,0,1,1,1,0,1,0,0,1,0,0},{1,2,9,17,24,31,31,33,56,57,61,71,73,74,76,77,79,83,86,95,99},{-12,52,-44,80,-66,34,42,-46,8,12,-22,-56,74,-98,-44,2,-24,-14,-54,-56,-26,-18,-72},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{65,1,34,38,15,6,55,21,32,90,39,25,43,48,64,66,88,70,82,75,25,56,23,27,41,33,33,55,60,90,41,58,42,53,38,90,7,15}};
vector<int> param1 {23,9,22,2,27,9,12,13,13,37};
vector<int> param2 {15,10,34,3,30,9,10,19,13,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | max | [
"a) [",
"b) )",
"c) #include",
"d) :",
"e) max"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < n;
i ++ ) hash [ arr [ i ] ] ++;
int max_count = 0;
for ( auto i : hash ) if ( max_count < i . second ) max_count = i . second;
return ( n - max_count );
}
> hash;
for ( int i = 0;
i < n;
i ++ ) hash [ arr [ i ] ] ++;
int max_count = 0;
for ( auto i : hash ) if ( max_count < i . second ) max_count = i . second;
return ( n - max_count );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98},{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94},{0,1,1},{68,78,2,48,1,10,18,67,97,31,72,12,25,39,51,12,29,46,93,66,28,29,5,86,97,59,7,94,64,13,42,48,25,33,10,1,5,32,14,27},{-98,-96,-78,-72,-64,-62,-56,-40,-36,-14,-8,4,18,22,28,32,52,56,58,60,78,88,94},{0,0,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0},{3,3,7,9,14,15,15,25,25,26,28,31,37,37,47,51,53,58,58,60,63,65,68,70,70,71,77,79,81,88,89,97},{40,-64,-62,74,-10,48,-56,70,-60,54,-6,74,-8,-54,-20,-50,40,-22,-54,-76,-92,-76,36,16,-42,58,-74,-90,-54,-32,-38,-50,74,26,52,38,24,-32,78,68,82,36,64,56,86,-28,-44,48,88},{0,0,1,1,1,1,1},{87,77,76,1,59,15,98,45,62,10,87,59,13,50,58,10}};
vector<int> param1 {33,11,1,36,18,21,23,36,4,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 > hash; for ( int i = 0; i < n; i ++ ) hash [ arr [ i ] ] ++; int max_count = 0; for ( auto i : hash ) if ( max_count < i . second ) max_count = i . second; return ( n [MASK] max_count ); }> hash;
for ( int i = 0;
i < n;
i ++ ) hash [ arr [ i ] ] ++;
int max_count = 0;
for ( auto i : hash ) if ( max_count < i . second ) max_count = i . second;
return ( n - max_count );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,6,8,17,25,29,33,33,33,38,42,43,49,55,60,62,63,68,69,70,75,77,79,79,85,87,87,90,90,90,90,94,98},{-66,-44,72,-82,46,66,-78,-62,32,86,62,56,22,-58,46,-6,94},{0,1,1},{68,78,2,48,1,10,18,67,97,31,72,12,25,39,51,12,29,46,93,66,28,29,5,86,97,59,7,94,64,13,42,48,25,33,10,1,5,32,14,27},{-98,-96,-78,-72,-64,-62,-56,-40,-36,-14,-8,4,18,22,28,32,52,56,58,60,78,88,94},{0,0,1,1,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0},{3,3,7,9,14,15,15,25,25,26,28,31,37,37,47,51,53,58,58,60,63,65,68,70,70,71,77,79,81,88,89,97},{40,-64,-62,74,-10,48,-56,70,-60,54,-6,74,-8,-54,-20,-50,40,-22,-54,-76,-92,-76,36,16,-42,58,-74,-90,-54,-32,-38,-50,74,26,52,38,24,-32,78,68,82,36,64,56,86,-28,-44,48,88},{0,0,1,1,1,1,1},{87,77,76,1,59,15,98,45,62,10,87,59,13,50,58,10}};
vector<int> param1 {33,11,1,36,18,21,23,36,4,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) y;",
"d) -",
"e) str"
] | 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 == 1 ) return 4;
int countB = 1, countS = 1, prev_countB, prev_countS;
for ( int i = 2;
i <= N;
i ++ ) {
prev_countB = countB;
prev_countS = countS;
countS = prev_countB + prev_countS;
countB = prev_countS;
}
int result = countS + countB;
return ( result * result );
}
i ++ ) {
prev_countB = countB;
prev_countS = countS;
countS = prev_countB + prev_countS;
countB = prev_countS;
}
int result = countS + countB;
return ( result * result );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,66,53,97,34,54,9,99,59,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> [MASK] <bits/stdc++.h> using namespace std; int f_gold ( int N ) { if ( N == 1 ) return 4; int countB = 1, countS = 1, prev_countB, prev_countS; for ( int i = 2; i <= N; i ++ ) { prev_countB = countB; prev_countS = countS; countS = prev_countB + prev_countS; countB = prev_countS; } int result = countS + countB; return ( result * result ); } i ++ ) {
prev_countB = countB;
prev_countS = countS;
countS = prev_countB + prev_countS;
countB = prev_countS;
}
int result = countS + countB;
return ( result * result );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,66,53,97,34,54,9,99,59,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 | [
"a) :",
"b) #include",
"c) *;",
"d) k",
"e) eq_root"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, int c ) {
int x = a - b;
int y = b - c;
int z = a - c;
if ( x * y > 0 ) return b;
else if ( x * z > 0 ) return c;
else return a;
}
++.h>
using namespace std;
int f_gold ( int a, int b, int c ) {
int x = a - b;
int y = b - c;
int z = a - c;
if ( x * y > 0 ) return b;
else if ( x * z > 0 ) return c;
else return a;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {48,21,71,93,3,58,88,8,17,13};
vector<int> param1 {46,7,4,34,61,78,41,84,66,3};
vector<int> param2 {38,16,31,11,32,6,66,38,27,23};
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 c ) { int x = a - b; int y = b - c; int z = a - c; if ( x * y > 0 ) return b; [MASK] if ( x * z > 0 ) return c; else return a; }++.h>
using namespace std;
int f_gold ( int a, int b, int c ) {
int x = a - b;
int y = b - c;
int z = a - c;
if ( x * y > 0 ) return b;
else if ( x * z > 0 ) return c;
else return a;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {48,21,71,93,3,58,88,8,17,13};
vector<int> param1 {46,7,4,34,61,78,41,84,66,3};
vector<int> param2 {38,16,31,11,32,6,66,38,27,23};
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;
} | else | [
"a) n;",
"b) else",
"c) =",
"d) return",
"e) java.lang.*;"
] | 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 ) {
if ( n < 3 ) return - 1;
int max_product = INT_MIN;
for ( int i = 0;
i < n - 2;
i ++ ) for ( int j = i + 1;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) max_product = max ( max_product, arr [ i ] * arr [ j ] * arr [ k ] );
return max_product;
}
i < n - 2;
i ++ ) for ( int j = i + 1;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) max_product = max ( max_product, arr [ i ] * arr [ j ] * arr [ k ] );
return max_product;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{41,66,77},{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56},{0,0,1},{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50},{-62,-28,40,76},{0,1,1,0,1,1,1,1,1},{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97},{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76},{0,0,0,0,0,1,1,1},{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41}};
vector<int> param1 {2,40,1,26,3,5,25,14,7,14};
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 ) { if ( n < 3 ) return - 1; int max_product = INT_MIN; for ( int i = 0; i < n - 2; i ++ ) for ( int j = i + 1; j < n - 1; j ++ ) for ( int k = j + 1; k < n; k ++ ) max_product = max ( max_product, arr [ i ] * arr [ j ] * arr [ k ] ); return max_product; } i < n - 2;
i ++ ) for ( int j = i + 1;
j < n - 1;
j ++ ) for ( int k = j + 1;
k < n;
k ++ ) max_product = max ( max_product, arr [ i ] * arr [ j ] * arr [ k ] );
return max_product;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{41,66,77},{92,-34,-36,-50,20,-94,2,-86,22,-50,74,84,52,-84,98,-50,88,26,-36,-36,6,-50,-48,-84,38,-96,-62,34,52,92,40,-84,18,-90,54,-38,-74,-98,-8,-92,-60,86,-36,94,56},{0,0,1},{2,77,99,95,78,15,69,39,34,43,66,45,97,27,67,62,64,2,28,94,41,87,97,52,14,61,78,50},{-62,-28,40,76},{0,1,1,0,1,1,1,1,1},{2,6,10,11,12,12,17,18,18,19,20,22,24,25,30,35,36,37,40,41,42,47,60,60,64,69,69,70,73,79,80,83,97,97,97},{-72,98,68,18,92,-84,50,32,-90,-40,50,60,-50,-50,50,24,30,94,-98,-6,46,-46,-24,-62,-20,62,-76},{0,0,0,0,0,1,1,1},{85,36,7,69,9,45,18,47,1,78,72,53,37,20,95,71,58,41}};
vector<int> param1 {2,40,1,26,3,5,25,14,7,14};
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) out",
"b) arr",
"c) a",
"d) i",
"e) 2"
] | 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 a1 [ ], int a2 [ ], int a3 [ ], int n1, int n2, int n3, int sum ) {
for ( int i = 0;
i < n1;
i ++ ) for ( int j = 0;
j < n2;
j ++ ) for ( int k = 0;
k < n3;
k ++ ) if ( a1 [ i ] + a2 [ j ] + a3 [ k ] == sum ) return true;
return false;
}
nt sum ) {
for ( int i = 0;
i < n1;
i ++ ) for ( int j = 0;
j < n2;
j ++ ) for ( int k = 0;
k < n3;
k ++ ) if ( a1 [ i ] + a2 [ j ] + a3 [ k ] == sum ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,9,10,19,24,25,26,30,36,43,44,49,52,62,66,69,72,77,80,80,82,84,90,93,94,98},{-24,-80,-72,80,-96,-94,64,18,12,16,74,16,54,66,-96,-90,54,72,-32,-2,90,-18,-98,12,-42,-30,-82,-56,-86,40},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{28,15,21,28,85,68,24},{-86,-82,-66,-44,-44,-38,-22,-6,-2,14,26,40,54,58,60,66,72,80,94,96,98},{1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0,0,1,0,1},{44,53,85,85,86,88,93},{70,-38,62,-34,74,-32,-58,-34,-54},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{41,64,39,96,54,54,57,4,82,43,44,56,1}};
vector<vector<int>> param1 {{4,8,17,20,22,25,27,30,31,33,35,35,38,41,49,51,60,61,66,67,69,82,84,85,86,88},{30,-60,-24,18,40,44,-40,62,66,-38,50,-74,-42,-86,-82,-8,50,-72,-2,-48,-38,-20,-8,56,-32,68,94,80,-48,0},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{57,46,47,49,16,81,60},{-96,-86,-74,-56,-52,-42,-32,-22,-16,-10,-4,-4,10,42,48,52,58,62,84,90,96},{0,1,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1},{4,5,8,15,29,40,91},{48,-86,-18,14,88,92,-56,-8,-74},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{44,58,40,87,22,82,8,81,88,42,15,14,81}};
vector<vector<int>> param2 {{12,14,17,20,22,27,29,31,32,38,41,43,56,59,59,64,66,67,68,69,71,76,83,83,85,99},{-24,80,50,-56,-92,20,86,-42,-30,96,40,-32,-64,54,-38,-72,-70,54,-28,98,60,98,-12,-30,-30,68,-66,68,-58,52},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{76,49,6,44,71,24,57},{-92,-92,-90,-82,-62,-44,-42,-40,-38,-36,-22,-20,-8,12,22,26,30,44,54,64,86},{1,0,1,0,0,0,1,1,1,0,1,1,1,0,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,1,1,1,0,0},{30,53,71,75,76,82,84},{8,8,32,76,76,94,22,-60,-42},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{64,20,24,42,37,46,6,47,12,93,8,5,11}};
vector<int> param3 {25,26,14,6,13,25,5,6,15,7};
vector<int> param4 {18,22,14,5,20,25,3,6,14,8};
vector<int> param5 {16,20,14,5,17,23,4,6,10,6};
vector<int> param6 {222,21,2,73,6,0,3,7,13,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int a1 [ ], int a2 [ ], int a3 [ ], int n1, int n2, int n3, int sum ) { for ( int i = 0; i < n1; i ++ ) for ( int j = 0; j < n2; j ++ ) for ( int k = 0; k < n3; k ++ ) if ( a1 [ i ] + a2 [ j [MASK] + a3 [ k ] == sum ) return true; return false; }nt sum ) {
for ( int i = 0;
i < n1;
i ++ ) for ( int j = 0;
j < n2;
j ++ ) for ( int k = 0;
k < n3;
k ++ ) if ( a1 [ i ] + a2 [ j ] + a3 [ k ] == sum ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,9,10,19,24,25,26,30,36,43,44,49,52,62,66,69,72,77,80,80,82,84,90,93,94,98},{-24,-80,-72,80,-96,-94,64,18,12,16,74,16,54,66,-96,-90,54,72,-32,-2,90,-18,-98,12,-42,-30,-82,-56,-86,40},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{28,15,21,28,85,68,24},{-86,-82,-66,-44,-44,-38,-22,-6,-2,14,26,40,54,58,60,66,72,80,94,96,98},{1,1,1,0,1,1,1,0,0,1,1,1,1,0,1,1,0,0,0,1,1,0,0,0,1,0,1,1,1,0,0,1,0,1},{44,53,85,85,86,88,93},{70,-38,62,-34,74,-32,-58,-34,-54},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{41,64,39,96,54,54,57,4,82,43,44,56,1}};
vector<vector<int>> param1 {{4,8,17,20,22,25,27,30,31,33,35,35,38,41,49,51,60,61,66,67,69,82,84,85,86,88},{30,-60,-24,18,40,44,-40,62,66,-38,50,-74,-42,-86,-82,-8,50,-72,-2,-48,-38,-20,-8,56,-32,68,94,80,-48,0},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{57,46,47,49,16,81,60},{-96,-86,-74,-56,-52,-42,-32,-22,-16,-10,-4,-4,10,42,48,52,58,62,84,90,96},{0,1,1,1,1,0,1,0,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1},{4,5,8,15,29,40,91},{48,-86,-18,14,88,92,-56,-8,-74},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{44,58,40,87,22,82,8,81,88,42,15,14,81}};
vector<vector<int>> param2 {{12,14,17,20,22,27,29,31,32,38,41,43,56,59,59,64,66,67,68,69,71,76,83,83,85,99},{-24,80,50,-56,-92,20,86,-42,-30,96,40,-32,-64,54,-38,-72,-70,54,-28,98,60,98,-12,-30,-30,68,-66,68,-58,52},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{76,49,6,44,71,24,57},{-92,-92,-90,-82,-62,-44,-42,-40,-38,-36,-22,-20,-8,12,22,26,30,44,54,64,86},{1,0,1,0,0,0,1,1,1,0,1,1,1,0,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,1,1,1,0,0},{30,53,71,75,76,82,84},{8,8,32,76,76,94,22,-60,-42},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{64,20,24,42,37,46,6,47,12,93,8,5,11}};
vector<int> param3 {25,26,14,6,13,25,5,6,15,7};
vector<int> param4 {18,22,14,5,20,25,3,6,14,8};
vector<int> param5 {16,20,14,5,17,23,4,6,10,6};
vector<int> param6 {222,21,2,73,6,0,3,7,13,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i],param6[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) =",
"b) )",
"c) ]",
"d) 2",
"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 price [ ], int n ) {
int val [ n + 1 ];
val [ 0 ] = 0;
int i, j;
for ( i = 1;
i <= n;
i ++ ) {
int max_val = INT_MIN;
for ( j = 0;
j < i;
j ++ ) max_val = max ( max_val, price [ j ] + val [ i - j - 1 ] );
val [ i ] = max_val;
}
return val [ n ];
}
i <= n;
i ++ ) {
int max_val = INT_MIN;
for ( j = 0;
j < i;
j ++ ) max_val = max ( max_val, price [ j ] + val [ i - j - 1 ] );
val [ i ] = max_val;
}
return val [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,7,15,16,18,22,22,30,34,35,37,41,42,42,43,47,49,52,53,55,58,60,62,62,62,65,65,67,69,73,73,73,75,78,83,84,86,90,91,91,93,94,96},{50,-30,-84,-2,-96,-54,-14,56,-48,70,38,-86,16,-48,66,34,36,40,40,36,-16,-92,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{79,33,54,12,53,9,29,45,85,20,6,52,8,26,43,42,17,54,8,70,5,71,1,81,42,59,42,63,8,86,29,16,72},{-78,-64,-38,-22,2,8,28,32,58,72,72,90},{1,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0},{1,3,6,7,10,17,18,22,23,24,28,31,37,43,48,54,56,65,70,71,73,74,79,84,87,95,96},{-30,20,-72,-86,-8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{96,99,20,87,17,13,45,65,33,13,59,77,35,79,20,51,69,71,55,37,23,35,82,70}};
vector<int> param1 {37,19,29,22,11,20,21,3,21,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int price [ ], int n ) { int val [ n + 1 ]; val [ 0 [MASK] = 0; int i, j; for ( i = 1; i <= n; i ++ ) { int max_val = INT_MIN; for ( j = 0; j < i; j ++ ) max_val = max ( max_val, price [ j ] + val [ i - j - 1 ] ); val [ i ] = max_val; } return val [ n ]; } i <= n;
i ++ ) {
int max_val = INT_MIN;
for ( j = 0;
j < i;
j ++ ) max_val = max ( max_val, price [ j ] + val [ i - j - 1 ] );
val [ i ] = max_val;
}
return val [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,7,15,16,18,22,22,30,34,35,37,41,42,42,43,47,49,52,53,55,58,60,62,62,62,65,65,67,69,73,73,73,75,78,83,84,86,90,91,91,93,94,96},{50,-30,-84,-2,-96,-54,-14,56,-48,70,38,-86,16,-48,66,34,36,40,40,36,-16,-92,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{79,33,54,12,53,9,29,45,85,20,6,52,8,26,43,42,17,54,8,70,5,71,1,81,42,59,42,63,8,86,29,16,72},{-78,-64,-38,-22,2,8,28,32,58,72,72,90},{1,0,1,1,1,0,0,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0},{1,3,6,7,10,17,18,22,23,24,28,31,37,43,48,54,56,65,70,71,73,74,79,84,87,95,96},{-30,20,-72,-86,-8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{96,99,20,87,17,13,45,65,33,13,59,77,35,79,20,51,69,71,55,37,23,35,82,70}};
vector<int> param1 {37,19,29,22,11,20,21,3,21,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) )",
"b) }",
"c) arr",
"d) ]",
"e) int"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int high = 0;
for ( int i = 0;
i < n;
i ++ ) high = max ( high, arr [ i ] );
int divisors [ high + 1 ] = {
0 };
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = 1;
j <= sqrt ( arr [ i ] );
j ++ ) {
if ( arr [ i ] % j == 0 ) {
divisors [ j ] ++;
if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++;
}
}
}
for ( int i = high;
i >= 1;
i -- ) if ( divisors [ i ] > 1 ) return i;
}
visors [ j ] ++;
if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++;
}
}
}
for ( int i = high;
i >= 1;
i -- ) if ( divisors [ i ] > 1 ) return i;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96},{12,52,-66,50,50,-78,-14,26,56,74,8,-58,58,-66,-58,-12,80},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{23,98,12,45,83,85,30,92,26,12,38,20,86,52,71,20,56,78,10,34,86,55,99,84,26,2,1,89,60,26,16,37,98,11,73,42,36,60,28},{-98,-84,-80,-72,-66,-64,-52,-36,-28,-18,-12,-12,-4,8,12,40,42,56,68,70,90,94},{1,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,1,0,1},{3,5,6,7,8,9,11,13,18,20,24,25,26,27,36,41,41,45,48,48,49,65,69,70,85,90,99,99},{80,-26,-38,-40,22,-28,0,-36,70,-32,38,58,76,-42,38,92,68,-70,36,-62,24,-84,42,4,0,8,-36,98,-84,82,-70,-12,6,-82,-20,-68,48,-12,42,18,58,-14,94,84},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{36,60,45,76,43,71,10,18,52,52,53,73,48,95,13,50,97,30,73,13,18,34,51}};
vector<int> param1 {45,11,26,28,17,14,20,39,26,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 [MASK] #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int high = 0; for ( int i = 0; i < n; i ++ ) high = max ( high, arr [ i ] ); int divisors [ high + 1 ] = { 0 }; for ( int i = 0; i < n; i ++ ) { for ( int j = 1; j <= sqrt ( arr [ i ] ); j ++ ) { if ( arr [ i ] % j == 0 ) { divisors [ j ] ++; if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++; } } } for ( int i = high; i >= 1; i -- ) if ( divisors [ i ] > 1 ) return i; }visors [ j ] ++;
if ( j != arr [ i ] / j ) divisors [ arr [ i ] / j ] ++;
}
}
}
for ( int i = high;
i >= 1;
i -- ) if ( divisors [ i ] > 1 ) return i;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,8,10,12,13,14,16,16,19,20,21,25,29,33,35,35,35,35,36,38,41,42,45,45,45,46,48,51,52,53,55,56,57,58,62,69,73,73,76,76,80,89,91,92,93,93,96},{12,52,-66,50,50,-78,-14,26,56,74,8,-58,58,-66,-58,-12,80},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{23,98,12,45,83,85,30,92,26,12,38,20,86,52,71,20,56,78,10,34,86,55,99,84,26,2,1,89,60,26,16,37,98,11,73,42,36,60,28},{-98,-84,-80,-72,-66,-64,-52,-36,-28,-18,-12,-12,-4,8,12,40,42,56,68,70,90,94},{1,0,0,1,1,1,0,0,0,1,0,0,1,1,0,1,0,1,1,0,0,1,0,0,1,0,1},{3,5,6,7,8,9,11,13,18,20,24,25,26,27,36,41,41,45,48,48,49,65,69,70,85,90,99,99},{80,-26,-38,-40,22,-28,0,-36,70,-32,38,58,76,-42,38,92,68,-70,36,-62,24,-84,42,4,0,8,-36,98,-84,82,-70,-12,6,-82,-20,-68,48,-12,42,18,58,-14,94,84},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{36,60,45,76,43,71,10,18,52,52,53,73,48,95,13,50,97,30,73,13,18,34,51}};
vector<int> param1 {45,11,26,28,17,14,20,39,26,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;
} | <vector> | [
"a) *;",
"b) +",
"c) #include",
"d) <vector>",
"e) 1;"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int table [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) table [ i ] = n - i;
for ( int i = n;
i >= 1;
i -- ) {
if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] );
if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table [ i / 3 ] );
}
return table [ 1 ];
}
{
if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] );
if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table [ i / 3 ] );
}
return table [ 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,7,90,78,49,15,45,56,7,70};
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 ) { int table [ n + 1 ]; for ( int i = 0; i <= n; i ++ ) table [ i ] = n - i; for ( int i = n; i >= 1; i -- ) { if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] ); if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table [ i / 3 ] ); } return table [ 1 ]; } {
if ( ! ( i % 2 ) ) table [ i / 2 ] = min ( table [ i ] + 1, table [ i / 2 ] );
if ( ! ( i % 3 ) ) table [ i / 3 ] = min ( table [ i ] + 1, table [ i / 3 ] );
}
return table [ 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,7,90,78,49,15,45,56,7,70};
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) arr",
"b) <iomanip>",
"c) +=",
"d) #include",
"e) j"
] | 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 ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 );
}
de <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,42,76,16,49,60,99,45,6,70};
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 ) { return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 ); }de <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return ( n == 1 || n == 0 ) ? 1 : n * f_gold ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,42,76,16,49,60,99,45,6,70};
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) 0",
"b) int",
"c) result",
"d) )",
"e) for"
] | 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 templeHeight [ ] ) {
int sum = 0;
for ( int i = 0;
i < n;
++ i ) {
int left = 0, right = 0;
for ( int j = i - 1;
j >= 0;
-- j ) {
if ( templeHeight [ j ] < templeHeight [ j + 1 ] ) ++ left;
else break;
}
for ( int j = i + 1;
j < n;
++ j ) {
if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right;
else break;
}
sum += max ( right, left ) + 1;
}
return sum;
}
for ( int j = i + 1;
j < n;
++ j ) {
if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right;
else break;
}
sum += max ( right, left ) + 1;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,46,16,9,0,38,28,9,18,29};
vector<vector<int>> param1 {{3,11,12,15,16,21,24,29,32,39,42,44,51,68,79,81,81,85,92,94},{76,48,88,70,-64,66,-6,-58,26,-28,-42,-94,80,-4,-56,-46,4,90,-12,-78,64,18,-38,26,56,-24,66,-18,-12,0,-94,12,-10,4,-68,-20,88,2,-58,16,46,-80,-42,44,-86,96,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{2,95,20,50,2,58,20,14,65,69,78,7},{-88},{0,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,0},{2,3,6,8,9,10,14,17,17,22,25,27,29,29,30,32,33,35,38,42,50,51,51,57,59,59,59,60,62,62,63,67,70,75,76,77,81,81,83,84},{-52,62,74,-62,-58,62,38,42,-50,20},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{96,15,9,9,40,34,17,4,51,49,34,66,97,28,64,65,92,56,74,48,43,17,82,8,21,39,83,35,42,37,64,34,42,59,45,61,55,93,94,29,20,96,77,66}};
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> [MASK] namespace std; int f_gold ( int n, int templeHeight [ ] ) { int sum = 0; for ( int i = 0; i < n; ++ i ) { int left = 0, right = 0; for ( int j = i - 1; j >= 0; -- j ) { if ( templeHeight [ j ] < templeHeight [ j + 1 ] ) ++ left; else break; } for ( int j = i + 1; j < n; ++ j ) { if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right; else break; } sum += max ( right, left ) + 1; } return sum; }
for ( int j = i + 1;
j < n;
++ j ) {
if ( templeHeight [ j ] < templeHeight [ j - 1 ] ) ++ right;
else break;
}
sum += max ( right, left ) + 1;
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {12,46,16,9,0,38,28,9,18,29};
vector<vector<int>> param1 {{3,11,12,15,16,21,24,29,32,39,42,44,51,68,79,81,81,85,92,94},{76,48,88,70,-64,66,-6,-58,26,-28,-42,-94,80,-4,-56,-46,4,90,-12,-78,64,18,-38,26,56,-24,66,-18,-12,0,-94,12,-10,4,-68,-20,88,2,-58,16,46,-80,-42,44,-86,96,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{2,95,20,50,2,58,20,14,65,69,78,7},{-88},{0,0,0,0,1,0,1,0,0,1,1,0,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,0,1,1,0,0,0,1,1,1,0,0},{2,3,6,8,9,10,14,17,17,22,25,27,29,29,30,32,33,35,38,42,50,51,51,57,59,59,59,60,62,62,63,67,70,75,76,77,81,81,83,84},{-52,62,74,-62,-58,62,38,42,-50,20},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{96,15,9,9,40,34,17,4,51,49,34,66,97,28,64,65,92,56,74,48,43,17,82,8,21,39,83,35,42,37,64,34,42,59,45,61,55,93,94,29,20,96,77,66}};
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;
} | using | [
"a) (x",
"b) )",
"c) =",
"d) using",
"e) f_gold"
] | 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 == 1 ) return true;
sort ( arr, arr + n );
int d = arr [ 1 ] - arr [ 0 ];
for ( int i = 2;
i < n;
i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false;
return true;
}
) {
if ( n == 1 ) return true;
sort ( arr, arr + n );
int d = arr [ 1 ] - arr [ 0 ];
for ( int i = 2;
i < n;
i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {
{1,4,64,16},
{0, 12, 4, 8},
{-2, 2, 0, 4, 6},
{0,0,0,0,0,0,0,0,0,0,0,0},
{66,56,86,76,46},
{66,56,56,86,76,46},
{7,9,11,21,44,45,61,67,78,97,98,99},
{66,-28,-26,50,-18,54,84,-2,-70,-74,6,-34,44,-36,-4,36,14,24,64,74,86,-96,54,-68,-84,-62,-36,34,-36,70,-50,6,62,-50,-34,-38,-28,74,78,-2,-12,-4},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{18,93,79,20,44,36,69,37,33,82,19,51,32,22,1,54,89,20,58,35,70,70,61,63,61,57,3,95,99,45,15,17,15,5,86,46,11,64,92,14,39,67}};
vector<int> param1 {4,4,5,7,5,6,11,33,33,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int arr [ ], int n ) { if ( n == 1 ) return true; sort [MASK] arr, arr + n ); int d = arr [ 1 ] - arr [ 0 ]; for ( int i = 2; i < n; i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false; return true; }) {
if ( n == 1 ) return true;
sort ( arr, arr + n );
int d = arr [ 1 ] - arr [ 0 ];
for ( int i = 2;
i < n;
i ++ ) if ( arr [ i ] - arr [ i - 1 ] != d ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {
{1,4,64,16},
{0, 12, 4, 8},
{-2, 2, 0, 4, 6},
{0,0,0,0,0,0,0,0,0,0,0,0},
{66,56,86,76,46},
{66,56,56,86,76,46},
{7,9,11,21,44,45,61,67,78,97,98,99},
{66,-28,-26,50,-18,54,84,-2,-70,-74,6,-34,44,-36,-4,36,14,24,64,74,86,-96,54,-68,-84,-62,-36,34,-36,70,-50,6,62,-50,-34,-38,-28,74,78,-2,-12,-4},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{18,93,79,20,44,36,69,37,33,82,19,51,32,22,1,54,89,20,58,35,70,70,61,63,61,57,3,95,99,45,15,17,15,5,86,46,11,64,92,14,39,67}};
vector<int> param1 {4,4,5,7,5,6,11,33,33,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) )",
"b) *",
"c) (",
"d) ?",
"e) ["
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str, string corner ) {
int n = str . length ( );
int cl = corner . length ( );
if ( n < cl ) return false;
return ( str . substr ( 0, cl ) . compare ( corner ) == 0 && str . substr ( n - cl, cl ) . compare ( corner ) == 0 );
}
length ( );
int cl = corner . length ( );
if ( n < cl ) return false;
return ( str . substr ( 0, cl ) . compare ( corner ) == 0 && str . substr ( n - cl, cl ) . compare ( corner ) == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeksmanishgeeks","shreyadhatwalia","10000100","abaa","30645530","0000011011001","dkqEd","48694119324654","1101010010","Ks"};
vector<string> param1 {"geeks","abc","100","a","30","001","d","654","11","KsFLmngGGOmHKs"};
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; bool f_gold ( string str, string corner ) { int n = str . length ( ); int cl = corner . length ( ); if ( n [MASK] cl ) return false; return ( str . substr ( 0, cl ) . compare ( corner ) == 0 && str . substr ( n - cl, cl ) . compare ( corner ) == 0 ); } length ( );
int cl = corner . length ( );
if ( n < cl ) return false;
return ( str . substr ( 0, cl ) . compare ( corner ) == 0 && str . substr ( n - cl, cl ) . compare ( corner ) == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeksmanishgeeks","shreyadhatwalia","10000100","abaa","30645530","0000011011001","dkqEd","48694119324654","1101010010","Ks"};
vector<string> param1 {"geeks","abc","100","a","30","001","d","654","11","KsFLmngGGOmHKs"};
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) class",
"b) <",
"c) length",
"d) #include",
"e) void"
] | 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 ) {
return 1 + n * ( n + 1 ) / 2;
}
#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 * ( n + 1 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,68,4,12,56,14,81,29,26,40};
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] return 1 + n * ( n + 1 ) / 2; }
#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 * ( n + 1 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,68,4,12,56,14,81,29,26,40};
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) #include",
"c) return",
"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 a [ ], int n ) {
sort ( a, a + n, greater < int > ( ) );
int sum = 0;
bool flag = false;
int len;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( ! flag ) ) {
flag = true;
len = a [ i + 1 ];
i ++;
}
else if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( flag ) ) {
sum = sum + a [ i + 1 ] * len;
flag = false;
i ++;
}
}
return sum;
}
i ++;
}
else if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( flag ) ) {
sum = sum + a [ i + 1 ] * len;
flag = false;
i ++;
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,11,14,15,22,33,64,81,82,95},{-42,2,84,18,60,84,-12,64,46,60,40,52,-62,-48,60,64,76,50,88,92,42,-82,44,-98,-4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,6,43,82,99,1,20,7,52,18,52,18,45,75,58,48,49,70,69,19,49,35,45,14,52,33,9,31,86,70,77,70,91,56,76,69,68,31,21,72,78,83,76,1},{-92,-76,-70,-62,-46,-36,-36,-32,-26,-8,-2,4,8,14,14,26,34,48,58,68,74,78,84,86},{1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,0,1,1,1,1,0,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,1,0,0,1,1,1,0,1},{19,20,23,25,26,26,34,43,43,46,49,56,59,59,68,73,93,93},{-82,-80,-68,-98,34,96,-72,22,-30,-92,74,-68,48,92,-26,-32,-8,72,84,-10,60,74,-98,78,-32,84,64,-56,94,24,72,40,-44,2,-18,34},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{40,32,38,69,56,28,79,29,63,72,4,46,25,32,12,83,59,59,32,1,56,15,62,3,6,85,29,45,88,84,52,62,89,33,48,23,85,54,46,78,7,12}};
vector<int> param1 {9,22,22,32,21,38,10,33,24,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { sort ( a, a + n, greater < int > ( ) ); int sum = 0; bool flag = false; int len; for ( int i = 0; i < n; i ++ ) { if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( ! flag ) ) { flag = true; len = a [ i + 1 [MASK] i ++; } else if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( flag ) ) { sum = sum + a [ i + 1 ] * len; flag = false; i ++; } } return sum; } i ++;
}
else if ( ( a [ i ] == a [ i + 1 ] || a [ i ] - a [ i + 1 ] == 1 ) && ( flag ) ) {
sum = sum + a [ i + 1 ] * len;
flag = false;
i ++;
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,11,14,15,22,33,64,81,82,95},{-42,2,84,18,60,84,-12,64,46,60,40,52,-62,-48,60,64,76,50,88,92,42,-82,44,-98,-4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,6,43,82,99,1,20,7,52,18,52,18,45,75,58,48,49,70,69,19,49,35,45,14,52,33,9,31,86,70,77,70,91,56,76,69,68,31,21,72,78,83,76,1},{-92,-76,-70,-62,-46,-36,-36,-32,-26,-8,-2,4,8,14,14,26,34,48,58,68,74,78,84,86},{1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,0,1,1,1,1,0,1,0,0,0,0,1,1,0,0,1,0,0,0,1,1,0,0,1,0,0,1,1,1,0,1},{19,20,23,25,26,26,34,43,43,46,49,56,59,59,68,73,93,93},{-82,-80,-68,-98,34,96,-72,22,-30,-92,74,-68,48,92,-26,-32,-8,72,84,-10,60,74,-98,78,-32,84,64,-56,94,24,72,40,-44,2,-18,34},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{40,32,38,69,56,28,79,29,63,72,4,46,25,32,12,83,59,59,32,1,56,15,62,3,6,85,29,45,88,84,52,62,89,33,48,23,85,54,46,78,7,12}};
vector<int> param1 {9,22,22,32,21,38,10,33,24,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ]; | [
"a) i",
"b) while",
"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 x1, int y1, int x2, int y2, int r1, int r2 ) {
int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
int radSumSq = ( r1 + r2 ) * ( r1 + r2 );
if ( distSq == radSumSq ) return 1;
else if ( distSq > radSumSq ) return - 1;
else return 0;
}
1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
int radSumSq = ( r1 + r2 ) * ( r1 + r2 );
if ( distSq == radSumSq ) return 1;
else if ( distSq > radSumSq ) return - 1;
else return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,87,51,89,64,57,65,32,73,3};
vector<int> param1 {36,1,1,67,10,86,90,23,61,99};
vector<int> param2 {62,62,47,9,79,99,42,28,63,6};
vector<int> param3 {64,64,90,52,45,43,82,26,77,19};
vector<int> param4 {50,54,14,94,67,83,77,60,92,21};
vector<int> param5 {4,41,71,21,78,63,32,45,76,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i],param3[i],param4[i],param5[i]) == f_gold(param0[i],param1[i],param2[i],param3[i],param4[i],param5[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 x1, int y1, int x2, int y2, int r1, int r2 ) { int distSq = ( x1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 ); int radSumSq = ( r1 + r2 ) * ( r1 + r2 ); if ( distSq == radSumSq ) return 1; else if ( distSq > radSumSq ) return - 1; else return 0; }1 - x2 ) * ( x1 - x2 ) + ( y1 - y2 ) * ( y1 - y2 );
int radSumSq = ( r1 + r2 ) * ( r1 + r2 );
if ( distSq == radSumSq ) return 1;
else if ( distSq > radSumSq ) return - 1;
else return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,87,51,89,64,57,65,32,73,3};
vector<int> param1 {36,1,1,67,10,86,90,23,61,99};
vector<int> param2 {62,62,47,9,79,99,42,28,63,6};
vector<int> param3 {64,64,90,52,45,43,82,26,77,19};
vector<int> param4 {50,54,14,94,67,83,77,60,92,21};
vector<int> param5 {4,41,71,21,78,63,32,45,76,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i],param3[i],param4[i],param5[i]) == f_gold(param0[i],param1[i],param2[i],param3[i],param4[i],param5[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | f_gold | [
"a) n",
"b) <=",
"c) f_gold",
"d) {qsort",
"e) for"
] | 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 invcount = 0;
for ( int i = 1;
i < n - 1;
i ++ ) {
int small = 0;
for ( int j = i + 1;
j < n;
j ++ ) if ( arr [ i ] > arr [ j ] ) small ++;
int great = 0;
for ( int j = i - 1;
j >= 0;
j -- ) if ( arr [ i ] < arr [ j ] ) great ++;
invcount += great * small;
}
return invcount;
}
arr [ i ] > arr [ j ] ) small ++;
int great = 0;
for ( int j = i - 1;
j >= 0;
j -- ) if ( arr [ i ] < arr [ j ] ) great ++;
invcount += great * small;
}
return invcount;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,75,89},{84,-66,-52,34,-28,-6,20,22,-78,-26,14,24,-92,-18,32,-94,-64,-38,56,4,-10,58,-66,-58,-10,-8,-62,-60,-26},{0,0,0,1,1,1,1,1},{18,7,43,57,94,37,38,41,59,64,97,29,51,37,64,91,42,83,13,22,68},{-94,-86,-84,-84,-82,-66,-62,-58,-52,-48,-44,-40,-38,-32,-22,-22,-22,-14,-8,-6,-6,0,2,20,20,26,32,32,52,56,66,74,76,80,80,86,88,94},{0,1,1,0,0,0,0,0,1,0,0},{4,8,15,19,24,31,33,36,38,45,45,52,54,65,73,75,83,84,90,92,93},{80,-30,-44,76,-96,2,22,-30,36,-6,88,-60,-90,-52,78,90,-52},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{74,71,28,45,14,31,17,10,82,27,45,73,93,87,57,58}};
vector<int> param1 {1,26,7,17,34,9,19,10,7,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 invcount = [MASK] for ( int i = 1; i < n - 1; i ++ ) { int small = 0; for ( int j = i + 1; j < n; j ++ ) if ( arr [ i ] > arr [ j ] ) small ++; int great = 0; for ( int j = i - 1; j >= 0; j -- ) if ( arr [ i ] < arr [ j ] ) great ++; invcount += great * small; } return invcount; } arr [ i ] > arr [ j ] ) small ++;
int great = 0;
for ( int j = i - 1;
j >= 0;
j -- ) if ( arr [ i ] < arr [ j ] ) great ++;
invcount += great * small;
}
return invcount;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,75,89},{84,-66,-52,34,-28,-6,20,22,-78,-26,14,24,-92,-18,32,-94,-64,-38,56,4,-10,58,-66,-58,-10,-8,-62,-60,-26},{0,0,0,1,1,1,1,1},{18,7,43,57,94,37,38,41,59,64,97,29,51,37,64,91,42,83,13,22,68},{-94,-86,-84,-84,-82,-66,-62,-58,-52,-48,-44,-40,-38,-32,-22,-22,-22,-14,-8,-6,-6,0,2,20,20,26,32,32,52,56,66,74,76,80,80,86,88,94},{0,1,1,0,0,0,0,0,1,0,0},{4,8,15,19,24,31,33,36,38,45,45,52,54,65,73,75,83,84,90,92,93},{80,-30,-44,76,-96,2,22,-30,36,-6,88,-60,-90,-52,78,90,-52},{0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{74,71,28,45,14,31,17,10,82,27,45,73,93,87,57,58}};
vector<int> param1 {1,26,7,17,34,9,19,10,7,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;
} | 0; | [
"a) 0;",
"b) ]",
"c) *;",
"d) if",
"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 a [ ], int n, int k ) {
if ( k >= n - 1 ) return n;
int best = 0, times = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] > best ) {
best = a [ i ];
if ( i ) times = 1;
}
else times += 1;
if ( times >= k ) return best;
}
return best;
}
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] > best ) {
best = a [ i ];
if ( i ) times = 1;
}
else times += 1;
if ( times >= k ) return best;
}
return best;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,5,9,10,10,11,14,23,27,31,32,33,33,33,37,39,41,41,42,42,43,47,60,61,68,73,73,73,78,80,80,82,83,86,87,89,92,94,98},{80,-58,64,48,-16,60,-50,-52,62,-86,-96,52,26,-30,14},{0,0,0,0,0,0,0,0,0,1,1},{90,23,43,42,7,71,79},{-96,-96,-90,-84,-68,-64,-56,-56,-50,-50,-48,-46,-28,-18,0,0,6,32,32,34,42,42,46,50,50,52,64,64,70,76,84,88},{1,1,1},{2,9,15,19,26,29,42,45,46,47,55,60,60,61,62,64,68,69,74,79,96},{-32,12,80,42,80,8,58,-76,-42,-98,22,-90,-16,-4,-62,-32,28,12,78,-52,-84,78,88,-76,-52,68,-34,-16,-4,2,-78,-94,-22,34,6,-62,72},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{52,19}};
vector<int> param1 {33,14,7,4,28,1,14,26,26,1};
vector<int> param2 {37,13,6,4,21,2,17,31,14,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n, int k ) { if ( k >= n - 1 ) return n; int best = 0, times = 0; for ( int i = 0; i < n; i ++ ) { if ( a [ i ] > [MASK] ) { best = a [ i ]; if ( i ) times = 1; } else times += 1; if ( times >= k ) return best; } return best; } for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] > best ) {
best = a [ i ];
if ( i ) times = 1;
}
else times += 1;
if ( times >= k ) return best;
}
return best;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,5,9,10,10,11,14,23,27,31,32,33,33,33,37,39,41,41,42,42,43,47,60,61,68,73,73,73,78,80,80,82,83,86,87,89,92,94,98},{80,-58,64,48,-16,60,-50,-52,62,-86,-96,52,26,-30,14},{0,0,0,0,0,0,0,0,0,1,1},{90,23,43,42,7,71,79},{-96,-96,-90,-84,-68,-64,-56,-56,-50,-50,-48,-46,-28,-18,0,0,6,32,32,34,42,42,46,50,50,52,64,64,70,76,84,88},{1,1,1},{2,9,15,19,26,29,42,45,46,47,55,60,60,61,62,64,68,69,74,79,96},{-32,12,80,42,80,8,58,-76,-42,-98,22,-90,-16,-4,-62,-32,28,12,78,-52,-84,78,88,-76,-52,68,-34,-16,-4,2,-78,-94,-22,34,6,-62,72},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{52,19}};
vector<int> param1 {33,14,7,4,28,1,14,26,26,1};
vector<int> param2 {37,13,6,4,21,2,17,31,14,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | best | [
"a) int",
"b) 1",
"c) <=",
"d) ]",
"e) best"
] | 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 aCount = 0;
int bCount = 0;
int cCount = 0;
for ( unsigned int i = 0;
i < s . size ( );
i ++ ) {
if ( s [ i ] == 'a' ) aCount = ( 1 + 2 * aCount );
else if ( s [ i ] == 'b' ) bCount = ( aCount + 2 * bCount );
else if ( s [ i ] == 'c' ) cCount = ( bCount + 2 * cCount );
}
return cCount;
}
[ i ] == 'a' ) aCount = ( 1 + 2 * aCount );
else if ( s [ i ] == 'b' ) bCount = ( aCount + 2 * bCount );
else if ( s [ i ] == 'c' ) cCount = ( bCount + 2 * cCount );
}
return cCount;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"","abbc","abcabc","agsdbkfdc","ababab","aaaaaaa","aabaaabcc","19","1001100","DtAnuQbU"};
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 aCount = 0; int bCount = 0; int cCount = 0; for ( unsigned int i = 0; i < s . size ( ); i ++ [MASK] { if ( s [ i ] == 'a' ) aCount = ( 1 + 2 * aCount ); else if ( s [ i ] == 'b' ) bCount = ( aCount + 2 * bCount ); else if ( s [ i ] == 'c' ) cCount = ( bCount + 2 * cCount ); } return cCount; }[ i ] == 'a' ) aCount = ( 1 + 2 * aCount );
else if ( s [ i ] == 'b' ) bCount = ( aCount + 2 * bCount );
else if ( s [ i ] == 'c' ) cCount = ( bCount + 2 * cCount );
}
return cCount;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"","abbc","abcabc","agsdbkfdc","ababab","aaaaaaa","aabaaabcc","19","1001100","DtAnuQbU"};
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) count",
"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 ( string num ) {
if ( num . length ( ) >= 3 ) {
int d1 = ( int ) num [ num . length ( ) - 1 ];
if ( d1 % 2 != 0 ) return ( 0 );
int d2 = ( int ) num [ num . length ( ) - 2 ];
int sum = 0;
for ( int i = 0;
i < num . length ( );
i ++ ) sum += num [ i ];
return ( sum % 3 == 0 && ( d2 * 10 + d1 ) % 4 == 0 );
}
else {
int number = stoi ( num );
return ( number % 12 == 0 );
}
}
i < num . length ( );
i ++ ) sum += num [ i ];
return ( sum % 3 == 0 && ( d2 * 10 + d1 ) % 4 == 0 );
}
else {
int number = stoi ( num );
return ( number % 12 == 0 );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"12244824607284961224","392603977949","11101001111","92387493287593874594898678979792","2233244912","10101","12","254535361","1","hMPxVMpOBt"};
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 num ) { if ( num . length ( ) >= 3 ) { int d1 = ( int ) num [ num . length ( ) - 1 ]; if ( d1 % 2 != 0 ) return ( 0 ); int d2 = ( int ) num [ num . length ( ) - 2 ]; int sum = 0; for ( int i = 0; i < num . length ( ); i ++ ) sum += num [ i ]; return ( sum % 3 == 0 && ( d2 * 10 + d1 ) % 4 == 0 ); } else { int number = stoi ( num ); return ( number % 12 == 0 ); } [MASK]
i < num . length ( );
i ++ ) sum += num [ i ];
return ( sum % 3 == 0 && ( d2 * 10 + d1 ) % 4 == 0 );
}
else {
int number = stoi ( num );
return ( number % 12 == 0 );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"12244824607284961224","392603977949","11101001111","92387493287593874594898678979792","2233244912","10101","12","254535361","1","hMPxVMpOBt"};
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) if",
"e) i"
] | 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 size ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < size;
i ++ ) {
hash [ arr [ i ] ] ++;
}
for ( auto i : hash ) {
if ( i . second % 2 != 0 ) {
return i . first;
}
}
return - 1;
}
t, int > hash;
for ( int i = 0;
i < size;
i ++ ) {
hash [ arr [ i ] ] ++;
}
for ( auto i : hash ) {
if ( i . second % 2 != 0 ) {
return i . first;
}
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,90},{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20},{0,1},{79,55,18,99,38,93,19,49,21,74,16,76,82,52,86,17,42,9,6,63,1,40,75,59,41,81},{-90,-84,-82,-68,-66,-66,-60,-60,-48,-44,-36,-34,-30,-16,-14,-12,-10,-6,2,10,10,14,22,26,30,34,46,50,52,62,64,64,66,72,74,78,78,82,84,88,92},{1,1,0,0,1,0,1,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,0,1,0,1},{2,4,5,7,7,18,18,23,23,25,25,31,41,43,45,46,52,52,55,64,69,69,80,81,84,90,91,93,94,94,94,94,96,98,99},{86,66,-8,2,-18,-22,38,4,-38,-54,78,64,78,20,-32,84,-70,66,-46,12,-12,8,44,14,20},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{11,4,98,38,20,41,1,8}};
vector<int> param1 {1,39,1,23,23,18,20,20,21,7};
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 size ) { unordered_map < int, int > hash; for ( int i = 0; i < size; i ++ ) { hash [ arr [ i ] ] ++; } for ( auto i : hash ) { if ( i . second % 2 != 0 ) { return i . first; } } return - 1; }t, int > hash;
for ( int i = 0;
i < size;
i ++ ) {
hash [ arr [ i ] ] ++;
}
for ( auto i : hash ) {
if ( i . second % 2 != 0 ) {
return i . first;
}
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,90},{-96,94,92,-24,48,54,-30,-86,28,-18,12,-64,-36,68,68,-78,-6,30,-84,20,52,-36,40,-62,90,-48,86,98,12,44,98,-66,52,34,36,76,-50,-20,-20,-20},{0,1},{79,55,18,99,38,93,19,49,21,74,16,76,82,52,86,17,42,9,6,63,1,40,75,59,41,81},{-90,-84,-82,-68,-66,-66,-60,-60,-48,-44,-36,-34,-30,-16,-14,-12,-10,-6,2,10,10,14,22,26,30,34,46,50,52,62,64,64,66,72,74,78,78,82,84,88,92},{1,1,0,0,1,0,1,1,0,0,1,1,1,1,0,0,1,1,1,0,1,0,0,1,0,1},{2,4,5,7,7,18,18,23,23,25,25,31,41,43,45,46,52,52,55,64,69,69,80,81,84,90,91,93,94,94,94,94,96,98,99},{86,66,-8,2,-18,-22,38,4,-38,-54,78,64,78,20,-32,84,-70,66,-46,12,-12,8,44,14,20},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{11,4,98,38,20,41,1,8}};
vector<int> param1 {1,39,1,23,23,18,20,20,21,7};
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) std;",
"b) ==",
"c) ++",
"d) [",
"e) ],"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int size ) {
int max_so_far = INT_MIN, max_ending_here = 0, start = 0, end = 0, s = 0;
for ( int i = 0;
i < size;
i ++ ) {
max_ending_here += a [ i ];
if ( max_so_far < max_ending_here ) {
max_so_far = max_ending_here;
start = s;
end = i;
}
if ( max_ending_here < 0 ) {
max_ending_here = 0;
s = i + 1;
}
}
return ( end - start + 1 );
}
) {
max_so_far = max_ending_here;
start = s;
end = i;
}
if ( max_ending_here < 0 ) {
max_ending_here = 0;
s = i + 1;
}
}
return ( end - start + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,7,16,20,21,22,34,34,37,37,49,53,54,55,58,59,60,66,67,68,73,80,80,88,90,98,99,99},{-90,-98,-10,-84,24},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{94,2,83,94,10,94,58,99,60,19,3,71,36,84,71,14,50,15},{-98,-96,-70,-64,-56,-38,-34,-24,-22,-2,26,32,36,50,62,70,70,72,72,74,78,82,84,86},{0,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,0},{1,2,2,5,13,14,15,18,21,34,42,48,50,63,67,68,69,75,80,80,81,83,84,89,90,90,91,92,95,98},{-88,-10,-88,-90,92,14,68,-90,-86},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,39,90,39,12,90,24,89,54,44,3,26,44,36,67,92,3,79,10,45,22,21,39,91,2,5,72,21,55,48,75,47}};
vector<int> param1 {21,2,19,14,13,35,22,5,24,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 [MASK] [ ], int size ) { int max_so_far = INT_MIN, max_ending_here = 0, start = 0, end = 0, s = 0; for ( int i = 0; i < size; i ++ ) { max_ending_here += a [ i ]; if ( max_so_far < max_ending_here ) { max_so_far = max_ending_here; start = s; end = i; } if ( max_ending_here < 0 ) { max_ending_here = 0; s = i + 1; } } return ( end - start + 1 ); }) {
max_so_far = max_ending_here;
start = s;
end = i;
}
if ( max_ending_here < 0 ) {
max_ending_here = 0;
s = i + 1;
}
}
return ( end - start + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,7,16,20,21,22,34,34,37,37,49,53,54,55,58,59,60,66,67,68,73,80,80,88,90,98,99,99},{-90,-98,-10,-84,24},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{94,2,83,94,10,94,58,99,60,19,3,71,36,84,71,14,50,15},{-98,-96,-70,-64,-56,-38,-34,-24,-22,-2,26,32,36,50,62,70,70,72,72,74,78,82,84,86},{0,1,0,1,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,1,0,0,0,0,1,1,0,1,0,1,0},{1,2,2,5,13,14,15,18,21,34,42,48,50,63,67,68,69,75,80,80,81,83,84,89,90,90,91,92,95,98},{-88,-10,-88,-90,92,14,68,-90,-86},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,39,90,39,12,90,24,89,54,44,3,26,44,36,67,92,3,79,10,45,22,21,39,91,2,5,72,21,55,48,75,47}};
vector<int> param1 {21,2,19,14,13,35,22,5,24,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;
} | a | [
"a) sort",
"b) )",
"c) cmpfunc",
"d) a",
"e) i"
] | d |
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 l = s . length ( );
string s1 = "";
bool isEven = ( l % 2 == 0 ) ? true : false;
for ( int i = 0;
i < l;
i += 2 ) {
if ( isEven ) {
s1 = s [ i ] + s1;
s1 += s [ i + 1 ];
}
else {
if ( l - i > 1 ) {
s1 += s [ i ];
s1 = s [ i + 1 ] + s1;
}
else {
s1 += s [ i ];
}
}
}
return s1;
}
s1 += s [ i + 1 ];
}
else {
if ( l - i > 1 ) {
s1 += s [ i ];
s1 = s [ i + 1 ] + s1;
}
else {
s1 += s [ i ];
}
}
}
return s1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {" EgvQCeqYpZtv","488540","0000101010111","syw","402355","0","wmHMlAtq","7962","111111","UbgRGDquop"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string s ) { int l = s . length ( ); string s1 = ""; bool isEven = ( l % 2 == [MASK] ) ? true : false; for ( int i = 0; i < l; i += 2 ) { if ( isEven ) { s1 = s [ i ] + s1; s1 += s [ i + 1 ]; } else { if ( l - i > 1 ) { s1 += s [ i ]; s1 = s [ i + 1 ] + s1; } else { s1 += s [ i ]; } } } return s1; } s1 += s [ i + 1 ];
}
else {
if ( l - i > 1 ) {
s1 += s [ i ];
s1 = s [ i + 1 ] + s1;
}
else {
s1 += s [ i ];
}
}
}
return s1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {" EgvQCeqYpZtv","488540","0000101010111","syw","402355","0","wmHMlAtq","7962","111111","UbgRGDquop"};
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;
} | 0 | [
"a) :",
"b) 0",
"c) N",
"d) =",
"e) ,"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float l, float b, float h ) {
float volume = ( l * b * h ) / 2;
return volume;
}
ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float l, float b, float h ) {
float volume = ( l * b * h ) / 2;
return volume;
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {8448.900678262902F,-1849.728957491451F,412.667844022232F,-5954.835911765373F,8437.913444665008F,-7183.181663518317F,2340.7905920227954F,-7281.157547371143F,471.3930826982504F,-7550.426360065503F};
vector<float> param1 {8135.461799983198F,-4240.89241631363F,9798.083992381831F,-661.8872499003203F,8182.675681595904F,-6846.746446198541F,5479.00956987109F,-615.8705455524116F,1357.3753126091392F,-2693.2262997056355F};
vector<float> param2 {6577.239053611328F,-9953.518310747193F,1449.9204200270522F,-8049.6051526695055F,9863.296545513396F,-971.2199894221352F,7073.449591910562F,-3343.0245192607968F,1907.815700915636F,-9110.64755244532F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i])) + 0.0000001)) < 0.001F)
{
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; float f_gold ( float l, float b, float h ) { float volume = ( l * b * h ) / 2; return volume; }ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float l, float b, float h ) {
float volume = ( l * b * h ) / 2;
return volume;
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {8448.900678262902F,-1849.728957491451F,412.667844022232F,-5954.835911765373F,8437.913444665008F,-7183.181663518317F,2340.7905920227954F,-7281.157547371143F,471.3930826982504F,-7550.426360065503F};
vector<float> param1 {8135.461799983198F,-4240.89241631363F,9798.083992381831F,-661.8872499003203F,8182.675681595904F,-6846.746446198541F,5479.00956987109F,-615.8705455524116F,1357.3753126091392F,-2693.2262997056355F};
vector<float> param2 {6577.239053611328F,-9953.518310747193F,1449.9204200270522F,-8049.6051526695055F,9863.296545513396F,-971.2199894221352F,7073.449591910562F,-3343.0245192607968F,1907.815700915636F,-9110.64755244532F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i])) + 0.0000001)) < 0.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <string> | [
"a) :",
"b) ],",
"c) <string>",
"d) =",
"e) ="
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) ans += ( i / j );
return ans;
}
nip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) ans += ( i / j );
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,74,8,74,34,66,96,11,45,72};
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 ans = 0; for ( int i = 1; i <= n; i ++ [MASK] for ( int j = 1; j <= n; j ++ ) ans += ( i / j ); return ans; }nip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 0;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= n;
j ++ ) ans += ( i / j );
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {60,74,8,74,34,66,96,11,45,72};
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) int",
"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 A [ ], int B [ ], int m, int n ) {
sort ( A, A + m );
sort ( B, B + n );
int a = 0, b = 0;
int result = INT_MAX;
while ( a < m && b < n ) {
if ( abs ( A [ a ] - B [ b ] ) < result ) result = abs ( A [ a ] - B [ b ] );
if ( A [ a ] < B [ b ] ) a ++;
else b ++;
}
return result;
}
t = INT_MAX;
while ( a < m && b < n ) {
if ( abs ( A [ a ] - B [ b ] ) < result ) result = abs ( A [ a ] - B [ b ] );
if ( A [ a ] < B [ b ] ) a ++;
else b ++;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,11,13,18,18,23,25,28,28,37,39,53,56,67,70,74,74,75,79,80,82,84,89,94,95,95,98,98},{-78,10,-8,30,-70,-94,-48,-4,-22,-40,-36,-48,-4,86,-50,62,-72,-44,-62,22,-30,-72,6,-24,-78,72,-44,56,38,-36,0,-72,-10,-12,-70,-64,-24},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,82,90,9,61,71,15,2,39,24,28,28,47},{-92,-90,-90,-28,-16,-14,-14,-8,42,52,62,84},{1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,1,0,0,1,0,1,0,1,1,1,1,0,1,1,1,0,1,0,1,1,1,0,1,0},{6,7,7,12,15,15,21,24,26,26,28,36,38,42,46,52,55,56,59,62,63,65,65,66,68,71,73,77,77,77,77,85,87,87,88,90,93,94,98},{-68,44,88,-68,22,34,-82,18,-60,30,24,18,78,90,-20,-60,94,70,4,-16,-38},{0,0,1},{14,7,9,71,37,20,85,62,70,67,26,47,61,99,2,90,70,46,53,16,56,7,15,81,85,94,73,40,35,58,21,98,45}};
vector<vector<int>> param1 {{5,6,11,13,13,16,17,19,23,25,28,31,31,39,41,44,45,52,62,64,70,71,73,78,78,79,85,86,92},{78,-80,-24,-50,-26,-62,26,-12,22,-90,84,10,18,62,26,-68,92,64,-52,76,-84,64,50,36,-24,-98,42,72,-78,-98,-24,86,2,60,-30,14,-42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{85,92,84,27,54,77,26,49,47,51,70,11,41},{-98,-98,-58,-6,14,16,18,46,52,52,52,56},{0,1,1,1,0,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1},{1,3,4,4,6,7,8,8,15,17,18,18,20,23,23,24,25,25,26,33,39,43,46,54,59,67,69,69,69,69,76,76,81,81,85,86,86,91,95},{-18,-30,-74,-50,98,-44,-62,-20,18,84,62,-64,-2,62,-32,-34,-14,-52,-36,-60,-68},{0,0,1},{99,72,29,55,88,1,88,19,7,80,79,18,28,41,48,49,67,27,24,94,86,14,45,84,37,71,92,98,16,64,67,44,29}};
vector<int> param2 {28,23,14,7,11,35,30,16,2,20};
vector<int> param3 {14,33,16,8,6,33,20,12,1,25};
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; int f_gold ( int A [ ], int B [ ], int m, int n ) { sort ( A, A + m ); sort ( B, B + n ); int a = 0, b = 0; int result = INT_MAX; while ( a < m && b < n ) { if ( abs ( A [ a ] - B [ b ] ) < result ) result = abs ( A [ a ] - B [ b ] ); if ( A [ a ] < B [ b [MASK] ) a ++; else b ++; } return result; }t = INT_MAX;
while ( a < m && b < n ) {
if ( abs ( A [ a ] - B [ b ] ) < result ) result = abs ( A [ a ] - B [ b ] );
if ( A [ a ] < B [ b ] ) a ++;
else b ++;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,11,13,18,18,23,25,28,28,37,39,53,56,67,70,74,74,75,79,80,82,84,89,94,95,95,98,98},{-78,10,-8,30,-70,-94,-48,-4,-22,-40,-36,-48,-4,86,-50,62,-72,-44,-62,22,-30,-72,6,-24,-78,72,-44,56,38,-36,0,-72,-10,-12,-70,-64,-24},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,82,90,9,61,71,15,2,39,24,28,28,47},{-92,-90,-90,-28,-16,-14,-14,-8,42,52,62,84},{1,0,0,0,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,1,0,0,1,0,1,0,1,1,1,1,0,1,1,1,0,1,0,1,1,1,0,1,0},{6,7,7,12,15,15,21,24,26,26,28,36,38,42,46,52,55,56,59,62,63,65,65,66,68,71,73,77,77,77,77,85,87,87,88,90,93,94,98},{-68,44,88,-68,22,34,-82,18,-60,30,24,18,78,90,-20,-60,94,70,4,-16,-38},{0,0,1},{14,7,9,71,37,20,85,62,70,67,26,47,61,99,2,90,70,46,53,16,56,7,15,81,85,94,73,40,35,58,21,98,45}};
vector<vector<int>> param1 {{5,6,11,13,13,16,17,19,23,25,28,31,31,39,41,44,45,52,62,64,70,71,73,78,78,79,85,86,92},{78,-80,-24,-50,-26,-62,26,-12,22,-90,84,10,18,62,26,-68,92,64,-52,76,-84,64,50,36,-24,-98,42,72,-78,-98,-24,86,2,60,-30,14,-42},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{85,92,84,27,54,77,26,49,47,51,70,11,41},{-98,-98,-58,-6,14,16,18,46,52,52,52,56},{0,1,1,1,0,0,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,1,0,0,1,0,1},{1,3,4,4,6,7,8,8,15,17,18,18,20,23,23,24,25,25,26,33,39,43,46,54,59,67,69,69,69,69,76,76,81,81,85,86,86,91,95},{-18,-30,-74,-50,98,-44,-62,-20,18,84,62,-64,-2,62,-32,-34,-14,-52,-36,-60,-68},{0,0,1},{99,72,29,55,88,1,88,19,7,80,79,18,28,41,48,49,67,27,24,94,86,14,45,84,37,71,92,98,16,64,67,44,29}};
vector<int> param2 {28,23,14,7,11,35,30,16,2,20};
vector<int> param3 {14,33,16,8,6,33,20,12,1,25};
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;
} | ] | [
"a) n;",
"b) y",
"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 result = 0;
for ( int i = 0;
i < n;
i ++ ) {
for ( int j = i + 1;
j < n;
j ++ ) {
int product = arr [ i ] * arr [ j ];
for ( int k = 0;
k < n;
k ++ ) {
if ( arr [ k ] == product ) {
result ++;
break;
}
}
}
}
return result;
}
arr [ i ] * arr [ j ];
for ( int k = 0;
k < n;
k ++ ) {
if ( arr [ k ] == product ) {
result ++;
break;
}
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,7,26,40,46,89,99},{98,42,-24,-60,74,86,6,8,72,-58,38,-20,6,-6,8,48,-34,30,60,66,38,-54,8,-94,-8,0,-64,-94,-94,-72,-84,-36,88,-62,-88,46,-4,88},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,97,57,82,29,68,94,38,81,48,13,84,57,5,27,87,11,35,82,53,67,31,15,99,6,93,91,92,3,23,90,27,6,33,78,3,19,19,27},{-80,-74,-72,-72,-66,-66,-62,-50,-44,-44,-28,-24,-24,-22,-16,-10,-6,-4,-2,2,2,4,12,16,16,28,30,32,32,38,38,72,84,86,88,90,96},{0,1,0,0,1,0,1,1,0,1,0,0,0,0,0,0,0,1,1,1,0,1,0,0,0,1,1,1},{25,67},{82,74,-82,22,-28,-78,-22,-86,-74,42,-6,54,-88,-92,-14,-50,68,46,-50,46,-18,66,-76,-30,36,12,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,23,56,9}};
vector<int> param1 {5,24,44,36,34,18,1,14,32,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int result = 0; for ( int i = 0; i < n; i ++ ) { for ( int [MASK] = i + 1; j < n; j ++ ) { int product = arr [ i ] * arr [ j ]; for ( int k = 0; k < n; k ++ ) { if ( arr [ k ] == product ) { result ++; break; } } } } return result; }arr [ i ] * arr [ j ];
for ( int k = 0;
k < n;
k ++ ) {
if ( arr [ k ] == product ) {
result ++;
break;
}
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,7,26,40,46,89,99},{98,42,-24,-60,74,86,6,8,72,-58,38,-20,6,-6,8,48,-34,30,60,66,38,-54,8,-94,-8,0,-64,-94,-94,-72,-84,-36,88,-62,-88,46,-4,88},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{37,97,57,82,29,68,94,38,81,48,13,84,57,5,27,87,11,35,82,53,67,31,15,99,6,93,91,92,3,23,90,27,6,33,78,3,19,19,27},{-80,-74,-72,-72,-66,-66,-62,-50,-44,-44,-28,-24,-24,-22,-16,-10,-6,-4,-2,2,2,4,12,16,16,28,30,32,32,38,38,72,84,86,88,90,96},{0,1,0,0,1,0,1,1,0,1,0,0,0,0,0,0,0,1,1,1,0,1,0,0,0,1,1,1},{25,67},{82,74,-82,22,-28,-78,-22,-86,-74,42,-6,54,-88,-92,-14,-50,68,46,-50,46,-18,66,-76,-30,36,12,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,23,56,9}};
vector<int> param1 {5,24,44,36,34,18,1,14,32,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | j | [
"a) int",
"b) f_gold",
"c) (",
"d) j",
"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 ( int n, int m ) {
int dp [ n + 2 ] [ n + 2 ];
memset ( dp, 0, sizeof ( dp ) );
dp [ 0 ] [ n + 1 ] = 1;
for ( int k = n;
k >= m;
k -- ) {
for ( int i = 0;
i <= n;
i ++ ) {
dp [ i ] [ k ] = dp [ i ] [ k + 1 ];
if ( i - k >= 0 ) dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - k ] [ k ] );
}
}
return dp [ n ] [ m ];
}
nt i = 0;
i <= n;
i ++ ) {
dp [ i ] [ k ] = dp [ i ] [ k + 1 ];
if ( i - k >= 0 ) dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - k ] [ k ] );
}
}
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,77,59,5,41,39,23,7,82,11};
vector<int> param1 {18,74,85,76,62,40,58,1,45,66};
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 [ n + 2 ] [ n + 2 ]; memset ( dp, 0, sizeof ( dp ) ); dp [ 0 ] [ n + 1 ] = 1; for ( int [MASK] = n; k >= m; k -- ) { for ( int i = 0; i <= n; i ++ ) { dp [ i ] [ k ] = dp [ i ] [ k + 1 ]; if ( i - k >= 0 ) dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - k ] [ k ] ); } } return dp [ n ] [ m ]; }nt i = 0;
i <= n;
i ++ ) {
dp [ i ] [ k ] = dp [ i ] [ k + 1 ];
if ( i - k >= 0 ) dp [ i ] [ k ] = ( dp [ i ] [ k ] + dp [ i - k ] [ k ] );
}
}
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,77,59,5,41,39,23,7,82,11};
vector<int> param1 {18,74,85,76,62,40,58,1,45,66};
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;
} | k | [
"a) x",
"b) k",
"c) {",
"d) arr",
"e) n"
] | b |
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 ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ! ( n & 0xAAAAAAAA );
}
ector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( unsigned int n ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ! ( n & 0xAAAAAAAA );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,64,-64,128,1024,97,86,14,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; bool f_gold ( unsigned int n ) { return n != 0 && ( [MASK] n & ( n - 1 ) ) == 0 ) && ! ( n & 0xAAAAAAAA ); }ector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( unsigned int n ) {
return n != 0 && ( ( n & ( n - 1 ) ) == 0 ) && ! ( n & 0xAAAAAAAA );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,64,-64,128,1024,97,86,14,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;
} | ( | [
"a) a",
"b) (",
"c) =",
"d) x",
"e) )"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int pPrevPrev = 1, pPrev = 1, pCurr = 1, pNext = 1;
for ( int i = 3;
i <= n;
i ++ ) {
pNext = pPrevPrev + pPrev;
pPrevPrev = pPrev;
pPrev = pCurr;
pCurr = pNext;
}
return pNext;
}
Prev = 1, pPrev = 1, pCurr = 1, pNext = 1;
for ( int i = 3;
i <= n;
i ++ ) {
pNext = pPrevPrev + pPrev;
pPrevPrev = pPrev;
pPrev = pCurr;
pCurr = pNext;
}
return pNext;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,92,29,52,55,13,83,83,10,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int [MASK] ( int n ) { int pPrevPrev = 1, pPrev = 1, pCurr = 1, pNext = 1; for ( int i = 3; i <= n; i ++ ) { pNext = pPrevPrev + pPrev; pPrevPrev = pPrev; pPrev = pCurr; pCurr = pNext; } return pNext; }Prev = 1, pPrev = 1, pCurr = 1, pNext = 1;
for ( int i = 3;
i <= n;
i ++ ) {
pNext = pPrevPrev + pPrev;
pPrevPrev = pPrev;
pPrev = pCurr;
pCurr = pNext;
}
return pNext;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,92,29,52,55,13,83,83,10,67};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | f_gold | [
"a) if",
"b) b",
"c) #include",
"d) ((int)",
"e) f_gold"
] | e |
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, unsigned int k ) {
bool oneSeen = false;
while ( n > 0 ) {
int digit = n % k;
if ( digit > 1 ) return false;
if ( digit == 1 ) {
if ( oneSeen ) return false;
oneSeen = true;
}
n /= k;
}
return true;
}
while ( n > 0 ) {
int digit = n % k;
if ( digit > 1 ) return false;
if ( digit == 1 ) {
if ( oneSeen ) return false;
oneSeen = true;
}
n /= k;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {64,16,27,81,1,69,8,31,43,54};
vector<int> param1 {4,2,3,72,9,17,20,79,81,89};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( unsigned int n, unsigned int k ) { bool [MASK] = false; while ( n > 0 ) { int digit = n % k; if ( digit > 1 ) return false; if ( digit == 1 ) { if ( oneSeen ) return false; oneSeen = true; } n /= k; } return true; } while ( n > 0 ) {
int digit = n % k;
if ( digit > 1 ) return false;
if ( digit == 1 ) {
if ( oneSeen ) return false;
oneSeen = true;
}
n /= k;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {64,16,27,81,1,69,8,31,43,54};
vector<int> param1 {4,2,3,72,9,17,20,79,81,89};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | oneSeen | [
"a) #include",
"b) x,",
"c) oneSeen",
"d) )",
"e) int"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int a [ n + 1 ] [ 10 ];
for ( int i = 0;
i <= 9;
i ++ ) a [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) a [ i ] [ 9 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 8;
j >= 0;
j -- ) a [ i ] [ j ] = a [ i - 1 ] [ j ] + a [ i ] [ j + 1 ];
return a [ n ] [ 0 ];
}
1;
i <= n;
i ++ ) a [ i ] [ 9 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 8;
j >= 0;
j -- ) a [ i ] [ j ] = a [ i - 1 ] [ j ] + a [ i ] [ j + 1 ];
return a [ n ] [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,19,79,62,93,39,7,31,3,21};
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 a [ n + 1 ] [ 10 ]; for ( int i = 0; i <= 9; i ++ ) a [ 0 ] [ i ] = 1; for ( int i = 1; i <= n; i ++ ) a [ i ] [ 9 ] = 1; for ( int i = 1; i <= n; i ++ ) for ( int j = 8; j >= 0; j -- ) a [ i ] [ j ] = a [ i - 1 ] [ j ] + [MASK] [ i ] [ j + 1 ]; return a [ n ] [ 0 ]; } 1;
i <= n;
i ++ ) a [ i ] [ 9 ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 8;
j >= 0;
j -- ) a [ i ] [ j ] = a [ i - 1 ] [ j ] + a [ i ] [ j + 1 ];
return a [ n ] [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {2,19,79,62,93,39,7,31,3,21};
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 | [
"a) import",
"b) a",
"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 a, int b ) {
if ( b == 0 ) return 1;
int answer = a;
int increment = a;
int i, j;
for ( i = 1;
i < b;
i ++ ) {
for ( j = 1;
j < a;
j ++ ) {
answer += increment;
}
increment = answer;
}
return answer;
}
er = a;
int increment = a;
int i, j;
for ( i = 1;
i < b;
i ++ ) {
for ( j = 1;
j < a;
j ++ ) {
answer += increment;
}
increment = answer;
}
return answer;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,82,12,55,34,22,13,57,76,76};
vector<int> param1 {4,66,38,33,26,23,98,84,94,95};
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 a, int b ) { if ( b == 0 ) [MASK] 1; int answer = a; int increment = a; int i, j; for ( i = 1; i < b; i ++ ) { for ( j = 1; j < a; j ++ ) { answer += increment; } increment = answer; } return answer; }er = a;
int increment = a;
int i, j;
for ( i = 1;
i < b;
i ++ ) {
for ( j = 1;
j < a;
j ++ ) {
answer += increment;
}
increment = answer;
}
return answer;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {66,82,12,55,34,22,13,57,76,76};
vector<int> param1 {4,66,38,33,26,23,98,84,94,95};
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;
} | return | [
"a) 2",
"b) ]",
"c) return",
"d) <stdio.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 low, int high, int key ) {
if ( high < low ) return - 1;
int mid = ( low + high ) / 2;
if ( key == arr [ mid ] ) return mid;
if ( key > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high, key );
return f_gold ( arr, low, ( mid - 1 ), key );
}
int mid = ( low + high ) / 2;
if ( key == arr [ mid ] ) return mid;
if ( key > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high, key );
return f_gold ( arr, low, ( mid - 1 ), key );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,10,73,91,98},{30,24,24,-8,64,50,46,-76,26,8,-92,-78,40,-86,96,14,60,38,6,-72,-6,-20,26,-26,0,2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{30,79,3,76,18},{-96,-90,-88,-84,-78,-78,-70,-68,-66,-66,-64,-64,-58,-56,-52,-42,-40,-38,-36,-30,-30,-28,-14,-8,0,14,16,22,24,26,36,40,40,48,48,50,52,54,54,58,64,74,82,88,94},{1,1,0,0,0,1,1,1,0,0,1,0,1,0,0,0,1,0,1,1,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,1,1,0,1},{2,8,8,14,15,16,17,17,18,18,24,25,25,26,36,37,39,39,40,44,46,47,51,54,56,57,57,61,61,67,68,69,72,76,77,81,82,82,82,85,85,87,94,94,98,99},{-4,84,20,-84,-6,-78,20,56,40,0,98,80,-94,36,-6,-98,50,66,-12,-58,-34,68,-80,-30,-82,-76,-38,-60,92,94,48,-84,20,-66,-32,-92,16,-96,-68,94,-46,30,32,-34,96,-92,-96,-86,-22},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{71,70,13,18,70,62,88,27,17,44,89,28,74,41,20,91,95,79,40,43,38,20,5}};
vector<int> param1 {2,20,30,3,35,25,33,34,19,21};
vector<int> param2 {4,13,27,2,30,26,40,27,13,22};
vector<int> param3 {4,21,29,2,40,30,26,34,19,22};
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 low, int high, int key ) { if ( high < low ) return - 1; int mid = ( low + high ) / 2; if ( key == arr [ mid [MASK] ) return mid; if ( key > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high, key ); return f_gold ( arr, low, ( mid - 1 ), key ); }
int mid = ( low + high ) / 2;
if ( key == arr [ mid ] ) return mid;
if ( key > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high, key );
return f_gold ( arr, low, ( mid - 1 ), key );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,10,73,91,98},{30,24,24,-8,64,50,46,-76,26,8,-92,-78,40,-86,96,14,60,38,6,-72,-6,-20,26,-26,0,2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{30,79,3,76,18},{-96,-90,-88,-84,-78,-78,-70,-68,-66,-66,-64,-64,-58,-56,-52,-42,-40,-38,-36,-30,-30,-28,-14,-8,0,14,16,22,24,26,36,40,40,48,48,50,52,54,54,58,64,74,82,88,94},{1,1,0,0,0,1,1,1,0,0,1,0,1,0,0,0,1,0,1,1,1,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,0,1,1,0,1},{2,8,8,14,15,16,17,17,18,18,24,25,25,26,36,37,39,39,40,44,46,47,51,54,56,57,57,61,61,67,68,69,72,76,77,81,82,82,82,85,85,87,94,94,98,99},{-4,84,20,-84,-6,-78,20,56,40,0,98,80,-94,36,-6,-98,50,66,-12,-58,-34,68,-80,-30,-82,-76,-38,-60,92,94,48,-84,20,-66,-32,-92,16,-96,-68,94,-46,30,32,-34,96,-92,-96,-86,-22},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{71,70,13,18,70,62,88,27,17,44,89,28,74,41,20,91,95,79,40,43,38,20,5}};
vector<int> param1 {2,20,30,3,35,25,33,34,19,21};
vector<int> param2 {4,13,27,2,30,26,40,27,13,22};
vector<int> param3 {4,21,29,2,40,30,26,34,19,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) }",
"b) ]",
"c) {",
"d) }",
"e) j"
] | 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 num = n;
int dec_value = 0;
int base = 1;
int temp = num;
while ( temp ) {
int last_digit = temp % 10;
temp = temp / 10;
dec_value += last_digit * base;
base = base * 2;
}
return dec_value;
}
e = 0;
int base = 1;
int temp = num;
while ( temp ) {
int last_digit = temp % 10;
temp = temp / 10;
dec_value += last_digit * base;
base = base * 2;
}
return dec_value;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {70,95,41,97,8,16,41,57,81,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int num = n; int dec_value = 0; [MASK] base = 1; int temp = num; while ( temp ) { int last_digit = temp % 10; temp = temp / 10; dec_value += last_digit * base; base = base * 2; } return dec_value; }e = 0;
int base = 1;
int temp = num;
while ( temp ) {
int last_digit = temp % 10;
temp = temp / 10;
dec_value += last_digit * base;
base = base * 2;
}
return dec_value;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {70,95,41,97,8,16,41,57,81,78};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) (",
"b) b)",
"c) i",
"d) int",
"e) s"
] | 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 sum ) {
unordered_map < int, int > prevSum;
int res = 0;
int currsum = 0;
for ( int i = 0;
i < n;
i ++ ) {
currsum += arr [ i ];
if ( currsum == sum ) res ++;
if ( prevSum . find ( currsum - sum ) != prevSum . end ( ) ) res += ( prevSum [ currsum - sum ] );
prevSum [ currsum ] ++;
}
return res;
}
arr [ i ];
if ( currsum == sum ) res ++;
if ( prevSum . find ( currsum - sum ) != prevSum . end ( ) ) res += ( prevSum [ currsum - sum ] );
prevSum [ currsum ] ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,18,27,52,70,91},{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68},{0,0,0,0,0,0,0,0,1,1,1,1},{67,39,22,32,59,44,86,26,46,60,99,12,32,46,16,22,45,85,21,92,77,50,65,23,93,26,23,20,32,83,60,22,11,45,99,31,72},{-86,-84,-82,-82,-28,-12,4,24,62,72},{1,0,0,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1},{8,20,25,27,28,28,30,31,32,36,39,41,51,53,53,54,56,58,59,77,78,85,88,92,99},{60,40,-96,-76,-34,-18,38,-62,50,56,64,-94,-50,50,-80,42,-66,-42,68,70,78,-18,-24,-48,-92,64,14,24,-94,-98,18,44,-58},{0,0,0,0,1,1,1,1,1,1,1,1},{73,52,37,80,4,26,3,76,32,79,31,32,8,87,42,50,51}};
vector<int> param1 {5,32,11,25,7,16,13,22,11,8};
vector<int> param2 {4,30,11,25,5,13,18,17,8,14};
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 sum ) { unordered_map < int, int > prevSum; int res = 0; int currsum = 0; for ( int i = 0; i < n; i ++ ) { currsum += arr [ i ]; if ( currsum == sum ) res ++; if ( prevSum . find ( currsum - sum ) != prevSum . end [MASK] ) ) res += ( prevSum [ currsum - sum ] ); prevSum [ currsum ] ++; } return res; } arr [ i ];
if ( currsum == sum ) res ++;
if ( prevSum . find ( currsum - sum ) != prevSum . end ( ) ) res += ( prevSum [ currsum - sum ] );
prevSum [ currsum ] ++;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,18,27,52,70,91},{60,-88,-48,90,-28,20,18,34,-58,76,-78,-18,68,-48,8,34,60,-34,-10,32,78,-84,-22,54,-18,-82,-70,-58,-20,-76,88,-30,-6,68},{0,0,0,0,0,0,0,0,1,1,1,1},{67,39,22,32,59,44,86,26,46,60,99,12,32,46,16,22,45,85,21,92,77,50,65,23,93,26,23,20,32,83,60,22,11,45,99,31,72},{-86,-84,-82,-82,-28,-12,4,24,62,72},{1,0,0,1,0,1,1,1,0,1,1,1,0,0,1,1,1,1},{8,20,25,27,28,28,30,31,32,36,39,41,51,53,53,54,56,58,59,77,78,85,88,92,99},{60,40,-96,-76,-34,-18,38,-62,50,56,64,-94,-50,50,-80,42,-66,-42,68,70,78,-18,-24,-48,-92,64,14,24,-94,-98,18,44,-58},{0,0,0,0,1,1,1,1,1,1,1,1},{73,52,37,80,4,26,3,76,32,79,31,32,8,87,42,50,51}};
vector<int> param1 {5,32,11,25,7,16,13,22,11,8};
vector<int> param2 {4,30,11,25,5,13,18,17,8,14};
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) <cstdlib>",
"b) (",
"c) res",
"d) <vector>",
"e) using"
] | 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 high [ ], int low [ ], int n ) {
if ( n <= 0 ) return 0;
return max ( high [ n - 1 ] + f_gold ( high, low, ( n - 2 ) ), low [ n - 1 ] + f_gold ( high, low, ( n - 1 ) ) );
}
d;
int f_gold ( int high [ ], int low [ ], int n ) {
if ( n <= 0 ) return 0;
return max ( high [ n - 1 ] + f_gold ( high, low, ( n - 2 ) ), low [ n - 1 ] + f_gold ( high, low, ( n - 1 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,9,10,13,14,15,15,17,22,23,28,30,31,37,42,45,62,62,68,68,68,78,79,82,84,87,90,99},{-78,-12,26,80,50,4,-80,86,12,-2,18,-50,-90,56,-50,88,-62,96,-44,-82,56},{1},{21,28,13,48,26,49,16,70,81,35,74,12,97,61,10,84,94,78,40,30,30,84,41,4,95,79,38,29,9},{-80,-36,-32,-20,-14,-12,10,12,72},{1,1,0,1,0,0,0,0,0,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1},{1,7,9,10,13,14,15,20,23,24,24,24,26,27,29,31,32,33,34,35,46,48,49,51,51,53,53,56,56,60,62,64,64,70,73,73,73,74,77,78,79,79,79,80,86,89,89,92,98},{56,48,40,-56,44,-86,-28,-32,-34,4,-94,-14,28,-74},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{85,13,35,57,8,48,65,54,88,7,66,30,47,51}};
vector<vector<int>> param1 {{5,10,11,14,16,22,24,30,34,35,37,37,39,41,42,42,43,55,57,63,71,76,83,83,85,90,91,97,99},{-44,-14,14,0,30,78,40,-12,-44,-16,60,-12,-50,-66,70,-98,-56,48,-82,94,14},{1},{49,88,25,93,24,56,47,44,33,27,86,57,21,25,64,44,37,99,36,54,17,29,37,17,26,43,61,27,21},{-76,-54,-50,-28,0,58,70,78,90},{0,0,1,1,1,0,0,1,1,0,1,1,1,1,0,1,1,1,0,1,1,0,0,0,1},{1,3,3,4,8,8,10,10,10,12,12,15,15,22,23,28,28,30,31,33,34,35,36,36,36,42,44,44,51,54,57,58,59,59,63,65,66,68,69,71,73,76,77,78,79,79,86,87,93},{82,-40,-16,-64,12,-6,60,48,-58,-4,42,-28,24,-58},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1},{1,42,42,89,3,21,49,98,4,59,26,85,53,34}};
vector<int> param2 {18,16,0,25,4,24,31,8,16,8};
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 [MASK] #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int high [ ], int low [ ], int n ) { if ( n <= 0 ) return 0; return max ( high [ n - 1 ] + f_gold ( high, low, ( n - 2 ) ), low [ n - 1 ] + f_gold ( high, low, ( n - 1 ) ) ); }d;
int f_gold ( int high [ ], int low [ ], int n ) {
if ( n <= 0 ) return 0;
return max ( high [ n - 1 ] + f_gold ( high, low, ( n - 2 ) ), low [ n - 1 ] + f_gold ( high, low, ( n - 1 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,3,9,10,13,14,15,15,17,22,23,28,30,31,37,42,45,62,62,68,68,68,78,79,82,84,87,90,99},{-78,-12,26,80,50,4,-80,86,12,-2,18,-50,-90,56,-50,88,-62,96,-44,-82,56},{1},{21,28,13,48,26,49,16,70,81,35,74,12,97,61,10,84,94,78,40,30,30,84,41,4,95,79,38,29,9},{-80,-36,-32,-20,-14,-12,10,12,72},{1,1,0,1,0,0,0,0,0,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1},{1,7,9,10,13,14,15,20,23,24,24,24,26,27,29,31,32,33,34,35,46,48,49,51,51,53,53,56,56,60,62,64,64,70,73,73,73,74,77,78,79,79,79,80,86,89,89,92,98},{56,48,40,-56,44,-86,-28,-32,-34,4,-94,-14,28,-74},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{85,13,35,57,8,48,65,54,88,7,66,30,47,51}};
vector<vector<int>> param1 {{5,10,11,14,16,22,24,30,34,35,37,37,39,41,42,42,43,55,57,63,71,76,83,83,85,90,91,97,99},{-44,-14,14,0,30,78,40,-12,-44,-16,60,-12,-50,-66,70,-98,-56,48,-82,94,14},{1},{49,88,25,93,24,56,47,44,33,27,86,57,21,25,64,44,37,99,36,54,17,29,37,17,26,43,61,27,21},{-76,-54,-50,-28,0,58,70,78,90},{0,0,1,1,1,0,0,1,1,0,1,1,1,1,0,1,1,1,0,1,1,0,0,0,1},{1,3,3,4,8,8,10,10,10,12,12,15,15,22,23,28,28,30,31,33,34,35,36,36,36,42,44,44,51,54,57,58,59,59,63,65,66,68,69,71,73,76,77,78,79,79,86,87,93},{82,-40,-16,-64,12,-6,60,48,-58,-4,42,-28,24,-58},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1},{1,42,42,89,3,21,49,98,4,59,26,85,53,34}};
vector<int> param2 {18,16,0,25,4,24,31,8,16,8};
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;
} | <iostream> | [
"a) <iostream>",
"b) :",
"c) j",
"d) return",
"e) arr2"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string s1, string s2 ) {
int n = s1 . length ( );
int m = s2 . length ( );
bool dp [ n + 1 ] [ m + 1 ];
for ( int i = 0;
i <= n;
i ++ ) {
for ( int j = 0;
j <= m;
j ++ ) {
dp [ i ] [ j ] = false;
}
}
dp [ 0 ] [ 0 ] = true;
for ( int i = 0;
i < s1 . length ( );
i ++ ) {
for ( int j = 0;
j <= s2 . length ( );
j ++ ) {
if ( dp [ i ] [ j ] ) {
if ( j < s2 . length ( ) && ( toupper ( s1 [ i ] ) == s2 [ j ] ) ) dp [ i + 1 ] [ j + 1 ] = true;
if ( ! isupper ( s1 [ i ] ) ) dp [ i + 1 ] [ j ] = true;
}
}
}
return ( dp [ n ] [ m ] );
}
ength ( ) && ( toupper ( s1 [ i ] ) == s2 [ j ] ) ) dp [ i + 1 ] [ j + 1 ] = true;
if ( ! isupper ( s1 [ i ] ) ) dp [ i + 1 ] [ j ] = true;
}
}
}
return ( dp [ n ] [ m ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"daBcd","417514","010000","ZcKYguiMrdyn","argaju","1110101101","ySOCoSaygi","204","10011100000010","nMAioozPmY"};
vector<string> param1 {"ABC","9","1111011010","iz","RAJ","110101001","aRhxkYqh","6986871066","0","WZFdDKw"};
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; bool f_gold ( string s1, string s2 ) { int n = s1 . length ( ); int m = s2 . length ( ); bool dp [ n + 1 ] [ m + 1 ]; for ( int i = 0; i <= n; i ++ ) { for ( int j = 0; j <= m; j ++ ) { dp [ i ] [ j ] = false; } } dp [ 0 ] [ 0 ] = true; for ( int i = 0; i < s1 . length ( ); i ++ ) { for ( int j = 0; j <= s2 . length ( ); j ++ ) { if ( dp [ i ] [ j ] ) { if ( j < s2 . length ( ) && ( toupper ( s1 [ i ] ) == s2 [ j ] ) ) dp [ i + 1 ] [ j + 1 ] = true; if ( ! isupper ( s1 [ i ] ) ) dp [ i + 1 ] [ j ] = true; [MASK] } } return ( dp [ n ] [ m ] ); }ength ( ) && ( toupper ( s1 [ i ] ) == s2 [ j ] ) ) dp [ i + 1 ] [ j + 1 ] = true;
if ( ! isupper ( s1 [ i ] ) ) dp [ i + 1 ] [ j ] = true;
}
}
}
return ( dp [ n ] [ m ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"daBcd","417514","010000","ZcKYguiMrdyn","argaju","1110101101","ySOCoSaygi","204","10011100000010","nMAioozPmY"};
vector<string> param1 {"ABC","9","1111011010","iz","RAJ","110101001","aRhxkYqh","6986871066","0","WZFdDKw"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) ++",
"b) ]",
"c) ],",
"d) =",
"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 num ) {
int n = num . length ( );
int sum = accumulate ( begin ( num ), end ( num ), 0 ) - '0' * 1;
if ( sum % 3 == 0 ) return 0;
if ( n == 1 ) return - 1;
for ( int i = 0;
i < n;
i ++ ) if ( sum % 3 == ( num [ i ] - '0' ) % 3 ) return 1;
if ( n == 2 ) return - 1;
return 2;
}
* 1;
if ( sum % 3 == 0 ) return 0;
if ( n == 1 ) return - 1;
for ( int i = 0;
i < n;
i ++ ) if ( sum % 3 == ( num [ i ] - '0' ) % 3 ) return 1;
if ( n == 2 ) return - 1;
return 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"wVVe","850390909067","1110","NRSAazejUS","297975","1","ThYMuVOm","1874418087476","11011001001","YJ"};
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 n = num . length ( ); int sum = accumulate ( begin ( num ), end ( num ), 0 ) - '0' * 1; if ( sum % 3 == 0 ) [MASK] 0; if ( n == 1 ) return - 1; for ( int i = 0; i < n; i ++ ) if ( sum % 3 == ( num [ i ] - '0' ) % 3 ) return 1; if ( n == 2 ) return - 1; return 2; } * 1;
if ( sum % 3 == 0 ) return 0;
if ( n == 1 ) return - 1;
for ( int i = 0;
i < n;
i ++ ) if ( sum % 3 == ( num [ i ] - '0' ) % 3 ) return 1;
if ( n == 2 ) return - 1;
return 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"wVVe","850390909067","1110","NRSAazejUS","297975","1","ThYMuVOm","1874418087476","11011001001","YJ"};
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) int",
"b) ;",
"c) [",
"d) long",
"e) return"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int i, int n ) {
if ( i > ( n - 2 ) / 2 ) return true;
if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_gold ( arr, 2 * i + 1, n ) && f_gold ( arr, 2 * i + 2, n ) ) return true;
return false;
}
n - 2 ) / 2 ) return true;
if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_gold ( arr, 2 * i + 1, n ) && f_gold ( arr, 2 * i + 2, n ) ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,5,24,24,25,25,36,37,37,39,42,44,46,50,51,54,56,60,62,70,71,73,75,80,80,85,86,89,91,95,99},{-44,-58,88,-42,42,-14,-44,42,64,94,-46,-70,34,-10,-46,-52,-6,-78,64,56,74,98,-34,-4,-92,6,-52,-20,78,-72,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,2,1,34,21,37,49,31,70,97,87,50,76,55},{-94,-84,-82,-66,-64,-62,-56,-38,-24,-24,-4,2,4,4,8,14,16,20,30,34,34,48,58,58,70,76,78,86,88,96,98},{1,0,1,0,1,1,1,1,1,0,0,0,1,0,1,1,0,0},{5,20,30,5,10,21,5},{50,20,30,5,10,21,5},{50,20,30,5,10,21,5},{50,20,30,5,10,21,5}};
vector<int> param1 {0,0,0,0,29,12,0,0,2,7};
vector<int> param2 {18,27,20,8,26,11,7,7,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; bool f_gold ( int arr [ ], int i, int n ) { if ( i > ( n [MASK] 2 ) / 2 ) return true; if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_gold ( arr, 2 * i + 1, n ) && f_gold ( arr, 2 * i + 2, n ) ) return true; return false; } n - 2 ) / 2 ) return true;
if ( arr [ i ] >= arr [ 2 * i + 1 ] && arr [ i ] >= arr [ 2 * i + 2 ] && f_gold ( arr, 2 * i + 1, n ) && f_gold ( arr, 2 * i + 2, n ) ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,5,24,24,25,25,36,37,37,39,42,44,46,50,51,54,56,60,62,70,71,73,75,80,80,85,86,89,91,95,99},{-44,-58,88,-42,42,-14,-44,42,64,94,-46,-70,34,-10,-46,-52,-6,-78,64,56,74,98,-34,-4,-92,6,-52,-20,78,-72,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,2,1,34,21,37,49,31,70,97,87,50,76,55},{-94,-84,-82,-66,-64,-62,-56,-38,-24,-24,-4,2,4,4,8,14,16,20,30,34,34,48,58,58,70,76,78,86,88,96,98},{1,0,1,0,1,1,1,1,1,0,0,0,1,0,1,1,0,0},{5,20,30,5,10,21,5},{50,20,30,5,10,21,5},{50,20,30,5,10,21,5},{50,20,30,5,10,21,5}};
vector<int> param1 {0,0,0,0,29,12,0,0,2,7};
vector<int> param2 {18,27,20,8,26,11,7,7,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) i",
"b) )",
"c) java.lang.*;",
"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 n ) {
int * dp = new int [ n + 1 ];
dp [ 0 ] = 0;
dp [ 1 ] = 1;
dp [ 2 ] = 2;
dp [ 3 ] = 3;
for ( int i = 4;
i <= n;
i ++ ) {
dp [ i ] = i;
for ( int x = 1;
x <= ceil ( sqrt ( i ) );
x ++ ) {
int temp = x * x;
if ( temp > i ) break;
else dp [ i ] = min ( dp [ i ], 1 + dp [ i - temp ] );
}
}
int res = dp [ n ];
delete [ ] dp;
return res;
}
) );
x ++ ) {
int temp = x * x;
if ( temp > i ) break;
else dp [ i ] = min ( dp [ i ], 1 + dp [ i - temp ] );
}
}
int res = dp [ n ];
delete [ ] dp;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {16,33,47,98,36,81,55,19,4,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int * dp = new int [ n + 1 ]; dp [ 0 ] = 0; dp [ 1 ] = 1; dp [ 2 ] = 2; dp [ 3 ] = 3; for ( int i = 4; i <= n; i ++ ) { dp [ i ] = i; for ( int x = 1; x <= ceil ( sqrt ( i ) ); x ++ ) { int temp = x * x; if ( temp > i ) break; else dp [ i ] = min ( dp [ i ], 1 + dp [ i - temp ] ); } } int res = dp [ n [MASK] delete [ ] dp; return res; }) );
x ++ ) {
int temp = x * x;
if ( temp > i ) break;
else dp [ i ] = min ( dp [ i ], 1 + dp [ i - temp ] );
}
}
int res = dp [ n ];
delete [ ] dp;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {16,33,47,98,36,81,55,19,4,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ]; | [
"a) ord",
"b) res;",
"c) ];",
"d) divisor",
"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 ( string str ) {
int zeros = 0, ones = 0;
for ( char ch : str ) ( ch == '0' ) ? ++ zeros : ++ ones;
return ( zeros == 1 || ones == 1 );
}
ude <bits/stdc++.h>
using namespace std;
bool f_gold ( string str ) {
int zeros = 0, ones = 0;
for ( char ch : str ) ( ch == '0' ) ? ++ zeros : ++ ones;
return ( zeros == 1 || ones == 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"00001","0000","11","111110","1","111010111010","hUInqJXNdbfP","5191","1110101101","NupSrU xz"};
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> [MASK] <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str ) { int zeros = 0, ones = 0; for ( char ch : str ) ( ch == '0' ) ? ++ zeros : ++ ones; return ( zeros == 1 || ones == 1 ); }ude <bits/stdc++.h>
using namespace std;
bool f_gold ( string str ) {
int zeros = 0, ones = 0;
for ( char ch : str ) ( ch == '0' ) ? ++ zeros : ++ ones;
return ( zeros == 1 || ones == 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"00001","0000","11","111110","1","111010111010","hUInqJXNdbfP","5191","1110101101","NupSrU xz"};
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) #include",
"c) );",
"d) [",
"e) j"
] | 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, j = 0;
if ( m < n ) return 0;
sort ( arr1, arr1 + m );
sort ( arr2, arr2 + n );
while ( i < n && j < m ) {
if ( arr1 [ j ] < arr2 [ i ] ) j ++;
else if ( arr1 [ j ] == arr2 [ i ] ) {
j ++;
i ++;
}
else if ( arr1 [ j ] > arr2 [ i ] ) return 0;
}
return ( i < n ) ? false : true;
}
arr1 [ j ] < arr2 [ i ] ) j ++;
else if ( arr1 [ j ] == arr2 [ i ] ) {
j ++;
i ++;
}
else if ( arr1 [ j ] > arr2 [ i ] ) return 0;
}
return ( i < n ) ? false : true;
}
//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 [MASK] ( int arr1 [ ], int arr2 [ ], int m, int n ) { int i = 0, j = 0; if ( m < n ) return 0; sort ( arr1, arr1 + m ); sort ( arr2, arr2 + n ); while ( i < n && j < m ) { if ( arr1 [ j ] < arr2 [ i ] ) j ++; else if ( arr1 [ j ] == arr2 [ i ] ) { j ++; i ++; } else if ( arr1 [ j ] > arr2 [ i ] ) return 0; } return ( i < n ) ? false : true; } arr1 [ j ] < arr2 [ i ] ) j ++;
else if ( arr1 [ j ] == arr2 [ i ] ) {
j ++;
i ++;
}
else if ( arr1 [ j ] > arr2 [ i ] ) return 0;
}
return ( i < n ) ? false : true;
}
//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;
} | f_gold | [
"a) (",
"b) (",
"c) cmpfunc);}",
"d) f_gold",
"e) len"
] | 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 res = 1;
for ( int i = 0;
i < n && arr [ i ] <= res;
i ++ ) res = res + arr [ i ];
return res;
}
ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int res = 1;
for ( int i = 0;
i < n && arr [ i ] <= res;
i ++ ) res = res + arr [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,23,24,41,48,58,72,75},{-14,-82,12,-14,-38,12,40,12,-74,42,-36,64},{0,0,1,1,1,1},{17,89,44},{-94,-92,-84,-82,-72,-58,-56,-40,-34,-34,-24,-22,-8,-8,12,14,16,16,22,22,34,46,54,58,68,72,74,78,88,96},{0,0,0,0,0,1,0,0,1,0,1,0},{2,12,13,13,13,16,28,32,34,41,41,47,49,49,50,52,58,61,63,65,67,68,68,74,80,80,84,84,89,93,94,98,99,99},{-54},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{42,50,76,45,6,63,46,73,65,70,87,5,41,63,96,75,38,76,27,7,71,9,65,44,76,37,94,52,55,3,38,68,45,15,35,90,36,46,13,92,32,22,49,35,83}};
vector<int> param1 {4,8,5,2,25,8,23,0,33,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 arr [ ], int n ) { [MASK] res = 1; for ( int i = 0; i < n && arr [ i ] <= res; i ++ ) res = res + arr [ i ]; return res; }ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int res = 1;
for ( int i = 0;
i < n && arr [ i ] <= res;
i ++ ) res = res + arr [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,23,24,41,48,58,72,75},{-14,-82,12,-14,-38,12,40,12,-74,42,-36,64},{0,0,1,1,1,1},{17,89,44},{-94,-92,-84,-82,-72,-58,-56,-40,-34,-34,-24,-22,-8,-8,12,14,16,16,22,22,34,46,54,58,68,72,74,78,88,96},{0,0,0,0,0,1,0,0,1,0,1,0},{2,12,13,13,13,16,28,32,34,41,41,47,49,49,50,52,58,61,63,65,67,68,68,74,80,80,84,84,89,93,94,98,99,99},{-54},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{42,50,76,45,6,63,46,73,65,70,87,5,41,63,96,75,38,76,27,7,71,9,65,44,76,37,94,52,55,3,38,68,45,15,35,90,36,46,13,92,32,22,49,35,83}};
vector<int> param1 {4,8,5,2,25,8,23,0,33,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;
} | int | [
"a) min(int",
"b) int",
"c) f_gold",
"d) sizeof",
"e) ]"
] | b |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.