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;
bool f_gold ( int num ) {
if ( num < 0 ) return false;
int c = ( - 2 * num );
int b = 1, a = 1;
int d = ( b * b ) - ( 4 * a * c );
if ( d < 0 ) return false;
float root1 = ( - b + sqrt ( d ) ) / ( 2 * a );
float root2 = ( - b - sqrt ( d ) ) / ( 2 * a );
if ( root1 > 0 && floor ( root1 ) == root1 ) return true;
if ( root2 > 0 && floor ( root2 ) == root2 ) return true;
return false;
}
2 * a );
float root2 = ( - b - sqrt ( d ) ) / ( 2 * a );
if ( root1 > 0 && floor ( root1 ) == root1 ) return true;
if ( root2 > 0 && floor ( root2 ) == root2 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,6,10,55,48,63,72,16,85};
for(int i = 0; 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 num ) { if ( num < 0 ) return false; int c = ( - 2 * num ); int b = 1, a = 1; int d = ( b * b ) - ( 4 * a * c ); if ( d < 0 ) return false; float root1 = ( - b + sqrt ( d ) ) / ( 2 * a ); float root2 = ( - b - sqrt ( d ) ) / ( [MASK] * a ); if ( root1 > 0 && floor ( root1 ) == root1 ) return true; if ( root2 > 0 && floor ( root2 ) == root2 ) return true; return false; }2 * a );
float root2 = ( - b - sqrt ( d ) ) / ( 2 * a );
if ( root1 > 0 && floor ( root1 ) == root1 ) return true;
if ( root2 > 0 && floor ( root2 ) == root2 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,6,10,55,48,63,72,16,85};
for(int i = 0; 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) i",
"b) 2",
"c) 0;",
"d) 1",
"e) =="
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int k ) {
int max = * max_element ( arr, arr + n );
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( max - arr [ i ] ) % k != 0 ) return - 1;
else res += ( max - arr [ i ] ) / k;
}
return res;
}
max_element ( arr, arr + n );
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( max - arr [ i ] ) % k != 0 ) return - 1;
else res += ( max - arr [ i ] ) / k;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4, 7, 19, 16},{4,4,4,4,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,36,52,8,52,15,16},{-10,-5,-5,-20,10,30},{0,1,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0},{1,5,5,9,11,12,12,13,13,14,16,18,26,26,28,28,30,31,32,37,37,38,40,43,44,45,47,47,55,58,60,62,63,64,69,78,83,84,92,96,96,99},{76,-78,92,-98,16,44,86,96,-8,2,-96,74,-28,12,54,-40,-64,-12,4,48,68,-82,8,0,-4,88,48,-54,90,62,-84,76,-48,62,-80,-94,38,-4,36},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{62,99,29,23,55,30,79,63,1,88,59,8,11,80,23,51,97,32,80,48,84,36,73,59,1,34,92,10}};
vector<int> param1 {4,5,39,5,6,10,26,34,39,18};
vector<int> param2 {3,3,1,6,5,15,33,3,10,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 ) { int max = * max_element ( arr, arr + n ); int res = 0; for ( int i = 0; i < n; i ++ ) { if ( ( max [MASK] arr [ i ] ) % k != 0 ) return - 1; else res += ( max - arr [ i ] ) / k; } return res; }max_element ( arr, arr + n );
int res = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( ( max - arr [ i ] ) % k != 0 ) return - 1;
else res += ( max - arr [ i ] ) / k;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4, 7, 19, 16},{4,4,4,4,4},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{85,36,52,8,52,15,16},{-10,-5,-5,-20,10,30},{0,1,0,0,1,1,1,0,0,0,0,1,1,0,0,1,0},{1,5,5,9,11,12,12,13,13,14,16,18,26,26,28,28,30,31,32,37,37,38,40,43,44,45,47,47,55,58,60,62,63,64,69,78,83,84,92,96,96,99},{76,-78,92,-98,16,44,86,96,-8,2,-96,74,-28,12,54,-40,-64,-12,4,48,68,-82,8,0,-4,88,48,-54,90,62,-84,76,-48,62,-80,-94,38,-4,36},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{62,99,29,23,55,30,79,63,1,88,59,8,11,80,23,51,97,32,80,48,84,36,73,59,1,34,92,10}};
vector<int> param1 {4,5,39,5,6,10,26,34,39,18};
vector<int> param2 {3,3,1,6,5,15,33,3,10,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) );",
"c) gSum",
"d) (",
"e) *"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int ans = 0, temp = 0, num;
for ( int i = 1;
i <= n && temp < n;
i ++ ) {
temp = i - 1;
num = 1;
while ( temp < n ) {
if ( temp + i <= n ) ans += ( i * num );
else ans += ( ( n - temp ) * num );
temp += i;
num ++;
}
}
return ans;
}
emp = i - 1;
num = 1;
while ( temp < n ) {
if ( temp + i <= n ) ans += ( i * num );
else ans += ( ( n - temp ) * num );
temp += i;
num ++;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {35,93,7,81,80,47,7,41,59,34};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int ans = 0, temp = 0, num; for ( int i = 1; i <= n && temp < n; i ++ ) { temp = i - 1; num = 1; while ( temp < n ) { if ( temp + i <= n [MASK] ans += ( i * num ); else ans += ( ( n - temp ) * num ); temp += i; num ++; } } return ans; }emp = i - 1;
num = 1;
while ( temp < n ) {
if ( temp + i <= n ) ans += ( i * num );
else ans += ( ( n - temp ) * num );
temp += i;
num ++;
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {35,93,7,81,80,47,7,41,59,34};
for(int i = 0; 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) arr",
"c) str",
"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 ( unsigned int x, unsigned int p1, unsigned int p2, unsigned int n ) {
unsigned int set1 = ( x >> p1 ) & ( ( 1U << n ) - 1 );
unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 );
unsigned int Xor = ( set1 ^ set2 );
Xor = ( Xor << p1 ) | ( Xor << p2 );
unsigned int result = x ^ Xor;
return result;
}
n ) - 1 );
unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 );
unsigned int Xor = ( set1 ^ set2 );
Xor = ( Xor << p1 ) | ( Xor << p2 );
unsigned int result = x ^ Xor;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,16,55,75,90,58,69,5,36,62};
vector<int> param1 {88,26,56,35,12,65,64,1,33,69};
vector<int> param2 {97,59,40,79,59,25,17,59,97,66};
vector<int> param3 {92,42,41,30,34,19,94,38,44,9};
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 ( unsigned int x, unsigned int p1, unsigned int p2, unsigned int n ) { unsigned int set1 = ( x >> p1 ) & ( ( 1U << n ) - 1 ); unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 ); unsigned int Xor = ( set1 ^ set2 ); Xor = ( Xor << p1 ) | ( Xor << p2 ); unsigned int result [MASK] x ^ Xor; return result; }n ) - 1 );
unsigned int set2 = ( x >> p2 ) & ( ( 1U << n ) - 1 );
unsigned int Xor = ( set1 ^ set2 );
Xor = ( Xor << p1 ) | ( Xor << p2 );
unsigned int result = x ^ Xor;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {95,16,55,75,90,58,69,5,36,62};
vector<int> param1 {88,26,56,35,12,65,64,1,33,69};
vector<int> param2 {97,59,40,79,59,25,17,59,97,66};
vector<int> param3 {92,42,41,30,34,19,94,38,44,9};
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) f2",
"c) const",
"d) <",
"e) )"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float a, float b ) {
return ( ( 2 * a ) + ( 2 * b ) );
}
b>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float a, float b ) {
return ( ( 2 * a ) + ( 2 * b ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {801.0366882228715F,-7069.610056819919F,7723.966966568705F,-7935.859205856963F,6094.247432557289F,-7371.490363309265F,8368.473889617526F,-3761.921143166053F,3139.1089185587884F,-5218.286665567171F};
vector<float> param1 {456.71190645582783F,-4226.483870778477F,5894.65405158763F,-5333.225064296693F,1660.420120702062F,-1095.4543576847332F,4735.838330834498F,-5315.871691690649F,6490.194159517967F,-8265.153014320813F};
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.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using [MASK] std; float f_gold ( float a, float b ) { return ( ( 2 * a ) + ( 2 * b ) ); }b>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float a, float b ) {
return ( ( 2 * a ) + ( 2 * b ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {801.0366882228715F,-7069.610056819919F,7723.966966568705F,-7935.859205856963F,6094.247432557289F,-7371.490363309265F,8368.473889617526F,-3761.921143166053F,3139.1089185587884F,-5218.286665567171F};
vector<float> param1 {456.71190645582783F,-4226.483870778477F,5894.65405158763F,-5333.225064296693F,1660.420120702062F,-1095.4543576847332F,4735.838330834498F,-5315.871691690649F,6490.194159517967F,-8265.153014320813F};
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.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | namespace | [
"a) of",
"b) ,",
"c) :",
"d) k",
"e) namespace"
] | 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_set < int > S;
for ( int i = 0;
i < n;
i ++ ) S . insert ( arr [ i ] );
int ans = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,9,24,28,31,49,54,67,85,86,94,97,97},{-34,16,-80,-10,80,2,50,-74,-76,36,-84,-24,74,-54,-22,46,80,58,-8,70,24,-88,52,62,30,42,48,16,78,-82,64,-36,84,-72},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{49,61,68,4,90,89,71,74,45,61,35,41,59},{-42,-8,28,56,80,96},{1,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,1,0,0,0,1,1,1,1},{3,4,6,6,13,27,27,29,32,36,46,50,52,65,69,70,71,83,87,91},{64,-76,28,6,56,18,32,-50,-20,18,-26,-90,32,50,-18,98,84,40,50,88,-70,-6,-24,-44,-96,-58,48,-78,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,48,61,87,7,78,93,44,16,88,98,15,73,93,43,46,42,34,1,35,79,35,84,60,18,79,17,4,78,1,20,64}};
vector<int> param1 {11,29,13,11,4,17,10,15,15,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_set < int > S; for ( int i = 0; i < n; i ++ ) S . insert ( arr [ i ] ); int ans = 0; for ( int i = 0; i < n; i ++ ) { if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) { int j = arr [ i ]; while ( S . find ( j ) != S . end ( ) ) j ++; ans = max ( ans, [MASK] - arr [ i ] ); } } return ans; } if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,5,9,24,28,31,49,54,67,85,86,94,97,97},{-34,16,-80,-10,80,2,50,-74,-76,36,-84,-24,74,-54,-22,46,80,58,-8,70,24,-88,52,62,30,42,48,16,78,-82,64,-36,84,-72},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{49,61,68,4,90,89,71,74,45,61,35,41,59},{-42,-8,28,56,80,96},{1,0,1,0,0,0,0,1,1,0,1,1,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,1,0,0,0,1,1,1,1},{3,4,6,6,13,27,27,29,32,36,46,50,52,65,69,70,71,83,87,91},{64,-76,28,6,56,18,32,-50,-20,18,-26,-90,32,50,-18,98,84,40,50,88,-70,-6,-24,-44,-96,-58,48,-78,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{50,48,61,87,7,78,93,44,16,88,98,15,73,93,43,46,42,34,1,35,79,35,84,60,18,79,17,4,78,1,20,64}};
vector<int> param1 {11,29,13,11,4,17,10,15,15,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;
} | j | [
"a) /",
"b) j",
"c) :",
"d) (x",
"e) )"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str [ ], int n ) {
unordered_map < string, int > m;
for ( int i = 0;
i < n;
i ++ ) m [ str [ i ] ] += 1;
int res = 0;
for ( auto it = m . begin ( );
it != m . end ( );
it ++ ) if ( ( it -> second == 2 ) ) res ++;
return res;
}
> m;
for ( int i = 0;
i < n;
i ++ ) m [ str [ i ] ] += 1;
int res = 0;
for ( auto it = m . begin ( );
it != m . end ( );
it ++ ) if ( ( it -> second == 2 ) ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<string>> param0 {
{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"},
{"16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","976403809728","8922","487784120896","329","611","59101","611","2131059721","53952148295020","445948587","3905249775372","4683180907","7169093","01413852276627","63","5864","40862536595","2280304422294","930028582","05","33447"},
{"001000100000","1010","01011","11","011","1010"},
{"Om", "Om", "Shankar", "Tripathi", "Tom", "Jerry", "Jerry"},
{"2","644","2","42484637089","81578664","0778"},
{"001000101","011010","1","101010011","011010","01","10111000101","0","1","00101101","0","0"},
{"kl","p sH","PwCPMPu","tQoIgPpk","wtsNP WjS","kl ","TXsFWgU","kl","AD","NjjTyFGwNWZcB","jpFQslbGbDI","cEpGAgvpk","EMaDkMOm","YZuNZgfwDIjG","k","hJx jHmGpQYwQP","CIETe","RH","Pj","h","DInR","AEsqOvliQtz","NwzHTALTt LS","LwLR","WvDCzlQF","soJb","WktoldCbWyTO","pIdRJxY","BmpWxjOwTXkjjL","zmtCiQ","g","yBmDW","QhaBZrQnOJaAJ","u","MGTwCKve","UxYQrONag","xsGSz","dqNPTT","U W","ygJKvCEKDClby","M","yXJQHxjyDQDLkT","oJmaREOEk YA","zUwiwhSMdiC","jYgZEktcdgLD","fwyTAAW","GENttdzeGY "},
{"938","074209","0949093096","218622476","71692175","0714","81217924991","74016430795374","52213147","338","939","798161500954","90528060774015","68715","75810","43450","8017","0193164","5945740","212","4589289","2912211026","0","49","8230114","0733435391403","5429","10070"},
{"00","0","00","0101111010100","110"},
{"g","h","ok","h","ok","sqozuC","ut","ZwRcG","ok","MR","jHrWyy","qaJlrokgRHuZH","LjPNzDUKszYmCq","g","ZGjLfMnyAGL","kEZoSxOMEWSFpw","IFtqNaDVnG","iJoJXl","vjrQMyWor","FTEHZqbHGlmHph","QeSdzm","nPostKHkigyJt","mOSekk"}};
vector<int> param1 {10,32,6,7,6,12,43,20,4,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 ( string str [ ], int n ) { unordered_map < string, int > m; for ( int i = 0; i < n; i ++ ) m [ str [ i ] ] += 1; int res = 0; for ( auto it = m . begin ( ); it != m . end ( ); it ++ ) if ( ( [MASK] -> second == 2 ) ) res ++; return res; } > m;
for ( int i = 0;
i < n;
i ++ ) m [ str [ i ] ] += 1;
int res = 0;
for ( auto it = m . begin ( );
it != m . end ( );
it ++ ) if ( ( it -> second == 2 ) ) res ++;
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<string>> param0 {
{"hate", "love", "peace", "love", "peace", "hate", "love", "peace", "love", "peace"},
{"16","946613197072","532052","42780833","511552","1241934","4","3444540","47487223670074","23753","14158","4","95420017116714","16","0845","689000748","976403809728","8922","487784120896","329","611","59101","611","2131059721","53952148295020","445948587","3905249775372","4683180907","7169093","01413852276627","63","5864","40862536595","2280304422294","930028582","05","33447"},
{"001000100000","1010","01011","11","011","1010"},
{"Om", "Om", "Shankar", "Tripathi", "Tom", "Jerry", "Jerry"},
{"2","644","2","42484637089","81578664","0778"},
{"001000101","011010","1","101010011","011010","01","10111000101","0","1","00101101","0","0"},
{"kl","p sH","PwCPMPu","tQoIgPpk","wtsNP WjS","kl ","TXsFWgU","kl","AD","NjjTyFGwNWZcB","jpFQslbGbDI","cEpGAgvpk","EMaDkMOm","YZuNZgfwDIjG","k","hJx jHmGpQYwQP","CIETe","RH","Pj","h","DInR","AEsqOvliQtz","NwzHTALTt LS","LwLR","WvDCzlQF","soJb","WktoldCbWyTO","pIdRJxY","BmpWxjOwTXkjjL","zmtCiQ","g","yBmDW","QhaBZrQnOJaAJ","u","MGTwCKve","UxYQrONag","xsGSz","dqNPTT","U W","ygJKvCEKDClby","M","yXJQHxjyDQDLkT","oJmaREOEk YA","zUwiwhSMdiC","jYgZEktcdgLD","fwyTAAW","GENttdzeGY "},
{"938","074209","0949093096","218622476","71692175","0714","81217924991","74016430795374","52213147","338","939","798161500954","90528060774015","68715","75810","43450","8017","0193164","5945740","212","4589289","2912211026","0","49","8230114","0733435391403","5429","10070"},
{"00","0","00","0101111010100","110"},
{"g","h","ok","h","ok","sqozuC","ut","ZwRcG","ok","MR","jHrWyy","qaJlrokgRHuZH","LjPNzDUKszYmCq","g","ZGjLfMnyAGL","kEZoSxOMEWSFpw","IFtqNaDVnG","iJoJXl","vjrQMyWor","FTEHZqbHGlmHph","QeSdzm","nPostKHkigyJt","mOSekk"}};
vector<int> param1 {10,32,6,7,6,12,43,20,4,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;
} | it | [
"a) ==",
"b) >",
"c) it",
"d) m",
"e) out"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
if ( a == 0 ) return b;
return f_gold ( b % a, a );
}
tring>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
if ( a == 0 ) return b;
return f_gold ( b % a, a );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,26,40,58,25,2,8,21,82,17};
vector<int> param1 {89,82,12,4,44,87,65,87,10,61};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a, int b ) { if ( a == 0 [MASK] return b; return f_gold ( b % a, a ); }tring>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
if ( a == 0 ) return b;
return f_gold ( b % a, a );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {46,26,40,58,25,2,8,21,82,17};
vector<int> param1 {89,82,12,4,44,87,65,87,10,61};
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) <string>",
"b) arr",
"c) mod",
"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, int p ) {
n = n % p;
for ( int x = 2;
x < p;
x ++ ) if ( ( x * x ) % p == n ) return true;
return false;
}
de <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n, int p ) {
n = n % p;
for ( int x = 2;
x < p;
x ++ ) if ( ( x * x ) % p == n ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,85,4,20,71,72,36,95,83,72};
vector<int> param1 {78,75,35,99,29,88,54,52,33,13};
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 n, int p ) { n = [MASK] % p; for ( int x = 2; x < p; x ++ ) if ( ( x * x ) % p == n ) return true; return false; }de <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int n, int p ) {
n = n % p;
for ( int x = 2;
x < p;
x ++ ) if ( ( x * x ) % p == n ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {71,85,4,20,71,72,36,95,83,72};
vector<int> param1 {78,75,35,99,29,88,54,52,33,13};
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;
} | n | [
"a) <iomanip>",
"b) (",
"c) javafx.util.Pair;",
"d) public",
"e) n"
] | e |
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;
for ( int i = n;
i >= 0;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res;
else res *= i;
}
}
stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1;
for ( int i = n;
i >= 0;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res;
else res *= i;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {88,24,3,22,53,2,88,30,38,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> [MASK] <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; for ( int i = n; i >= 0; i = i - 2 ) { if ( i == 0 || i == 1 ) return res; else res *= i; } }stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
int res = 1;
for ( int i = n;
i >= 0;
i = i - 2 ) {
if ( i == 0 || i == 1 ) return res;
else res *= i;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {88,24,3,22,53,2,88,30,38,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) '0';",
"b) 0",
"c) #include",
"d) res",
"e) (x"
] | 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 result = 0;
for ( int i = 2;
i <= sqrt ( n );
i ++ ) {
if ( n % i == 0 ) {
if ( i == ( n / i ) ) result += i;
else result += ( i + n / i );
}
}
return ( result + n + 1 );
}
= 0;
for ( int i = 2;
i <= sqrt ( n );
i ++ ) {
if ( n % i == 0 ) {
if ( i == ( n / i ) ) result += i;
else result += ( i + n / i );
}
}
return ( result + n + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,21,4,49,35,55,43,39,36,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include [MASK] #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int result = 0; for ( int i = 2; i <= sqrt ( n ); i ++ ) { if ( n % i == 0 ) { if ( i == ( n / i ) ) result += i; else result += ( i + n / i ); } } return ( result + n + 1 ); } = 0;
for ( int i = 2;
i <= sqrt ( n );
i ++ ) {
if ( n % i == 0 ) {
if ( i == ( n / i ) ) result += i;
else result += ( i + n / i );
}
}
return ( result + n + 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {76,21,4,49,35,55,43,39,36,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <iomanip> | [
"a) ++",
"b) :",
"c) y1",
"d) <iomanip>",
"e) ("
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int num ) {
int sum = 0;
for ( int i = 2;
i * i <= num;
i ++ ) {
while ( num % i == 0 ) {
sum += i;
num /= i;
}
}
sum += num;
return sum;
}
pace std;
int f_gold ( int num ) {
int sum = 0;
for ( int i = 2;
i * i <= num;
i ++ ) {
while ( num % i == 0 ) {
sum += i;
num /= i;
}
}
sum += num;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,88,60,6,26,98,38,90,76,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 num ) { int sum = 0; for ( int i = 2; i * i [MASK] num; i ++ ) { while ( num % i == 0 ) { sum += i; num /= i; } } sum += num; return sum; }pace std;
int f_gold ( int num ) {
int sum = 0;
for ( int i = 2;
i * i <= num;
i ++ ) {
while ( num % i == 0 ) {
sum += i;
num /= i;
}
}
sum += num;
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {83,88,60,6,26,98,38,90,76,66};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <= | [
"a) javafx.util.Pair;",
"b) <=",
"c) *",
"d) *",
"e) i"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int checker = 0;
for ( int i = 0;
i < str . length ( );
++ i ) {
int val = ( str [ i ] - 'a' );
if ( ( checker & ( 1 << val ) ) > 0 ) return i;
checker |= ( 1 << val );
}
return - 1;
}
r = 0;
for ( int i = 0;
i < str . length ( );
++ i ) {
int val = ( str [ i ] - 'a' );
if ( ( checker & ( 1 << val ) ) > 0 ) return i;
checker |= ( 1 << val );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"XFGfXTDgpIuerN","5621946166","11010110","xL","2575","0100010","SZmmQ","9735892999350","1001101101101","oEXDbOU"};
for(int i = 0; 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 checker = 0; [MASK] ( int i = 0; i < str . length ( ); ++ i ) { int val = ( str [ i ] - 'a' ); if ( ( checker & ( 1 << val ) ) > 0 ) return i; checker |= ( 1 << val ); } return - 1; }r = 0;
for ( int i = 0;
i < str . length ( );
++ i ) {
int val = ( str [ i ] - 'a' );
if ( ( checker & ( 1 << val ) ) > 0 ) return i;
checker |= ( 1 << val );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"XFGfXTDgpIuerN","5621946166","11010110","xL","2575","0100010","SZmmQ","9735892999350","1001101101101","oEXDbOU"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | for | [
"a) ==",
"b) return",
"c) 0.0246",
"d) def",
"e) for"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_set < int > us;
int even_count = 0;
for ( int i = 0;
i < n;
i ++ ) if ( arr [ i ] % 2 == 0 ) us . insert ( arr [ i ] );
unordered_set < int > :: iterator itr;
for ( itr = us . begin ( );
itr != us . end ( );
itr ++ ) even_count ++;
return ( pow ( 2, even_count ) - 1 );
}
== 0 ) us . insert ( arr [ i ] );
unordered_set < int > :: iterator itr;
for ( itr = us . begin ( );
itr != us . end ( );
itr ++ ) even_count ++;
return ( pow ( 2, even_count ) - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,8,14,22,24,24,26,32,33,46,50,51,51,52,53,71,76,93},{-62,30,12,30,22,6,-42,80,-62,34,32,-72,-6,-16,42,82,-78,-20,-96,44,-24,-50,-50,-94,72,-90,38,84,-86,-24,-62,86,94,6,90,12,-36,0,44,4,-78,-86,-12,-18,26,32,90,76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{70,55,67,9,78,57,31,25},{-98,-90,-80,-80,-68,-68,-50,-44,-38,-34,-18,-16,-10,-8,14,14,16,24,26,28,30,40,44,46,52,54,58,66,74,74,74,76,80,86,94,96},{0,1,1,0,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1},{7,10,11,13,14,16,20,26,30,31,33,33,35,39,42,50,51,52,55,57,58,59,62,63,63,65,67,67,68,69,69,71,73,73,74,76,82,86,87,87,87,88,94,99},{-6,8,-14,2,-36,-44,-50,-4,-4,-22,94,-94,-62,4,-84,-82,88,84,28,76,-84,-72,14,-28,96,18,-56,-96,2,-66,62,-78,88,34,0,-48,-76,-84,-2,-98,58,38,56},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{75,92,42,5,53,78,42,97,99,56,23,16,90,1,79,49,63,95,12,21,82,31,10,35,34,80,22,73,68,68,48,11,15,60,24,57,74,18,30,57,66,97,78,65,79}};
vector<int> param1 {16,47,32,6,30,11,39,23,17,29};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_set < int > us; int even_count = 0; for ( int i = 0; i < n; i ++ ) if ( [MASK] [ i ] % 2 == 0 ) us . insert ( arr [ i ] ); unordered_set < int > :: iterator itr; for ( itr = us . begin ( ); itr != us . end ( ); itr ++ ) even_count ++; return ( pow ( 2, even_count ) - 1 ); } == 0 ) us . insert ( arr [ i ] );
unordered_set < int > :: iterator itr;
for ( itr = us . begin ( );
itr != us . end ( );
itr ++ ) even_count ++;
return ( pow ( 2, even_count ) - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,8,14,22,24,24,26,32,33,46,50,51,51,52,53,71,76,93},{-62,30,12,30,22,6,-42,80,-62,34,32,-72,-6,-16,42,82,-78,-20,-96,44,-24,-50,-50,-94,72,-90,38,84,-86,-24,-62,86,94,6,90,12,-36,0,44,4,-78,-86,-12,-18,26,32,90,76},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{70,55,67,9,78,57,31,25},{-98,-90,-80,-80,-68,-68,-50,-44,-38,-34,-18,-16,-10,-8,14,14,16,24,26,28,30,40,44,46,52,54,58,66,74,74,74,76,80,86,94,96},{0,1,1,0,1,0,0,1,0,0,1,1,1,1,0,0,0,0,0,1},{7,10,11,13,14,16,20,26,30,31,33,33,35,39,42,50,51,52,55,57,58,59,62,63,63,65,67,67,68,69,69,71,73,73,74,76,82,86,87,87,87,88,94,99},{-6,8,-14,2,-36,-44,-50,-4,-4,-22,94,-94,-62,4,-84,-82,88,84,28,76,-84,-72,14,-28,96,18,-56,-96,2,-66,62,-78,88,34,0,-48,-76,-84,-2,-98,58,38,56},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{75,92,42,5,53,78,42,97,99,56,23,16,90,1,79,49,63,95,12,21,82,31,10,35,34,80,22,73,68,68,48,11,15,60,24,57,74,18,30,57,66,97,78,65,79}};
vector<int> param1 {16,47,32,6,30,11,39,23,17,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;
} | arr | [
"a) }",
"b) arr",
"c) #include",
"d) int",
"e) max_count"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
if ( n < 3 ) return - 1;
sort ( arr, arr + n );
return max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ], arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] );
}
td;
int f_gold ( int arr [ ], int n ) {
if ( n < 3 ) return - 1;
sort ( arr, arr + n );
return max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ], arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,8,14,15,18,21,21,21,27,29,30,33,34,34,35,37,40,41,44,44,46,49,54,58,60,61,61,63,66,69,69,70,81,82,82,90,90,90,91,92,92,96,97,99},{72,-32,-2,-76,-56,70,-52,12,-50,32,-98,48,-32,-90,-66,-98,56,-58,-88,50,-22,18,-60,68,70,28},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{38,69,18,72,99,49,17,76,86,53,6,94,66,5,2,62,99,5,31,81,63,91,95,74,76,18,77},{-92,-58,-8,20,24,24,42,98},{0,1,1,0,1,0,0,1,0,1,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,1,1,1,1,0},{46,64,81},{4,-26,20,34,-4,-40,76,94,-14,-80,42,60,92,-96,44,58,34,68,96,-8,-18,-92},{0,0,0,1,1,1,1,1},{61,17,28,18,52,58,41,75,98,79,1,97,73,17,79,4,46,70,6,83,23,94,1}};
vector<int> param1 {39,18,17,21,4,38,1,17,7,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { if ( n [MASK] 3 ) return - 1; sort ( arr, arr + n ); return max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ], arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] ); }td;
int f_gold ( int arr [ ], int n ) {
if ( n < 3 ) return - 1;
sort ( arr, arr + n );
return max ( arr [ 0 ] * arr [ 1 ] * arr [ n - 1 ], arr [ n - 1 ] * arr [ n - 2 ] * arr [ n - 3 ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,8,14,15,18,21,21,21,27,29,30,33,34,34,35,37,40,41,44,44,46,49,54,58,60,61,61,63,66,69,69,70,81,82,82,90,90,90,91,92,92,96,97,99},{72,-32,-2,-76,-56,70,-52,12,-50,32,-98,48,-32,-90,-66,-98,56,-58,-88,50,-22,18,-60,68,70,28},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{38,69,18,72,99,49,17,76,86,53,6,94,66,5,2,62,99,5,31,81,63,91,95,74,76,18,77},{-92,-58,-8,20,24,24,42,98},{0,1,1,0,1,0,0,1,0,1,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,0,1,1,1,0,0,1,0,0,0,1,1,0,1,1,1,1,0},{46,64,81},{4,-26,20,34,-4,-40,76,94,-14,-80,42,60,92,-96,44,58,34,68,96,-8,-18,-92},{0,0,0,1,1,1,1,1},{61,17,28,18,52,58,41,75,98,79,1,97,73,17,79,4,46,70,6,83,23,94,1}};
vector<int> param1 {39,18,17,21,4,38,1,17,7,19};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | < | [
"a) mat",
"b) <",
"c) <=",
"d) int",
"e) import"
] | 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 price [ ], int n, int k ) {
int profit [ k + 1 ] [ n + 1 ];
for ( int i = 0;
i <= k;
i ++ ) profit [ i ] [ 0 ] = 0;
for ( int j = 0;
j <= n;
j ++ ) profit [ 0 ] [ j ] = 0;
for ( int i = 1;
i <= k;
i ++ ) {
int prevDiff = INT_MIN;
for ( int j = 1;
j < n;
j ++ ) {
prevDiff = max ( prevDiff, profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], price [ j ] + prevDiff );
}
}
return profit [ k ] [ n - 1 ];
}
ff = max ( prevDiff, profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], price [ j ] + prevDiff );
}
}
return profit [ k ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,16,16,19,37,47,49,74,77,86,96},{-6,-70,-26,78,98,-72,48,-94,-38,52,-50,58,84,16,-74,32,-44,-50,68,-48,28,94,-26,-96,-42,96,-24,42,-70,10,-16,-32,98,38,-2,26,-26,-78,44,-72,-56,-22},{0,0,0,0,0,0,0,1,1,1},{22,12,58,70},{-96,-96,-94,-92,-90,-88,-88,-84,-78,-76,-72,-72,-68,-62,-54,-52,-52,-36,-34,-32,-26,-20,-6,-4,-4,4,8,10,14,16,32,32,32,34,42,46,50,60,62,64,64,72,74,76,76,78,90,92,96},{1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,1,1,0},{2,4,7,11,20,24,25,27,29,33,33,36,36,41,44,45,47,54,65,66,67,75,78,82,85,90},{56,2,-10,-44,68,10,-32,-2,-68,12,-34,-36,0,40,-16,-36,92,8,-40,-10,46,98,76,-2,98,-20,6,68,32,-26,-12,70,16,-34,-50,-76,-34,-18,0,-44,-76,58},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{78,39,2,76,20,21,3,21,32,80,28,89,51,2,88,19,99,71,68,38,8,76,48,81,90,71,31}};
vector<int> param1 {6,31,7,3,30,14,15,24,10,14};
vector<int> param2 {6,32,8,2,36,13,22,35,8,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 price [ ], int n, int k ) { int profit [ k + 1 ] [ n + 1 ]; for ( int i = 0; i <= k; i ++ ) profit [ i ] [ 0 ] = 0; for ( int j = 0; j <= n; j ++ ) profit [ 0 [MASK] [ j ] = 0; for ( int i = 1; i <= k; i ++ ) { int prevDiff = INT_MIN; for ( int j = 1; j < n; j ++ ) { prevDiff = max ( prevDiff, profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] ); profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], price [ j ] + prevDiff ); } } return profit [ k ] [ n - 1 ]; }ff = max ( prevDiff, profit [ i - 1 ] [ j - 1 ] - price [ j - 1 ] );
profit [ i ] [ j ] = max ( profit [ i ] [ j - 1 ], price [ j ] + prevDiff );
}
}
return profit [ k ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,6,16,16,19,37,47,49,74,77,86,96},{-6,-70,-26,78,98,-72,48,-94,-38,52,-50,58,84,16,-74,32,-44,-50,68,-48,28,94,-26,-96,-42,96,-24,42,-70,10,-16,-32,98,38,-2,26,-26,-78,44,-72,-56,-22},{0,0,0,0,0,0,0,1,1,1},{22,12,58,70},{-96,-96,-94,-92,-90,-88,-88,-84,-78,-76,-72,-72,-68,-62,-54,-52,-52,-36,-34,-32,-26,-20,-6,-4,-4,4,8,10,14,16,32,32,32,34,42,46,50,60,62,64,64,72,74,76,76,78,90,92,96},{1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,1,1,0},{2,4,7,11,20,24,25,27,29,33,33,36,36,41,44,45,47,54,65,66,67,75,78,82,85,90},{56,2,-10,-44,68,10,-32,-2,-68,12,-34,-36,0,40,-16,-36,92,8,-40,-10,46,98,76,-2,98,-20,6,68,32,-26,-12,70,16,-34,-50,-76,-34,-18,0,-44,-76,58},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{78,39,2,76,20,21,3,21,32,80,28,89,51,2,88,19,99,71,68,38,8,76,48,81,90,71,31}};
vector<int> param1 {6,31,7,3,30,14,15,24,10,14};
vector<int> param2 {6,32,8,2,36,13,22,35,8,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;
} | ] | [
"a) 1;",
"b) )",
"c) max(int",
"d) ]",
"e) int"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_set < int > s;
int first = 0, second = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
s . insert ( arr [ i ] );
continue;
}
if ( arr [ i ] > first ) {
second = first;
first = arr [ i ];
}
else if ( arr [ i ] > second ) second = arr [ i ];
}
return ( first * second );
}
continue;
}
if ( arr [ i ] > first ) {
second = first;
first = arr [ i ];
}
else if ( arr [ i ] > second ) second = arr [ i ];
}
return ( first * second );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,6,7,8,12,13,14,15,18,18,19,19,26,26,32,32,33,34,34,36,41,43,47,47,51,51,52,53,55,56,57,60,61,71,74,75,76,77,79,87,87,87,90,95,98,99},{-64,-72,6,-62,54,14,28,60,-96,14,-32,-2,80,8,-56,68,86,64,86,-12,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,7,14,50,94,24,79,13,19,29,22,2,77,36,38,18,51,15,99,52,17,77,22,54},{-96,-92,-86,-84,-84,-80,-70,-70,-68,-64,-64,-48,-46,-24,-22,-20,-8,-8,0,0,4,8,8,22,28,36,46,50,52,54,60,62,66,70,80,84,86,94,96,96},{1,0,1,0,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,1},{98},{-88,-24,8,20,-46,60,24,26,98,82,-30,16,22,-28,84,12,34,14,-18,-38,-94,-24,6,4,-52,-48,84},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{6,30,47,97,20,16,68,34,1,77,48,8,22,68}};
vector<int> param1 {37,12,27,15,25,12,0,21,21,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_set < int > s; int first = 0, second = 0; for ( int i = 0; i < n; i ++ ) { if ( s . find ( arr [ i ] ) == s . end ( ) ) { s . insert ( arr [ i ] ); continue; } if [MASK] arr [ i ] > first ) { second = first; first = arr [ i ]; } else if ( arr [ i ] > second ) second = arr [ i ]; } return ( first * second ); }
continue;
}
if ( arr [ i ] > first ) {
second = first;
first = arr [ i ];
}
else if ( arr [ i ] > second ) second = arr [ i ];
}
return ( first * second );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,6,7,8,12,13,14,15,18,18,19,19,26,26,32,32,33,34,34,36,41,43,47,47,51,51,52,53,55,56,57,60,61,71,74,75,76,77,79,87,87,87,90,95,98,99},{-64,-72,6,-62,54,14,28,60,-96,14,-32,-2,80,8,-56,68,86,64,86,-12,82},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,7,14,50,94,24,79,13,19,29,22,2,77,36,38,18,51,15,99,52,17,77,22,54},{-96,-92,-86,-84,-84,-80,-70,-70,-68,-64,-64,-48,-46,-24,-22,-20,-8,-8,0,0,4,8,8,22,28,36,46,50,52,54,60,62,66,70,80,84,86,94,96,96},{1,0,1,0,1,1,0,0,1,1,0,1,0,0,0,1,1,0,0,1,1},{98},{-88,-24,8,20,-46,60,24,26,98,82,-30,16,22,-28,84,12,34,14,-18,-38,-94,-24,6,4,-52,-48,84},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{6,30,47,97,20,16,68,34,1,77,48,8,22,68}};
vector<int> param1 {37,12,27,15,25,12,0,21,21,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) double",
"b) b",
"c) range",
"d) (",
"e) c"
] | 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 leftMax [ n ];
leftMax [ 0 ] = INT_MIN;
for ( int i = 1;
i < n;
i ++ ) leftMax [ i ] = max ( leftMax [ i - 1 ], arr [ i - 1 ] );
int rightMin = INT_MAX;
for ( int i = n - 1;
i >= 0;
i -- ) {
if ( leftMax [ i ] < arr [ i ] && rightMin > arr [ i ] ) return i;
rightMin = min ( rightMin, arr [ i ] );
}
return - 1;
}
ghtMin = INT_MAX;
for ( int i = n - 1;
i >= 0;
i -- ) {
if ( leftMax [ i ] < arr [ i ] && rightMin > arr [ i ] ) return i;
rightMin = min ( rightMin, arr [ i ] );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,24,30,33,56,67,87,90},{72,-48,12,4,46,36,2,58,82,-88,-14,56,90,76,18,-6,-28,18,88,90,40,-68,-10,-82,-28,16,32,-90,12,-86,-16,78,-98,-52,-26,80,6,50,40,-12,52,38,-92,94,-32,14,-80,-88,48},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{51,87,46,76,2,89,56,34,49,61,44,73,14,60,89},{-90,-90,-80,-72,-68,-64,-62,-62,-60,-46,-44,-44,-44,-42,-42,-32,-22,-22,-18,-2,4,6,10,12,14,30,34,34,40,56,56,56,58,68,74,78,78,82,84,86,88,90,92},{0,0,0,1,1,0,1,1,1,0,0,1,1,1,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,0,0,1,1,1,0,0,0,1,1,0},{7,8,11,12,15,17,28,34,57,61,66,76,92},{-22,-96,-78,-60,34,-18,86,-42,-78,76,8,28,-80,80,6,-72,34,66,84,50,-4,18,72,-66,-68,-24,56,-12,-70,24,-82},{0,0,0,0,0,0,1,1,1,1,1},{79,81,55,6,78,93,81,33,29,1,27,49,21,58,22,65,44,95,6,51,75,42,14,55,79,82,90,8,15,15,53,98,76,43,33}};
vector<int> param1 {4,28,30,11,29,26,9,19,9,30};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int leftMax [ n ]; leftMax [ 0 ] = INT_MIN; for ( int i = 1; i < n; i ++ ) leftMax [ i ] = max ( leftMax [ i - 1 ], arr [ i - 1 ] ); int rightMin = [MASK] for ( int i = n - 1; i >= 0; i -- ) { if ( leftMax [ i ] < arr [ i ] && rightMin > arr [ i ] ) return i; rightMin = min ( rightMin, arr [ i ] ); } return - 1; }ghtMin = INT_MAX;
for ( int i = n - 1;
i >= 0;
i -- ) {
if ( leftMax [ i ] < arr [ i ] && rightMin > arr [ i ] ) return i;
rightMin = min ( rightMin, arr [ i ] );
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,24,30,33,56,67,87,90},{72,-48,12,4,46,36,2,58,82,-88,-14,56,90,76,18,-6,-28,18,88,90,40,-68,-10,-82,-28,16,32,-90,12,-86,-16,78,-98,-52,-26,80,6,50,40,-12,52,38,-92,94,-32,14,-80,-88,48},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{51,87,46,76,2,89,56,34,49,61,44,73,14,60,89},{-90,-90,-80,-72,-68,-64,-62,-62,-60,-46,-44,-44,-44,-42,-42,-32,-22,-22,-18,-2,4,6,10,12,14,30,34,34,40,56,56,56,58,68,74,78,78,82,84,86,88,90,92},{0,0,0,1,1,0,1,1,1,0,0,1,1,1,0,0,1,1,1,0,1,0,1,0,0,0,0,0,1,0,0,1,1,1,0,0,0,1,1,0},{7,8,11,12,15,17,28,34,57,61,66,76,92},{-22,-96,-78,-60,34,-18,86,-42,-78,76,8,28,-80,80,6,-72,34,66,84,50,-4,18,72,-66,-68,-24,56,-12,-70,24,-82},{0,0,0,0,0,0,1,1,1,1,1},{79,81,55,6,78,93,81,33,29,1,27,49,21,58,22,65,44,95,6,51,75,42,14,55,79,82,90,8,15,15,53,98,76,43,33}};
vector<int> param1 {4,28,30,11,29,26,9,19,9,30};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | INT_MAX; | [
"a) INT_MAX;",
"b) (",
"c) ]",
"d) std;",
"e) a"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string s ) {
int n = s . length ( );
int auxArr [ n ] = {
0 };
if ( s [ 0 ] == '1' ) auxArr [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
if ( s [ i ] == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1;
else auxArr [ i ] = auxArr [ i - 1 ];
}
int count = 0;
for ( int i = n - 1;
i >= 0;
i -- ) if ( s [ i ] == '1' ) count += auxArr [ i ];
return count;
}
- 1 ] + 1;
else auxArr [ i ] = auxArr [ i - 1 ];
}
int count = 0;
for ( int i = n - 1;
i >= 0;
i -- ) if ( s [ i ] == '1' ) count += auxArr [ i ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"OGiOkJF","517376","11","Ze","8763644247018","00111010001","HGwkBKUOVu","652","101000011110","kvdpG "};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( string s ) { int n = s . length ( ); int auxArr [ n ] = { 0 }; if ( s [ 0 ] == '1' ) auxArr [ 0 ] = 1; for ( int i = 1; i < n; i ++ ) { if ( s [ i ] == '1' ) auxArr [ i ] = auxArr [ i - 1 ] + 1; else auxArr [ [MASK] ] = auxArr [ i - 1 ]; } int count = 0; for ( int i = n - 1; i >= 0; i -- ) if ( s [ i ] == '1' ) count += auxArr [ i ]; return count; }- 1 ] + 1;
else auxArr [ i ] = auxArr [ i - 1 ];
}
int count = 0;
for ( int i = n - 1;
i >= 0;
i -- ) if ( s [ i ] == '1' ) count += auxArr [ i ];
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"OGiOkJF","517376","11","Ze","8763644247018","00111010001","HGwkBKUOVu","652","101000011110","kvdpG "};
for(int i = 0; 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) <iomanip>",
"b) ++",
"c) unlock_code",
"d) i",
"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_set < int > S;
int ans = 0;
for ( int i = 0;
i < n;
i ++ ) S . insert ( arr [ i ] );
for ( int i = 0;
i < n;
i ++ ) {
if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,28,31,64,73},{46,26,-84,-24,50,94,-14,74,-52,-62,2,46,62,54,-30,-70,-76,74,60,10,60,98,-92,98,-96,34,30,58,-60,-52,-66,-40,-78,-26,80,-58,-26,80,92,66,90,4,46,-78,80,62,30,0,38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{24,72,87,81,90,59,18,29,12,24,78,59,93,80,79,26,17,28,43,85,85,76,83,71,28,99,80,14,9,92,46,59,66,34},{-94,-94,-94,-76,-68,-64,-64,-56,-48,-46,-36,-26,-12,-6,-6,-2,-2,6,6,24,46,48,50,52,58,76,88},{1},{1,8,22,27,28,58,80,89,95},{46,38,-50,98,-22,92,84,-48},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{74,2,85,72,1,49,53,48,46,44,98,75,5,13,98,69,65,68,37,38,77,69,14,17,46,54,55,20,23,59,98,44,22,12,71,18,94,49,57,82,7,64,33,7,29,58,45,98}};
vector<int> param1 {3,29,38,32,19,0,5,6,19,36};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_set < int > S; int ans = 0; for ( int i = 0; i < n; i ++ ) S . insert ( arr [ i ] ); for ( int i = 0; i < n; i ++ ) { if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) { int j = arr [ i ]; while ( S . find ( j ) != S . end ( ) ) j ++; ans = max ( ans, [MASK] - arr [ i ] ); } } return ans; } if ( S . find ( arr [ i ] - 1 ) == S . end ( ) ) {
int j = arr [ i ];
while ( S . find ( j ) != S . end ( ) ) j ++;
ans = max ( ans, j - arr [ i ] );
}
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,28,31,64,73},{46,26,-84,-24,50,94,-14,74,-52,-62,2,46,62,54,-30,-70,-76,74,60,10,60,98,-92,98,-96,34,30,58,-60,-52,-66,-40,-78,-26,80,-58,-26,80,92,66,90,4,46,-78,80,62,30,0,38},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{24,72,87,81,90,59,18,29,12,24,78,59,93,80,79,26,17,28,43,85,85,76,83,71,28,99,80,14,9,92,46,59,66,34},{-94,-94,-94,-76,-68,-64,-64,-56,-48,-46,-36,-26,-12,-6,-6,-2,-2,6,6,24,46,48,50,52,58,76,88},{1},{1,8,22,27,28,58,80,89,95},{46,38,-50,98,-22,92,84,-48},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{74,2,85,72,1,49,53,48,46,44,98,75,5,13,98,69,65,68,37,38,77,69,14,17,46,54,55,20,23,59,98,44,22,12,71,18,94,49,57,82,7,64,33,7,29,58,45,98}};
vector<int> param1 {3,29,38,32,19,0,5,6,19,36};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | j | [
"a) ]",
"b) )",
"c) #include",
"d) j",
"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 ( char symb [ ], char oper [ ], int n ) {
int F [ n ] [ n ], T [ n ] [ n ];
for ( int i = 0;
i < n;
i ++ ) {
F [ i ] [ i ] = ( symb [ i ] == 'F' ) ? 1 : 0;
T [ i ] [ i ] = ( symb [ i ] == 'T' ) ? 1 : 0;
}
for ( int gap = 1;
gap < n;
++ gap ) {
for ( int i = 0, j = gap;
j < n;
++ i, ++ j ) {
T [ i ] [ j ] = F [ i ] [ j ] = 0;
for ( int g = 0;
g < gap;
g ++ ) {
int k = i + g;
int tik = T [ i ] [ k ] + F [ i ] [ k ];
int tkj = T [ k + 1 ] [ j ] + F [ k + 1 ] [ j ];
if ( oper [ k ] == '&' ) {
T [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ];
F [ i ] [ j ] += ( tik * tkj - T [ i ] [ k ] * T [ k + 1 ] [ j ] );
}
if ( oper [ k ] == '|' ) {
F [ i ] [ j ] += F [ i ] [ k ] * F [ k + 1 ] [ j ];
T [ i ] [ j ] += ( tik * tkj - F [ i ] [ k ] * F [ k + 1 ] [ j ] );
}
if ( oper [ k ] == '^' ) {
T [ i ] [ j ] += F [ i ] [ k ] * T [ k + 1 ] [ j ] + T [ i ] [ k ] * F [ k + 1 ] [ j ];
F [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] + F [ i ] [ k ] * F [ k + 1 ] [ j ];
}
}
}
}
return T [ 0 ] [ n - 1 ];
}
j ] + T [ i ] [ k ] * F [ k + 1 ] [ j ];
F [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] + F [ i ] [ k ] * F [ k + 1 ] [ j ];
}
}
}
}
return T [ 0 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"TTFT",
"TFT",
"TFF",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT"
};
vector<string> param1 {
"|&^",
"^&",
"^|",
"|||",
"&&&",
"&&^",
"^&|",
"^^^",
"^||",
"|^|"
};
vector<int> param2 {4,3,3,4,4,4,4,4,4,4};
for(int i = 0; i < param0.size(); ++i)
{
char* arr0 = new char[param0[i].length() + 1];
arr0 = strncpy(arr0, param0[i].c_str(), sizeof(arr0));
char* arr1 = new char[param1[i].length() + 1];
arr1 = strncpy(arr1, param1[i].c_str(), sizeof(arr1));
if(f_filled(arr0,arr1,param2[i]) == f_gold(arr0,arr1,param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( char symb [ ], char oper [ ], int n ) { int F [ n ] [ n ], T [ n ] [ n ]; for ( int i = 0; i < n; i ++ ) { F [ i ] [ i ] = ( symb [ i ] == 'F' ) ? 1 : 0; T [ i ] [ i ] = ( symb [ i ] == 'T' ) ? 1 : 0; } for ( int gap = 1; gap < n; ++ gap ) { for ( int i = 0, j = gap; j < n; ++ i, ++ j ) { T [ i ] [ j ] = F [ i ] [ j ] = 0; for ( int g = 0; g < gap; g ++ ) { int k = i + g; int tik = T [ i ] [ k ] + F [ i ] [ k ]; int tkj = T [ k + 1 ] [ j ] + F [ k + 1 ] [ j ]; if ( oper [ k ] == '&' ) { T [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ]; F [ i ] [ j ] += ( tik * tkj - T [ i ] [ k ] * T [ k + 1 ] [ j ] ); } if ( oper [ k ] == '|' [MASK] { F [ i ] [ j ] += F [ i ] [ k ] * F [ k + 1 ] [ j ]; T [ i ] [ j ] += ( tik * tkj - F [ i ] [ k ] * F [ k + 1 ] [ j ] ); } if ( oper [ k ] == '^' ) { T [ i ] [ j ] += F [ i ] [ k ] * T [ k + 1 ] [ j ] + T [ i ] [ k ] * F [ k + 1 ] [ j ]; F [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] + F [ i ] [ k ] * F [ k + 1 ] [ j ]; } } } } return T [ 0 ] [ n - 1 ]; }j ] + T [ i ] [ k ] * F [ k + 1 ] [ j ];
F [ i ] [ j ] += T [ i ] [ k ] * T [ k + 1 ] [ j ] + F [ i ] [ k ] * F [ k + 1 ] [ j ];
}
}
}
}
return T [ 0 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"TTFT",
"TFT",
"TFF",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT",
"TTFT"
};
vector<string> param1 {
"|&^",
"^&",
"^|",
"|||",
"&&&",
"&&^",
"^&|",
"^^^",
"^||",
"|^|"
};
vector<int> param2 {4,3,3,4,4,4,4,4,4,4};
for(int i = 0; i < param0.size(); ++i)
{
char* arr0 = new char[param0[i].length() + 1];
arr0 = strncpy(arr0, param0[i].c_str(), sizeof(arr0));
char* arr1 = new char[param1[i].length() + 1];
arr1 = strncpy(arr1, param1[i].c_str(), sizeof(arr1));
if(f_filled(arr0,arr1,param2[i]) == f_gold(arr0,arr1,param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) )",
"b) i;",
"c) (",
"d) ]",
"e) 0"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str, int n ) {
int len = str . length ( );
if ( len >= n ) return true;
return false;
}
nclude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str, int n ) {
int len = str . length ( );
if ( len >= n ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZCoQhuM","7437725","11","buGlvR","9","101101010110","YguiM","8198","11101","hUInqJXNdbfP"};
vector<int> param1 {2,53,30,1,92,3,18,90,71,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string str, int n ) { int len = str . length ( [MASK] if ( len >= n ) return true; return false; }nclude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( string str, int n ) {
int len = str . length ( );
if ( len >= n ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"ZCoQhuM","7437725","11","buGlvR","9","101101010110","YguiM","8198","11101","hUInqJXNdbfP"};
vector<int> param1 {2,53,30,1,92,3,18,90,71,4};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ); | [
"a) return",
"b) char",
"c) }",
"d) );",
"e) )"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int A [ ], int arr_size, int sum ) {
int l, r;
for ( int i = 0;
i < arr_size - 2;
i ++ ) {
for ( int j = i + 1;
j < arr_size - 1;
j ++ ) {
for ( int k = j + 1;
k < arr_size;
k ++ ) {
if ( A [ i ] + A [ j ] + A [ k ] == sum ) {
cout << "Triplet is " << A [ i ] << ", " << A [ j ] << ", " << A [ k ];
return true;
}
}
}
}
return false;
}
if ( A [ i ] + A [ j ] + A [ k ] == sum ) {
cout << "Triplet is " << A [ i ] << ", " << A [ j ] << ", " << A [ k ];
return true;
}
}
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,18,38,47,75,88},{28,-2,62,38,86,-86,56,58,96,6,-28,8,68,-16,-80,-4,98,-92,4,-4,58,-62,46,64},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,77,17,91,6,35,22,4,30,23,97,56,78,16,22,23,95,57,43,27,47,44,23,10,3,94,55,22,93,32,89,28,64,22,13,24,38,44,6,1,80},{-98,-98,-94,-88,-80,-74,-68,-68,-64,-44,-36,-24,-10,-8,-8,0,4,6,8,8,12,14,16,38,50,52,54,56,66,68,76,88},{1,1,0,0,1,0,1,1},{7,22,24,30,42,44,49,49,65,70,70,74,74,75,90,95,96},{40,-76,-68,-86,-14,82,-20,54,-26,56,-24,-44,44,60,52,-20,80,-24,-90,-30,-2},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{33,92,6,99,83,97,49,97,85,52}};
vector<int> param1 {5,22,27,22,18,4,8,11,15,6};
vector<int> param2 {4,18,23,29,19,5,13,18,17,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int A [ ], int arr_size, int sum ) { int l, r; for ( int i = 0; i < arr_size - 2; i ++ ) { for ( int j = i + 1; j < arr_size - 1; j ++ ) { for ( int k = j + 1; k < arr_size; k ++ ) { if ( A [ i ] + A [MASK] j ] + A [ k ] == sum ) { cout << "Triplet is " << A [ i ] << ", " << A [ j ] << ", " << A [ k ]; return true; } } } } return false; } if ( A [ i ] + A [ j ] + A [ k ] == sum ) {
cout << "Triplet is " << A [ i ] << ", " << A [ j ] << ", " << A [ k ];
return true;
}
}
}
}
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{15,18,38,47,75,88},{28,-2,62,38,86,-86,56,58,96,6,-28,8,68,-16,-80,-4,98,-92,4,-4,58,-62,46,64},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{19,77,17,91,6,35,22,4,30,23,97,56,78,16,22,23,95,57,43,27,47,44,23,10,3,94,55,22,93,32,89,28,64,22,13,24,38,44,6,1,80},{-98,-98,-94,-88,-80,-74,-68,-68,-64,-44,-36,-24,-10,-8,-8,0,4,6,8,8,12,14,16,38,50,52,54,56,66,68,76,88},{1,1,0,0,1,0,1,1},{7,22,24,30,42,44,49,49,65,70,70,74,74,75,90,95,96},{40,-76,-68,-86,-14,82,-20,54,-26,56,-24,-44,44,60,52,-20,80,-24,-90,-30,-2},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{33,92,6,99,83,97,49,97,85,52}};
vector<int> param1 {5,22,27,22,18,4,8,11,15,6};
vector<int> param2 {4,18,23,29,19,5,13,18,17,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) pow",
"b) ],",
"c) count",
"d) [",
"e) #include"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n, int k ) {
int count;
for ( int i = 0;
i < n;
i ++ ) {
count = 0;
for ( int j = 0;
j < n;
j ++ ) {
if ( arr [ j ] == arr [ i ] ) count ++;
if ( count > 2 * k ) return false;
}
}
return true;
}
0;
i < n;
i ++ ) {
count = 0;
for ( int j = 0;
j < n;
j ++ ) {
if ( arr [ j ] == arr [ i ] ) count ++;
if ( count > 2 * k ) return false;
}
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,1},{2,3,3,5,3,3},{0,0,1,1,1},{7,60,78,91,80,75,85,21,41,63,1,84,69,13,94,25,54,54,52,68,53,35,17,37,98,27,2,31},{-96,-94,-82,-80,-78,-66,-36,-24,-18,-12,-2,-2,6,8,10,12,36,38,42,58,64,68,82,84,86,88,94},{0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,0,0,1,1,1,0},{16,19,25,25,32,37,48,59,60,60,71,74,77,81,91,94},{-62,-94,72,-22,86,-80,64,98,-82,-50,12,-4,56,46,-80,2,-86,-44,-26,68,-94,-82,74,26,94,40,50,-40,-42,-10},{0,0,0,0,0,1,1,1},{83,57,2,47,70,22,49,51,25,57,32,7,8,99,6,86,24,79,42,43,1,24,68,11,24,12,43,40,14,45,11,46,12,80,66}};
vector<int> param1 {5,6,2,24,24,34,10,20,5,21};
vector<int> param2 {2,2,1,2,3,2,8,4,2,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int arr [ ], int n, int k ) { int count; for ( int i = 0; i < n; i ++ ) { count = 0; for ( int j = 0; [MASK] < n; j ++ ) { if ( arr [ j ] == arr [ i ] ) count ++; if ( count > 2 * k ) return false; } } return true; }0;
i < n;
i ++ ) {
count = 0;
for ( int j = 0;
j < n;
j ++ ) {
if ( arr [ j ] == arr [ i ] ) count ++;
if ( count > 2 * k ) return false;
}
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,2,3,1},{2,3,3,5,3,3},{0,0,1,1,1},{7,60,78,91,80,75,85,21,41,63,1,84,69,13,94,25,54,54,52,68,53,35,17,37,98,27,2,31},{-96,-94,-82,-80,-78,-66,-36,-24,-18,-12,-2,-2,6,8,10,12,36,38,42,58,64,68,82,84,86,88,94},{0,1,1,1,0,0,0,0,1,0,0,0,1,0,0,1,1,1,1,1,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,0,0,1,0,0,1,1,1,0},{16,19,25,25,32,37,48,59,60,60,71,74,77,81,91,94},{-62,-94,72,-22,86,-80,64,98,-82,-50,12,-4,56,46,-80,2,-86,-44,-26,68,-94,-82,74,26,94,40,50,-40,-42,-10},{0,0,0,0,0,1,1,1},{83,57,2,47,70,22,49,51,25,57,32,7,8,99,6,86,24,79,42,43,1,24,68,11,24,12,43,40,14,45,11,46,12,80,66}};
vector<int> param1 {5,6,2,24,24,34,10,20,5,21};
vector<int> param2 {2,2,1,2,3,2,8,4,2,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | j | [
"a) j",
"b) 0",
"c) math.ceil",
"d) while",
"e) :"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int low, int high, int x ) {
int mid;
if ( x <= arr [ low ] ) return low;
if ( x > arr [ high ] ) return - 1;
mid = ( low + high ) / 2;
if ( arr [ mid ] == x ) return mid;
else if ( arr [ mid ] < x ) {
if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) return mid + 1;
else return f_gold ( arr, mid + 1, high, x );
}
else {
if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid;
else return f_gold ( arr, low, mid - 1, x );
}
}
) return mid + 1;
else return f_gold ( arr, mid + 1, high, x );
}
else {
if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid;
else return f_gold ( arr, low, mid - 1, x );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,13,16,23,24,24,27,30,32,34,34,55,56,56,63,66,81,83,96},{-28,-96,48,22,-12,72,48,-70,-96,-84,-62,22,18,-92,-74,14,28,52,64,72,16,-76,46},{0,1},{51,98,25,10,43,91,33,25,85,51,94,6,35,48,11,97,67,21,50,9,11,51,86,61,22,88,89,11},{-94,-92,-88,-74,-52,-50,-48,-44,-40,-36,-32,-26,20,22,30,32,46,56,56,60,62,64,80,84,86,94,96,96},{1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0},{4,5,5,13,26,40,46,51,58,60,64,66,68,69,71,74,78,81,83,88,88,90,98,99},{92,6,-54,84,-10,32,50,40,-38,64,-64,-10,70,-68,-6,-16,68,34,-66,-82,84,98,50,82,78,4,34,-34,78,64,32,58,-94,40,50,0,-92,-36,10,-54,58,-78,-88,32,6},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{80,67,30,35,9}};
vector<int> param1 {13,11,1,20,20,15,12,23,24,2};
vector<int> param2 {11,18,1,20,15,17,17,28,17,3};
vector<int> param3 {18,21,1,15,15,22,14,28,22,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high, int x ) { int mid; if ( x <= arr [ low ] ) return low; if ( x > arr [ high ] ) return - 1; mid = ( low + high ) / 2; if ( arr [ mid ] == x ) return mid; else if ( arr [ mid ] < x ) { if ( mid + 1 <= high && x <= arr [ mid + 1 ] ) return mid + 1; else return f_gold ( arr, mid + 1, high, x ); } else { if ( mid - 1 >= low && x > arr [ mid - 1 ] ) [MASK] mid; else return f_gold ( arr, low, mid - 1, x ); } }) return mid + 1;
else return f_gold ( arr, mid + 1, high, x );
}
else {
if ( mid - 1 >= low && x > arr [ mid - 1 ] ) return mid;
else return f_gold ( arr, low, mid - 1, x );
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,6,13,16,23,24,24,27,30,32,34,34,55,56,56,63,66,81,83,96},{-28,-96,48,22,-12,72,48,-70,-96,-84,-62,22,18,-92,-74,14,28,52,64,72,16,-76,46},{0,1},{51,98,25,10,43,91,33,25,85,51,94,6,35,48,11,97,67,21,50,9,11,51,86,61,22,88,89,11},{-94,-92,-88,-74,-52,-50,-48,-44,-40,-36,-32,-26,20,22,30,32,46,56,56,60,62,64,80,84,86,94,96,96},{1,0,0,1,1,0,0,1,0,1,0,1,1,0,0,0,0,0,0,1,0,0,0,0,0},{4,5,5,13,26,40,46,51,58,60,64,66,68,69,71,74,78,81,83,88,88,90,98,99},{92,6,-54,84,-10,32,50,40,-38,64,-64,-10,70,-68,-6,-16,68,34,-66,-82,84,98,50,82,78,4,34,-34,78,64,32,58,-94,40,50,0,-92,-36,10,-54,58,-78,-88,32,6},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{80,67,30,35,9}};
vector<int> param1 {13,11,1,20,20,15,12,23,24,2};
vector<int> param2 {11,18,1,20,15,17,17,28,17,3};
vector<int> param3 {18,21,1,15,15,22,14,28,22,2};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | return | [
"a) side",
"b) =",
"c) return",
"d) )",
"e) static"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( float ) ( 2 * ( 1 + sqrt ( 2 ) ) * side * side );
}
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( float ) ( 2 * ( 1 + sqrt ( 2 ) ) * side * side );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {5859.798616323926,-6381.210375893524,2442.246292006922,-9624.81536339737,8679.436805247444,-2682.3245401089525,7216.9161613024435,-5881.789859815442,2497.776395789202,-9598.912195459263};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i])) )/ (abs(f_filled(param0[i])) + 0.0000001)) < 0.001)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( double [MASK] ) { return ( float ) ( 2 * ( 1 + sqrt ( 2 ) ) * side * side ); }#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( float ) ( 2 * ( 1 + sqrt ( 2 ) ) * side * side );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {5859.798616323926,-6381.210375893524,2442.246292006922,-9624.81536339737,8679.436805247444,-2682.3245401089525,7216.9161613024435,-5881.789859815442,2497.776395789202,-9598.912195459263};
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) return",
"b) +",
"c) 1",
"d) side",
"e) true"
] | 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 low, int high ) {
if ( high < low ) return 0;
if ( high == low ) return low;
int mid = low + ( high - low ) / 2;
if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return ( mid + 1 );
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return mid;
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
turn ( mid + 1 );
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return mid;
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,16,38,39,48,74,79},{-46,72,72,-66,96,92,40,8,94,-84,6,-90,38,-6,48,-20,-86,-76,88,-50,-44,-14,54,-6,-2,72,8,-64,-46,44,-88,50,86,38,42,-56},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{48,74,59,57,95,11,25,61,46,54,34,84,7,97,62,57,99,93,76,5,76,93,35,84,37,60,65,16,30,73,42,61,74,77,48,62,84,93,64,57,68,46,28,77},{-72,-68,-66,-66,-62,-62,-52,-48,-42,-42,-42,-38,-30,-22,-20,-20,-16,-16,-14,0,2,2,2,4,12,20,22,26,32,34,46,46,64,64,64,66,68,68,68,74,80,84,84,88,88,90,96,98},{1},{7,11,20,21,22,27,30,30,34,35,36,37,38,60,61,63,63,69,70,75,80,84,88,97},{-2,70,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,71,27,10,97,43,55,71,6,6,77,48,77,2,83,51,61,19,2,51,26,70,20,23,54,15,6,92,35,75,8,57,50,49,88,21,36}};
vector<int> param1 {6,32,16,24,29,0,23,2,30,24};
vector<int> param2 {6,21,29,26,43,0,22,1,17,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high ) { if ( high < low ) return 0; if ( high == low ) return low; int mid = low + ( high - low ) / 2; if ( mid < high && arr [ mid + 1 ] < arr [ mid ] ) return ( mid + 1 ); if ( mid > low && arr [ [MASK] ] < arr [ mid - 1 ] ) return mid; if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 ); return f_gold ( arr, mid + 1, high ); }turn ( mid + 1 );
if ( mid > low && arr [ mid ] < arr [ mid - 1 ] ) return mid;
if ( arr [ high ] > arr [ mid ] ) return f_gold ( arr, low, mid - 1 );
return f_gold ( arr, mid + 1, high );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,16,38,39,48,74,79},{-46,72,72,-66,96,92,40,8,94,-84,6,-90,38,-6,48,-20,-86,-76,88,-50,-44,-14,54,-6,-2,72,8,-64,-46,44,-88,50,86,38,42,-56},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{48,74,59,57,95,11,25,61,46,54,34,84,7,97,62,57,99,93,76,5,76,93,35,84,37,60,65,16,30,73,42,61,74,77,48,62,84,93,64,57,68,46,28,77},{-72,-68,-66,-66,-62,-62,-52,-48,-42,-42,-42,-38,-30,-22,-20,-20,-16,-16,-14,0,2,2,2,4,12,20,22,26,32,34,46,46,64,64,64,66,68,68,68,74,80,84,84,88,88,90,96,98},{1},{7,11,20,21,22,27,30,30,34,35,36,37,38,60,61,63,63,69,70,75,80,84,88,97},{-2,70,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,71,27,10,97,43,55,71,6,6,77,48,77,2,83,51,61,19,2,51,26,70,20,23,54,15,6,92,35,75,8,57,50,49,88,21,36}};
vector<int> param1 {6,32,16,24,29,0,23,2,30,24};
vector<int> param2 {6,21,29,26,43,0,22,1,17,22};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | mid | [
"a) =",
"b) mid",
"c) {",
"d) rotation",
"e) {"
] | b |
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 p = 1;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( p < n ) p <<= 1;
return p;
}
p>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int p = 1;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( p < n ) p <<= 1;
return p;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {8,79,31,63,18,2,6,85,29,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; unsigned int f_gold ( unsigned int n ) { unsigned int p = 1; if ( n && ! ( n & ( n - 1 ) [MASK] ) return n; while ( p < n ) p <<= 1; return p; }p>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned int p = 1;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( p < n ) p <<= 1;
return p;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {8,79,31,63,18,2,6,85,29,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;
} | ) | [
"a) (",
"b) )",
"c) arr",
"d) 1",
"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 ( char str1 [ ], char str2 [ ], int m, int n ) {
if ( m == 0 ) return true;
if ( n == 0 ) return false;
if ( str1 [ m - 1 ] == str2 [ n - 1 ] ) return f_gold ( str1, str2, m - 1, n - 1 );
return f_gold ( str1, str2, m, n - 1 );
}
t n ) {
if ( m == 0 ) return true;
if ( n == 0 ) return false;
if ( str1 [ m - 1 ] == str2 [ n - 1 ] ) return f_gold ( str1, str2, m - 1, n - 1 );
return f_gold ( str1, str2, m, n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"AXY","AXY","1100","t","034","01111010110","SjOXhD","455","001","MkK"};
vector<string> param1 {"ADXCPY","YADXCP","001011001111","Isv","376083","10110110","PWkZDupqagB","4553","11100","qfjWaMdMYkqcK"};
vector<int> param2 {3,4,4,1,3,8,6,3,3,3};
vector<int> param3 {6,6,12,3,6,8,9,4,5,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( char str1 [ ], char str2 [ ], int m, int n ) { if ( m == 0 ) return true; if ( n == 0 ) return false; if ( str1 [ m - 1 ] [MASK] str2 [ n - 1 ] ) return f_gold ( str1, str2, m - 1, n - 1 ); return f_gold ( str1, str2, m, n - 1 ); }t n ) {
if ( m == 0 ) return true;
if ( n == 0 ) return false;
if ( str1 [ m - 1 ] == str2 [ n - 1 ] ) return f_gold ( str1, str2, m - 1, n - 1 );
return f_gold ( str1, str2, m, n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"AXY","AXY","1100","t","034","01111010110","SjOXhD","455","001","MkK"};
vector<string> param1 {"ADXCPY","YADXCP","001011001111","Isv","376083","10110110","PWkZDupqagB","4553","11100","qfjWaMdMYkqcK"};
vector<int> param2 {3,4,4,1,3,8,6,3,3,3};
vector<int> param3 {6,6,12,3,6,8,9,4,5,13};
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) i",
"c) ==",
"d) i",
"e) char"
] | 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 dist ) {
int count [ dist + 1 ];
count [ 0 ] = 1, count [ 1 ] = 1, count [ 2 ] = 2;
for ( int i = 3;
i <= dist;
i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ];
return count [ dist ];
}
t + 1 ];
count [ 0 ] = 1, count [ 1 ] = 1, count [ 2 ] = 2;
for ( int i = 3;
i <= dist;
i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ];
return count [ dist ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,82,87,80,92,58,98,53,11,58};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int dist ) { int count [ dist + 1 ]; count [ 0 [MASK] = 1, count [ 1 ] = 1, count [ 2 ] = 2; for ( int i = 3; i <= dist; i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ]; return count [ dist ]; }t + 1 ];
count [ 0 ] = 1, count [ 1 ] = 1, count [ 2 ] = 2;
for ( int i = 3;
i <= dist;
i ++ ) count [ i ] = count [ i - 1 ] + count [ i - 2 ] + count [ i - 3 ];
return count [ dist ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {37,82,87,80,92,58,98,53,11,58};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) ]",
"b) (",
"c) c",
"d) import",
"e) x:"
] | 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 sum = 0;
for ( int i = 1;
i <= n;
i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 );
return sum;
}
clude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {14,61,37,86,47,98,70,24,76,24};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold [MASK] int n ) { int sum = 0; for ( int i = 1; i <= n; i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 ); return sum; }clude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
int sum = 0;
for ( int i = 1;
i <= n;
i ++ ) sum = sum + ( 2 * i - 1 ) * ( 2 * i - 1 );
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {14,61,37,86,47,98,70,24,76,24};
for(int i = 0; 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) start",
"b) )",
"c) ]",
"d) (",
"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 n ) {
int count = 0;
if ( n % 2 == 0 ) {
count ++;
while ( n % 2 == 0 ) n = n / 2;
}
for ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
if ( n % i == 0 ) {
count ++;
while ( n % i == 0 ) n = n / i;
}
}
if ( n > 2 ) count ++;
return count;
}
n / 2;
}
for ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
if ( n % i == 0 ) {
count ++;
while ( n % i == 0 ) n = n / i;
}
}
if ( n > 2 ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,33,50,17,18,69,23,18,94,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 n ) { int count = 0; if ( n % [MASK] == 0 ) { count ++; while ( n % 2 == 0 ) n = n / 2; } for ( int i = 3; i <= sqrt ( n ); i = i + 2 ) { if ( n % i == 0 ) { count ++; while ( n % i == 0 ) n = n / i; } } if ( n > 2 ) count ++; return count; } n / 2;
}
for ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
if ( n % i == 0 ) {
count ++;
while ( n % i == 0 ) n = n / i;
}
}
if ( n > 2 ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {99,33,50,17,18,69,23,18,94,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;
} | 2 | [
"a) 2",
"b) f_gold",
"c) #include",
"d) =",
"e) ("
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
mespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {74,70,85,78,71,32,97,90,64,48};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; unsigned int f_gold ( unsigned int n ) { unsigned count = [MASK] if ( n && ! ( n & ( n - 1 ) ) ) return n; while ( n != 0 ) { n >>= 1; count += 1; } return 1 << count; }mespace std;
unsigned int f_gold ( unsigned int n ) {
unsigned count = 0;
if ( n && ! ( n & ( n - 1 ) ) ) return n;
while ( n != 0 ) {
n >>= 1;
count += 1;
}
return 1 << count;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {74,70,85,78,71,32,97,90,64,48};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 0; | [
"a) j",
"b) 0;",
"c) j",
"d) <bits/stdc++.h>",
"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 ( int arr [ ], int n ) {
for ( int i = 0;
i <= ( n - 2 ) / 2;
i ++ ) {
if ( arr [ 2 * i + 1 ] > arr [ i ] ) return false;
if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) return false;
}
return true;
}
or ( int i = 0;
i <= ( n - 2 ) / 2;
i ++ ) {
if ( arr [ 2 * i + 1 ] > arr [ i ] ) return false;
if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) return false;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,2,7,10,14,24,38,42,50,59,60,72,73,79,83,89},{-48,98,96,-56,-2,58,52,-50,58,50,62,86,-26,-98,34,20,-28,56,-36},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{91,50,37},{-80,-26,0,0,6,14,22,76,82,88,98},{1,0},{9,24,24,33,48,50,55,61,69,79,83},{30,32,-82,-48,88,-24,74,2,90,98,68,82,32,-60,2,-94,18,14,46,50,-60,-74,-76,66,-76,-34,-20,82,-44,-62,34,48,-56,2,64,-78,-64,98,-10,-28,78,-42},{0,0,1,1,1,1,1,1,1,1,1,1},{38,74,99,75,44,75,24,70,78,74,60,59,34,27,7,23,19,95,4,35,38,22,46,1,44,20,52,1,96,57,5,76,49,1,37,35}};
vector<int> param1 {9,9,20,2,10,1,8,27,6,31};
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 [MASK] std; bool f_gold ( int arr [ ], int n ) { for ( int i = 0; i <= ( n - 2 ) / 2; i ++ ) { if ( arr [ 2 * i + 1 ] > arr [ i ] ) return false; if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) return false; } return true; }or ( int i = 0;
i <= ( n - 2 ) / 2;
i ++ ) {
if ( arr [ 2 * i + 1 ] > arr [ i ] ) return false;
if ( 2 * i + 2 < n && arr [ 2 * i + 2 ] > arr [ i ] ) return false;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,2,2,7,10,14,24,38,42,50,59,60,72,73,79,83,89},{-48,98,96,-56,-2,58,52,-50,58,50,62,86,-26,-98,34,20,-28,56,-36},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{91,50,37},{-80,-26,0,0,6,14,22,76,82,88,98},{1,0},{9,24,24,33,48,50,55,61,69,79,83},{30,32,-82,-48,88,-24,74,2,90,98,68,82,32,-60,2,-94,18,14,46,50,-60,-74,-76,66,-76,-34,-20,82,-44,-62,34,48,-56,2,64,-78,-64,98,-10,-28,78,-42},{0,0,1,1,1,1,1,1,1,1,1,1},{38,74,99,75,44,75,24,70,78,74,60,59,34,27,7,23,19,95,4,35,38,22,46,1,44,20,52,1,96,57,5,76,49,1,37,35}};
vector<int> param1 {9,9,20,2,10,1,8,27,6,31};
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;
} | namespace | [
"a) [",
"b) hash",
"c) namespace",
"d) (x",
"e) 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 ) {
int min = arr [ 0 ], min_index;
for ( int i = 0;
i < n;
i ++ ) {
if ( min > arr [ i ] ) {
min = arr [ i ];
min_index = i;
}
}
return min_index;
}
arr [ ], int n ) {
int min = arr [ 0 ], min_index;
for ( int i = 0;
i < n;
i ++ ) {
if ( min > arr [ i ] ) {
min = arr [ i ];
min_index = i;
}
}
return min_index;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99},{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40,-32,-64,76,26,-2,12,82,16,-46,10,70,-62,-54,-6,58,32,98},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{90,26,71,74,69,47,76,96,42,31,22,17,84,20,8,98,49,87,38,53,28,77,29},{-64,-56,-10,-10,-6,-2,0,22,78,86,98},{0,1,1,1,1,0,1},{2,3,3,5,8,10,11,16,17,26,35,36,38,42,59,73,73,75,75,81,82,82,86,87,88,88,90,95,96,98,98,99},{-96,70,-32,-46,-26,42,-56,36,-72,96,-54,-12,78,30,58,92,56,22,70,10,42,70,0,-76,58,-70,-66,-32,-30,-22,56,10,18,-90,-40,-92,-70,-30,48,10,32,20,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{35,52,21,28,96,44,80,56,10,23,48,52,15,55,43,50,6,33,62,55,39,12,31,74,53,34,41,10,52,75,57,78,3}};
vector<int> param1 {27,38,11,18,9,5,29,42,28,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 [ ], [MASK] n ) { int min = arr [ 0 ], min_index; for ( int i = 0; i < n; i ++ ) { if ( min > arr [ i ] ) { min = arr [ i ]; min_index = i; } } return min_index; }arr [ ], int n ) {
int min = arr [ 0 ], min_index;
for ( int i = 0;
i < n;
i ++ ) {
if ( min > arr [ i ] ) {
min = arr [ i ];
min_index = i;
}
}
return min_index;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,4,4,9,10,13,14,15,28,28,41,46,47,48,52,55,62,67,69,73,74,79,79,80,87,90,96,99},{44,62,-40,62,98,30,16,76,-4,-2,78,-96,78,-72,94,-66,-38,-80,40,78,-26,28,-40,-32,-64,76,26,-2,12,82,16,-46,10,70,-62,-54,-6,58,32,98},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{90,26,71,74,69,47,76,96,42,31,22,17,84,20,8,98,49,87,38,53,28,77,29},{-64,-56,-10,-10,-6,-2,0,22,78,86,98},{0,1,1,1,1,0,1},{2,3,3,5,8,10,11,16,17,26,35,36,38,42,59,73,73,75,75,81,82,82,86,87,88,88,90,95,96,98,98,99},{-96,70,-32,-46,-26,42,-56,36,-72,96,-54,-12,78,30,58,92,56,22,70,10,42,70,0,-76,58,-70,-66,-32,-30,-22,56,10,18,-90,-40,-92,-70,-30,48,10,32,20,-52},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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},{35,52,21,28,96,44,80,56,10,23,48,52,15,55,43,50,6,33,62,55,39,12,31,74,53,34,41,10,52,75,57,78,3}};
vector<int> param1 {27,38,11,18,9,5,29,42,28,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;
} | int | [
"a) low",
"b) )",
"c) 1",
"d) i",
"e) int"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string number, int divisor ) {
string ans;
int idx = 0;
int temp = number [ idx ] - '0';
while ( temp < divisor ) temp = temp * 10 + ( number [ ++ idx ] - '0' );
while ( number . size ( ) > idx ) {
ans += ( temp / divisor ) + '0';
temp = ( temp % divisor ) * 10 + number [ ++ idx ] - '0';
}
if ( ans . length ( ) == 0 ) return "0";
return ans;
}
hile ( number . size ( ) > idx ) {
ans += ( temp / divisor ) + '0';
temp = ( temp % divisor ) * 10 + number [ ++ idx ] - '0';
}
if ( ans . length ( ) == 0 ) return "0";
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"xcI","92733233370448","01","ENxfvIzh","00478135","11","O","813","011011","aot"};
vector<int> param1 {96,71,12,62,85,92,24,31,78,17};
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 number, int divisor ) { string ans; int idx = 0; int temp = number [ idx ] - [MASK] while ( temp < divisor ) temp = temp * 10 + ( number [ ++ idx ] - '0' ); while ( number . size ( ) > idx ) { ans += ( temp / divisor ) + '0'; temp = ( temp % divisor ) * 10 + number [ ++ idx ] - '0'; } if ( ans . length ( ) == 0 ) return "0"; return ans; }hile ( number . size ( ) > idx ) {
ans += ( temp / divisor ) + '0';
temp = ( temp % divisor ) * 10 + number [ ++ idx ] - '0';
}
if ( ans . length ( ) == 0 ) return "0";
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"xcI","92733233370448","01","ENxfvIzh","00478135","11","O","813","011011","aot"};
vector<int> param1 {96,71,12,62,85,92,24,31,78,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | '0'; | [
"a) return",
"b) '0';",
"c) (sizeof",
"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 stack1 [ ], int stack2 [ ], int stack3 [ ], int n1, int n2, int n3 ) {
int sum1 = 0, sum2 = 0, sum3 = 0;
for ( int i = 0;
i < n1;
i ++ ) sum1 += stack1 [ i ];
for ( int i = 0;
i < n2;
i ++ ) sum2 += stack2 [ i ];
for ( int i = 0;
i < n3;
i ++ ) sum3 += stack3 [ i ];
int top1 = 0, top2 = 0, top3 = 0;
int ans = 0;
while ( 1 ) {
if ( top1 == n1 || top2 == n2 || top3 == n3 ) return 0;
if ( sum1 == sum2 && sum2 == sum3 ) return sum1;
if ( sum1 >= sum2 && sum1 >= sum3 ) sum1 -= stack1 [ top1 ++ ];
else if ( sum2 >= sum3 && sum2 >= sum3 ) sum2 -= stack2 [ top2 ++ ];
else if ( sum3 >= sum2 && sum3 >= sum1 ) sum3 -= stack3 [ top3 ++ ];
}
}
& sum1 >= sum3 ) sum1 -= stack1 [ top1 ++ ];
else if ( sum2 >= sum3 && sum2 >= sum3 ) sum2 -= stack2 [ top2 ++ ];
else if ( sum3 >= sum2 && sum3 >= sum1 ) sum3 -= stack3 [ top3 ++ ];
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,10,11,24,27,33,34,36,36,40,42,43,52,58,67,69,77,86,86,88},{40,54,14,58,-64,-60,-98,-64,-52,30,0,-42,74,46,-14,76,84,74,-24,30,96,88,-98,82,44,-86,-92,-52,28,62},{0,0},{64,40,45,93,30,79,24,95,1,84,74,5,9,6,22,33,10,53,33,9,31,21,22,77,21,93,86,68,92,57,27,82,87,11,51,2,27,2,24,57,20,2,32,43},{-94,-50,-24,-12,-6,-6,8,26,28,44},{1,1,0,0,0,0,1,0,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,1},{3,3,4,5,9,18,21,22,25,27,28,33,35,39,39,43,57,58,59,63,65,65,72,77,78,78,80,80,88,92,99},{40,28,-84,-38,82,2,38,10,-10,20,-54,48,56,38,-98,68,-8,-30,-96,-16,28,94,-52,28,34,68,-46,44,-28,-52,-48,-14,-30,24,56,8,-30,-46,18,-68,86,-12},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{22,31,75,48,30,39,82,93,26,87,77,87,67,88,19,51,54,48,6,37,38,27}};
vector<vector<int>> param1 {{4,13,34,40,41,47,47,52,55,62,66,66,69,70,73,74,75,76,85,98},{24,34,-52,50,-8,-48,-28,68,-12,-26,0,6,-76,-94,-12,8,38,-88,30,98,-78,-54,-48,42,26,-76,4,46,26,60},{1,1},{48,85,55,12,24,26,88,76,15,34,23,61,2,99,11,37,65,74,92,96,68,50,67,98,89,17,62,18,51,61,41,41,90,64,89,51,48,95,9,86,28,54,64,35},{-96,-94,-86,-70,-52,-18,-6,20,52,52},{1,0,0,0,0,0,1,0,0,0,1,1,0,1,0,0,1,0,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,0,1,0,1,0,1,1},{3,17,18,23,24,24,26,28,34,48,53,54,56,61,64,67,69,74,77,79,79,81,81,82,84,84,85,86,88,92,96},{26,24,-50,18,78,-90,62,88,-36,-96,78,6,-94,-2,-28,-38,66,72,-36,14,-48,-64,-24,82,92,-16,-26,-12,6,34,30,-46,48,-22,34,-64,4,-32,84,-20,32,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{18,20,53,87,85,63,6,81,89,82,43,76,59,60,79,96,29,65,5,56,96,95}};
vector<vector<int>> param2 {{6,8,10,12,14,29,41,52,53,54,55,66,69,73,77,77,78,80,90,99},{-8,-24,54,28,92,94,0,62,28,80,82,2,88,-4,-28,80,44,34,-98,36,28,76,-48,40,98,4,22,-36,-20,-70},{0,0},{99,77,11,20,33,91,5,68,75,67,37,70,59,26,2,62,6,97,95,38,46,89,29,61,27,93,26,74,98,85,91,92,40,97,58,44,20,57,65,62,65,26,74,58},{-70,-40,-22,4,12,12,38,54,72,74},{0,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,1,0,0,1,1,1,0,0,1,1,1,0,0,1,0},{1,3,5,8,15,16,27,27,27,28,29,30,32,35,36,37,44,47,57,65,69,70,70,76,76,83,85,87,88,90,92},{66,26,-90,-40,-52,-98,84,88,40,-92,30,28,32,92,18,-34,-42,64,-34,70,-72,28,44,34,76,-78,46,-48,20,54,-2,66,6,56,52,-98,-48,-70,-60,94,90,10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,76,49,36,41,18,60,44,81,34,56,7,13,83,82,16,7,38,33,55,91,54}};
vector<int> param3 {10,26,1,42,5,39,24,32,16,19};
vector<int> param4 {12,28,1,27,5,34,16,37,23,16};
vector<int> param5 {18,15,1,31,5,26,29,41,22,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int stack1 [ ], int stack2 [ ], int stack3 [MASK] ], int n1, int n2, int n3 ) { int sum1 = 0, sum2 = 0, sum3 = 0; for ( int i = 0; i < n1; i ++ ) sum1 += stack1 [ i ]; for ( int i = 0; i < n2; i ++ ) sum2 += stack2 [ i ]; for ( int i = 0; i < n3; i ++ ) sum3 += stack3 [ i ]; int top1 = 0, top2 = 0, top3 = 0; int ans = 0; while ( 1 ) { if ( top1 == n1 || top2 == n2 || top3 == n3 ) return 0; if ( sum1 == sum2 && sum2 == sum3 ) return sum1; if ( sum1 >= sum2 && sum1 >= sum3 ) sum1 -= stack1 [ top1 ++ ]; else if ( sum2 >= sum3 && sum2 >= sum3 ) sum2 -= stack2 [ top2 ++ ]; else if ( sum3 >= sum2 && sum3 >= sum1 ) sum3 -= stack3 [ top3 ++ ]; } }& sum1 >= sum3 ) sum1 -= stack1 [ top1 ++ ];
else if ( sum2 >= sum3 && sum2 >= sum3 ) sum2 -= stack2 [ top2 ++ ];
else if ( sum3 >= sum2 && sum3 >= sum1 ) sum3 -= stack3 [ top3 ++ ];
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,10,11,24,27,33,34,36,36,40,42,43,52,58,67,69,77,86,86,88},{40,54,14,58,-64,-60,-98,-64,-52,30,0,-42,74,46,-14,76,84,74,-24,30,96,88,-98,82,44,-86,-92,-52,28,62},{0,0},{64,40,45,93,30,79,24,95,1,84,74,5,9,6,22,33,10,53,33,9,31,21,22,77,21,93,86,68,92,57,27,82,87,11,51,2,27,2,24,57,20,2,32,43},{-94,-50,-24,-12,-6,-6,8,26,28,44},{1,1,0,0,0,0,1,0,0,0,1,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,1,1,1,1,0,1,1,0,1,0,1,1,1,0,1},{3,3,4,5,9,18,21,22,25,27,28,33,35,39,39,43,57,58,59,63,65,65,72,77,78,78,80,80,88,92,99},{40,28,-84,-38,82,2,38,10,-10,20,-54,48,56,38,-98,68,-8,-30,-96,-16,28,94,-52,28,34,68,-46,44,-28,-52,-48,-14,-30,24,56,8,-30,-46,18,-68,86,-12},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{22,31,75,48,30,39,82,93,26,87,77,87,67,88,19,51,54,48,6,37,38,27}};
vector<vector<int>> param1 {{4,13,34,40,41,47,47,52,55,62,66,66,69,70,73,74,75,76,85,98},{24,34,-52,50,-8,-48,-28,68,-12,-26,0,6,-76,-94,-12,8,38,-88,30,98,-78,-54,-48,42,26,-76,4,46,26,60},{1,1},{48,85,55,12,24,26,88,76,15,34,23,61,2,99,11,37,65,74,92,96,68,50,67,98,89,17,62,18,51,61,41,41,90,64,89,51,48,95,9,86,28,54,64,35},{-96,-94,-86,-70,-52,-18,-6,20,52,52},{1,0,0,0,0,0,1,0,0,0,1,1,0,1,0,0,1,0,1,0,0,0,0,1,0,1,1,0,0,0,0,1,1,0,0,1,0,1,0,1,1},{3,17,18,23,24,24,26,28,34,48,53,54,56,61,64,67,69,74,77,79,79,81,81,82,84,84,85,86,88,92,96},{26,24,-50,18,78,-90,62,88,-36,-96,78,6,-94,-2,-28,-38,66,72,-36,14,-48,-64,-24,82,92,-16,-26,-12,6,34,30,-46,48,-22,34,-64,4,-32,84,-20,32,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{18,20,53,87,85,63,6,81,89,82,43,76,59,60,79,96,29,65,5,56,96,95}};
vector<vector<int>> param2 {{6,8,10,12,14,29,41,52,53,54,55,66,69,73,77,77,78,80,90,99},{-8,-24,54,28,92,94,0,62,28,80,82,2,88,-4,-28,80,44,34,-98,36,28,76,-48,40,98,4,22,-36,-20,-70},{0,0},{99,77,11,20,33,91,5,68,75,67,37,70,59,26,2,62,6,97,95,38,46,89,29,61,27,93,26,74,98,85,91,92,40,97,58,44,20,57,65,62,65,26,74,58},{-70,-40,-22,4,12,12,38,54,72,74},{0,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,0,1,1,0,0,0,0,0,0,0,1,0,0,1,1,1,0,0,1,1,1,0,0,1,0},{1,3,5,8,15,16,27,27,27,28,29,30,32,35,36,37,44,47,57,65,69,70,70,76,76,83,85,87,88,90,92},{66,26,-90,-40,-52,-98,84,88,40,-92,30,28,32,92,18,-34,-42,64,-34,70,-72,28,44,34,76,-78,46,-48,20,54,-2,66,6,56,52,-98,-48,-70,-60,94,90,10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{10,76,49,36,41,18,60,44,81,34,56,7,13,83,82,16,7,38,33,55,91,54}};
vector<int> param3 {10,26,1,42,5,39,24,32,16,19};
vector<int> param4 {12,28,1,27,5,34,16,37,23,16};
vector<int> param5 {18,15,1,31,5,26,29,41,22,17};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),¶m2[i].front(),param3[i],param4[i],param5[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) [",
"b) ]",
"c) )",
"d) <string>",
"e) ("
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int m, int k ) {
if ( m <= n - k + 1 ) return m + k - 1;
m = m - ( n - k + 1 );
return ( m % n == 0 ) ? n : ( m % n );
}
ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int m, int k ) {
if ( m <= n - k + 1 ) return m + k - 1;
m = m - ( n - k + 1 );
return ( m % n == 0 ) ? n : ( m % n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {19,23,92,9,20,68,66,77,90,26};
vector<int> param1 {14,51,10,50,67,25,30,22,1,34};
vector<int> param2 {34,5,24,34,20,40,24,32,71,54};
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 n, int m, int k ) { if ( m <= n - k + 1 ) return m + k - 1; m = m - ( n - k + 1 ); return ( m % n == 0 ) ? n : ( m [MASK] n ); }ip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int m, int k ) {
if ( m <= n - k + 1 ) return m + k - 1;
m = m - ( n - k + 1 );
return ( m % n == 0 ) ? n : ( m % n );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {19,23,92,9,20,68,66,77,90,26};
vector<int> param1 {14,51,10,50,67,25,30,22,1,34};
vector<int> param2 {34,5,24,34,20,40,24,32,71,54};
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;
} | % | [
"a) <vector>",
"b) %",
"c) (x",
"d) i",
"e) #include"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int ones = 0, twos = 0;
int common_bit_mask;
for ( int i = 0;
i < n;
i ++ ) {
twos = twos | ( ones & arr [ i ] );
ones = ones ^ arr [ i ];
common_bit_mask = ~ ( ones & twos );
ones &= common_bit_mask;
twos &= common_bit_mask;
}
return ones;
}
++ ) {
twos = twos | ( ones & arr [ i ] );
ones = ones ^ arr [ i ];
common_bit_mask = ~ ( ones & twos );
ones &= common_bit_mask;
twos &= common_bit_mask;
}
return ones;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,26,26,48,59,62,66,70,72,75,76,81,97,98},{-42,-48,-64,-74,56,-34,20,16,34,-84,86,38,56,-86,30,-74,-96,96,12,10,-46,10,-36,38,34,-46,-20,14,12,62,-54,20,-82,24,96},{0,0,1,1},{68,91,61,6,32,47,76,69,44,71,29,79,74,33,44,33,45,75,43,82,83,81,95,16,86,33,69,61,73,21,54,17,98,62,14,72,80,31,56,82,14,48,76},{-98,-96,-92,-62,-52,-42,-42,-26,4,10,14,38,64,66,72,74,82},{0,1,1,1,0,0,0,1,0,1},{53,63,63},{-96,-38,-26,-46,68,-36,20,-18,-10,52,40,94,-8,-64,82,-22},{0,0,0,0,0,1,1},{99,46,48,81,27,97,26,50,77,32,45,99,46}};
vector<int> param1 {7,27,3,38,14,5,2,15,3,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ [MASK] int n ) { int ones = 0, twos = 0; int common_bit_mask; for ( int i = 0; i < n; i ++ ) { twos = twos | ( ones & arr [ i ] ); ones = ones ^ arr [ i ]; common_bit_mask = ~ ( ones & twos ); ones &= common_bit_mask; twos &= common_bit_mask; } return ones; } ++ ) {
twos = twos | ( ones & arr [ i ] );
ones = ones ^ arr [ i ];
common_bit_mask = ~ ( ones & twos );
ones &= common_bit_mask;
twos &= common_bit_mask;
}
return ones;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,26,26,48,59,62,66,70,72,75,76,81,97,98},{-42,-48,-64,-74,56,-34,20,16,34,-84,86,38,56,-86,30,-74,-96,96,12,10,-46,10,-36,38,34,-46,-20,14,12,62,-54,20,-82,24,96},{0,0,1,1},{68,91,61,6,32,47,76,69,44,71,29,79,74,33,44,33,45,75,43,82,83,81,95,16,86,33,69,61,73,21,54,17,98,62,14,72,80,31,56,82,14,48,76},{-98,-96,-92,-62,-52,-42,-42,-26,4,10,14,38,64,66,72,74,82},{0,1,1,1,0,0,0,1,0,1},{53,63,63},{-96,-38,-26,-46,68,-36,20,-18,-10,52,40,94,-8,-64,82,-22},{0,0,0,0,0,1,1},{99,46,48,81,27,97,26,50,77,32,45,99,46}};
vector<int> param1 {7,27,3,38,14,5,2,15,3,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ], | [
"a) :",
"b) true",
"c) ],",
"d) return",
"e) )"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b ) {
long long result = 0, rem = 0;
if ( a < b ) swap ( a, b );
while ( b > 0 ) {
result += a / b;
long long rem = a % b;
a = b;
b = rem;
}
return result;
}
( int a, int b ) {
long long result = 0, rem = 0;
if ( a < b ) swap ( a, b );
while ( b > 0 ) {
result += a / b;
long long rem = a % b;
a = b;
b = rem;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {87,18,68,80,87,64,64,65,43,97};
vector<int> param1 {60,35,93,20,69,29,1,95,72,41};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a, int b [MASK] { long long result = 0, rem = 0; if ( a < b ) swap ( a, b ); while ( b > 0 ) { result += a / b; long long rem = a % b; a = b; b = rem; } return result; }( int a, int b ) {
long long result = 0, rem = 0;
if ( a < b ) swap ( a, b );
while ( b > 0 ) {
result += a / b;
long long rem = a % b;
a = b;
b = rem;
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {87,18,68,80,87,64,64,65,43,97};
vector<int> param1 {60,35,93,20,69,29,1,95,72,41};
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) <iostream>",
"b) 2",
"c) 1",
"d) 10",
"e) )"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int a = 0, int b = 1 ) {
if ( n == 0 ) return a;
if ( n == 1 ) return b;
return f_gold ( n - 1, b, a + b );
}
lude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int a = 0, int b = 1 ) {
if ( n == 0 ) return a;
if ( n == 1 ) return b;
return f_gold ( n - 1, b, a + b );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,60,92,73,58,82,53,57,47,83};
vector<int> param1 {43,48,21,79,38,26,10,37,91,3};
vector<int> param2 {24,98,69,38,30,12,17,26,99,64};
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 [MASK] using namespace std; int f_gold ( int n, int a = 0, int b = 1 ) { if ( n == 0 ) return a; if ( n == 1 ) return b; return f_gold ( n - 1, b, a + b ); }lude <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int a = 0, int b = 1 ) {
if ( n == 0 ) return a;
if ( n == 1 ) return b;
return f_gold ( n - 1, b, a + b );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {4,60,92,73,58,82,53,57,47,83};
vector<int> param1 {43,48,21,79,38,26,10,37,91,3};
vector<int> param2 {24,98,69,38,30,12,17,26,99,64};
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;
} | <bits/stdc++.h> | [
"a) \"a\";",
"b) ]",
"c) [",
"d) <bits/stdc++.h>",
"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 ) {
stack < int > integerstack;
stack < char > stringstack;
string temp = "", result = "";
for ( int i = 0;
i < str . length ( );
i ++ ) {
int count = 0;
if ( str [ i ] >= '0' && str [ i ] <= '9' ) {
while ( str [ i ] >= '0' && str [ i ] <= '9' ) {
count = count * 10 + str [ i ] - '0';
i ++;
}
i --;
integerstack . push ( count );
}
else if ( str [ i ] == ']' ) {
temp = "";
count = 0;
if ( ! integerstack . empty ( ) ) {
count = integerstack . top ( );
integerstack . pop ( );
}
while ( ! stringstack . empty ( ) && stringstack . top ( ) != '[' ) {
temp = stringstack . top ( ) + temp;
stringstack . pop ( );
}
if ( ! stringstack . empty ( ) && stringstack . top ( ) == '[' ) stringstack . pop ( );
for ( int j = 0;
j < count;
j ++ ) result = result + temp;
for ( int j = 0;
j < result . length ( );
j ++ ) stringstack . push ( result [ j ] );
result = "";
}
else if ( str [ i ] == '[' ) {
if ( str [ i - 1 ] >= '0' && str [ i - 1 ] <= '9' ) stringstack . push ( str [ i ] );
else {
stringstack . push ( str [ i ] );
integerstack . push ( 1 );
}
}
else stringstack . push ( str [ i ] );
}
while ( ! stringstack . empty ( ) ) {
result = stringstack . top ( ) + result;
stringstack . pop ( );
}
return result;
}
}
}
else stringstack . push ( str [ i ] );
}
while ( ! stringstack . empty ( ) ) {
result = stringstack . top ( ) + result;
stringstack . pop ( );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"rpaBQkHqRaTb","9916267","000010100010","XfHXbWwaRd","750","0","K","0218044","10100010011","zR"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; string f_gold ( string str ) { stack < int > integerstack; stack < char > stringstack; string temp = "", result = ""; for ( int i = 0; i < str . length ( ); i ++ ) { int count = 0; if ( str [ i ] >= '0' && str [ i ] <= '9' ) { while ( str [ i ] >= '0' && str [ i ] <= '9' ) { count = count * 10 + str [ i ] - '0'; i ++; } i --; integerstack . push ( count ); } else if ( str [ i ] == ']' ) { temp = ""; count = 0; if ( ! integerstack . empty ( ) ) { count = integerstack . top ( ); integerstack . pop ( ); } while ( ! stringstack . empty ( ) && stringstack . top ( ) != '[' ) { temp = stringstack . top ( ) + temp; stringstack . pop ( ); } if ( ! stringstack . empty ( ) && stringstack . top ( ) == '[' ) stringstack . pop ( ); for ( int j = 0; j < count; j ++ ) result = result + temp; for ( int j = 0; j < result . length ( ); j ++ [MASK] stringstack . push ( result [ j ] ); result = ""; } else if ( str [ i ] == '[' ) { if ( str [ i - 1 ] >= '0' && str [ i - 1 ] <= '9' ) stringstack . push ( str [ i ] ); else { stringstack . push ( str [ i ] ); integerstack . push ( 1 ); } } else stringstack . push ( str [ i ] ); } while ( ! stringstack . empty ( ) ) { result = stringstack . top ( ) + result; stringstack . pop ( ); } return result; }
}
}
else stringstack . push ( str [ i ] );
}
while ( ! stringstack . empty ( ) ) {
result = stringstack . top ( ) + result;
stringstack . pop ( );
}
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"rpaBQkHqRaTb","9916267","000010100010","XfHXbWwaRd","750","0","K","0218044","10100010011","zR"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) !=",
"b) ]",
"c) )",
"d) =",
"e) range"
] | 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 ) {
queue < int > q;
q . push ( 1 );
int cnt = 0;
int t;
while ( ! q . empty ( ) ) {
t = q . front ( );
q . pop ( );
if ( t <= N ) {
cnt ++;
q . push ( t * 10 );
q . push ( t * 10 + 1 );
}
}
return cnt;
}
int t;
while ( ! q . empty ( ) ) {
t = q . front ( );
q . pop ( );
if ( t <= N ) {
cnt ++;
q . push ( t * 10 );
q . push ( t * 10 + 1 );
}
}
return cnt;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,150932532,71,44,36,88,69,53,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int N ) { queue < int > q; q . push ( 1 ); [MASK] cnt = 0; int t; while ( ! q . empty ( ) ) { t = q . front ( ); q . pop ( ); if ( t <= N ) { cnt ++; q . push ( t * 10 ); q . push ( t * 10 + 1 ); } } return cnt; } int t;
while ( ! q . empty ( ) ) {
t = q . front ( );
q . pop ( );
if ( t <= N ) {
cnt ++;
q . push ( t * 10 );
q . push ( t * 10 + 1 );
}
}
return cnt;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {1,3,150932532,71,44,36,88,69,53,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | int | [
"a) int",
"b) )",
"c) std;",
"d) <string>",
"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 ) {
sort ( arr, arr + n );
int count = 0, max_count = 0, min_count = n;
for ( int i = 0;
i < ( n - 1 );
i ++ ) {
if ( arr [ i ] == arr [ i + 1 ] ) {
count += 1;
continue;
}
else {
max_count = max ( max_count, count );
min_count = min ( min_count, count );
count = 0;
}
}
return ( max_count - min_count );
}
ount += 1;
continue;
}
else {
max_count = max ( max_count, count );
min_count = min ( min_count, count );
count = 0;
}
}
return ( max_count - min_count );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,15,19,22,28,29,39,46,46,49,51,55,62,69,72,72,72,74,79,92,92,93,95,96},{-26,-54,92,76,-92,-14,-24,-70,-78,-50,-48,-22,12,2,-34,-60,4,-32,-10,52,-92,-74,18,34,6,-66,42,-10,-6,56,92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{59,35,13,79,61,97,92,48,98,38,65,54,31,49,81,22,96,29,65,48,92,66,25,21,26,1,32,73,46,5,40,17,53,93,83,29},{-70,-34,-32,-30,-14,80,86,90},{0,1,0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0},{9},{94,10,70,42},{0,0,0,0,0,0,0,0,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,76,49,55,92,15,4,8,95,60,90,3,7,79,84,17,96,10,80,26,22,15}};
vector<int> param1 {15,30,24,29,4,23,0,2,24,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { sort ( arr, arr + n ); int count = 0, max_count = 0, min_count = n; for ( int i = 0; i < ( n - 1 ); i ++ ) { if ( arr [ i ] == arr [ i + 1 ] ) { count += 1; continue; } else { max_count = max ( max_count, count ); min_count [MASK] min ( min_count, count ); count = 0; } } return ( max_count - min_count ); }ount += 1;
continue;
}
else {
max_count = max ( max_count, count );
min_count = min ( min_count, count );
count = 0;
}
}
return ( max_count - min_count );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,15,19,22,28,29,39,46,46,49,51,55,62,69,72,72,72,74,79,92,92,93,95,96},{-26,-54,92,76,-92,-14,-24,-70,-78,-50,-48,-22,12,2,-34,-60,4,-32,-10,52,-92,-74,18,34,6,-66,42,-10,-6,56,92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{59,35,13,79,61,97,92,48,98,38,65,54,31,49,81,22,96,29,65,48,92,66,25,21,26,1,32,73,46,5,40,17,53,93,83,29},{-70,-34,-32,-30,-14,80,86,90},{0,1,0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0},{9},{94,10,70,42},{0,0,0,0,0,0,0,0,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,76,49,55,92,15,4,8,95,60,90,3,7,79,84,17,96,10,80,26,22,15}};
vector<int> param1 {15,30,24,29,4,23,0,2,24,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | = | [
"a) *",
"b) +",
"c) =",
"d) a",
"e) j"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string str ) {
int one_count = 0, zero_count = 0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) if ( str [ i ] == '1' ) one_count ++;
else zero_count ++;
if ( one_count % 2 == 0 ) return zero_count;
return one_count;
}
0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) if ( str [ i ] == '1' ) one_count ++;
else zero_count ++;
if ( one_count % 2 == 0 ) return zero_count;
return one_count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"KfcTJNP","05312505872","100111","tDEEhKxrQ","50824233019","10001110010","T SEZaNm MYQ","838415739","01110100","WYQiAey H"};
for(int i = 0; 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 one_count = 0, zero_count = 0; int n = str . length ( ); for ( int i = 0; i < n; i ++ ) if ( str [ i ] == '1' ) one_count ++; else zero_count ++; if ( one_count % 2 == 0 ) return zero_count; [MASK] one_count; }0;
int n = str . length ( );
for ( int i = 0;
i < n;
i ++ ) if ( str [ i ] == '1' ) one_count ++;
else zero_count ++;
if ( one_count % 2 == 0 ) return zero_count;
return one_count;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"KfcTJNP","05312505872","100111","tDEEhKxrQ","50824233019","10001110010","T SEZaNm MYQ","838415739","01110100","WYQiAey H"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | return | [
"a) return",
"b) =",
"c) 0;",
"d) =",
"e) :"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long f_gold ( long long a, long long b, long long mod ) {
long long res = 0;
a %= mod;
while ( b ) {
if ( b & 1 ) res = ( res + a ) % mod;
a = ( 2 * a ) % mod;
b >>= 1;
}
return res;
}
d ( long long a, long long b, long long mod ) {
long long res = 0;
a %= mod;
while ( b ) {
if ( b & 1 ) res = ( res + a ) % mod;
a = ( 2 * a ) % mod;
b >>= 1;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {60,46,4,67,93,89,8,53,96,38};
vector<long> param1 {24,43,50,1,35,97,78,73,92,64};
vector<long> param2 {58,29,71,66,73,8,55,22,83,83};
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; long long f_gold ( long long a, long long b, long long mod ) { long long res = 0; a %= mod; while ( b ) { if ( b & 1 ) res = ( res + a ) % mod; a = ( 2 * a ) [MASK] mod; b >>= 1; } return res; }d ( long long a, long long b, long long mod ) {
long long res = 0;
a %= mod;
while ( b ) {
if ( b & 1 ) res = ( res + a ) % mod;
a = ( 2 * a ) % mod;
b >>= 1;
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {60,46,4,67,93,89,8,53,96,38};
vector<long> param1 {24,43,50,1,35,97,78,73,92,64};
vector<long> param2 {58,29,71,66,73,8,55,22,83,83};
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;
} | % | [
"a) return",
"b) %",
"c) class",
"d) )",
"e) i"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int m, int n, int x ) {
int table [ n + 1 ] [ x + 1 ];
memset ( table, 0, sizeof ( table ) );
for ( int j = 1;
j <= m && j <= x;
j ++ ) table [ 1 ] [ j ] = 1;
for ( int i = 2;
i <= n;
i ++ ) for ( int j = 1;
j <= x;
j ++ ) for ( int k = 1;
k <= m && k < j;
k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ];
return table [ n ] [ x ];
}
for ( int i = 2;
i <= n;
i ++ ) for ( int j = 1;
j <= x;
j ++ ) for ( int k = 1;
k <= m && k < j;
k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ];
return table [ n ] [ x ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,7,20,90,50,32,46,82,43,6};
vector<int> param1 {4,12,44,94,58,90,25,50,82,83};
vector<int> param2 {69,33,24,88,27,29,6,87,70,19};
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 m, int n, int x ) { int table [ n + 1 ] [ x + 1 ]; memset ( table, 0, sizeof ( table ) ); for ( int j = 1; j <= m && j <= x; j ++ ) table [ 1 ] [ j ] [MASK] 1; for ( int i = 2; i <= n; i ++ ) for ( int j = 1; j <= x; j ++ ) for ( int k = 1; k <= m && k < j; k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ]; return table [ n ] [ x ]; } for ( int i = 2;
i <= n;
i ++ ) for ( int j = 1;
j <= x;
j ++ ) for ( int k = 1;
k <= m && k < j;
k ++ ) table [ i ] [ j ] += table [ i - 1 ] [ j - k ];
return table [ n ] [ x ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,7,20,90,50,32,46,82,43,6};
vector<int> param1 {4,12,44,94,58,90,25,50,82,83};
vector<int> param2 {69,33,24,88,27,29,6,87,70,19};
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;
} | = | [
"a) i",
"b) #include",
"c) =",
"d) res",
"e) return"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > vis;
for ( int i = 0;
i < n;
++ i ) vis [ arr [ i ] ] = 1;
int k = vis . size ( );
vis . clear ( );
int ans = 0, right = 0, window = 0;
for ( int left = 0;
left < n;
++ left ) {
while ( right < n && window < k ) {
++ vis [ arr [ right ] ];
if ( vis [ arr [ right ] ] == 1 ) ++ window;
++ right;
}
if ( window == k ) ans += ( n - right + 1 );
-- vis [ arr [ left ] ];
if ( vis [ arr [ left ] ] == 0 ) -- window;
}
return ans;
}
right ] ] == 1 ) ++ window;
++ right;
}
if ( window == k ) ans += ( n - right + 1 );
-- vis [ arr [ left ] ];
if ( vis [ arr [ left ] ] == 0 ) -- window;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,39,49,52,53,69,72,79,83,96},{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{35,23,41,58,66,92,3,33,78,70,80,86,21,21,74,19},{-98,-80,-52,-10,4,76},{1,0,0,0,1,0,0,0,1,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,1,0,1,1,1,1},{2,7,10,17,26,36,37,85,87,88},{64,-2,-94,-84,-48,86},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{91,49,94,81,64,5,13,70,82,9,80,82}};
vector<int> param1 {5,20,26,12,3,36,8,5,20,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int [MASK] ) { unordered_map < int, int > vis; for ( int i = 0; i < n; ++ i ) vis [ arr [ i ] ] = 1; int k = vis . size ( ); vis . clear ( ); int ans = 0, right = 0, window = 0; for ( int left = 0; left < n; ++ left ) { while ( right < n && window < k ) { ++ vis [ arr [ right ] ]; if ( vis [ arr [ right ] ] == 1 ) ++ window; ++ right; } if ( window == k ) ans += ( n - right + 1 ); -- vis [ arr [ left ] ]; if ( vis [ arr [ left ] ] == 0 ) -- window; } return ans; } right ] ] == 1 ) ++ window;
++ right;
}
if ( window == k ) ans += ( n - right + 1 );
-- vis [ arr [ left ] ];
if ( vis [ arr [ left ] ] == 0 ) -- window;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{13,39,49,52,53,69,72,79,83,96},{-98,-98,22,-10,-28,0,56,72,36,88,96,22,90,74,-60,-64,0,2,-42,0,94,-82,-74},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{35,23,41,58,66,92,3,33,78,70,80,86,21,21,74,19},{-98,-80,-52,-10,4,76},{1,0,0,0,1,0,0,0,1,1,0,0,0,1,0,1,0,1,0,0,1,1,1,0,0,1,0,1,0,1,1,1,0,0,0,1,1,0,1,1,1,1},{2,7,10,17,26,36,37,85,87,88},{64,-2,-94,-84,-48,86},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{91,49,94,81,64,5,13,70,82,9,80,82}};
vector<int> param1 {5,20,26,12,3,36,8,5,20,9};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | n | [
"a) c1",
"b) for",
"c) <",
"d) =",
"e) n"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int arr [ ], int n ) {
int temp [ n ];
for ( int i = 0;
i < n;
i ++ ) temp [ i ] = arr [ i ];
sort ( temp, temp + n );
int front;
for ( front = 0;
front < n;
front ++ ) if ( temp [ front ] != arr [ front ] ) break;
int back;
for ( back = n - 1;
back >= 0;
back -- ) if ( temp [ back ] != arr [ back ] ) break;
if ( front >= back ) return true;
do {
front ++;
if ( arr [ front - 1 ] < arr [ front ] ) return false;
}
while ( front != back );
return true;
}
back ] != arr [ back ] ) break;
if ( front >= back ) return true;
do {
front ++;
if ( arr [ front - 1 ] < arr [ front ] ) return false;
}
while ( front != back );
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,9,9,16,17,22,32,40,45,53,57,58,66,69,76,80,91,93,94},{52,-76,-18,86,56},{0,0,1},{66,44,98,44},{-96,-62,-56,-46,-44,-38,-38,-26,-22,-22,-16,-12,-6,12,22,34,36,44,44,68,70,74,94},{1,1,0,0,1,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1},{5,9,11,12,13,16,19,23,23,23,25,27,27,28,31,36,40,44,48,59,60,63,66,66,67,67,69,69,70,71,73,76,76,79,86,86,92,92,93,93},{6,82,-88,-46,-60,70,-54,-96,-94,46,-52,48,-26,-50,-92,-92,6,-6,42,0,-66,-96,66,6,-68,-30,-54,76,60,30,72,-66,-12,-74},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{62,54,36,35,36,91,45,87,74,49,15,15,73,77,63,70,74,65,11,18}};
vector<int> param1 {10,3,1,2,14,27,34,28,13,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; bool f_gold ( int arr [ ], int n ) { int temp [ n ]; for ( int i = 0; i < n; i ++ ) temp [ i ] [MASK] arr [ i ]; sort ( temp, temp + n ); int front; for ( front = 0; front < n; front ++ ) if ( temp [ front ] != arr [ front ] ) break; int back; for ( back = n - 1; back >= 0; back -- ) if ( temp [ back ] != arr [ back ] ) break; if ( front >= back ) return true; do { front ++; if ( arr [ front - 1 ] < arr [ front ] ) return false; } while ( front != back ); return true; } back ] != arr [ back ] ) break;
if ( front >= back ) return true;
do {
front ++;
if ( arr [ front - 1 ] < arr [ front ] ) return false;
}
while ( front != back );
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,9,9,16,17,22,32,40,45,53,57,58,66,69,76,80,91,93,94},{52,-76,-18,86,56},{0,0,1},{66,44,98,44},{-96,-62,-56,-46,-44,-38,-38,-26,-22,-22,-16,-12,-6,12,22,34,36,44,44,68,70,74,94},{1,1,0,0,1,1,1,1,0,1,1,1,0,0,1,1,1,0,0,1,0,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0,1,1},{5,9,11,12,13,16,19,23,23,23,25,27,27,28,31,36,40,44,48,59,60,63,66,66,67,67,69,69,70,71,73,76,76,79,86,86,92,92,93,93},{6,82,-88,-46,-60,70,-54,-96,-94,46,-52,48,-26,-50,-92,-92,6,-6,42,0,-66,-96,66,6,-68,-30,-54,76,60,30,72,-66,-12,-74},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{62,54,36,35,36,91,45,87,74,49,15,15,73,77,63,70,74,65,11,18}};
vector<int> param1 {10,3,1,2,14,27,34,28,13,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) \"Not",
"b) =",
"c) ]",
"d) #include",
"e) y;"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
string f_gold ( string s ) {
int n = s . length ( );
int sub_count = n * ( n + 1 ) / 2;
string arr [ sub_count ];
int index = 0;
for ( int i = 0;
i < n;
i ++ ) for ( int len = 1;
len <= n - i;
len ++ ) arr [ index ++ ] = s . substr ( i, len );
sort ( arr, arr + sub_count );
string res = "";
for ( int i = 0;
i < sub_count;
i ++ ) res += arr [ i ];
return res;
}
en <= n - i;
len ++ ) arr [ index ++ ] = s . substr ( i, len );
sort ( arr, arr + sub_count );
string res = "";
for ( int i = 0;
i < sub_count;
i ++ ) res += arr [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"sqGOi","848580","01001110011001","ZhWXUKmeiI","0917296541285","01101001111100","tjP kR","999907","011100","qJPHNSJOUj"};
for(int i = 0; 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 ( ); int sub_count = n * [MASK] n + 1 ) / 2; string arr [ sub_count ]; int index = 0; for ( int i = 0; i < n; i ++ ) for ( int len = 1; len <= n - i; len ++ ) arr [ index ++ ] = s . substr ( i, len ); sort ( arr, arr + sub_count ); string res = ""; for ( int i = 0; i < sub_count; i ++ ) res += arr [ i ]; return res; }en <= n - i;
len ++ ) arr [ index ++ ] = s . substr ( i, len );
sort ( arr, arr + sub_count );
string res = "";
for ( int i = 0;
i < sub_count;
i ++ ) res += arr [ i ];
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"sqGOi","848580","01001110011001","ZhWXUKmeiI","0917296541285","01101001111100","tjP kR","999907","011100","qJPHNSJOUj"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ( | [
"a) ;",
"b) ]",
"c) #include",
"d) (",
"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 s ) {
int length = s / 3;
s -= length;
int breadth = s / 2;
int height = s - breadth;
return length * breadth * height;
}
>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int s ) {
int length = s / 3;
s -= length;
int breadth = s / 2;
int height = s - breadth;
return length * breadth * height;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {8,96,96,96,12,95,72,81,42,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> [MASK] namespace std; int f_gold ( int s ) { int length = s / 3; s -= length; int breadth = s / 2; int height = s - breadth; return length * breadth * height; }>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int s ) {
int length = s / 3;
s -= length;
int breadth = s / 2;
int height = s - breadth;
return length * breadth * height;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {8,96,96,96,12,95,72,81,42,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | using | [
"a) <",
"b) int",
"c) else",
"d) using",
"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 K ) {
int ans = 0;
int y = N / K;
int x = N % K;
ans = ( K * ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2;
return ans;
}
clude <bits/stdc++.h>
using namespace std;
int f_gold ( int N, int K ) {
int ans = 0;
int y = N / K;
int x = N % K;
ans = ( K * ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,46,97,63,92,60,67,61,74,67};
vector<int> param1 {90,64,20,1,52,35,40,62,61,41};
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 ) { int ans = 0; int y = N / K; int x = N % K; ans = ( K [MASK] ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2; return ans; }clude <bits/stdc++.h>
using namespace std;
int f_gold ( int N, int K ) {
int ans = 0;
int y = N / K;
int x = N % K;
ans = ( K * ( K - 1 ) / 2 ) * y + ( x * ( x + 1 ) ) / 2;
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {40,46,97,63,92,60,67,61,74,67};
vector<int> param1 {90,64,20,1,52,35,40,62,61,41};
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) arr",
"c) javafx.util.Pair;",
"d) %",
"e) count"
] | 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 dp [ n ];
for ( int i = 0;
i < n;
i ++ ) dp [ i ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
for ( int j = 0;
j < i;
j ++ ) {
if ( ( arr [ i ] == arr [ j ] + 1 ) || ( arr [ i ] == arr [ j ] - 1 ) ) dp [ i ] = max ( dp [ i ], dp [ j ] + 1 );
}
}
int result = 1;
for ( int i = 0;
i < n;
i ++ ) if ( result < dp [ i ] ) result = dp [ i ];
return result;
}
i ] == arr [ j ] - 1 ) ) dp [ i ] = max ( dp [ i ], dp [ j ] + 1 );
}
}
int result = 1;
for ( int i = 0;
i < n;
i ++ ) if ( result < dp [ i ] ) result = dp [ i ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,13,15,17,18,20,22,24,28,34,37,43,46,47,49,51,52,54,58,64,65,77,78,79,87,90,92,93,94,97},{-86,-56,76,86,42,-40,8,34,-48,-54,-80,6,42,48,76,-26,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{5,22,15,26,29,47,22},{-90,-84,-76,-76,-74,-74,-66,-58,-58,-56,-56,-44,-38,-36,-34,-32,-16,-10,2,6,24,24,24,34,36,54,60,68,70,76,88},{0,1,1,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0,1,0,0,1,1,1,1,0,1,1,1,1,0,0,0,1,0,0,1,1,1,0,0,1},{1,3,12,12,12,12,14,17,18,19,23,27,28,30,35,38,42,44,45,48,52,59,61,64,65,69,73,76,77,82,83,85,87,99},{-54,-20,24,-78,-58,64,34,70,-36,-24},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,35,75,21,82,32,28,53,20,27,42,92,32,70,81,75,72,66,97,60,11,83,14,30,5,68,17,27,62,86,26,20,97,91,44,69}};
vector<int> param1 {23,15,16,5,17,26,23,8,27,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int dp [ n ]; for ( int i = 0; i < n; i ++ ) [MASK] [ i ] = 1; for ( int i = 1; i < n; i ++ ) { for ( int j = 0; j < i; j ++ ) { if ( ( arr [ i ] == arr [ j ] + 1 ) || ( arr [ i ] == arr [ j ] - 1 ) ) dp [ i ] = max ( dp [ i ], dp [ j ] + 1 ); } } int result = 1; for ( int i = 0; i < n; i ++ ) if ( result < dp [ i ] ) result = dp [ i ]; return result; } i ] == arr [ j ] - 1 ) ) dp [ i ] = max ( dp [ i ], dp [ j ] + 1 );
}
}
int result = 1;
for ( int i = 0;
i < n;
i ++ ) if ( result < dp [ i ] ) result = dp [ i ];
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,13,15,17,18,20,22,24,28,34,37,43,46,47,49,51,52,54,58,64,65,77,78,79,87,90,92,93,94,97},{-86,-56,76,86,42,-40,8,34,-48,-54,-80,6,42,48,76,-26,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{5,22,15,26,29,47,22},{-90,-84,-76,-76,-74,-74,-66,-58,-58,-56,-56,-44,-38,-36,-34,-32,-16,-10,2,6,24,24,24,34,36,54,60,68,70,76,88},{0,1,1,1,0,0,1,0,1,0,1,1,1,1,1,1,1,0,0,1,0,0,1,1,1,1,0,1,1,1,1,0,0,0,1,0,0,1,1,1,0,0,1},{1,3,12,12,12,12,14,17,18,19,23,27,28,30,35,38,42,44,45,48,52,59,61,64,65,69,73,76,77,82,83,85,87,99},{-54,-20,24,-78,-58,64,34,70,-36,-24},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{5,35,75,21,82,32,28,53,20,27,42,92,32,70,81,75,72,66,97,60,11,83,14,30,5,68,17,27,62,86,26,20,97,91,44,69}};
vector<int> param1 {23,15,16,5,17,26,23,8,27,20};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | dp | [
"a) i",
"b) return",
"c) 2",
"d) 0",
"e) dp"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
int x1 = a [ 0 ];
int x2 = 1;
for ( int i = 1;
i < n;
i ++ ) x1 = x1 ^ a [ i ];
for ( int i = 2;
i <= n + 1;
i ++ ) x2 = x2 ^ i;
return ( x1 ^ x2 );
}
gold ( int a [ ], int n ) {
int x1 = a [ 0 ];
int x2 = 1;
for ( int i = 1;
i < n;
i ++ ) x1 = x1 ^ a [ i ];
for ( int i = 2;
i <= n + 1;
i ++ ) x2 = x2 ^ i;
return ( x1 ^ x2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,8,10,14,27,32,51,52,57,58,65,68,68,72,73,73,83,92,98},{-60,-48,38,-78,88,86,-4,-94,16,-64,32,88,58,-78,-16,48,38,30,66,-60,20,40,-28,-64,-48,-86,-80,-8,-58,52,80,-32,46,-4,-70,76,-4,78,-64,38,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{69,59,22,33,69,28,11,34,72,88,16,30,69,89,43,4,65,85,27},{-98,-98,-92,-88,-88,-82,-74,-70,-68,-60,-60,-48,-38,-34,-34,-24,14,38,50,58,62,64,64,68,76,78,78,86,88,90,92,98,98},{0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,1,1,0,0,0,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,0,0},{1,9,12,12,24,25,33,33,36,39,46,48,48,52,52,53,57,69,71,72,75,76,78,80,82,86,89,91,94,95,96,97,98,99},{62,-66,60,-92,46,6,-52,48,72,-64,34,20,50,70,-34,20,-70,14,-44,66,-70},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,10,6,71,18,22,15,57,56,63,35,93,31,43,98,99,62,39,44,86,78,95,6,76,71}};
vector<int> param1 {12,28,38,13,23,41,30,17,30,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { int x1 = a [ 0 ]; int x2 = [MASK] for ( int i = 1; i < n; i ++ ) x1 = x1 ^ a [ i ]; for ( int i = 2; i <= n + 1; i ++ ) x2 = x2 ^ i; return ( x1 ^ x2 ); }gold ( int a [ ], int n ) {
int x1 = a [ 0 ];
int x2 = 1;
for ( int i = 1;
i < n;
i ++ ) x1 = x1 ^ a [ i ];
for ( int i = 2;
i <= n + 1;
i ++ ) x2 = x2 ^ i;
return ( x1 ^ x2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,8,10,14,27,32,51,52,57,58,65,68,68,72,73,73,83,92,98},{-60,-48,38,-78,88,86,-4,-94,16,-64,32,88,58,-78,-16,48,38,30,66,-60,20,40,-28,-64,-48,-86,-80,-8,-58,52,80,-32,46,-4,-70,76,-4,78,-64,38,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{69,59,22,33,69,28,11,34,72,88,16,30,69,89,43,4,65,85,27},{-98,-98,-92,-88,-88,-82,-74,-70,-68,-60,-60,-48,-38,-34,-34,-24,14,38,50,58,62,64,64,68,76,78,78,86,88,90,92,98,98},{0,1,0,1,0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,1,0,1,0,0,0,0,1,1,0,0,0,1,1,1,1,1,0,1,1,1,1,0,1,1,1,1,0,0},{1,9,12,12,24,25,33,33,36,39,46,48,48,52,52,53,57,69,71,72,75,76,78,80,82,86,89,91,94,95,96,97,98,99},{62,-66,60,-92,46,6,-52,48,72,-64,34,20,50,70,-34,20,-70,14,-44,66,-70},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{33,10,6,71,18,22,15,57,56,63,35,93,31,43,98,99,62,39,44,86,78,95,6,76,71}};
vector<int> param1 {12,28,38,13,23,41,30,17,30,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 1; | [
"a) )",
"b) *",
"c) import",
"d) 1;",
"e) j"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
int p = 1;
if ( k % 2 ) p = - 1;
return ( pow ( n - 1, k ) + p * ( n - 1 ) ) / n;
}
e <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
int p = 1;
if ( k % 2 ) p = - 1;
return ( pow ( n - 1, k ) + p * ( n - 1 ) ) / n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,70,77,83,16,90,39,48,56,10};
vector<int> param1 {59,87,40,26,2,66,72,26,77,47};
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;
} | [MASK] <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int k ) { int p = 1; if ( k % 2 ) p = - 1; return ( pow ( n - 1, k ) + p * ( n - 1 ) ) / n; }e <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int k ) {
int p = 1;
if ( k % 2 ) p = - 1;
return ( pow ( n - 1, k ) + p * ( n - 1 ) ) / n;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,70,77,83,16,90,39,48,56,10};
vector<int> param1 {59,87,40,26,2,66,72,26,77,47};
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) for",
"b) p2",
"c) public",
"d) #include",
"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 ) {
return ( n & 1 ) ? - 1 : 1;
}
m>
#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 ) ? - 1 : 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,2,58,6,42,17,37,44,23,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { return ( n & 1 ) ? - 1 : [MASK] }m>
#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 ) ? - 1 : 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,2,58,6,42,17,37,44,23,40};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | 1; | [
"a) [",
"b) static",
"c) 1;",
"d) int",
"e) <"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
int m = 1;
while ( x & m ) {
x = x ^ m;
m <<= 1;
}
x = x ^ m;
return x;
}
nclude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
int m = 1;
while ( x & m ) {
x = x ^ m;
m <<= 1;
}
x = x ^ m;
return x;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {96,66,67,13,75,78,1,83,27,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> [MASK] <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int x ) { int m = 1; while ( x & m ) { x = x ^ m; m <<= 1; } x = x ^ m; return x; }nclude <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int x ) {
int m = 1;
while ( x & m ) {
x = x ^ m;
m <<= 1;
}
x = x ^ m;
return x;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {96,66,67,13,75,78,1,83,27,65};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) <cstdlib>",
"b) {",
"c) (",
"d) #include",
"e) in"
] | d |
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 ( long long int y, long long int x ) {
if ( log2 ( y ) < x ) return y;
if ( x > 63 ) return y;
return ( y % ( 1 << x ) );
}
#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( long long int y, long long int x ) {
if ( log2 ( y ) < x ) return y;
if ( x > 63 ) return y;
return ( y % ( 1 << x ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {57,80,84,35,3,42,7,99,13,44};
vector<long> param1 {76,46,96,16,84,79,2,83,61,8};
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] long int f_gold ( long long int y, long long int x ) { if ( log2 ( y ) < x ) return y; if ( x > 63 ) return y; return ( y % ( 1 << x ) ); }#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( long long int y, long long int x ) {
if ( log2 ( y ) < x ) return y;
if ( x > 63 ) return y;
return ( y % ( 1 << x ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<long> param0 {57,80,84,35,3,42,7,99,13,44};
vector<long> param1 {76,46,96,16,84,79,2,83,61,8};
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;
} | long | [
"a) f_gold",
"b) <iostream>",
"c) r",
"d) 5",
"e) long"
] | 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 k ) {
while ( n % 2 == 0 ) {
k --;
n = n / 2;
if ( k == 0 ) return 2;
}
for ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
while ( n % i == 0 ) {
if ( k == 1 ) return i;
k --;
n = n / i;
}
}
if ( n > 2 && k == 1 ) return n;
return - 1;
}
r ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
while ( n % i == 0 ) {
if ( k == 1 ) return i;
k --;
n = n / i;
}
}
if ( n > 2 && k == 1 ) return n;
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,99,64,27,24,84,69,69,22,39};
vector<int> param1 {0,1,3,3,4,6,98,39,60,57};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include [MASK] #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int k ) { while ( n % 2 == 0 ) { k --; n = n / 2; if ( k == 0 ) return 2; } for ( int i = 3; i <= sqrt ( n ); i = i + 2 ) { while ( n % i == 0 ) { if ( k == 1 ) return i; k --; n = n / i; } } if ( n > 2 && k == 1 ) return n; return - 1; }r ( int i = 3;
i <= sqrt ( n );
i = i + 2 ) {
while ( n % i == 0 ) {
if ( k == 1 ) return i;
k --;
n = n / i;
}
}
if ( n > 2 && k == 1 ) return n;
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {94,99,64,27,24,84,69,69,22,39};
vector<int> param1 {0,1,3,3,4,6,98,39,60,57};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| <string> | [
"a) [",
"b) <string>",
"c) return",
"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 n ) {
int k = n;
int imin = 1;
int ans = 0;
while ( imin <= n ) {
int imax = n / k;
ans += k * ( imax - imin + 1 );
imin = imax + 1;
k = n / imin;
}
return ans;
}
( int n ) {
int k = n;
int imin = 1;
int ans = 0;
while ( imin <= n ) {
int imax = n / k;
ans += k * ( imax - imin + 1 );
imin = imax + 1;
k = n / imin;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,72,43,55,62,22,17,68,20,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> [MASK] <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n ) { int k = n; int imin = 1; int ans = 0; while ( imin <= n ) { int imax = n / k; ans += k * ( imax - imin + 1 ); imin = imax + 1; k = n / imin; } return ans; }( int n ) {
int k = n;
int imin = 1;
int ans = 0;
while ( imin <= n ) {
int imax = n / k;
ans += k * ( imax - imin + 1 );
imin = imax + 1;
k = n / imin;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {17,72,43,55,62,22,17,68,20,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 | [
"a) a,",
"b) (",
"c) #include",
"d) &",
"e) +"
] | 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 A, int B, int C ) {
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = A * arr [ i ] * arr [ i ] + B * arr [ i ] + C;
int index, maximum = INT_MIN;
for ( int i = 0;
i < n;
i ++ ) {
if ( maximum < arr [ i ] ) {
index = i;
maximum = arr [ i ];
}
}
int i = 0, j = n - 1;
int new_arr [ n ], k = 0;
while ( i < index && j > index ) {
if ( arr [ i ] < arr [ j ] ) new_arr [ k ++ ] = arr [ i ++ ];
else new_arr [ k ++ ] = arr [ j -- ];
}
while ( i < index ) new_arr [ k ++ ] = arr [ i ++ ];
while ( j > index ) new_arr [ k ++ ] = arr [ j -- ];
new_arr [ n - 1 ] = maximum;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = new_arr [ i ];
}
i < index ) new_arr [ k ++ ] = arr [ i ++ ];
while ( j > index ) new_arr [ k ++ ] = arr [ j -- ];
new_arr [ n - 1 ] = maximum;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = new_arr [ i ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,30,49,65,78,85,85,92},{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18},{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88},{0,0,0,1,1,0,1,1,1,1},{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95},{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58}};
vector<int> param1 {4,18,25,33,8,7,22,20,23,28};
vector<int> param2 {4,20,26,42,12,8,33,16,21,21};
vector<int> param3 {5,20,15,35,8,6,19,19,19,23};
vector<int> param4 {4,23,18,41,8,7,25,16,23,23};
vector<vector<int>> filled_function_param0 {{9,30,49,65,78,85,85,92},{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18},{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88},{0,0,0,1,1,0,1,1,1,1},{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95},{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58}};
vector<int> filled_function_param1 {4,18,25,33,8,7,22,20,23,28};
vector<int> filled_function_param2 {4,20,26,42,12,8,33,16,21,21};
vector<int> filled_function_param3 {5,20,15,35,8,6,19,19,19,23};
vector<int> filled_function_param4 {4,23,18,41,8,7,25,16,23,23};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i],filled_function_param2[i],filled_function_param3[i],filled_function_param4[i]);
f_gold(¶m0[i].front(),param1[i],param2[i],param3[i],param4[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i] && param2[i] == filled_function_param2[i] && param3[i] == filled_function_param3[i] && param4[i] == filled_function_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; void f_gold ( int arr [ ], int n, int A, int B, int C ) { for ( int i = 0; i < n; i ++ ) arr [ i ] = A * arr [ i ] * arr [ i ] + B * arr [ i ] + C; int index, maximum = INT_MIN; for ( int i = 0; i < n; i ++ ) { if ( maximum < arr [ i ] ) { index = i; maximum = arr [ i ]; } } int i = 0, j = n - 1; int new_arr [ n ], k = 0; while ( i < index && j > index ) { if ( arr [MASK] i ] < arr [ j ] ) new_arr [ k ++ ] = arr [ i ++ ]; else new_arr [ k ++ ] = arr [ j -- ]; } while ( i < index ) new_arr [ k ++ ] = arr [ i ++ ]; while ( j > index ) new_arr [ k ++ ] = arr [ j -- ]; new_arr [ n - 1 ] = maximum; for ( int i = 0; i < n; i ++ ) arr [ i ] = new_arr [ i ]; }i < index ) new_arr [ k ++ ] = arr [ i ++ ];
while ( j > index ) new_arr [ k ++ ] = arr [ j -- ];
new_arr [ n - 1 ] = maximum;
for ( int i = 0;
i < n;
i ++ ) arr [ i ] = new_arr [ i ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,30,49,65,78,85,85,92},{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18},{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88},{0,0,0,1,1,0,1,1,1,1},{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95},{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58}};
vector<int> param1 {4,18,25,33,8,7,22,20,23,28};
vector<int> param2 {4,20,26,42,12,8,33,16,21,21};
vector<int> param3 {5,20,15,35,8,6,19,19,19,23};
vector<int> param4 {4,23,18,41,8,7,25,16,23,23};
vector<vector<int>> filled_function_param0 {{9,30,49,65,78,85,85,92},{-48,89,-60,66,71,-37,47,-50,61,41,-22,-3,90,-57,77,-64,22,8,-90,-5,-94,-43,29,-29,86,-79,-8,27,-20,-44,16},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{87,70,77,87,73,81,66,19,83,7,63,42,42,59,20,73,17,27,47,2,63,62,19,17,69,39,82,71,81,39,36,40,45,4,25,69,30,76,68,88,29,73,68,51,24,14,69,18},{-91,-85,-77,-73,-70,-68,-24,-21,-12,-1,9,29,48,52,56,63,88},{0,0,0,1,1,0,1,1,1,1},{4,5,9,14,18,20,22,23,25,28,30,31,34,35,36,38,38,39,44,48,49,51,54,55,59,64,66,71,72,72,73,76,78,82,82,84,92,93,95},{40,6,33,8,78,-58,2,24,40,3,46,94,-26,8,22,-83,96,-29,-38,-59,19,62,98,-55,-42,79,26,62,-56,-85,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,68,40,48,54,35,95,56,89,40,77,68,46,78,13,27,6,17,36,99,81,2,77,52,66,52,92,43,90,22,55,67,99,60,58}};
vector<int> filled_function_param1 {4,18,25,33,8,7,22,20,23,28};
vector<int> filled_function_param2 {4,20,26,42,12,8,33,16,21,21};
vector<int> filled_function_param3 {5,20,15,35,8,6,19,19,19,23};
vector<int> filled_function_param4 {4,23,18,41,8,7,25,16,23,23};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i],filled_function_param2[i],filled_function_param3[i],filled_function_param4[i]);
f_gold(¶m0[i].front(),param1[i],param2[i],param3[i],param4[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i] && param2[i] == filled_function_param2[i] && param3[i] == filled_function_param3[i] && param4[i] == filled_function_param4[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) n",
"b) (",
"c) ]",
"d) [",
"e) pow"
] | 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 count = 0;
sort ( arr, arr + n );
int l = 0;
int r = 0;
while ( r < n ) {
if ( arr [ r ] - arr [ l ] == k ) {
count ++;
l ++;
r ++;
}
else if ( arr [ r ] - arr [ l ] > k ) l ++;
else r ++;
}
return count;
}
= 0;
while ( r < n ) {
if ( arr [ r ] - arr [ l ] == k ) {
count ++;
l ++;
r ++;
}
else if ( arr [ r ] - arr [ l ] > k ) l ++;
else r ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,5,10,19,29,32,40,60,65,70,72,89,92},{-38,40,8,64,-38,56,4,8,84,60,-48,-78,-82,-88,-30,58,-58,62,-52,-98,24,22,14,68,-74,48,-56,-72,-90,26,-10,58,40,36,-80,68,58,-74,-46,-62,-12,74,-58},{0,0,1},{16,80,59,29,14,44,13,76,7,65,62,1,34,49,70,96,73,71,42,73,66,96},{-98,-88,-58,-56,-48,-34,-22,-18,-14,-14,-8,-4,-2,2,18,38,42,46,54,68,70,90,94,96,98},{0,1,1},{11,43,50,58,60,68,75},{86,94,-80,0,52,-56,42,88,-10,24,6,8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,99,4,14,9,34,81,36,80,50,34,9,7}};
vector<int> param1 {7,24,1,12,23,2,4,11,29,9};
vector<int> param2 {12,36,1,16,22,1,4,9,30,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 k ) { int count = 0; sort ( arr, [MASK] + n ); int l = 0; int r = 0; while ( r < n ) { if ( arr [ r ] - arr [ l ] == k ) { count ++; l ++; r ++; } else if ( arr [ r ] - arr [ l ] > k ) l ++; else r ++; } return count; } = 0;
while ( r < n ) {
if ( arr [ r ] - arr [ l ] == k ) {
count ++;
l ++;
r ++;
}
else if ( arr [ r ] - arr [ l ] > k ) l ++;
else r ++;
}
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,5,10,19,29,32,40,60,65,70,72,89,92},{-38,40,8,64,-38,56,4,8,84,60,-48,-78,-82,-88,-30,58,-58,62,-52,-98,24,22,14,68,-74,48,-56,-72,-90,26,-10,58,40,36,-80,68,58,-74,-46,-62,-12,74,-58},{0,0,1},{16,80,59,29,14,44,13,76,7,65,62,1,34,49,70,96,73,71,42,73,66,96},{-98,-88,-58,-56,-48,-34,-22,-18,-14,-14,-8,-4,-2,2,18,38,42,46,54,68,70,90,94,96,98},{0,1,1},{11,43,50,58,60,68,75},{86,94,-80,0,52,-56,42,88,-10,24,6,8},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{54,99,4,14,9,34,81,36,80,50,34,9,7}};
vector<int> param1 {7,24,1,12,23,2,4,11,29,9};
vector<int> param2 {12,36,1,16,22,1,4,9,30,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;
} | arr | [
"a) 0;",
"b) return",
"c) 1;",
"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 arr [ ], int low, int high, int x ) {
if ( low > high ) return - 1;
if ( x >= arr [ high ] ) return high;
int mid = ( low + high ) / 2;
if ( arr [ mid ] == x ) return mid;
if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1;
if ( x < arr [ mid ] ) return f_gold ( arr, low, mid - 1, x );
return f_gold ( arr, mid + 1, high, x );
}
eturn mid;
if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1;
if ( x < arr [ mid ] ) return f_gold ( arr, low, mid - 1, x );
return f_gold ( arr, mid + 1, high, x );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,11,20,42,42,55,58,98,99},{50,-90,-38,-46,-10,-22,-66,72,-52,38,90,34,-12,-44,-6,0,-20,-38,86,26,64,-24,40,90,-26,-2,-28,12,22,-14},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,28,68,98,24,67,86,2,18,22,44,77,52,62,24,46},{-96,-94,-88,-84,-68,-60,-52,-52,-42,-34,-32,-16,-12,-6,-6,-4,-2,0,16,18,38,58,70,72,76,78,90,92,98},{0,1,1,0,0,1,0,1,1,1,0,0,0,0,1,0,1,1,1,1,1,1,0,0,1,0,0},{1,6,7,9,10,11,19,19,22,22,26,34,36,37,37,38,39,40,49,54,60,62,65,67,71,76,78,79,82,82,89,95,97},{76,-32,-98,-18,-80,74,-22,-82,40,-64,58,-18,-64,34,-44,-82,-46,62,-80,-76,32,44,-32,98,-26,62,16,86,-52,-72,-90,-30,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{81,69,15,52,49,54,18,92,33,21,91,21,5,25,77,92,26,58,72,55,76,18,13,59,9,12,31,24,36,33,71,87,55,19,42,25}};
vector<int> param1 {5,26,11,15,22,24,22,28,28,35};
vector<int> param2 {7,28,9,11,27,15,26,31,29,19};
vector<int> param3 {6,23,18,13,20,26,25,24,30,33};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i],param3[i]) == f_gold(¶m0[i].front(),param1[i],param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int low, int high, int x ) { [MASK] ( low > high ) return - 1; if ( x >= arr [ high ] ) return high; int mid = ( low + high ) / 2; if ( arr [ mid ] == x ) return mid; if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1; if ( x < arr [ mid ] ) return f_gold ( arr, low, mid - 1, x ); return f_gold ( arr, mid + 1, high, x ); }eturn mid;
if ( mid > 0 && arr [ mid - 1 ] <= x && x < arr [ mid ] ) return mid - 1;
if ( x < arr [ mid ] ) return f_gold ( arr, low, mid - 1, x );
return f_gold ( arr, mid + 1, high, x );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,11,20,42,42,55,58,98,99},{50,-90,-38,-46,-10,-22,-66,72,-52,38,90,34,-12,-44,-6,0,-20,-38,86,26,64,-24,40,90,-26,-2,-28,12,22,-14},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{69,28,68,98,24,67,86,2,18,22,44,77,52,62,24,46},{-96,-94,-88,-84,-68,-60,-52,-52,-42,-34,-32,-16,-12,-6,-6,-4,-2,0,16,18,38,58,70,72,76,78,90,92,98},{0,1,1,0,0,1,0,1,1,1,0,0,0,0,1,0,1,1,1,1,1,1,0,0,1,0,0},{1,6,7,9,10,11,19,19,22,22,26,34,36,37,37,38,39,40,49,54,60,62,65,67,71,76,78,79,82,82,89,95,97},{76,-32,-98,-18,-80,74,-22,-82,40,-64,58,-18,-64,34,-44,-82,-46,62,-80,-76,32,44,-32,98,-26,62,16,86,-52,-72,-90,-30,6},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{81,69,15,52,49,54,18,92,33,21,91,21,5,25,77,92,26,58,72,55,76,18,13,59,9,12,31,24,36,33,71,87,55,19,42,25}};
vector<int> param1 {5,26,11,15,22,24,22,28,28,35};
vector<int> param2 {7,28,9,11,27,15,26,31,29,19};
vector<int> param3 {6,23,18,13,20,26,25,24,30,33};
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;
} | if | [
"a) if",
"b) class",
"c) max",
"d) {",
"e) min(int"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int C, int l ) {
if ( l >= C ) return C;
double eq_root = ( std :: sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2;
return std :: ceil ( eq_root ) + l;
}
its/stdc++.h>
using namespace std;
int f_gold ( int C, int l ) {
if ( l >= C ) return C;
double eq_root = ( std :: sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2;
return std :: ceil ( eq_root ) + l;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {91,99,11,23,12,1,18,14,13,36};
vector<int> param1 {29,55,56,56,97,64,5,37,55,99};
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 C, int l ) { if ( l >= C ) return C; double eq_root = ( std :: sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2; return std :: ceil ( [MASK] ) + l; }its/stdc++.h>
using namespace std;
int f_gold ( int C, int l ) {
if ( l >= C ) return C;
double eq_root = ( std :: sqrt ( 1 + 8 * ( C - l ) ) - 1 ) / 2;
return std :: ceil ( eq_root ) + l;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {91,99,11,23,12,1,18,14,13,36};
vector<int> param1 {29,55,56,56,97,64,5,37,55,99};
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;
} | eq_root | [
"a) i",
"b) eq_root",
"c) a,",
"d) }",
"e) ="
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n, int p ) {
if ( n >= p ) return 0;
int result = 1;
for ( int i = 1;
i <= n;
i ++ ) result = ( result * i ) % p;
return result;
}
<bits/stdc++.h>
using namespace std;
int f_gold ( int n, int p ) {
if ( n >= p ) return 0;
int result = 1;
for ( int i = 1;
i <= n;
i ++ ) result = ( result * i ) % p;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {85,14,83,30,96,55,82,12,38,46};
vector<int> param1 {18,13,21,35,51,58,71,74,3,73};
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> [MASK] <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int n, int p ) { if ( n >= p ) return 0; int result = 1; for ( int i = 1; i <= n; i ++ ) result = ( result * i ) % p; return result; }<bits/stdc++.h>
using namespace std;
int f_gold ( int n, int p ) {
if ( n >= p ) return 0;
int result = 1;
for ( int i = 1;
i <= n;
i ++ ) result = ( result * i ) % p;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {85,14,83,30,96,55,82,12,38,46};
vector<int> param1 {18,13,21,35,51,58,71,74,3,73};
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) )",
"b) #include",
"c) =",
"d) )",
"e) &&"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = 0;
int maxsize = - 1, startindex;
for ( int i = 0;
i < n - 1;
i ++ ) {
sum = ( arr [ i ] == 0 ) ? - 1 : 1;
for ( int j = i + 1;
j < n;
j ++ ) {
( arr [ j ] == 0 ) ? ( sum += - 1 ) : ( sum += 1 );
if ( sum == 0 && maxsize < j - i + 1 ) {
maxsize = j - i + 1;
startindex = i;
}
}
}
if ( maxsize == - 1 ) cout << "No such subarray";
else cout << startindex << " to " << startindex + maxsize - 1;
return maxsize;
}
size = j - i + 1;
startindex = i;
}
}
}
if ( maxsize == - 1 ) cout << "No such subarray";
else cout << startindex << " to " << startindex + maxsize - 1;
return maxsize;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{56,8,67,35,19,82,81,66,10,24,82,2,42,48,18,63,48,74,60,64,64,95,95,20,95,55,63,96,54},{78,67,1,78,48,83,17,19,21,44,99,68,16,54,9},{3,69,97,21,12,67,45,53,77,70,26,43},{21,80,29,22,77,64,42,4,71,75,62,27,30,36,66,37,49,97},{18,66,9,90,21,95,74,48,44,9,43,17},{42,41,87,3,64,25,96,55,99,57,32,64,10,75,69,95,11,36,15,2,78,70,14,54,11,28,55,47,27,85,47,62,97,68,44,70,12,27,36,85,76,91,17,75,83,34,32,89,55},{44},{1,43,28,17,30,46,89,51,15,70,96,79,65,55,8},{25,91,68,4,35,49,33},{14,86,22,42,94,54,28,41,48,8,82,84,99,92,33,75,38,31,59,86,21,6,77,89,79,83,57,26,89,45,60,55,60,76,76,6,40,57,38,44,7,98,64,65,88,73,88,99}};
vector<int> param1 {26,8,9,10,10,41,0,9,4,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int sum = 0; int maxsize = - 1, startindex; for ( int i = 0; i < n - 1; i ++ ) { sum = ( arr [ i ] == 0 ) ? - 1 : 1; for ( int j = i + 1; j < n; j ++ ) { ( arr [ j ] == 0 ) ? ( sum += - 1 ) : ( sum += 1 ); if ( sum == 0 && maxsize < j - i + 1 ) { maxsize = j - i + 1; startindex = i; } } } if ( maxsize == - 1 ) cout << "No such subarray"; else cout << startindex << " to " << startindex + maxsize - 1; return maxsize; }size = j - i + 1;
startindex = i;
}
}
}
if ( maxsize == - 1 ) cout << "No such subarray";
else cout << startindex << " to " << startindex + maxsize - 1;
return maxsize;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{56,8,67,35,19,82,81,66,10,24,82,2,42,48,18,63,48,74,60,64,64,95,95,20,95,55,63,96,54},{78,67,1,78,48,83,17,19,21,44,99,68,16,54,9},{3,69,97,21,12,67,45,53,77,70,26,43},{21,80,29,22,77,64,42,4,71,75,62,27,30,36,66,37,49,97},{18,66,9,90,21,95,74,48,44,9,43,17},{42,41,87,3,64,25,96,55,99,57,32,64,10,75,69,95,11,36,15,2,78,70,14,54,11,28,55,47,27,85,47,62,97,68,44,70,12,27,36,85,76,91,17,75,83,34,32,89,55},{44},{1,43,28,17,30,46,89,51,15,70,96,79,65,55,8},{25,91,68,4,35,49,33},{14,86,22,42,94,54,28,41,48,8,82,84,99,92,33,75,38,31,59,86,21,6,77,89,79,83,57,26,89,45,60,55,60,76,76,6,40,57,38,44,7,98,64,65,88,73,88,99}};
vector<int> param1 {26,8,9,10,10,41,0,9,4,26};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <cstdlib> | [
"a) [",
"b) <cstdlib>",
"c) )",
"d) 0;",
"e) 0"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( const vector < vector < int > > & m ) {
int rows = m . size ( );
if ( rows == 0 ) return false;
int columns = m [ 0 ] . size ( );
for ( int y1 = 0;
y1 < rows;
y1 ++ ) for ( int x1 = 0;
x1 < columns;
x1 ++ ) if ( m [ y1 ] [ x1 ] == 1 ) for ( int y2 = y1 + 1;
y2 < rows;
y2 ++ ) for ( int x2 = x1 + 1;
x2 < columns;
x2 ++ ) if ( m [ y1 ] [ x2 ] == 1 && m [ y2 ] [ x1 ] == 1 && m [ y2 ] [ x2 ] == 1 ) return true;
return false;
}
int y2 = y1 + 1;
y2 < rows;
y2 ++ ) for ( int x2 = x1 + 1;
x2 < columns;
x2 ++ ) if ( m [ y1 ] [ x2 ] == 1 && m [ y2 ] [ x1 ] == 1 && m [ y2 ] [ x2 ] == 1 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<vector<int>>> param0 {{{33,27,56,17,90,10,92},{20,12,1,45,94,64,42,91,5,51},{60,52},{48,98,56,44,78,88},{30,8,22,41,6,79,15,48,92,2,70,66,88,85,42,30},{19,42,69,71,6,97,48,51,68,65,90,99,29,56,53,67,86,38,88,21,33,79,34,12,92,27,44,13,46,70,54,87,57},{60,87,77,22,9,81,52,91,48,25,16,34,64,50,38,30,5,2,52,93,31,62},{75,98,28,32,33,87,3,38,57,38,9,88,68,61,18,34,36,71,44,99,43,25,92,30,20,85,99,78,22,38,25,44,20,50,48,54,63,23},{28,59,16,49,73,43,13,55,80,47,27,5,61,92,86,70,34,26,29,1,75,94,78,41,91,14,74,11,19,35,87,17,89,53,51,83,58,20,77,33,60,46},{47,2,17,93,96,18,41,19,21,94,67,75,15,15,49,24,66,55,71,43,55,13,6,67,23,69,82},{16,43,86,98,37,88,84,29,4,30,46,27,69,96},{82,12,57,2,83,23,57,56,58,23,64,1,19,52,76,78,95},{67,62,56,93,92,72,18,35,16,22,17,36,91,30,91,4,60,41,89,36},{31,19,74,59,39,36,76},{53,5,82,26,51,8,38,42,29,7,1,62,56,51,24,77},{85,53,29,56,58,57,47,49,97,89,13,5},{58,14,40,27,72,44,18,18,10,44,2,19,10,25,6,77,97,47,18,9,39,39,75},{21,67,71,57,23,8,41,82,91,20,9,19,2,17,63,43,28,62,25},{55,16,43,76,15,10,21,14,98,70,48,30,39,18,45,30,58,24,77,76,86,2,78,31},{30,18,24,92,77,2,14,90,13,47,39,3,21,19,16,64},{2,37,34,44,31,30,2,24,1,1,44,81,74,60,50,84,75,86,80,3,1,80,38,14,5,75,79,85,52,49,13,37,57,84,63,37,62,41,96,65,1,50,57,64,20,4,37,82},{42,7,11,6,6,52,84,59,34,24,94,93,15,5,39,51,69,12,54,69,92},{79,31,22,78,67,20,36,9,82,67,80,94,13,26,6,22,1,77,21,89,77,55,27,45,4,30,59,80,98,61,25,13},{1,61,32,35,9,71,95,64,86,22,85,94},{34,80,27,19,82,78,31,40},{20,19,64,24,20,62,76,77,57,39,4},{7,95,29,19,84,97,55,51,62,6,44,19},{22,22,16,81,17,30,59,45,29,17,87,74,45,37,87,91,79,91,46,58},{86,44},{35,80,7,10,80,62,79,81,68,75,30,52,23,45,43,30,81,8},{80,11,14,94,81,44,23,9,54,91,29,85,8,70,69,52},{90,23,44,91,46,50,92,67,80,96,86,12,78,72,5,39,15,11,47,6,53,74,49,2,55,77,51,42,2,43,9,40,8,72,28,55,47,75,39,95,24,71,17},{35,50,89,64,25,88,7,57,49,42,32,97,13,68,47,91,58,78,60,38,28,9,62,11,16,69,67,28,68,19,42,19,98,94,97,34,31,26,61,62,24,20,38,9},{50,74,79,63,28,28,89,10,32,11},{15,59,63,45,86,21,51,55,94,84,6,45,11,49,99,82,80,81,19,32,78,74,4,24,70,21,36,23,70,87,71,75,28,49,30,93,56,23,44,27,49}},{{11,70,30,12,22,41,7,64,33,26,30,14,88,33,23,1,43},{87,64,19,26,58,61,27,52,34,24,81,99,37,43,23,36,20,66,88,49,60,45,96,26,34,88,97,79},{21,75,5,51,12,77,65,3,63,95,50,62,38,73,63,4,25,96,17,22,8,99,33,35,9,67,68,77,60,99,86,54,23,61,25,30,97,70,49,72},{38,97,53,66,52,27,35,1,87,24,59,66,27,31,33,32,63,79,61,30,75,33,19,99,66,93,18,26,81,56,61,68,21,94,37,34,27,12,78,1,49,33,31},{19,83,1,12,42,64,28,87,86,60,98,50,17,13,42,75,38,14,94,7,83,48,52,10,22,99,21,34,97,22,80,4,14,49,7,24,46,86,18,31,69,72,7,68},{68},{32,82,40,71,54,62,66,31,51,47,89,47,38,93,51,51,68,86,63,53,91,26,46,56,59,17,81,54,31,29,86,36,83,20,50,60,48,19,86,18,28,67,70,8},{39,81,48,34,15,68,39,74,40,34,17,32,45,75,25,74,15,43,53,32,1,52,31,13,41,40,45,93,9,15,58,25,34,37,1,52,79,38,96,47,65,87,74,72,78},{33,74,44,12,34,25,32,36,79,54,81,40,55,11,10,55,60,67,21,11,90,13,71,45,71,7,27,97,63,77,59,50,96,70,77,16,95},{18,90,66,27,26,81,78,67,15,82,14},{96,65,67,31,72,58,5,48,56,98,82,53},{61,67,11,63,46,8,93,96,75,79,51,45,78,24},{38,9,58,7,83,62,37,37,10,34},{58,44,72,71,21,24,30,46},{79,31,85,77,58,74,68,66,53,96,53,98,56},{17,69,4,41,83,86,25,97,9,27,71,32,85,78,44,61,3,9,85,87},{24,33,5,13,2,9,76,62,72,46,78,66,36,74,78,21,69,32,52,45,24,70,42,57,99,25,81,37,88,37,33,89,12,82,3,33,40},{9,21},{67,88,29,90,37,28,43,10,48,68,74,23,25,69,22,23,27,85,9,44,48,33,26,42,29,74,85,1,64,56,16},{18,52,35,78,93,48,8,33,61,16,56,98,69,79,50,25,11,8,13,20,96,14,93,10,99,74,28,31},{99,89,29,70,27,71,64,62,35,55,74,59,24,88,91,28,71,53,69,9,56,73,98,62,12,48,52,6,79,19,82,23,15,26,58,12},{12,90,73,78,85,31},{12,63,16,21,18,73,36,81,65,39,11,38,16,85,66,67,7,34,39,91,39,9,11,53},{12,27,23,32,97,4,90,87,68,76,62,73,53,52,72,13,94,83,29,4,61,7,97,72,87,93,17,24,78,56,54,45,61,3,84,69,15},{49,4,97,7,82,25,45,62,44,25,30,99,76,9,49},{31,56,52,48,85,93,40,34,10,77,17,35,16,33,13,81,50,4,57,7,18,25},{20,49,46,44,39,3,9,20,36,28,73,43,96,96,39,81,13,8,11,31,36,93,47,1,89,2,58,76,32,17,15,27},{57,55,81,6,76,78,8,42},{59,1,14,67,27,21,26,88,41,29,62,1,78,3,78,17,26,39,87,23,8,66,72,32,17,67,2,36,45,81,66,90},{96,64,39,49,53,82,88,76,39,26,78,30,99,80,6,45,26,14},{73,92,24,60,43,90,50,40},{77,11,86,37,84},{38,22,88,69,54,28,3,18,89,63,59,73,11,50,65,35,38,73,44,4,49,12,66,63,6,21,20,51,52,57,13,59,56,17,83},{64,71,5,44,58,36,40,82,39,12,63,54,83,27,28,10,3,95,60,39},{26,40,14,91,24,99,1,35,34,8,20,40,64,9,85,66},{92,82,19,88,78,31,92,6,33,81,34,60,55,77,88,79,73,71,44,18,87,39,78,10,36,95,20,97,46},{59,73,4,37,80,51,12,8,46,73,8,42,32,75,54,73,84,73,73,97,83,57,57,19,13,82,36},{50,71,88,31,48,7,72,19,68,2,47,18,87,37,68,97,4,3,63,41,10,70,97,1,9,51,96,99,57,69,74,92,80,38,57},{62,76,16,47,19,77,87,36,40,94,42,22,93,81},{48,10,34,52,24,21,53,26,98,46,37,10,84,13,37,31,51,82,98,13,54,49,83,51,48},{78,88,6,53,91,29,3,50,10,61,64,48,70,3,79,8,82,30,34,48,74,23,42,6,8,49,56,88,22,33,31,49,65,93,18,90,24,75,73,54,63,89,27,36,45}},{{19,66,29,41,66,76,21,58,50,69,77,4,71,60,48,11,43,15,20,54,13,81,55,12,89,66,60,75,95,49,89,43,46,72,33,47,14,60,81,3,4,27},{44},{88,54,94,24,38,7,98,37,64,92,67,28,38,31,5,7,46,52,84,22,95,67,41,91,75,32,31},{30,88,47,79,92,83,11,51,55,83,31,40,28,46,13,91,25,2,96,23,48,40,48,23,6,58,22,56,28,46,24,34,25,99,32,95,59,49,75,31,2,87,6,17},{72,33,96,20,54,9,50,44,13,80,14,15,92,38,10,61,74,36,26,89,92,90,7,81,98,61,97,49,92,30,99,94,27,55,62,57,65,68,41,5,64,8,21},{99,86,38,3,77,73,17,26,98,75,74,28,75,97,34,19,89},{30,13,68,27,79,40,2,72,20,37,94,92,20,15,78,49,21,78,42,16,27,77,52}},{{95,26,62,49,1,3,4,80,39,89,1,81,51,44,58},{30,74,80,21,35,93,35,85,54,2,57,72,25,74,99,20,95,12,77,44,49,40},{14,85,9,46,55,44,52,72,79,25,94,67,34,53,18,88,36,38,48,12,61,38,46,65,31,50,70,49,94,66,83,45,7},{69,92}},{{7,13,48,32,22,86,84,21,41,47,14,68,60,21,75,93,85,79,55,68,75,41,65,91,87,35,14,19,58,65,39,8,72,30,68,54,40,16},{14,55,36,17,17,25,29,57,66,29,79,26},{65,13,10,98,49,65,95,66,34,8,89,84,82,12,27,39,77,50,52,29,72,94,99,4},{31,49,84,24,51,9,49,16,94,37,56,31,94,55,66,31},{83,34,96,28,43,55,30,92,44,47,33,96,56,43,76,49,21,8,35,27,26,46,51,93,24,1,64,26,96,58,61,5,4,31,17},{96,50,67,33,52,15,37,87,80,53,48,19,48,7,20,31,45,75},{16,68,99,53,61,34,32,41,56,30,24,34,97,86,69,50,59,73,74,69,10,95,34,58,48,72,84,9,47,89,72,78,35,41,56,80,16,14,65,65,42,24,19,75,86,63,37,1,56},{41,99},{53,98,10,55,55,74,62,49,23}},{{36,25,6,99,30,98,86,41,36,15,59,42,46,93,32,96,15,29,82,37,21,11,71,95},{97,70,80,9,66,26,54,38,49},{32,85,11,16,9,2,21,47,51,62,7,83,54,92,99},{19,49,52},{42,26,11,8,11,82,33,67,6,58,98,52,79,63,57},{45,44,62,78,72,94,61,66,1,32,43,25,48,73,72,45,33,61,95,72,15,94,40,27,77,59,11,35,55,74,75,6,96,65,93,80,45,29,75,68,49,60,39,12,66,40,42},{88,41,78,96,40,25,60,42,85,95,86,13,13,36,13,80,30,99,36,89,45,20,93,26,94,95,36,74,62,93},{1,84,16,27,20,3,96,6,84,35,88,87,96,28,40,15},{63,60,38,11,62,87,8,9,57,29,66,97,42,10,66,94,79,99,36,61,47,90,2,12,69,89,63,83,96,67,4,95},{88,12,39,91,62,89,69,31,29,59,12,28,38,11,46,95},{1},{23,26,8,83,78,8,59,93,38,70,8,53,71,17,67,37,99,96,82,88,83,96,59,89,35,99,5,32,13,2,70,41,44,25,37,61,35,46,1,84,78,1,93,6,28,51,49,79,41},{88},{94,90,57,31,11,93,92,72,78,7,70,70,16,78,14,5,93,80,7,6,8,98,90,39,10,27,59,79,99,9,27,92,22,29,72,32,14,42,61,95,95,20},{47,78,29,28,95,78,13,48,39,20,15,94,24,21,85,15,5,78,38,57,13,50,51,94,98,34,73,23,6,98,88,4,82,95,44,59,21,8,71,30,44,2,42,37,49,93,43,13},{58,43,75,30,27,69,1,6,95,67,54,7,54,8,47,76,59,75,90,69,33,75,85,3,15,38,93,32,72,35,26,43,12},{46,83,6,14,71,94,4,82,62,60,91,16,56,54,79,82,21,2,36,50,87,3,77},{46,92,33,68,88,34,19,3,84,56,54,95,14,77,92,69,45,21,28,57,31,5,99,17,57,22,75,65,58,96,91,97,56,4,26,48,92,90,32,74,45,41},{76,18,56,96,24,77,50,56,82,81,21,44,9,23,79},{65,10,78,19,37,77,26,12,11,87,33,11,33,4,70,55,45,5,89,36,82,52,71,8,8,99,49,79,81,63,81,40,1},{33,39,45,37,35,30,77,35,82,3,95,95,92,47,17,80,85,5,98,94,58,50,67,69,49,75,6,33,87,1,8,34,67,47,77,16,31,1,85,36,10,69,38,85,74,27,68,89,81},{84,65,8,68,67,50,95,63,82,74,15,23},{83,80,38,10,81,7,98,74,99,28,83,28,32,73,57,3,58,99,91,87,4,77,29,70,67,68,58,34,65,5,40,77,68,68,97,4,44},{21,9,42,33,60,19,12,34,2,86,17,71,69,21,70,74,82,82,56,23,67},{40,35,52,70,26,77,34,73,94,38,73,17,11,20},{25,63,66,86,25,5,3,65,14,46,42},{43,33,99,51,18,69,11},{96,26,41,60,74,6,2,8,58,98,34,75,78,43,42,65,65,55,97,91,38,9,43,12,46,32,14,86,69,48},{72,30,96,85,98,65,18,56,87,30,25,33,95,10,61,30,60,23,60,16,47,87,37,88,21,19},{50,40,70,94,42,49,87,37,74,43,51,77,27,4,52,73,1,68,78,67,90,6,71,63,90,35,86,76,68,79,57,45,27,29,1,75,60,29,1,66,74},{79,49,53,14,41,85,96,98,32,94,50,74,11,32,37,58,32,79,24,55,29,54,90,78,76,11,4,94,68},{76,58,2,68,78,6,13,58,6,48}},{{57,64,14,43,52,77,97,18,3,79,44,66,11,35,18,48,57},{86,90,14,56,73,83,6,42,30,37,50,48,18,35,86,29,72,57,23,65,69,14,57,54,40,54,26,92,66,85,87,10,55,30,54,43,5,46,63,64},{22,4,3,49,18,86,34,79,89,5,72,8,33,25,89,2,91,61,18,2,33,40,31,40,40,39,53,81,12,59,85,43,35},{59,9,89,87,75,3,25,94},{12,24,74,40,84,44,23,24,76,63,11,23,46,70,55,74,60,61,70,28,4,7,80,84,33,99,55,6,88,63,19,54,23,32,15,7,74,36,21,85,88,30},{27,92,34,86,22,20,3,1,90,78,69,7,45,13,63,40,94,54,3,41,74,47,65,15,2,76,29,52,46,94,21,69,11,24},{98,83,78,29,95,2,75,70,89,11,35,89,7,64,6,80,21,79,62,8,44,24,46,30,52,56,31,36,23,88,14,3,2,16,12,90},{96,81,1,36,86,5,88,13,32,50,22,7,46,8,34,46,92,46,95,6,17,35},{69,41,27,54,96},{59},{2,78,98,45,39,88,2,41,92,83,32,81,57,49,24,22},{64,13,96,53,72,82,4,57,37,89,16,96,9,83,87,52,9,7,86},{63,17,29},{79,30,42,4,41,31,69,2,13,38},{40,81,16,26,91,29,37,75,99,81,47,55,63,96,98,15,4,90,53,65,79,53,68,36,21,52,80,30},{5,60,40,57,16,25,95,59,68,37,58,82,28,79,16,4,12},{38,82,85,42,23,36,63,80,84,3,65,16},{20,45,4,47,88,66,62,84,69,77,34,95,7,79,4,12,9,8,28,55,36,42,96,23,35,92,49,71,33,19,46,91},{94,29,68,9,55,89,85,4,64,69,18,21,30,97,39,61,69,85,53,45,52,62,56,58,22,70,39,95,32,68,81,42,90,50,89,18,45,78,78,3,74,50,20,11},{66,11,7,37,6,57,16,50,58,9,21,14,73,73,90,6,7,88,3,4,96,11,54,84,38,28,41},{1},{6,28,27,52,59,13,62,14,31,32},{59,68,76,71,24,89,30,26,66,45,88,52,72,7,52,66,79,26,96,59,52},{54,41,50,4},{80,98,4,65,77,86,43,27,13,39,4,94,96,92,13,51,24,19,6,6,85,89,62,44,11,59,55,52,60,37,15,61,59,51,21,86,93,48,68,21,62,35,80,85,35,23},{7,34,53,84,9,35,55,79,15,38,85,43,50,80,29,48,87,67,8,2,96,19,11,75,26,13,91,34,37,68,67,18,24,43,5,41},{35,53,64,42,80,51,83,91,75,40,31,25,67,71,25,61,63,60,55,75,33,64,66,41,93,22,35,60,63,59,82,20,60,57,5,4,7,43,14,50,73,94,63,52,29,48,9,19},{7,13,41,22,63,48,32,49,8,25,15,37,56,24,78},{58,45,33,18,33,48,50,64,65,74,98,78,9,48,70,5,71,63,89,38,57,84,94,40,23,34,34,98,85,61,13,38,92,98,15,64,56,23,91,9,50,18,18,83,72,94,10,71,9},{13,39,36,80,40,81,12,27,85,91,5,51,90,65,2,72,5,85,29,55,91,75,8,91,81,10,15,31,3,73,23,88,18},{46,65,69,68,42,57,88,3,7,17,66,83,46},{99,15,31,56,63,6},{96,39,93,78,2,12,66,76,5,16,56,63,55,74,54,98,7,45,53,4,6,66,6,68,14,2,87,50,94,43,39,58,21,4,55,14,49,59,62},{19,96,21,54,61,88,11,79,75,71,56,57,12,36,44,43,84,95,92,80,51,9,36,6,11,78,63,94,75,80,5,84,14,44,86,82,69,23,47},{34,45,44,41},{39,23,58,48,32,92,36,32,24,18,22,1,9,2,83,37,19,91,60,81,79,25,68,9,12,26},{44,92,92,12,71,22,94,98,34,62,7,97,97,97,60,51,13,41,35,75,97,21,30,61,41,70,82,7,31,66,5,40,62,25,69,31},{96,1},{1,65},{30,59,74,49,14,90,88,38,91,36,4,44,28,71,59,25,97,79,93,10,7,73,73,37,37,57,71,61,79,62,84,57,39,53,36,49,7,77,47,54,92,53,96,46,69,39,45,94,67},{19,93,99,75,96,15},{86,97,1,75,11,45,22,59,96,14,62,39,33,3,62,41,39,18,24,3,34,50,81,39,73,81,37,53,54,94,26,94,6,2,96,19,7,48,58,53,3,24,40,60,76},{73,4,8,42,10,24,84,69},{42,2,49,32,11,68,26,90,23,2,62,49},{98,3,84,46,32,87,25,52,79,56,9,9,72,50,23,50},{92,71,50,10,78,29,48,9,16,54,12,87,50,80,27,36,7,69,56,45,72,27,77,95,96,49}},{{84,47,93,51},{97,74,57,83,5,70,92,1,11,2,8,57,81},{76,66,34,36,74,51,30,35,76,48,3,88,26,27,37,86,2,53,26,52,65,99,23,77,13,58,6,40,26,62,83,59,24,95,54,24,63,58,32,71,60,15,75,29,37,29,4},{71,18,87,98,77,23,80,15},{28,42,8,9,21,65,70,98,10,16,1,77,5,70,57,90,92,43,94,12,93,8,97,6,84,32,59,92,4,34,45,40,25,73,25,92,72,71,87,92,88,44,30,38,78},{93,6,77,55},{29,89,30,59,86,80,20},{6,31,25,81,75,64,79,37,56,30,71,4,86,53,31,81,56,86,36,76,30,96,19,99,3,15,4,82,87,7,35,55,10,3,52,19,2,1,4,80,32},{31,43,73,35,53},{77,93,1,13,82,55,74,3,77,19,23,30,73,24,74,68,99,60,5,65,53,9,33,73,73,76,62,40,28,44,14,25,38,97,99,37,90,48,41,99,70,77},{70,6,5,28,81,26,11,36,26,1,65,51,56,62,35,14,80,19,58,86,48,48,90,71,38,3,40,42,26},{8,13,98,48,25,57,55,61,44,83,6,86,22,88},{23,83,44,7,90,99,7,21,47,55},{47,92,94,44,92,99,28,96,94,51,23,33,27,7,99,30,49,87,31,79,95,13,7,22,93,60,96,61,90,57,23,84,69,60,17,29,77},{26,62,80,46,59,9,81,99,21,68,12,1,73,40,35,87,64,94,31,51,88,26},{9,95,69,50,63,28,83,12,81,57,16,22,23,97,36,78,91,5,50,21,1,14,92,10,62,19,30,82,81,84,41,40,78,88,68,27,4,78,61,99,8,67,82,58,38,42,64,43,29},{22,93,76,24,74,65,56,33,91,89,16,70,33,7,98,46,82,32,26,2,34,27,67,85,66,82,20,8},{63,98,27,78,7,32,13,25,58,5,46,10,30,47,79,65,33,84,60,95,18,79,69,20,36,43,13,20,72,30,32,94,59,8,70,7,54,18,50,56,65,61,70,3},{23,26,33,14,79,93,32,58,80,76,40,2,55},{48,40,9,29},{89,96,17,74,98,15,1,46,38,55,90,20,85,93,91,22,54},{72,14,76,72,64,61,27,93,87,63,55,95,32,66,19,74,34},{52,25,67,46,11,1,47,54,86,72,24,46,92,17,23,31,46,53,63,74,22,8,64,54,88,4,9,39,3,56,17,15,13,41,44,49,64},{53,42,4,10},{29,46,14,53,84,80,65,84,79,74,54,18,1,95,48,36,2,44,84,76,22,33,60,20,6,14,42,26,60,42,89,62,76,20,40,66,2,81,92,29,27,6,9,63,96,31,14},{18,81,90,96,76,61,26,17,22,24,42,66,98,17,65,80,23,65,77,90,47,56,17,3,15,51,14},{39,13,16,88,62,59,78}},{{94,44,83,3,47,11,36,61,29,34,43,94,79,3},{35,91,27,32,31,95,89,92,86,26,9,30,64,56,73,85,39,14,97,77,29,89,59,16,20,53,89,87,3,77,77,69,36,24,52,52,65,41,94,4,85,38,70,76,26,92,92,23,34},{80,40,74,57,81,40,53,27,82,44,51,91,42,31,55,79,52,66,53,27,23,24,53,72,58,11,23,82,67,41,88,84,95,78,76,73},{72,93,81,5,86,85,55,44,69,70,60,61,52,1,95,4,70,44,68,93,64,12,95,21,4,54,19,74,39,36,74,4,82,33,30,76,32,59,78,56,56,96,44,7,64,83,95},{36,69,97,32,86,60,10,45,74,25,74,72,73,56,46,71,51,95,31,95,97,95,40,64,15,63,78,63,72,23,71,19,57,51,7,27,50,58,31,6,90,41,70},{83,15,4,37,90,29,28,42,8,85,91,2,16,4,76,34,67,67,11,6,28,40,73,32,53,35,52,92,34,15,71,4,86,27,95,15,74,85,74,25,9,72,80,74,45,81,62},{90,54,30,4,42,25,99,8,74,27,77,35,91,8,17,28,39,83,62,90,49,18,94,38},{99,81,47,87,32,25,26,32,93,93,20,74,5,43,8,41,40,9,6,36,63,26,77},{3,73,96,98,94,41,51,93,75,93,93,31,26,11,26,29,83,77,23,84,13,58,62,31,22,83,14,70,45,89,63,82,74,80,73,58},{11,52},{52,49,6,36,12,79,79,89,58,21,43,21,32,15,68,46,43,11,37,71,58,59,50,28,66},{11,79,89,58,33,23,75,50,73,44,76},{89,9,37,14,7,43,93,70,46,79,58,85,22},{4,10,22,46,13,41,56,37,39,58,87,19,15,88,33,46,13,67,84,9,13,16,58,82,79,77,84,79,39,98,53,84,19,9,93,30,6,82,8,43,17},{62,21,34,86,98,44,81,14,82,54,44,53,36,33,2,68,19,37,60,68,6,31,44,52,95,78,24,20,56,58,11,31,61,79,84,20,35,53,79,60,18,30,43,90},{6,16,42,48,89,31,13,89,14,73,44,91,12,1,36,34,94,86,86,82,45,99,38,2,1,76,26,90,30,61,21,43,26,6,44,98,69,41,48,40,90,76,61,17,81,74,92,54,16},{15,8,16,84,86,34,34,75,92,67,54},{19,31,62,89,26,96,91,32,78,42,84,66,79,29,48,49,5,70,2,71,36,90,70,86,80,28,71,77,3},{17,5,88,70,37},{17,76,71,38,5,87,77,36,76,29,14,36,18,80,23,39},{21,37,68,55,90,49,24,88,13,97,97,61,71,29,89,75,98},{73,87,99,92,49,12,74,59,64,19,89,53,12,44,73,81,57,88,72,37,4,56,81,14,29,81,84,98,98,60,75,98,86,51,88},{35,7,98,35,89,39,27,69,30},{23},{91,65,2,73,12,91,47,14,48,1,69,95,81,59,36,79,35,9},{54,25,8,41,64,96,84,47,85},{68,54,56,89,25,27,83,2,24,87,86,4,96,29,69,93,32,2,22,75,28,44,81,49,13,26,67,78,55,39,33,5,62,95,80,95,78,34,36,30,98,99},{96,64,38,15,13,52,35,51,58,8,62,66,33,36,70,75,5,34,54,8,27,99,3,26,47,1,61,75},{85,51,48,48,79,4,61,32,30,94,40,65,7,86,75,27,89,47,19,99,55,96,24,70,37,27,26,47,33,81,36,13,14,39,90,92,54,93,83,93,67,35,47,75,54},{17,66,58,44,36,32,93,79,30,62,88,4,94,41,56,74,27,11,91,2,95,11,44,93,51,31,68,95,71,44,41,81,69,38,28,13,73,7,63,8,89,14,35},{82,91,99,3,24,5,56,84,15,51,33,55,78,52,19,32,36,81,73,34,57,45,79,36,13,73,39,79,43,50,3,73,70,30,3,88},{2,3,98,55,1,88,84,56,66,26,36,29,51,1,35,48,93,99,73,93,68,89,97,51,35,6,38,30,84,9,1,92,10,67,42,99},{92},{50,66,97,64,10,81,14,33,2,75,7,68,82,82,40,2,45,70,6,92,74,58,53,51,73,22,99,5,7,68,2,26,95,4,47,27,18,90,89,14,9},{80,61,92,13,68,82,89,28,7,35},{69,15,28,27,60,79,20},{38,31,3,33,58,82,75,73,67,42,42,76,23,15,81,82,16,63,71,68,44,26,78,31,48,15,65,65,51,37,49,16,68,61,93,13,59,23,34,84},{62,63,60,5,95,90,78,58,87,37,26,13,55,81,30,19,80,82,4,24},{8,11,45},{64,21,66,1,72,10,36,85,24,90,27,68,81,63,46,91,3,81,83,44,33,67,72,31,96},{12,84,24,51,57,17,46,58,74,28,82,85,64,23,31,77,23,97,34,56,90,47,36},{76,18,75,5,93,67,79,43,73,16,46,19,19,54,38,56,99,60,88,31,48},{88,10,77,8,66,37,46,51,95,71,43,78,24,14,78,9,88,76,33,27,58},{37,14,60,29,82,67,7,19,7,47,33,87,69,21,77,82,55,73,68,43,89,97,50,92,91,33,31,96,13,84,18,86,96,61,74,22,51,4,76,23,97,63,66},{93,33,45,89,72,53,28,7,43,51,64,71,29,49,7,49,65,99,60,75,12,72,97,4,41,41,68,44,47,26,66},{6,37,42,78,68,92}},{{73,76,46,23,86,18,9,70,59,62,16,29,73},{61,96,64,50,73,94,12,57,61},{94,91,84,25,31,11,12,3,44,40,49,47,25,34,98,31},{52,39,9,83,41,89,28,13,32,34,4,24,92,74,70,24,59,42,84,98,35,77,38,58,3,80,35,21,80},{86,91,2,3,3,90,9,69,43,69,63,3,64,81,37,50,57,58},{55,86,11,29,5,8,54,40,67,51,99,37,65,70,6,89,77,95,44,64,27,91,16,12,73,51,43,15,51,44,21,44,4,84},{59,63,28,26,57,36,55,65,66,74,61,39,94,55,37,4,36,36,39,51,92,11,50,87,37,51,53,77,24,77,22,45,92,31,21,99,73,18,72,55,59,76},{63,51,4,58,65,63,19,79,25,31,9,79,67,32,37,34,19,65,24,36,48,75},{12,97,13,26,16,69,64,92,90,72,61,1,40,13,59,1,44,44,70,50},{62,3,60,24,42,25,91,49,8,73,93,22,4,22,67,30,6,58,85,14,63,74,11,12,8,11,95,2,88,98,37,41,87,82,62,62,51},{52,74,28,24,98,78,22,44,90,79,47,99,22,30,28,37,39,91,35,7,57,99},{40,79,99,66,98,1,47,99,10,54,28,79,43,1,74,28,93,95,85,36,44,52,70,58,83,77,29,68,31,77,31,75,69,12,76},{17,55,59,48,74,43,12,36,24,73,94,69,22,20,34,66,44,9,84},{71,66,21,8,26,93,80,30,3,80,35,63,61,43,12,81,79,53,83,5,15,69,26,46,17,4,89,86,68,97,33,48,47},{47,27,37,82,69,28,65,13,74,14,67,81,43,61,75,95,54,45,98,87,5,27,69,6,99,82,55,45,26,58,52,19,97,22,41,24,74,9,27,11,87},{53,94,37,35,74,93,43,72,98,29,72,82,89,92,7,20,70,38,90,55,51,5,72,48,14,98,95,93,65,79,60,31,42,55,51,4},{24,57,83,16,92,22,33,51,80,19,78,68,29,67,99},{80,76,99,52,90,30,67,49,13,57,93,90,44,68,44,48,72,54,98,15,17,34,40,69,1},{67,81,18,33,82,69,42,42,57,88,82,9,9,75,83,87,37,81,15,86,52,24,7,44,58,90,21,70,29,81,82,88,23,2,33,39,5,76,98,85,93,74,11,79,52},{51,76,56,56,63,69,51,29,29,88,33,13,58,52,94,15,6,3,38,52,43,22,78,41,92,50,26,3,86,71,68,76,87,8,25},{98},{6,60,39,44,3,58,75,97,29,49,88,44,92,43,12,5,38,75,57,3,85,16,86,62,16,40,76,37,5,69,16,63,84,78,74,18,4,89,73,67,60,56,10,3,61,64,24}}};
for (int i =0; i < param0.size(); i+=2 )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k]= param0[i][j][k] %2;
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
for (int i =0; i < param0.size(); ++i )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k] %=2;
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( const vector < vector < int > > & m ) { int rows = m . size ( ); if ( rows == 0 ) return false; int columns = m [ 0 ] . size ( ); for ( int y1 = 0; y1 < rows; y1 ++ ) for ( int x1 = 0; x1 < columns; x1 ++ ) if ( m [ y1 ] [ x1 ] == 1 ) for ( int y2 = y1 + 1; y2 < rows; y2 ++ ) for ( int x2 = x1 + 1; x2 < columns; x2 ++ ) if ( m [ y1 ] [ x2 ] == 1 && m [ y2 ] [ x1 ] == 1 && m [MASK] y2 ] [ x2 ] == 1 ) return true; return false; } int y2 = y1 + 1;
y2 < rows;
y2 ++ ) for ( int x2 = x1 + 1;
x2 < columns;
x2 ++ ) if ( m [ y1 ] [ x2 ] == 1 && m [ y2 ] [ x1 ] == 1 && m [ y2 ] [ x2 ] == 1 ) return true;
return false;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<vector<int>>> param0 {{{33,27,56,17,90,10,92},{20,12,1,45,94,64,42,91,5,51},{60,52},{48,98,56,44,78,88},{30,8,22,41,6,79,15,48,92,2,70,66,88,85,42,30},{19,42,69,71,6,97,48,51,68,65,90,99,29,56,53,67,86,38,88,21,33,79,34,12,92,27,44,13,46,70,54,87,57},{60,87,77,22,9,81,52,91,48,25,16,34,64,50,38,30,5,2,52,93,31,62},{75,98,28,32,33,87,3,38,57,38,9,88,68,61,18,34,36,71,44,99,43,25,92,30,20,85,99,78,22,38,25,44,20,50,48,54,63,23},{28,59,16,49,73,43,13,55,80,47,27,5,61,92,86,70,34,26,29,1,75,94,78,41,91,14,74,11,19,35,87,17,89,53,51,83,58,20,77,33,60,46},{47,2,17,93,96,18,41,19,21,94,67,75,15,15,49,24,66,55,71,43,55,13,6,67,23,69,82},{16,43,86,98,37,88,84,29,4,30,46,27,69,96},{82,12,57,2,83,23,57,56,58,23,64,1,19,52,76,78,95},{67,62,56,93,92,72,18,35,16,22,17,36,91,30,91,4,60,41,89,36},{31,19,74,59,39,36,76},{53,5,82,26,51,8,38,42,29,7,1,62,56,51,24,77},{85,53,29,56,58,57,47,49,97,89,13,5},{58,14,40,27,72,44,18,18,10,44,2,19,10,25,6,77,97,47,18,9,39,39,75},{21,67,71,57,23,8,41,82,91,20,9,19,2,17,63,43,28,62,25},{55,16,43,76,15,10,21,14,98,70,48,30,39,18,45,30,58,24,77,76,86,2,78,31},{30,18,24,92,77,2,14,90,13,47,39,3,21,19,16,64},{2,37,34,44,31,30,2,24,1,1,44,81,74,60,50,84,75,86,80,3,1,80,38,14,5,75,79,85,52,49,13,37,57,84,63,37,62,41,96,65,1,50,57,64,20,4,37,82},{42,7,11,6,6,52,84,59,34,24,94,93,15,5,39,51,69,12,54,69,92},{79,31,22,78,67,20,36,9,82,67,80,94,13,26,6,22,1,77,21,89,77,55,27,45,4,30,59,80,98,61,25,13},{1,61,32,35,9,71,95,64,86,22,85,94},{34,80,27,19,82,78,31,40},{20,19,64,24,20,62,76,77,57,39,4},{7,95,29,19,84,97,55,51,62,6,44,19},{22,22,16,81,17,30,59,45,29,17,87,74,45,37,87,91,79,91,46,58},{86,44},{35,80,7,10,80,62,79,81,68,75,30,52,23,45,43,30,81,8},{80,11,14,94,81,44,23,9,54,91,29,85,8,70,69,52},{90,23,44,91,46,50,92,67,80,96,86,12,78,72,5,39,15,11,47,6,53,74,49,2,55,77,51,42,2,43,9,40,8,72,28,55,47,75,39,95,24,71,17},{35,50,89,64,25,88,7,57,49,42,32,97,13,68,47,91,58,78,60,38,28,9,62,11,16,69,67,28,68,19,42,19,98,94,97,34,31,26,61,62,24,20,38,9},{50,74,79,63,28,28,89,10,32,11},{15,59,63,45,86,21,51,55,94,84,6,45,11,49,99,82,80,81,19,32,78,74,4,24,70,21,36,23,70,87,71,75,28,49,30,93,56,23,44,27,49}},{{11,70,30,12,22,41,7,64,33,26,30,14,88,33,23,1,43},{87,64,19,26,58,61,27,52,34,24,81,99,37,43,23,36,20,66,88,49,60,45,96,26,34,88,97,79},{21,75,5,51,12,77,65,3,63,95,50,62,38,73,63,4,25,96,17,22,8,99,33,35,9,67,68,77,60,99,86,54,23,61,25,30,97,70,49,72},{38,97,53,66,52,27,35,1,87,24,59,66,27,31,33,32,63,79,61,30,75,33,19,99,66,93,18,26,81,56,61,68,21,94,37,34,27,12,78,1,49,33,31},{19,83,1,12,42,64,28,87,86,60,98,50,17,13,42,75,38,14,94,7,83,48,52,10,22,99,21,34,97,22,80,4,14,49,7,24,46,86,18,31,69,72,7,68},{68},{32,82,40,71,54,62,66,31,51,47,89,47,38,93,51,51,68,86,63,53,91,26,46,56,59,17,81,54,31,29,86,36,83,20,50,60,48,19,86,18,28,67,70,8},{39,81,48,34,15,68,39,74,40,34,17,32,45,75,25,74,15,43,53,32,1,52,31,13,41,40,45,93,9,15,58,25,34,37,1,52,79,38,96,47,65,87,74,72,78},{33,74,44,12,34,25,32,36,79,54,81,40,55,11,10,55,60,67,21,11,90,13,71,45,71,7,27,97,63,77,59,50,96,70,77,16,95},{18,90,66,27,26,81,78,67,15,82,14},{96,65,67,31,72,58,5,48,56,98,82,53},{61,67,11,63,46,8,93,96,75,79,51,45,78,24},{38,9,58,7,83,62,37,37,10,34},{58,44,72,71,21,24,30,46},{79,31,85,77,58,74,68,66,53,96,53,98,56},{17,69,4,41,83,86,25,97,9,27,71,32,85,78,44,61,3,9,85,87},{24,33,5,13,2,9,76,62,72,46,78,66,36,74,78,21,69,32,52,45,24,70,42,57,99,25,81,37,88,37,33,89,12,82,3,33,40},{9,21},{67,88,29,90,37,28,43,10,48,68,74,23,25,69,22,23,27,85,9,44,48,33,26,42,29,74,85,1,64,56,16},{18,52,35,78,93,48,8,33,61,16,56,98,69,79,50,25,11,8,13,20,96,14,93,10,99,74,28,31},{99,89,29,70,27,71,64,62,35,55,74,59,24,88,91,28,71,53,69,9,56,73,98,62,12,48,52,6,79,19,82,23,15,26,58,12},{12,90,73,78,85,31},{12,63,16,21,18,73,36,81,65,39,11,38,16,85,66,67,7,34,39,91,39,9,11,53},{12,27,23,32,97,4,90,87,68,76,62,73,53,52,72,13,94,83,29,4,61,7,97,72,87,93,17,24,78,56,54,45,61,3,84,69,15},{49,4,97,7,82,25,45,62,44,25,30,99,76,9,49},{31,56,52,48,85,93,40,34,10,77,17,35,16,33,13,81,50,4,57,7,18,25},{20,49,46,44,39,3,9,20,36,28,73,43,96,96,39,81,13,8,11,31,36,93,47,1,89,2,58,76,32,17,15,27},{57,55,81,6,76,78,8,42},{59,1,14,67,27,21,26,88,41,29,62,1,78,3,78,17,26,39,87,23,8,66,72,32,17,67,2,36,45,81,66,90},{96,64,39,49,53,82,88,76,39,26,78,30,99,80,6,45,26,14},{73,92,24,60,43,90,50,40},{77,11,86,37,84},{38,22,88,69,54,28,3,18,89,63,59,73,11,50,65,35,38,73,44,4,49,12,66,63,6,21,20,51,52,57,13,59,56,17,83},{64,71,5,44,58,36,40,82,39,12,63,54,83,27,28,10,3,95,60,39},{26,40,14,91,24,99,1,35,34,8,20,40,64,9,85,66},{92,82,19,88,78,31,92,6,33,81,34,60,55,77,88,79,73,71,44,18,87,39,78,10,36,95,20,97,46},{59,73,4,37,80,51,12,8,46,73,8,42,32,75,54,73,84,73,73,97,83,57,57,19,13,82,36},{50,71,88,31,48,7,72,19,68,2,47,18,87,37,68,97,4,3,63,41,10,70,97,1,9,51,96,99,57,69,74,92,80,38,57},{62,76,16,47,19,77,87,36,40,94,42,22,93,81},{48,10,34,52,24,21,53,26,98,46,37,10,84,13,37,31,51,82,98,13,54,49,83,51,48},{78,88,6,53,91,29,3,50,10,61,64,48,70,3,79,8,82,30,34,48,74,23,42,6,8,49,56,88,22,33,31,49,65,93,18,90,24,75,73,54,63,89,27,36,45}},{{19,66,29,41,66,76,21,58,50,69,77,4,71,60,48,11,43,15,20,54,13,81,55,12,89,66,60,75,95,49,89,43,46,72,33,47,14,60,81,3,4,27},{44},{88,54,94,24,38,7,98,37,64,92,67,28,38,31,5,7,46,52,84,22,95,67,41,91,75,32,31},{30,88,47,79,92,83,11,51,55,83,31,40,28,46,13,91,25,2,96,23,48,40,48,23,6,58,22,56,28,46,24,34,25,99,32,95,59,49,75,31,2,87,6,17},{72,33,96,20,54,9,50,44,13,80,14,15,92,38,10,61,74,36,26,89,92,90,7,81,98,61,97,49,92,30,99,94,27,55,62,57,65,68,41,5,64,8,21},{99,86,38,3,77,73,17,26,98,75,74,28,75,97,34,19,89},{30,13,68,27,79,40,2,72,20,37,94,92,20,15,78,49,21,78,42,16,27,77,52}},{{95,26,62,49,1,3,4,80,39,89,1,81,51,44,58},{30,74,80,21,35,93,35,85,54,2,57,72,25,74,99,20,95,12,77,44,49,40},{14,85,9,46,55,44,52,72,79,25,94,67,34,53,18,88,36,38,48,12,61,38,46,65,31,50,70,49,94,66,83,45,7},{69,92}},{{7,13,48,32,22,86,84,21,41,47,14,68,60,21,75,93,85,79,55,68,75,41,65,91,87,35,14,19,58,65,39,8,72,30,68,54,40,16},{14,55,36,17,17,25,29,57,66,29,79,26},{65,13,10,98,49,65,95,66,34,8,89,84,82,12,27,39,77,50,52,29,72,94,99,4},{31,49,84,24,51,9,49,16,94,37,56,31,94,55,66,31},{83,34,96,28,43,55,30,92,44,47,33,96,56,43,76,49,21,8,35,27,26,46,51,93,24,1,64,26,96,58,61,5,4,31,17},{96,50,67,33,52,15,37,87,80,53,48,19,48,7,20,31,45,75},{16,68,99,53,61,34,32,41,56,30,24,34,97,86,69,50,59,73,74,69,10,95,34,58,48,72,84,9,47,89,72,78,35,41,56,80,16,14,65,65,42,24,19,75,86,63,37,1,56},{41,99},{53,98,10,55,55,74,62,49,23}},{{36,25,6,99,30,98,86,41,36,15,59,42,46,93,32,96,15,29,82,37,21,11,71,95},{97,70,80,9,66,26,54,38,49},{32,85,11,16,9,2,21,47,51,62,7,83,54,92,99},{19,49,52},{42,26,11,8,11,82,33,67,6,58,98,52,79,63,57},{45,44,62,78,72,94,61,66,1,32,43,25,48,73,72,45,33,61,95,72,15,94,40,27,77,59,11,35,55,74,75,6,96,65,93,80,45,29,75,68,49,60,39,12,66,40,42},{88,41,78,96,40,25,60,42,85,95,86,13,13,36,13,80,30,99,36,89,45,20,93,26,94,95,36,74,62,93},{1,84,16,27,20,3,96,6,84,35,88,87,96,28,40,15},{63,60,38,11,62,87,8,9,57,29,66,97,42,10,66,94,79,99,36,61,47,90,2,12,69,89,63,83,96,67,4,95},{88,12,39,91,62,89,69,31,29,59,12,28,38,11,46,95},{1},{23,26,8,83,78,8,59,93,38,70,8,53,71,17,67,37,99,96,82,88,83,96,59,89,35,99,5,32,13,2,70,41,44,25,37,61,35,46,1,84,78,1,93,6,28,51,49,79,41},{88},{94,90,57,31,11,93,92,72,78,7,70,70,16,78,14,5,93,80,7,6,8,98,90,39,10,27,59,79,99,9,27,92,22,29,72,32,14,42,61,95,95,20},{47,78,29,28,95,78,13,48,39,20,15,94,24,21,85,15,5,78,38,57,13,50,51,94,98,34,73,23,6,98,88,4,82,95,44,59,21,8,71,30,44,2,42,37,49,93,43,13},{58,43,75,30,27,69,1,6,95,67,54,7,54,8,47,76,59,75,90,69,33,75,85,3,15,38,93,32,72,35,26,43,12},{46,83,6,14,71,94,4,82,62,60,91,16,56,54,79,82,21,2,36,50,87,3,77},{46,92,33,68,88,34,19,3,84,56,54,95,14,77,92,69,45,21,28,57,31,5,99,17,57,22,75,65,58,96,91,97,56,4,26,48,92,90,32,74,45,41},{76,18,56,96,24,77,50,56,82,81,21,44,9,23,79},{65,10,78,19,37,77,26,12,11,87,33,11,33,4,70,55,45,5,89,36,82,52,71,8,8,99,49,79,81,63,81,40,1},{33,39,45,37,35,30,77,35,82,3,95,95,92,47,17,80,85,5,98,94,58,50,67,69,49,75,6,33,87,1,8,34,67,47,77,16,31,1,85,36,10,69,38,85,74,27,68,89,81},{84,65,8,68,67,50,95,63,82,74,15,23},{83,80,38,10,81,7,98,74,99,28,83,28,32,73,57,3,58,99,91,87,4,77,29,70,67,68,58,34,65,5,40,77,68,68,97,4,44},{21,9,42,33,60,19,12,34,2,86,17,71,69,21,70,74,82,82,56,23,67},{40,35,52,70,26,77,34,73,94,38,73,17,11,20},{25,63,66,86,25,5,3,65,14,46,42},{43,33,99,51,18,69,11},{96,26,41,60,74,6,2,8,58,98,34,75,78,43,42,65,65,55,97,91,38,9,43,12,46,32,14,86,69,48},{72,30,96,85,98,65,18,56,87,30,25,33,95,10,61,30,60,23,60,16,47,87,37,88,21,19},{50,40,70,94,42,49,87,37,74,43,51,77,27,4,52,73,1,68,78,67,90,6,71,63,90,35,86,76,68,79,57,45,27,29,1,75,60,29,1,66,74},{79,49,53,14,41,85,96,98,32,94,50,74,11,32,37,58,32,79,24,55,29,54,90,78,76,11,4,94,68},{76,58,2,68,78,6,13,58,6,48}},{{57,64,14,43,52,77,97,18,3,79,44,66,11,35,18,48,57},{86,90,14,56,73,83,6,42,30,37,50,48,18,35,86,29,72,57,23,65,69,14,57,54,40,54,26,92,66,85,87,10,55,30,54,43,5,46,63,64},{22,4,3,49,18,86,34,79,89,5,72,8,33,25,89,2,91,61,18,2,33,40,31,40,40,39,53,81,12,59,85,43,35},{59,9,89,87,75,3,25,94},{12,24,74,40,84,44,23,24,76,63,11,23,46,70,55,74,60,61,70,28,4,7,80,84,33,99,55,6,88,63,19,54,23,32,15,7,74,36,21,85,88,30},{27,92,34,86,22,20,3,1,90,78,69,7,45,13,63,40,94,54,3,41,74,47,65,15,2,76,29,52,46,94,21,69,11,24},{98,83,78,29,95,2,75,70,89,11,35,89,7,64,6,80,21,79,62,8,44,24,46,30,52,56,31,36,23,88,14,3,2,16,12,90},{96,81,1,36,86,5,88,13,32,50,22,7,46,8,34,46,92,46,95,6,17,35},{69,41,27,54,96},{59},{2,78,98,45,39,88,2,41,92,83,32,81,57,49,24,22},{64,13,96,53,72,82,4,57,37,89,16,96,9,83,87,52,9,7,86},{63,17,29},{79,30,42,4,41,31,69,2,13,38},{40,81,16,26,91,29,37,75,99,81,47,55,63,96,98,15,4,90,53,65,79,53,68,36,21,52,80,30},{5,60,40,57,16,25,95,59,68,37,58,82,28,79,16,4,12},{38,82,85,42,23,36,63,80,84,3,65,16},{20,45,4,47,88,66,62,84,69,77,34,95,7,79,4,12,9,8,28,55,36,42,96,23,35,92,49,71,33,19,46,91},{94,29,68,9,55,89,85,4,64,69,18,21,30,97,39,61,69,85,53,45,52,62,56,58,22,70,39,95,32,68,81,42,90,50,89,18,45,78,78,3,74,50,20,11},{66,11,7,37,6,57,16,50,58,9,21,14,73,73,90,6,7,88,3,4,96,11,54,84,38,28,41},{1},{6,28,27,52,59,13,62,14,31,32},{59,68,76,71,24,89,30,26,66,45,88,52,72,7,52,66,79,26,96,59,52},{54,41,50,4},{80,98,4,65,77,86,43,27,13,39,4,94,96,92,13,51,24,19,6,6,85,89,62,44,11,59,55,52,60,37,15,61,59,51,21,86,93,48,68,21,62,35,80,85,35,23},{7,34,53,84,9,35,55,79,15,38,85,43,50,80,29,48,87,67,8,2,96,19,11,75,26,13,91,34,37,68,67,18,24,43,5,41},{35,53,64,42,80,51,83,91,75,40,31,25,67,71,25,61,63,60,55,75,33,64,66,41,93,22,35,60,63,59,82,20,60,57,5,4,7,43,14,50,73,94,63,52,29,48,9,19},{7,13,41,22,63,48,32,49,8,25,15,37,56,24,78},{58,45,33,18,33,48,50,64,65,74,98,78,9,48,70,5,71,63,89,38,57,84,94,40,23,34,34,98,85,61,13,38,92,98,15,64,56,23,91,9,50,18,18,83,72,94,10,71,9},{13,39,36,80,40,81,12,27,85,91,5,51,90,65,2,72,5,85,29,55,91,75,8,91,81,10,15,31,3,73,23,88,18},{46,65,69,68,42,57,88,3,7,17,66,83,46},{99,15,31,56,63,6},{96,39,93,78,2,12,66,76,5,16,56,63,55,74,54,98,7,45,53,4,6,66,6,68,14,2,87,50,94,43,39,58,21,4,55,14,49,59,62},{19,96,21,54,61,88,11,79,75,71,56,57,12,36,44,43,84,95,92,80,51,9,36,6,11,78,63,94,75,80,5,84,14,44,86,82,69,23,47},{34,45,44,41},{39,23,58,48,32,92,36,32,24,18,22,1,9,2,83,37,19,91,60,81,79,25,68,9,12,26},{44,92,92,12,71,22,94,98,34,62,7,97,97,97,60,51,13,41,35,75,97,21,30,61,41,70,82,7,31,66,5,40,62,25,69,31},{96,1},{1,65},{30,59,74,49,14,90,88,38,91,36,4,44,28,71,59,25,97,79,93,10,7,73,73,37,37,57,71,61,79,62,84,57,39,53,36,49,7,77,47,54,92,53,96,46,69,39,45,94,67},{19,93,99,75,96,15},{86,97,1,75,11,45,22,59,96,14,62,39,33,3,62,41,39,18,24,3,34,50,81,39,73,81,37,53,54,94,26,94,6,2,96,19,7,48,58,53,3,24,40,60,76},{73,4,8,42,10,24,84,69},{42,2,49,32,11,68,26,90,23,2,62,49},{98,3,84,46,32,87,25,52,79,56,9,9,72,50,23,50},{92,71,50,10,78,29,48,9,16,54,12,87,50,80,27,36,7,69,56,45,72,27,77,95,96,49}},{{84,47,93,51},{97,74,57,83,5,70,92,1,11,2,8,57,81},{76,66,34,36,74,51,30,35,76,48,3,88,26,27,37,86,2,53,26,52,65,99,23,77,13,58,6,40,26,62,83,59,24,95,54,24,63,58,32,71,60,15,75,29,37,29,4},{71,18,87,98,77,23,80,15},{28,42,8,9,21,65,70,98,10,16,1,77,5,70,57,90,92,43,94,12,93,8,97,6,84,32,59,92,4,34,45,40,25,73,25,92,72,71,87,92,88,44,30,38,78},{93,6,77,55},{29,89,30,59,86,80,20},{6,31,25,81,75,64,79,37,56,30,71,4,86,53,31,81,56,86,36,76,30,96,19,99,3,15,4,82,87,7,35,55,10,3,52,19,2,1,4,80,32},{31,43,73,35,53},{77,93,1,13,82,55,74,3,77,19,23,30,73,24,74,68,99,60,5,65,53,9,33,73,73,76,62,40,28,44,14,25,38,97,99,37,90,48,41,99,70,77},{70,6,5,28,81,26,11,36,26,1,65,51,56,62,35,14,80,19,58,86,48,48,90,71,38,3,40,42,26},{8,13,98,48,25,57,55,61,44,83,6,86,22,88},{23,83,44,7,90,99,7,21,47,55},{47,92,94,44,92,99,28,96,94,51,23,33,27,7,99,30,49,87,31,79,95,13,7,22,93,60,96,61,90,57,23,84,69,60,17,29,77},{26,62,80,46,59,9,81,99,21,68,12,1,73,40,35,87,64,94,31,51,88,26},{9,95,69,50,63,28,83,12,81,57,16,22,23,97,36,78,91,5,50,21,1,14,92,10,62,19,30,82,81,84,41,40,78,88,68,27,4,78,61,99,8,67,82,58,38,42,64,43,29},{22,93,76,24,74,65,56,33,91,89,16,70,33,7,98,46,82,32,26,2,34,27,67,85,66,82,20,8},{63,98,27,78,7,32,13,25,58,5,46,10,30,47,79,65,33,84,60,95,18,79,69,20,36,43,13,20,72,30,32,94,59,8,70,7,54,18,50,56,65,61,70,3},{23,26,33,14,79,93,32,58,80,76,40,2,55},{48,40,9,29},{89,96,17,74,98,15,1,46,38,55,90,20,85,93,91,22,54},{72,14,76,72,64,61,27,93,87,63,55,95,32,66,19,74,34},{52,25,67,46,11,1,47,54,86,72,24,46,92,17,23,31,46,53,63,74,22,8,64,54,88,4,9,39,3,56,17,15,13,41,44,49,64},{53,42,4,10},{29,46,14,53,84,80,65,84,79,74,54,18,1,95,48,36,2,44,84,76,22,33,60,20,6,14,42,26,60,42,89,62,76,20,40,66,2,81,92,29,27,6,9,63,96,31,14},{18,81,90,96,76,61,26,17,22,24,42,66,98,17,65,80,23,65,77,90,47,56,17,3,15,51,14},{39,13,16,88,62,59,78}},{{94,44,83,3,47,11,36,61,29,34,43,94,79,3},{35,91,27,32,31,95,89,92,86,26,9,30,64,56,73,85,39,14,97,77,29,89,59,16,20,53,89,87,3,77,77,69,36,24,52,52,65,41,94,4,85,38,70,76,26,92,92,23,34},{80,40,74,57,81,40,53,27,82,44,51,91,42,31,55,79,52,66,53,27,23,24,53,72,58,11,23,82,67,41,88,84,95,78,76,73},{72,93,81,5,86,85,55,44,69,70,60,61,52,1,95,4,70,44,68,93,64,12,95,21,4,54,19,74,39,36,74,4,82,33,30,76,32,59,78,56,56,96,44,7,64,83,95},{36,69,97,32,86,60,10,45,74,25,74,72,73,56,46,71,51,95,31,95,97,95,40,64,15,63,78,63,72,23,71,19,57,51,7,27,50,58,31,6,90,41,70},{83,15,4,37,90,29,28,42,8,85,91,2,16,4,76,34,67,67,11,6,28,40,73,32,53,35,52,92,34,15,71,4,86,27,95,15,74,85,74,25,9,72,80,74,45,81,62},{90,54,30,4,42,25,99,8,74,27,77,35,91,8,17,28,39,83,62,90,49,18,94,38},{99,81,47,87,32,25,26,32,93,93,20,74,5,43,8,41,40,9,6,36,63,26,77},{3,73,96,98,94,41,51,93,75,93,93,31,26,11,26,29,83,77,23,84,13,58,62,31,22,83,14,70,45,89,63,82,74,80,73,58},{11,52},{52,49,6,36,12,79,79,89,58,21,43,21,32,15,68,46,43,11,37,71,58,59,50,28,66},{11,79,89,58,33,23,75,50,73,44,76},{89,9,37,14,7,43,93,70,46,79,58,85,22},{4,10,22,46,13,41,56,37,39,58,87,19,15,88,33,46,13,67,84,9,13,16,58,82,79,77,84,79,39,98,53,84,19,9,93,30,6,82,8,43,17},{62,21,34,86,98,44,81,14,82,54,44,53,36,33,2,68,19,37,60,68,6,31,44,52,95,78,24,20,56,58,11,31,61,79,84,20,35,53,79,60,18,30,43,90},{6,16,42,48,89,31,13,89,14,73,44,91,12,1,36,34,94,86,86,82,45,99,38,2,1,76,26,90,30,61,21,43,26,6,44,98,69,41,48,40,90,76,61,17,81,74,92,54,16},{15,8,16,84,86,34,34,75,92,67,54},{19,31,62,89,26,96,91,32,78,42,84,66,79,29,48,49,5,70,2,71,36,90,70,86,80,28,71,77,3},{17,5,88,70,37},{17,76,71,38,5,87,77,36,76,29,14,36,18,80,23,39},{21,37,68,55,90,49,24,88,13,97,97,61,71,29,89,75,98},{73,87,99,92,49,12,74,59,64,19,89,53,12,44,73,81,57,88,72,37,4,56,81,14,29,81,84,98,98,60,75,98,86,51,88},{35,7,98,35,89,39,27,69,30},{23},{91,65,2,73,12,91,47,14,48,1,69,95,81,59,36,79,35,9},{54,25,8,41,64,96,84,47,85},{68,54,56,89,25,27,83,2,24,87,86,4,96,29,69,93,32,2,22,75,28,44,81,49,13,26,67,78,55,39,33,5,62,95,80,95,78,34,36,30,98,99},{96,64,38,15,13,52,35,51,58,8,62,66,33,36,70,75,5,34,54,8,27,99,3,26,47,1,61,75},{85,51,48,48,79,4,61,32,30,94,40,65,7,86,75,27,89,47,19,99,55,96,24,70,37,27,26,47,33,81,36,13,14,39,90,92,54,93,83,93,67,35,47,75,54},{17,66,58,44,36,32,93,79,30,62,88,4,94,41,56,74,27,11,91,2,95,11,44,93,51,31,68,95,71,44,41,81,69,38,28,13,73,7,63,8,89,14,35},{82,91,99,3,24,5,56,84,15,51,33,55,78,52,19,32,36,81,73,34,57,45,79,36,13,73,39,79,43,50,3,73,70,30,3,88},{2,3,98,55,1,88,84,56,66,26,36,29,51,1,35,48,93,99,73,93,68,89,97,51,35,6,38,30,84,9,1,92,10,67,42,99},{92},{50,66,97,64,10,81,14,33,2,75,7,68,82,82,40,2,45,70,6,92,74,58,53,51,73,22,99,5,7,68,2,26,95,4,47,27,18,90,89,14,9},{80,61,92,13,68,82,89,28,7,35},{69,15,28,27,60,79,20},{38,31,3,33,58,82,75,73,67,42,42,76,23,15,81,82,16,63,71,68,44,26,78,31,48,15,65,65,51,37,49,16,68,61,93,13,59,23,34,84},{62,63,60,5,95,90,78,58,87,37,26,13,55,81,30,19,80,82,4,24},{8,11,45},{64,21,66,1,72,10,36,85,24,90,27,68,81,63,46,91,3,81,83,44,33,67,72,31,96},{12,84,24,51,57,17,46,58,74,28,82,85,64,23,31,77,23,97,34,56,90,47,36},{76,18,75,5,93,67,79,43,73,16,46,19,19,54,38,56,99,60,88,31,48},{88,10,77,8,66,37,46,51,95,71,43,78,24,14,78,9,88,76,33,27,58},{37,14,60,29,82,67,7,19,7,47,33,87,69,21,77,82,55,73,68,43,89,97,50,92,91,33,31,96,13,84,18,86,96,61,74,22,51,4,76,23,97,63,66},{93,33,45,89,72,53,28,7,43,51,64,71,29,49,7,49,65,99,60,75,12,72,97,4,41,41,68,44,47,26,66},{6,37,42,78,68,92}},{{73,76,46,23,86,18,9,70,59,62,16,29,73},{61,96,64,50,73,94,12,57,61},{94,91,84,25,31,11,12,3,44,40,49,47,25,34,98,31},{52,39,9,83,41,89,28,13,32,34,4,24,92,74,70,24,59,42,84,98,35,77,38,58,3,80,35,21,80},{86,91,2,3,3,90,9,69,43,69,63,3,64,81,37,50,57,58},{55,86,11,29,5,8,54,40,67,51,99,37,65,70,6,89,77,95,44,64,27,91,16,12,73,51,43,15,51,44,21,44,4,84},{59,63,28,26,57,36,55,65,66,74,61,39,94,55,37,4,36,36,39,51,92,11,50,87,37,51,53,77,24,77,22,45,92,31,21,99,73,18,72,55,59,76},{63,51,4,58,65,63,19,79,25,31,9,79,67,32,37,34,19,65,24,36,48,75},{12,97,13,26,16,69,64,92,90,72,61,1,40,13,59,1,44,44,70,50},{62,3,60,24,42,25,91,49,8,73,93,22,4,22,67,30,6,58,85,14,63,74,11,12,8,11,95,2,88,98,37,41,87,82,62,62,51},{52,74,28,24,98,78,22,44,90,79,47,99,22,30,28,37,39,91,35,7,57,99},{40,79,99,66,98,1,47,99,10,54,28,79,43,1,74,28,93,95,85,36,44,52,70,58,83,77,29,68,31,77,31,75,69,12,76},{17,55,59,48,74,43,12,36,24,73,94,69,22,20,34,66,44,9,84},{71,66,21,8,26,93,80,30,3,80,35,63,61,43,12,81,79,53,83,5,15,69,26,46,17,4,89,86,68,97,33,48,47},{47,27,37,82,69,28,65,13,74,14,67,81,43,61,75,95,54,45,98,87,5,27,69,6,99,82,55,45,26,58,52,19,97,22,41,24,74,9,27,11,87},{53,94,37,35,74,93,43,72,98,29,72,82,89,92,7,20,70,38,90,55,51,5,72,48,14,98,95,93,65,79,60,31,42,55,51,4},{24,57,83,16,92,22,33,51,80,19,78,68,29,67,99},{80,76,99,52,90,30,67,49,13,57,93,90,44,68,44,48,72,54,98,15,17,34,40,69,1},{67,81,18,33,82,69,42,42,57,88,82,9,9,75,83,87,37,81,15,86,52,24,7,44,58,90,21,70,29,81,82,88,23,2,33,39,5,76,98,85,93,74,11,79,52},{51,76,56,56,63,69,51,29,29,88,33,13,58,52,94,15,6,3,38,52,43,22,78,41,92,50,26,3,86,71,68,76,87,8,25},{98},{6,60,39,44,3,58,75,97,29,49,88,44,92,43,12,5,38,75,57,3,85,16,86,62,16,40,76,37,5,69,16,63,84,78,74,18,4,89,73,67,60,56,10,3,61,64,24}}};
for (int i =0; i < param0.size(); i+=2 )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k]= param0[i][j][k] %2;
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
for (int i =0; i < param0.size(); ++i )
for (int j =0; j < param0[i].size(); ++j )
for (int k =0; k < param0[i][j].size(); ++k )
param0[i][j][k] %=2;
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) =",
"b) [",
"c) sum",
"d) int",
"e) const"
] | 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 ) {
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
de <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,15,15,15,16,17,23,23,33,33,40,43,55,56,63,66,69,76,79,88,99},{78,-64,-20,12,96,54,16,50,-20,96,-22,-84,54,-66,-16,-78,-78,90,-46,-70,-72,12,96,-86,42,-80,8,-2,70,4,70},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{73,60,4,59,75,39,39,30,66,11,90,80,46,59,52,14,63,70,75,73,65,88,45,64,66,91,67,25,60,74,33,23,94,76,60,78,72},{-92,-88,-68,-64,-62,-56,-50,-48,-48,-38,-18,-16,-14,-8,-8,2,4,10,10,10,36,38,46,50,52,62,72,74,80,84,86,90,92,94,96},{1,0,0,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,0,0,0,1,0,0,1,1,0,1,0,0},{7,8,8,10,13,18,18,19,20,25,32,33,34,38,44,44,46,46,46,47,48,50,53,56,56,57,57,57,57,59,60,61,63,63,64,70,71,74,74,81,82,83,84,90,92,93},{-82,74,-94,68,-10,-8,-46,-4,50,-60,-70,-74,-18,50,62,-76,-50,-58,-36,-16,-36,78,12,56,-14,-48,40,22,0,16,72,-78,46,8,-50,-78,28,20,-56},{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,89,66,28,75,81,29,26,21,39,58,94,48,85}};
vector<int> param1 {20,17,12,20,33,33,41,26,16,9};
vector<int> param2 {15,29,17,28,20,26,44,31,18,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int [MASK] ( int arr [ ], int n, int x ) { for ( int i = 0; i < n; i ++ ) { if ( arr [ i ] == x ) return i; } return - 1; }de <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int x ) {
for ( int i = 0;
i < n;
i ++ ) {
if ( arr [ i ] == x ) return i;
}
return - 1;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,15,15,15,16,17,23,23,33,33,40,43,55,56,63,66,69,76,79,88,99},{78,-64,-20,12,96,54,16,50,-20,96,-22,-84,54,-66,-16,-78,-78,90,-46,-70,-72,12,96,-86,42,-80,8,-2,70,4,70},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{73,60,4,59,75,39,39,30,66,11,90,80,46,59,52,14,63,70,75,73,65,88,45,64,66,91,67,25,60,74,33,23,94,76,60,78,72},{-92,-88,-68,-64,-62,-56,-50,-48,-48,-38,-18,-16,-14,-8,-8,2,4,10,10,10,36,38,46,50,52,62,72,74,80,84,86,90,92,94,96},{1,0,0,1,1,0,0,0,1,1,1,0,0,1,0,1,1,0,1,0,1,0,1,0,1,1,0,0,0,0,1,0,0,1,1,0,1,0,0},{7,8,8,10,13,18,18,19,20,25,32,33,34,38,44,44,46,46,46,47,48,50,53,56,56,57,57,57,57,59,60,61,63,63,64,70,71,74,74,81,82,83,84,90,92,93},{-82,74,-94,68,-10,-8,-46,-4,50,-60,-70,-74,-18,50,62,-76,-50,-58,-36,-16,-36,78,12,56,-14,-48,40,22,0,16,72,-78,46,8,-50,-78,28,20,-56},{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,89,66,28,75,81,29,26,21,39,58,94,48,85}};
vector<int> param1 {20,17,12,20,33,33,41,26,16,9};
vector<int> param2 {15,29,17,28,20,26,44,31,18,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | f_gold | [
"a) f_gold",
"b) true",
"c) while",
"d) [",
"e) ("
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int val [ ], int wt [ ], int n, int W ) {
int mat [ 2 ] [ W + 1 ];
memset ( mat, 0, sizeof ( mat ) );
int i = 0;
while ( i < n ) {
int j = 0;
if ( i % 2 != 0 ) {
while ( ++ j <= W ) {
if ( wt [ i ] <= j ) mat [ 1 ] [ j ] = max ( val [ i ] + mat [ 0 ] [ j - wt [ i ] ], mat [ 0 ] [ j ] );
else mat [ 1 ] [ j ] = mat [ 0 ] [ j ];
}
}
else {
while ( ++ j <= W ) {
if ( wt [ i ] <= j ) mat [ 0 ] [ j ] = max ( val [ i ] + mat [ 1 ] [ j - wt [ i ] ], mat [ 1 ] [ j ] );
else mat [ 0 ] [ j ] = mat [ 1 ] [ j ];
}
}
i ++;
}
return ( n % 2 != 0 ) ? mat [ 0 ] [ W ] : mat [ 1 ] [ W ];
}
al [ i ] + mat [ 1 ] [ j - wt [ i ] ], mat [ 1 ] [ j ] );
else mat [ 0 ] [ j ] = mat [ 1 ] [ j ];
}
}
i ++;
}
return ( n % 2 != 0 ) ? mat [ 0 ] [ W ] : mat [ 1 ] [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,3,4,5,6,6,11,13,14,16,18,21,22,22,27,28,32,34,34,37,42,42,48,49,50,53,58,59,60,60,61,65,66,70,74,80,81,81,81,86,90,92,93,93,94,97,99},{82,-18,-62,-4,6,10,22,-36,-8,84,-28,-64,48,92,-64,-76,44,94,-8,10,-24,56,-96,-82,-90,96,-62,42,-22,-16,-66,26,80,-8,82},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{3,65,15,84,86,34,50,33,73,3,2,4,16,54,33,9,57,40,52,82,16,8,87,60,36,3,15,97,82,23,3,30,45,17,58,58,96,57,7,39,78,58,56,15,44,12,8},{-56,-14,20,60,92},{0,0,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,0,1,1,1,1,0,1,0,1,0,1,0,1,1,0,1,1,1,1,0,1,0,0,0,0,1,1,0,1,1,0,0},{11,12,13,18,25,27,35,35,36,55,57,58,58,61,63,67,72,76,81,87,89,97},{-68,90,86,40,86,92,46,-26,6,74,-68,-64,-62,-12,-96,16,-80,52,-8,64,-62,-24,-26,82,56,-10,-32,-96,-12,94,66,-46,-4,88,-86,-46,70},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,47,85,1,45,54,50,79}};
vector<vector<int>> param1 {{2,2,2,3,5,7,8,9,17,20,20,26,27,32,35,42,42,48,49,49,51,60,61,62,63,66,68,71,76,76,76,78,81,83,83,85,85,86,87,88,88,89,89,89,89,92,96,98},{84,-60,40,-84,92,-62,-36,-62,-52,-52,12,62,-64,-76,-18,74,-4,64,28,-68,60,-54,72,-22,-34,-52,22,10,22,68,94,90,-20,16,44},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{80,41,34,46,88,29,16,5,5,30,50,5,13,99,49,89,50,14,46,90,82,84,34,71,47,60,74,79,81,11,98,91,85,95,50,4,41,59,60,81,62,84,25,87,79,33,19},{-74,-48,-36,-24,62},{0,1,0,0,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,1},{6,11,18,20,22,25,39,42,45,48,55,67,70,74,74,77,78,81,89,91,93,94},{42,78,-64,-34,-34,92,-50,-72,-24,-24,-92,24,64,-80,-30,98,-54,78,30,64,58,-50,92,6,68,-66,14,50,54,78,-60,-50,-16,-10,-38,30,4},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{7,63,15,89,67,30,78,68}};
vector<int> param2 {34,26,13,37,2,39,14,33,18,7};
vector<int> param3 {33,17,14,31,2,28,20,33,24,6};
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 mat [ 2 ] [ W + 1 ]; memset ( mat, 0, sizeof ( mat ) ); int i = 0; while ( i < n ) { int j = 0; if ( i % 2 != 0 ) { while ( ++ j <= W ) { if ( wt [ i ] <= j ) mat [ 1 ] [ j ] = max ( val [ i ] + mat [ 0 ] [ j - wt [ i ] [MASK] mat [ 0 ] [ j ] ); else mat [ 1 ] [ j ] = mat [ 0 ] [ j ]; } } else { while ( ++ j <= W ) { if ( wt [ i ] <= j ) mat [ 0 ] [ j ] = max ( val [ i ] + mat [ 1 ] [ j - wt [ i ] ], mat [ 1 ] [ j ] ); else mat [ 0 ] [ j ] = mat [ 1 ] [ j ]; } } i ++; } return ( n % 2 != 0 ) ? mat [ 0 ] [ W ] : mat [ 1 ] [ W ]; }al [ i ] + mat [ 1 ] [ j - wt [ i ] ], mat [ 1 ] [ j ] );
else mat [ 0 ] [ j ] = mat [ 1 ] [ j ];
}
}
i ++;
}
return ( n % 2 != 0 ) ? mat [ 0 ] [ W ] : mat [ 1 ] [ W ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,1,3,4,5,6,6,11,13,14,16,18,21,22,22,27,28,32,34,34,37,42,42,48,49,50,53,58,59,60,60,61,65,66,70,74,80,81,81,81,86,90,92,93,93,94,97,99},{82,-18,-62,-4,6,10,22,-36,-8,84,-28,-64,48,92,-64,-76,44,94,-8,10,-24,56,-96,-82,-90,96,-62,42,-22,-16,-66,26,80,-8,82},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{3,65,15,84,86,34,50,33,73,3,2,4,16,54,33,9,57,40,52,82,16,8,87,60,36,3,15,97,82,23,3,30,45,17,58,58,96,57,7,39,78,58,56,15,44,12,8},{-56,-14,20,60,92},{0,0,0,0,0,1,1,0,1,1,0,0,1,0,1,0,1,0,1,1,1,1,0,1,0,1,0,1,0,1,1,0,1,1,1,1,0,1,0,0,0,0,1,1,0,1,1,0,0},{11,12,13,18,25,27,35,35,36,55,57,58,58,61,63,67,72,76,81,87,89,97},{-68,90,86,40,86,92,46,-26,6,74,-68,-64,-62,-12,-96,16,-80,52,-8,64,-62,-24,-26,82,56,-10,-32,-96,-12,94,66,-46,-4,88,-86,-46,70},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{3,47,85,1,45,54,50,79}};
vector<vector<int>> param1 {{2,2,2,3,5,7,8,9,17,20,20,26,27,32,35,42,42,48,49,49,51,60,61,62,63,66,68,71,76,76,76,78,81,83,83,85,85,86,87,88,88,89,89,89,89,92,96,98},{84,-60,40,-84,92,-62,-36,-62,-52,-52,12,62,-64,-76,-18,74,-4,64,28,-68,60,-54,72,-22,-34,-52,22,10,22,68,94,90,-20,16,44},{0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{80,41,34,46,88,29,16,5,5,30,50,5,13,99,49,89,50,14,46,90,82,84,34,71,47,60,74,79,81,11,98,91,85,95,50,4,41,59,60,81,62,84,25,87,79,33,19},{-74,-48,-36,-24,62},{0,1,0,0,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,0,1,0,0,1,0,0,1,1,0,1,0,0,0,1,1,0,0,0,1,0,1,0,0,0,0,1,1,1,1},{6,11,18,20,22,25,39,42,45,48,55,67,70,74,74,77,78,81,89,91,93,94},{42,78,-64,-34,-34,92,-50,-72,-24,-24,-92,24,64,-80,-30,98,-54,78,30,64,58,-50,92,6,68,-66,14,50,54,78,-60,-50,-16,-10,-38,30,4},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{7,63,15,89,67,30,78,68}};
vector<int> param2 {34,26,13,37,2,39,14,33,18,7};
vector<int> param3 {33,17,14,31,2,28,20,33,24,6};
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) )",
"c) =",
"d) (",
"e) n"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, int k ) {
int p = pow ( a, b );
int count = 0;
while ( p > 0 && count < k ) {
int rem = p % 10;
count ++;
if ( count == k ) return rem;
p = p / 10;
}
return 0;
}
, int b, int k ) {
int p = pow ( a, b );
int count = 0;
while ( p > 0 && count < k ) {
int rem = p % 10;
count ++;
if ( count == k ) return rem;
p = p / 10;
}
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,41,5,1,24,5,66,7,77,60};
vector<int> param1 {2,3,4,2,1,2,5,10,30,50};
vector<int> param2 {1,0,3,4,5,3,8,3,10,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a, int b, int k ) { int p = pow ( a, b ); int count = 0; while ( p > 0 && count < k ) { int rem = p % 10; count ++; if ( [MASK] == k ) return rem; p = p / 10; } return 0; }, int b, int k ) {
int p = pow ( a, b );
int count = 0;
while ( p > 0 && count < k ) {
int rem = p % 10;
count ++;
if ( count == k ) return rem;
p = p / 10;
}
return 0;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {11,41,5,1,24,5,66,7,77,60};
vector<int> param1 {2,3,4,2,1,2,5,10,30,50};
vector<int> param2 {1,0,3,4,5,3,8,3,10,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
}
| count | [
"a) 1",
"b) import",
"c) count",
"d) j",
"e) public"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int sum = 0;
unordered_set < int > s;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
sum += arr [ i ];
s . insert ( arr [ i ] );
}
}
return sum;
}
unordered_set < int > s;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
sum += arr [ i ];
s . insert ( arr [ i ] );
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,6,8,10,21,22,27,32,35,36,43,44,46,48,49,55,60,61,69,69,71,72,73,78,88,94},{80,94,16,-74,32,-64,-84,-66,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,4,96,39,39,24,15,47,25,74,7,98,88,91,62,12,31,14,48,26,37,25,11,32,34,64,72,5,80,86,6},{-86,-84,-84,-78,-78,-76,-74,-68,-66,-64,-60,-60,-56,-50,-42,-42,-38,-34,-32,-22,-16,-14,-10,-6,-6,4,4,26,36,36,54,62,64,68,70,76,76,76,84,92,92,94,96},{1,1,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,0,0,0,1,0,0,0,1},{3,3,5,8,32,33,35,35,42,48,67,71,71,74,77,80,94,96,96,97},{-50,-18,-66,76,-54,96,98,26,42,64,-60},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{70,21,44,82,62,41,86}};
vector<int> param1 {24,6,27,15,27,25,19,9,15,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int sum = 0; unordered_set < int > s; for ( int i = 0; i < n; i ++ ) { if ( s . find ( [MASK] [ i ] ) == s . end ( ) ) { sum += arr [ i ]; s . insert ( arr [ i ] ); } } return sum; }unordered_set < int > s;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . find ( arr [ i ] ) == s . end ( ) ) {
sum += arr [ i ];
s . insert ( arr [ i ] );
}
}
return sum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,6,8,10,21,22,27,32,35,36,43,44,46,48,49,55,60,61,69,69,71,72,73,78,88,94},{80,94,16,-74,32,-64,-84,-66,-10},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{99,4,96,39,39,24,15,47,25,74,7,98,88,91,62,12,31,14,48,26,37,25,11,32,34,64,72,5,80,86,6},{-86,-84,-84,-78,-78,-76,-74,-68,-66,-64,-60,-60,-56,-50,-42,-42,-38,-34,-32,-22,-16,-14,-10,-6,-6,4,4,26,36,36,54,62,64,68,70,76,76,76,84,92,92,94,96},{1,1,1,0,0,0,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,0,0,0,1,0,0,0,1},{3,3,5,8,32,33,35,35,42,48,67,71,71,74,77,80,94,96,96,97},{-50,-18,-66,76,-54,96,98,26,42,64,-60},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{70,21,44,82,62,41,86}};
vector<int> param1 {24,6,27,15,27,25,19,9,15,3};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | arr | [
"a) (",
"b) )",
"c) k",
"d) n;",
"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 ( string a, string b ) {
int n = a . size ( ), m = b . size ( );
if ( m == 0 ) return 1;
int dp [ m + 1 ] [ n + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 0;
i < m;
i ++ ) {
for ( int j = i;
j < n;
j ++ ) {
if ( i == 0 ) {
if ( j == 0 ) dp [ i ] [ j ] = ( a [ j ] == b [ i ] ) ? 1 : 0;
else if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + 1;
else dp [ i ] [ j ] = dp [ i ] [ j - 1 ];
}
else {
if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = dp [ i ] [ j - 1 ];
}
}
}
return dp [ m - 1 ] [ n - 1 ];
}
if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = dp [ i ] [ j - 1 ];
}
}
}
return dp [ m - 1 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"abcccdf","aabba","aabsdfljk","IONiqV","9667771256770","10001011","fczbDtMDT","298746088","01100011000","Qk"};
vector<string> param1 {"abccdf","ab","aa","XKbBiGZ","50915176","01","FbX","29888","0",""};
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 n = a . size ( ), m = b . size ( ); if ( m == 0 ) return 1; int dp [ m + 1 ] [ n + 1 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 0; i < m; i ++ ) { for ( int j = i; j < n; j ++ ) { if ( i == 0 ) { if ( j == 0 ) dp [ i ] [ j ] = ( a [ j ] == b [ i ] ) ? 1 : 0; else if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + 1; else dp [ i ] [ j ] = dp [MASK] i ] [ j - 1 ]; } else { if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i - 1 ] [ j - 1 ]; else dp [ i ] [ j ] = dp [ i ] [ j - 1 ]; } } } return dp [ m - 1 ] [ n - 1 ]; } if ( a [ j ] == b [ i ] ) dp [ i ] [ j ] = dp [ i ] [ j - 1 ] + dp [ i - 1 ] [ j - 1 ];
else dp [ i ] [ j ] = dp [ i ] [ j - 1 ];
}
}
}
return dp [ m - 1 ] [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"abcccdf","aabba","aabsdfljk","IONiqV","9667771256770","10001011","fczbDtMDT","298746088","01100011000","Qk"};
vector<string> param1 {"abccdf","ab","aa","XKbBiGZ","50915176","01","FbX","29888","0",""};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i]) == f_gold(param0[i],param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | [ | [
"a) )",
"b) f_gold",
"c) [",
"d) ]",
"e) *"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int m, int n ) {
int dp [ n ] = {
1 };
dp [ 0 ] = 1;
for ( int i = 0;
i < m;
i ++ ) {
for ( int j = 1;
j < n;
j ++ ) {
dp [ j ] += dp [ j - 1 ];
}
}
return dp [ n - 1 ];
}
};
dp [ 0 ] = 1;
for ( int i = 0;
i < m;
i ++ ) {
for ( int j = 1;
j < n;
j ++ ) {
dp [ j ] += dp [ j - 1 ];
}
}
return dp [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {73,70,53,80,9,38,41,80,42,54};
vector<int> param1 {75,5,62,70,59,48,49,72,52,1};
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 [MASK] ) { int dp [ n ] = { 1 }; dp [ 0 ] = 1; for ( int i = 0; i < m; i ++ ) { for ( int j = 1; j < n; j ++ ) { dp [ j ] += dp [ j - 1 ]; } } return dp [ n - 1 ]; } };
dp [ 0 ] = 1;
for ( int i = 0;
i < m;
i ++ ) {
for ( int j = 1;
j < n;
j ++ ) {
dp [ j ] += dp [ j - 1 ];
}
}
return dp [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {73,70,53,80,9,38,41,80,42,54};
vector<int> param1 {75,5,62,70,59,48,49,72,52,1};
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;
} | n | [
"a) n",
"b) (",
"c) sum",
"d) )",
"e) ++;"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( string expr ) {
int len = expr . length ( );
if ( len % 2 ) return - 1;
stack < char > s;
for ( int i = 0;
i < len;
i ++ ) {
if ( expr [ i ] == '}' && ! s . empty ( ) ) {
if ( s . top ( ) == '{' ) s . pop ( );
else s . push ( expr [ i ] );
}
else s . push ( expr [ i ] );
}
int red_len = s . size ( );
int n = 0;
while ( ! s . empty ( ) && s . top ( ) == '{' ) {
s . pop ( );
n ++;
}
return ( red_len / 2 + n % 2 );
}
else s . push ( expr [ i ] );
}
int red_len = s . size ( );
int n = 0;
while ( ! s . empty ( ) && s . top ( ) == '{' ) {
s . pop ( );
n ++;
}
return ( red_len / 2 + n % 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"}{","{{{","{{{{","{{{{}}","}{{}}{{{","{}","","8","01111000","XPkERzHcpId"};
for(int i = 0; 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 expr ) { int len = expr . length ( ); if ( len % 2 ) return - 1; stack < char > s; for ( int i = 0; i < len; i ++ ) { if ( expr [ i ] == '}' && ! s . empty ( ) ) { if ( s . top ( ) == '{' ) s . pop ( ); else s . push ( expr [ i ] ); } else s . push ( expr [ i ] ); } int red_len = s . size ( ); int n = 0; while ( ! s . empty ( ) && s . top ( ) == '{' ) { s . pop ( ); n ++; } return ( red_len / 2 + n % 2 ); } else s . push ( expr [ i ] );
}
int red_len = s . size ( );
int n = 0;
while ( ! s . empty ( ) && s . top ( ) == '{' ) {
s . pop ( );
n ++;
}
return ( red_len / 2 + n % 2 );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"}{","{{{","{{{{","{{{{}}","}{{}}{{{","{}","","8","01111000","XPkERzHcpId"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | <bits/stdc++.h> | [
"a) *",
"b) ==",
"c) sizeof",
"d) <bits/stdc++.h>",
"e) def"
] | 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, bool x ) {
int arr [ ] = {
a, b };
return ( arr [ x ] );
}
ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, bool x ) {
int arr [ ] = {
a, b };
return ( arr [ x ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,17,35,23,48,9,18,46,99,61};
vector<int> param1 {7,49,43,51,30,44,30,91,23,54};
vector<int> param2 {34,69,18,80,99,64,34,71,35,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace [MASK] int f_gold ( int a, int b, bool x ) { int arr [ ] = { a, b }; return ( arr [ x ] ); }ude <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a, int b, bool x ) {
int arr [ ] = {
a, b };
return ( arr [ x ] );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {21,17,35,23,48,9,18,46,99,61};
vector<int> param1 {7,49,43,51,30,44,30,91,23,54};
vector<int> param2 {34,69,18,80,99,64,34,71,35,5};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | std; | [
"a) ,",
"b) if",
"c) std;",
"d) int",
"e) arr"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n, int l, int r ) {
int count = 0;
for ( int i = l;
i < r;
i ++ ) if ( a [ i ] == a [ i + 1 ] ) count += 1;
return count;
}
its/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n, int l, int r ) {
int count = 0;
for ( int i = l;
i < r;
i ++ ) if ( a [ i ] == a [ i + 1 ] ) count += 1;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,13,13,16,16,19,39,41,48,52,57,62,65,67,76,84,88,91,95,96,97,98},{62,76,86,-8,84,-6,72,84,6,-50,-18,-94,54,90,-74,-64,-26,-14,-32,62,10,4,70,-28,8,18,4,-62,-76,84,-78,-4,84,98,58,-68,42,-6,34,-38,52,-84,78},{0,0,0,0,0,0,1,1,1,1,1,1},{11,75,98,29,62,53,48,91,86,66,48,94},{-94,-84,-70,-70,-40,-40,-36,-24,10,48,62,74},{1,0,1,1,0,1,0,1,1,1,1,0,1,1,0,1,1,1,1,1,1,0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,1,0,1,1,0,0},{1,2,6,7,10,11,13,19,19,25,29,30,32,34,35,45,45,46,47,48,48,53,58,61,64,65,67,75,76,81,81,84,84,85,86,94,94,96,99},{-56,42,-34,-12,-86,82,-96,-66,30,16,-40,72,84,94,-48,-30,26,50,42,-44,-50,22,-38,8,34,94,2,16,-32,18,-58,12,-26,28,-62},{0,0,0,0,1,1,1},{6,29}};
vector<int> param1 {18,32,10,8,11,36,25,21,4,1};
vector<int> param2 {12,38,6,6,7,40,19,30,5,1};
vector<int> param3 {17,23,6,6,8,37,37,26,5,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 a [ ], int n, int l, int r ) { int count = 0; for ( int i = l; i < r; i ++ ) if ( a [ i ] == a [ i + 1 ] [MASK] count += 1; return count; }its/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n, int l, int r ) {
int count = 0;
for ( int i = l;
i < r;
i ++ ) if ( a [ i ] == a [ i + 1 ] ) count += 1;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,13,13,16,16,19,39,41,48,52,57,62,65,67,76,84,88,91,95,96,97,98},{62,76,86,-8,84,-6,72,84,6,-50,-18,-94,54,90,-74,-64,-26,-14,-32,62,10,4,70,-28,8,18,4,-62,-76,84,-78,-4,84,98,58,-68,42,-6,34,-38,52,-84,78},{0,0,0,0,0,0,1,1,1,1,1,1},{11,75,98,29,62,53,48,91,86,66,48,94},{-94,-84,-70,-70,-40,-40,-36,-24,10,48,62,74},{1,0,1,1,0,1,0,1,1,1,1,0,1,1,0,1,1,1,1,1,1,0,1,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,1,0,1,1,0,0},{1,2,6,7,10,11,13,19,19,25,29,30,32,34,35,45,45,46,47,48,48,53,58,61,64,65,67,75,76,81,81,84,84,85,86,94,94,96,99},{-56,42,-34,-12,-86,82,-96,-66,30,16,-40,72,84,94,-48,-30,26,50,42,-44,-50,22,-38,8,34,94,2,16,-32,18,-58,12,-26,28,-62},{0,0,0,0,1,1,1},{6,29}};
vector<int> param1 {18,32,10,8,11,36,25,21,4,1};
vector<int> param2 {12,38,6,6,7,40,19,30,5,1};
vector<int> param3 {17,23,6,6,8,37,37,26,5,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;
} | ) | [
"a) arr",
"b) i",
"c) i",
"d) )",
"e) <cstdlib>"
] | 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 a [ n ], b [ n ];
a [ 0 ] = b [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
a [ i ] = a [ i - 1 ] + b [ i - 1 ];
b [ i ] = a [ i - 1 ];
}
return ( 1 << n ) - a [ n - 1 ] - b [ n - 1 ];
}
b [ n ];
a [ 0 ] = b [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
a [ i ] = a [ i - 1 ] + b [ i - 1 ];
b [ i ] = a [ i - 1 ];
}
return ( 1 << n ) - a [ n - 1 ] - b [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,72,13,83,75,33,57,51,10,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> [MASK] namespace std; int f_gold ( int n ) { int a [ n ], b [ n ]; a [ 0 ] = b [ 0 ] = 1; for ( int i = 1; i < n; i ++ ) { a [ i ] = a [ i - 1 ] + b [ i - 1 ]; b [ i ] = a [ i - 1 ]; } return ( 1 << n ) - a [ n - 1 ] - b [ n - 1 ]; } b [ n ];
a [ 0 ] = b [ 0 ] = 1;
for ( int i = 1;
i < n;
i ++ ) {
a [ i ] = a [ i - 1 ] + b [ i - 1 ];
b [ i ] = a [ i - 1 ];
}
return ( 1 << n ) - a [ n - 1 ] - b [ n - 1 ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {27,72,13,83,75,33,57,51,10,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | using | [
"a) ==",
"b) prev_zero",
"c) int",
"d) using",
"e) x,"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float x1, float y1, float x2, float y2 ) {
return ( y2 - y1 ) / ( x2 - x1 );
}
include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float x1, float y1, float x2, float y2 ) {
return ( y2 - y1 ) / ( x2 - x1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {236.27324548309292F,-9201.144918204123F,3480.4716834445326F,-6915.538971485092F,8887.97173657486F,-3785.5177159369946F,3037.6696554256832F,-7925.458496016523F,1404.2919985268031F,-4748.744241168378F};
vector<float> param1 {5792.493225762838F,-2716.3347716140406F,3577.9608612055613F,-4113.601103381095F,1678.4080012662428F,-3084.67461899163F,4432.445827549F,-3350.27411882042F,8971.636233373416F,-675.557388148954F};
vector<float> param2 {7177.837879115863F,-5161.142121227645F,8611.515262945342F,-748.3462104020822F,8709.574949883017F,-7415.76208254121F,8387.304165588026F,-5619.767086756504F,3039.112051378511F,-5998.241086029875F};
vector<float> param3 {1289.5700425822731F,-3205.784279961129F,6744.864707668983F,-9245.271700539257F,8548.492675510739F,-887.5389305564152F,611.3373507518394F,-1185.7423219907591F,1947.6756252708972F,-4236.658178504375F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i],param3[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i],param3[i])) + 0.0000001)) < 0.001F)
{
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; float f_gold ( float x1, float y1, float x2, float y2 ) { return ( y2 - y1 ) / ( x2 - x1 ); }include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
float f_gold ( float x1, float y1, float x2, float y2 ) {
return ( y2 - y1 ) / ( x2 - x1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<float> param0 {236.27324548309292F,-9201.144918204123F,3480.4716834445326F,-6915.538971485092F,8887.97173657486F,-3785.5177159369946F,3037.6696554256832F,-7925.458496016523F,1404.2919985268031F,-4748.744241168378F};
vector<float> param1 {5792.493225762838F,-2716.3347716140406F,3577.9608612055613F,-4113.601103381095F,1678.4080012662428F,-3084.67461899163F,4432.445827549F,-3350.27411882042F,8971.636233373416F,-675.557388148954F};
vector<float> param2 {7177.837879115863F,-5161.142121227645F,8611.515262945342F,-748.3462104020822F,8709.574949883017F,-7415.76208254121F,8387.304165588026F,-5619.767086756504F,3039.112051378511F,-5998.241086029875F};
vector<float> param3 {1289.5700425822731F,-3205.784279961129F,6744.864707668983F,-9245.271700539257F,8548.492675510739F,-887.5389305564152F,611.3373507518394F,-1185.7423219907591F,1947.6756252708972F,-4236.658178504375F};
for(int i = 0; i < param0.size(); ++i)
{
if(abs(1 - (0.0000001 + abs(f_gold(param0[i],param1[i],param2[i],param3[i])) )/ (abs(f_filled(param0[i],param1[i],param2[i],param3[i])) + 0.0000001)) < 0.001F)
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include | [
"a) #include",
"b) 11",
"c) -",
"d) [",
"e) len"
] | 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 x, int y, int n ) {
int dp [ n + 1 ];
dp [ 0 ] = false;
dp [ 1 ] = true;
for ( int i = 2;
i <= n;
i ++ ) {
if ( i - 1 >= 0 and ! dp [ i - 1 ] ) dp [ i ] = true;
else if ( i - x >= 0 and ! dp [ i - x ] ) dp [ i ] = true;
else if ( i - y >= 0 and ! dp [ i - y ] ) dp [ i ] = true;
else dp [ i ] = false;
}
return dp [ n ];
}
) dp [ i ] = true;
else if ( i - x >= 0 and ! dp [ i - x ] ) dp [ i ] = true;
else if ( i - y >= 0 and ! dp [ i - y ] ) dp [ i ] = true;
else dp [ i ] = false;
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,32,99,22,26,67,69,39,7,91};
vector<int> param1 {27,88,18,1,78,51,57,8,82,56};
vector<int> param2 {51,69,48,74,95,27,91,9,41,7};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i],param1[i],param2[i]) == f_gold(param0[i],param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int x, int y, int n ) { int dp [ n + 1 ]; dp [ 0 ] = false; dp [ 1 ] = true; for ( int i = 2; i <= n; i ++ ) { if ( i - 1 >= 0 and ! dp [ i - 1 ] ) dp [ i ] = true; else if ( i - x >= 0 and ! dp [ i - x ] ) dp [ i [MASK] = true; else if ( i - y >= 0 and ! dp [ i - y ] ) dp [ i ] = true; else dp [ i ] = false; } return dp [ n ]; }) dp [ i ] = true;
else if ( i - x >= 0 and ! dp [ i - x ] ) dp [ i ] = true;
else if ( i - y >= 0 and ! dp [ i - y ] ) dp [ i ] = true;
else dp [ i ] = false;
}
return dp [ n ];
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {6,32,99,22,26,67,69,39,7,91};
vector<int> param1 {27,88,18,1,78,51,57,8,82,56};
vector<int> param2 {51,69,48,74,95,27,91,9,41,7};
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;
} | ] | [
"a) }",
"b) #include",
"c) i",
"d) ]",
"e) ++;"
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n, int k ) {
if ( n == 1 ) return 0;
sort ( arr, arr + n );
int ans = arr [ n - 1 ] - arr [ 0 ];
int small = arr [ 0 ] + k;
int big = arr [ n - 1 ] - k;
if ( small > big ) swap ( small, big );
for ( int i = 1;
i < n - 1;
i ++ ) {
int subtract = arr [ i ] - k;
int add = arr [ i ] + k;
if ( subtract >= small || add <= big ) continue;
if ( big - subtract <= add - small ) small = subtract;
else big = add;
}
return min ( ans, big - small );
}
nt add = arr [ i ] + k;
if ( subtract >= small || add <= big ) continue;
if ( big - subtract <= add - small ) small = subtract;
else big = add;
}
return min ( ans, big - small );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{31,33,40,43,44,51,52,56,60,64,66,79,91,93,99},{-16,34,54,-86,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{27,84,57,45,70,41,67,3,5,67,16,74,99,90,48,90,7,86,59,88,45,11,21,91,17,67,59,60,36,9,5,55,68,58,91,51,44,92,77,38},{-88,-84,-78,-72,-66,-66,-58,-56,-56,-56,-54,-50,-50,-38,-24,-18,-12,-10,-8,-4,0,6,8,10,14,40,44,50,58,64,64,68},{1,1,0,0,1,1,0,1,0,0,0},{6,11,13,14,22,25,26,28,30,31,37,37,55,57,61,62,64,67,69,70,71,73,73,75,80,81,82,88,90,98},{-86,4,-90,66,-10,-36,-18,82,20,6,-78,98,-64,52,-22,20,44,-70,-32,88,-80,24,-38,-62,92},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{2}};
vector<int> param1 {10,3,29,28,22,10,29,23,20,0};
vector<int> param2 {13,4,22,28,28,8,26,18,19,0};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n, int k ) { if ( n == 1 ) return 0; sort ( arr, arr + n ); int ans = arr [ n - 1 ] - arr [ 0 ]; int small = arr [ 0 ] + k; int big = arr [ n - 1 ] - k; if ( small > big ) swap ( small, big ); for ( int i = 1; i < n - 1; i ++ ) { int subtract = arr [ i ] - k; int add = arr [ i ] + k; if ( [MASK] >= small || add <= big ) continue; if ( big - subtract <= add - small ) small = subtract; else big = add; } return min ( ans, big - small ); }nt add = arr [ i ] + k;
if ( subtract >= small || add <= big ) continue;
if ( big - subtract <= add - small ) small = subtract;
else big = add;
}
return min ( ans, big - small );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{31,33,40,43,44,51,52,56,60,64,66,79,91,93,99},{-16,34,54,-86,-62},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{27,84,57,45,70,41,67,3,5,67,16,74,99,90,48,90,7,86,59,88,45,11,21,91,17,67,59,60,36,9,5,55,68,58,91,51,44,92,77,38},{-88,-84,-78,-72,-66,-66,-58,-56,-56,-56,-54,-50,-50,-38,-24,-18,-12,-10,-8,-4,0,6,8,10,14,40,44,50,58,64,64,68},{1,1,0,0,1,1,0,1,0,0,0},{6,11,13,14,22,25,26,28,30,31,37,37,55,57,61,62,64,67,69,70,71,73,73,75,80,81,82,88,90,98},{-86,4,-90,66,-10,-36,-18,82,20,6,-78,98,-64,52,-22,20,44,-70,-32,88,-80,24,-38,-62,92},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{2}};
vector<int> param1 {10,3,29,28,22,10,29,23,20,0};
vector<int> param2 {13,4,22,28,28,8,26,18,19,0};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | subtract | [
"a) }",
"b) res",
"c) y2",
"d) subtract",
"e) ("
] | d |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( int a [ ], int b [ ], int n, int k ) {
sort ( a, a + n );
sort ( b, b + n, greater < int > ( ) );
for ( int i = 0;
i < n;
i ++ ) if ( a [ i ] + b [ i ] < k ) return false;
return true;
}
t a [ ], int b [ ], int n, int k ) {
sort ( a, a + n );
sort ( b, b + n, greater < int > ( ) );
for ( int i = 0;
i < n;
i ++ ) if ( a [ i ] + b [ i ] < k ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,12,16,25,27,40,43,52,52,70,87,88,90,97,99},{-96,-90,-80,10,-84,-96,-28,-42,30,-92,-44,-14,18,-68,-94,6,-76,72,-90,42,70,-78,56,-26,8,74,12,-74,20,-86,-74,-90,-98,92,30,94,14,92,88,-98,42,-48},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{13,35,6,69,42,55,11,97,15,65,70,77,51,16,3,26,47,72,15,71,2,31,18,59,75,48},{-72,-70,-66,-64,-52,-52,-52,-48,-46,-42,-40,-34,-20,-4,-4,-2,2,4,16,16,18,18,32,36,52,54,56,56,58,68,72,74,84,84,90,90,92,94},{1,0,0,1,0,1,1,0,1,0,1,1,1,0,0,1,0,1,0},{8,17,18,21,23,32,34,37,44,48,53,58,64,66,66,72,72,79,80,80,80,82,87,92,93,94,96,96,98},{-20,-22,-16,-80,-88,22,-78,-82,-50,32,28,-8,-48,80,62,-14,14,10,-78,78,52,94,-66,14,50,18,-38,-98,24,18,-28,24,10,-88,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{75,31,58,10,92,65,45,72,53,91,39,33,10,13,67,85}};
vector<vector<int>> param1 {{4,7,11,20,34,35,36,44,46,71,72,78,85,85,91},{-48,84,16,-72,96,-78,-76,-84,-76,-32,-50,62,-22,24,-32,94,8,-14,-20,44,-80,68,-44,60,94,-42,-44,-74,-98,-86,16,62,-80,18,-18,70,30,40,-56,76,-32,50},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{88,15,44,36,38,98,89,81,73,51,37,4,79,60,11,62,48,45,12,21,65,14,78,20,12,46},{-94,-76,-74,-56,-54,-50,-46,-38,-26,-24,-24,-22,-16,-10,-6,-4,-4,0,0,6,12,12,18,20,38,50,52,52,54,64,64,72,72,72,76,90,96,96},{1,1,0,0,0,1,0,1,0,1,1,1,1,1,0,1,0,0,1},{11,15,17,19,23,23,26,27,36,43,46,47,55,59,63,66,77,79,79,82,85,86,86,91,91,94,94,97,99},{6,-54,90,98,-30,88,36,88,38,12,46,-66,-80,32,42,-96,62,-44,-80,-14,20,2,70,-46,96,-40,52,56,96,-82,24,98,-16,90,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{41,91,78,28,40,71,74,69,71,12,7,21,92,19,39,34}};
vector<int> param2 {10,40,11,25,26,13,20,31,31,14};
vector<int> param3 {7,38,15,16,30,13,14,24,30,8};
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 [MASK] #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int a [ ], int b [ ], int n, int k ) { sort ( a, a + n ); sort ( b, b + n, greater < int > ( ) ); for ( int i = 0; i < n; i ++ ) if ( a [ i ] + b [ i ] < k ) return false; return true; }t a [ ], int b [ ], int n, int k ) {
sort ( a, a + n );
sort ( b, b + n, greater < int > ( ) );
for ( int i = 0;
i < n;
i ++ ) if ( a [ i ] + b [ i ] < k ) return false;
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,12,16,25,27,40,43,52,52,70,87,88,90,97,99},{-96,-90,-80,10,-84,-96,-28,-42,30,-92,-44,-14,18,-68,-94,6,-76,72,-90,42,70,-78,56,-26,8,74,12,-74,20,-86,-74,-90,-98,92,30,94,14,92,88,-98,42,-48},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{13,35,6,69,42,55,11,97,15,65,70,77,51,16,3,26,47,72,15,71,2,31,18,59,75,48},{-72,-70,-66,-64,-52,-52,-52,-48,-46,-42,-40,-34,-20,-4,-4,-2,2,4,16,16,18,18,32,36,52,54,56,56,58,68,72,74,84,84,90,90,92,94},{1,0,0,1,0,1,1,0,1,0,1,1,1,0,0,1,0,1,0},{8,17,18,21,23,32,34,37,44,48,53,58,64,66,66,72,72,79,80,80,80,82,87,92,93,94,96,96,98},{-20,-22,-16,-80,-88,22,-78,-82,-50,32,28,-8,-48,80,62,-14,14,10,-78,78,52,94,-66,14,50,18,-38,-98,24,18,-28,24,10,-88,-14},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{75,31,58,10,92,65,45,72,53,91,39,33,10,13,67,85}};
vector<vector<int>> param1 {{4,7,11,20,34,35,36,44,46,71,72,78,85,85,91},{-48,84,16,-72,96,-78,-76,-84,-76,-32,-50,62,-22,24,-32,94,8,-14,-20,44,-80,68,-44,60,94,-42,-44,-74,-98,-86,16,62,-80,18,-18,70,30,40,-56,76,-32,50},{0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1},{88,15,44,36,38,98,89,81,73,51,37,4,79,60,11,62,48,45,12,21,65,14,78,20,12,46},{-94,-76,-74,-56,-54,-50,-46,-38,-26,-24,-24,-22,-16,-10,-6,-4,-4,0,0,6,12,12,18,20,38,50,52,52,54,64,64,72,72,72,76,90,96,96},{1,1,0,0,0,1,0,1,0,1,1,1,1,1,0,1,0,0,1},{11,15,17,19,23,23,26,27,36,43,46,47,55,59,63,66,77,79,79,82,85,86,86,91,91,94,94,97,99},{6,-54,90,98,-30,88,36,88,38,12,46,-66,-80,32,42,-96,62,-44,-80,-14,20,2,70,-46,96,-40,52,56,96,-82,24,98,-16,90,66},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{41,91,78,28,40,71,74,69,71,12,7,21,92,19,39,34}};
vector<int> param2 {10,40,11,25,26,13,20,31,31,14};
vector<int> param3 {7,38,15,16,30,13,14,24,30,8};
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;
} | <fstream> | [
"a) (x",
"b) c",
"c) <fstream>",
"d) i",
"e) max"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
unordered_map < int, int > um;
int sum = 0, maxLen = 0;
for ( int i = 0;
i < n;
i ++ ) {
sum += arr [ i ] == 0 ? - 1 : 1;
if ( sum == 1 ) maxLen = i + 1;
else if ( um . find ( sum ) == um . end ( ) ) um [ sum ] = i;
if ( um . find ( sum - 1 ) != um . end ( ) ) {
if ( maxLen < ( i - um [ sum - 1 ] ) ) maxLen = i - um [ sum - 1 ];
}
}
return maxLen;
}
( sum ) == um . end ( ) ) um [ sum ] = i;
if ( um . find ( sum - 1 ) != um . end ( ) ) {
if ( maxLen < ( i - um [ sum - 1 ] ) ) maxLen = i - um [ sum - 1 ];
}
}
return maxLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,10,31,35},{4,88,-72,28,-54,32,-34},{0,0,0,1,1,1,1,1,1},{39,22,15,10,34,87,46,83,74,77,61,90,43,67,64,72,92,52,68,53,67,32,82,76,76,47,74,47,8,80,85,58,75},{-82,-58,-50,-30,-14,-4,-2,-2,0,22,36,58,70,80,80,82,84,90},{1,0,1,0,0,1,1,1,0,0,1},{4,11,17,21,21,22,30,31,36,37,39,40,45,46,47,48,52,53,53,60,60,65,66,66,67,67,87,88,91,97},{-4,-60,-78,-50,64,18,0,76,12,86,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{4,39,50,37,71,66,55,34,1,41,34,99,69,31}};
vector<int> param1 {2,6,4,26,14,7,29,7,17,11};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { unordered_map < int, int > um; int sum = 0, maxLen = 0; for ( int i = 0; i < n; i ++ ) { sum += arr [ i ] == 0 ? - 1 : 1; if ( sum == 1 ) maxLen = i + 1; else if ( um . find ( sum ) == um . end ( ) ) um [ sum ] = i; if ( um . find ( sum - 1 ) != um . end ( ) ) { if ( maxLen < ( i - um [ sum - 1 ] ) ) maxLen = i - um [ sum - 1 ]; } } return maxLen; [MASK] ( sum ) == um . end ( ) ) um [ sum ] = i;
if ( um . find ( sum - 1 ) != um . end ( ) ) {
if ( maxLen < ( i - um [ sum - 1 ] ) ) maxLen = i - um [ sum - 1 ];
}
}
return maxLen;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{6,10,31,35},{4,88,-72,28,-54,32,-34},{0,0,0,1,1,1,1,1,1},{39,22,15,10,34,87,46,83,74,77,61,90,43,67,64,72,92,52,68,53,67,32,82,76,76,47,74,47,8,80,85,58,75},{-82,-58,-50,-30,-14,-4,-2,-2,0,22,36,58,70,80,80,82,84,90},{1,0,1,0,0,1,1,1,0,0,1},{4,11,17,21,21,22,30,31,36,37,39,40,45,46,47,48,52,53,53,60,60,65,66,66,67,67,87,88,91,97},{-4,-60,-78,-50,64,18,0,76,12,86,-22},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{4,39,50,37,71,66,55,34,1,41,34,99,69,31}};
vector<int> param1 {2,6,4,26,14,7,29,7,17,11};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | } | [
"a) )",
"b) '0';",
"c) }",
"d) )",
"e) f_gold"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
void f_gold ( int a [ ], int size ) {
int positive = 0, negative = 1;
while ( true ) {
while ( positive < size && a [ positive ] >= 0 ) positive += 2;
while ( negative < size && a [ negative ] <= 0 ) negative += 2;
if ( positive < size && negative < size ) swap ( a [ positive ], a [ negative ] );
else break;
}
}
0 ) positive += 2;
while ( negative < size && a [ negative ] <= 0 ) negative += 2;
if ( positive < size && negative < size ) swap ( a [ positive ], a [ negative ] );
else break;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93},{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94},{-98,-94,-7,-3,1,11,11,83,88},{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0},{8,35,37,38,39,46,49,54},{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54},{0,0,0,0,0,0,0,0,1,1},{62,36,39,53,90,78,56,1,56,4,30}};
vector<int> param1 {15,15,40,10,7,35,6,21,5,8};
vector<vector<int>> filled_function_param0 {{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93},{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94},{-98,-94,-7,-3,1,11,11,83,88},{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0},{8,35,37,38,39,46,49,54},{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54},{0,0,0,0,0,0,0,0,1,1},{62,36,39,53,90,78,56,1,56,4,30}};
vector<int> filled_function_param1 {15,15,40,10,7,35,6,21,5,8};
for(int i = 0; i < param0.size(); ++i)
{
f_filled(&filled_function_param0[i].front(),filled_function_param1[i]);
f_gold(¶m0[i].front(),param1[i]);
if(equal(begin(param0[i]), end(param0[i]), begin(filled_function_param0[i])) && param1[i] == filled_function_param1[i])
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; void f_gold ( int a [ ], int size ) { int positive = 0, negative = 1; while ( true ) { while ( positive < size && a [ positive ] >= 0 ) positive += 2; while ( negative < size && a [ negative ] <= 0 ) negative += 2; if ( positive < size && negative < [MASK] ) swap ( a [ positive ], a [ negative ] ); else break; } } 0 ) positive += 2;
while ( negative < size && a [ negative ] <= 0 ) negative += 2;
if ( positive < size && negative < size ) swap ( a [ positive ], a [ negative ] );
else break;
}
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93},{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94},{-98,-94,-7,-3,1,11,11,83,88},{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0},{8,35,37,38,39,46,49,54},{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54},{0,0,0,0,0,0,0,0,1,1},{62,36,39,53,90,78,56,1,56,4,30}};
vector<int> param1 {15,15,40,10,7,35,6,21,5,8};
vector<vector<int>> filled_function_param0 {{8,11,18,23,24,28,28,34,35,42,44,53,57,65,71,72,76,78,82,82,85,86,92,93},{0,-95,-51,-2,-70,-28,3,-37,75,-74,85,-63,-93,27,68,-8,67,90,3,-47,32,8,12,53,-93,56,97},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{28,85,78,33,10,83,30,22,3,82,75,48,2,76,54,6,40,93,94},{-98,-94,-7,-3,1,11,11,83,88},{0,0,1,0,0,0,1,0,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,0,0,0,1,1,1,0,0,1,1,0,1,1,1,1,1,0},{8,35,37,38,39,46,49,54},{-60,-66,-4,-21,27,-83,61,75,10,-48,18,-91,-67,88,13,49,86,-15,97,-90,-94,15,21,41,-35,-80,-43,-54},{0,0,0,0,0,0,0,0,1,1},{62,36,39,53,90,78,56,1,56,4,30}};
vector<int> filled_function_param1 {15,15,40,10,7,35,6,21,5,8};
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;
} | size | [
"a) ]",
"b) 4",
"c) size",
"d) {",
"e) <bits/stdc++.h>"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
char f_gold ( string str ) {
int len = str . length ( );
int count = 0;
char res = str [ 0 ];
for ( int i = 0;
i < len;
i ++ ) {
int cur_count = 1;
for ( int j = i + 1;
j < len;
j ++ ) {
if ( str [ i ] != str [ j ] ) break;
cur_count ++;
}
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
}
return res;
}
j < len;
j ++ ) {
if ( str [ i ] != str [ j ] ) break;
cur_count ++;
}
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeekk","3786868","110","aaaabbcbbb","11","011101","WoHNyJYLC","3141711779","10111101101","aabbabababcc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; char f_gold ( string str ) { int len = str . length ( ); int count = 0; char res = str [ 0 ]; for ( int i = 0; i < len; i ++ ) { int cur_count = 1; for ( int j = i + 1; j < len; j ++ ) { if ( str [ i ] != str [ j ] ) [MASK] cur_count ++; } if ( cur_count > count ) { count = cur_count; res = str [ i ]; } } return res; } j < len;
j ++ ) {
if ( str [ i ] != str [ j ] ) break;
cur_count ++;
}
if ( cur_count > count ) {
count = cur_count;
res = str [ i ];
}
}
return res;
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"geeekk","3786868","110","aaaabbcbbb","11","011101","WoHNyJYLC","3141711779","10111101101","aabbabababcc"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | break; | [
"a) j",
"b) break;",
"c) (x",
"d) public",
"e) n"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( 2 * ( sqrt ( 3 ) ) * ( side * side ) );
}
<string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( 2 * ( sqrt ( 3 ) ) * ( side * side ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1449.255716877097,-8772.104874265995,2948.419328234334,-1184.220109553511,7422.825800698956,-5808.280006171851,829.8963781665169,-7368.438572511732,5572.033890611617,-3998.9441642787706};
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 [MASK] #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; double f_gold ( double side ) { return ( 2 * ( sqrt ( 3 ) ) * ( side * side ) ); } <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
double f_gold ( double side ) {
return ( 2 * ( sqrt ( 3 ) ) * ( side * side ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<double> param0 {1449.255716877097,-8772.104874265995,2948.419328234334,-1184.220109553511,7422.825800698956,-5808.280006171851,829.8963781665169,-7368.438572511732,5572.033890611617,-3998.9441642787706};
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;
} | <cstdlib> | [
"a) (",
"b) 0",
"c) <cstdlib>",
"d) ]",
"e) ,"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
long long int f_gold ( int A [ ], int B [ ], int m, int n ) {
long long int dp [ n + 1 ] [ m + 1 ];
memset ( dp, 0, sizeof ( dp ) );
for ( int i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= m;
j ++ ) dp [ i ] [ j ] = max ( ( dp [ i - 1 ] [ j - 1 ] + ( A [ j - 1 ] * B [ i - 1 ] ) ), dp [ i ] [ j - 1 ] );
return dp [ n ] [ m ];
}
nt i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= m;
j ++ ) dp [ i ] [ j ] = max ( ( dp [ i - 1 ] [ j - 1 ] + ( A [ j - 1 ] * B [ i - 1 ] ) ), dp [ i ] [ j - 1 ] );
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,9,22,68},{24,40,98,58,-24,24,76,48,-92,-16,-46,-48,-70,88,66,2,44,36,34,34,46,90,-80,-24,-58,68,72,-20,-62,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,15,41,41,4,42,22,33,33,11,68,5,41,80,39,15,36,75,41,11,25,40,50,19,39,12,75,28,52,20,63,5,27,53,19,62,98,72,10,90,74,93,52,81,91,65,90,93},{-94,-76,-68,-50,-28,-20,18,24,30,54,74,84,98},{1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,0,0,1,1,0,1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,1,0},{14,27,43,49},{78,-26,-12,38,-90},{0,1,1,1},{12,69,57,7,52,14,15,83,67,57,15,86,81,43,1,64,45,68,30,23,14,70,13,51,23,33,98,68,24,43,12,82,46}};
vector<vector<int>> param1 {{14,22,54,58},{30,-88,6,-26,-76,14,-80,-30,-58,76,40,-28,-54,38,-60,-60,88,-80,-22,90,50,-48,68,-26,26,-2,68,-16,88,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{80,18,9,29,62,89,4,40,47,15,35,82,22,97,63,54,7,58,64,73,54,79,21,21,20,19,56,42,6,97,7,34,55,35,57,86,73,88,20,29,48,52,8,77,2,12,6,47},{-88,-80,-78,-68,-44,-38,42,50,62,68,70,80,92},{1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,1,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,0,1,0,1},{51,59,76,83},{14,50,-6,-38,80},{0,0,0,1},{12,48,57,40,47,36,22,50,68,98,77,78,39,55,87,75,65,27,33,27,70,34,67,71,84,33,7,61,3,9,67,92,60}};
vector<int> param2 {3,22,22,30,11,21,2,3,3,17};
vector<int> param3 {2,22,19,25,8,33,2,2,2,32};
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; long long int f_gold ( int A [ ], int B [ ], int m, int n ) { long long [MASK] dp [ n + 1 ] [ m + 1 ]; memset ( dp, 0, sizeof ( dp ) ); for ( int i = 1; i <= n; i ++ ) for ( int j = i; j <= m; j ++ ) dp [ i ] [ j ] = max ( ( dp [ i - 1 ] [ j - 1 ] + ( A [ j - 1 ] * B [ i - 1 ] ) ), dp [ i ] [ j - 1 ] ); return dp [ n ] [ m ]; }nt i = 1;
i <= n;
i ++ ) for ( int j = i;
j <= m;
j ++ ) dp [ i ] [ j ] = max ( ( dp [ i - 1 ] [ j - 1 ] + ( A [ j - 1 ] * B [ i - 1 ] ) ), dp [ i ] [ j - 1 ] );
return dp [ n ] [ m ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{7,9,22,68},{24,40,98,58,-24,24,76,48,-92,-16,-46,-48,-70,88,66,2,44,36,34,34,46,90,-80,-24,-58,68,72,-20,-62,-40},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{32,15,41,41,4,42,22,33,33,11,68,5,41,80,39,15,36,75,41,11,25,40,50,19,39,12,75,28,52,20,63,5,27,53,19,62,98,72,10,90,74,93,52,81,91,65,90,93},{-94,-76,-68,-50,-28,-20,18,24,30,54,74,84,98},{1,1,1,1,0,1,1,1,1,1,1,1,0,1,1,0,0,1,1,0,1,1,1,0,0,0,0,1,0,0,0,0,1,0,0,1,1,1,0,1,0},{14,27,43,49},{78,-26,-12,38,-90},{0,1,1,1},{12,69,57,7,52,14,15,83,67,57,15,86,81,43,1,64,45,68,30,23,14,70,13,51,23,33,98,68,24,43,12,82,46}};
vector<vector<int>> param1 {{14,22,54,58},{30,-88,6,-26,-76,14,-80,-30,-58,76,40,-28,-54,38,-60,-60,88,-80,-22,90,50,-48,68,-26,26,-2,68,-16,88,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{80,18,9,29,62,89,4,40,47,15,35,82,22,97,63,54,7,58,64,73,54,79,21,21,20,19,56,42,6,97,7,34,55,35,57,86,73,88,20,29,48,52,8,77,2,12,6,47},{-88,-80,-78,-68,-44,-38,42,50,62,68,70,80,92},{1,0,0,1,1,1,1,1,1,0,0,1,1,0,1,1,0,0,1,0,1,1,0,1,0,1,1,0,1,0,0,1,0,0,1,0,1,0,1,0,1},{51,59,76,83},{14,50,-6,-38,80},{0,0,0,1},{12,48,57,40,47,36,22,50,68,98,77,78,39,55,87,75,65,27,33,27,70,34,67,71,84,33,7,61,3,9,67,92,60}};
vector<int> param2 {3,22,22,30,11,21,2,3,3,17};
vector<int> param3 {2,22,19,25,8,33,2,2,2,32};
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;
} | int | [
"a) int",
"b) =",
"c) itr",
"d) (",
"e) return"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int b [ ], int n, int k ) {
int diff = 0, res = 0;
int temp;
for ( int i = 0;
i < n;
i ++ ) {
int pro = a [ i ] * b [ i ];
res = res + pro;
if ( pro < 0 && b [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ];
else if ( pro < 0 && a [ i ] < 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ];
else if ( pro > 0 && a [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ];
else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ];
int d = abs ( pro - temp );
if ( d > diff ) diff = d;
}
return res - diff;
}
( a [ i ] + 2 * k ) * b [ i ];
else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ];
int d = abs ( pro - temp );
if ( d > diff ) diff = d;
}
return res - diff;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,9,9,16,19,21,24,26,26,27,31,33,36,44,46,47,69,71,72,74,74,74,74,76,76,77,89,91,91},{-64,-58,26,-42,-18,-52,26,-70,0,-68,38,-98,-14,-92,-74,-90,86,-76,-8,-80,-80,54,-26,-56,48,86,-60},{0,0,0,0,1,1,1,1},{62,73,67,96,95,31,58,13,63,13,29,97,7,36,13,54,67,8,9,36,6,29,92,7,82,5,27,65,80,20,22,1,11,67,23,31,86,27,53,87,39,99,69},{-86,-82,-42,-30,-12,-4,14,16,20,20,22,26,30,40,46,48,48,50,60,60,66,70,74,76,90,96,96,98},{1,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,1,1,1,0,0,0,1,0,1,1,1,1,1,0,0,1},{4,7,14,14,30,38,44,49,51,53,54,56,58,62,67,76,86,86,88,91,95},{2,90,-92,58,56,94,12,-2,86,-70,46,-80,42,-6,72,-52,4,96,-42,50,-28,42,8,26,46,70,-2,-24,-36,50,26,70,74,-52,34,-88,-66,74,52,62,-24,-80,40,42,90},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,96,7,59,86,74,7,95,13,52,18,77,25,97,74,18}};
vector<vector<int>> param1 {{1,8,10,10,12,16,17,19,20,20,23,33,37,38,58,66,69,70,70,76,79,80,83,84,84,86,87,87,93},{90,-2,-8,12,-58,46,-54,-40,-10,-76,-62,66,42,-66,4,-6,50,8,-18,92,-42,30,-34,74,-86,-56,52},{0,0,0,0,0,1,1,1},{88,64,94,64,4,23,6,85,92,68,78,53,96,88,69,28,12,34,92,67,39,68,72,64,10,14,26,61,96,1,79,87,45,9,16,70,63,84,79,63,11,85,46},{-98,-78,-68,-68,-64,-40,-38,-38,-26,-12,-6,0,2,8,18,34,52,58,64,64,70,72,76,82,84,90,96,96},{1,0,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0,1,1,0,0,0},{2,2,7,19,20,21,22,26,42,45,46,46,59,63,63,72,73,74,77,83,89},{98,62,-52,-92,-14,-92,62,86,20,36,-80,-12,-38,70,-28,-28,42,-10,94,-16,-72,-96,76,-14,-18,-12,38,14,46,16,-90,10,-34,-6,-34,-62,96,14,0,-10,32,-6,96,-72,-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,1},{56,38,75,57,82,30,38,79,39,73,74,73,36,10,80,50}};
vector<int> param2 {20,20,7,23,14,20,11,25,46,13};
vector<int> param3 {28,16,5,23,14,16,17,25,33,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int b [ ], int n, int k ) { int diff = 0, [MASK] = 0; int temp; for ( int i = 0; i < n; i ++ ) { int pro = a [ i ] * b [ i ]; res = res + pro; if ( pro < 0 && b [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ]; else if ( pro < 0 && a [ i ] < 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ]; else if ( pro > 0 && a [ i ] < 0 ) temp = ( a [ i ] + 2 * k ) * b [ i ]; else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ]; int d = abs ( pro - temp ); if ( d > diff ) diff = d; } return res - diff; }( a [ i ] + 2 * k ) * b [ i ];
else if ( pro > 0 && a [ i ] > 0 ) temp = ( a [ i ] - 2 * k ) * b [ i ];
int d = abs ( pro - temp );
if ( d > diff ) diff = d;
}
return res - diff;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{8,9,9,16,19,21,24,26,26,27,31,33,36,44,46,47,69,71,72,74,74,74,74,76,76,77,89,91,91},{-64,-58,26,-42,-18,-52,26,-70,0,-68,38,-98,-14,-92,-74,-90,86,-76,-8,-80,-80,54,-26,-56,48,86,-60},{0,0,0,0,1,1,1,1},{62,73,67,96,95,31,58,13,63,13,29,97,7,36,13,54,67,8,9,36,6,29,92,7,82,5,27,65,80,20,22,1,11,67,23,31,86,27,53,87,39,99,69},{-86,-82,-42,-30,-12,-4,14,16,20,20,22,26,30,40,46,48,48,50,60,60,66,70,74,76,90,96,96,98},{1,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,1,1,1,0,0,0,1,0,1,1,1,1,1,0,0,1},{4,7,14,14,30,38,44,49,51,53,54,56,58,62,67,76,86,86,88,91,95},{2,90,-92,58,56,94,12,-2,86,-70,46,-80,42,-6,72,-52,4,96,-42,50,-28,42,8,26,46,70,-2,-24,-36,50,26,70,74,-52,34,-88,-66,74,52,62,-24,-80,40,42,90},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,96,7,59,86,74,7,95,13,52,18,77,25,97,74,18}};
vector<vector<int>> param1 {{1,8,10,10,12,16,17,19,20,20,23,33,37,38,58,66,69,70,70,76,79,80,83,84,84,86,87,87,93},{90,-2,-8,12,-58,46,-54,-40,-10,-76,-62,66,42,-66,4,-6,50,8,-18,92,-42,30,-34,74,-86,-56,52},{0,0,0,0,0,1,1,1},{88,64,94,64,4,23,6,85,92,68,78,53,96,88,69,28,12,34,92,67,39,68,72,64,10,14,26,61,96,1,79,87,45,9,16,70,63,84,79,63,11,85,46},{-98,-78,-68,-68,-64,-40,-38,-38,-26,-12,-6,0,2,8,18,34,52,58,64,64,70,72,76,82,84,90,96,96},{1,0,0,0,0,1,0,0,0,1,1,0,0,1,1,0,0,1,1,0,1,0,1,0,0,1,0,1,1,0,0,0},{2,2,7,19,20,21,22,26,42,45,46,46,59,63,63,72,73,74,77,83,89},{98,62,-52,-92,-14,-92,62,86,20,36,-80,-12,-38,70,-28,-28,42,-10,94,-16,-72,-96,76,-14,-18,-12,38,14,46,16,-90,10,-34,-6,-34,-62,96,14,0,-10,32,-6,96,-72,-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,1},{56,38,75,57,82,30,38,79,39,73,74,73,36,10,80,50}};
vector<int> param2 {20,20,7,23,14,20,11,25,46,13};
vector<int> param3 {28,16,5,23,14,16,17,25,33,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | res | [
"a) /",
"b) res",
"c) n",
"d) str1",
"e) import"
] | 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 price [ ], int n ) {
int * profit = new int [ n ];
for ( int i = 0;
i < n;
i ++ ) profit [ i ] = 0;
int max_price = price [ n - 1 ];
for ( int i = n - 2;
i >= 0;
i -- ) {
if ( price [ i ] > max_price ) max_price = price [ i ];
profit [ i ] = max ( profit [ i + 1 ], max_price - price [ i ] );
}
int min_price = price [ 0 ];
for ( int i = 1;
i < n;
i ++ ) {
if ( price [ i ] < min_price ) min_price = price [ i ];
profit [ i ] = max ( profit [ i - 1 ], profit [ i ] + ( price [ i ] - min_price ) );
}
int result = profit [ n - 1 ];
delete [ ] profit;
return result;
}
ice ) min_price = price [ i ];
profit [ i ] = max ( profit [ i - 1 ], profit [ i ] + ( price [ i ] - min_price ) );
}
int result = profit [ n - 1 ];
delete [ ] profit;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,10,10,12,17,18,23,32,41,44,47,50,59,69,69,75,82,84,87,89,97,99},{6,6,60,40,32,-70,-92,88,10,-8,-54,4,16,8,-44,80,-70,36,36,-74,-94,18,-64,-66,-46,0,-54,-84,16,-88,-34,-24,92,84,62},{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{2,67,50,8,20,42,37,69,86,74,85,96,78,89,91},{-68,-52,-14,-2,18,22,30,34,64,64,70},{1,1,0,0,0,1,0,0,1,1,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,1,0,1},{4,17,19,28,29,30,30,30,35,36,36,38,40,40,42,43,45,51,55,57,58,59,64,65,66,82,84,85,87,91,92,94,98,98},{52,88,-40,60,30,8,-96,66,-96,-28,-56,-14,76,-92,56,58,64,-60,-90,26,64,-2,54,-24,54,-46,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{82,14,51,12,5,15,50,88,91,82,16,98,23,58,86,91,30,81,7,73,67,47,10,50,43,31,19,2,22}};
vector<int> param1 {20,34,13,8,9,21,25,14,22,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int price [ ], int n ) { int * profit = new int [ n ]; for ( int i = 0; i < n; i ++ ) profit [ i ] = 0; int max_price = price [ n - 1 ]; for ( int i = n - 2; i >= 0; i -- ) { if ( price [ i ] > max_price ) max_price = price [ i ]; profit [ i ] = max ( profit [ i + 1 ], max_price - price [ i ] ); } int min_price = price [ 0 ]; for ( int i = 1; i < n; i ++ ) { if ( price [ i ] < min_price ) [MASK] = price [ i ]; profit [ i ] = max ( profit [ i - 1 ], profit [ i ] + ( price [ i ] - min_price ) ); } int result = profit [ n - 1 ]; delete [ ] profit; return result; }ice ) min_price = price [ i ];
profit [ i ] = max ( profit [ i - 1 ], profit [ i ] + ( price [ i ] - min_price ) );
}
int result = profit [ n - 1 ];
delete [ ] profit;
return result;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{9,10,10,12,17,18,23,32,41,44,47,50,59,69,69,75,82,84,87,89,97,99},{6,6,60,40,32,-70,-92,88,10,-8,-54,4,16,8,-44,80,-70,36,36,-74,-94,18,-64,-66,-46,0,-54,-84,16,-88,-34,-24,92,84,62},{0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1},{2,67,50,8,20,42,37,69,86,74,85,96,78,89,91},{-68,-52,-14,-2,18,22,30,34,64,64,70},{1,1,0,0,0,1,0,0,1,1,1,1,1,0,0,1,1,0,1,1,0,1,0,0,1,1,0,1},{4,17,19,28,29,30,30,30,35,36,36,38,40,40,42,43,45,51,55,57,58,59,64,65,66,82,84,85,87,91,92,94,98,98},{52,88,-40,60,30,8,-96,66,-96,-28,-56,-14,76,-92,56,58,64,-60,-90,26,64,-2,54,-24,54,-46,-44},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{82,14,51,12,5,15,50,88,91,82,16,98,23,58,86,91,30,81,7,73,67,47,10,50,43,31,19,2,22}};
vector<int> param1 {20,34,13,8,9,21,25,14,22,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;
} | min_price | [
"a) min_price",
"b) a",
"c) 2",
"d) -",
"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 pages [ ], int n, int capacity ) {
unordered_set < int > s;
queue < int > indexes;
int page_faults = 0;
for ( int i = 0;
i < n;
i ++ ) {
if ( s . size ( ) < capacity ) {
if ( s . find ( pages [ i ] ) == s . end ( ) ) {
s . insert ( pages [ i ] );
page_faults ++;
indexes . push ( pages [ i ] );
}
}
else {
if ( s . find ( pages [ i ] ) == s . end ( ) ) {
int val = indexes . front ( );
indexes . pop ( );
s . erase ( val );
s . insert ( pages [ i ] );
indexes . push ( pages [ i ] );
page_faults ++;
}
}
}
return page_faults;
}
indexes . pop ( );
s . erase ( val );
s . insert ( pages [ i ] );
indexes . push ( pages [ i ] );
page_faults ++;
}
}
}
return page_faults;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,4,6,7,8,11,13,18,26,35,36,37,45,46,46,47,48,49,51,52,53,56,61,74,75,77,80,83,85,86,87,90,93,95,97,98,99,99},{78,-48,50,-20,-6,58,-8,66,72,68,4,80,58,-26,-82,-56,92,76,20,82,-46,86,38,60,-62,-48,76,8,-66,-4,-98,-96,-52,92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{98,78,94,42,62,83,7,62,60,94,16,28,50,15,18,71,86,47,62,89},{-82,-70,-68,-56,-50,-44,4,18,28,30,30,42,66,78,80},{1,1,0,0,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0},{4,5,13,15,18,28,32,40,46,46,55,57,61,63,65,68,77,79,79,96},{-2,82,2,-74,-6,-24,54,-74,-98,8,-94,-60,-42,-38,36,-38,-58,-70,-28,-34,70,-6,-2,-76,-40,-4,0,-4,76,48,-34,-26,-48,-58,-88,-44,20,-22,78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{4,90,28,71,69,45,92,63,72,76,47,85,36,59,88,46,28,19,50,31,63,13}};
vector<int> param1 {36,33,19,15,9,25,17,31,26,15};
vector<int> param2 {37,23,13,11,11,25,18,24,24,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int pages [ ], int n, int capacity ) { unordered_set < int > s; queue < int > indexes; int page_faults = 0; for ( int i = 0; i < n; i ++ ) { if ( s . size ( ) < capacity ) { if ( s . find ( pages [ i [MASK] ) == s . end ( ) ) { s . insert ( pages [ i ] ); page_faults ++; indexes . push ( pages [ i ] ); } } else { if ( s . find ( pages [ i ] ) == s . end ( ) ) { int val = indexes . front ( ); indexes . pop ( ); s . erase ( val ); s . insert ( pages [ i ] ); indexes . push ( pages [ i ] ); page_faults ++; } } } return page_faults; }
indexes . pop ( );
s . erase ( val );
s . insert ( pages [ i ] );
indexes . push ( pages [ i ] );
page_faults ++;
}
}
}
return page_faults;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,4,6,7,8,11,13,18,26,35,36,37,45,46,46,47,48,49,51,52,53,56,61,74,75,77,80,83,85,86,87,90,93,95,97,98,99,99},{78,-48,50,-20,-6,58,-8,66,72,68,4,80,58,-26,-82,-56,92,76,20,82,-46,86,38,60,-62,-48,76,8,-66,-4,-98,-96,-52,92},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{98,78,94,42,62,83,7,62,60,94,16,28,50,15,18,71,86,47,62,89},{-82,-70,-68,-56,-50,-44,4,18,28,30,30,42,66,78,80},{1,1,0,0,1,1,0,0,1,1,1,1,1,0,0,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,1,1,1,1,0,0,0,0,1,0,0},{4,5,13,15,18,28,32,40,46,46,55,57,61,63,65,68,77,79,79,96},{-2,82,2,-74,-6,-24,54,-74,-98,8,-94,-60,-42,-38,36,-38,-58,-70,-28,-34,70,-6,-2,-76,-40,-4,0,-4,76,48,-34,-26,-48,-58,-88,-44,20,-22,78},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{4,90,28,71,69,45,92,63,72,76,47,85,36,59,88,46,28,19,50,31,63,13}};
vector<int> param1 {36,33,19,15,9,25,17,31,26,15};
vector<int> param2 {37,23,13,11,11,25,18,24,24,12};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ] | [
"a) b)",
"b) (",
"c) d",
"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 ) {
int lis [ N ];
for ( int i = 0;
i < N;
i ++ ) lis [ i ] = 1;
for ( int i = 1;
i < N;
i ++ ) for ( int j = 0;
j < i;
j ++ ) if ( arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1;
int max = 0;
for ( int i = 0;
i < N;
i ++ ) if ( max < lis [ i ] ) max = lis [ i ];
return ( N - max );
}
arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1;
int max = 0;
for ( int i = 0;
i < N;
i ++ ) if ( max < lis [ i ] ) max = lis [ i ];
return ( N - max );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,20,22,23,31,33,36,47,61,63,63,71,74,82,91,95,99},{-84,12,-42,-78,22,72,56,70,28,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,41,4,62,77,74,30,2,14,90,93,10,78,36,66,22,48,89,36,73,70,23,90},{-80,-72,-68,-66,-58,-50,-48,-32,-28,-24,-22,-18,0,2,6,10,12,14,14,18,24,24,24,28,28,28,34,38,42,42,46,46,46,58,80,82,82,84,84,86,88,90,92,96},{1,1,0,1,0,1,0,0,1,0},{26,36,58,64,69,72,79,82,82,87,89,90,95},{-52,-40,98,40,42,-50,60,-64,-92,36,-88,72,-72,38,-80,-52,68,70,16,22,-30,-74,56,-80,62,-54,-32,-22,-86,-70,88,-76,-46,28,40,-2,-84,68,-98,-16,90,36,-38,-86,20,-40,82,98,54},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{36,62,58,24,99,12,46,3,4,40,54,97,48,94,98,7,17,5,3,36,3}};
vector<int> param1 {15,7,16,13,36,8,8,41,10,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 [MASK] [ ], int N ) { int lis [ N ]; for ( int i = 0; i < N; i ++ ) lis [ i ] = 1; for ( int i = 1; i < N; i ++ ) for ( int j = 0; j < i; j ++ ) if ( arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1; int max = 0; for ( int i = 0; i < N; i ++ ) if ( max < lis [ i ] ) max = lis [ i ]; return ( N - max ); }arr [ i ] >= arr [ j ] && lis [ i ] < lis [ j ] + 1 ) lis [ i ] = lis [ j ] + 1;
int max = 0;
for ( int i = 0;
i < N;
i ++ ) if ( max < lis [ i ] ) max = lis [ i ];
return ( N - max );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{4,7,20,22,23,31,33,36,47,61,63,63,71,74,82,91,95,99},{-84,12,-42,-78,22,72,56,70,28,-72},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{29,41,4,62,77,74,30,2,14,90,93,10,78,36,66,22,48,89,36,73,70,23,90},{-80,-72,-68,-66,-58,-50,-48,-32,-28,-24,-22,-18,0,2,6,10,12,14,14,18,24,24,24,28,28,28,34,38,42,42,46,46,46,58,80,82,82,84,84,86,88,90,92,96},{1,1,0,1,0,1,0,0,1,0},{26,36,58,64,69,72,79,82,82,87,89,90,95},{-52,-40,98,40,42,-50,60,-64,-92,36,-88,72,-72,38,-80,-52,68,70,16,22,-30,-74,56,-80,62,-54,-32,-22,-86,-70,88,-76,-46,28,40,-2,-84,68,-98,-16,90,36,-38,-86,20,-40,82,98,54},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1},{36,62,58,24,99,12,46,3,4,40,54,97,48,94,98,7,17,5,3,36,3}};
vector<int> param1 {15,7,16,13,36,8,8,41,10,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;
} | arr | [
"a) return",
"b) arr",
"c) i",
"d) import",
"e) <vector>"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int a [ ], int n ) {
unordered_map < int, int > cnt;
int ans = 0, pre_sum = 0;
for ( int i = 0;
i < n;
i ++ ) {
ans += ( i * a [ i ] ) - pre_sum;
pre_sum += a [ i ];
if ( cnt [ a [ i ] - 1 ] ) ans -= cnt [ a [ i ] - 1 ];
if ( cnt [ a [ i ] + 1 ] ) ans += cnt [ a [ i ] + 1 ];
cnt [ a [ i ] ] ++;
}
return ans;
}
- pre_sum;
pre_sum += a [ i ];
if ( cnt [ a [ i ] - 1 ] ) ans -= cnt [ a [ i ] - 1 ];
if ( cnt [ a [ i ] + 1 ] ) ans += cnt [ a [ i ] + 1 ];
cnt [ a [ i ] ] ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,8,12,19,23,23,26,39,54,56,57,57,73,78,83,83,89,91},{62,-34,10,-28,-42,-12,4,20,-20,-84,-76,-16,-44,26,-78,-40,50,-10,-56,76,-88,24,64,10,64,-8,-68,-42,26,24,62,36,-68,8,-68,-2,8,38,-18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{23,14,44,29,93,56,22,29,97,71,43,72,74,8,92,40,18,34,78,79,93,63,79,44,35,72,88,83,40,89,66,66,54,56,44,62,72,94,79,79,24,55,72,37,27,55,16,58,83},{-96,-94,-90,-90,-86,-82,-80,-80,-58,-48,-40,-32,-32,-20,-20,-20,-12,-12,-6,-6,-2,0,4,16,16,16,42,48,58,64,68,76,76,76,78,80,82,88,88,88,92,94,96,98},{1,1,1,1,0,0,0,1,1,0,0,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,1,1,1},{3,4,4,8,10,10,11,15,19,19,20,24,25,25,27,30,41,43,44,45,47,55,59,59,61,63,63,67,67,69,72,73,75,77,77,78,81,81,83,84,92,94,99},{94,-86,94,54,-52,86,68,64,98,54,-14,-60,-60,-92,80,-16,28,16,-74,68,32,-54,58,-16,-2,-52,-92,-36,96,-18,14,76,16},{0,0,0,0,1,1,1,1},{10,28,63,2,78,12,51,82,89,65,99}};
vector<int> param1 {15,20,18,25,27,34,31,26,7,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 a [ ], int n ) { unordered_map < int, int > cnt; int ans = 0, pre_sum = 0; for ( int i = 0; i < n; i ++ ) { ans += ( i * a [ i ] [MASK] - pre_sum; pre_sum += a [ i ]; if ( cnt [ a [ i ] - 1 ] ) ans -= cnt [ a [ i ] - 1 ]; if ( cnt [ a [ i ] + 1 ] ) ans += cnt [ a [ i ] + 1 ]; cnt [ a [ i ] ] ++; } return ans; }- pre_sum;
pre_sum += a [ i ];
if ( cnt [ a [ i ] - 1 ] ) ans -= cnt [ a [ i ] - 1 ];
if ( cnt [ a [ i ] + 1 ] ) ans += cnt [ a [ i ] + 1 ];
cnt [ a [ i ] ] ++;
}
return ans;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,8,12,19,23,23,26,39,54,56,57,57,73,78,83,83,89,91},{62,-34,10,-28,-42,-12,4,20,-20,-84,-76,-16,-44,26,-78,-40,50,-10,-56,76,-88,24,64,10,64,-8,-68,-42,26,24,62,36,-68,8,-68,-2,8,38,-18},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1},{23,14,44,29,93,56,22,29,97,71,43,72,74,8,92,40,18,34,78,79,93,63,79,44,35,72,88,83,40,89,66,66,54,56,44,62,72,94,79,79,24,55,72,37,27,55,16,58,83},{-96,-94,-90,-90,-86,-82,-80,-80,-58,-48,-40,-32,-32,-20,-20,-20,-12,-12,-6,-6,-2,0,4,16,16,16,42,48,58,64,68,76,76,76,78,80,82,88,88,88,92,94,96,98},{1,1,1,1,0,0,0,1,1,0,0,1,0,0,1,1,0,0,0,0,1,1,0,0,1,1,1,0,1,0,0,0,1,1,1,0,0,1,1,1,1},{3,4,4,8,10,10,11,15,19,19,20,24,25,25,27,30,41,43,44,45,47,55,59,59,61,63,63,67,67,69,72,73,75,77,77,78,81,81,83,84,92,94,99},{94,-86,94,54,-52,86,68,64,98,54,-14,-60,-60,-92,80,-16,28,16,-74,68,32,-54,58,-16,-2,-52,-92,-36,96,-18,14,76,16},{0,0,0,0,1,1,1,1},{10,28,63,2,78,12,51,82,89,65,99}};
vector<int> param1 {15,20,18,25,27,34,31,26,7,8};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) javafx.util.Pair;",
"b) j",
"c) int",
"d) len",
"e) )"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) {
int count = 0;
unordered_set < int > us;
for ( int i = 0;
i < m;
i ++ ) us . insert ( arr1 [ i ] );
for ( int j = 0;
j < n;
j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++;
return count;
}
et < int > us;
for ( int i = 0;
i < m;
i ++ ) us . insert ( arr1 [ i ] );
for ( int j = 0;
j < n;
j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97},{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30,30,-32,-24,-36,62,36,-66,56,92,-20,90,32},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{91,95,13,13,76,18,36,86,26,13,17,68,58,42,38,9,42,90,14,74,38,64,15},{-96,-94,-94,-92,-74,-70,-66,-54,-48,-20,-18,-10,-6,-2,2,18,36,48,52,58,68,74,88,90,94},{1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1,1,0},{7,18,19,20,24,25,25,27,30,35,39,42,58,59,63,64,64,66,66,68,69,77,86,93},{86,44,10,80,12,52,-92,2,42,-32,-14,2,-42,40,96,22,58,-90,-20,22,96,10,-92,-28,-28,80,36,72,-2,32,-46,62,-58,20,22,32,-98,-2,-42,-90,10,70,54,-32},{0,0,1,1,1,1},{43,2,4,99,45,80,27,8,64,77,57,55,71,67,51,42,58,70,5,62,55,20,61,47,66,80,70,24,56,22,58,63,61,41,20,97,47}};
vector<vector<int>> param1 {{5,5,8,20,20,24,25,29,34,37,43,45,48,49,59,60,68,70,70,72,72,75,76,77,79,81,84,85,86,88,95,96,96},{-88,-32,30,32,-46,62,-92,-90,-18,-18,10,16,60,-40,32,-88,60,-82,76,50,86,-82,-48,-68,-42,34,4,0,98,92,-78},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{16,96,8,35,12,27,81,21,32,82,95,81,53,76,72,16,9,16,61,1,36,71,28},{-92,-72,-72,-64,-58,-52,-30,-28,-24,-24,-16,-10,-2,4,12,22,30,38,44,62,64,68,86,88,90},{1,0,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0,0,0,1,1,1,0,0},{2,2,18,20,22,22,31,35,36,40,41,41,41,42,42,43,45,61,79,83,87,91,95,96},{-4,-76,-98,14,30,-10,-10,62,88,-94,-74,-82,84,44,58,8,-42,-66,-18,68,-78,42,-32,38,-98,38,-78,42,86,-38,-6,-72,-44,8,-6,-48,-62,82,94,-92,-56,28,-54,34},{0,0,1,1,1,1},{11,66,41,17,93,25,24,17,12,33,62,86,48,68,36,36,39,82,7,66,5,48,27,9,56,6,61,91,98,74,61,63,98,96,57,63,85}};
vector<int> param2 {17,30,13,11,19,18,22,26,5,24};
vector<int> param3 {29,27,11,12,14,19,18,36,3,29};
vector<int> param4 {32,17,8,15,21,29,18,31,5,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using [MASK] std; int f_gold ( int arr1 [ ], int arr2 [ ], int m, int n, int x ) { int count = 0; unordered_set < int > us; for ( int i = 0; i < m; i ++ ) us . insert ( arr1 [ i ] ); for ( int j = 0; j < n; j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++; return count; }et < int > us;
for ( int i = 0;
i < m;
i ++ ) us . insert ( arr1 [ i ] );
for ( int j = 0;
j < n;
j ++ ) if ( us . find ( x - arr2 [ j ] ) != us . end ( ) ) count ++;
return count;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{1,2,5,5,9,11,12,14,16,18,35,36,39,44,50,52,52,59,69,81,82,84,85,87,87,87,88,88,89,90,90,92,97},{52,28,-38,78,-86,78,-48,-70,-80,28,-8,60,-28,90,6,76,32,-54,30,30,-32,-24,-36,62,36,-66,56,92,-20,90,32},{0,0,0,0,0,0,0,0,1,1,1,1,1,1,1},{91,95,13,13,76,18,36,86,26,13,17,68,58,42,38,9,42,90,14,74,38,64,15},{-96,-94,-94,-92,-74,-70,-66,-54,-48,-20,-18,-10,-6,-2,2,18,36,48,52,58,68,74,88,90,94},{1,1,1,0,0,0,1,1,0,0,1,0,1,0,1,1,1,0,1,0,1,0,0,1,1,1,1,0,1,1,0},{7,18,19,20,24,25,25,27,30,35,39,42,58,59,63,64,64,66,66,68,69,77,86,93},{86,44,10,80,12,52,-92,2,42,-32,-14,2,-42,40,96,22,58,-90,-20,22,96,10,-92,-28,-28,80,36,72,-2,32,-46,62,-58,20,22,32,-98,-2,-42,-90,10,70,54,-32},{0,0,1,1,1,1},{43,2,4,99,45,80,27,8,64,77,57,55,71,67,51,42,58,70,5,62,55,20,61,47,66,80,70,24,56,22,58,63,61,41,20,97,47}};
vector<vector<int>> param1 {{5,5,8,20,20,24,25,29,34,37,43,45,48,49,59,60,68,70,70,72,72,75,76,77,79,81,84,85,86,88,95,96,96},{-88,-32,30,32,-46,62,-92,-90,-18,-18,10,16,60,-40,32,-88,60,-82,76,50,86,-82,-48,-68,-42,34,4,0,98,92,-78},{0,0,0,0,0,0,0,1,1,1,1,1,1,1,1},{16,96,8,35,12,27,81,21,32,82,95,81,53,76,72,16,9,16,61,1,36,71,28},{-92,-72,-72,-64,-58,-52,-30,-28,-24,-24,-16,-10,-2,4,12,22,30,38,44,62,64,68,86,88,90},{1,0,1,1,1,0,0,0,0,1,0,1,1,0,0,1,0,1,0,0,1,0,0,0,0,0,1,1,1,0,0},{2,2,18,20,22,22,31,35,36,40,41,41,41,42,42,43,45,61,79,83,87,91,95,96},{-4,-76,-98,14,30,-10,-10,62,88,-94,-74,-82,84,44,58,8,-42,-66,-18,68,-78,42,-32,38,-98,38,-78,42,86,-38,-6,-72,-44,8,-6,-48,-62,82,94,-92,-56,28,-54,34},{0,0,1,1,1,1},{11,66,41,17,93,25,24,17,12,33,62,86,48,68,36,36,39,82,7,66,5,48,27,9,56,6,61,91,98,74,61,63,98,96,57,63,85}};
vector<int> param2 {17,30,13,11,19,18,22,26,5,24};
vector<int> param3 {29,27,11,12,14,19,18,36,3,29};
vector<int> param4 {32,17,8,15,21,29,18,31,5,21};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i],param4[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | namespace | [
"a) -",
"b) 1,",
"c) *",
"d) namespace",
"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 a [ ], int n ) {
vector < int > finalSequence;
sort ( a, a + n );
for ( int i = 0;
i < n / 2;
++ i ) {
finalSequence . push_back ( a [ i ] );
finalSequence . push_back ( a [ n - i - 1 ] );
}
int MaximumSum = 0;
for ( int i = 0;
i < n - 1;
++ i ) {
MaximumSum = MaximumSum + abs ( finalSequence [ i ] - finalSequence [ i + 1 ] );
}
MaximumSum = MaximumSum + abs ( finalSequence [ n - 1 ] - finalSequence [ 0 ] );
return MaximumSum;
}
{
MaximumSum = MaximumSum + abs ( finalSequence [ i ] - finalSequence [ i + 1 ] );
}
MaximumSum = MaximumSum + abs ( finalSequence [ n - 1 ] - finalSequence [ 0 ] );
return MaximumSum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,7,7,9,11,13,18,20,24,24,24,31,35,35,37,41,45,46,48,48,49,51,51,58,59,61,66,71,72,77,77,80,81,82,84,85,85,87,88,89,90,91,96,97,97,98},{16,-26,-78,-88,78,-2,-44,-74,-26,24,52,-78,10,38,82,18,-70,88,-16,74,28,-10,-64,-98,-80,-70,-62,-44,-20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,45,96,48,19,34,64,32,88,86,97,53,45,1,83,8,23,17,87,78,80,87,16,67,33,36},{-96,-96,-94,-92,-86,-86,-56,-48,-42,-38,-38,-28,-24,-22,-14,-6,12,20,20,24,36,38,40,50,54,66,86,88,88,96},{0,0,0,0,1,1,1,0,1},{2,10,10,12,13,14,15,19,20,20,21,24,27,29,33,34,37,38,40,42,42,44,49,55,62,63,64,65,66,68,70,74,78,79,79,83,83,84,91,93,99},{68,-66,74,12,46,-10,-88,30,-4,-98,-14,62,-78,-58,88,-68,46,72,-92,-74,-6,-78,-56,-94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{4,63,31,56,51,53,2,26,57,20,24,45,51,45,81,66,65,62,66,14,71,76,48,58,77,25,95,31,68,11,50,38,2,66,61,46}};
vector<int> param1 {26,17,23,19,29,4,35,23,26,28};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int a [ ], int n ) { vector < int > finalSequence; sort ( a, a + n ); for ( int i = 0; i < n / 2; ++ i ) { finalSequence . push_back ( a [ i ] ); finalSequence . push_back ( a [ n - i - 1 ] ); } int MaximumSum = 0; for ( int i = 0; i < n - 1; ++ i ) { MaximumSum = MaximumSum + abs ( finalSequence [ i [MASK] - finalSequence [ i + 1 ] ); } MaximumSum = MaximumSum + abs ( finalSequence [ n - 1 ] - finalSequence [ 0 ] ); return MaximumSum; }{
MaximumSum = MaximumSum + abs ( finalSequence [ i ] - finalSequence [ i + 1 ] );
}
MaximumSum = MaximumSum + abs ( finalSequence [ n - 1 ] - finalSequence [ 0 ] );
return MaximumSum;
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{2,5,7,7,7,9,11,13,18,20,24,24,24,31,35,35,37,41,45,46,48,48,49,51,51,58,59,61,66,71,72,77,77,80,81,82,84,85,85,87,88,89,90,91,96,97,97,98},{16,-26,-78,-88,78,-2,-44,-74,-26,24,52,-78,10,38,82,18,-70,88,-16,74,28,-10,-64,-98,-80,-70,-62,-44,-20},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{61,45,96,48,19,34,64,32,88,86,97,53,45,1,83,8,23,17,87,78,80,87,16,67,33,36},{-96,-96,-94,-92,-86,-86,-56,-48,-42,-38,-38,-28,-24,-22,-14,-6,12,20,20,24,36,38,40,50,54,66,86,88,88,96},{0,0,0,0,1,1,1,0,1},{2,10,10,12,13,14,15,19,20,20,21,24,27,29,33,34,37,38,40,42,42,44,49,55,62,63,64,65,66,68,70,74,78,79,79,83,83,84,91,93,99},{68,-66,74,12,46,-10,-88,30,-4,-98,-14,62,-78,-58,88,-68,46,72,-92,-74,-6,-78,-56,-94},{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{4,63,31,56,51,53,2,26,57,20,24,45,51,45,81,66,65,62,66,14,71,76,48,58,77,25,95,31,68,11,50,38,2,66,61,46}};
vector<int> param1 {26,17,23,19,29,4,35,23,26,28};
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) 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 num ) {
if ( num / 10 == 0 ) return true;
while ( num != 0 ) {
if ( num / 10 == 0 ) return true;
int digit1 = num % 10;
int digit2 = ( num / 10 ) % 10;
if ( abs ( digit2 - digit1 ) > 1 ) return false;
num = num / 10;
}
return true;
}
{
if ( num / 10 == 0 ) return true;
int digit1 = num % 10;
int digit2 = ( num / 10 ) % 10;
if ( abs ( digit2 - digit1 ) > 1 ) return false;
num = num / 10;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,77,35,79,45,22,68,17,5,85};
for(int i = 0; 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 num ) { if ( num / 10 == 0 ) return true; while ( num != 0 ) { if ( num / 10 == 0 ) return true; int digit1 = num % 10; int digit2 = ( num / 10 ) % 10; if ( abs ( digit2 - digit1 ) > 1 [MASK] return false; num = num / 10; } return true; }{
if ( num / 10 == 0 ) return true;
int digit1 = num % 10;
int digit2 = ( num / 10 ) % 10;
if ( abs ( digit2 - digit1 ) > 1 ) return false;
num = num / 10;
}
return true;
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {67,77,35,79,45,22,68,17,5,85};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | ) | [
"a) =",
"b) )",
"c) <=",
"d) (",
"e) *"
] | b |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
if ( n <= 0 ) return 0;
int incl = arr [ 0 ];
int excl = 0;
for ( int i = 1;
i < n;
i ++ ) {
int incl_new = arr [ i ] + min ( excl, incl );
int excl_new = incl;
incl = incl_new;
excl = excl_new;
}
return min ( incl, excl );
}
= 0;
for ( int i = 1;
i < n;
i ++ ) {
int incl_new = arr [ i ] + min ( excl, incl );
int excl_new = incl;
incl = incl_new;
excl = excl_new;
}
return min ( incl, excl );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,17,25,27,29,30,34,49,72,75,90,93,93,94},{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,30,-96,-84,72,2,26,-20,4,48,-98,62,-28,-68},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{34,40,92,35,29,26,12,66,7,28,86,4,35,79,1,48,41,47,15,75,45,6,3,94,39,50,20,8,58,51,83,44,53,76,19,84,68,54,36,53},{-98,-98,-92,-92,-88,-82,-74,-70,-68,-68,-64,-60,-52,-52,-42,-42,-38,-36,-36,-34,-26,-24,-22,-12,-2,-2,4,6,44,44,48,54,62,62,64,74,78,82,86,86,90,90,94},{1,1,0,0,1,0,0,1,1,1},{9,15,19,29,30,39,40,61},{92,0,46,70,-60,-50,58,-56,8,-90,84,16,40,-62,50,78,26,-42,-40,98,-52,62,16,-62,-76,-70,-60,32,4,-68,52,-64,70,12,-10},{0,0,0,1,1,1,1},{32,96,63,93,53,1,22,19,50,74,6,94,81,85,4,86,88,75,94}};
vector<int> param1 {8,36,21,29,36,5,4,21,5,18};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { if ( n <= 0 ) return 0; int incl = arr [ 0 ]; int excl = 0; for ( int i = 1; i < n; i ++ ) { int incl_new = arr [ i ] + min ( excl, incl ); int excl_new = [MASK] incl = incl_new; excl = excl_new; } return min ( incl, excl ); }= 0;
for ( int i = 1;
i < n;
i ++ ) {
int incl_new = arr [ i ] + min ( excl, incl );
int excl_new = incl;
incl = incl_new;
excl = excl_new;
}
return min ( incl, excl );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{5,17,25,27,29,30,34,49,72,75,90,93,93,94},{-70,-32,62,0,-10,92,-94,-86,52,6,-26,-92,-10,70,-82,28,86,58,86,-58,84,-80,-18,-92,-34,6,34,36,70,-50,-6,-54,84,22,30,-96,-84,72,2,26,-20,4,48,-98,62,-28,-68},{0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1},{34,40,92,35,29,26,12,66,7,28,86,4,35,79,1,48,41,47,15,75,45,6,3,94,39,50,20,8,58,51,83,44,53,76,19,84,68,54,36,53},{-98,-98,-92,-92,-88,-82,-74,-70,-68,-68,-64,-60,-52,-52,-42,-42,-38,-36,-36,-34,-26,-24,-22,-12,-2,-2,4,6,44,44,48,54,62,62,64,74,78,82,86,86,90,90,94},{1,1,0,0,1,0,0,1,1,1},{9,15,19,29,30,39,40,61},{92,0,46,70,-60,-50,58,-56,8,-90,84,16,40,-62,50,78,26,-42,-40,98,-52,62,16,-62,-76,-70,-60,32,4,-68,52,-64,70,12,-10},{0,0,0,1,1,1,1},{32,96,63,93,53,1,22,19,50,74,6,94,81,85,4,86,88,75,94}};
vector<int> param1 {8,36,21,29,36,5,4,21,5,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;
} | incl; | [
"a) incl;",
"b) /",
"c) 0;",
"d) <",
"e) {"
] | a |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
bool f_gold ( char str1 [ ], char str2 [ ], int m, int n ) {
int j = 0;
for ( int i = 0;
i < n && j < m;
i ++ ) if ( str1 [ j ] == str2 [ i ] ) j ++;
return ( j == m );
}
namespace std;
bool f_gold ( char str1 [ ], char str2 [ ], int m, int n ) {
int j = 0;
for ( int i = 0;
i < n && j < m;
i ++ ) if ( str1 [ j ] == str2 [ i ] ) j ++;
return ( j == m );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"AXY","AXY","1100","t","034","01111010110","SjOXhD","455","001","MkK"};
vector<string> param1 {"ADXCPY","YADXCP","001011001111","Isv","376083","10110110","PWkZDupqagB","4553","11100","qfjWaMdMYkqcK"};
vector<int> param2 {3,4,4,1,3,8,6,3,3,3};
vector<int> param3 {6,6,12,3,6,8,9,4,5,13};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]) == f_gold(¶m0[i].front(),¶m1[i].front(),param2[i],param3[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( char str1 [ ], char str2 [ ], [MASK] m, int n ) { int j = 0; for ( int i = 0; i < n && j < m; i ++ ) if ( str1 [ j ] == str2 [ i ] ) j ++; return ( j == m ); } namespace std;
bool f_gold ( char str1 [ ], char str2 [ ], int m, int n ) {
int j = 0;
for ( int i = 0;
i < n && j < m;
i ++ ) if ( str1 [ j ] == str2 [ i ] ) j ++;
return ( j == m );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {"AXY","AXY","1100","t","034","01111010110","SjOXhD","455","001","MkK"};
vector<string> param1 {"ADXCPY","YADXCP","001011001111","Isv","376083","10110110","PWkZDupqagB","4553","11100","qfjWaMdMYkqcK"};
vector<int> param2 {3,4,4,1,3,8,6,3,3,3};
vector<int> param3 {6,6,12,3,6,8,9,4,5,13};
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;
} | int | [
"a) profit",
"b) res;",
"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;
bool f_gold ( string & str ) {
vector < bool > mark ( 26, false );
int index;
for ( int i = 0;
i < str . length ( );
i ++ ) {
if ( 'A' <= str [ i ] && str [ i ] <= 'Z' ) index = str [ i ] - 'A';
else if ( 'a' <= str [ i ] && str [ i ] <= 'z' ) index = str [ i ] - 'a';
mark [ index ] = true;
}
for ( int i = 0;
i <= 25;
i ++ ) if ( mark [ i ] == false ) return ( false );
return ( true );
}
<= str [ i ] && str [ i ] <= 'z' ) index = str [ i ] - 'a';
mark [ index ] = true;
}
for ( int i = 0;
i <= 25;
i ++ ) if ( mark [ i ] == false ) return ( false );
return ( true );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"The quick brown fox jumps over the lazy dog ",
"The quick brown fox jumps over the dog",
"abcdefghijklmnopqrstuvwxyz",
"AbcdefghijKlmnopqrstUVwxyz",
"The quicK broWn fOX jumps over the laZYy dog ",
"AbcdefghijKlmnopqrstVwxyz",
"U",
"397548458372",
"11",
"iwCiUFU r"};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(param0[i]) == f_gold(param0[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( string & str ) { vector < bool > mark ( 26, false ); int index; for ( int i = 0; i < str . length ( ); i ++ ) { if ( 'A' <= str [ i ] && str [ i ] <= 'Z' ) index = str [ i ] - 'A'; else if ( 'a' <= str [ i ] && str [ i ] <= 'z' ) index = str [ i ] - 'a'; mark [ index ] = true; } for ( int i = 0; i <= 25; i ++ ) if ( mark [ i ] == false ) return ( false [MASK] return ( true ); } <= str [ i ] && str [ i ] <= 'z' ) index = str [ i ] - 'a';
mark [ index ] = true;
}
for ( int i = 0;
i <= 25;
i ++ ) if ( mark [ i ] == false ) return ( false );
return ( true );
}
//TOFILL
int main() {
int n_success = 0;
vector<string> param0 {
"The quick brown fox jumps over the lazy dog ",
"The quick brown fox jumps over the dog",
"abcdefghijklmnopqrstuvwxyz",
"AbcdefghijKlmnopqrstUVwxyz",
"The quicK broWn fOX jumps over the laZYy dog ",
"AbcdefghijKlmnopqrstVwxyz",
"U",
"397548458372",
"11",
"iwCiUFU r"};
for(int i = 0; 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) min_len",
"d) min",
"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 set [ ], int n, int sum ) {
bool subset [ n + 1 ] [ sum + 1 ];
for ( int i = 0;
i <= n;
i ++ ) subset [ i ] [ 0 ] = true;
for ( int i = 1;
i <= sum;
i ++ ) subset [ 0 ] [ i ] = false;
for ( int i = 1;
i <= n;
i ++ ) {
for ( int j = 1;
j <= sum;
j ++ ) {
if ( j < set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ];
if ( j >= set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ] || subset [ i - 1 ] [ j - set [ i - 1 ] ];
}
}
return subset [ n ] [ sum ];
}
] [ j ] = subset [ i - 1 ] [ j ];
if ( j >= set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ] || subset [ i - 1 ] [ j - set [ i - 1 ] ];
}
}
return subset [ n ] [ sum ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,5,8,11,11,13,14,14,14,14,19,21,24,24,28,31,32,32,34,37,37,38,38,39,43,43,44,47,48,49,58,63,67,72,77,80,81,83,88,92,93,99},{30,-64,6,-8,-8,-36,66,36,30,-14,32,-44,-42,42,-92},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,46,18,96,58,19,94,45,71,18,70,65,32,90,28,36,89,19,12,10,72,66,90,33,61,21,5,83,50,11,99,20,43,3,42,45,59,74,72,6,40,7,9},{-96,-78,-72,-22,2,14,18,36,72,76,80},{0,1,1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,1,1,1,1,1,0,1,0,0,1,0,0},{2,4,10,10,13,15,15,16,20,21,26,31,32,33,36,37,38,40,42,44,50,55,58,58,59,61,64,66,67,69,71,76,80,82,82,84,86,90,91,96,97,98},{80,-94,96,44,58,-36,78,-88,64,86,-52,86,-66,98,90,0,-98,-38,-70,40,-52,34,-96,32,28,-16,82,-78,4,-72,-22,-78,56,78,48,18,26,-94,32,64,14,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},{82,86,4,32,78,63,59,89,44,24,19,82,98,89,80,31}};
vector<int> param1 {37,11,24,38,6,20,33,25,28,15};
vector<int> param2 {29,8,19,28,8,34,36,27,31,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; bool f_gold ( int set [ ], int n, int sum ) { bool subset [ n + 1 ] [ sum + 1 ]; for ( int i = 0; i <= n; i ++ ) subset [ i ] [ 0 ] = true; for ( int i = 1; i <= sum; i ++ ) subset [ 0 ] [ i ] = false; for ( int i = 1; i <= n; i ++ ) { [MASK] ( int j = 1; j <= sum; j ++ ) { if ( j < set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ]; if ( j >= set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ] || subset [ i - 1 ] [ j - set [ i - 1 ] ]; } } return subset [ n ] [ sum ]; } ] [ j ] = subset [ i - 1 ] [ j ];
if ( j >= set [ i - 1 ] ) subset [ i ] [ j ] = subset [ i - 1 ] [ j ] || subset [ i - 1 ] [ j - set [ i - 1 ] ];
}
}
return subset [ n ] [ sum ];
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{3,4,4,5,8,11,11,13,14,14,14,14,19,21,24,24,28,31,32,32,34,37,37,38,38,39,43,43,44,47,48,49,58,63,67,72,77,80,81,83,88,92,93,99},{30,-64,6,-8,-8,-36,66,36,30,-14,32,-44,-42,42,-92},{0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1},{71,46,18,96,58,19,94,45,71,18,70,65,32,90,28,36,89,19,12,10,72,66,90,33,61,21,5,83,50,11,99,20,43,3,42,45,59,74,72,6,40,7,9},{-96,-78,-72,-22,2,14,18,36,72,76,80},{0,1,1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,1,0,1,0,0,1,1,0,1,1,1,1,1,1,1,0,1,0,0,1,0,0},{2,4,10,10,13,15,15,16,20,21,26,31,32,33,36,37,38,40,42,44,50,55,58,58,59,61,64,66,67,69,71,76,80,82,82,84,86,90,91,96,97,98},{80,-94,96,44,58,-36,78,-88,64,86,-52,86,-66,98,90,0,-98,-38,-70,40,-52,34,-96,32,28,-16,82,-78,4,-72,-22,-78,56,78,48,18,26,-94,32,64,14,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},{82,86,4,32,78,63,59,89,44,24,19,82,98,89,80,31}};
vector<int> param1 {37,11,24,38,6,20,33,25,28,15};
vector<int> param2 {29,8,19,28,8,34,36,27,31,10};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i],param2[i]) == f_gold(¶m0[i].front(),param1[i],param2[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | for | [
"a) int",
"b) <math.h>",
"c) for",
"d) len",
"e) res"
] | c |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 );
}
ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {30,25,69,39,14,60,89,27,29,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 ) { return n * ( [MASK] - 1 ); }ostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int n ) {
return n * ( n - 1 );
}
//TOFILL
int main() {
int n_success = 0;
vector<int> param0 {30,25,69,39,14,60,89,27,29,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;
} | n | [
"a) <iostream>",
"b) (int",
"c) using",
"d) cmpfunc);}",
"e) n"
] | e |
cpp |
#include <iostream>
#include <cstdlib>
#include <string>
#include <vector>
#include <fstream>
#include <iomanip>
#include <bits/stdc++.h>
using namespace std;
int f_gold ( int arr [ ], int n ) {
int longest_start = - 1, longest_end = 0;
for ( int start = 0;
start < n;
start ++ ) {
int min = INT_MAX, max = INT_MIN;
for ( int end = start;
end < n;
end ++ ) {
int val = arr [ end ];
if ( val < min ) min = val;
if ( val > max ) max = val;
if ( 2 * min <= max ) break;
if ( end - start > longest_end - longest_start || longest_start == - 1 ) {
longest_start = start;
longest_end = end;
}
}
}
if ( longest_start == - 1 ) return n;
return ( n - ( longest_end - longest_start + 1 ) );
}
longest_start == - 1 ) {
longest_start = start;
longest_end = end;
}
}
}
if ( longest_start == - 1 ) return n;
return ( n - ( longest_end - longest_start + 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{32,50,66,73,76,87},{68,74,16,40,6,-44,-36,94,6,-24,-4,-58,-16,24},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{91,22},{-84,-80,-78,-76,-58,-54,-52,-48,-42,-42,-40,-38,-34,-32,-28,-24,-6,2,2,4,10,14,16,18,26,26,36,40,50,52,62,64,72,74,84,90,94,96,98},{1,0,1,1,1,0,1,1,1,0,1,0,0,1,0,1,1,1,1,0,1},{10,19,25,29,32,37,40,43,43,44,46,51,51,54,56,58,63,79,83,86,87,97,97},{-48,-28,10,30,78,-72,78,52,-52,-68,56,42,8,-42,16,-56,2,-90,-26,-28,-56,-2,80,-50,98,-64,-96,10,-10,44,98,-48,-88,42,30,24,38,-26,-52,-12,0,34,-82,-80,0,-84,-20},{0,0,1,1,1,1,1,1},{25,82}};
vector<int> param1 {5,11,11,1,35,13,11,25,6,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | #include <iostream> #include <cstdlib> #include <string> #include <vector> #include <fstream> #include <iomanip> #include <bits/stdc++.h> using namespace std; int f_gold ( int arr [ ], int n ) { int longest_start = - 1, longest_end = 0; for ( int start = 0; start < n; start ++ ) { int min = INT_MAX, max = INT_MIN; for ( int end = start; end < n; end ++ ) { int val = arr [ end ]; if ( val < min ) min = val; if ( val > max ) max = val; if ( 2 * min <= max ) break; if ( end - start > longest_end - longest_start || [MASK] == - 1 ) { longest_start = start; longest_end = end; } } } if ( longest_start == - 1 ) return n; return ( n - ( longest_end - longest_start + 1 ) ); }longest_start == - 1 ) {
longest_start = start;
longest_end = end;
}
}
}
if ( longest_start == - 1 ) return n;
return ( n - ( longest_end - longest_start + 1 ) );
}
//TOFILL
int main() {
int n_success = 0;
vector<vector<int>> param0 {{32,50,66,73,76,87},{68,74,16,40,6,-44,-36,94,6,-24,-4,-58,-16,24},{0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1},{91,22},{-84,-80,-78,-76,-58,-54,-52,-48,-42,-42,-40,-38,-34,-32,-28,-24,-6,2,2,4,10,14,16,18,26,26,36,40,50,52,62,64,72,74,84,90,94,96,98},{1,0,1,1,1,0,1,1,1,0,1,0,0,1,0,1,1,1,1,0,1},{10,19,25,29,32,37,40,43,43,44,46,51,51,54,56,58,63,79,83,86,87,97,97},{-48,-28,10,30,78,-72,78,52,-52,-68,56,42,8,-42,16,-56,2,-90,-26,-28,-56,-2,80,-50,98,-64,-96,10,-10,44,98,-48,-88,42,30,24,38,-26,-52,-12,0,34,-82,-80,0,-84,-20},{0,0,1,1,1,1,1,1},{25,82}};
vector<int> param1 {5,11,11,1,35,13,11,25,6,1};
for(int i = 0; i < param0.size(); ++i)
{
if(f_filled(¶m0[i].front(),param1[i]) == f_gold(¶m0[i].front(),param1[i]))
{
n_success+=1;
}
}
cout << "#Results:" << " " << n_success << ", " << param0.size();
return 0;
} | longest_start | [
"a) )",
"b) minResources",
"c) N,",
"d) longest_start",
"e) &"
] | d |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.