type
stringclasses 4
values | content_without_mask
stringlengths 610
1.37M
| content_masked
stringlengths 609
1.37M
| label
stringclasses 362
values | options
sequencelengths 5
5
| correct
stringclasses 5
values |
---|---|---|---|---|---|
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int m, int x [ ], int revenue [ ], int n, int t ) {
int maxRev [ m + 1 ];
memset ( maxRev, 0, sizeof ( maxRev ) );
int nxtbb = 0;
for ( int i = 1;
i <= m;
i ++ ) {
if ( nxtbb < n ) {
if ( x [ nxtbb ] != i ) maxRev [ i ] = maxRev [ i - 1 ];
else {
if ( i <= t ) maxRev [ i ] = max ( maxRev [ i - 1 ], revenue [ nxtbb ] );
else maxRev [ i ] = max ( maxRev [ i - t - 1 ] + revenue [ nxtbb ], maxRev [ i - 1 ] );
nxtbb ++;
}
}
else maxRev [ i ] = maxRev [ i - 1 ];
}
return maxRev [ m ];
}
else maxRev [ i ] = max ( maxRev [ i - t - 1 ] + revenue [ nxtbb ], maxRev [ i - 1 ] );
nxtbb ++;
}
}
else maxRev [ i ] = maxRev [ i - 1 ];
}
return maxRev [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {16,39,5,10,14,32,2,22,15,8};
vector<vector<int>> param1 {{6,15,15,18,23,29,32,36,37,39,40,41,44,49,51,52,53,57,66,68,82,89,96},{76,60,88,46,-20,-78,-22,54,-18,92,-42,-66,-90,-72,-48,22,-72,-42,-46,94,82,-78,14,86,10,-64,-78,66,78,-36,50,-20,-40,-12,10,-46,56,-18,4,-76,-64,74,22,34,4,-2},{0,0,0,1,1,1,1,1,1,1},{21,69,30,10,71,72,71,78,30,9,72,10,7,87,30,46,56,74,73,60,86},{-76,-76,-66,-64,-62,-60,-52,-48,-42,-28,-14,-6,-6,16,20,20,38,46,58,60,70,72,86,98},{1,1,0,0,0,0,0,0,1,1,1,1,1,0,1,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,0,1,1,0,1,0,1},{16,38,72,82},{28,-76,42,-2,30,-10,52,66,26,96,96,-72,26,-86,-30,-78,32,-32,58,12,-72,8,34,-68,-28,-66},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{95,12,65,97,92,49,94,32,37,97,9,35}};
vector<vector<int>> param2 {{1,2,5,5,24,26,31,32,33,41,57,59,71,75,79,87,87,88,92,94,96,96,99},{28,8,-60,84,68,-54,-56,0,-68,-84,-6,92,-80,-24,86,-6,-44,82,74,90,-46,40,62,50,-42,38,78,94,46,-14,-48,66,70,52,10,-88,54,-10,98,34,16,-2,-62,-56,-40,86},{0,0,0,0,0,0,0,1,1,1},{72,45,7,30,76,35,75,72,4,7,55,56,7,52,48,27,11,76,66,48,33},{-90,-82,-78,-76,-74,-52,-48,-44,-44,-40,-38,-14,-6,10,20,38,38,40,44,48,52,54,76,78},{0,1,0,1,0,0,0,1,0,0,0,1,0,1,1,0,1,1,0,1,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,1},{15,34,56,74},{68,-38,34,20,40,78,52,80,58,-12,-18,10,40,34,20,-32,-8,-46,8,62,94,-30,-94,26,-40,64},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{25,32,14,49,90,37,92,1,8,75,50,9}};
vector<int> param3 {12,25,9,18,15,28,2,13,25,9};
vector<int> param4 {12,27,6,20,17,36,3,16,15,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i],param4[i]) == f_gold(param0[i],¶m1[i].front(),¶m2[i].front(),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 m, int x [ ], int revenue [ ], int n, int t ) { int maxRev [ m + 1 ]; memset ( maxRev, 0, sizeof ( maxRev ) [MASK] int nxtbb = 0; for ( int i = 1; i <= m; i ++ ) { if ( nxtbb < n ) { if ( x [ nxtbb ] != i ) maxRev [ i ] = maxRev [ i - 1 ]; else { if ( i <= t ) maxRev [ i ] = max ( maxRev [ i - 1 ], revenue [ nxtbb ] ); else maxRev [ i ] = max ( maxRev [ i - t - 1 ] + revenue [ nxtbb ], maxRev [ i - 1 ] ); nxtbb ++; } } else maxRev [ i ] = maxRev [ i - 1 ]; } return maxRev [ m ]; } else maxRev [ i ] = max ( maxRev [ i - t - 1 ] + revenue [ nxtbb ], maxRev [ i - 1 ] );
nxtbb ++;
}
}
else maxRev [ i ] = maxRev [ i - 1 ];
}
return maxRev [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {16,39,5,10,14,32,2,22,15,8};
vector<vector<int>> param1 {{6,15,15,18,23,29,32,36,37,39,40,41,44,49,51,52,53,57,66,68,82,89,96},{76,60,88,46,-20,-78,-22,54,-18,92,-42,-66,-90,-72,-48,22,-72,-42,-46,94,82,-78,14,86,10,-64,-78,66,78,-36,50,-20,-40,-12,10,-46,56,-18,4,-76,-64,74,22,34,4,-2},{0,0,0,1,1,1,1,1,1,1},{21,69,30,10,71,72,71,78,30,9,72,10,7,87,30,46,56,74,73,60,86},{-76,-76,-66,-64,-62,-60,-52,-48,-42,-28,-14,-6,-6,16,20,20,38,46,58,60,70,72,86,98},{1,1,0,0,0,0,0,0,1,1,1,1,1,0,1,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,0,1,1,0,1,0,1},{16,38,72,82},{28,-76,42,-2,30,-10,52,66,26,96,96,-72,26,-86,-30,-78,32,-32,58,12,-72,8,34,-68,-28,-66},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{95,12,65,97,92,49,94,32,37,97,9,35}};
vector<vector<int>> param2 {{1,2,5,5,24,26,31,32,33,41,57,59,71,75,79,87,87,88,92,94,96,96,99},{28,8,-60,84,68,-54,-56,0,-68,-84,-6,92,-80,-24,86,-6,-44,82,74,90,-46,40,62,50,-42,38,78,94,46,-14,-48,66,70,52,10,-88,54,-10,98,34,16,-2,-62,-56,-40,86},{0,0,0,0,0,0,0,1,1,1},{72,45,7,30,76,35,75,72,4,7,55,56,7,52,48,27,11,76,66,48,33},{-90,-82,-78,-76,-74,-52,-48,-44,-44,-40,-38,-14,-6,10,20,38,38,40,44,48,52,54,76,78},{0,1,0,1,0,0,0,1,0,0,0,1,0,1,1,0,1,1,0,1,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,0,1},{15,34,56,74},{68,-38,34,20,40,78,52,80,58,-12,-18,10,40,34,20,-32,-8,-46,8,62,94,-30,-94,26,-40,64},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{25,32,14,49,90,37,92,1,8,75,50,9}};
vector<int> param3 {12,25,9,18,15,28,2,13,25,9};
vector<int> param4 {12,27,6,20,17,36,3,16,15,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i],param4[i]) == f_gold(param0[i],¶m1[i].front(),¶m2[i].front(),param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ); | [
"a) static",
"b) )",
"c) );",
"d) r",
"e) *"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int count = 0;
while ( n ) {
count += n & 1;
n >>= 1;
}
return count;
}
de <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int count = 0;
while ( n ) {
count += n & 1;
n >>= 1;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,92,73,52,24,14,58,11,8,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include [MASK] #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { unsigned int count = 0; while ( n ) { count += n & 1; n >>= 1; } return count; }de <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int count = 0;
while ( n ) {
count += n & 1;
n >>= 1;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,92,73,52,24,14,58,11,8,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <iostream> | [
"a) f_gold",
"b) <iostream>",
"c) i",
"d) if",
"e) )"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int N, int K ) {
sort ( arr, arr + N );
int dp [ N ];
dp [ 0 ] = 0;
for ( int i = 1;
i < N;
i ++ ) {
dp [ i ] = dp [ i - 1 ];
if ( arr [ i ] - arr [ i - 1 ] < K ) {
if ( i >= 2 ) dp [ i ] = max ( dp [ i ], dp [ i - 2 ] + arr [ i ] + arr [ i - 1 ] );
else dp [ i ] = max ( dp [ i ], arr [ i ] + arr [ i - 1 ] );
}
}
return dp [ N - 1 ];
}
) {
if ( i >= 2 ) dp [ i ] = max ( dp [ i ], dp [ i - 2 ] + arr [ i ] + arr [ i - 1 ] );
else dp [ i ] = max ( dp [ i ], arr [ i ] + arr [ i - 1 ] );
}
}
return dp [ N - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{48,53,67,78,78,93,95},{-2,52,18,70,32,88,-70,-32,72,30},{0,0,0,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},{98,84,13,61,58,90,45,89,45,80,3,5,57,86,40,80,60,51,60,73,67,10,52,56,60,36,34,60,75,63,23,86,51,68,86,13,71,86,99,6,42,2,39,82,16,5,23,47,12},{-84,-56,68,78},{0,0,1,0,0,1,1,0,0,0,1,0,1,1,1,1,0},{1,2,3,9,12,12,16,17,18,19,20,21,21,26,29,42,44,45,48,48,48,54,54,55,60,63,63,64,64,67,67,68,69,74,78,78,79,83,95,95,95,96,97,99},{40,-48,-14,64,-58,60,-42,-56,54,28,-16,-92,42},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{64,25,96}};
vector<int> param1 {6,8,37,31,3,14,27,9,21,1};
vector<int> param2 {4,8,31,37,3,9,42,8,19,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int N, int K ) { sort ( arr, arr + N ); int dp [MASK] N ]; dp [ 0 ] = 0; for ( int i = 1; i < N; i ++ ) { dp [ i ] = dp [ i - 1 ]; if ( arr [ i ] - arr [ i - 1 ] < K ) { if ( i >= 2 ) dp [ i ] = max ( dp [ i ], dp [ i - 2 ] + arr [ i ] + arr [ i - 1 ] ); else dp [ i ] = max ( dp [ i ], arr [ i ] + arr [ i - 1 ] ); } } return dp [ N - 1 ]; }) {
if ( i >= 2 ) dp [ i ] = max ( dp [ i ], dp [ i - 2 ] + arr [ i ] + arr [ i - 1 ] );
else dp [ i ] = max ( dp [ i ], arr [ i ] + arr [ i - 1 ] );
}
}
return dp [ N - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{48,53,67,78,78,93,95},{-2,52,18,70,32,88,-70,-32,72,30},{0,0,0,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},{98,84,13,61,58,90,45,89,45,80,3,5,57,86,40,80,60,51,60,73,67,10,52,56,60,36,34,60,75,63,23,86,51,68,86,13,71,86,99,6,42,2,39,82,16,5,23,47,12},{-84,-56,68,78},{0,0,1,0,0,1,1,0,0,0,1,0,1,1,1,1,0},{1,2,3,9,12,12,16,17,18,19,20,21,21,26,29,42,44,45,48,48,48,54,54,55,60,63,63,64,64,67,67,68,69,74,78,78,79,83,95,95,95,96,97,99},{40,-48,-14,64,-58,60,-42,-56,54,28,-16,-92,42},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{64,25,96}};
vector<int> param1 {6,8,37,31,3,14,27,9,21,1};
vector<int> param2 {4,8,31,37,3,9,42,8,19,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) }",
"b) javafx.util.Pair;",
"c) [",
"d) return",
"e) cmpfunc);}"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
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 {79,95,84,12,72,67,82,14,2,69};
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 [MASK] 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 {79,95,84,12,72,67,82,14,2,69};
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;
} | namespace | [
"a) +=",
"b) 45;",
"c) {",
"d) namespace",
"e) x:"
] | 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 str ) {
int n = str . length ( );
int res = 0;
int count [ 26 ] = {
0 };
for ( int i = 0;
i < n;
i ++ ) count [ str [ i ] - 'a' ] ++;
for ( int i = 0;
i < 26;
i ++ ) if ( count [ i ] % 2 == 1 ) res ++;
return ( res == 0 ) ? 0 : res - 1;
}
for ( int i = 0;
i < n;
i ++ ) count [ str [ i ] - 'a' ] ++;
for ( int i = 0;
i < 26;
i ++ ) if ( count [ i ] % 2 == 1 ) res ++;
return ( res == 0 ) ? 0 : res - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeksforgeeks","58972","1110","JgQvAOhh","33","0110110","ZvxDIS","0936576628","00","cX"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace [MASK] int f_gold ( string str ) { int n = str . length ( ); int res = 0; int count [ 26 ] = { 0 }; for ( int i = 0; i < n; i ++ ) count [ str [ i ] - 'a' ] ++; for ( int i = 0; i < 26; i ++ ) if ( count [ i ] % 2 == 1 ) res ++; return ( res == 0 ) ? 0 : res - 1; } for ( int i = 0;
i < n;
i ++ ) count [ str [ i ] - 'a' ] ++;
for ( int i = 0;
i < 26;
i ++ ) if ( count [ i ] % 2 == 1 ) res ++;
return ( res == 0 ) ? 0 : res - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeksforgeeks","58972","1110","JgQvAOhh","33","0110110","ZvxDIS","0936576628","00","cX"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | std; | [
"a) int",
"b) std;",
"c) ]",
"d) back_up",
"e) return"
] | 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 odd_count = 0;
int even_count = 0;
if ( n < 0 ) n = - n;
if ( n == 0 ) return 1;
if ( n == 1 ) return 0;
while ( n ) {
if ( n & 1 ) odd_count ++;
if ( n & 2 ) even_count ++;
n = n >> 2;
}
return f_gold ( abs ( odd_count - even_count ) );
}
== 0 ) return 1;
if ( n == 1 ) return 0;
while ( n ) {
if ( n & 1 ) odd_count ++;
if ( n & 2 ) even_count ++;
n = n >> 2;
}
return f_gold ( abs ( odd_count - even_count ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,94,79,39,16,90,64,76,83,47};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int odd_count = 0; int even_count = 0; if ( n < 0 ) n = - n; if ( n == 0 ) return 1; if ( n == 1 ) return 0; while ( [MASK] ) { if ( n & 1 ) odd_count ++; if ( n & 2 ) even_count ++; n = n >> 2; } return f_gold ( abs ( odd_count - even_count ) ); } == 0 ) return 1;
if ( n == 1 ) return 0;
while ( n ) {
if ( n & 1 ) odd_count ++;
if ( n & 2 ) even_count ++;
n = n >> 2;
}
return f_gold ( abs ( odd_count - even_count ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,94,79,39,16,90,64,76,83,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;
} | n | [
"a) {",
"b) ]",
"c) n",
"d) <fstream>",
"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 insert, int remove, int copy ) {
if ( N == 0 ) return 0;
if ( N == 1 ) return insert;
int dp [ N + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 1;
i <= N;
i ++ ) {
if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove );
}
return dp [ N ];
}
if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove );
}
return dp [ N ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,66,98,63,99,45,60,11,96,54};
vector<int> param1 {75,68,55,4,37,28,53,96,95,6};
vector<int> param2 {12,32,69,41,98,59,40,50,48,50};
vector<int> param3 {45,41,5,12,55,7,52,50,84,82};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i],param3[i]) == f_gold(param0[i],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 N, int insert, int remove, int copy ) [MASK] if ( N == 0 ) return 0; if ( N == 1 ) return insert; int dp [ N + 1 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 1; i <= N; i ++ ) { if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy ); else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove ); } return dp [ N ]; } if ( i % 2 == 0 ) dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ i / 2 ] + copy );
else dp [ i ] = min ( dp [ i - 1 ] + insert, dp [ ( i + 1 ) / 2 ] + copy + remove );
}
return dp [ N ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,66,98,63,99,45,60,11,96,54};
vector<int> param1 {75,68,55,4,37,28,53,96,95,6};
vector<int> param2 {12,32,69,41,98,59,40,50,48,50};
vector<int> param3 {45,41,5,12,55,7,52,50,84,82};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i],param3[i]) == f_gold(param0[i],param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) )",
"b) {",
"c) n",
"d) n",
"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 = arr [ 0 ], start = 0, i;
for ( i = 1;
i <= n;
i ++ ) {
while ( curr_sum > sum && start < i - 1 ) {
curr_sum = curr_sum - arr [ start ];
start ++;
}
if ( curr_sum == sum ) {
cout << "Sum found between indexes " << start << " and " << i - 1;
return 1;
}
if ( i < n ) curr_sum = curr_sum + arr [ i ];
}
cout << "No subarray found";
return 0;
}
{
cout << "Sum found between indexes " << start << " and " << i - 1;
return 1;
}
if ( i < n ) curr_sum = curr_sum + arr [ i ];
}
cout << "No subarray found";
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,7,8,8,23,24,28,32,48,53,56,62,69,77,81,82,84,87,88,90},{-62,-62,-80,-30,-80,44,-12,-76,16,-52,-86,72,32,-60,-70,-62,-78,-96,-18,40,-4,-18,-58,30,-70,6,0,-62,-66,20,92,-64,20,-48,48,-32,64,22,16,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,25,6,87,55,86,61,97,24,30,51,43,26,1,80,47,19,36,64,62,92,5,48,27,82,76,70,59,1,43,1,36,28,9,52,22,43},{-86,-76,-64,-22,-16,-8,4,6,8,32,38,60,68,74},{0,0,0,0,1,1,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0},{7,7,12,25,25,32,33,34,37,39,39,41,46,48,56,56,57,58,61,62,62,63,65,66,69,72,74,78,78,79,80,85,89,94,95,99},{98,-60},{0,0,0,0,1,1,1,1,1,1},{80,89,83,42,75,30,64,25,95,17,90,6,11,1,77,16,75,86,96,67,27,80,27}};
vector<int> param1 {16,39,40,29,7,31,22,1,8,16};
vector<int> param2 {31,44,7,105,2,10,39,98,0,108};
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 ) { int curr_sum = arr [ 0 ], start = 0, i; for ( i = 1; i <= n; i ++ ) { while ( curr_sum > sum && start < i - 1 ) { curr_sum = curr_sum - arr [ [MASK] ]; start ++; } if ( curr_sum == sum ) { cout << "Sum found between indexes " << start << " and " << i - 1; return 1; } if ( i < n ) curr_sum = curr_sum + arr [ i ]; } cout << "No subarray found"; return 0; } {
cout << "Sum found between indexes " << start << " and " << i - 1;
return 1;
}
if ( i < n ) curr_sum = curr_sum + arr [ i ];
}
cout << "No subarray found";
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,7,8,8,23,24,28,32,48,53,56,62,69,77,81,82,84,87,88,90},{-62,-62,-80,-30,-80,44,-12,-76,16,-52,-86,72,32,-60,-70,-62,-78,-96,-18,40,-4,-18,-58,30,-70,6,0,-62,-66,20,92,-64,20,-48,48,-32,64,22,16,26},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,25,6,87,55,86,61,97,24,30,51,43,26,1,80,47,19,36,64,62,92,5,48,27,82,76,70,59,1,43,1,36,28,9,52,22,43},{-86,-76,-64,-22,-16,-8,4,6,8,32,38,60,68,74},{0,0,0,0,1,1,0,1,0,1,1,1,0,1,1,1,1,1,1,1,1,1,0,0,1,0,1,1,0,1,0,0,0,1,0,1,0,1,1,0,0},{7,7,12,25,25,32,33,34,37,39,39,41,46,48,56,56,57,58,61,62,62,63,65,66,69,72,74,78,78,79,80,85,89,94,95,99},{98,-60},{0,0,0,0,1,1,1,1,1,1},{80,89,83,42,75,30,64,25,95,17,90,6,11,1,77,16,75,86,96,67,27,80,27}};
vector<int> param1 {16,39,40,29,7,31,22,1,8,16};
vector<int> param2 {31,44,7,105,2,10,39,98,0,108};
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;
} | start | [
"a) class",
"b) int",
"c) start",
"d) 1;",
"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 ) {
if ( n == 0 || n == 1 ) return n;
int f1 = 0, f2 = 1, f3 = 1;
while ( f3 <= n ) {
f1 = f2;
f2 = f3;
f3 = f1 + f2;
}
return f2;
}
>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
int f1 = 0, f2 = 1, f3 = 1;
while ( f3 <= n ) {
f1 = f2;
f2 = f3;
f3 = f1 + f2;
}
return f2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {54,71,64,71,96,43,70,94,95,69};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { if ( n [MASK] 0 || n == 1 ) return n; int f1 = 0, f2 = 1, f3 = 1; while ( f3 <= n ) { f1 = f2; f2 = f3; f3 = f1 + f2; } return f2; }>
using namespace std;
int f_gold ( int n ) {
if ( n == 0 || n == 1 ) return n;
int f1 = 0, f2 = 1, f3 = 1;
while ( f3 <= n ) {
f1 = f2;
f2 = f3;
f3 = f1 + f2;
}
return f2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {54,71,64,71,96,43,70,94,95,69};
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) return",
"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 n ) {
int nthElement = 19 + ( n - 1 ) * 9;
int outliersCount = ( int ) log10 ( nthElement ) - 1;
nthElement += 9 * outliersCount;
return nthElement;
}
using namespace std;
int f_gold ( int n ) {
int nthElement = 19 + ( n - 1 ) * 9;
int outliersCount = ( int ) log10 ( nthElement ) - 1;
nthElement += 9 * outliersCount;
return nthElement;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {68,70,69,93,99,44,91,8,83,51};
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 nthElement = 19 + [MASK] n - 1 ) * 9; int outliersCount = ( int ) log10 ( nthElement ) - 1; nthElement += 9 * outliersCount; return nthElement; }using namespace std;
int f_gold ( int n ) {
int nthElement = 19 + ( n - 1 ) * 9;
int outliersCount = ( int ) log10 ( nthElement ) - 1;
nthElement += 9 * outliersCount;
return nthElement;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {68,70,69,93,99,44,91,8,83,51};
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) hash"
] | 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 f [ n + 1 ];
int i;
f [ 0 ] = 0;
f [ 1 ] = 1;
f [ 2 ] = 1;
for ( i = 3;
i <= n;
i ++ ) f [ i ] = f [ f [ i - 1 ] ] + f [ i - f [ i - 1 ] ];
return f [ n ];
}
gold ( int n ) {
int f [ n + 1 ];
int i;
f [ 0 ] = 0;
f [ 1 ] = 1;
f [ 2 ] = 1;
for ( i = 3;
i <= n;
i ++ ) f [ i ] = f [ f [ i - 1 ] ] + f [ i - f [ i - 1 ] ];
return f [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {39,93,3,28,23,95,41,31,46,29};
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 f [ n + 1 ]; int i; f [ 0 ] = 0; f [ 1 ] = 1; f [ 2 ] = 1; for ( i = 3; i <= n; i ++ ) f [ i ] = f [ f [ i - 1 ] ] + f [ i - f [ i - 1 ] ]; return [MASK] [ n ]; }gold ( int n ) {
int f [ n + 1 ];
int i;
f [ 0 ] = 0;
f [ 1 ] = 1;
f [ 2 ] = 1;
for ( i = 3;
i <= n;
i ++ ) f [ i ] = f [ f [ i - 1 ] ] + f [ i - f [ i - 1 ] ];
return f [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {39,93,3,28,23,95,41,31,46,29};
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 | [
"a) int",
"b) Math",
"c) nextHigherOneBit",
"d) while",
"e) f"
] | 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 neg = 0, pos = 0;
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
if ( arr [ i ] < 0 ) neg ++;
else pos ++;
}
return ( sum / abs ( neg - pos ) );
}
{
int neg = 0, pos = 0;
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
if ( arr [ i ] < 0 ) neg ++;
else pos ++;
}
return ( sum / abs ( neg - pos ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,98},{82,66,-68,24,-10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{56,3,18,5,20,56,47,29,60,98,60,40,42,2,54,56,91,8,93,14,31,27,61,49,23,12,71},{-94,-94,-92,-86,-50,-48,-6,8,28,40,44,58,62,72,94},{0,0,1,0,1,0,1,1,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,0,0,0,1,1,1,0,1,0,1},{16,56,56},{74,-90,-92,30,-18,66,-66,22},{0,0,0,1,1,1,1,1,1,1,1,1,1,1},{21,64,82,78,30,34,35}};
vector<int> param1 {1,2,8,25,12,36,1,5,7,5};
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 neg = 0, [MASK] = 0; int sum = 0; for ( int i = 0; i < n; i ++ ) { sum += arr [ i ]; if ( arr [ i ] < 0 ) neg ++; else pos ++; } return ( sum / abs ( neg - pos ) ); } {
int neg = 0, pos = 0;
int sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
if ( arr [ i ] < 0 ) neg ++;
else pos ++;
}
return ( sum / abs ( neg - pos ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{49,98},{82,66,-68,24,-10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1},{56,3,18,5,20,56,47,29,60,98,60,40,42,2,54,56,91,8,93,14,31,27,61,49,23,12,71},{-94,-94,-92,-86,-50,-48,-6,8,28,40,44,58,62,72,94},{0,0,1,0,1,0,1,1,1,0,1,0,0,0,1,0,0,1,0,0,0,1,1,1,1,1,1,1,1,0,1,1,1,0,1,1,1,0,0,0,1,1,1,0,1,0,1},{16,56,56},{74,-90,-92,30,-18,66,-66,22},{0,0,0,1,1,1,1,1,1,1,1,1,1,1},{21,64,82,78,30,34,35}};
vector<int> param1 {1,2,8,25,12,36,1,5,7,5};
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;
} | pos | [
"a) arr",
"b) [",
"c) pos",
"d) k",
"e) *;"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string n ) {
string res = n;
for ( int j = n . length ( ) - 1;
j >= 0;
-- j ) res += n [ j ];
return res;
}
nclude <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string n ) {
string res = n;
for ( int j = n . length ( ) - 1;
j >= 0;
-- j ) res += n [ j ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"lSUhEvxcgfI","77329283","010111111","Stazb","0702","01111111","a","359118754930","11011010010","rznb"};
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 n ) { string res = n; for ( int j = n . length ( ) - 1; j >= 0; -- j ) res += n [MASK] j ]; return res; }nclude <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string n ) {
string res = n;
for ( int j = n . length ( ) - 1;
j >= 0;
-- j ) res += n [ j ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"lSUhEvxcgfI","77329283","010111111","Stazb","0702","01111111","a","359118754930","11011010010","rznb"};
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) 0:",
"c) 1,",
"d) public",
"e) vector"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int count = 0;
for ( int i = 5;
n / i >= 1;
i *= 5 ) count += n / i;
return count;
}
ude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int count = 0;
for ( int i = 5;
n / i >= 1;
i *= 5 ) count += n / i;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,43,50,32,37,51,33,49,1,75};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) [MASK] int count = 0; for ( int i = 5; n / i >= 1; i *= 5 ) count += n / i; return count; }ude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int count = 0;
for ( int i = 5;
n / i >= 1;
i *= 5 ) count += n / i;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,43,50,32,37,51,33,49,1,75};
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) import",
"d) {",
"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 i = str . length ( ) - 1;
int start, end = i + 1;
string result = "";
while ( i >= 0 ) {
if ( str [ i ] == ' ' ) {
start = i + 1;
while ( start != end ) result += str [ start ++ ];
result += ' ';
end = i;
}
i --;
}
start = 0;
while ( start != end ) result += str [ start ++ ];
return result;
}
while ( start != end ) result += str [ start ++ ];
result += ' ';
end = i;
}
i --;
}
start = 0;
while ( start != end ) result += str [ start ++ ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"m Dm YZ",
"65 48 57 71",
"01 010",
"mT vhByi",
"19 44 9 1",
"0",
"z vUi ",
"7 591 36643 9 055",
"01",
"ti YGaijPY"
};
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 [MASK] ) { int i = str . length ( ) - 1; int start, end = i + 1; string result = ""; while ( i >= 0 ) { if ( str [ i ] == ' ' ) { start = i + 1; while ( start != end ) result += str [ start ++ ]; result += ' '; end = i; } i --; } start = 0; while ( start != end ) result += str [ start ++ ]; return result; } while ( start != end ) result += str [ start ++ ];
result += ' ';
end = i;
}
i --;
}
start = 0;
while ( start != end ) result += str [ start ++ ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"m Dm YZ",
"65 48 57 71",
"01 010",
"mT vhByi",
"19 44 9 1",
"0",
"z vUi ",
"7 591 36643 9 055",
"01",
"ti YGaijPY"
};
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;
} | str | [
"a) ;",
"b) )",
"c) *",
"d) )",
"e) str"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n1, int n2 ) {
sort ( arr1, arr1 + n1 );
sort ( arr2, arr2 + n2 );
return arr1 [ n1 - 1 ] * arr2 [ 0 ];
}
de <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n1, int n2 ) {
sort ( arr1, arr1 + n1 );
sort ( arr2, arr2 + n2 );
return arr1 [ n1 - 1 ] * arr2 [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,11,12,12,14,14,15,33,51,51,61,63,68,69,75,83,84,97},{88,-10,-18,74,56,-36,-86,72,76,26,-36,10,-6,-80,-34,14,-82,74,48,-76,-78,-50,-62,-86,96,22,42,-28,18,6,58,-72,54},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{84,2,52,25,38,63,10,44,36,12,67,25,79,36,12,14,14,18,32,8,94,34,9,72,27,44,75,80,28,57,34,67,26,21,53,92,31,87,62},{-64,-60,-36,-36,-34,-32,-18,-16,-2,6,22,36,42,46,52,54,70,94},{0,1,1,1,1,1,1,0,1,1,1,1,1,0,1,0,0,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,0,0,0,0,0,1,0,1,1,0,1,0},{24,36,73},{86,-46,76,66,38,24,-10,-10,-88,-22,54,12,42,20,-6,-44,-26,78,-46,-88,-6,-24,72,-38,26,84,-70,90,56,-4,94,-72,-44,-40,-8,18,4,-72,72,-72,-38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{41,47,59,85,10,38,4,63,74,71,76,32,54,40,20,38,17,76,87,49,53,73,92,90,36,76,1,65,62,10,93,65}};
vector<vector<int>> param1 {{4,4,5,12,16,27,28,41,44,60,73,76,77,90,91,92,96,96},{24,-26,38,28,94,64,-36,42,62,-50,-12,-18,-72,-76,26,-4,44,-98,32,-48,54,-66,-84,16,-12,-30,-58,42,-88,-40,66,-66,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{92,20,7,22,79,50,27,19,2,58,93,19,60,45,16,50,87,31,45,8,89,39,61,76,48,92,22,18,19,35,54,32,81,57,22,29,63,83,20},{-96,-92,-64,-44,-22,-22,-22,-20,6,8,14,16,24,40,46,54,76,78},{0,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,1,1,0,0,0,1,0,0,0,1,1,0,1,1,0,1,0,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1},{5,41,60},{-30,-38,58,-6,-2,-18,34,24,-52,56,-80,-82,20,64,54,-96,70,-78,78,54,6,-4,34,0,90,-74,-50,-40,16,-48,-4,78,80,-98,-12,-64,94,-42,-22,-34,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{62,30,71,1,83,88,62,50,88,80,22,98,62,43,84,21,23,89,78,5,36,21,17,30,54,88,66,48,83,12,4,50}};
vector<int> param2 {10,20,40,32,11,37,2,20,38,26};
vector<int> param3 {15,27,39,19,10,44,2,28,35,22};
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 arr1 [ ], int arr2 [ ], int n1, int n2 ) { sort ( arr1, arr1 [MASK] n1 ); sort ( arr2, arr2 + n2 ); return arr1 [ n1 - 1 ] * arr2 [ 0 ]; }de <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int n1, int n2 ) {
sort ( arr1, arr1 + n1 );
sort ( arr2, arr2 + n2 );
return arr1 [ n1 - 1 ] * arr2 [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,11,12,12,14,14,15,33,51,51,61,63,68,69,75,83,84,97},{88,-10,-18,74,56,-36,-86,72,76,26,-36,10,-6,-80,-34,14,-82,74,48,-76,-78,-50,-62,-86,96,22,42,-28,18,6,58,-72,54},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{84,2,52,25,38,63,10,44,36,12,67,25,79,36,12,14,14,18,32,8,94,34,9,72,27,44,75,80,28,57,34,67,26,21,53,92,31,87,62},{-64,-60,-36,-36,-34,-32,-18,-16,-2,6,22,36,42,46,52,54,70,94},{0,1,1,1,1,1,1,0,1,1,1,1,1,0,1,0,0,1,1,1,0,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,0,0,0,0,0,1,0,1,1,0,1,0},{24,36,73},{86,-46,76,66,38,24,-10,-10,-88,-22,54,12,42,20,-6,-44,-26,78,-46,-88,-6,-24,72,-38,26,84,-70,90,56,-4,94,-72,-44,-40,-8,18,4,-72,72,-72,-38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{41,47,59,85,10,38,4,63,74,71,76,32,54,40,20,38,17,76,87,49,53,73,92,90,36,76,1,65,62,10,93,65}};
vector<vector<int>> param1 {{4,4,5,12,16,27,28,41,44,60,73,76,77,90,91,92,96,96},{24,-26,38,28,94,64,-36,42,62,-50,-12,-18,-72,-76,26,-4,44,-98,32,-48,54,-66,-84,16,-12,-30,-58,42,-88,-40,66,-66,30},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{92,20,7,22,79,50,27,19,2,58,93,19,60,45,16,50,87,31,45,8,89,39,61,76,48,92,22,18,19,35,54,32,81,57,22,29,63,83,20},{-96,-92,-64,-44,-22,-22,-22,-20,6,8,14,16,24,40,46,54,76,78},{0,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,1,1,0,0,0,1,0,0,0,1,1,0,1,1,0,1,0,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1},{5,41,60},{-30,-38,58,-6,-2,-18,34,24,-52,56,-80,-82,20,64,54,-96,70,-78,78,54,6,-4,34,0,90,-74,-50,-40,16,-48,-4,78,80,-98,-12,-64,94,-42,-22,-34,96},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{62,30,71,1,83,88,62,50,88,80,22,98,62,43,84,21,23,89,78,5,36,21,17,30,54,88,66,48,83,12,4,50}};
vector<int> param2 {10,20,40,32,11,37,2,20,38,26};
vector<int> param3 {15,27,39,19,10,44,2,28,35,22};
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) [",
"b) m",
"c) ==",
"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 result = 0;
for ( int i = 1;
i <= 9;
i ++ ) {
stack < int > s;
if ( i <= n ) {
s . push ( i );
result ++;
}
while ( ! s . empty ( ) ) {
int tp = s . top ( );
s . pop ( );
for ( int j = tp % 10;
j <= 9;
j ++ ) {
int x = tp * 10 + j;
if ( x <= n ) {
s . push ( x );
result ++;
}
}
}
}
return result;
}
r ( int j = tp % 10;
j <= 9;
j ++ ) {
int x = tp * 10 + j;
if ( x <= n ) {
s . push ( x );
result ++;
}
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {69,72,88,7,66,34,23,37,33,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 result = 0; for [MASK] int i = 1; i <= 9; i ++ ) { stack < int > s; if ( i <= n ) { s . push ( i ); result ++; } while ( ! s . empty ( ) ) { int tp = s . top ( ); s . pop ( ); for ( int j = tp % 10; j <= 9; j ++ ) { int x = tp * 10 + j; if ( x <= n ) { s . push ( x ); result ++; } } } } return result; }r ( int j = tp % 10;
j <= 9;
j ++ ) {
int x = tp * 10 + j;
if ( x <= n ) {
s . push ( x );
result ++;
}
}
}
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {69,72,88,7,66,34,23,37,33,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) 1",
"b) yCount",
"c) ++",
"d) 1",
"e) ("
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
string tmp = str + str;
int n = str . length ( );
for ( int i = 1;
i <= n;
i ++ ) {
string substring = tmp . substr ( i, str . size ( ) );
if ( str == substring ) return i;
}
return n;
}
= str + str;
int n = str . length ( );
for ( int i = 1;
i <= n;
i ++ ) {
string substring = tmp . substr ( i, str . size ( ) );
if ( str == substring ) return i;
}
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"vdevdNdQSopPtj","5","100010101011","tlDOvJHAyMllu","06","101","DYgtU","4","00","Dt"};
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] str ) { string tmp = str + str; int n = str . length ( ); for ( int i = 1; i <= n; i ++ ) { string substring = tmp . substr ( i, str . size ( ) ); if ( str == substring ) return i; } return n; } = str + str;
int n = str . length ( );
for ( int i = 1;
i <= n;
i ++ ) {
string substring = tmp . substr ( i, str . size ( ) );
if ( str == substring ) return i;
}
return n;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"vdevdNdQSopPtj","5","100010101011","tlDOvJHAyMllu","06","101","DYgtU","4","00","Dt"};
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) string",
"b) ]",
"c) sort",
"d) j",
"e) 2"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n, int x ) {
if ( n < 2 ) return false;
unordered_set < int > s;
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == 0 ) {
if ( x == 0 ) return true;
else continue;
}
if ( x % arr [ i ] == 0 ) {
if ( s . find ( x / arr [ i ] ) != s . end ( ) ) return true;
s . insert ( arr [ i ] );
}
}
return false;
}
urn true;
else continue;
}
if ( x % arr [ i ] == 0 ) {
if ( s . find ( x / arr [ i ] ) != s . end ( ) ) return true;
s . insert ( arr [ i ] );
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,7,23,23,25,27,37,42,53,56,58,61,69,78,79,84,85,86,90,93,95},{-10,-18,88,-36,78,66,-70,-34,-88,-98,-70,-4,-94,-92,-76,-78,-30,-48,-72,86,-64,38,-80,20,70,-32,-90,74,-78,12,-54,88,38,-96,28},{0,0,0,0,0,0,0,0,1,1},{83,61,55,89,16,78,44,54,22,49,58,62,53,99,35,83,29,19,96,39,60,6,34,67,43,29,46,3,81,78,80,39,86,78,21},{-96,-88,-80,-62,-58,-56,-54,-52,-34,-20,-6,-2,6,20,52,54,70,72,80,82,94},{0,1,1,0,0,1,1,1},{8,11,11,20,22,23,26,27,31,38,40,40,45,46,46,48,50,61,73,76,78,78,79,80,81,84,90,91,93,95},{18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,37,47,40,72,59,51,53,92,3,21,81,29,48,97,59,10,74,11,37,49,95,88,85,6,26,76,33}};
vector<int> param1 {15,17,9,23,18,4,24,0,37,22};
vector<int> param2 {17,22,5,27,12,6,28,0,39,21};
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 n, int x ) { if ( n < 2 ) return false; unordered_set < int > s; for ( int i = 0; i < n; i ++ ) { if ( arr [ i ] == 0 ) { if ( x == 0 ) return true; else continue; } if ( x % arr [ i ] == 0 ) { if ( s . find ( x / arr [ i ] ) != s . end ( ) ) return true; s . insert ( arr [ i ] ); } } return [MASK] }urn true;
else continue;
}
if ( x % arr [ i ] == 0 ) {
if ( s . find ( x / arr [ i ] ) != s . end ( ) ) return true;
s . insert ( arr [ i ] );
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,3,7,23,23,25,27,37,42,53,56,58,61,69,78,79,84,85,86,90,93,95},{-10,-18,88,-36,78,66,-70,-34,-88,-98,-70,-4,-94,-92,-76,-78,-30,-48,-72,86,-64,38,-80,20,70,-32,-90,74,-78,12,-54,88,38,-96,28},{0,0,0,0,0,0,0,0,1,1},{83,61,55,89,16,78,44,54,22,49,58,62,53,99,35,83,29,19,96,39,60,6,34,67,43,29,46,3,81,78,80,39,86,78,21},{-96,-88,-80,-62,-58,-56,-54,-52,-34,-20,-6,-2,6,20,52,54,70,72,80,82,94},{0,1,1,0,0,1,1,1},{8,11,11,20,22,23,26,27,31,38,40,40,45,46,46,48,50,61,73,76,78,78,79,80,81,84,90,91,93,95},{18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,37,47,40,72,59,51,53,92,3,21,81,29,48,97,59,10,74,11,37,49,95,88,85,6,26,76,33}};
vector<int> param1 {15,17,9,23,18,4,24,0,37,22};
vector<int> param2 {17,22,5,27,12,6,28,0,39,21};
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;
} | false; | [
"a) i",
"b) #include",
"c) =",
"d) false;",
"e) 0"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int k, string s1, string s2 ) {
int n = s1 . length ( );
int m = s2 . length ( );
int lcs [ n + 1 ] [ m + 1 ];
int cnt [ n + 1 ] [ m + 1 ];
memset ( lcs, 0, sizeof ( lcs ) );
memset ( cnt, 0, sizeof ( cnt ) );
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 1;
j <= m;
j ++ ) {
lcs [ i ] [ j ] = max ( lcs [ i - 1 ] [ j ], lcs [ i ] [ j - 1 ] );
if ( s1 [ i - 1 ] == s2 [ j - 1 ] ) cnt [ i ] [ j ] = cnt [ i - 1 ] [ j - 1 ] + 1;
if ( cnt [ i ] [ j ] >= k ) {
for ( int a = k;
a <= cnt [ i ] [ j ];
a ++ ) lcs [ i ] [ j ] = max ( lcs [ i ] [ j ], lcs [ i - a ] [ j - a ] + a );
}
}
}
return lcs [ n ] [ m ];
}
>= k ) {
for ( int a = k;
a <= cnt [ i ] [ j ];
a ++ ) lcs [ i ] [ j ] = max ( lcs [ i ] [ j ], lcs [ i - a ] [ j - a ] + a );
}
}
}
return lcs [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,2,3,5,2,3,3,1,2,2};
vector<string> param1 {"aggayxysdfa","55571659965107","01011011100","aggasdfa","5710246551","0100010","aabcaaaa","1219","111000011","wiC oD"};
vector<string> param2 {"aggajxaaasdfa","390286654154","0000110001000","aggajasdfaxy","79032504084062","10100000","baaabcd","3337119582","011","csiuGOUwE"};
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 k, string s1, string s2 ) { int n = s1 . length ( ); int m = s2 . length ( ); int lcs [ n + 1 ] [ m + 1 ]; int cnt [ n + 1 ] [ m + 1 ]; memset ( lcs, 0, sizeof ( lcs ) ); memset ( [MASK] 0, sizeof ( cnt ) ); for ( int i = 1; i <= n; i ++ ) { for ( int j = 1; j <= m; j ++ ) { lcs [ i ] [ j ] = max ( lcs [ i - 1 ] [ j ], lcs [ i ] [ j - 1 ] ); if ( s1 [ i - 1 ] == s2 [ j - 1 ] ) cnt [ i ] [ j ] = cnt [ i - 1 ] [ j - 1 ] + 1; if ( cnt [ i ] [ j ] >= k ) { for ( int a = k; a <= cnt [ i ] [ j ]; a ++ ) lcs [ i ] [ j ] = max ( lcs [ i ] [ j ], lcs [ i - a ] [ j - a ] + a ); } } } return lcs [ n ] [ m ]; }>= k ) {
for ( int a = k;
a <= cnt [ i ] [ j ];
a ++ ) lcs [ i ] [ j ] = max ( lcs [ i ] [ j ], lcs [ i - a ] [ j - a ] + a );
}
}
}
return lcs [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,2,3,5,2,3,3,1,2,2};
vector<string> param1 {"aggayxysdfa","55571659965107","01011011100","aggasdfa","5710246551","0100010","aabcaaaa","1219","111000011","wiC oD"};
vector<string> param2 {"aggajxaaasdfa","390286654154","0000110001000","aggajasdfaxy","79032504084062","10100000","baaabcd","3337119582","011","csiuGOUwE"};
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;
} | cnt, | [
"a) )",
"b) cnt,",
"c) 1",
"d) <cstdlib>",
"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 ) {
return ( 1 << ( n - 1 ) );
}
am>
#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 - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {56,28,4,24,72,30,48,32,13,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> [MASK] <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { return ( 1 << ( n - 1 ) ); }am>
#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 - 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {56,28,4,24,72,30,48,32,13,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) )",
"b) j",
"c) #include",
"d) -",
"e) if"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long f_gold ( long n ) {
return ( ( n << 3 ) - n );
}
>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long f_gold ( long n ) {
return ( ( n << 3 ) - n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,42,62,4,31,75,5,75,85,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include [MASK] #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; long f_gold ( long n ) { return ( ( n << 3 ) - n ); }>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long f_gold ( long n ) {
return ( ( n << 3 ) - n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,42,62,4,31,75,5,75,85,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <iostream> | [
"a) )",
"b) i",
"c) import",
"d) ;",
"e) <iostream>"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int oddDigSum = 0, evenDigSum = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) oddDigSum += ( str [ i ] - '0' );
else evenDigSum += ( str [ i ] - '0' );
}
return ( ( oddDigSum - evenDigSum ) % 11 == 0 );
}
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) oddDigSum += ( str [ i ] - '0' );
else evenDigSum += ( str [ i ] - '0' );
}
return ( ( oddDigSum - evenDigSum ) % 11 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"r","7386620","1010","rWFOLX VB","3845847974820","01001","yq","770356","0000110111001","tDMrBdHJJITDx"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { int n = str . length ( ); int oddDigSum = 0, evenDigSum = 0; [MASK] ( int i = 0; i < n; i ++ ) { if ( i % 2 == 0 ) oddDigSum += ( str [ i ] - '0' ); else evenDigSum += ( str [ i ] - '0' ); } return ( ( oddDigSum - evenDigSum ) % 11 == 0 ); }
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) oddDigSum += ( str [ i ] - '0' );
else evenDigSum += ( str [ i ] - '0' );
}
return ( ( oddDigSum - evenDigSum ) % 11 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"r","7386620","1010","rWFOLX VB","3845847974820","01001","yq","770356","0000110111001","tDMrBdHJJITDx"};
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) std;",
"b) low",
"c) for",
"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 base ) {
base = ( base - 2 );
base = base / 2;
return base * ( base + 1 ) / 2;
}
<vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int base ) {
base = ( base - 2 );
base = base / 2;
return base * ( base + 1 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,49,10,73,74,40,10,94,64,16};
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 base ) { base = ( base - 2 ); base = base / 2; [MASK] base * ( base + 1 ) / 2; }<vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int base ) {
base = ( base - 2 );
base = base / 2;
return base * ( base + 1 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,49,10,73,74,40,10,94,64,16};
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) x,",
"b) return",
"c) i",
"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 val [ ], int wt [ ], int n, int W ) {
int dp [ W + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < n;
i ++ ) for ( int j = W;
j >= wt [ i ];
j -- ) dp [ j ] = max ( dp [ j ], val [ i ] + dp [ j - wt [ i ] ] );
return dp [ W ];
}
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < n;
i ++ ) for ( int j = W;
j >= wt [ i ];
j -- ) dp [ j ] = max ( dp [ j ], val [ i ] + dp [ j - wt [ i ] ] );
return dp [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{11,25,72,90,95},{70,84,-24,-34,50,-10,-12,-98,6,-6,-34,34,80,-70,-72,-54,8,-84,8,-28,68,4,-88,94,-44,0,-24,-40,62,46,84,8,42,-8,-44,-66,-4,-12,20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,49,97,60,46,68,94,41,81,67,13,18,87,99,97,51,36,81,34,12,5,48,91,40,13,26,14,96,11,38,80,57,22,16,77,76,82,29,82,2,54,2,3,93,56,72,11},{-60,-44,-30,-26,8,40,44,60,90},{0,0,1,0,0,1,0,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,1},{19,25,31,35,56,75,79,81,88,96,99},{-98,-4,-50,-52,-6,68,88,38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,19,16,99,11}};
vector<vector<int>> param1 {{10,28,50,60,66},{20,-90,38,56,40,-86,6,-66,18,-82,90,-56,-10,46,18,60,96,-74,66,-76,-28,-80,-68,84,-62,-88,-92,-40,90,-8,-46,-10,70,-26,-82,22,-30,-6,-58},{0,0,0,0,0,0,0,0,0,0,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},{76,32,4,9,88,56,16,81,86,71,10,93,36,24,64,56,78,78,89,22,52,50,47,23,96,90,91,76,83,19,52,34,96,29,61,85,35,5,76,7,41,2,89,10,44,70,91},{-82,-78,-54,-40,-36,-16,76,84,84},{0,0,0,1,0,1,1,0,0,1,0,0,1,0,0,0,1,0,0,1,1,1,1,0},{1,8,10,26,34,47,50,58,63,81,87},{34,-36,-66,22,38,-78,-24,36},{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},{75,74,98,69,87}};
vector<int> param2 {4,35,21,25,6,13,7,6,24,4};
vector<int> param3 {2,24,21,32,7,23,10,6,29,2};
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 val [ ], int wt [ ], int n, int W ) { int dp [ W + 1 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 0; i < n; i ++ ) for ( int j = W; j >= wt [ i ]; j -- ) dp [ j ] = max ( dp [ [MASK] ], val [ i ] + dp [ j - wt [ i ] ] ); return dp [ W ]; } memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < n;
i ++ ) for ( int j = W;
j >= wt [ i ];
j -- ) dp [ j ] = max ( dp [ j ], val [ i ] + dp [ j - wt [ i ] ] );
return dp [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{11,25,72,90,95},{70,84,-24,-34,50,-10,-12,-98,6,-6,-34,34,80,-70,-72,-54,8,-84,8,-28,68,4,-88,94,-44,0,-24,-40,62,46,84,8,42,-8,-44,-66,-4,-12,20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,49,97,60,46,68,94,41,81,67,13,18,87,99,97,51,36,81,34,12,5,48,91,40,13,26,14,96,11,38,80,57,22,16,77,76,82,29,82,2,54,2,3,93,56,72,11},{-60,-44,-30,-26,8,40,44,60,90},{0,0,1,0,0,1,0,1,0,1,1,1,0,1,0,1,1,1,0,1,1,0,1,1},{19,25,31,35,56,75,79,81,88,96,99},{-98,-4,-50,-52,-6,68,88,38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,19,16,99,11}};
vector<vector<int>> param1 {{10,28,50,60,66},{20,-90,38,56,40,-86,6,-66,18,-82,90,-56,-10,46,18,60,96,-74,66,-76,-28,-80,-68,84,-62,-88,-92,-40,90,-8,-46,-10,70,-26,-82,22,-30,-6,-58},{0,0,0,0,0,0,0,0,0,0,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},{76,32,4,9,88,56,16,81,86,71,10,93,36,24,64,56,78,78,89,22,52,50,47,23,96,90,91,76,83,19,52,34,96,29,61,85,35,5,76,7,41,2,89,10,44,70,91},{-82,-78,-54,-40,-36,-16,76,84,84},{0,0,0,1,0,1,1,0,0,1,0,0,1,0,0,0,1,0,0,1,1,1,1,0},{1,8,10,26,34,47,50,58,63,81,87},{34,-36,-66,22,38,-78,-24,36},{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},{75,74,98,69,87}};
vector<int> param2 {4,35,21,25,6,13,7,6,24,4};
vector<int> param3 {2,24,21,32,7,23,10,6,29,2};
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;
} | j | [
"a) 1",
"b) :",
"c) i",
"d) {",
"e) j"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( char s [ ], int n ) {
int invalidOpenBraces = 0;
int invalidCloseBraces = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s [ i ] == '(' ) {
invalidOpenBraces ++;
}
else {
if ( invalidOpenBraces == 0 ) {
invalidCloseBraces ++;
}
else {
invalidOpenBraces --;
}
}
}
return ( n - ( invalidOpenBraces + invalidCloseBraces ) );
}
if ( invalidOpenBraces == 0 ) {
invalidCloseBraces ++;
}
else {
invalidOpenBraces --;
}
}
}
return ( n - ( invalidOpenBraces + invalidCloseBraces ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()()(()))()","(()(()))","(())()()","(())()))()","((()))(((","kjbcwkjebc","KZPNX","82050","010)()fkhj","ndPKtu"};
vector<int> param1 {11,8,8,10,9,10,5,5,10,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( char s [ ], int n ) { int invalidOpenBraces = 0; int invalidCloseBraces = 0; for ( int i = 0; i < n; i ++ ) [MASK] if ( s [ i ] == '(' ) { invalidOpenBraces ++; } else { if ( invalidOpenBraces == 0 ) { invalidCloseBraces ++; } else { invalidOpenBraces --; } } } return ( n - ( invalidOpenBraces + invalidCloseBraces ) ); } if ( invalidOpenBraces == 0 ) {
invalidCloseBraces ++;
}
else {
invalidOpenBraces --;
}
}
}
return ( n - ( invalidOpenBraces + invalidCloseBraces ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"()()(()))()","(()(()))","(())()()","(())()))()","((()))(((","kjbcwkjebc","KZPNX","82050","010)()fkhj","ndPKtu"};
vector<int> param1 {11,8,8,10,9,10,5,5,10,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| { | [
"a) ],",
"b) N",
"c) *;",
"d) {",
"e) javafx.util.Pair;"
] | 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 K ) {
int ans = 0;
for ( int i = 1;
i <= N;
i ++ ) ans += ( i % K );
return ans;
}
lude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int N, int K ) {
int ans = 0;
for ( int i = 1;
i <= N;
i ++ ) ans += ( i % K );
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,36,71,74,66,38,2,73,79,30};
vector<int> param1 {5,69,28,1,84,14,11,87,11,55};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int N, int K ) [MASK] int ans = 0; for ( int i = 1; i <= N; i ++ ) ans += ( i % K ); return ans; }lude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int N, int K ) {
int ans = 0;
for ( int i = 1;
i <= N;
i ++ ) ans += ( i % K );
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,36,71,74,66,38,2,73,79,30};
vector<int> param1 {5,69,28,1,84,14,11,87,11,55};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) ;",
"b) {",
"c) *;",
"d) [",
"e) int"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int start, int end, int arr [ ] ) {
unordered_map < int, int > frequency;
for ( int i = start;
i <= end;
i ++ ) frequency [ arr [ i ] ] ++;
int count = 0;
for ( auto x : frequency ) if ( x . first == x . second ) count ++;
return count;
}
t, int > frequency;
for ( int i = start;
i <= end;
i ++ ) frequency [ arr [ i ] ] ++;
int count = 0;
for ( auto x : frequency ) if ( x . first == x . second ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {0,1,3,10,2,0,14,29,31,21};
vector<int> param1 {31,25,4,15,3,6,18,33,19,32};
vector<vector<int>> param2 {
{1,2,2,3,3,3,12,13,18,18,26,28,29,36,37,39,40,49,55,57,63,69,69,73,85,86,87,87,89,89,90,91,92,93,93,93,95,99},
{24,-62,2,1,94,56,-22,-70,-22,-34,-92,-18,56,2,60,38,-88,16,-28,30,-30,58,-80,94,6,56},
{0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{84,13,81,40,87,82,50,30,90,80,81,70,14,54,72,93,78,27,61},
{-20,20,34,60,90},
{1,0,0,0,0,0,0,0,0,0},
{11,18,18,19,25,30,42,42,56,58,63,66,67,68,69,75,78,83,83},
{-24,-82,24,-84,94,2,-30,86,58,-56,-96,60,-38,76,94,74,-98,-84,-38,46,4,-84,-90,-28,-50,46,16,28,-14,-82,-64,42,64,-2,-40,96,60,2,-86,32,38,-66},
{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{2,91,42,85,97,92,24,39,63,89,31,59,51,89,72,62,26,92,75,4,6,13,20,95,22,30,52,60,37,27,49,15,67,26}};
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 start, int end, int [MASK] [ ] ) { unordered_map < int, int > frequency; for ( int i = start; i <= end; i ++ ) frequency [ arr [ i ] ] ++; int count = 0; for ( auto x : frequency ) if ( x . first == x . second ) count ++; return count; }t, int > frequency;
for ( int i = start;
i <= end;
i ++ ) frequency [ arr [ i ] ] ++;
int count = 0;
for ( auto x : frequency ) if ( x . first == x . second ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {0,1,3,10,2,0,14,29,31,21};
vector<int> param1 {31,25,4,15,3,6,18,33,19,32};
vector<vector<int>> param2 {
{1,2,2,3,3,3,12,13,18,18,26,28,29,36,37,39,40,49,55,57,63,69,69,73,85,86,87,87,89,89,90,91,92,93,93,93,95,99},
{24,-62,2,1,94,56,-22,-70,-22,-34,-92,-18,56,2,60,38,-88,16,-28,30,-30,58,-80,94,6,56},
{0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{84,13,81,40,87,82,50,30,90,80,81,70,14,54,72,93,78,27,61},
{-20,20,34,60,90},
{1,0,0,0,0,0,0,0,0,0},
{11,18,18,19,25,30,42,42,56,58,63,66,67,68,69,75,78,83,83},
{-24,-82,24,-84,94,2,-30,86,58,-56,-96,60,-38,76,94,74,-98,-84,-38,46,4,-84,-90,-28,-50,46,16,28,-14,-82,-64,42,64,-2,-40,96,60,2,-86,32,38,-66},
{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{2,91,42,85,97,92,24,39,63,89,31,59,51,89,72,62,26,92,75,4,6,13,20,95,22,30,52,60,37,27,49,15,67,26}};
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;
} | arr | [
"a) =",
"b) import",
"c) (x",
"d) arr",
"e) )"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > inc, dcr;
int len_inc [ n ], len_dcr [ n ];
int longLen = 0;
for ( int i = 0;
i < n;
i ++ ) {
int len = 0;
if ( inc . find ( arr [ i ] - 1 ) != inc . end ( ) ) len = inc [ arr [ i ] - 1 ];
inc [ arr [ i ] ] = len_inc [ i ] = len + 1;
}
for ( int i = n - 1;
i >= 0;
i -- ) {
int len = 0;
if ( dcr . find ( arr [ i ] - 1 ) != dcr . end ( ) ) len = dcr [ arr [ i ] - 1 ];
dcr [ arr [ i ] ] = len_dcr [ i ] = len + 1;
}
for ( int i = 0;
i < n;
i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1;
return longLen;
}
[ i ] ] = len_dcr [ i ] = len + 1;
}
for ( int i = 0;
i < n;
i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1;
return longLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{78},{-6,-18,-48,58,-54,76,80,-56,86,58,-86,-86,-88,32,12,58,58,-16,86,-24,84,86,36,18,30,-32,-4,-36,-72,-4,42,94},{0,1},{92,26,72,8,66,28,34,61,28},{-86,-82,-76,-68,-66,-64,-62,-56,-48,-42,-38,-30,-22,-18,-10,-10,-4,-2,4,28,42,44,50,50,56,58,60,76,82,86,86,98},{0,0,1,0,1,1,0,0,1,0,1,1,0,1,1,1,0,0,0,0,1,0},{3,4,8,9,12,13,16,19,23,25,29,31,34,36,38,41,42,47,49,50,51,51,58,63,66,70,73,74,75,75,75,76,76,80,82,83,83,84,86,89,90,91,91,95,96},{4,-76,60,48,-14,72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{66,80,79,72,1,67,20,67,32,40,22,64,58,67,10,21,37,49}};
vector<int> param1 {0,18,1,5,25,17,44,3,17,15};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold [MASK] int arr [ ], int n ) { unordered_map < int, int > inc, dcr; int len_inc [ n ], len_dcr [ n ]; int longLen = 0; for ( int i = 0; i < n; i ++ ) { int len = 0; if ( inc . find ( arr [ i ] - 1 ) != inc . end ( ) ) len = inc [ arr [ i ] - 1 ]; inc [ arr [ i ] ] = len_inc [ i ] = len + 1; } for ( int i = n - 1; i >= 0; i -- ) { int len = 0; if ( dcr . find ( arr [ i ] - 1 ) != dcr . end ( ) ) len = dcr [ arr [ i ] - 1 ]; dcr [ arr [ i ] ] = len_dcr [ i ] = len + 1; } for ( int i = 0; i < n; i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1; return longLen; } [ i ] ] = len_dcr [ i ] = len + 1;
}
for ( int i = 0;
i < n;
i ++ ) if ( longLen < ( len_inc [ i ] + len_dcr [ i ] - 1 ) ) longLen = len_inc [ i ] + len_dcr [ i ] - 1;
return longLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{78},{-6,-18,-48,58,-54,76,80,-56,86,58,-86,-86,-88,32,12,58,58,-16,86,-24,84,86,36,18,30,-32,-4,-36,-72,-4,42,94},{0,1},{92,26,72,8,66,28,34,61,28},{-86,-82,-76,-68,-66,-64,-62,-56,-48,-42,-38,-30,-22,-18,-10,-10,-4,-2,4,28,42,44,50,50,56,58,60,76,82,86,86,98},{0,0,1,0,1,1,0,0,1,0,1,1,0,1,1,1,0,0,0,0,1,0},{3,4,8,9,12,13,16,19,23,25,29,31,34,36,38,41,42,47,49,50,51,51,58,63,66,70,73,74,75,75,75,76,76,80,82,83,83,84,86,89,90,91,91,95,96},{4,-76,60,48,-14,72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{66,80,79,72,1,67,20,67,32,40,22,64,58,67,10,21,37,49}};
vector<int> param1 {0,18,1,5,25,17,44,3,17,15};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) n",
"b) for",
"c) =",
"d) range",
"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 ( long n ) {
int S = 0;
for ( int i = 1;
i <= n;
i ++ ) S += i * i - ( i - 1 ) * ( i - 1 );
return S;
}
tream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long n ) {
int S = 0;
for ( int i = 1;
i <= n;
i ++ ) S += i * i - ( i - 1 ) * ( i - 1 );
return S;
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {39,20,10,39,70,21,21,80,89,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; int f_gold ( long n ) { int S = 0; for ( int i = 1; i <= n; [MASK] ++ ) S += i * i - ( i - 1 ) * ( i - 1 ); return S; }tream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( long n ) {
int S = 0;
for ( int i = 1;
i <= n;
i ++ ) S += i * i - ( i - 1 ) * ( i - 1 );
return S;
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {39,20,10,39,70,21,21,80,89,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;
} | i | [
"a) f_gold",
"b) range",
"c) pro",
"d) n",
"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 res = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
int prefix_sum = arr [ i ];
for ( int j = 0;
j < i;
j ++ ) prefix_sum += arr [ j ];
int suffix_sum = arr [ i ];
for ( int j = n - 1;
j > i;
j -- ) suffix_sum += arr [ j ];
if ( prefix_sum == suffix_sum ) res = max ( res, prefix_sum );
}
return res;
}
j ];
int suffix_sum = arr [ i ];
for ( int j = n - 1;
j > i;
j -- ) suffix_sum += arr [ j ];
if ( prefix_sum == suffix_sum ) res = max ( res, prefix_sum );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,9,19,22,27,32,41,45,63,66,67,81,91},{-64,-2,68,-48,22,-14,-98},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{86,79,23,55,4,22,37,1,72,22,82,62,96,47},{-96,-96,-96,-96,-92,-82,-72,-72,-62,-58,-52,-48,-44,-44,-40,-34,-28,-26,-26,0,0,2,4,4,12,12,18,34,36,40,48,48,54,60,66,66,72,76,78,82,82,96,98},{0,1,0,1,1,0,0,0,1,1,1,0,0,1,0,0,1,1,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,0,1,0},{2,3,7,13,20,24,39,49,53,58,72,80,90,99},{-48,44,60,-30,8,20,70,-50,80,-2,-28,-14},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{64,13,18,3,22,29,51,45,21,13,47,15,17,34,60,99,30,54,16,47,13,49,60,66,28,57,85,66,65,7,62,29,9}};
vector<int> param1 {13,4,19,8,33,38,11,11,16,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int res = INT_MIN; for ( int i = 0; i < n; i ++ ) { int prefix_sum = arr [ i ]; for ( int j = 0; j < i; j ++ ) prefix_sum += arr [ j ]; int suffix_sum = arr [ i ]; for ( int j = n - 1; j > i; [MASK] -- ) suffix_sum += arr [ j ]; if ( prefix_sum == suffix_sum ) res = max ( res, prefix_sum ); } return res; } j ];
int suffix_sum = arr [ i ];
for ( int j = n - 1;
j > i;
j -- ) suffix_sum += arr [ j ];
if ( prefix_sum == suffix_sum ) res = max ( res, prefix_sum );
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,3,9,19,22,27,32,41,45,63,66,67,81,91},{-64,-2,68,-48,22,-14,-98},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{86,79,23,55,4,22,37,1,72,22,82,62,96,47},{-96,-96,-96,-96,-92,-82,-72,-72,-62,-58,-52,-48,-44,-44,-40,-34,-28,-26,-26,0,0,2,4,4,12,12,18,34,36,40,48,48,54,60,66,66,72,76,78,82,82,96,98},{0,1,0,1,1,0,0,0,1,1,1,0,0,1,0,0,1,1,0,0,0,0,1,1,0,1,0,0,0,0,0,1,1,1,1,1,0,0,1,1,0,0,0,1,0},{2,3,7,13,20,24,39,49,53,58,72,80,90,99},{-48,44,60,-30,8,20,70,-50,80,-2,-28,-14},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{64,13,18,3,22,29,51,45,21,13,47,15,17,34,60,99,30,54,16,47,13,49,60,66,28,57,85,66,65,7,62,29,9}};
vector<int> param1 {13,4,19,8,33,38,11,11,16,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | j | [
"a) )",
"b) j",
"c) 3",
"d) f_gold",
"e) )"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int res = 0;
for ( int i = 0;
i < n;
i ++ ) if ( x == arr [ i ] ) res ++;
return res;
}
<iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int res = 0;
for ( int i = 0;
i < n;
i ++ ) if ( x == arr [ i ] ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,18,24,27,34,36,41,43,43,52,59,76,86,87,90,91,94,96,98,98},{64,66,-36},{0,0,0},{9,85,34,43,70,96,44,7,27,33,34,5,91,84,76,45,20,37,15,37,20,24,13,49,74,13,50,81,81,66,23,36,91,80,61,15,96,70,90,25,16,62,75,63,6,65,38,12},{-98,-98,-98,-34,-32,-26,-12,0,18,52,68,72},{1,1,0,0,1,1,0,0,1,0,0,1,0,0,1,1},{1,3,6,6,10,12,15,16,21,22,23,29,33,37,40,40,43,52,55,59,64,65,71,72,80,83,86,86,88,88},{-14,-30,-38,-38,-8,40,-34,2,-84,68,-42,38,-14,0,-64,12,-2,-38,-8,-44,-88,-34,-80,-36,82,70,96,-32,16,-52,-12,-46,-28,-86,30,-14,50,-44,22,30,-4,78,52},{1,1,1,1},{11,50,1,93,12,7,55,35,36,62,61,71,16}};
vector<int> param1 {14,1,2,43,11,11,29,39,2,11};
vector<int> param2 {43,64,0,5,-98,1,40,26,3,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int x ) { int res = 0; for ( int i = 0; i < n; i ++ ) if ( x == arr [ i [MASK] ) res ++; return res; }<iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
int res = 0;
for ( int i = 0;
i < n;
i ++ ) if ( x == arr [ i ] ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{16,18,24,27,34,36,41,43,43,52,59,76,86,87,90,91,94,96,98,98},{64,66,-36},{0,0,0},{9,85,34,43,70,96,44,7,27,33,34,5,91,84,76,45,20,37,15,37,20,24,13,49,74,13,50,81,81,66,23,36,91,80,61,15,96,70,90,25,16,62,75,63,6,65,38,12},{-98,-98,-98,-34,-32,-26,-12,0,18,52,68,72},{1,1,0,0,1,1,0,0,1,0,0,1,0,0,1,1},{1,3,6,6,10,12,15,16,21,22,23,29,33,37,40,40,43,52,55,59,64,65,71,72,80,83,86,86,88,88},{-14,-30,-38,-38,-8,40,-34,2,-84,68,-42,38,-14,0,-64,12,-2,-38,-8,-44,-88,-34,-80,-36,82,70,96,-32,16,-52,-12,-46,-28,-86,30,-14,50,-44,22,30,-4,78,52},{1,1,1,1},{11,50,1,93,12,7,55,35,36,62,61,71,16}};
vector<int> param1 {14,1,2,43,11,11,29,39,2,11};
vector<int> param2 {43,64,0,5,-98,1,40,26,3,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) N",
"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;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,28,23,79,52,42,79,77,99,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; unsigned int f_gold ( unsigned int n ) { int res = 1, i; for ( i = 2; i <= n; i [MASK] ) res *= i; return res; }de <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1, i;
for ( i = 2;
i <= n;
i ++ ) res *= i;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {57,28,23,79,52,42,79,77,99,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;
} | ++ | [
"a) ++",
"b) [",
"c) <math.h>",
"d) return",
"e) i"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string s ) {
if ( s == "" ) return "a";
int i = s . length ( ) - 1;
while ( s [ i ] == 'z' && i >= 0 ) i --;
if ( i == - 1 ) s = s + 'a';
else s [ i ] ++;
return s;
}
;
string f_gold ( string s ) {
if ( s == "" ) return "a";
int i = s . length ( ) - 1;
while ( s [ i ] == 'z' && i >= 0 ) i --;
if ( i == - 1 ) s = s + 'a';
else s [ i ] ++;
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"amKIRzPiqLTIy","68","100","f","802205375","0111","GRjRYIvYwgua","8139910006809","100101","rw"};
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 ) { if ( s == "" ) return [MASK] int i = s . length ( ) - 1; while ( s [ i ] == 'z' && i >= 0 ) i --; if ( i == - 1 ) s = s + 'a'; else s [ i ] ++; return s; };
string f_gold ( string s ) {
if ( s == "" ) return "a";
int i = s . length ( ) - 1;
while ( s [ i ] == 'z' && i >= 0 ) i --;
if ( i == - 1 ) s = s + 'a';
else s [ i ] ++;
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"amKIRzPiqLTIy","68","100","f","802205375","0111","GRjRYIvYwgua","8139910006809","100101","rw"};
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) \"a\";",
"b) return",
"c) >",
"d) math.ceil",
"e) :"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
g namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"Xy","4827182","110011","GdOXZk","8970294","000110","xMRGdAgsGlH","34643260819239","00","DcCK"};
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 ( string str ) { int n = str . length ( ); int digitSum = 0; for ( int i = 0; i < n; i ++ ) digitSum += ( str [ i ] - '0' ); return ( digitSum % 3 == 0 ); }g namespace std;
int f_gold ( string str ) {
int n = str . length ( );
int digitSum = 0;
for ( int i = 0;
i < n;
i ++ ) digitSum += ( str [ i ] - '0' );
return ( digitSum % 3 == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"Xy","4827182","110011","GdOXZk","8970294","000110","xMRGdAgsGlH","34643260819239","00","DcCK"};
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) rotation",
"b) <bits/stdc++.h>",
"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 num, int divisor ) {
if ( divisor == 0 ) {
cout << "Error: divisor can't be zero \n";
return - 1;
}
if ( divisor < 0 ) divisor = - divisor;
if ( num < 0 ) num = - num;
int i = 1;
int product = 0;
while ( product <= num ) {
product = divisor * i;
i ++;
}
return num - ( product - divisor );
}
0 ) divisor = - divisor;
if ( num < 0 ) num = - num;
int i = 1;
int product = 0;
while ( product <= num ) {
product = divisor * i;
i ++;
}
return num - ( product - divisor );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {34,63,15,56,63,28,54,2,94,82};
vector<int> param1 {55,22,26,58,94,45,97,58,91,40};
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 num, int divisor ) { if ( divisor == 0 ) { cout << "Error: divisor can't be zero \n"; return - 1; } if ( divisor < 0 ) divisor = - divisor; if ( num < 0 ) num = - num; int i = 1; int product = 0; while ( product <= num ) { product = divisor * i; i ++; } return [MASK] - ( product - divisor ); }0 ) divisor = - divisor;
if ( num < 0 ) num = - num;
int i = 1;
int product = 0;
while ( product <= num ) {
product = divisor * i;
i ++;
}
return num - ( product - divisor );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {34,63,15,56,63,28,54,2,94,82};
vector<int> param1 {55,22,26,58,94,45,97,58,91,40};
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;
} | num | [
"a) ==",
"b) s1",
"c) #include",
"d) num",
"e) ["
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( vector < int > & A, int K ) {
int n = A . size ( );
double pre_sum [ n + 1 ];
pre_sum [ 0 ] = 0;
for ( int i = 0;
i < n;
i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ];
double dp [ n ] = {
0 };
double sum = 0;
for ( int i = 0;
i < n;
i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i );
for ( int k = 0;
k < K - 1;
k ++ ) for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) dp [ i ] = max ( dp [ i ], ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] );
return dp [ 0 ];
}
for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) dp [ i ] = max ( dp [ i ], ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] );
return dp [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,11,14,27,32,37,39,49,52,53,57,62,67,67,68,69,76,77,78,81,85,85,87,91,91,91,99,99,99},{80,12,32,44,24,82,-40,42,26,36,58,52,-34,44,12,-18,-72,52,2,-8,22,-18,98,-60,62,92,-46,20,20,-46,52,94,0,-28,-22,80,26,-92,-50,48,-80},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{32,16,67,53,99,56,80,92,84,21,36,46,94,31,63,67,59,88,41,17,74,47,95,12,27,99,32,4,82,31,65,40,93,72,23,33,93,9,62,47},{-92,-86,-80,-78,-72,-70,-70,-68,-66,-62,-60,-54,-54,-52,-52,-40,-36,-32,-28,-26,-22,-22,-20,-16,-16,-8,0,6,8,10,14,18,20,42,46,52,60,66,68,70,74,86,88,88,92,94,98},{1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0},{1,1,3,3,6,7,10,11,12,13,16,16,22,23,24,27,28,30,30,30,31,33,35,35,39,40,41,52,52,58,59,60,61,61,66,66,71,73,74,75,75,76,80,83,85,95,96,97,97},{28,-52,48,96,54,94,60,18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,80,12,87,90,98,46,91,38,46,20,64,53,4,60,87,44,88,22,30}};
vector<int> param1 {24,26,15,36,36,16,34,7,31,19};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i])) )/ (abs(f_filled(param0[i],param1[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( vector < int > & A, int K ) { int n = A . size ( ); double pre_sum [ n + 1 ]; pre_sum [ 0 ] = 0; for ( int i = 0; i < n; i ++ ) pre_sum [ i + 1 ] = pre_sum [ i ] + A [ i ]; double dp [ n ] = { 0 }; double sum = 0; for ( int i = 0; i < n; i ++ ) dp [ i ] = ( pre_sum [ n ] - pre_sum [ i ] ) / ( n - i ); for ( int k = 0; k < K - 1; k ++ ) for ( int i = 0; i < n; i ++ ) for ( int j = i + 1; j < n; j ++ ) dp [ i ] = max ( dp [ i ], ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ [MASK] ] ); return dp [ 0 ]; } for ( int i = 0;
i < n;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) dp [ i ] = max ( dp [ i ], ( pre_sum [ j ] - pre_sum [ i ] ) / ( j - i ) + dp [ j ] );
return dp [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,11,14,27,32,37,39,49,52,53,57,62,67,67,68,69,76,77,78,81,85,85,87,91,91,91,99,99,99},{80,12,32,44,24,82,-40,42,26,36,58,52,-34,44,12,-18,-72,52,2,-8,22,-18,98,-60,62,92,-46,20,20,-46,52,94,0,-28,-22,80,26,-92,-50,48,-80},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{32,16,67,53,99,56,80,92,84,21,36,46,94,31,63,67,59,88,41,17,74,47,95,12,27,99,32,4,82,31,65,40,93,72,23,33,93,9,62,47},{-92,-86,-80,-78,-72,-70,-70,-68,-66,-62,-60,-54,-54,-52,-52,-40,-36,-32,-28,-26,-22,-22,-20,-16,-16,-8,0,6,8,10,14,18,20,42,46,52,60,66,68,70,74,86,88,88,92,94,98},{1,0,0,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0},{1,1,3,3,6,7,10,11,12,13,16,16,22,23,24,27,28,30,30,30,31,33,35,35,39,40,41,52,52,58,59,60,61,61,66,66,71,73,74,75,75,76,80,83,85,95,96,97,97},{28,-52,48,96,54,94,60,18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{26,80,12,87,90,98,46,91,38,46,20,64,53,4,60,87,44,88,22,30}};
vector<int> param1 {24,26,15,36,36,16,34,7,31,19};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i])) )/ (abs(f_filled(param0[i],param1[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | j | [
"a) ]",
"b) j",
"c) :",
"d) len",
"e) y"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n;
}
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,81,77,84,87,14,15,3,21,60};
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 ) { return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n; }#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return 0.6172 * ( pow ( 10, n ) - 1 ) - 0.55 * n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {18,81,77,84,87,14,15,3,21,60};
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) void",
"b) n",
"c) long",
"d) (",
"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 arr [ ], int n ) {
int diff = INT_MAX;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( abs ( arr [ i ] - arr [ j ] ) < diff ) diff = abs ( arr [ i ] - arr [ j ] );
return diff;
}
t diff = INT_MAX;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( abs ( arr [ i ] - arr [ j ] ) < diff ) diff = abs ( arr [ i ] - arr [ j ] );
return diff;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98},{6,6,-20,88,-78,-18,74,72,80,76,-62,38},{0,1,1,1,1},{75,85,49,66,44,89,80,39,64,70,25,21,81,33,90,68,51},{-96,-10,0,4,54,64},{1,0,1,0,0,1,0,0,0,0,1,0,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0},{3,3,5,5,7,7,9,11,11,18,18,18,20,29,29,31,31,32,37,43,44,46,48,50,52,52,53,63,63,65,69,72,76,76,81,84,85,86,87,87,90,94,97,97},{40,-46,72,-28,8,90,86,-90,8,-66,-98,6,42,86,88,42,-50,74,-34,-16,-94,-56,-18,-18,84,-44,34,80,96,42,-50,-92,70,80,62,-38,-4,68,54,-14,30,-18,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{15,41,32,19,68,36,61,59,5,91,53,95,10,64,15,32,14,64,48,70,85,19,83,2,33,58,93,88,21,88,45,45,18,8}};
vector<int> param1 {32,11,3,16,3,41,27,33,26,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 ) { int diff = INT_MAX; for ( int i = 0; i < n - 1; i ++ ) for ( int j = i + 1; j < n; j ++ ) if ( abs ( arr [ i ] - arr [ j ] ) < diff ) diff = abs ( arr [ i ] - arr [MASK] j ] ); return diff; }t diff = INT_MAX;
for ( int i = 0;
i < n - 1;
i ++ ) for ( int j = i + 1;
j < n;
j ++ ) if ( abs ( arr [ i ] - arr [ j ] ) < diff ) diff = abs ( arr [ i ] - arr [ j ] );
return diff;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,5,8,10,11,15,15,16,20,26,28,30,30,33,33,39,50,50,50,54,62,66,68,69,69,74,74,75,75,76,78,82,83,85,86,86,89,89,91,91,92,92,92,93,94,98},{6,6,-20,88,-78,-18,74,72,80,76,-62,38},{0,1,1,1,1},{75,85,49,66,44,89,80,39,64,70,25,21,81,33,90,68,51},{-96,-10,0,4,54,64},{1,0,1,0,0,1,0,0,0,0,1,0,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1,0,1,1,1,0,1,1,1,1,1,0,1,1,0,0},{3,3,5,5,7,7,9,11,11,18,18,18,20,29,29,31,31,32,37,43,44,46,48,50,52,52,53,63,63,65,69,72,76,76,81,84,85,86,87,87,90,94,97,97},{40,-46,72,-28,8,90,86,-90,8,-66,-98,6,42,86,88,42,-50,74,-34,-16,-94,-56,-18,-18,84,-44,34,80,96,42,-50,-92,70,80,62,-38,-4,68,54,-14,30,-18,-58},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{15,41,32,19,68,36,61,59,5,91,53,95,10,64,15,32,14,64,48,70,85,19,83,2,33,58,93,88,21,88,45,45,18,8}};
vector<int> param1 {32,11,3,16,3,41,27,33,26,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;
} | [ | [
"a) :",
"b) [",
"c) ]",
"d) -",
"e) y)?"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int N, int k ) {
int M, S = 0, S1 = 0, max_difference = 0;
for ( int i = 0;
i < N;
i ++ ) S += arr [ i ];
sort ( arr, arr + N, greater < int > ( ) );
M = max ( k, N - k );
for ( int i = 0;
i < M;
i ++ ) S1 += arr [ i ];
max_difference = S1 - ( S - S1 );
return max_difference;
}
rr [ i ];
sort ( arr, arr + N, greater < int > ( ) );
M = max ( k, N - k );
for ( int i = 0;
i < M;
i ++ ) S1 += arr [ i ];
max_difference = S1 - ( S - S1 );
return max_difference;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,5,9,9,19,22,24,27,33,39,39,40,41,42,43,44,45,48,52,52,53,53,55,55,56,57,57,60,60,61,62,65,66,67,70,71,72,73,77,78,79,84,87,89,91,95,98},{-22,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{63,72,2,94,89,11,95,79,90,9,70,28,25,74,16,36,50,91,38,47,47,13,27,29,31,35},{-86,-78,-76,-76,-66,-62,-62,-38,-34,-32,-30,-26,-22,-4,-4,2,8,8,10,22,52,52,58,64,66,66,66,70,82,82},{0,0,0,1,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,0,0},{1,2,2,9,9,12,13,26,26,33,34,35,51,57,70,79,83},{98,-72,2,40,-20,-14,42,8,14,-58,-18,-70,-8,-66,-68,72,82,-38,-78,2,-66,-88,-34,52,12,84,72,-28,-34,60,-60,12,-28,-42,22,-66,88,-96},{0,0,0,0,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},{21,85,64,20,4,5,2}};
vector<int> param1 {41,1,20,23,29,42,9,28,37,5};
vector<int> param2 {44,1,29,16,24,32,16,28,27,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int N, int k ) { int M, S = 0, S1 = 0, max_difference = 0; for ( int i = 0; i < N; i ++ ) S += arr [ i ]; sort ( arr, arr + N, greater < int > ( ) ); M = max ( [MASK] N - k ); for ( int i = 0; i < M; i ++ ) S1 += arr [ i ]; max_difference = S1 - ( S - S1 ); return max_difference; }rr [ i ];
sort ( arr, arr + N, greater < int > ( ) );
M = max ( k, N - k );
for ( int i = 0;
i < M;
i ++ ) S1 += arr [ i ];
max_difference = S1 - ( S - S1 );
return max_difference;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,5,5,9,9,19,22,24,27,33,39,39,40,41,42,43,44,45,48,52,52,53,53,55,55,56,57,57,60,60,61,62,65,66,67,70,71,72,73,77,78,79,84,87,89,91,95,98},{-22,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{63,72,2,94,89,11,95,79,90,9,70,28,25,74,16,36,50,91,38,47,47,13,27,29,31,35},{-86,-78,-76,-76,-66,-62,-62,-38,-34,-32,-30,-26,-22,-4,-4,2,8,8,10,22,52,52,58,64,66,66,66,70,82,82},{0,0,0,1,1,1,1,1,1,0,1,1,1,1,1,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,1,0,1,1,0,0,0,1,0,0,1,0,0},{1,2,2,9,9,12,13,26,26,33,34,35,51,57,70,79,83},{98,-72,2,40,-20,-14,42,8,14,-58,-18,-70,-8,-66,-68,72,82,-38,-78,2,-66,-88,-34,52,12,84,72,-28,-34,60,-60,12,-28,-42,22,-66,88,-96},{0,0,0,0,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},{21,85,64,20,4,5,2}};
vector<int> param1 {41,1,20,23,29,42,9,28,37,5};
vector<int> param2 {44,1,29,16,24,32,16,28,27,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | k, | [
"a) count",
"b) const",
"c) (",
"d) k,",
"e) #include"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string X, string Y ) {
int m = X . length ( );
int n = Y . length ( );
int result = 0;
int len [ 2 ] [ n ];
int currRow = 0;
for ( int i = 0;
i <= m;
i ++ ) {
for ( int j = 0;
j <= n;
j ++ ) {
if ( i == 0 || j == 0 ) {
len [ currRow ] [ j ] = 0;
}
else if ( X [ i - 1 ] == Y [ j - 1 ] ) {
len [ currRow ] [ j ] = len [ 1 - currRow ] [ j - 1 ] + 1;
result = max ( result, len [ currRow ] [ j ] );
}
else {
len [ currRow ] [ j ] = 0;
}
}
currRow = 1 - currRow;
}
return result;
}
Row ] [ j - 1 ] + 1;
result = max ( result, len [ currRow ] [ j ] );
}
else {
len [ currRow ] [ j ] = 0;
}
}
currRow = 1 - currRow;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"GeeksforGeeks","333940","1000","Facebook","2684247","111","abcdxyz","625330958530","01011000001111","KXm"};
vector<string> param1 {"GeeksQuiz","390","0","nice book","1","10","xyzabcd","412511","1001010001","gF"};
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 [MASK] length ( ); int n = Y . length ( ); int result = 0; int len [ 2 ] [ n ]; int currRow = 0; for ( int i = 0; i <= m; i ++ ) { for ( int j = 0; j <= n; j ++ ) { if ( i == 0 || j == 0 ) { len [ currRow ] [ j ] = 0; } else if ( X [ i - 1 ] == Y [ j - 1 ] ) { len [ currRow ] [ j ] = len [ 1 - currRow ] [ j - 1 ] + 1; result = max ( result, len [ currRow ] [ j ] ); } else { len [ currRow ] [ j ] = 0; } } currRow = 1 - currRow; } return result; }Row ] [ j - 1 ] + 1;
result = max ( result, len [ currRow ] [ j ] );
}
else {
len [ currRow ] [ j ] = 0;
}
}
currRow = 1 - currRow;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"GeeksforGeeks","333940","1000","Facebook","2684247","111","abcdxyz","625330958530","01011000001111","KXm"};
vector<string> param1 {"GeeksQuiz","390","0","nice book","1","10","xyzabcd","412511","1001010001","gF"};
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,",
"b) ==",
"c) count",
"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 l, int r, int x ) {
if ( r >= l ) {
int mid = l + ( r - l ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 1, x );
return f_gold ( arr, mid + 1, r, x );
}
return - 1;
}
int mid = l + ( r - l ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 1, x );
return f_gold ( arr, mid + 1, r, x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,8,9,13,13,15,18,27,30,32,42,48,50,52,56,66,69,69,77,84,84,93},{52,-58,-22,-80,44,-52,-34,94,-34,-74,42,60,-62,70,98,32,10,94,26,56,-48,-50,42,2,46,28,-68,-16,-96,-12,66,-46,74,-60,-52,28,-92,-78,32,28,16,34,30,-60,-14},{0,1},{28,84,40,81},{-66,-62,-60,-56,-56,-2,40,44,50,74,82,94},{1,0,0,0,0,1,0,1,0,1,1},{15,26,31,36,36,61,68,72,75,79,82,98},{0,-82,-94,48,48,-96,14,66,76,-30,86,28,-28,-66,-64,92,-94,-66,86,26,8,94,-82,-80,4,-26,76,-46,72,88,-6,8,-30,40,-88,2,-40,-98,-22,-20,4,-12,54,-20,-36,12},{0,0,0,0,0,0,0,1,1,1,1,1,1},{81,47}};
vector<int> param1 {19,40,1,2,8,7,6,38,12,1};
vector<int> param2 {12,35,1,2,6,7,7,33,10,1};
vector<int> param3 {22,44,1,2,8,10,8,39,6,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int l, int r, int x ) { if ( r >= l ) { int mid = l + ( r - l ) / 2; if ( arr [ mid ] == x ) return mid; if ( arr [ mid ] > x ) return [MASK] ( arr, l, mid - 1, x ); return f_gold ( arr, mid + 1, r, x ); } return - 1; } int mid = l + ( r - l ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( arr [ mid ] > x ) return f_gold ( arr, l, mid - 1, x );
return f_gold ( arr, mid + 1, r, x );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,8,9,13,13,15,18,27,30,32,42,48,50,52,56,66,69,69,77,84,84,93},{52,-58,-22,-80,44,-52,-34,94,-34,-74,42,60,-62,70,98,32,10,94,26,56,-48,-50,42,2,46,28,-68,-16,-96,-12,66,-46,74,-60,-52,28,-92,-78,32,28,16,34,30,-60,-14},{0,1},{28,84,40,81},{-66,-62,-60,-56,-56,-2,40,44,50,74,82,94},{1,0,0,0,0,1,0,1,0,1,1},{15,26,31,36,36,61,68,72,75,79,82,98},{0,-82,-94,48,48,-96,14,66,76,-30,86,28,-28,-66,-64,92,-94,-66,86,26,8,94,-82,-80,4,-26,76,-46,72,88,-6,8,-30,40,-88,2,-40,-98,-22,-20,4,-12,54,-20,-36,12},{0,0,0,0,0,0,0,1,1,1,1,1,1},{81,47}};
vector<int> param1 {19,40,1,2,8,7,6,38,12,1};
vector<int> param2 {12,35,1,2,6,7,7,33,10,1};
vector<int> param3 {22,44,1,2,8,10,8,39,6,1};
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;
} | f_gold | [
"a) [",
"b) y;",
"c) (x",
"d) curr_ele",
"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 process, int need ) {
int minResources = 0;
minResources = process * ( need - 1 ) + 1;
return minResources;
}
include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int process, int need ) {
int minResources = 0;
minResources = process * ( need - 1 ) + 1;
return minResources;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,82,2,38,31,80,11,2,26,37};
vector<int> param1 {37,3,26,72,85,73,9,31,59,67};
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> [MASK] <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int process, int need ) { int minResources = 0; minResources = process * ( need - 1 ) + 1; return minResources; }include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int process, int need ) {
int minResources = 0;
minResources = process * ( need - 1 ) + 1;
return minResources;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,82,2,38,31,80,11,2,26,37};
vector<int> param1 {37,3,26,72,85,73,9,31,59,67};
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 | [
"a) start",
"b) #include",
"c) while",
"d) *",
"e) while"
] | 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 dp [ 10 ] [ n + 1 ];
memset ( dp, 0, sizeof dp );
for ( int i = 0;
i < 10;
i ++ ) dp [ i ] [ 1 ] = 1;
for ( int digit = 0;
digit <= 9;
digit ++ ) {
for ( int len = 2;
len <= n;
len ++ ) {
for ( int x = 0;
x <= digit;
x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ];
}
}
long long int count = 0;
for ( int i = 0;
i < 10;
i ++ ) count += dp [ i ] [ n ];
return count;
}
;
x <= digit;
x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ];
}
}
long long int count = 0;
for ( int i = 0;
i < 10;
i ++ ) count += dp [ i ] [ n ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,40,83,93,43,98,35,86,76,88};
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 dp [ 10 ] [ n + 1 ]; memset ( dp, 0, sizeof dp ); for ( int i = 0; i < 10; i ++ ) dp [ i ] [ 1 ] = 1; for ( int digit = 0; digit <= 9; digit ++ ) { for ( int len = 2; len <= n; [MASK] ++ ) { for ( int x = 0; x <= digit; x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ]; } } long long int count = 0; for ( int i = 0; i < 10; i ++ ) count += dp [ i ] [ n ]; return count; };
x <= digit;
x ++ ) dp [ digit ] [ len ] += dp [ x ] [ len - 1 ];
}
}
long long int count = 0;
for ( int i = 0;
i < 10;
i ++ ) count += dp [ i ] [ n ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,40,83,93,43,98,35,86,76,88};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | len | [
"a) len",
"b) i",
"c) import",
"d) }",
"e) string"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int DP [ n + 1 ];
DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1;
DP [ 3 ] = 2;
for ( int i = 4;
i <= n;
i ++ ) DP [ i ] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ];
return DP [ n ];
}
nt n ) {
int DP [ n + 1 ];
DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1;
DP [ 3 ] = 2;
for ( int i = 4;
i <= n;
i ++ ) DP [ i ] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ];
return DP [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {44,9,19,10,78,94,70,81,81,49};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int DP [ n + 1 ]; DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1; DP [ 3 ] = 2; for ( int i = 4; i <= n; i ++ ) DP [ i [MASK] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ]; return DP [ n ]; }nt n ) {
int DP [ n + 1 ];
DP [ 0 ] = DP [ 1 ] = DP [ 2 ] = 1;
DP [ 3 ] = 2;
for ( int i = 4;
i <= n;
i ++ ) DP [ i ] = DP [ i - 1 ] + DP [ i - 3 ] + DP [ i - 4 ];
return DP [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {44,9,19,10,78,94,70,81,81,49};
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) ]",
"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 nCr = 1, res = 1;
for ( int r = 1;
r <= n;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) ) / r;
res += nCr * nCr;
}
return res;
}
dc++.h>
using namespace std;
int f_gold ( int n ) {
int nCr = 1, res = 1;
for ( int r = 1;
r <= n;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) ) / r;
res += nCr * nCr;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {52,75,25,80,18,17,33,8,99,8};
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 nCr = 1, res = 1; for ( int r = 1; r <= n; r ++ ) { nCr = ( nCr * ( n + 1 - [MASK] ) ) / r; res += nCr * nCr; } return res; }dc++.h>
using namespace std;
int f_gold ( int n ) {
int nCr = 1, res = 1;
for ( int r = 1;
r <= n;
r ++ ) {
nCr = ( nCr * ( n + 1 - r ) ) / r;
res += nCr * nCr;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {52,75,25,80,18,17,33,8,99,8};
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) ],",
"c) r",
"d) =",
"e) {"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string s ) {
int n = s . length ( );
for ( int i = 1;
i < n;
i ++ ) {
if ( s [ i ] == s [ i - 1 ] ) {
s [ i ] = 'a';
while ( s [ i ] == s [ i - 1 ] || ( i + 1 < n && s [ i ] == s [ i + 1 ] ) ) s [ i ] ++;
i ++;
}
}
return s;
}
i ++ ) {
if ( s [ i ] == s [ i - 1 ] ) {
s [ i ] = 'a';
while ( s [ i ] == s [ i - 1 ] || ( i + 1 < n && s [ i ] == s [ i + 1 ] ) ) s [ i ] ++;
i ++;
}
}
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"cHcZCdkbIMGUYe","2292016725711","10110111100010","wHso xGbBY","21884","0","I","716213436","101","HXdDbjcyPc"};
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 n = s . length ( ); for ( int i = 1; i < n; i ++ ) { if ( s [ i ] == s [ i - 1 ] ) { s [ i ] = 'a'; while ( s [ i ] == s [ i - 1 ] || ( i + 1 [MASK] n && s [ i ] == s [ i + 1 ] ) ) s [ i ] ++; i ++; } } return s; } i ++ ) {
if ( s [ i ] == s [ i - 1 ] ) {
s [ i ] = 'a';
while ( s [ i ] == s [ i - 1 ] || ( i + 1 < n && s [ i ] == s [ i + 1 ] ) ) s [ i ] ++;
i ++;
}
}
return s;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"cHcZCdkbIMGUYe","2292016725711","10110111100010","wHso xGbBY","21884","0","I","716213436","101","HXdDbjcyPc"};
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) or",
"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 m, int n ) {
int T [ m + 1 ] [ n + 1 ];
for ( int i = 0;
i < m + 1;
i ++ ) {
for ( int j = 0;
j < n + 1;
j ++ ) {
if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0;
else if ( i < j ) T [ i ] [ j ] = 0;
else if ( j == 1 ) T [ i ] [ j ] = i;
else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ];
}
}
return T [ m ] [ n ];
}
0;
else if ( i < j ) T [ i ] [ j ] = 0;
else if ( j == 1 ) T [ i ] [ j ] = i;
else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ];
}
}
return T [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {10,5,2,83,91,18,83,98,43,31};
vector<int> param1 {4,2,8,7,0,53,41,53,37,20};
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 m, int n ) { int T [ m + 1 ] [ n + 1 ]; for ( int i = 0; i < m + 1; i ++ ) { for ( int j = 0; j < n + 1; j ++ ) { if ( i == 0 || j == 0 ) T [ i ] [ j ] = 0; else if ( i < j ) [MASK] [ i ] [ j ] = 0; else if ( j == 1 ) T [ i ] [ j ] = i; else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ]; } } return T [ m ] [ n ]; } 0;
else if ( i < j ) T [ i ] [ j ] = 0;
else if ( j == 1 ) T [ i ] [ j ] = i;
else T [ i ] [ j ] = T [ i - 1 ] [ j ] + T [ i / 2 ] [ j - 1 ];
}
}
return T [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {10,5,2,83,91,18,83,98,43,31};
vector<int> param1 {4,2,8,7,0,53,41,53,37,20};
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;
}
| T | [
"a) ||",
"b) <stdio.h>",
"c) int",
"d) T",
"e) A"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
char f_gold ( string str, int i = 0 ) {
if ( str [ i ] == '\0' ) return 0;
if ( isupper ( str [ i ] ) ) return str [ i ];
return f_gold ( str, i + 1 );
}
<bits/stdc++.h>
using namespace std;
char f_gold ( string str, int i = 0 ) {
if ( str [ i ] == '\0' ) return 0;
if ( isupper ( str [ i ] ) ) return str [ i ];
return f_gold ( str, i + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"bqDNcKByTnd","55228579663548","011","iWPNIfEbTXSN","317256850800","01","sPohONiPM","690818686620","1","xVz IfQBHyEZMa"};
vector<int> param1 {0,0,0,0,0,0,0,0,0,82};
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> [MASK] <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; char f_gold ( string str, int i = 0 ) { if ( str [ i ] == '\0' ) return 0; if ( isupper ( str [ i ] ) ) return str [ i ]; return f_gold ( str, i + 1 ); }<bits/stdc++.h>
using namespace std;
char f_gold ( string str, int i = 0 ) {
if ( str [ i ] == '\0' ) return 0;
if ( isupper ( str [ i ] ) ) return str [ i ];
return f_gold ( str, i + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"bqDNcKByTnd","55228579663548","011","iWPNIfEbTXSN","317256850800","01","sPohONiPM","690818686620","1","xVz IfQBHyEZMa"};
vector<int> param1 {0,0,0,0,0,0,0,0,0,82};
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 | [
"a) int",
"b) {",
"c) max(int",
"d) (",
"e) #include"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( int n ) {
if ( n == 0 ) return "0";
string bin = "";
while ( n > 0 ) {
bin = ( ( n & 1 ) == 0 ? '0' : '1' ) + bin;
n >>= 1;
}
return bin;
}
>
using namespace std;
string f_gold ( int n ) {
if ( n == 0 ) return "0";
string bin = "";
while ( n > 0 ) {
bin = ( ( n & 1 ) == 0 ? '0' : '1' ) + bin;
n >>= 1;
}
return bin;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {35,17,8,99,57,39,99,14,22,7};
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 ( int n ) { if ( n == 0 ) return "0"; string bin = ""; while ( n > 0 ) { bin = ( ( n & 1 ) == 0 ? '0' : '1' ) + bin; n >>= 1; } [MASK] bin; }>
using namespace std;
string f_gold ( int n ) {
if ( n == 0 ) return "0";
string bin = "";
while ( n > 0 ) {
bin = ( ( n & 1 ) == 0 ? '0' : '1' ) + bin;
n >>= 1;
}
return bin;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {35,17,8,99,57,39,99,14,22,7};
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) 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;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 || n == 1 ) return 1;
return n * f_gold ( n - 2 );
}
r>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 || n == 1 ) return 1;
return n * f_gold ( n - 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {52,93,15,72,61,21,83,87,75,75};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { if ( n == 0 || n == 1 ) return 1; return n * [MASK] ( n - 2 ); }r>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
if ( n == 0 || n == 1 ) return 1;
return n * f_gold ( n - 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {52,93,15,72,61,21,83,87,75,75};
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) )",
"b) ]",
"c) b)",
"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;
bool f_gold ( string s ) {
int l = s . length ( );
int j;
for ( int i = 0, j = l - 1;
i <= j;
i ++, j -- ) {
if ( s [ i ] != s [ j ] ) return false;
}
return true;
}
mespace std;
bool f_gold ( string s ) {
int l = s . length ( );
int j;
for ( int i = 0, j = l - 1;
i <= j;
i ++, j -- ) {
if ( s [ i ] != s [ j ] ) return false;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"aadaa","2674377254","11","0011000","26382426486138","111010111010","abccba","5191","1110101101","abcdecbe"};
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 s ) { int l = s . length ( ); int j; for ( int i = 0, j = l [MASK] 1; i <= j; i ++, j -- ) { if ( s [ i ] != s [ j ] ) return false; } return true; }mespace std;
bool f_gold ( string s ) {
int l = s . length ( );
int j;
for ( int i = 0, j = l - 1;
i <= j;
i ++, j -- ) {
if ( s [ i ] != s [ j ] ) return false;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"aadaa","2674377254","11","0011000","26382426486138","111010111010","abccba","5191","1110101101","abcdecbe"};
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) 2",
"e) j"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
return ( ( ( 15 + ( 7 * ( sqrt ( 5 ) ) ) ) / 4 ) * ( pow ( side, 3 ) ) );
}
ctor>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
return ( ( ( 15 + ( 7 * ( sqrt ( 5 ) ) ) ) / 4 ) * ( pow ( side, 3 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {56,73,22,10,84,20,51,91,10,83};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [MASK] <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( int side ) { return ( ( ( 15 + ( 7 * ( sqrt ( 5 ) ) ) ) / 4 ) * ( pow ( side, 3 ) ) ); }ctor>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
return ( ( ( 15 + ( 7 * ( sqrt ( 5 ) ) ) ) / 4 ) * ( pow ( side, 3 ) ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {56,73,22,10,84,20,51,91,10,83};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) ;",
"b) =",
"c) y",
"d) <bits/stdc++.h>",
"e) #include"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int low, int high ) {
if ( high >= low ) {
int mid = ( low + high ) / 2;
if ( mid == arr [ mid ] ) return mid;
if ( mid > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high );
else return f_gold ( arr, low, ( mid - 1 ) );
}
return - 1;
}
+ high ) / 2;
if ( mid == arr [ mid ] ) return mid;
if ( mid > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high );
else return f_gold ( arr, low, ( mid - 1 ) );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,20,20,27,32,35,37,51,63,64,71,75,77,80,82,82,86,90,90,92,95,97,98},
{-10, -5, 0, 3, 7},
{0, 2, 5, 8, 17},
{-10, -5, 3, 4, 7, 9},
{-10, -5, 2, 4, 7, 9},
{1,1,0,1,1,0,1,0,0},
{1,4,16,16,19,28,34,34,35,36,37,46,49,52,54,60,60,60,63,70,75,77,80,81,81,84,85,87,93,99},
{30,30,-94,-10,2,58},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{72,38,91,63,30,67,39,29,96,42}};
vector<int> param1 {0,0,0,1,2,0,0,0,0,0};
vector<int> param2 {16,4,4,5,5,7,5,5,12,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high ) { if ( high >= low ) { int mid = ( low + high ) / 2; if ( mid == arr [ [MASK] ] ) return mid; if ( mid > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high ); else return f_gold ( arr, low, ( mid - 1 ) ); } return - 1; }+ high ) / 2;
if ( mid == arr [ mid ] ) return mid;
if ( mid > arr [ mid ] ) return f_gold ( arr, ( mid + 1 ), high );
else return f_gold ( arr, low, ( mid - 1 ) );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,20,20,27,32,35,37,51,63,64,71,75,77,80,82,82,86,90,90,92,95,97,98},
{-10, -5, 0, 3, 7},
{0, 2, 5, 8, 17},
{-10, -5, 3, 4, 7, 9},
{-10, -5, 2, 4, 7, 9},
{1,1,0,1,1,0,1,0,0},
{1,4,16,16,19,28,34,34,35,36,37,46,49,52,54,60,60,60,63,70,75,77,80,81,81,84,85,87,93,99},
{30,30,-94,-10,2,58},
{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{72,38,91,63,30,67,39,29,96,42}};
vector<int> param1 {0,0,0,1,2,0,0,0,0,0};
vector<int> param2 {16,4,4,5,5,7,5,5,12,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;
} | mid | [
"a) k",
"b) min",
"c) #include",
"d) mid",
"e) A"
] | 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 dp [ x + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= x;
i ++ ) dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
return dp [ x ];
}
namespace std;
int f_gold ( int x ) {
int dp [ x + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= x;
i ++ ) dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
return dp [ x ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,92,15,81,3,30,88,4,43,92};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x ) { int dp [ x + 1 ]; dp [ 0 ] = dp [ 1 ] = 1; for ( int i = 2; i <= x; i ++ ) dp [ i ] = dp [ i [MASK] 1 ] + ( i - 1 ) * dp [ i - 2 ]; return dp [ x ]; } namespace std;
int f_gold ( int x ) {
int dp [ x + 1 ];
dp [ 0 ] = dp [ 1 ] = 1;
for ( int i = 2;
i <= x;
i ++ ) dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
return dp [ x ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {22,92,15,81,3,30,88,4,43,92};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | - | [
"a) -",
"b) ==",
"c) }",
"d) a,",
"e) for"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n <= 0 ) return 0;
int fibo [ n + 1 ];
fibo [ 0 ] = 0, fibo [ 1 ] = 1;
int sum = fibo [ 0 ] + fibo [ 1 ];
for ( int i = 2;
i <= n;
i ++ ) {
fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ];
sum += fibo [ i ];
}
return sum;
}
[ 0 ] = 0, fibo [ 1 ] = 1;
int sum = fibo [ 0 ] + fibo [ 1 ];
for ( int i = 2;
i <= n;
i ++ ) {
fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ];
sum += fibo [ i ];
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,50,7,21,21,91,11,25,62,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include [MASK] using namespace std; int f_gold ( int n ) { if ( n <= 0 ) return 0; int fibo [ n + 1 ]; fibo [ 0 ] = 0, fibo [ 1 ] = 1; int sum = fibo [ 0 ] + fibo [ 1 ]; for ( int i = 2; i <= n; i ++ ) { fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ]; sum += fibo [ i ]; } return sum; }[ 0 ] = 0, fibo [ 1 ] = 1;
int sum = fibo [ 0 ] + fibo [ 1 ];
for ( int i = 2;
i <= n;
i ++ ) {
fibo [ i ] = fibo [ i - 1 ] + fibo [ i - 2 ];
sum += fibo [ i ];
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {9,50,7,21,21,91,11,25,62,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <bits/stdc++.h> | [
"a) <limits.h>",
"b) (",
"c) count",
"d) <bits/stdc++.h>",
"e) Sum"
] | 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 ) {
return ( ( n + 1 ) * ( n + 2 ) ) / 2;
}
e <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 + 2 ) ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,72,54,75,87,41,78,80,46,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { return ( ( [MASK] + 1 ) * ( n + 2 ) ) / 2; }e <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 + 2 ) ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {41,72,54,75,87,41,78,80,46,9};
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) )",
"c) -",
"d) n",
"e) }"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
if ( n < 3 ) return n;
if ( n >= 3 && n < 10 ) return n - 1;
int po = 1;
while ( n / po > 9 ) po = po * 10;
int msd = n / po;
if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po );
else return f_gold ( msd * po - 1 );
}
while ( n / po > 9 ) po = po * 10;
int msd = n / po;
if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po );
else return f_gold ( msd * po - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {85,86,3,35,59,38,33,15,75,74};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { if ( n < 3 ) return n; if ( n >= 3 && n < 10 ) return n - 1; [MASK] po = 1; while ( n / po > 9 ) po = po * 10; int msd = n / po; if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po ); else return f_gold ( msd * po - 1 ); }
while ( n / po > 9 ) po = po * 10;
int msd = n / po;
if ( msd != 3 ) return f_gold ( msd ) * f_gold ( po - 1 ) + f_gold ( msd ) + f_gold ( n % po );
else return f_gold ( msd * po - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {85,86,3,35,59,38,33,15,75,74};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) x",
"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 n ) {
int res = 1;
while ( n % 2 == 0 ) n = n / 2;
for ( int i = 3;
i <= sqrt ( n );
i ++ ) {
int count = 0, curr_sum = 1;
int curr_term = 1;
while ( n % i == 0 ) {
count ++;
n = n / i;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
= 1;
while ( n % i == 0 ) {
count ++;
n = n / i;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,6,39,80,88,7,16,27,83,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int res = 1; while ( n % 2 == 0 ) n = n / 2; for ( int i = 3; i <= sqrt ( n ); i ++ ) { int count = 0, curr_sum = 1; int curr_term = 1; while ( n % i == 0 ) { count ++; n = [MASK] / i; curr_term *= i; curr_sum += curr_term; } res *= curr_sum; } if ( n >= 2 ) res *= ( 1 + n ); return res; }= 1;
while ( n % i == 0 ) {
count ++;
n = n / i;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {20,6,39,80,88,7,16,27,83,6};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) 2",
"b) =",
"c) )",
"d) n",
"e) int"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
sing namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,4,10,11,13,17,19,23,26,28,29,30,34,35,37,38,38,43,49,49,50,52,53,55,55,57,58,58,59,64,66,67,70,72,72,75,77,77,87,89,89,90,91,98,99,99,99},{56,-94,-26,-52,58,-66,-52,-66,-94,44,38,-66,70,-70,-80,-78,-72,-60,-76,68,-50,32,-16,84,74,-42,98,-8,72,26,24,6,24,86,86,78,-92,80,32,-74,26,50,92,4,2,-34,-2,-18,-10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{38,79,76,92,92},{-42,-28,2,32,50,56,86,96,98},{1,0,0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1},{1,9,12,21,21,24,34,55,60,63,67,68,88,89,91,94,98,99},{-96,96,-98,-42,-74,40,42,50,-46,-52,8,-46,48,88,-78,-72,-10,-20,98,-40,-18,36,4,46,52,28,-88,-28,-28,-86},{0,0,0,0,1,1},{66,12,48,82,33,77,99,98,14,92}};
vector<int> param1 {46,30,13,2,7,11,9,29,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; bool f_gold ( int arr [ ], int n ) { if ( n == 0 || n == 1 ) return true; for ( int i = 1; i < n; i ++ ) if ( arr [ i - [MASK] ] > arr [ i ] ) return false; return true; }sing namespace std;
bool f_gold ( int arr [ ], int n ) {
if ( n == 0 || n == 1 ) return true;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i - 1 ] > arr [ i ] ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,4,10,11,13,17,19,23,26,28,29,30,34,35,37,38,38,43,49,49,50,52,53,55,55,57,58,58,59,64,66,67,70,72,72,75,77,77,87,89,89,90,91,98,99,99,99},{56,-94,-26,-52,58,-66,-52,-66,-94,44,38,-66,70,-70,-80,-78,-72,-60,-76,68,-50,32,-16,84,74,-42,98,-8,72,26,24,6,24,86,86,78,-92,80,32,-74,26,50,92,4,2,-34,-2,-18,-10},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{38,79,76,92,92},{-42,-28,2,32,50,56,86,96,98},{1,0,0,1,1,1,0,1,0,0,0,1,1,1,1,1,1,1},{1,9,12,21,21,24,34,55,60,63,67,68,88,89,91,94,98,99},{-96,96,-98,-42,-74,40,42,50,-46,-52,8,-46,48,88,-78,-72,-10,-20,98,-40,-18,36,4,46,52,28,-88,-28,-28,-86},{0,0,0,0,1,1},{66,12,48,82,33,77,99,98,14,92}};
vector<int> param1 {46,30,13,2,7,11,9,29,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;
} | 1 | [
"a) 1",
"b) }",
"c) count",
"d) arr2",
"e) sum"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int C [ n + 1 ] [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) {
for ( int 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 maxvalue = 0;
for ( int i = 0;
i <= n;
i ++ ) maxvalue = max ( maxvalue, C [ n ] [ i ] );
return maxvalue;
}
else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int maxvalue = 0;
for ( int i = 0;
i <= n;
i ++ ) maxvalue = max ( maxvalue, C [ n ] [ i ] );
return maxvalue;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,41,69,56,71,38,26,52,93,44};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int C [ n + 1 ] [ n + 1 ]; for ( int [MASK] = 0; i <= n; i ++ ) { for ( int 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 maxvalue = 0; for ( int i = 0; i <= n; i ++ ) maxvalue = max ( maxvalue, C [ n ] [ i ] ); return maxvalue; }else C [ i ] [ j ] = C [ i - 1 ] [ j - 1 ] + C [ i - 1 ] [ j ];
}
}
int maxvalue = 0;
for ( int i = 0;
i <= n;
i ++ ) maxvalue = max ( maxvalue, C [ n ] [ i ] );
return maxvalue;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {23,41,69,56,71,38,26,52,93,44};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | i | [
"a) return",
"b) );}",
"c) i",
"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 res [ n + 1 ];
res [ 0 ] = 0;
res [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
return res [ n ];
}
s [ n + 1 ];
res [ 0 ] = 0;
res [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
return res [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {3,19,39,89,96,68,48,5,3,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int res [ n + 1 ]; res [ 0 ] = 0; res [ 1 ] = 1; for ( int i = 2; i <= n; i ++ ) [MASK] [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) ); return res [ n ]; }s [ n + 1 ];
res [ 0 ] = 0;
res [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) res [ i ] = max ( i, ( res [ i / 2 ] + res [ i / 3 ] + res [ i / 4 ] + res [ i / 5 ] ) );
return res [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {3,19,39,89,96,68,48,5,3,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | res | [
"a) ;",
"b) i",
"c) int",
"d) res",
"e) return"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x, int y ) {
int i, j;
int min_dist = INT_MAX;
for ( i = 0;
i < n;
i ++ ) {
for ( j = i + 1;
j < n;
j ++ ) {
if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > abs ( i - j ) ) {
min_dist = abs ( i - j );
}
}
}
return min_dist;
}
++ ) {
if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > abs ( i - j ) ) {
min_dist = abs ( i - j );
}
}
}
return min_dist;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,7,8,11,14,16,25,34,35,36,36,38,40,41,43,45,47,57,60,64,72,73,74,75,82,83,83,84,84,84,92},{96,70,88,-64,-42,58,92,66,-14,90,-66,12,88,-12,48,-4,90,24,98,14,32,38,98,78,2,26,12,-36,90,80,40,58,88,64,16},{0,0,1},{46,96,82,73,30,36,56,20,5,36,4,7,89,63,54,97,80,56,93,34,90,56,25,27,75,68,14,90},{-96,-88,-82,-66,-62,-52,-52,-46,-46,-40,-40,-28,-24,-12,0,4,10,24,42,46,48,48,50,60,62,64,64,70,92,98},{0,0,1,0,1,1,0,1,1,1,1},{1,2,2,6,10,14,15,18,19,22,23,29,30,37,40,40,41,41,42,42,44,46,46,54,56,72,73,81,83,83,86,88,93},{46,86,-52,18,-32,86,2,38,72,72,-60,70,-58,66,-66,-72,-74,58,52,58,16,64,62,-62,80,-70,-96,-44,-20,-74,-10,14,-32,48,30,76,-16,80,66,-46,-92,26,-86,28,-76,-24,-98,54,50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,65,10,72,17,58,79,28,67,36,18,35}};
vector<int> param1 {22,25,1,26,24,10,27,30,38,7};
vector<int> param2 {7,58,1,54,0,0,1,25,0,10};
vector<int> param3 {40,70,1,82,4,1,42,45,0,7};
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 [MASK] ], int n, int x, int y ) { int i, j; int min_dist = INT_MAX; for ( i = 0; i < n; i ++ ) { for ( j = i + 1; j < n; j ++ ) { if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > abs ( i - j ) ) { min_dist = abs ( i - j ); } } } return min_dist; } ++ ) {
if ( ( x == arr [ i ] && y == arr [ j ] || y == arr [ i ] && x == arr [ j ] ) && min_dist > abs ( i - j ) ) {
min_dist = abs ( i - j );
}
}
}
return min_dist;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,7,8,11,14,16,25,34,35,36,36,38,40,41,43,45,47,57,60,64,72,73,74,75,82,83,83,84,84,84,92},{96,70,88,-64,-42,58,92,66,-14,90,-66,12,88,-12,48,-4,90,24,98,14,32,38,98,78,2,26,12,-36,90,80,40,58,88,64,16},{0,0,1},{46,96,82,73,30,36,56,20,5,36,4,7,89,63,54,97,80,56,93,34,90,56,25,27,75,68,14,90},{-96,-88,-82,-66,-62,-52,-52,-46,-46,-40,-40,-28,-24,-12,0,4,10,24,42,46,48,48,50,60,62,64,64,70,92,98},{0,0,1,0,1,1,0,1,1,1,1},{1,2,2,6,10,14,15,18,19,22,23,29,30,37,40,40,41,41,42,42,44,46,46,54,56,72,73,81,83,83,86,88,93},{46,86,-52,18,-32,86,2,38,72,72,-60,70,-58,66,-66,-72,-74,58,52,58,16,64,62,-62,80,-70,-96,-44,-20,-74,-10,14,-32,48,30,76,-16,80,66,-46,-92,26,-86,28,-76,-24,-98,54,50},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,65,10,72,17,58,79,28,67,36,18,35}};
vector<int> param1 {22,25,1,26,24,10,27,30,38,7};
vector<int> param2 {7,58,1,54,0,0,1,25,0,10};
vector<int> param3 {40,70,1,82,4,1,42,45,0,7};
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) java.util.stream.*;"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int row = 0;
row < n;
row ++ ) {
sum = sum + ( 1 << row );
}
return sum;
}
nclude <bits/stdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int row = 0;
row < n;
row ++ ) {
sum = sum + ( 1 << row );
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,4,31,79,38,75,36,32,23,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; long long int f_gold ( int n ) { long long int sum = 0; for ( int row = 0; row < n; row ++ ) { sum [MASK] sum + ( 1 << row ); } return sum; }nclude <bits/stdc++.h>
using namespace std;
long long int f_gold ( int n ) {
long long int sum = 0;
for ( int row = 0;
row < n;
row ++ ) {
sum = sum + ( 1 << row );
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,4,31,79,38,75,36,32,23,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;
} | = | [
"a) <string>",
"b) (",
"c) for",
"d) =",
"e) increment"
] | 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 dist_count = 0;
for ( int i = 0;
i < n;
i ++ ) {
int j;
for ( j = 0;
j < n;
j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break;
if ( j == n ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
{
int j;
for ( j = 0;
j < n;
j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break;
if ( j == n ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,8,18,20,33,53,56,60,71,76,80,81,87,88,89,92,95},{-78,6,32,52,-12,-32,22,-40,-82,24,30,10,-40},{0,0,0,0,0,1,1,1,1,1,1},{3,28,55,21,42,60,96,83,98,75,29,73,51,21,27,65,19,47,12,81,19,94,50,43,21,32,52,44,52,91,49,59,52,10,75,86,46,43,3,49,70,60,77,99,27,63},{-96,-90,-76,-44,-16,-8,0,0,2,2,8,14,16,18,18,20,20,28,34,44,68,74,84,90},{0,1,1,0,0,0,0,0,1,0,0,1,0},{3,4,5,8,9,15,26,26,26,35,39,40,42,43,45,45,48,52,54,56,57,67,74,77,79,80,81,86,87,92,95,97},{-76,-24,-12,66,-40,26,72,46,-56,58,-68,2,-82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,83,32,75,5,22,68,64,36,18,7,63,16,42,77,61,1,26,12,41,67,85,85,35,94,18,14,65,8,55,44,34,48,23,8,27,86,2,51,91}};
vector<int> param1 {16,8,7,40,23,10,26,6,27,28};
vector<int> param2 {16,6,5,39,12,8,24,10,17,24};
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 dist_count = 0; for ( int i = 0; i < n; i ++ ) { int j; for ( j = 0; j < n; j ++ ) if ( i != j && [MASK] [ j ] == arr [ i ] ) break; if ( j == n ) dist_count ++; if ( dist_count == k ) return arr [ i ]; } return - 1; }{
int j;
for ( j = 0;
j < n;
j ++ ) if ( i != j && arr [ j ] == arr [ i ] ) break;
if ( j == n ) dist_count ++;
if ( dist_count == k ) return arr [ i ];
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,3,8,18,20,33,53,56,60,71,76,80,81,87,88,89,92,95},{-78,6,32,52,-12,-32,22,-40,-82,24,30,10,-40},{0,0,0,0,0,1,1,1,1,1,1},{3,28,55,21,42,60,96,83,98,75,29,73,51,21,27,65,19,47,12,81,19,94,50,43,21,32,52,44,52,91,49,59,52,10,75,86,46,43,3,49,70,60,77,99,27,63},{-96,-90,-76,-44,-16,-8,0,0,2,2,8,14,16,18,18,20,20,28,34,44,68,74,84,90},{0,1,1,0,0,0,0,0,1,0,0,1,0},{3,4,5,8,9,15,26,26,26,35,39,40,42,43,45,45,48,52,54,56,57,67,74,77,79,80,81,86,87,92,95,97},{-76,-24,-12,66,-40,26,72,46,-56,58,-68,2,-82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,83,32,75,5,22,68,64,36,18,7,63,16,42,77,61,1,26,12,41,67,85,85,35,94,18,14,65,8,55,44,34,48,23,8,27,86,2,51,91}};
vector<int> param1 {16,8,7,40,23,10,26,6,27,28};
vector<int> param2 {16,6,5,39,12,8,24,10,17,24};
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;
} | arr | [
"a) size",
"b) arr",
"c) ],",
"d) )",
"e) dp"
] | 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 table [ n + 1 ], i;
for ( int j = 0;
j < n + 1;
j ++ ) table [ j ] = 0;
table [ 0 ] = 1;
for ( i = 3;
i <= n;
i ++ ) table [ i ] += table [ i - 3 ];
for ( i = 5;
i <= n;
i ++ ) table [ i ] += table [ i - 5 ];
for ( i = 10;
i <= n;
i ++ ) table [ i ] += table [ i - 10 ];
return table [ n ];
}
i ++ ) table [ i ] += table [ i - 3 ];
for ( i = 5;
i <= n;
i ++ ) table [ i ] += table [ i - 5 ];
for ( i = 10;
i <= n;
i ++ ) table [ i ] += table [ i - 10 ];
return table [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,29,17,12,93,55,97,75,22,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int table [ n + 1 ], i; for ( int j = 0; j < n + 1; j ++ ) table [ j ] = 0; table [ 0 ] = 1; for ( i = 3; i <= n; i ++ ) [MASK] [ i ] += table [ i - 3 ]; for ( i = 5; i <= n; i ++ ) table [ i ] += table [ i - 5 ]; for ( i = 10; i <= n; i ++ ) table [ i ] += table [ i - 10 ]; return table [ n ]; }i ++ ) table [ i ] += table [ i - 3 ];
for ( i = 5;
i <= n;
i ++ ) table [ i ] += table [ i - 5 ];
for ( i = 10;
i <= n;
i ++ ) table [ i ] += table [ i - 10 ];
return table [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,29,17,12,93,55,97,75,22,52};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | table | [
"a) (",
"b) i",
"c) table",
"d) return",
"e) sum"
] | 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 arr [ ], int n ) {
int max_idx = n - 1, min_idx = 0;
int max_elem = arr [ n - 1 ] + 1;
for ( int i = 0;
i < n;
i ++ ) {
if ( i % 2 == 0 ) {
arr [ i ] += ( arr [ max_idx ] % max_elem ) * max_elem;
max_idx --;
}
else {
arr [ i ] += ( arr [ min_idx ] % max_elem ) * max_elem;
min_idx ++;
}
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = arr [ i ] / max_elem;
}
max_idx --;
}
else {
arr [ i ] += ( arr [ min_idx ] % max_elem ) * max_elem;
min_idx ++;
}
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = arr [ i ] / max_elem;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94},{50,46,6,-57,67,34,-52,26,-93,97,-84,29,15,-63,65,25,-19,92,-38,-28,89,25,61,-34,-70,-80,88,-18,7,52,32,-63,32,-23,-11,46,-12,94,76,-67,-42},{0,0,0,0,0,0,1,1,1},{15,99,57,69,22,64,41,87,71,56,23,25,91,6,34,63,9,60,49,97,51,60,70,37,31,98,41,62,93,58,14,36,36,79,8,26,36,48,85,28,68,62,80,86,76,80,51},{-99,-99,-90,-90,-85,-85,-79,-77,-72,-71,-67,-66,-61,-39,-39,-35,-35,-23,-20,-18,-16,-13,-2,1,5,6,10,24,27,32,33,38,48,67,70,76,82,88},{0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,0,0,1,1,0,1,0,0,1,1,1,1,0,0,0,1,0},{2,22,32,34,43,66,70,74,94,94},{-99,-28,76,-50,41,-85,-47,72,-92,-26,-54,-31,14,47,66,23},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,31,26,42,41,23,47,13,89,66,66,16,73,28,77,35,41,77,31,85,32,54,98,72,59}};
vector<int> param1 {29,38,4,30,34,33,6,10,42,20};
vector<vector<int>> filled_function_param0 {{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94},{50,46,6,-57,67,34,-52,26,-93,97,-84,29,15,-63,65,25,-19,92,-38,-28,89,25,61,-34,-70,-80,88,-18,7,52,32,-63,32,-23,-11,46,-12,94,76,-67,-42},{0,0,0,0,0,0,1,1,1},{15,99,57,69,22,64,41,87,71,56,23,25,91,6,34,63,9,60,49,97,51,60,70,37,31,98,41,62,93,58,14,36,36,79,8,26,36,48,85,28,68,62,80,86,76,80,51},{-99,-99,-90,-90,-85,-85,-79,-77,-72,-71,-67,-66,-61,-39,-39,-35,-35,-23,-20,-18,-16,-13,-2,1,5,6,10,24,27,32,33,38,48,67,70,76,82,88},{0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,0,0,1,1,0,1,0,0,1,1,1,1,0,0,0,1,0},{2,22,32,34,43,66,70,74,94,94},{-99,-28,76,-50,41,-85,-47,72,-92,-26,-54,-31,14,47,66,23},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,31,26,42,41,23,47,13,89,66,66,16,73,28,77,35,41,77,31,85,32,54,98,72,59}};
vector<int> filled_function_param1 {29,38,4,30,34,33,6,10,42,20};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i]);
f_gold(¶m0[i].front(),param1[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int arr [ ], int n ) { int max_idx = n - 1, min_idx = 0; int max_elem = arr [ n - 1 ] + 1; for ( int i = 0; i < n; i ++ ) { if ( i % 2 == 0 ) { arr [ i ] += ( arr [ max_idx ] % max_elem ) * max_elem; max_idx --; } else { arr [ i ] += ( arr [ min_idx ] % max_elem ) * max_elem; min_idx ++; } } for ( int i = 0; i < n; i ++ ) arr [ [MASK] ] = arr [ i ] / max_elem; } max_idx --;
}
else {
arr [ i ] += ( arr [ min_idx ] % max_elem ) * max_elem;
min_idx ++;
}
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = arr [ i ] / max_elem;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94},{50,46,6,-57,67,34,-52,26,-93,97,-84,29,15,-63,65,25,-19,92,-38,-28,89,25,61,-34,-70,-80,88,-18,7,52,32,-63,32,-23,-11,46,-12,94,76,-67,-42},{0,0,0,0,0,0,1,1,1},{15,99,57,69,22,64,41,87,71,56,23,25,91,6,34,63,9,60,49,97,51,60,70,37,31,98,41,62,93,58,14,36,36,79,8,26,36,48,85,28,68,62,80,86,76,80,51},{-99,-99,-90,-90,-85,-85,-79,-77,-72,-71,-67,-66,-61,-39,-39,-35,-35,-23,-20,-18,-16,-13,-2,1,5,6,10,24,27,32,33,38,48,67,70,76,82,88},{0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,0,0,1,1,0,1,0,0,1,1,1,1,0,0,0,1,0},{2,22,32,34,43,66,70,74,94,94},{-99,-28,76,-50,41,-85,-47,72,-92,-26,-54,-31,14,47,66,23},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,31,26,42,41,23,47,13,89,66,66,16,73,28,77,35,41,77,31,85,32,54,98,72,59}};
vector<int> param1 {29,38,4,30,34,33,6,10,42,20};
vector<vector<int>> filled_function_param0 {{1,1,2,3,9,10,14,22,26,28,29,29,30,32,32,32,34,37,39,40,42,42,42,43,45,47,49,52,53,54,56,58,59,68,71,73,76,81,81,83,84,91,94},{50,46,6,-57,67,34,-52,26,-93,97,-84,29,15,-63,65,25,-19,92,-38,-28,89,25,61,-34,-70,-80,88,-18,7,52,32,-63,32,-23,-11,46,-12,94,76,-67,-42},{0,0,0,0,0,0,1,1,1},{15,99,57,69,22,64,41,87,71,56,23,25,91,6,34,63,9,60,49,97,51,60,70,37,31,98,41,62,93,58,14,36,36,79,8,26,36,48,85,28,68,62,80,86,76,80,51},{-99,-99,-90,-90,-85,-85,-79,-77,-72,-71,-67,-66,-61,-39,-39,-35,-35,-23,-20,-18,-16,-13,-2,1,5,6,10,24,27,32,33,38,48,67,70,76,82,88},{0,0,0,1,0,1,0,1,1,1,0,0,0,1,0,0,0,0,1,1,0,0,0,1,0,1,1,0,0,0,1,1,0,1,0,0,1,1,1,1,0,0,0,1,0},{2,22,32,34,43,66,70,74,94,94},{-99,-28,76,-50,41,-85,-47,72,-92,-26,-54,-31,14,47,66,23},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,31,26,42,41,23,47,13,89,66,66,16,73,28,77,35,41,77,31,85,32,54,98,72,59}};
vector<int> filled_function_param1 {29,38,4,30,34,33,6,10,42,20};
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;
} | i | [
"a) return",
"b) 0",
"c) )",
"d) (",
"e) i"
] | 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 n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
<iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,39,73,8,28,66,20,36,6,51};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int n ) { if ( n <= 1 [MASK] return false; for ( int i = 2; i < n; i ++ ) if ( n % i == 0 ) return false; return true; } <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
if ( n <= 1 ) return false;
for ( int i = 2;
i < n;
i ++ ) if ( n % i == 0 ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,39,73,8,28,66,20,36,6,51};
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) 1",
"b) {",
"c) arr",
"d) +",
"e) )"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
for ( int sum = 0, i = 1;
sum < n;
i += 2 ) {
sum += i;
if ( sum == n ) return true;
}
return false;
}
anip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
for ( int sum = 0, i = 1;
sum < n;
i += 2 ) {
sum += i;
if ( sum == n ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,9,25,36,3,121,14,17,80};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int n ) { for ( int [MASK] = 0, i = 1; sum < n; i += 2 ) { sum += i; if ( sum == n ) return true; } return false; }anip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n ) {
for ( int sum = 0, i = 1;
sum < n;
i += 2 ) {
sum += i;
if ( sum == n ) return true;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,4,9,25,36,3,121,14,17,80};
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;
} | sum | [
"a) (",
"b) (",
"c) sum",
"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 ) {
int sum = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) sum += str [ i ] - '0';
return ( sum == n - 1 || sum == 1 );
}
>
using namespace std;
bool f_gold ( string str ) {
int sum = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) sum += str [ i ] - '0';
return ( sum == n - 1 || sum == 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> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str ) { int sum = 0; int n = str . length [MASK] ); for ( int i = 0; i < n; i ++ ) sum += str [ i ] - '0'; return ( sum == n - 1 || sum == 1 ); }>
using namespace std;
bool f_gold ( string str ) {
int sum = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) sum += str [ i ] - '0';
return ( sum == n - 1 || sum == 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;
} | ( | [
"a) (",
"b) divisor",
"c) y1",
"d) i",
"e) {"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int p ) {
long long checkNumber = pow ( 2, p ) - 1;
long long nextval = 4 % checkNumber;
for ( int i = 1;
i < p - 1;
i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber;
return ( nextval == 0 );
}
long checkNumber = pow ( 2, p ) - 1;
long long nextval = 4 % checkNumber;
for ( int i = 1;
i < p - 1;
i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber;
return ( nextval == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,27,31,47,3,14,41,72,39,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; bool f_gold ( int p ) { long long checkNumber = pow ( 2, p ) - 1; long long nextval = 4 % [MASK] for ( int i = 1; i < p - 1; i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber; return ( nextval == 0 ); }long checkNumber = pow ( 2, p ) - 1;
long long nextval = 4 % checkNumber;
for ( int i = 1;
i < p - 1;
i ++ ) nextval = ( nextval * nextval - 2 ) % checkNumber;
return ( nextval == 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,27,31,47,3,14,41,72,39,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;
} | checkNumber; | [
"a) ;",
"b) 1",
"c) f_gold",
"d) checkNumber;",
"e) 0"
] | 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 + 1 ] [ m + 1 ];
for ( int i = 0;
i <= n;
i ++ ) dp [ i ] [ 0 ] = 1;
for ( int i = 0;
i <= m;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= m;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i ] [ j - 1 ];
return dp [ n ] [ m ];
}
i <= m;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= m;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i ] [ j - 1 ];
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {55,74,76,6,2,36,40,14,42,62};
vector<int> param1 {30,15,57,90,64,1,71,56,4,12};
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 + 1 ] [ m + 1 ]; for ( int i = 0; i <= n; i ++ ) dp [ i ] [ 0 ] = 1; for ( int [MASK] = 0; i <= m; i ++ ) dp [ 0 ] [ i ] = 1; for ( int i = 1; i <= n; i ++ ) for ( int j = 1; j <= m; j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i ] [ j - 1 ]; return dp [ n ] [ m ]; } i <= m;
i ++ ) dp [ 0 ] [ i ] = 1;
for ( int i = 1;
i <= n;
i ++ ) for ( int j = 1;
j <= m;
j ++ ) dp [ i ] [ j ] = dp [ i - 1 ] [ j ] + dp [ i ] [ j - 1 ];
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {55,74,76,6,2,36,40,14,42,62};
vector<int> param1 {30,15,57,90,64,1,71,56,4,12};
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;
} | i | [
"a) i",
"b) :",
"c) )",
"d) if",
"e) 2"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( 2 * n - 1 );
}
eam>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( 2 * n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,44,58,10,31,53,94,64,71,59};
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 ) { return n * ( 2 * n - 1 ); }eam>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( 2 * n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {38,44,58,10,31,53,94,64,71,59};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <string> | [
"a) ,",
"b) >",
"c) i",
"d) <string>",
"e) n"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
return ( a + b ) / 2;
}
>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
return ( a + b ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,6,75,51,19,82,72,48,12,41};
vector<int> param1 {44,61,20,17,25,98,21,41,17,80};
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; [MASK] f_gold ( int a, int b ) { return ( a + b ) / 2; }>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
return ( a + b ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,6,75,51,19,82,72,48,12,41};
vector<int> param1 {44,61,20,17,25,98,21,41,17,80};
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;
} | int | [
"a) [",
"b) i",
"c) int",
"d) return",
"e) /"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n, int m ) {
if ( n > m ) return true;
bool DP [ m ];
memset ( DP, false, m );
for ( int i = 0;
i < n;
i ++ ) {
if ( DP [ 0 ] ) return true;
bool temp [ m ];
memset ( temp, false, m );
for ( int j = 0;
j < m;
j ++ ) {
if ( DP [ j ] == true ) {
if ( DP [ ( j + arr [ i ] ) % m ] == false ) temp [ ( j + arr [ i ] ) % m ] = true;
}
}
for ( int j = 0;
j < m;
j ++ ) if ( temp [ j ] ) DP [ j ] = true;
DP [ arr [ i ] % m ] = true;
}
return DP [ 0 ];
}
false ) temp [ ( j + arr [ i ] ) % m ] = true;
}
}
for ( int j = 0;
j < m;
j ++ ) if ( temp [ j ] ) DP [ j ] = true;
DP [ arr [ i ] % m ] = true;
}
return DP [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,12,13,13,15,18,20,21,22,26,27,41,41,50,53,57,58,58,61,62,62,64,70,75,78,79,81,81,81,83,86,91,93,95,97,99,99},{1, 6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{50,20,79,42,85,24,20,76,36,88,40,5,24,85,7,19,43,51,94,13,53,93,92,43,97,38,80,48,52,47,77,56,41,80,32,34,77,14,70,3},{-96,-94,-72,-58,-48,-36,-28,-26,-10,-10,-8,-8,-6,2,14,30,30,54,58,60,64,68,78,84,96,98},{1,0,1,1,0,0,1,1,1,0,0},{2,7,8,15,18,23,24,25,27,35,40,42,43,46,48,50,53,64,66,69,70,71,72,77,78,80,81,81,81,82,82,82,84,87,97,98},{46,54,24,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,21,38,6,38,44,96,1,16,1,28,4,55,8}};
vector<int> param1 {36,2,32,29,16,7,23,3,21,12};
vector<int> param2 {3540,5,101,27,18,8,33,37,34,228};
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 n, int m ) { if ( n > m ) return true; bool DP [ m ]; memset ( DP, false, m ); for ( int i = 0; i < n; i ++ ) { if ( DP [ 0 ] ) return true; bool temp [ m ]; memset ( temp, false, m ); for ( int j = 0; j < m; j ++ ) { if ( DP [ j ] == true ) { if ( DP [ ( j + arr [ i [MASK] ) % m ] == false ) temp [ ( j + arr [ i ] ) % m ] = true; } } for ( int j = 0; j < m; j ++ ) if ( temp [ j ] ) DP [ j ] = true; DP [ arr [ i ] % m ] = true; } return DP [ 0 ]; }false ) temp [ ( j + arr [ i ] ) % m ] = true;
}
}
for ( int j = 0;
j < m;
j ++ ) if ( temp [ j ] ) DP [ j ] = true;
DP [ arr [ i ] % m ] = true;
}
return DP [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,12,13,13,15,18,20,21,22,26,27,41,41,50,53,57,58,58,61,62,62,64,70,75,78,79,81,81,81,83,86,91,93,95,97,99,99},{1, 6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{50,20,79,42,85,24,20,76,36,88,40,5,24,85,7,19,43,51,94,13,53,93,92,43,97,38,80,48,52,47,77,56,41,80,32,34,77,14,70,3},{-96,-94,-72,-58,-48,-36,-28,-26,-10,-10,-8,-8,-6,2,14,30,30,54,58,60,64,68,78,84,96,98},{1,0,1,1,0,0,1,1,1,0,0},{2,7,8,15,18,23,24,25,27,35,40,42,43,46,48,50,53,64,66,69,70,71,72,77,78,80,81,81,81,82,82,82,84,87,97,98},{46,54,24,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,21,38,6,38,44,96,1,16,1,28,4,55,8}};
vector<int> param1 {36,2,32,29,16,7,23,3,21,12};
vector<int> param2 {3540,5,101,27,18,8,33,37,34,228};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) int",
"b) ]",
"c) ;",
"d) y)",
"e) and"
] | 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 str ) {
int n = str . length ( );
int dp [ n + 1 ] [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) for ( int j = 0;
j <= n;
j ++ ) dp [ i ] [ j ] = 0;
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 1;
j <= n;
j ++ ) {
if ( str [ i - 1 ] == str [ j - 1 ] && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = max ( dp [ i ] [ j - 1 ], dp [ i - 1 ] [ j ] );
}
}
return dp [ n ] [ n ];
}
[ i - 1 ] == str [ j - 1 ] && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = max ( dp [ i ] [ j - 1 ], dp [ i - 1 ] [ j ] );
}
}
return dp [ n ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"JxZFz","7648992235770","11100000","cRN SgYjPsctJ","434","1","JRfZIAsbrPBZ","03779368305592","1111000","BkULuIi"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string str ) { int n = str . length ( ); int dp [ n + 1 ] [ n + 1 ]; for ( int i = 0; i <= n; i ++ ) for ( int j = 0; [MASK] <= n; j ++ ) dp [ i ] [ j ] = 0; for ( int i = 1; i <= n; i ++ ) { for ( int j = 1; j <= n; j ++ ) { if ( str [ i - 1 ] == str [ j - 1 ] && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ]; else dp [ i ] [ j ] = max ( dp [ i ] [ j - 1 ], dp [ i - 1 ] [ j ] ); } } return dp [ n ] [ n ]; }[ i - 1 ] == str [ j - 1 ] && i != j ) dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = max ( dp [ i ] [ j - 1 ], dp [ i - 1 ] [ j ] );
}
}
return dp [ n ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"JxZFz","7648992235770","11100000","cRN SgYjPsctJ","434","1","JRfZIAsbrPBZ","03779368305592","1111000","BkULuIi"};
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;
} | j | [
"a) k",
"b) <string>",
"c) elif",
"d) j",
"e) return"
] | 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 S [ ], int n ) {
bool found = false;
sort ( S, S + n );
for ( int i = n - 1;
i >= 0;
i -- ) {
for ( int j = 0;
j < n;
j ++ ) {
if ( i == j ) continue;
for ( int k = j + 1;
k < n;
k ++ ) {
if ( i == k ) continue;
for ( int l = k + 1;
l < n;
l ++ ) {
if ( i == l ) continue;
if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) {
found = true;
return S [ i ];
}
}
}
}
}
if ( found == false ) return INT_MIN;
}
e;
if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) {
found = true;
return S [ i ];
}
}
}
}
}
if ( found == false ) return INT_MIN;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98},{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,-96,42,-20,10,74,-56,-12,-28,-40},{0,0,0,0,0,0,0,1,1,1},{84,58,10,67,77,66,10,47,65,55,54},{-46,-28,-20,-18,4,8,18,38,90,90},{0,1,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1,1,0,0,1,0,0,0,0,1,0,1,0,0,1,1,0,1,1,0,0,1,0,0,1,0,1,0},{11,13,14,21,26,28,36,39,41,42,43,44,49,49,57,58,59,59,63,64,67,69,70,75,78,79,83,83,86,91,92,93,96,96,96,97},{74,52,-16,34,-88,62,54,46,-82,76,-48,54,50,-66,-18,78,-48,38,96,-32,-82,0,-76,46,-56,4,-30,-70,-62},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{55,74,18,4,68,66,33,61,66,92,21,9,49,14,99,87,74,6,11,25,5,58,56,20}};
vector<int> param1 {24,19,8,5,6,35,30,16,17,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int S [ ], int n ) { bool found = false; sort ( S, S + n ); for ( int i = n - 1; i >= 0; i -- ) { for ( int j = 0; j < n; j ++ ) { if ( i == j ) continue; for ( int k = j + 1; k < n; k ++ ) { if ( i == k ) continue; for ( int l = k + 1; l < n; l ++ ) { if ( i == l ) continue; [MASK] ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) { found = true; return S [ i ]; } } } } } if ( found == false ) return INT_MIN; }e;
if ( S [ i ] == S [ j ] + S [ k ] + S [ l ] ) {
found = true;
return S [ i ];
}
}
}
}
}
if ( found == false ) return INT_MIN;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,12,14,15,16,20,27,28,29,30,35,41,46,51,53,55,55,58,63,64,72,73,75,75,75,82,82,86,89,91,92,94,95,95,97,97,98},{-62,48,-22,-44,-58,-50,-82,34,26,-2,86,-44,92,-96,42,-20,10,74,-56,-12,-28,-40},{0,0,0,0,0,0,0,1,1,1},{84,58,10,67,77,66,10,47,65,55,54},{-46,-28,-20,-18,4,8,18,38,90,90},{0,1,1,1,0,1,1,0,0,1,1,0,0,0,0,1,1,1,1,0,0,1,0,0,0,0,1,0,1,0,0,1,1,0,1,1,0,0,1,0,0,1,0,1,0},{11,13,14,21,26,28,36,39,41,42,43,44,49,49,57,58,59,59,63,64,67,69,70,75,78,79,83,83,86,91,92,93,96,96,96,97},{74,52,-16,34,-88,62,54,46,-82,76,-48,54,50,-66,-18,78,-48,38,96,-32,-82,0,-76,46,-56,4,-30,-70,-62},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{55,74,18,4,68,66,33,61,66,92,21,9,49,14,99,87,74,6,11,25,5,58,56,20}};
vector<int> param1 {24,19,8,5,6,35,30,16,17,23};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | if | [
"a) 2",
"b) {",
"c) s1",
"d) :",
"e) if"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
if ( x >= arr [ n - 1 ] ) return n - 1;
if ( x < arr [ 0 ] ) return - 1;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i ] > x ) return ( i - 1 );
return - 1;
}
t arr [ ], int n, int x ) {
if ( x >= arr [ n - 1 ] ) return n - 1;
if ( x < arr [ 0 ] ) return - 1;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i ] > x ) return ( i - 1 );
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,9,10,11,36,39,50,70,75,99},{-60,96,8,88,-98,56,-46,50,38,-62,46,36,68,88,46,94,16,2,78,-64,74,44,22,96,-52,66,86,-74,60,-4,56,-34,20,62,6,62,78,28,-72,-6,34,70,34,-38,-10,86,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,39,73,75,10,12,99,87,99,24,91,15,7,96,97,87,80,9,6,57,29,78,80,91,74,17},{-90,-88,-86,-72,-66,-52,-48,-40,-36,-28,4,6,18,20,22,36,46,56,96},{1},{1,5,10,10,11,11,14,15,18,18,21,23,28,28,29,31,33,34,38,38,42,47,47,48,48,48,51,51,53,56,61,64,64,66,70,71,72,80,82,88,88,90,91,92,92,94,98,98},{-12,18,-92,-68,-48,-96,16,-22,-36,-24,66,-80,60,70,36,6,36,86,-10,-18,-84,2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,66}};
vector<int> param1 {8,44,37,25,18,0,25,15,26,1};
vector<int> param2 {5,32,24,22,9,0,24,16,23,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int x ) { if ( x >= arr [ n - 1 ] ) return n - 1; if ( x < arr [ 0 ] ) return - 1; for ( int i = 1; i < n; i ++ ) if ( arr [MASK] i ] > x ) return ( i - 1 ); return - 1; }t arr [ ], int n, int x ) {
if ( x >= arr [ n - 1 ] ) return n - 1;
if ( x < arr [ 0 ] ) return - 1;
for ( int i = 1;
i < n;
i ++ ) if ( arr [ i ] > x ) return ( i - 1 );
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,9,10,11,36,39,50,70,75,99},{-60,96,8,88,-98,56,-46,50,38,-62,46,36,68,88,46,94,16,2,78,-64,74,44,22,96,-52,66,86,-74,60,-4,56,-34,20,62,6,62,78,28,-72,-6,34,70,34,-38,-10,86,-28},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,39,73,75,10,12,99,87,99,24,91,15,7,96,97,87,80,9,6,57,29,78,80,91,74,17},{-90,-88,-86,-72,-66,-52,-48,-40,-36,-28,4,6,18,20,22,36,46,56,96},{1},{1,5,10,10,11,11,14,15,18,18,21,23,28,28,29,31,33,34,38,38,42,47,47,48,48,48,51,51,53,56,61,64,64,66,70,71,72,80,82,88,88,90,91,92,92,94,98,98},{-12,18,-92,-68,-48,-96,16,-22,-36,-24,66,-80,60,70,36,6,36,86,-10,-18,-84,2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{39,66}};
vector<int> param1 {8,44,37,25,18,0,25,15,26,1};
vector<int> param2 {5,32,24,22,9,0,24,16,23,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) <fstream>",
"b) f_gold",
"c) <",
"d) int",
"e) ["
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > hM;
int sum = 0;
int max_len = 0;
int ending_index = - 1;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = ( arr [ i ] == 0 ) ? - 1 : 1;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ];
if ( sum == 0 ) {
max_len = i + 1;
ending_index = i;
}
if ( hM . find ( sum + n ) != hM . end ( ) ) {
if ( max_len < i - hM [ sum + n ] ) {
max_len = i - hM [ sum + n ];
ending_index = i;
}
}
else hM [ sum + n ] = i;
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1;
printf ( "%d to %d\n", ending_index - max_len + 1, ending_index );
return max_len;
}
else hM [ sum + n ] = i;
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1;
printf ( "%d to %d\n", ending_index - max_len + 1, ending_index );
return max_len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,16,16,18,19,22,39,40,42,60,66,69,70,70,73,74,80,99},{-88,-66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{85,98,67,27,98,13,96,32,26,44,32},{-96,-94,-90,-88,-86,-66,-64,-52,-46,-46,-42,-40,-38,-32,-28,-22,-16,-10,-8,-8,-4,2,10,26,26,28,28,40,40,42,50,60,66,68,72,74,86,92,94},{1,1,1,1,1,1,0,0,0},{25,64,86},{-4,78,-76,12,4,-38,-98,-26,-8,-98,56,0,-34,36,-90,-36,54,-68,12,-44,62,60,-34,-52,18},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{2,25,45,98,71,8,58,94,53}};
vector<int> param1 {9,1,19,8,34,4,1,17,9,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_map < int, int > hM; int sum = 0; int max_len = 0; int ending_index = - 1; for ( int i = 0; i < n; i ++ ) arr [ i ] = ( arr [ i ] == 0 ) ? - 1 : 1; for ( int i = 0; i < n; i ++ ) { sum += arr [ i ]; if ( sum == 0 ) { max_len = i + 1; ending_index = i; } if ( hM . find ( sum + n ) != hM . end ( ) ) { if ( max_len < i - hM [ sum + n ] ) { max_len = i - hM [ sum + n ]; ending_index = [MASK] } } else hM [ sum + n ] = i; } for ( int i = 0; i < n; i ++ ) arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1; printf ( "%d to %d\n", ending_index - max_len + 1, ending_index ); return max_len; }else hM [ sum + n ] = i;
}
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = ( arr [ i ] == - 1 ) ? 0 : 1;
printf ( "%d to %d\n", ending_index - max_len + 1, ending_index );
return max_len;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,16,16,18,19,22,39,40,42,60,66,69,70,70,73,74,80,99},{-88,-66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{85,98,67,27,98,13,96,32,26,44,32},{-96,-94,-90,-88,-86,-66,-64,-52,-46,-46,-42,-40,-38,-32,-28,-22,-16,-10,-8,-8,-4,2,10,26,26,28,28,40,40,42,50,60,66,68,72,74,86,92,94},{1,1,1,1,1,1,0,0,0},{25,64,86},{-4,78,-76,12,4,-38,-98,-26,-8,-98,56,0,-34,36,-90,-36,54,-68,12,-44,62,60,-34,-52,18},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{2,25,45,98,71,8,58,94,53}};
vector<int> param1 {9,1,19,8,34,4,1,17,9,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | i; | [
"a) %",
"b) i;",
"c) 1",
"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 ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( mp [ arr [ i ] ] == 1 ) return arr [ i ];
return - 1;
}
n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( mp [ arr [ i ] ] == 1 ) return arr [ i ];
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,14,18,18,18,21,25,28,38,40,42,42,45,48,50,50,50,53,54,58,59,62,65,65,66,67,68,69,73,74,76,77,83,84,85,87},{24,-84,86,-50,60,-36,92,70,84,40,-8,74,-24,-38,98,40,-78,-36,38,-22,-98,82,-22,80,-80,-62,16,-46,18,64,16,2,24,-92,-46,42,38,8,72,8,14,-68,18,16,-82,8,58,-2},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{59,77,13,49,90},{-80,-76,-66,-60,-44,-42,-38,-36,-32,-30,-24,-18,-6,2,4,14,32,42,54,70,92,98},{0,0,0,0,1,0,1,0,0,1,0,0,0,1,0,1,1,1,0,1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0,0,0,0},{6,22,24,27,29,30,35,42,57,59,59,63,71,73,76,98},{-82,-48,36},{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},{88,49,13,64,30,60,26,55,55,97,98,69,72,72,79,59,46,87,76,61,87,12,91,8,34,15,93,64,83,33,69,58,32,14,72,67,25,7,55,21,12,78,63}};
vector<int> param1 {33,25,16,2,12,33,13,1,35,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, int > mp; for ( int i = 0; i < n; i ++ ) mp [ arr [ i ] ] ++; for ( int i = 0; i < n; i ++ ) if ( mp [ arr [ i ] ] == 1 ) return arr [ i ]; return - [MASK] }n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ arr [ i ] ] ++;
for ( int i = 0;
i < n;
i ++ ) if ( mp [ arr [ i ] ] == 1 ) return arr [ i ];
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,7,14,18,18,18,21,25,28,38,40,42,42,45,48,50,50,50,53,54,58,59,62,65,65,66,67,68,69,73,74,76,77,83,84,85,87},{24,-84,86,-50,60,-36,92,70,84,40,-8,74,-24,-38,98,40,-78,-36,38,-22,-98,82,-22,80,-80,-62,16,-46,18,64,16,2,24,-92,-46,42,38,8,72,8,14,-68,18,16,-82,8,58,-2},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{59,77,13,49,90},{-80,-76,-66,-60,-44,-42,-38,-36,-32,-30,-24,-18,-6,2,4,14,32,42,54,70,92,98},{0,0,0,0,1,0,1,0,0,1,0,0,0,1,0,1,1,1,0,1,0,1,0,1,1,0,0,1,1,1,1,0,0,0,0,0,0,0},{6,22,24,27,29,30,35,42,57,59,59,63,71,73,76,98},{-82,-48,36},{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},{88,49,13,64,30,60,26,55,55,97,98,69,72,72,79,59,46,87,76,61,87,12,91,8,34,15,93,64,83,33,69,58,32,14,72,67,25,7,55,21,12,78,63}};
vector<int> param1 {33,25,16,2,12,33,13,1,35,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;
} | 1; | [
"a) <=",
"b) 1;",
"c) )",
"d) (",
"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 ) {
unordered_map < int, int > hash;
for ( int i = 0;
i < n;
i ++ ) hash [ arr [ i ] ] ++;
int max_count = 0, res = - 1;
for ( auto i : hash ) {
if ( max_count < i . second ) {
res = i . first;
max_count = i . second;
}
}
return res;
}
hash [ arr [ i ] ] ++;
int max_count = 0, res = - 1;
for ( auto i : hash ) {
if ( max_count < i . second ) {
res = i . first;
max_count = i . second;
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,7,9,9,10,11,15,19,19,29,31,34,34,35,37,41,43,45,47,51,51,55,57,59,61,65,67,73,76,77,77,80,83,83,84,84,92,94},{14,-38,-84,24,82,-68,60,2,-22,54,90,90,-38,-8,-72,68,50,54,-32,-66,-10,-70,-28,18,58,-54,-30,60,-24,-48,22,32,-18,2,-64,-56,70,-92,-38,-70,22,-36,-64},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{76,18,41,46,34,41,56,76,14,82,51,87,1,92,9,2,68,82,43,98,88,62,84,25,7,87,37,7,55,98,60,99,92,56,17,82,28,43,40,1,99,79,38,75,84,61,21,11},{-92,-86,-86,-84,-70,-68,-68,-66,-62,-52,-52,-50,-48,-38,-22,-14,-6,4,8,10,10,16,22,36,38,40,50,50,70,78,80,86,96,96,98},{1,1,0,1,1,0,1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0},{3,53,56,57,66,73,76,94,97},{12,60,-94,92},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{95,93,82,73,61,24,73,21,47,91,48,42,76,12,89,21,3,30,5,49,26,54,16,70,50,21,58,36,16}};
vector<int> param1 {24,28,18,37,21,18,8,3,21,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_map < int, int > hash; for ( int i = 0; i < n; i ++ ) hash [ [MASK] [ i ] ] ++; int max_count = 0, res = - 1; for ( auto i : hash ) { if ( max_count < i . second ) { res = i . first; max_count = i . second; } } return res; } hash [ arr [ i ] ] ++;
int max_count = 0, res = - 1;
for ( auto i : hash ) {
if ( max_count < i . second ) {
res = i . first;
max_count = i . second;
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,7,9,9,10,11,15,19,19,29,31,34,34,35,37,41,43,45,47,51,51,55,57,59,61,65,67,73,76,77,77,80,83,83,84,84,92,94},{14,-38,-84,24,82,-68,60,2,-22,54,90,90,-38,-8,-72,68,50,54,-32,-66,-10,-70,-28,18,58,-54,-30,60,-24,-48,22,32,-18,2,-64,-56,70,-92,-38,-70,22,-36,-64},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{76,18,41,46,34,41,56,76,14,82,51,87,1,92,9,2,68,82,43,98,88,62,84,25,7,87,37,7,55,98,60,99,92,56,17,82,28,43,40,1,99,79,38,75,84,61,21,11},{-92,-86,-86,-84,-70,-68,-68,-66,-62,-52,-52,-50,-48,-38,-22,-14,-6,4,8,10,10,16,22,36,38,40,50,50,70,78,80,86,96,96,98},{1,1,0,1,1,0,1,1,1,1,1,0,0,1,1,1,0,0,0,1,0,0,1,1,1,0,0,0},{3,53,56,57,66,73,76,94,97},{12,60,-94,92},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{95,93,82,73,61,24,73,21,47,91,48,42,76,12,89,21,3,30,5,49,26,54,16,70,50,21,58,36,16}};
vector<int> param1 {24,28,18,37,21,18,8,3,21,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | arr | [
"a) }",
"b) ]",
"c) oneSeen",
"d) arr",
"e) return"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
double volume = ( pow ( side, 3 ) / ( 6 * sqrt ( 2 ) ) );
return volume;
}
tor>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
double volume = ( pow ( side, 3 ) / ( 6 * sqrt ( 2 ) ) );
return volume;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,56,35,99,13,45,40,92,7,13};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( int [MASK] ) { double volume = ( pow ( side, 3 ) / ( 6 * sqrt ( 2 ) ) ); return volume; }tor>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( int side ) {
double volume = ( pow ( side, 3 ) / ( 6 * sqrt ( 2 ) ) );
return volume;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {58,56,35,99,13,45,40,92,7,13};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | side | [
"a) ==",
"b) side",
"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 bin ) {
int n = bin . size ( );
if ( bin [ n - 1 ] == '1' ) return false;
int sum = 0;
for ( int i = n - 2;
i >= 0;
i -- ) {
if ( bin [ i ] == '1' ) {
int posFromRight = n - i - 1;
if ( posFromRight % 4 == 1 ) sum = sum + 2;
else if ( posFromRight % 4 == 2 ) sum = sum + 4;
else if ( posFromRight % 4 == 3 ) sum = sum + 8;
else if ( posFromRight % 4 == 0 ) sum = sum + 6;
}
}
if ( sum % 10 == 0 ) return true;
return false;
}
== 2 ) sum = sum + 4;
else if ( posFromRight % 4 == 3 ) sum = sum + 8;
else if ( posFromRight % 4 == 0 ) sum = sum + 6;
}
}
if ( sum % 10 == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"101000","39613456759141","11","PoiHjo","2","0000101","T s dZKeDX gK","3944713969","1000","ifYUgdpmt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include [MASK] #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string bin ) { int n = bin . size ( ); if ( bin [ n - 1 ] == '1' ) return false; int sum = 0; for ( int i = n - 2; i >= 0; i -- ) { if ( bin [ i ] == '1' ) { int posFromRight = n - i - 1; if ( posFromRight % 4 == 1 ) sum = sum + 2; else if ( posFromRight % 4 == 2 ) sum = sum + 4; else if ( posFromRight % 4 == 3 ) sum = sum + 8; else if ( posFromRight % 4 == 0 ) sum = sum + 6; } } if ( sum % 10 == 0 ) return true; return false; } == 2 ) sum = sum + 4;
else if ( posFromRight % 4 == 3 ) sum = sum + 8;
else if ( posFromRight % 4 == 0 ) sum = sum + 6;
}
}
if ( sum % 10 == 0 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"101000","39613456759141","11","PoiHjo","2","0000101","T s dZKeDX gK","3944713969","1000","ifYUgdpmt"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <vector> | [
"a) ((int)",
"b) <vector>",
"c) (",
"d) len",
"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 * jumps = new int [ n ];
int min;
jumps [ n - 1 ] = 0;
for ( int i = n - 2;
i >= 0;
i -- ) {
if ( arr [ i ] == 0 ) jumps [ i ] = INT_MAX;
else if ( arr [ i ] >= n - i - 1 ) jumps [ i ] = 1;
else {
min = INT_MAX;
for ( int j = i + 1;
j < n && j <= arr [ i ] + i;
j ++ ) {
if ( min > jumps [ j ] ) min = jumps [ j ];
}
if ( min != INT_MAX ) jumps [ i ] = min + 1;
else jumps [ i ] = min;
}
}
return jumps [ 0 ];
}
] + i;
j ++ ) {
if ( min > jumps [ j ] ) min = jumps [ j ];
}
if ( min != INT_MAX ) jumps [ i ] = min + 1;
else jumps [ i ] = min;
}
}
return jumps [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,6,7,14,22,32,42,42,43,48,54,57,59,69,84,92,98},{98,-66,-70,-64,-88,-76,-90,16,58,68,-10,-42,-28,10,72,68,-30,60,92,-56,80,-4,-82,30,58,98,-56,98,-14,-38,-20,-74,-46,-22,78,36,-54,-64,80,-10,-26,82,96,-72,-36,-36,-32,-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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{64,25,63,54,7,43,79,27,34,13,84,80,34,48,5,56,67,2},{2,28,68},{1,0,0,0,0,1,1,1,1,0,1,0,0},{1,1,9,16,17,18,19,20,21,22,25,28,29,29,36,37,40,40,42,48,49,49,55,63,65,66,69,70,72,73,76,77,77,79,79,81,81,93,95,99},{38,-42,-8,98,-90,38,88,-8,70,-28,-50,-22,28,24,88,-26,58,48,6,0,68,-6,8,54,-2,46,-44,96,-82,-14,-48,-18,-16,-48,-44,-16,-58,-64},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{98,46,12,55,57,11,25,64,92,35,90,72,95,30,75,67,64,12,31,84,70,96,71,80,62,34,70,10,54}};
vector<int> param1 {11,26,41,10,2,11,24,34,14,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int * jumps = new int [ n ]; int min; jumps [ n - 1 ] = 0; for ( int i = n - 2; i >= 0; i -- ) { if ( arr [ i ] == 0 ) jumps [ i ] = INT_MAX; else if ( arr [ i ] >= n - i - 1 ) jumps [ i ] = 1; else { min = INT_MAX; for ( int j = i + 1; j < n && j <= arr [ i ] + i; j ++ ) { [MASK] ( min > jumps [ j ] ) min = jumps [ j ]; } if ( min != INT_MAX ) jumps [ i ] = min + 1; else jumps [ i ] = min; } } return jumps [ 0 ]; }] + i;
j ++ ) {
if ( min > jumps [ j ] ) min = jumps [ j ];
}
if ( min != INT_MAX ) jumps [ i ] = min + 1;
else jumps [ i ] = min;
}
}
return jumps [ 0 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,6,7,14,22,32,42,42,43,48,54,57,59,69,84,92,98},{98,-66,-70,-64,-88,-76,-90,16,58,68,-10,-42,-28,10,72,68,-30,60,92,-56,80,-4,-82,30,58,98,-56,98,-14,-38,-20,-74,-46,-22,78,36,-54,-64,80,-10,-26,82,96,-72,-36,-36,-32,-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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{64,25,63,54,7,43,79,27,34,13,84,80,34,48,5,56,67,2},{2,28,68},{1,0,0,0,0,1,1,1,1,0,1,0,0},{1,1,9,16,17,18,19,20,21,22,25,28,29,29,36,37,40,40,42,48,49,49,55,63,65,66,69,70,72,73,76,77,77,79,79,81,81,93,95,99},{38,-42,-8,98,-90,38,88,-8,70,-28,-50,-22,28,24,88,-26,58,48,6,0,68,-6,8,54,-2,46,-44,96,-82,-14,-48,-18,-16,-48,-44,-16,-58,-64},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{98,46,12,55,57,11,25,64,92,35,90,72,95,30,75,67,64,12,31,84,70,96,71,80,62,34,70,10,54}};
vector<int> param1 {11,26,41,10,2,11,24,34,14,25};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | if | [
"a) sign",
"b) i",
"c) long",
"d) if",
"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 text, int s ) {
string result = "";
for ( int i = 0;
i < text . length ( );
i ++ ) {
if ( isupper ( text [ i ] ) ) result += char ( int ( text [ i ] + s - 65 ) % 26 + 65 );
else result += char ( int ( text [ i ] + s - 97 ) % 26 + 97 );
}
return result;
}
);
i ++ ) {
if ( isupper ( text [ i ] ) ) result += char ( int ( text [ i ] + s - 65 ) % 26 + 65 );
else result += char ( int ( text [ i ] + s - 97 ) % 26 + 97 );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LsvbpcviVPwq","35225904","010010","QnYd","2571694","101101011010","jb","928874","11","FbvbkMb"};
vector<int> param1 {15,2,36,44,11,94,22,83,93,37};
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 text, int s ) { string result = ""; for ( int i = 0; i < text . length [MASK] ); i ++ ) { if ( isupper ( text [ i ] ) ) result += char ( int ( text [ i ] + s - 65 ) % 26 + 65 ); else result += char ( int ( text [ i ] + s - 97 ) % 26 + 97 ); } return result; } );
i ++ ) {
if ( isupper ( text [ i ] ) ) result += char ( int ( text [ i ] + s - 65 ) % 26 + 65 );
else result += char ( int ( text [ i ] + s - 97 ) % 26 + 97 );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"LsvbpcviVPwq","35225904","010010","QnYd","2571694","101101011010","jb","928874","11","FbvbkMb"};
vector<int> param1 {15,2,36,44,11,94,22,83,93,37};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) int",
"b) -",
"c) res",
"d) =",
"e) ("
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
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 {66,93,39,93,68,20,37,52,52,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include [MASK] #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 {66,93,39,93,68,20,37,52,52,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <iomanip> | [
"a) class",
"b) <iomanip>",
"c) i",
"d) y)",
"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 ar1 [ ], int ar2 [ ], int n ) {
int i = 0;
int j = 0;
int count;
int m1 = - 1, m2 = - 1;
for ( count = 0;
count <= n;
count ++ ) {
if ( i == n ) {
m1 = m2;
m2 = ar2 [ 0 ];
break;
}
else if ( j == n ) {
m1 = m2;
m2 = ar1 [ 0 ];
break;
}
if ( ar1 [ i ] < ar2 [ j ] ) {
m1 = m2;
m2 = ar1 [ i ];
i ++;
}
else {
m1 = m2;
m2 = ar2 [ j ];
j ++;
}
}
return ( m1 + m2 ) / 2;
}
k;
}
if ( ar1 [ i ] < ar2 [ j ] ) {
m1 = m2;
m2 = ar1 [ i ];
i ++;
}
else {
m1 = m2;
m2 = ar2 [ j ];
j ++;
}
}
return ( m1 + m2 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,18,21,23,27,44,44,69,72,78,88,90,98},{90,54,24,-10,-84,-74,58,96,-28,-92,-18,90,70,-60,72,78,10,42,-2,-18,-38,-16,18,-86,40,-46,-38,66,20,-16,48},{0,1,1},{53,17,94,21,16,75,67,51,44,71,65,82},{-96,-92,-80,-68,-64,-64,-60,-56,-52,-50,-50,-22,-20,-4,-2,0,6,20,22,28,38,40,48,50,56,58,64,64,80,82,90,92,92,92},{0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1},{8,15,17,19,21,32,34,38,41,41,49,49,51,54,54,56,56,57,59,63,70,74,79,79,84,84,86,88,89,93,98},{96,-42,-94,-46,-68,76,8,16,-54,-94,76,24,94,10,34,78,-30,0,-52,80,98,-58,92,12,26,64},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{61,69,66,3}};
vector<vector<int>> param1 {{6,12,16,18,26,34,48,48,49,56,61,79,81,89},{-72,-62,14,-58,70,54,88,-40,-94,4,60,-16,-38,-98,-70,-46,66,42,26,36,56,-4,32,30,-46,-42,-72,44,16,4,24},{0,1,1},{98,50,8,11,80,41,59,24,94,41,75,78},{-88,-72,-72,-58,-54,-50,-48,-34,-24,-14,-14,-14,-10,-6,4,12,16,18,26,30,32,34,40,46,52,54,58,62,62,72,82,82,92,98},{1,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,1,1,0,1,0,1,1,0,1,0,0,0,0,1},{5,6,17,18,22,29,32,33,36,44,45,47,59,59,60,65,67,68,69,71,72,76,78,81,84,85,85,86,86,87,92},{88,78,-26,10,84,34,56,-8,-30,46,48,20,26,-78,96,44,92,-44,-86,24,-58,-96,-86,-12,-98,18},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{39,84,97,15}};
vector<int> param2 {12,16,2,10,25,40,29,17,17,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int ar1 [ ], int ar2 [ ], int n ) { int i = 0; int j = 0; int count; int m1 = - 1, m2 = - 1; for ( count = 0; count <= n; count ++ ) { if ( i == n ) { m1 = m2; m2 = ar2 [ 0 ]; break; } else if ( j == n ) { m1 = m2; m2 = ar1 [ 0 ]; break; } if ( ar1 [ i ] < ar2 [ j ] ) { m1 = m2; m2 = ar1 [ i ]; i ++; [MASK] else { m1 = m2; m2 = ar2 [ j ]; j ++; } } return ( m1 + m2 ) / 2; }k;
}
if ( ar1 [ i ] < ar2 [ j ] ) {
m1 = m2;
m2 = ar1 [ i ];
i ++;
}
else {
m1 = m2;
m2 = ar2 [ j ];
j ++;
}
}
return ( m1 + m2 ) / 2;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,18,21,23,27,44,44,69,72,78,88,90,98},{90,54,24,-10,-84,-74,58,96,-28,-92,-18,90,70,-60,72,78,10,42,-2,-18,-38,-16,18,-86,40,-46,-38,66,20,-16,48},{0,1,1},{53,17,94,21,16,75,67,51,44,71,65,82},{-96,-92,-80,-68,-64,-64,-60,-56,-52,-50,-50,-22,-20,-4,-2,0,6,20,22,28,38,40,48,50,56,58,64,64,80,82,90,92,92,92},{0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,0,1,1,0,0,1,1,1,1,0,1,0,0,0,0,0,0,0,1,0,1,1,1,0,1,1,1,1},{8,15,17,19,21,32,34,38,41,41,49,49,51,54,54,56,56,57,59,63,70,74,79,79,84,84,86,88,89,93,98},{96,-42,-94,-46,-68,76,8,16,-54,-94,76,24,94,10,34,78,-30,0,-52,80,98,-58,92,12,26,64},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{61,69,66,3}};
vector<vector<int>> param1 {{6,12,16,18,26,34,48,48,49,56,61,79,81,89},{-72,-62,14,-58,70,54,88,-40,-94,4,60,-16,-38,-98,-70,-46,66,42,26,36,56,-4,32,30,-46,-42,-72,44,16,4,24},{0,1,1},{98,50,8,11,80,41,59,24,94,41,75,78},{-88,-72,-72,-58,-54,-50,-48,-34,-24,-14,-14,-14,-10,-6,4,12,16,18,26,30,32,34,40,46,52,54,58,62,62,72,82,82,92,98},{1,1,1,1,0,0,0,1,1,1,0,0,0,1,0,1,1,0,0,1,0,1,0,0,0,1,1,0,0,1,1,0,1,0,1,1,0,1,0,0,0,0,1},{5,6,17,18,22,29,32,33,36,44,45,47,59,59,60,65,67,68,69,71,72,76,78,81,84,85,85,86,86,87,92},{88,78,-26,10,84,34,56,-8,-30,46,48,20,26,-78,96,44,92,-44,-86,24,-58,-96,-86,-12,-98,18},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{39,84,97,15}};
vector<int> param2 {12,16,2,10,25,40,29,17,17,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) :",
"b) }",
"c) 3",
"d) return",
"e) return"
] | 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 a [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ a [ i ] ] ++;
for ( auto x : mp ) if ( x . second >= n / 2 ) return true;
return false;
}
gold ( int a [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ a [ i ] ] ++;
for ( auto x : mp ) if ( x . second >= n / 2 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,14,20,26,32,33,34,35,35,49,51,55,57,64,64,68,70,72,74,77,78,78,78,80,91,91,94},{-14,-98,-36,68,-20,18,16,-50,66,98,12,-2,-68},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,96,94,67,87,65,27,21,60,49,73,85,9,17,72,3,73,69,95,3,30,88,54,94,40},{-86,-80,-76,-76,-74,-62,-62,-56,-48,-36,-28,-22,-18,-18,-18,-16,-14,-12,-6,-2,10,14,18,24,32,32,40,40,40,42,46,48,50,56,56,56,68,76,84,94,96,96},{0,1,1,1,0},{5,8,9,12,14,16,19,29,32,32,37,38,38,39,40,41,43,45,47,51,53,58,58,63,64,65,69,83,84,86,92,93,96,98},{-68,-50,-20,22,90,86,4,60,-88,82,-4,-54,36,-44,86},{0,0,0,0,1,1,1,1},{85,64,25,64,46,35,31,45,93,81,49,33,96,48,37}};
vector<int> param1 {15,11,22,15,23,3,17,13,6,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int a [ ], int n ) [MASK] unordered_map < int, int > mp; for ( int i = 0; i < n; i ++ ) mp [ a [ i ] ] ++; for ( auto x : mp ) if ( x . second >= n / 2 ) return true; return false; }gold ( int a [ ], int n ) {
unordered_map < int, int > mp;
for ( int i = 0;
i < n;
i ++ ) mp [ a [ i ] ] ++;
for ( auto x : mp ) if ( x . second >= n / 2 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,14,20,26,32,33,34,35,35,49,51,55,57,64,64,68,70,72,74,77,78,78,78,80,91,91,94},{-14,-98,-36,68,-20,18,16,-50,66,98,12,-2,-68},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,96,94,67,87,65,27,21,60,49,73,85,9,17,72,3,73,69,95,3,30,88,54,94,40},{-86,-80,-76,-76,-74,-62,-62,-56,-48,-36,-28,-22,-18,-18,-18,-16,-14,-12,-6,-2,10,14,18,24,32,32,40,40,40,42,46,48,50,56,56,56,68,76,84,94,96,96},{0,1,1,1,0},{5,8,9,12,14,16,19,29,32,32,37,38,38,39,40,41,43,45,47,51,53,58,58,63,64,65,69,83,84,86,92,93,96,98},{-68,-50,-20,22,90,86,4,60,-88,82,-4,-54,36,-44,86},{0,0,0,0,1,1,1,1},{85,64,25,64,46,35,31,45,93,81,49,33,96,48,37}};
vector<int> param1 {15,11,22,15,23,3,17,13,6,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | { | [
"a) ;",
"b) i",
"c) {",
"d) )",
"e) namespace"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int x, int y ) {
return ( ( x ^ y ) < 0 );
}
clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int x, int y ) {
return ( ( x ^ y ) < 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,-20,-100,54,-16,-23,93,24,-8,29};
vector<int> param1 {-99,-21,100,-49,16,-68,37,-61,69,10};
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 ( int x, [MASK] y ) { return ( ( x ^ y ) < 0 ); }clude <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int x, int y ) {
return ( ( x ^ y ) < 0 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {59,-20,-100,54,-16,-23,93,24,-8,29};
vector<int> param1 {-99,-21,100,-49,16,-68,37,-61,69,10};
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;
} | int | [
"a) r",
"b) #include",
"c) c",
"d) int",
"e) r"
] | 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 a, string b ) {
int m = a . length ( );
int n = b . length ( );
int lookup [ m + 1 ] [ n + 1 ] = {
{
0 }
};
for ( int i = 0;
i <= n;
++ i ) lookup [ 0 ] [ i ] = 0;
for ( int i = 0;
i <= m;
++ i ) lookup [ i ] [ 0 ] = 1;
for ( int i = 1;
i <= m;
i ++ ) {
for ( int j = 1;
j <= n;
j ++ ) {
if ( a [ i - 1 ] == b [ j - 1 ] ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ];
else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ];
}
}
return lookup [ m ] [ n ];
}
b [ j - 1 ] ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ];
else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ];
}
}
return lookup [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"fZOKCdZ Lav","2","1000001110","IAOyBzgIWHo","211806","1","CVaQTG","6265187228","10111101101000","vEi"};
vector<string> param1 {"fKA","187012","0","oA","10","001011100","CT","628","01111","bigsvkQG"};
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 a, string b ) { int m = a . length ( ); int n = b . length ( ); int lookup [ m + 1 ] [ n + 1 ] = { { 0 } }; for ( int i = 0; [MASK] <= n; ++ i ) lookup [ 0 ] [ i ] = 0; for ( int i = 0; i <= m; ++ i ) lookup [ i ] [ 0 ] = 1; for ( int i = 1; i <= m; i ++ ) { for ( int j = 1; j <= n; j ++ ) { if ( a [ i - 1 ] == b [ j - 1 ] ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ]; else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ]; } } return lookup [ m ] [ n ]; }b [ j - 1 ] ) lookup [ i ] [ j ] = lookup [ i - 1 ] [ j - 1 ] + lookup [ i - 1 ] [ j ];
else lookup [ i ] [ j ] = lookup [ i - 1 ] [ j ];
}
}
return lookup [ m ] [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"fZOKCdZ Lav","2","1000001110","IAOyBzgIWHo","211806","1","CVaQTG","6265187228","10111101101000","vEi"};
vector<string> param1 {"fKA","187012","0","oA","10","001011100","CT","628","01111","bigsvkQG"};
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;
} | i | [
"a) =",
"b) i",
"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 ) {
if ( n % 2 != 0 ) return 0;
int res = 1;
for ( int i = 2;
i <= sqrt ( n );
i ++ ) {
int count = 0, curr_sum = 1, curr_term = 1;
while ( n % i == 0 ) {
count ++;
n = n / i;
if ( i == 2 && count == 1 ) curr_sum = 0;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
n = n / i;
if ( i == 2 && count == 1 ) curr_sum = 0;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,78,39,36,49,17,53,66,92,71};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { if ( n % 2 != 0 ) return 0; int res = 1; for ( int i = [MASK] i <= sqrt ( n ); i ++ ) { int count = 0, curr_sum = 1, curr_term = 1; while ( n % i == 0 ) { count ++; n = n / i; if ( i == 2 && count == 1 ) curr_sum = 0; curr_term *= i; curr_sum += curr_term; } res *= curr_sum; } if ( n >= 2 ) res *= ( 1 + n ); return res; } n = n / i;
if ( i == 2 && count == 1 ) curr_sum = 0;
curr_term *= i;
curr_sum += curr_term;
}
res *= curr_sum;
}
if ( n >= 2 ) res *= ( 1 + n );
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,78,39,36,49,17,53,66,92,71};
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) ,",
"b) r",
"c) 2;",
"d) <cstdlib>",
"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 m ) {
int dp [ n + 1 ] [ m + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 0;
j <= m;
j ++ ) {
if ( i > j ) {
if ( j == 0 ) dp [ i ] [ j ] = 1;
else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] );
}
}
}
return dp [ n ] [ m ];
}
{
if ( j == 0 ) dp [ i ] [ j ] = 1;
else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] );
}
}
}
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,77,35,26,6,66,44,26,74,65};
vector<int> param1 {7,34,22,20,10,47,29,33,86,97};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int m ) { int dp [ n + 1 ] [ m + 1 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 1; i <= n; i ++ ) { for ( int j = 0; j <= m; j ++ [MASK] { if ( i > j ) { if ( j == 0 ) dp [ i ] [ j ] = 1; else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] ); } } } return dp [ n ] [ m ]; } {
if ( j == 0 ) dp [ i ] [ j ] = 1;
else dp [ i ] [ j ] = ( ( i - j ) * dp [ i - 1 ] [ j - 1 ] ) + ( ( j + 1 ) * dp [ i - 1 ] [ j ] );
}
}
}
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,77,35,26,6,66,44,26,74,65};
vector<int> param1 {7,34,22,20,10,47,29,33,86,97};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) return",
"b) [",
"c) )",
"d) j",
"e) s"
] | 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 dp [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) {
if ( i <= 2 ) dp [ i ] = i;
else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
}
return dp [ n ];
}
f_gold ( int n ) {
int dp [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) {
if ( i <= 2 ) dp [ i ] = i;
else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,62,87,87,61,88,73,62,98,57};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <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 ]; for ( int i = 0; i <= n; i ++ ) { if ( i <= 2 ) dp [ i ] = i; else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [MASK] i - 2 ]; } return dp [ n ]; }f_gold ( int n ) {
int dp [ n + 1 ];
for ( int i = 0;
i <= n;
i ++ ) {
if ( i <= 2 ) dp [ i ] = i;
else dp [ i ] = dp [ i - 1 ] + ( i - 1 ) * dp [ i - 2 ];
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,62,87,87,61,88,73,62,98,57};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) [",
"b) {qsort",
"c) *;",
"d) return",
"e) 1;"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int a [ ], int n ) {
int count_odd = 0, count_even = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] & 1 ) count_odd ++;
else count_even ++;
}
if ( count_odd % 2 && count_even % 2 ) return false;
else return true;
}
count_even = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] & 1 ) count_odd ++;
else count_even ++;
}
if ( count_odd % 2 && count_even % 2 ) return false;
else return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,1,7,7,8,10,10,10,14,15,18,20,23,24,24,26,30,32,32,33,36,42,43,46,48,51,51,52,53,58,58,59,59,59,60,67,71,72,74,76,77,83,84,86,90,91},{-90,-20,-60,-64,-24,84,-2,-32,28,-54,44,-96,52,88,20,-56,-2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{98,70,24,18,7,4,78,19,70,56,99,54,69,15,88,20,40,13,19,56,62},{-72,-66,-58,-20,36,80,92},{0,1},{6,13,14,16,21,26,26,28,29,35,38,42,47,47,62,67,77,81,81,83,84,88,90,96,97,98},{-48,-8,20,32,-90,-42,-6,-88,-72,42,66,-62,82,-4,8,12,-22,82,56,96,-54,92,-42,30,-18,14,-6,-66,34,16,-84,-94,48,-48,52,-60,-92,-16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{45,86,53,80,27,45,1,85,91,93,92,43,75,86,81,48,21,34,5,10,88,42,7,15,96,85,62,86,52,37}};
vector<int> param1 {30,12,36,19,6,1,17,35,14,29};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int a [ ], int n ) { int count_odd = 0, count_even = 0; [MASK] ( int i = 0; i < n; i ++ ) { if ( a [ i ] & 1 ) count_odd ++; else count_even ++; } if ( count_odd % 2 && count_even % 2 ) return false; else return true; }count_even = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( a [ i ] & 1 ) count_odd ++;
else count_even ++;
}
if ( count_odd % 2 && count_even % 2 ) return false;
else return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,1,7,7,8,10,10,10,14,15,18,20,23,24,24,26,30,32,32,33,36,42,43,46,48,51,51,52,53,58,58,59,59,59,60,67,71,72,74,76,77,83,84,86,90,91},{-90,-20,-60,-64,-24,84,-2,-32,28,-54,44,-96,52,88,20,-56,-2},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{98,70,24,18,7,4,78,19,70,56,99,54,69,15,88,20,40,13,19,56,62},{-72,-66,-58,-20,36,80,92},{0,1},{6,13,14,16,21,26,26,28,29,35,38,42,47,47,62,67,77,81,81,83,84,88,90,96,97,98},{-48,-8,20,32,-90,-42,-6,-88,-72,42,66,-62,82,-4,8,12,-22,82,56,96,-54,92,-42,30,-18,14,-6,-66,34,16,-84,-94,48,-48,52,-60,-92,-16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{45,86,53,80,27,45,1,85,91,93,92,43,75,86,81,48,21,34,5,10,88,42,7,15,96,85,62,86,52,37}};
vector<int> param1 {30,12,36,19,6,1,17,35,14,29};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | for | [
"a) (",
"b) +=",
"c) for",
"d) arr",
"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 dp [ n + 1 ];
dp [ 0 ] = 0, dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ], i );
return dp [ n ];
}
nt f_gold ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = 0, dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ], i );
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {50,83,18,24,31,38,94,24,13,53};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int dp [ n + 1 ]; dp [ 0 ] = 0, dp [ 1 ] = 1; for ( int i = 2; i <= n; i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ [MASK] / 3 ] + dp [ i / 4 ], i ); return dp [ n ]; }nt f_gold ( int n ) {
int dp [ n + 1 ];
dp [ 0 ] = 0, dp [ 1 ] = 1;
for ( int i = 2;
i <= n;
i ++ ) dp [ i ] = max ( dp [ i / 2 ] + dp [ i / 3 ] + dp [ i / 4 ], i );
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {50,83,18,24,31,38,94,24,13,53};
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) int",
"b) dp",
"c) i",
"d) import",
"e) COUNT_PAIRS_WHOSE_PRODUCTS_EXIST_IN_ARRAY_1{"
] | 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 ) {
if ( n == 1 ) return arr [ 0 ];
int dec [ n ];
memset ( dec, 0, sizeof ( dec ) );
int inc [ n ];
memset ( inc, 0, sizeof ( inc ) );
dec [ 0 ] = inc [ 0 ] = arr [ 0 ];
int flag = 0;
for ( int i = 1;
i < n;
i ++ ) {
for ( int j = 0;
j < i;
j ++ ) {
if ( arr [ j ] > arr [ i ] ) {
dec [ i ] = max ( dec [ i ], inc [ j ] + arr [ i ] );
flag = 1;
}
else if ( arr [ j ] < arr [ i ] && flag == 1 ) inc [ i ] = max ( inc [ i ], dec [ j ] + arr [ i ] );
}
}
int result = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( result < inc [ i ] ) result = inc [ i ];
if ( result < dec [ i ] ) result = dec [ i ];
}
return result;
}
}
}
int result = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( result < inc [ i ] ) result = inc [ i ];
if ( result < dec [ i ] ) result = dec [ i ];
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,9,15,15,20,21,26,28,32,34,38,42,42,42,46,47,48,50,54,55,60,60,61,63,63,66,74,79,80,85,91,93},{-98},{0,0,0,0,0,0,0,0,0,1,1,1},{70,5,20,22,44,94,69,89,45,92,56,58,36,91,82,95,9,60,4,34,37,95,38,47,81,68,73,15,88,8,95,28,97,12,24,5,26,82,47,88,28,33,17,28,11,71,74},{-98,-96,-94,-94,-92,-86,-86,-84,-82,-68,-66,-66,-50,-48,-46,-36,-26,-8,-6,8,14,16,18,22,32,48,48,50,62,70,70,74,78,78,84,86,92,94,98},{0,1,1,1,0,0,1,1,1,0,1},{1,2,8,8,12,14,19,24,25,32,36,45,47,53,54,56,56,58,59,60,65,68,86,86,91,98},{-94,88,94,78,-34,84,-32,68,-72,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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{76,62,62,61,63,15,61,74,50,86,60,35,91,32,93,14,52,18,14,39}};
vector<int> param1 {23,0,6,24,32,5,13,7,30,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> [MASK] <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { if ( n == 1 ) return arr [ 0 ]; int dec [ n ]; memset ( dec, 0, sizeof ( dec ) ); int inc [ n ]; memset ( inc, 0, sizeof ( inc ) ); dec [ 0 ] = inc [ 0 ] = arr [ 0 ]; int flag = 0; for ( int i = 1; i < n; i ++ ) { for ( int j = 0; j < i; j ++ ) { if ( arr [ j ] > arr [ i ] ) { dec [ i ] = max ( dec [ i ], inc [ j ] + arr [ i ] ); flag = 1; } else if ( arr [ j ] < arr [ i ] && flag == 1 ) inc [ i ] = max ( inc [ i ], dec [ j ] + arr [ i ] ); } } int result = INT_MIN; for ( int i = 0; i < n; i ++ ) { if ( result < inc [ i ] ) result = inc [ i ]; if ( result < dec [ i ] ) result = dec [ i ]; } return result; }
}
}
int result = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( result < inc [ i ] ) result = inc [ i ];
if ( result < dec [ i ] ) result = dec [ i ];
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,9,15,15,20,21,26,28,32,34,38,42,42,42,46,47,48,50,54,55,60,60,61,63,63,66,74,79,80,85,91,93},{-98},{0,0,0,0,0,0,0,0,0,1,1,1},{70,5,20,22,44,94,69,89,45,92,56,58,36,91,82,95,9,60,4,34,37,95,38,47,81,68,73,15,88,8,95,28,97,12,24,5,26,82,47,88,28,33,17,28,11,71,74},{-98,-96,-94,-94,-92,-86,-86,-84,-82,-68,-66,-66,-50,-48,-46,-36,-26,-8,-6,8,14,16,18,22,32,48,48,50,62,70,70,74,78,78,84,86,92,94,98},{0,1,1,1,0,0,1,1,1,0,1},{1,2,8,8,12,14,19,24,25,32,36,45,47,53,54,56,56,58,59,60,65,68,86,86,91,98},{-94,88,94,78,-34,84,-32,68,-72,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,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{76,62,62,61,63,15,61,74,50,86,60,35,91,32,93,14,52,18,14,39}};
vector<int> param1 {23,0,6,24,32,5,13,7,30,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) 0",
"b) public",
"c) =",
"d) #include",
"e) 2"
] | 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 l, int r, int x ) {
if ( r < l ) return - 1;
if ( arr [ l ] == x ) return l;
if ( arr [ r ] == x ) return r;
return f_gold ( arr, l + 1, r - 1, x );
}
ce std;
int f_gold ( int arr [ ], int l, int r, int x ) {
if ( r < l ) return - 1;
if ( arr [ l ] == x ) return l;
if ( arr [ r ] == x ) return r;
return f_gold ( arr, l + 1, r - 1, x );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,74,3},{-90,72,36,96,42,0,-66,4},{0},{99,70,67,5},{-98,-98,-26,-26,-24,-18,-16,80,5},{1,1,1,1,0,1,0},{1,5,12,12,17,17,12,95,96,98,4},{50,-70,-30,-54,6,-10,70,84,5},{0,1,5},{59,21,28,3,14,5}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {2,7,1,3,8,6,10,8,2,5};
vector<int> param3 {1,96,-1,3,80,1,12,27,14,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int l, int r, int x ) { if ( r < l ) return - 1; if ( arr [ l ] == x ) return l; if ( arr [ r ] == x ) return r; return f_gold ( [MASK] l + 1, r - 1, x ); }ce std;
int f_gold ( int arr [ ], int l, int r, int x ) {
if ( r < l ) return - 1;
if ( arr [ l ] == x ) return l;
if ( arr [ r ] == x ) return r;
return f_gold ( arr, l + 1, r - 1, x );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{10,74,3},{-90,72,36,96,42,0,-66,4},{0},{99,70,67,5},{-98,-98,-26,-26,-24,-18,-16,80,5},{1,1,1,1,0,1,0},{1,5,12,12,17,17,12,95,96,98,4},{50,-70,-30,-54,6,-10,70,84,5},{0,1,5},{59,21,28,3,14,5}};
vector<int> param1 {0,0,0,0,0,0,0,0,0,0};
vector<int> param2 {2,7,1,3,8,6,10,8,2,5};
vector<int> param3 {1,96,-1,3,80,1,12,27,14,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;
}
| arr, | [
"a) )",
"b) java.util.",
"c) <",
"d) =",
"e) arr,"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int l = sqrt ( n );
int sq = l * l;
if ( sq == n ) return l * 4;
else {
long long int row = n / l;
long long int perimeter = 2 * ( l + row );
if ( n % l != 0 ) perimeter += 2;
return perimeter;
}
}
sq = l * l;
if ( sq == n ) return l * 4;
else {
long long int row = n / l;
long long int perimeter = 2 * ( l + row );
if ( n % l != 0 ) perimeter += 2;
return perimeter;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {45,80,54,48,83,68,32,20,68,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 n ) { [MASK] l = sqrt ( n ); int sq = l * l; if ( sq == n ) return l * 4; else { long long int row = n / l; long long int perimeter = 2 * ( l + row ); if ( n % l != 0 ) perimeter += 2; return perimeter; } } sq = l * l;
if ( sq == n ) return l * 4;
else {
long long int row = n / l;
long long int perimeter = 2 * ( l + row );
if ( n % l != 0 ) perimeter += 2;
return perimeter;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {45,80,54,48,83,68,32,20,68,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;
} | int | [
"a) ]",
"b) *",
"c) int",
"d) cmpfunc",
"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 ( char str [ ] ) {
int len = strlen ( str );
if ( str [ 0 ] < 'A' || str [ 0 ] > 'Z' ) return false;
if ( str [ len - 1 ] != '.' ) return false;
int prev_state = 0, curr_state = 0;
int index = 1;
while ( str [ index ] ) {
if ( str [ index ] >= 'A' && str [ index ] <= 'Z' ) curr_state = 0;
else if ( str [ index ] == ' ' ) curr_state = 1;
else if ( str [ index ] >= 'a' && str [ index ] <= 'z' ) curr_state = 2;
else if ( str [ index ] == '.' ) curr_state = 3;
if ( prev_state == curr_state && curr_state != 2 ) return false;
if ( prev_state == 2 && curr_state == 0 ) return false;
if ( curr_state == 3 && prev_state != 1 ) return ( str [ index + 1 ] == '\0' );
index ++;
prev_state = curr_state;
}
return false;
}
v_state == 2 && curr_state == 0 ) return false;
if ( curr_state == 3 && prev_state != 1 ) return ( str [ index + 1 ] == '\0' );
index ++;
prev_state = curr_state;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 { "I love cinema.", "The vertex is S.",
"I am single.", "My name is KG.",
"I lovE cinema.", "GeeksQuiz. is a quiz site.",
"I love Geeksquiz and Geeksforgeeks.",
" You are my friend.", "I love cinema", "Hello world !" };
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front()) == f_gold(¶m0[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( char [MASK] [ ] ) { int len = strlen ( str ); if ( str [ 0 ] < 'A' || str [ 0 ] > 'Z' ) return false; if ( str [ len - 1 ] != '.' ) return false; int prev_state = 0, curr_state = 0; int index = 1; while ( str [ index ] ) { if ( str [ index ] >= 'A' && str [ index ] <= 'Z' ) curr_state = 0; else if ( str [ index ] == ' ' ) curr_state = 1; else if ( str [ index ] >= 'a' && str [ index ] <= 'z' ) curr_state = 2; else if ( str [ index ] == '.' ) curr_state = 3; if ( prev_state == curr_state && curr_state != 2 ) return false; if ( prev_state == 2 && curr_state == 0 ) return false; if ( curr_state == 3 && prev_state != 1 ) return ( str [ index + 1 ] == '\0' ); index ++; prev_state = curr_state; } return false; }v_state == 2 && curr_state == 0 ) return false;
if ( curr_state == 3 && prev_state != 1 ) return ( str [ index + 1 ] == '\0' );
index ++;
prev_state = curr_state;
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 { "I love cinema.", "The vertex is S.",
"I am single.", "My name is KG.",
"I lovE cinema.", "GeeksQuiz. is a quiz site.",
"I love Geeksquiz and Geeksforgeeks.",
" You are my friend.", "I love cinema", "Hello world !" };
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front()) == f_gold(¶m0[i].front()))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | str | [
"a) str",
"b) arr",
"c) num",
"d) int",
"e) ++"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int f_gold [ n ];
f_gold [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
f_gold [ i ] = 1;
for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1;
}
return * max_element ( f_gold, f_gold + n );
}
1;
for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1;
}
return * max_element ( f_gold, f_gold + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,17,27,28,36,38,40,49,51,57,58,61,62,71,91,94,99},{-48,54,98,68,24,-46,4,-28,-34,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{94,74,27,59,3,71,67,91,91,87,1,79,42,33,85,37,76,86,80,84,62,8,31,54,17,48,4,12,88,63,12,51,36,20,73,48,41,88,21,98,57,3,54},{-96,-94,-90,-88,-86,-82,-76,-74,-68,-54,-54,-50,-50,-46,-46,-40,-36,-34,-34,-32,-30,-26,-26,-20,-16,-6,-4,2,10,14,22,26,26,28,28,30,30,36,54,64,68,74,78,80,84,90,92,94},{0,0,0,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,1,0,1,0,1,1,0,0,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,0,0},{6,12,18,34,37,37,37,40,45,60,64,66,73,78,79,80,92},{64,-18,-22,96,-92,6,-46,-54,76,0,46,74,-8,22,-46,-44,-94,-88,-52,-54,2,98,-22,46,26,2,-64,-84,20,22,12,-32,-16,-96,46,-4,-8,46,-64,-58,58,92,0,-26,-58,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,34,3,67,21,69,31,49,7,70,27,53,94,23,74,24,44,53,78,46,6,29,5,41,38,22,40,38,40,59,9}};
vector<int> param1 {14,8,17,24,36,34,11,24,33,16};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int f_gold [MASK] n ]; f_gold [ 0 ] = 1; for ( int i = 1; i < n; i ++ ) { f_gold [ i ] = 1; for ( int j = 0; j < i; j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1; } return * max_element ( f_gold, f_gold + n ); } 1;
for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] > arr [ j ] && f_gold [ i ] < f_gold [ j ] + 1 ) f_gold [ i ] = f_gold [ j ] + 1;
}
return * max_element ( f_gold, f_gold + n );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{14,17,27,28,36,38,40,49,51,57,58,61,62,71,91,94,99},{-48,54,98,68,24,-46,4,-28,-34,40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{94,74,27,59,3,71,67,91,91,87,1,79,42,33,85,37,76,86,80,84,62,8,31,54,17,48,4,12,88,63,12,51,36,20,73,48,41,88,21,98,57,3,54},{-96,-94,-90,-88,-86,-82,-76,-74,-68,-54,-54,-50,-50,-46,-46,-40,-36,-34,-34,-32,-30,-26,-26,-20,-16,-6,-4,2,10,14,22,26,26,28,28,30,30,36,54,64,68,74,78,80,84,90,92,94},{0,0,0,0,1,0,1,0,0,1,0,1,0,1,0,1,1,0,1,1,0,1,0,1,1,0,0,0,0,0,1,0,0,1,1,0,0,1,1,1,0,1,1,0,0,1,0,0},{6,12,18,34,37,37,37,40,45,60,64,66,73,78,79,80,92},{64,-18,-22,96,-92,6,-46,-54,76,0,46,74,-8,22,-46,-44,-94,-88,-52,-54,2,98,-22,46,26,2,-64,-84,20,22,12,-32,-16,-96,46,-4,-8,46,-64,-58,58,92,0,-26,-58,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{57,34,3,67,21,69,31,49,7,70,27,53,94,23,74,24,44,53,78,46,6,29,5,41,38,22,40,38,40,59,9}};
vector<int> param1 {14,8,17,24,36,34,11,24,33,16};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) [",
"b) ];",
"c) n",
"d) f_gold",
"e) /"
] | a |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.