qid
stringlengths 1
3
| title
stringlengths 13
51
| language
stringclasses 1
value | text
stringlengths 65
1.09k
| signature_with_docstring
stringlengths 113
1.24k
| signature
stringlengths 17
123
| arguments
sequence | source
stringlengths 38
1.51k
| question_info
dict |
|---|---|---|---|---|---|---|---|---|
204 | TP3/human_eval.StrongestExtension | C++ | Verifies that the inputs satisfy the problem:
Find the class_name.extension for the extension that has the largest #capitals - #lowercase letters | /**
* Verifies that the inputs satisfy the problem:
* Find the class_name.extension for the extension that has the largest #capitals - #lowercase letters
*/
bool sat(string s, string class_name, vector<string> extensions) { | bool sat(string s, string class_name, vector<string> extensions) { | [
"s",
"class_name",
"extensions"
] | def sat(s: str, class_name, extensions):
if not s.startswith(class_name + '.'):
return False
ext = s[len(class_name) + 1:]
def case_delta(x: str):
tot = 0
for c in x:
if c.isupper():
tot += 1
elif c.islower():
tot -= 1
return tot
return ext in extensions and case_delta(ext) == max([case_delta(x) for x in extensions]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"TestClass.v9ACLQWTEW\", \"class_name\": \"TestClass\", \"extensions\": [\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"Lyhithywuwotu.JUFeSA\", \"class_name\": \"Lyhithywuwotu\", \"extensions\": [\"moRUTExterefI\", \"vItHu\", \"xIWygaly\", \"zONITh\", \"ChinELAbiFOfywUcU\", \"sywyfIFuTagAX\", \"CIcECHiriQUuXuxuh\", \"JUFeSA\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"Textafarole.HYCygiNY\", \"class_name\": \"Textafarole\", \"extensions\": [\"bEzETExTutheQuYCetH\", \"FUFetEpaPafawIxegIbI\", \"fUxuXYfOmutYM\", \"HYCygiNY\", \"FUnaVYcHity\", \"th\", \"dULUDyQui\", \"rAvUJUlAchUHAsOBese\", \"tefO\", \"vy\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"Gudes.RySyJIFADEXETYBopUL\", \"class_name\": \"Gudes\", \"extensions\": [\"CHOXeHeTAsUxyTe\", \"QuEtHeTe\", \"NOtEX\", \"sehYJyFecIte\", \"RySyJIFADEXETYBopUL\", \"taMEcYW\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"Ruxomyw.TEXteSYSyWEQuy\", \"class_name\": \"Ruxomyw\", \"extensions\": [\"PUfam\", \"H\", \"PEVYtHAxe\", \"cInyTex\", \"PoJApESOch\", \"teXTidaQuigUPOtho\", \"TEXteSYSyWEQuy\", \"C\", \"ZEFutexTImyjUHi\", \"CIcybAMeT\", \"XIWAvaDoBe\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"Ruxomyw.TEXteSYSyWEQuy\", \"class_name\": \"Gudes\", \"extensions\": [\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"TestClass.v9ACLQWTEW\", \"class_name\": \"Gudes\", \"extensions\": [\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"Lyhithywuwotu.JUFeSA\", \"class_name\": \"Gudes\", \"extensions\": [\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"Textafarole.HYCygiNY\", \"class_name\": \"Ruxomyw\", \"extensions\": [\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the class_name.extension for the extension that has the largest #capitals - #lowercase letters\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string class_name, vector<string> extensions, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, class_name, extensions), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"TestClass.v9ACLQWTEW\", \"TestClass\", {\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Lyhithywuwotu.JUFeSA\", \"Lyhithywuwotu\", {\"moRUTExterefI\", \"vItHu\", \"xIWygaly\", \"zONITh\", \"ChinELAbiFOfywUcU\", \"sywyfIFuTagAX\", \"CIcECHiriQUuXuxuh\", \"JUFeSA\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Textafarole.HYCygiNY\", \"Textafarole\", {\"bEzETExTutheQuYCetH\", \"FUFetEpaPafawIxegIbI\", \"fUxuXYfOmutYM\", \"HYCygiNY\", \"FUnaVYcHity\", \"th\", \"dULUDyQui\", \"rAvUJUlAchUHAsOBese\", \"tefO\", \"vy\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Gudes.RySyJIFADEXETYBopUL\", \"Gudes\", {\"CHOXeHeTAsUxyTe\", \"QuEtHeTe\", \"NOtEX\", \"sehYJyFecIte\", \"RySyJIFADEXETYBopUL\", \"taMEcYW\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Ruxomyw.TEXteSYSyWEQuy\", \"Ruxomyw\", {\"PUfam\", \"H\", \"PEVYtHAxe\", \"cInyTex\", \"PoJApESOch\", \"teXTidaQuigUPOtho\", \"TEXteSYSyWEQuy\", \"C\", \"ZEFutexTImyjUHi\", \"CIcybAMeT\", \"XIWAvaDoBe\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Ruxomyw.TEXteSYSyWEQuy\", \"Gudes\", {\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"TestClass.v9ACLQWTEW\", \"Gudes\", {\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Lyhithywuwotu.JUFeSA\", \"Gudes\", {\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Textafarole.HYCygiNY\", \"Ruxomyw\", {\"extEnd\", \"LOL\", \"SuPeRbLy\", \"v9ACLQWTEW\", \"PickMe\", \"AI\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
205 | TP3/human_eval.RotateString | C++ | Verifies that the inputs satisfy the problem:
Find a rotation of string s that is a substring of t
Input Example:
s="test", t="I love lattes"
Output Example:
"ttes" | /**
* Verifies that the inputs satisfy the problem:
* Find a rotation of string s that is a substring of t
* Input Example:
* s="test", t="I love lattes"
* Output Example:
* "ttes"
*/
bool sat(string r, string s, string t) { | bool sat(string r, string s, string t) { | [
"r",
"s",
"t"
] | def sat(r: str, s, t):
return r in t and len(r) == len(s) and (r in s + s) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"r\": \" starlight\", \"s\": \"light star\", \"t\": \"I love to look at the starlight!\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"r\": \"thihonofuz tox banu dukukyjosu\", \"s\": \"fuz tox banu dukukyjosuthihono\", \"t\": \"sikysefylacywitijuz thosowehiv kiviwas girezol betext lepumarasithihonofuz tox banu dukukyjosutog kuquinecakyt\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"r\": \"tus tyryrezywovimu sopikalo vyquaquabuwuk\", \"s\": \"vyquaquabuwuktus tyryrezywovimu sopikalo \", \"t\": \"zugu benuzyca cafoca gawy sycapoxitus tyryrezywovimu sopikalo vyquaquabuwuko citextytextythakidu basikyched\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"r\": \"xebalu w guhudynybu cequelyn\", \"s\": \"udynybu cequelynxebalu w guh\", \"t\": \"zigoxesychujocefete nyquuquu wubupi quidoxebalu w guhudynybu cequelynuquumythaku xet syquaxatext lizevachuciconolove\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"r\": \"mowefecajajeh b tythanenifewed quomekucybimudegicyj zos depogip k\", \"s\": \"fecajajeh b tythanenifewed quomekucybimudegicyj zos depogip kmowe\", \"t\": \"fuch mowefecajajeh b tythanenifewed quomekucybimudegicyj zos depogip kotextu hothakatozate thyzet\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"r\": \" starlight\", \"s\": \"fuz tox banu dukukyjosuthihono\", \"t\": \"I love to look at the starlight!\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"r\": \" starlight\", \"s\": \"udynybu cequelynxebalu w guh\", \"t\": \"I love to look at the starlight!\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"r\": \"thihonofuz tox banu dukukyjosu\", \"s\": \"light star\", \"t\": \"I love to look at the starlight!\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"r\": \" starlight\", \"s\": \"vyquaquabuwuktus tyryrezywovimu sopikalo \", \"t\": \"I love to look at the starlight!\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a rotation of string s that is a substring of t\n// Input Example:\n// s=\"test\", t=\"I love lattes\"\n// Output Example:\n// \"ttes\"\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string r, string s, string t, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(r, s, t), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\" starlight\", \"light star\", \"I love to look at the starlight!\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"thihonofuz tox banu dukukyjosu\", \"fuz tox banu dukukyjosuthihono\", \"sikysefylacywitijuz thosowehiv kiviwas girezol betext lepumarasithihonofuz tox banu dukukyjosutog kuquinecakyt\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tus tyryrezywovimu sopikalo vyquaquabuwuk\", \"vyquaquabuwuktus tyryrezywovimu sopikalo \", \"zugu benuzyca cafoca gawy sycapoxitus tyryrezywovimu sopikalo vyquaquabuwuko citextytextythakidu basikyched\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"xebalu w guhudynybu cequelyn\", \"udynybu cequelynxebalu w guh\", \"zigoxesychujocefete nyquuquu wubupi quidoxebalu w guhudynybu cequelynuquumythaku xet syquaxatext lizevachuciconolove\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mowefecajajeh b tythanenifewed quomekucybimudegicyj zos depogip k\", \"fecajajeh b tythanenifewed quomekucybimudegicyj zos depogip kmowe\", \"fuch mowefecajajeh b tythanenifewed quomekucybimudegicyj zos depogip kotextu hothakatozate thyzet\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\" starlight\", \"fuz tox banu dukukyjosuthihono\", \"I love to look at the starlight!\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\" starlight\", \"udynybu cequelynxebalu w guh\", \"I love to look at the starlight!\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"thihonofuz tox banu dukukyjosu\", \"light star\", \"I love to look at the starlight!\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\" starlight\", \"vyquaquabuwuktus tyryrezywovimu sopikalo \", \"I love to look at the starlight!\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
206 | TP3/human_eval.EvenOddDigits | C++ | Verifies that the inputs satisfy the problem:
Find an integer n >= 0 with the given number of even and odd digits.
evens=3, odds=4 => 2381695 | /**
* Verifies that the inputs satisfy the problem:
* Find an integer n >= 0 with the given number of even and odd digits.
* evens=3, odds=4 => 2381695
*/
bool sat(string n, int evens, int odds) { | bool sat(string n, int evens, int odds) { | [
"n",
"evens",
"odds"
] | def sat(n: str, evens, odds):
for c in n:
if int(c) % 2 == 0:
evens -= 1
else:
odds -= 1
return evens == 0 and odds == 0 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": \"22222222222222222111\", \"evens\": 17, \"odds\": 3}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": \"22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222211111111111111111111111111111111111111111111111111111111\", \"evens\": 117, \"odds\": 56}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": \"22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222211111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\", \"evens\": 114, \"odds\": 119}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": \"2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222111111111111111111111111111111111\", \"evens\": 133, \"odds\": 33}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": \"22222222111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\", \"evens\": 8, \"odds\": 114}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": \"22222222222222222111\", \"evens\": 8, \"odds\": 33}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": \"22222222222222222111\", \"evens\": 17, \"odds\": 56}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": \"22222222222222222111\", \"evens\": 117, \"odds\": 3}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": \"22222222222222222111\", \"evens\": 8, \"odds\": 56}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find an integer n >= 0 with the given number of even and odd digits.\n// evens=3, odds=4 => 2381695\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string n, int evens, int odds, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, evens, odds), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"22222222222222222111\", 17, 3, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222211111111111111111111111111111111111111111111111111111111\", 117, 56, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222211111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\", 114, 119, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"2222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222111111111111111111111111111111111\", 133, 33, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111\", 8, 114, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222111\", 8, 33, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222111\", 17, 56, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222111\", 117, 3, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"22222222222222222111\", 8, 56, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
207 | TP3/human_eval.RomanNumerals | C++ | Verifies that the inputs satisfy the problem:
Convert integer 0 < n < 4000 to roman numerals, and make it lowercase
11 => "xi" | /**
* Verifies that the inputs satisfy the problem:
* Convert integer 0 < n < 4000 to roman numerals, and make it lowercase
* 11 => "xi"
*/
bool sat(string roman, int n) { | bool sat(string roman, int n) { | [
"roman",
"n"
] | def sat(roman: str, n):
key = {1000: 'm', 900: 'cm', 500: 'd', 400: 'cd', 100: 'c', 90: 'xc', 50: 'l', 40: 'xl', 10: 'x', 9: 'ix', 5: 'v', 4: 'iv', 1: 'i'}
m = 0
for base in [1000, 100, 10, 1]:
for mul in [9, 4, 5, 1, 1, 1]:
val = base * mul
if val in key and roman.startswith(key[val]):
m += val
roman = roman[len(key[val]):]
if mul == 9 or mul == 4:
break
return m == n | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"roman\": \"mmcdxiv\", \"n\": 2414}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"roman\": \"mmlviii\", \"n\": 2058}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"roman\": \"mcdlxvii\", \"n\": 1467}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"roman\": \"mdxxxiii\", \"n\": 1533}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"roman\": \"cxiv\", \"n\": 114}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"roman\": \"mmcdxiv\", \"n\": 114}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"roman\": \"cxiv\", \"n\": 1533}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"roman\": \"mmcdxiv\", \"n\": 2058}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"roman\": \"cxiv\", \"n\": 2058}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Convert integer 0 < n < 4000 to roman numerals, and make it lowercase\n// 11 => \"xi\"\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string roman, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(roman, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"mmcdxiv\", 2414, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mmlviii\", 2058, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mcdlxvii\", 1467, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mdxxxiii\", 1533, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cxiv\", 114, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mmcdxiv\", 114, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cxiv\", 1533, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mmcdxiv\", 2058, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cxiv\", 2058, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
208 | TP3/human_eval.PythagoreanTriples | C++ | Verifies that the inputs satisfy the problem:
Find m Pythagorean triples a^2 + b^2 == c^2 for integers 0 < a < b < c <= n, in sorted order
(n=6, m=1) => [[3, 4, 5]] | /**
* Verifies that the inputs satisfy the problem:
* Find m Pythagorean triples a^2 + b^2 == c^2 for integers 0 < a < b < c <= n, in sorted order
* (n=6, m=1) => [[3, 4, 5]]
*/
bool sat(vector<vector<int>> triples, int n, int m) { | bool sat(vector<vector<int>> triples, int n, int m) { | [
"triples",
"n",
"m"
] | def sat(triples: List[List[int]], n, m):
for (a, b, c) in triples:
if not (a * a + b * b == c * c and 0 < a < b < c <= n):
return False
return triples == sorted(triples) and len(triples) >= m | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 6, \"m\": 1}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"triples\": [[3, 4, 5], [5, 12, 13], [6, 8, 10], [8, 15, 17], [9, 12, 15], [12, 16, 20]], \"n\": 21, \"m\": 6}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 9, \"m\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"triples\": [[3, 4, 5], [5, 12, 13], [6, 8, 10], [8, 15, 17], [9, 12, 15], [12, 16, 20]], \"n\": 23, \"m\": 6}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"triples\": [[3, 4, 5], [5, 12, 13], [6, 8, 10]], \"n\": 14, \"m\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 6, \"m\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 21, \"m\": 3}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 6, \"m\": 6}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"triples\": [[3, 4, 5]], \"n\": 21, \"m\": 6}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find m Pythagorean triples a^2 + b^2 == c^2 for integers 0 < a < b < c <= n, in sorted order\n// (n=6, m=1) => [[3, 4, 5]]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> triples, int n, int m, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(triples, n, m), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{3, 4, 5}}, 6, 1, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}, {5, 12, 13}, {6, 8, 10}, {8, 15, 17}, {9, 12, 15}, {12, 16, 20}}, 21, 6, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}}, 9, 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}, {5, 12, 13}, {6, 8, 10}, {8, 15, 17}, {9, 12, 15}, {12, 16, 20}}, 23, 6, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}, {5, 12, 13}, {6, 8, 10}}, 14, 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}}, 6, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}}, 21, 3, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}}, 6, 6, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 4, 5}}, 21, 6, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
209 | TP3/human_eval.MostUnique | C++ | Verifies that the inputs satisfy the problem:
Select a string from the pool with the most unique characters
["woooow", "cow"] => "cow" | /**
* Verifies that the inputs satisfy the problem:
* Select a string from the pool with the most unique characters
* ["woooow", "cow"] => "cow"
*/
bool sat(string s, vector<string> pool) { | bool sat(string s, vector<string> pool) { | [
"s",
"pool"
] | def sat(s: str, pool):
if not s in pool:
return False
n = len(set(s))
for p in pool:
if not len(set(p)) <= n:
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"abcdefhijklmnop\", \"pool\": [\"cat\", \"catatatatctsa\", \"abcdefhijklmnop\", \"124259239185125\", \"\", \"foo\", \"unique\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"sibiloguhujuquenam\", \"pool\": [\"sibiloguhujuquenam\", \"nyzidikedutexti\", \"zatextuquyvakijahixa\", \"textujig\", \"cewynyrimatex\", \"textusaxinypuhyheza\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"gylapasugatextysar\", \"pool\": [\"gylapasugatextysar\", \"zapy\", \"hycokelet\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"fuhibatextixyburekan\", \"pool\": [\"te\", \"\", \"badypikyxucudil\", \"fuhibatextixyburekan\", \"chole\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"bulonu\", \"pool\": [\"th\", \"s\", \"bulonu\", \"r\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"abcdefhijklmnop\", \"pool\": []}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"abcdefhijklmnop\", \"pool\": [\"th\", \"s\", \"bulonu\", \"r\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"gylapasugatextysar\", \"pool\": [\"th\", \"s\", \"bulonu\", \"r\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"sibiloguhujuquenam\", \"pool\": [\"th\", \"s\", \"bulonu\", \"r\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Select a string from the pool with the most unique characters\n// [\"woooow\", \"cow\"] => \"cow\"\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<string> pool, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, pool), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"abcdefhijklmnop\", {\"cat\", \"catatatatctsa\", \"abcdefhijklmnop\", \"124259239185125\", \"\", \"foo\", \"unique\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"sibiloguhujuquenam\", {\"sibiloguhujuquenam\", \"nyzidikedutexti\", \"zatextuquyvakijahixa\", \"textujig\", \"cewynyrimatex\", \"textusaxinypuhyheza\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"gylapasugatextysar\", {\"gylapasugatextysar\", \"zapy\", \"hycokelet\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"fuhibatextixyburekan\", {\"te\", \"\", \"badypikyxucudil\", \"fuhibatextixyburekan\", \"chole\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bulonu\", {\"th\", \"s\", \"bulonu\", \"r\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"abcdefhijklmnop\", {}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"abcdefhijklmnop\", {\"th\", \"s\", \"bulonu\", \"r\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"gylapasugatextysar\", {\"th\", \"s\", \"bulonu\", \"r\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"sibiloguhujuquenam\", {\"th\", \"s\", \"bulonu\", \"r\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
210 | TP3/human_eval.HungryRabbits | C++ | Verifies that the inputs satisfy the problem:
For each triple of eaten, need, stock return a pair of total appetite and remaining
[[2, 5, 6], [3, 9, 22]] => [[7, 1], [12, 13]] | /**
* Verifies that the inputs satisfy the problem:
* For each triple of eaten, need, stock return a pair of total appetite and remaining
* [[2, 5, 6], [3, 9, 22]] => [[7, 1], [12, 13]]
*/
bool sat(vector<vector<int>> results, vector<vector<int>> stats) { | bool sat(vector<vector<int>> results, vector<vector<int>> stats) { | [
"results",
"stats"
] | def sat(results: List[List[int]], stats):
if not len(results) == len(stats):
return False
for ((tot, remaining), (eaten, need, stock)) in zip(results, stats):
if not tot - eaten == min(need, stock):
return False
if not (stock < need and remaining == 0 or (stock >= need and remaining + need == stock)):
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"results\": [[5, 15], [6, 0], [7, 2], [11, 4], [13, 97]], \"stats\": [[2, 3, 18], [4, 9, 2], [2, 5, 7], [3, 8, 12], [4, 9, 106]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"results\": [[7, 0], [1, 7], [10, 0], [8, 5], [11, 2], [13, 0]], \"stats\": [[4, 5, 3], [1, 0, 7], [3, 7, 7], [5, 3, 8], [9, 2, 4], [7, 6, 6]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"results\": [], \"stats\": []}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"results\": [[11, 0], [3, 0], [10, 6], [11, 1], [14, 3], [14, 0], [10, 0], [13, 0]], \"stats\": [[9, 2, 2], [2, 3, 1], [9, 1, 7], [9, 2, 3], [8, 6, 9], [9, 6, 5], [8, 9, 2], [9, 8, 4]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"results\": [[2, 8]], \"stats\": [[1, 1, 9]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"results\": [[7, 0], [1, 7], [10, 0], [8, 5], [11, 2], [13, 0]], \"stats\": []}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"results\": [], \"stats\": [[2, 3, 18], [4, 9, 2], [2, 5, 7], [3, 8, 12], [4, 9, 106]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"results\": [[5, 15], [6, 0], [7, 2], [11, 4], [13, 97]], \"stats\": []}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"results\": [[2, 8]], \"stats\": []}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// For each triple of eaten, need, stock return a pair of total appetite and remaining\n// [[2, 5, 6], [3, 9, 22]] => [[7, 1], [12, 13]]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> results, vector<vector<int>> stats, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(results, stats), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{5, 15}, {6, 0}, {7, 2}, {11, 4}, {13, 97}}, {{2, 3, 18}, {4, 9, 2}, {2, 5, 7}, {3, 8, 12}, {4, 9, 106}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{7, 0}, {1, 7}, {10, 0}, {8, 5}, {11, 2}, {13, 0}}, {{4, 5, 3}, {1, 0, 7}, {3, 7, 7}, {5, 3, 8}, {9, 2, 4}, {7, 6, 6}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{11, 0}, {3, 0}, {10, 6}, {11, 1}, {14, 3}, {14, 0}, {10, 0}, {13, 0}}, {{9, 2, 2}, {2, 3, 1}, {9, 1, 7}, {9, 2, 3}, {8, 6, 9}, {9, 6, 5}, {8, 9, 2}, {9, 8, 4}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{2, 8}}, {{1, 1, 9}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{7, 0}, {1, 7}, {10, 0}, {8, 5}, {11, 2}, {13, 0}}, {}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {{2, 3, 18}, {4, 9, 2}, {2, 5, 7}, {3, 8, 12}, {4, 9, 106}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{5, 15}, {6, 0}, {7, 2}, {11, 4}, {13, 97}}, {}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{2, 8}}, {}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
211 | TP3/human_eval.EvaluateOperators | C++ | Verifies that the inputs satisfy the problem:
Find a permutation of the operators +-\*\/^% which when inserted between nums evaluates to target
target=3, nums=[7, 2, 3, 4, 5, 1, 6] => ["+", "*", "**", "%", "\/\/", "-"]
# because 7 + 2 * 3 ** 4 % 5 \/\/ 1 - 6 == 3 | /**
* Verifies that the inputs satisfy the problem:
* Find a permutation of the operators +-\\*\\/^% which when inserted between nums evaluates to target
* target=3, nums=[7, 2, 3, 4, 5, 1, 6] => ["+", "*", "**", "%", "\\/\\/", "-"]
* # because 7 + 2 * 3 ** 4 % 5 \\/\\/ 1 - 6 == 3
*/
bool sat(vector<string> ops, int target, vector<int> nums) { | bool sat(vector<string> ops, int target, vector<int> nums) { | [
"ops",
"target",
"nums"
] | def sat(ops: List[str], target, nums):
if not (len(ops) == len(set(ops)) and set(ops) == {'**', '*', '+', '-', '//', '%'}):
return False
expr = str(nums[0])
for (n, op) in zip(nums[1:], ops):
expr += op + str(n)
return eval(expr) == target | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"ops\": [\"**\", \"//\", \"+\", \"%\", \"-\", \"*\"], \"target\": 2021, \"nums\": [4, 6, 2, 1, 1, 3, 9]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"ops\": [\"**\", \"*\", \"//\", \"%\", \"+\", \"-\"], \"target\": 4, \"nums\": [5, 4, 8, 9, 3, 6, 2]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"ops\": [\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"], \"target\": -24995, \"nums\": [1, 8, 5, 8, 5, 5, 5]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"ops\": [\"**\", \"%\", \"*\", \"+\", \"-\", \"//\"], \"target\": 6, \"nums\": [7, 4, 4, 2, 4, 1, 6]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"ops\": [\"**\", \"+\", \"%\", \"//\", \"*\", \"-\"], \"target\": 38, \"nums\": [6, 2, 1, 7, 1, 3, 1]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"ops\": [\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"], \"target\": 4, \"nums\": [4, 6, 2, 1, 1, 3, 9]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"ops\": [\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"], \"target\": 4, \"nums\": [7, 4, 4, 2, 4, 1, 6]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"ops\": [\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"], \"target\": 4, \"nums\": [5, 4, 8, 9, 3, 6, 2]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"ops\": [\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"], \"target\": 6, \"nums\": [1, 8, 5, 8, 5, 5, 5]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a permutation of the operators +-*/^% which when inserted between nums evaluates to target\n// target=3, nums=[7, 2, 3, 4, 5, 1, 6] => [\"+\", \"*\", \"**\", \"%\", \"//\", \"-\"]\n// # because 7 + 2 * 3 ** 4 % 5 // 1 - 6 == 3\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<string> ops, int target, vector<int> nums, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(ops, target, nums), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({\"**\", \"//\", \"+\", \"%\", \"-\", \"*\"}, 2021, {4, 6, 2, 1, 1, 3, 9}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"**\", \"*\", \"//\", \"%\", \"+\", \"-\"}, 4, {5, 4, 8, 9, 3, 6, 2}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"}, -24995, {1, 8, 5, 8, 5, 5, 5}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"**\", \"%\", \"*\", \"+\", \"-\", \"//\"}, 6, {7, 4, 4, 2, 4, 1, 6}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"**\", \"+\", \"%\", \"//\", \"*\", \"-\"}, 38, {6, 2, 1, 7, 1, 3, 1}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"}, 4, {4, 6, 2, 1, 1, 3, 9}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"}, 4, {7, 4, 4, 2, 4, 1, 6}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"}, 4, {5, 4, 8, 9, 3, 6, 2}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"//\", \"%\", \"-\", \"*\", \"**\", \"+\"}, 6, {1, 8, 5, 8, 5, 5, 5}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
212 | TP3/human_eval.ReverseCase | C++ | Verifies that the inputs satisfy the problem:
Reverse the case of all strings. For those strings which contain no letters, reverse the strings.
["Test", "!@#"] => ["tEST", "#@!"] | /**
* Verifies that the inputs satisfy the problem:
* Reverse the case of all strings. For those strings which contain no letters, reverse the strings.
* ["Test", "!@#"] => ["tEST", "#@!"]
*/
bool sat(vector<string> rev, vector<string> strs) { | bool sat(vector<string> rev, vector<string> strs) { | [
"rev",
"strs"
] | def sat(rev: List[str], strs):
if not len(rev) == len(strs):
return False
return all((r.swapcase() == s != r or r[::-1] == s == s.swapcase() for (r, s) in zip(rev, strs))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"rev\": [\"CAT\", \"U8U\", \"23521\", \"\", \"191\", \"4TuN8\", \"EWRwqtew\", \"I\", \"iOu\"], \"strs\": [\"cat\", \"u8u\", \"12532\", \"\", \"191\", \"4tUn8\", \"ewrWQTEW\", \"i\", \"IoU\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"rev\": [\"VywAKIfOweLeNyJoFa\", \"ro\", \"575\", \"349\", \"304\", \"292-\", \"TEXTy\"], \"strs\": [\"vYWakiFoWElEnYjOfA\", \"RO\", \"575\", \"943\", \"403\", \"-292\", \"textY\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"rev\": [\"322\", \"099\", \"306-\", \"mA\", \"369-\", \"Ko\", \"retHOfoHUvaNucYmYHic\", \"117\", \"478-\"], \"strs\": [\"223\", \"990\", \"-603\", \"Ma\", \"-963\", \"kO\", \"REThoFOhuVAnUCyMyhIC\", \"711\", \"-874\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"rev\": [\"253-\", \"WI\", \"787-\", \"607\", \"FyCHuC\", \"245\", \"jEjUZICHuNAhUGaC\", \"369\"], \"strs\": [\"-352\", \"wi\", \"-787\", \"706\", \"fYchUc\", \"542\", \"JeJuzichUnaHugAc\", \"963\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"rev\": [\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"], \"strs\": [\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"rev\": [\"VywAKIfOweLeNyJoFa\", \"ro\", \"575\", \"349\", \"304\", \"292-\", \"TEXTy\"], \"strs\": [\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"rev\": [\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"], \"strs\": [\"vYWakiFoWElEnYjOfA\", \"RO\", \"575\", \"943\", \"403\", \"-292\", \"textY\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"rev\": [\"CAT\", \"U8U\", \"23521\", \"\", \"191\", \"4TuN8\", \"EWRwqtew\", \"I\", \"iOu\"], \"strs\": [\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"rev\": [\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"], \"strs\": [\"cat\", \"u8u\", \"12532\", \"\", \"191\", \"4tUn8\", \"ewrWQTEW\", \"i\", \"IoU\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Reverse the case of all strings. For those strings which contain no letters, reverse the strings.\n// [\"Test\", \"!@#\"] => [\"tEST\", \"#@!\"]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<string> rev, vector<string> strs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(rev, strs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({\"CAT\", \"U8U\", \"23521\", \"\", \"191\", \"4TuN8\", \"EWRwqtew\", \"I\", \"iOu\"}, {\"cat\", \"u8u\", \"12532\", \"\", \"191\", \"4tUn8\", \"ewrWQTEW\", \"i\", \"IoU\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"VywAKIfOweLeNyJoFa\", \"ro\", \"575\", \"349\", \"304\", \"292-\", \"TEXTy\"}, {\"vYWakiFoWElEnYjOfA\", \"RO\", \"575\", \"943\", \"403\", \"-292\", \"textY\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"322\", \"099\", \"306-\", \"mA\", \"369-\", \"Ko\", \"retHOfoHUvaNucYmYHic\", \"117\", \"478-\"}, {\"223\", \"990\", \"-603\", \"Ma\", \"-963\", \"kO\", \"REThoFOhuVAnUCyMyhIC\", \"711\", \"-874\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"253-\", \"WI\", \"787-\", \"607\", \"FyCHuC\", \"245\", \"jEjUZICHuNAhUGaC\", \"369\"}, {\"-352\", \"wi\", \"-787\", \"706\", \"fYchUc\", \"542\", \"JeJuzichUnaHugAc\", \"963\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"}, {\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"VywAKIfOweLeNyJoFa\", \"ro\", \"575\", \"349\", \"304\", \"292-\", \"TEXTy\"}, {\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"}, {\"vYWakiFoWElEnYjOfA\", \"RO\", \"575\", \"943\", \"403\", \"-292\", \"textY\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"CAT\", \"U8U\", \"23521\", \"\", \"191\", \"4TuN8\", \"EWRwqtew\", \"I\", \"iOu\"}, {\"234\", \"-828\", \"330\", \"NateXt\", \"-524\", \"-196\", \"siciNUCewOCePUdiN\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"432\", \"828-\", \"033\", \"nATExT\", \"425-\", \"691-\", \"SICInucEWocEpuDIn\"}, {\"cat\", \"u8u\", \"12532\", \"\", \"191\", \"4tUn8\", \"ewrWQTEW\", \"i\", \"IoU\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
213 | TP3/human_eval.EvenBetween | C++ | Verifies that the inputs satisfy the problem:
Find integers [a, b] that are at least 5 apart and such that concatenating the even numbers
between them gives the string s
"32343638" => [31, 38] | /**
* Verifies that the inputs satisfy the problem:
* Find integers [a, b] that are at least 5 apart and such that concatenating the even numbers
* between them gives the string s
* "32343638" => [31, 38]
*/
bool sat(vector<int> ab, string s) { | bool sat(vector<int> ab, string s) { | [
"ab",
"s"
] | def sat(ab: List[int], s):
return abs(ab[0] - ab[1]) > 4 and s == ''.join((str(i) for i in range(min(ab), max(ab) + 1) if i % 2 == 0)) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"ab\": [32987, 33003], \"s\": \"3298832990329923299432996329983300033002\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"ab\": [38599, 38607], \"s\": \"38600386023860438606\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"ab\": [25403, 25409], \"s\": \"254042540625408\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"ab\": [32879, 32887], \"s\": \"32880328823288432886\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"ab\": [60627, 60637], \"s\": \"6062860630606326063460636\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"ab\": [38599, 38607], \"s\": \"254042540625408\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"ab\": [25403, 25409], \"s\": \"38600386023860438606\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"ab\": [25403, 25409], \"s\": \"32880328823288432886\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"ab\": [32987, 33003], \"s\": \"254042540625408\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find integers [a, b] that are at least 5 apart and such that concatenating the even numbers\n// between them gives the string s\n// \"32343638\" => [31, 38]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> ab, string s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(ab, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({32987, 33003}, \"3298832990329923299432996329983300033002\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({38599, 38607}, \"38600386023860438606\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({25403, 25409}, \"254042540625408\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({32879, 32887}, \"32880328823288432886\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({60627, 60637}, \"6062860630606326063460636\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({38599, 38607}, \"254042540625408\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({25403, 25409}, \"38600386023860438606\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({25403, 25409}, \"32880328823288432886\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({32987, 33003}, \"254042540625408\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
214 | TP3/codeforces.IsEven | C++ | Verifies that the inputs satisfy the problem:
Determine if n can be evenly divided into two equal numbers. (Easy) | /**
* Verifies that the inputs satisfy the problem:
* Determine if n can be evenly divided into two equal numbers. (Easy)
*/
bool sat(bool b, int n) { | bool sat(bool b, int n) { | [
"b",
"n"
] | def sat(b: bool, n):
i = 0
while i <= n:
if i + i == n:
return b == True
i += 1
return b == False | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"b\": true, \"n\": 10}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"b\": true, \"n\": 0}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"b\": false, \"n\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"b\": true, \"n\": 2}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"b\": false, \"n\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"b\": true, \"n\": 1}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"b\": false, \"n\": 0}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"b\": true, \"n\": 3}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"b\": false, \"n\": 2}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Determine if n can be evenly divided into two equal numbers. (Easy)\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(bool b, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(b, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(true, 10, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(true, 0, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(false, 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(true, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(false, 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(true, 1, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(false, 0, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(true, 3, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(false, 2, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
215 | TP3/codeforces.Abbreviate | C++ | Verifies that the inputs satisfy the problem:
Abbreviate strings longer than a given length by replacing everything but the first and last characters by
an integer indicating how many characters there were in between them. | /**
* Verifies that the inputs satisfy the problem:
* Abbreviate strings longer than a given length by replacing everything but the first and last characters by
* an integer indicating how many characters there were in between them.
*/
bool sat(string s, string word, int max_len) { | bool sat(string s, string word, int max_len) { | [
"s",
"word",
"max_len"
] | def sat(s: str, word, max_len):
if len(word) <= max_len:
return word == s
return int(s[1:-1]) == len(word[1:-1]) and word[0] == s[0] and (word[-1] == s[-1]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"a26m\", \"word\": \"antidisestablishmentarianism\", \"max_len\": 10}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"p20g\", \"word\": \"pawuzorythalirinasubyg\", \"max_len\": 12}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"j16h\", \"word\": \"jomodosigezyfulach\", \"max_len\": 5}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"bybakichop\", \"word\": \"bybakichop\", \"max_len\": 12}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"w23e\", \"word\": \"wywaxizodetextonigijalate\", \"max_len\": 5}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"j16h\", \"word\": \"bybakichop\", \"max_len\": 10}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"a26m\", \"word\": \"\", \"max_len\": 10}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"a26m\", \"word\": \"bybakichop\", \"max_len\": 12}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"a26m\", \"word\": \"bybakichop\", \"max_len\": 5}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Abbreviate strings longer than a given length by replacing everything but the first and last characters by\n// an integer indicating how many characters there were in between them.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string word, int max_len, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, word, max_len), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"a26m\", \"antidisestablishmentarianism\", 10, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"p20g\", \"pawuzorythalirinasubyg\", 12, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j16h\", \"jomodosigezyfulach\", 5, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bybakichop\", \"bybakichop\", 12, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"w23e\", \"wywaxizodetextonigijalate\", 5, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j16h\", \"bybakichop\", 10, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"a26m\", \"\", 10, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"a26m\", \"bybakichop\", 12, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"a26m\", \"bybakichop\", 5, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
216 | TP3/codeforces.SquareTiles | C++ | Verifies that the inputs satisfy the problem:
Find a minimal vector of corner locations for a×a tiles that covers [0, m] × [0, n] and does not double-cover
squares.
Sample Input:
m = 10
n = 9
a = 5
target = 4
Sample Output:
[[0, 0], [0, 5], [5, 0], [5, 5]] | /**
* Verifies that the inputs satisfy the problem:
* Find a minimal vector of corner locations for a×a tiles that covers [0, m] × [0, n] and does not double-cover
* squares.
* Sample Input:
* m = 10
* n = 9
* a = 5
* target = 4
* Sample Output:
* [[0, 0], [0, 5], [5, 0], [5, 5]]
*/
bool sat(vector<vector<int>> corners, int m, int n, int a, int target) { | bool sat(vector<vector<int>> corners, int m, int n, int a, int target) { | [
"corners",
"m",
"n",
"a",
"target"
] | def sat(corners: List[List[int]], m, n, a, target):
covered = {(i + x, j + y) for (i, j) in corners for x in range(a) for y in range(a)}
if not len(covered) == len(corners) * a * a:
return False
return len(corners) <= target and covered.issuperset({(x, y) for x in range(m) for y in range(n)}) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"corners\": [[0, 0], [0, 5], [5, 0], [5, 5]], \"m\": 10, \"n\": 9, \"a\": 5, \"target\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"corners\": [[0, 0], [0, 9], [0, 18], [0, 27], [0, 36], [0, 45], [0, 54], [0, 63], [0, 72], [0, 81], [0, 90], [0, 99], [0, 108], [0, 117], [0, 126], [9, 0], [9, 9], [9, 18], [9, 27], [9, 36], [9, 45], [9, 54], [9, 63], [9, 72], [9, 81], [9, 90], [9, 99], [9, 108], [9, 117], [9, 126], [18, 0], [18, 9], [18, 18], [18, 27], [18, 36], [18, 45], [18, 54], [18, 63], [18, 72], [18, 81], [18, 90], [18, 99], [18, 108], [18, 117], [18, 126]], \"m\": 22, \"n\": 129, \"a\": 9, \"target\": 45}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"corners\": [[0, 0], [0, 10], [0, 20], [0, 30], [0, 40], [0, 50], [0, 60], [0, 70], [0, 80], [0, 90], [0, 100], [0, 110], [0, 120], [0, 130], [0, 140], [0, 150], [0, 160], [0, 170], [0, 180], [0, 190], [0, 200], [0, 210], [0, 220], [0, 230], [0, 240], [0, 250], [0, 260], [0, 270], [0, 280], [0, 290], [0, 300], [0, 310], [0, 320], [0, 330], [0, 340], [0, 350], [0, 360], [0, 370], [0, 380], [0, 390], [0, 400], [0, 410], [0, 420], [0, 430], [0, 440], [0, 450], [0, 460], [0, 470], [0, 480], [0, 490], [0, 500], [0, 510], [0, 520], [0, 530], [0, 540], [0, 550], [0, 560], [0, 570], [0, 580], [0, 590], [0, 600], [0, 610], [0, 620], [0, 630], [0, 640], [0, 650], [0, 660], [0, 670], [0, 680], [0, 690], [0, 700], [0, 710], [0, 720], [0, 730], [0, 740], [0, 750], [0, 760], [0, 770], [0, 780], [0, 790], [0, 800], [0, 810], [0, 820], [0, 830], [0, 840]], \"m\": 6, \"n\": 849, \"a\": 10, \"target\": 89}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"corners\": [[0, 0], [2, 0], [4, 0], [6, 0], [8, 0], [10, 0], [12, 0], [14, 0], [16, 0], [18, 0], [20, 0], [22, 0], [24, 0], [26, 0], [28, 0], [30, 0], [32, 0], [34, 0], [36, 0], [38, 0], [40, 0], [42, 0], [44, 0], [46, 0], [48, 0], [50, 0], [52, 0], [54, 0], [56, 0], [58, 0], [60, 0], [62, 0], [64, 0], [66, 0], [68, 0], [70, 0], [72, 0]], \"m\": 74, \"n\": 1, \"a\": 2, \"target\": 38}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"corners\": [[0, 0], [0, 5], [5, 0], [5, 5]], \"m\": 6, \"n\": 9, \"a\": 2, \"target\": 4}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"corners\": [[0, 0], [0, 5], [5, 0], [5, 5]], \"m\": 74, \"n\": 1, \"a\": 5, \"target\": 4}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"corners\": [[0, 0], [0, 5], [5, 0], [5, 5]], \"m\": 74, \"n\": 1, \"a\": 2, \"target\": 4}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"corners\": [[0, 0], [0, 5], [5, 0], [5, 5]], \"m\": 6, \"n\": 1, \"a\": 2, \"target\": 4}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a minimal list of corner locations for a×a tiles that covers [0, m] × [0, n] and does not double-cover\n// squares.\n// Sample Input:\n// m = 10\n// n = 9\n// a = 5\n// target = 4\n// Sample Output:\n// [[0, 0], [0, 5], [5, 0], [5, 5]]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> corners, int m, int n, int a, int target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(corners, m, n, a, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 0}, {0, 5}, {5, 0}, {5, 5}}, 10, 9, 5, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 9}, {0, 18}, {0, 27}, {0, 36}, {0, 45}, {0, 54}, {0, 63}, {0, 72}, {0, 81}, {0, 90}, {0, 99}, {0, 108}, {0, 117}, {0, 126}, {9, 0}, {9, 9}, {9, 18}, {9, 27}, {9, 36}, {9, 45}, {9, 54}, {9, 63}, {9, 72}, {9, 81}, {9, 90}, {9, 99}, {9, 108}, {9, 117}, {9, 126}, {18, 0}, {18, 9}, {18, 18}, {18, 27}, {18, 36}, {18, 45}, {18, 54}, {18, 63}, {18, 72}, {18, 81}, {18, 90}, {18, 99}, {18, 108}, {18, 117}, {18, 126}}, 22, 129, 9, 45, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 10}, {0, 20}, {0, 30}, {0, 40}, {0, 50}, {0, 60}, {0, 70}, {0, 80}, {0, 90}, {0, 100}, {0, 110}, {0, 120}, {0, 130}, {0, 140}, {0, 150}, {0, 160}, {0, 170}, {0, 180}, {0, 190}, {0, 200}, {0, 210}, {0, 220}, {0, 230}, {0, 240}, {0, 250}, {0, 260}, {0, 270}, {0, 280}, {0, 290}, {0, 300}, {0, 310}, {0, 320}, {0, 330}, {0, 340}, {0, 350}, {0, 360}, {0, 370}, {0, 380}, {0, 390}, {0, 400}, {0, 410}, {0, 420}, {0, 430}, {0, 440}, {0, 450}, {0, 460}, {0, 470}, {0, 480}, {0, 490}, {0, 500}, {0, 510}, {0, 520}, {0, 530}, {0, 540}, {0, 550}, {0, 560}, {0, 570}, {0, 580}, {0, 590}, {0, 600}, {0, 610}, {0, 620}, {0, 630}, {0, 640}, {0, 650}, {0, 660}, {0, 670}, {0, 680}, {0, 690}, {0, 700}, {0, 710}, {0, 720}, {0, 730}, {0, 740}, {0, 750}, {0, 760}, {0, 770}, {0, 780}, {0, 790}, {0, 800}, {0, 810}, {0, 820}, {0, 830}, {0, 840}}, 6, 849, 10, 89, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 0}, {4, 0}, {6, 0}, {8, 0}, {10, 0}, {12, 0}, {14, 0}, {16, 0}, {18, 0}, {20, 0}, {22, 0}, {24, 0}, {26, 0}, {28, 0}, {30, 0}, {32, 0}, {34, 0}, {36, 0}, {38, 0}, {40, 0}, {42, 0}, {44, 0}, {46, 0}, {48, 0}, {50, 0}, {52, 0}, {54, 0}, {56, 0}, {58, 0}, {60, 0}, {62, 0}, {64, 0}, {66, 0}, {68, 0}, {70, 0}, {72, 0}}, 74, 1, 2, 38, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 5}, {5, 0}, {5, 5}}, 6, 9, 2, 4, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 5}, {5, 0}, {5, 5}}, 74, 1, 5, 4, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 5}, {5, 0}, {5, 5}}, 74, 1, 2, 4, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 5}, {5, 0}, {5, 5}}, 6, 1, 2, 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
217 | TP3/codeforces.EasyTwos | C++ | Verifies that the inputs satisfy the problem:
Given vector of vectors of triples of integers, return True for each vector with a total of at least 2 and
False for each other vector. | /**
* Verifies that the inputs satisfy the problem:
* Given vector of vectors of triples of integers, return True for each vector with a total of at least 2 and
* False for each other vector.
*/
bool sat(vector<bool> lb, vector<vector<int>> trips) { | bool sat(vector<bool> lb, vector<vector<int>> trips) { | [
"lb",
"trips"
] | def sat(lb: List[bool], trips):
return len(lb) == len(trips) and all((b is True if sum(s) >= 2 else b is False for (b, s) in zip(lb, trips))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"lb\": [true, false, false, true, true, true, true], \"trips\": [[1, 1, 0], [1, 0, 0], [0, 0, 0], [0, 1, 1], [0, 1, 1], [1, 1, 1], [1, 0, 1]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"lb\": [true, false, true, false], \"trips\": [[1, 1, 1], [1, 0, 0], [1, 1, 1], [0, 0, 0]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"lb\": [false, false, true, true], \"trips\": [[0, 0, 0], [1, 0, 0], [0, 1, 1], [0, 1, 1]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"lb\": [false, false, true, true, true, true, false, false, true, true, false, true], \"trips\": [[0, 0, 0], [0, 0, 1], [0, 1, 1], [1, 1, 1], [1, 1, 0], [0, 1, 1], [1, 0, 0], [0, 0, 0], [1, 0, 1], [1, 1, 0], [0, 0, 1], [1, 0, 1]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"lb\": [false, true, false, true], \"trips\": [[0, 0, 1], [0, 1, 1], [0, 0, 1], [0, 1, 1]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"lb\": [false, false, true, true], \"trips\": [[0, 0, 1], [0, 1, 1], [0, 0, 1], [0, 1, 1]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"lb\": [true, false, true, false], \"trips\": [[0, 0, 0], [1, 0, 0], [0, 1, 1], [0, 1, 1]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"lb\": [false, true, false, true], \"trips\": [[0, 0, 0], [1, 0, 0], [0, 1, 1], [0, 1, 1]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"lb\": [false, true, false, true], \"trips\": [[1, 1, 1], [1, 0, 0], [1, 1, 1], [0, 0, 0]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a list of lists of triples of integers, return True for each list with a total of at least 2 and\n// False for each other list.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<bool> lb, vector<vector<int>> trips, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(lb, trips), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({true, false, false, true, true, true, true}, {{1, 1, 0}, {1, 0, 0}, {0, 0, 0}, {0, 1, 1}, {0, 1, 1}, {1, 1, 1}, {1, 0, 1}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({true, false, true, false}, {{1, 1, 1}, {1, 0, 0}, {1, 1, 1}, {0, 0, 0}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, false, true, true}, {{0, 0, 0}, {1, 0, 0}, {0, 1, 1}, {0, 1, 1}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, false, true, true, true, true, false, false, true, true, false, true}, {{0, 0, 0}, {0, 0, 1}, {0, 1, 1}, {1, 1, 1}, {1, 1, 0}, {0, 1, 1}, {1, 0, 0}, {0, 0, 0}, {1, 0, 1}, {1, 1, 0}, {0, 0, 1}, {1, 0, 1}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, true, false, true}, {{0, 0, 1}, {0, 1, 1}, {0, 0, 1}, {0, 1, 1}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, false, true, true}, {{0, 0, 1}, {0, 1, 1}, {0, 0, 1}, {0, 1, 1}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({true, false, true, false}, {{0, 0, 0}, {1, 0, 0}, {0, 1, 1}, {0, 1, 1}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, true, false, true}, {{0, 0, 0}, {1, 0, 0}, {0, 1, 1}, {0, 1, 1}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({false, true, false, true}, {{1, 1, 1}, {1, 0, 0}, {1, 1, 1}, {0, 0, 0}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
218 | TP3/codeforces.DecreasingCountComparison | C++ | Verifies that the inputs satisfy the problem:
Given vector of non-increasing integers and given an integer k, determine how many positive integers in the list
are at least as large as the kth. | /**
* Verifies that the inputs satisfy the problem:
* Given vector of non-increasing integers and given an integer k, determine how many positive integers in the list
* are at least as large as the kth.
*/
bool sat(int n, vector<int> scores, int k) { | bool sat(int n, vector<int> scores, int k) { | [
"n",
"scores",
"k"
] | def sat(n: int, scores, k):
if not all((scores[i] >= scores[i + 1] for i in range(len(scores) - 1))):
return False
return all((s >= scores[k] and s > 0 for s in scores[:n])) and all((s < scores[k] or s <= 0 for s in scores[n:])) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 8, \"scores\": [100, 95, 80, 70, 65, 9, 9, 9, 4, 2, 1], \"k\": 6}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 6, \"scores\": [32, 32, 31, 30, 25, 25, 21, 20, 17, 17, 16, 15, 15, 14, 11, 2, 0], \"k\": 4}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 2, \"scores\": [44, 42, 41, 41, 40, 40, 39, 38, 38, 38, 37, 33, 32, 31, 31, 31, 30, 29, 28, 26, 25, 24, 24, 23, 23, 22, 20, 20, 20, 18, 17, 17, 16, 16, 12, 9, 9, 7, 6, 5, 4, 2], \"k\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 6, \"scores\": [36, 27, 24, 19, 15, 15, 8, 8, 5], \"k\": 4}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 3, \"scores\": [20, 19, 17, 13, 12, 11, 10, 6], \"k\": 2}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 2, \"scores\": [20, 19, 17, 13, 12, 11, 10, 6], \"k\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 6, \"scores\": [20, 19, 17, 13, 12, 11, 10, 6], \"k\": 4}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 6, \"scores\": [20, 19, 17, 13, 12, 11, 10, 6], \"k\": 1}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 6, \"scores\": [20, 19, 17, 13, 12, 11, 10, 6], \"k\": 2}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a list of non-increasing integers and given an integer k, determine how many positive integers in the list\n// are at least as large as the kth.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, vector<int> scores, int k, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, scores, k), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(8, {100, 95, 80, 70, 65, 9, 9, 9, 4, 2, 1}, 6, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, {32, 32, 31, 30, 25, 25, 21, 20, 17, 17, 16, 15, 15, 14, 11, 2, 0}, 4, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2, {44, 42, 41, 41, 40, 40, 39, 38, 38, 38, 37, 33, 32, 31, 31, 31, 30, 29, 28, 26, 25, 24, 24, 23, 23, 22, 20, 20, 20, 18, 17, 17, 16, 16, 12, 9, 9, 7, 6, 5, 4, 2}, 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, {36, 27, 24, 19, 15, 15, 8, 8, 5}, 4, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, {20, 19, 17, 13, 12, 11, 10, 6}, 2, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2, {20, 19, 17, 13, 12, 11, 10, 6}, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, {20, 19, 17, 13, 12, 11, 10, 6}, 4, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, {20, 19, 17, 13, 12, 11, 10, 6}, 1, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, {20, 19, 17, 13, 12, 11, 10, 6}, 2, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
219 | TP3/codeforces.VowelDrop | C++ | Verifies that the inputs satisfy the problem:
Given an alphabetic string s, remove all vowels (aeiouy\/AEIOUY), insert a "." before each remaining letter
(consonant), and make everything lowercase.
Sample Input:
s = "Problems"
Sample Output:
.p.r.b.l.m.s | /**
* Verifies that the inputs satisfy the problem:
* Given an alphabetic string s, remove all vowels (aeiouy\\/AEIOUY), insert a "." before each remaining letter
* (consonant), and make everything lowercase.
* Sample Input:
* s = "Problems"
* Sample Output:
* .p.r.b.l.m.s
*/
bool sat(string t, string s) { | bool sat(string t, string s) { | [
"t",
"s"
] | def sat(t: str, s):
i = 0
for c in s.lower():
if c in 'aeiouy':
continue
if not t[i] == '.':
return False
i += 1
if not t[i] == c:
return False
i += 1
return i == len(t) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"t\": \".p.r.b.l.m.s\", \"s\": \"Problems\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"t\": \".v.h.j.q.l.m.c.b.d.p.w.p.w.t.n\", \"s\": \"VahOjaquAlYMEcubidePYwApawAtonE\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"t\": \".k.g.h.d.h.k.n.j.b.z.k.m.d.t.d.z.z.v.l\", \"s\": \"kAgIHAdiHEKoNAJubozUKaMYDETAdeZyziveL\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"t\": \".n.x.d.n.m.r.z.t.x.t.d.t.h.l.t.h.t.x.t.j.l.q.n.t.x.t\", \"s\": \"NOxADaNIMiReZoTeXtODUtHulyTHETextojoLeQuaNutEXtE\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"t\": \".m.k.w.n.m.n.q.p.c.v\", \"s\": \"MEkUWonymYNAQUypEcIv\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"t\": \".p.r.b.l.m.s\", \"s\": \"VahOjaquAlYMEcubidePYwApawAtonE\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"t\": \".p.r.b.l.m.s\", \"s\": \"\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"t\": \".v.h.j.q.l.m.c.b.d.p.w.p.w.t.n\", \"s\": \"Problems\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"t\": \".m.k.w.n.m.n.q.p.c.v\", \"s\": \"Problems\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given an alphabetic string s, remove all vowels (aeiouy/AEIOUY), insert a \".\" before each remaining letter\n// (consonant), and make everything lowercase.\n// Sample Input:\n// s = \"Problems\"\n// Sample Output:\n// .p.r.b.l.m.s\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string t, string s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(t, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\".p.r.b.l.m.s\", \"Problems\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".v.h.j.q.l.m.c.b.d.p.w.p.w.t.n\", \"VahOjaquAlYMEcubidePYwApawAtonE\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".k.g.h.d.h.k.n.j.b.z.k.m.d.t.d.z.z.v.l\", \"kAgIHAdiHEKoNAJubozUKaMYDETAdeZyziveL\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".n.x.d.n.m.r.z.t.x.t.d.t.h.l.t.h.t.x.t.j.l.q.n.t.x.t\", \"NOxADaNIMiReZoTeXtODUtHulyTHETextojoLeQuaNutEXtE\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".m.k.w.n.m.n.q.p.c.v\", \"MEkUWonymYNAQUypEcIv\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".p.r.b.l.m.s\", \"VahOjaquAlYMEcubidePYwApawAtonE\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".p.r.b.l.m.s\", \"\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".v.h.j.q.l.m.c.b.d.p.w.p.w.t.n\", \"Problems\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\".m.k.w.n.m.n.q.p.c.v\", \"Problems\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
220 | TP3/codeforces.DominoTile | C++ | Verifies that the inputs satisfy the problem:
Tile an m x n checkerboard with 2 x 1 tiles. The solution is vector of fourtuples [i1, j1, i2, j2] with
i2 == i1 and j2 == j1 + 1 or i2 == i1 + 1 and j2 == j1 with no overlap. | /**
* Verifies that the inputs satisfy the problem:
* Tile an m x n checkerboard with 2 x 1 tiles. The solution is vector of fourtuples [i1, j1, i2, j2] with
* i2 == i1 and j2 == j1 + 1 or i2 == i1 + 1 and j2 == j1 with no overlap.
*/
bool sat(vector<vector<int>> squares, int m, int n, int target) { | bool sat(vector<vector<int>> squares, int m, int n, int target) { | [
"squares",
"m",
"n",
"target"
] | def sat(squares: List[List[int]], m, n, target):
covered = []
for (i1, j1, i2, j2) in squares:
if not (0 <= i1 <= i2 < m and 0 <= j1 <= j2 < n and (j2 - j1 + i2 - i1 == 1)):
return False
covered += [(i1, j1), (i2, j2)]
return len(set(covered)) == len(covered) == target | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"squares\": [[0, 0, 1, 0], [0, 1, 1, 1], [0, 2, 1, 2], [0, 3, 1, 3], [0, 4, 1, 4], [2, 0, 3, 0], [2, 1, 3, 1], [2, 2, 3, 2], [2, 3, 3, 3], [2, 4, 3, 4], [4, 0, 5, 0], [4, 1, 5, 1], [4, 2, 5, 2], [4, 3, 5, 3], [4, 4, 5, 4], [6, 0, 7, 0], [6, 1, 7, 1], [6, 2, 7, 2], [6, 3, 7, 3], [6, 4, 7, 4], [8, 0, 9, 0], [8, 1, 9, 1], [8, 2, 9, 2], [8, 3, 9, 3], [8, 4, 9, 4]], \"m\": 10, \"n\": 5, \"target\": 50}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"squares\": [[0, 0, 1, 0], [0, 1, 1, 1], [0, 2, 1, 2], [2, 0, 3, 0], [2, 1, 3, 1], [2, 2, 3, 2], [4, 0, 5, 0], [4, 1, 5, 1], [4, 2, 5, 2], [6, 0, 7, 0], [6, 1, 7, 1], [6, 2, 7, 2]], \"m\": 8, \"n\": 3, \"target\": 24}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"squares\": [[1, 0, 2, 0], [1, 1, 2, 1], [1, 2, 2, 2], [1, 3, 2, 3], [1, 4, 2, 4], [1, 5, 2, 5], [1, 6, 2, 6], [3, 0, 4, 0], [3, 1, 4, 1], [3, 2, 4, 2], [3, 3, 4, 3], [3, 4, 4, 4], [3, 5, 4, 5], [3, 6, 4, 6], [5, 0, 6, 0], [5, 1, 6, 1], [5, 2, 6, 2], [5, 3, 6, 3], [5, 4, 6, 4], [5, 5, 6, 5], [5, 6, 6, 6], [7, 0, 8, 0], [7, 1, 8, 1], [7, 2, 8, 2], [7, 3, 8, 3], [7, 4, 8, 4], [7, 5, 8, 5], [7, 6, 8, 6], [0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 9, \"n\": 7, \"target\": 62}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"squares\": [[1, 0, 2, 0], [1, 1, 2, 1], [1, 2, 2, 2], [3, 0, 4, 0], [3, 1, 4, 1], [3, 2, 4, 2], [5, 0, 6, 0], [5, 1, 6, 1], [5, 2, 6, 2], [7, 0, 8, 0], [7, 1, 8, 1], [7, 2, 8, 2], [0, 0, 0, 1]], \"m\": 9, \"n\": 3, \"target\": 26}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"squares\": [[0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 1, \"n\": 7, \"target\": 6}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"squares\": [[0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 1, \"n\": 5, \"target\": 6}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"squares\": [[0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 9, \"n\": 5, \"target\": 6}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"squares\": [[0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 9, \"n\": 3, \"target\": 6}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"squares\": [[0, 0, 0, 1], [0, 2, 0, 3], [0, 4, 0, 5]], \"m\": 8, \"n\": 3, \"target\": 6}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Tile an m x n checkerboard with 2 x 1 tiles. The solution is a list of fourtuples [i1, j1, i2, j2] with\n// i2 == i1 and j2 == j1 + 1 or i2 == i1 + 1 and j2 == j1 with no overlap.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> squares, int m, int n, int target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(squares, m, n, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 0, 1, 0}, {0, 1, 1, 1}, {0, 2, 1, 2}, {0, 3, 1, 3}, {0, 4, 1, 4}, {2, 0, 3, 0}, {2, 1, 3, 1}, {2, 2, 3, 2}, {2, 3, 3, 3}, {2, 4, 3, 4}, {4, 0, 5, 0}, {4, 1, 5, 1}, {4, 2, 5, 2}, {4, 3, 5, 3}, {4, 4, 5, 4}, {6, 0, 7, 0}, {6, 1, 7, 1}, {6, 2, 7, 2}, {6, 3, 7, 3}, {6, 4, 7, 4}, {8, 0, 9, 0}, {8, 1, 9, 1}, {8, 2, 9, 2}, {8, 3, 9, 3}, {8, 4, 9, 4}}, 10, 5, 50, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 1, 0}, {0, 1, 1, 1}, {0, 2, 1, 2}, {2, 0, 3, 0}, {2, 1, 3, 1}, {2, 2, 3, 2}, {4, 0, 5, 0}, {4, 1, 5, 1}, {4, 2, 5, 2}, {6, 0, 7, 0}, {6, 1, 7, 1}, {6, 2, 7, 2}}, 8, 3, 24, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{1, 0, 2, 0}, {1, 1, 2, 1}, {1, 2, 2, 2}, {1, 3, 2, 3}, {1, 4, 2, 4}, {1, 5, 2, 5}, {1, 6, 2, 6}, {3, 0, 4, 0}, {3, 1, 4, 1}, {3, 2, 4, 2}, {3, 3, 4, 3}, {3, 4, 4, 4}, {3, 5, 4, 5}, {3, 6, 4, 6}, {5, 0, 6, 0}, {5, 1, 6, 1}, {5, 2, 6, 2}, {5, 3, 6, 3}, {5, 4, 6, 4}, {5, 5, 6, 5}, {5, 6, 6, 6}, {7, 0, 8, 0}, {7, 1, 8, 1}, {7, 2, 8, 2}, {7, 3, 8, 3}, {7, 4, 8, 4}, {7, 5, 8, 5}, {7, 6, 8, 6}, {0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 9, 7, 62, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{1, 0, 2, 0}, {1, 1, 2, 1}, {1, 2, 2, 2}, {3, 0, 4, 0}, {3, 1, 4, 1}, {3, 2, 4, 2}, {5, 0, 6, 0}, {5, 1, 6, 1}, {5, 2, 6, 2}, {7, 0, 8, 0}, {7, 1, 8, 1}, {7, 2, 8, 2}, {0, 0, 0, 1}}, 9, 3, 26, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 1, 7, 6, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 1, 5, 6, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 9, 5, 6, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 9, 3, 6, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0, 0, 1}, {0, 2, 0, 3}, {0, 4, 0, 5}}, 8, 3, 6, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
221 | TP3/codeforces.IncDec | C++ | Verifies that the inputs satisfy the problem:
Given a sequence of operations "++x", "x++", "--x", "x--", and a target value, find initial value so that the
final value is the target value.
Sample Input:
ops = ["x++", "--x", "--x"]
target = 12
Sample Output:
13 | /**
* Verifies that the inputs satisfy the problem:
* Given a sequence of operations "++x", "x++", "--x", "x--", and a target value, find initial value so that the
* final value is the target value.
* Sample Input:
* ops = ["x++", "--x", "--x"]
* target = 12
* Sample Output:
* 13
*/
bool sat(int n, vector<string> ops, int target) { | bool sat(int n, vector<string> ops, int target) { | [
"n",
"ops",
"target"
] | def sat(n: int, ops, target):
for op in ops:
if op in ['++x', 'x++']:
n += 1
else:
if not op in ['--x', 'x--']:
return False
n -= 1
return n == target | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 19143213, \"ops\": [\"x++\", \"--x\", \"--x\"], \"target\": 19143212}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 88812, \"ops\": [\"x++\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x--\", \"x--\", \"x--\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"x--\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"x--\", \"x++\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x++\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"++x\", \"--x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"x++\", \"x++\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"--x\", \"++x\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"--x\", \"--x\", \"--x\", \"--x\", \"x++\", \"++x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"--x\", \"x++\", \"++x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"--x\", \"++x\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\"], \"target\": 88808}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 28149, \"ops\": [\"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x++\", \"++x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"x++\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"--x\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"++x\", \"--x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"x++\", \"--x\", \"++x\", \"--x\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x++\", \"x++\", \"--x\", \"--x\", \"x--\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"--x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"--x\", \"--x\", \"x--\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"--x\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x++\", \"--x\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"x++\", \"x--\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"x++\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"++x\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"--x\", \"++x\", \"--x\", \"x++\", \"x++\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"x++\", \"x--\", \"++x\", \"x--\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"++x\", \"x++\", \"x++\", \"--x\", \"++x\", \"++x\", \"--x\", \"++x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"x++\", \"x++\", \"--x\", \"++x\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"x--\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x++\", \"++x\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x--\", \"--x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"x++\", \"x++\", \"x++\", \"x++\", \"++x\", \"x--\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"x--\", \"++x\", \"x--\", \"x++\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"--x\", \"--x\", \"--x\", \"++x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"--x\", \"x++\", \"x--\", \"--x\", \"x--\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"x--\", \"x++\", \"x++\", \"++x\", \"x--\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"++x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x++\"], \"target\": 28110}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 82833, \"ops\": [\"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"--x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"x--\", \"x++\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"++x\", \"x++\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"--x\", \"x++\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"x++\", \"x--\", \"--x\", \"++x\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"--x\", \"--x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"++x\", \"--x\", \"++x\", \"x++\", \"x--\", \"x++\", \"x--\", \"x--\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x--\", \"x++\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"--x\", \"++x\", \"x++\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x++\", \"x++\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"--x\", \"x++\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\"], \"target\": 82823}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 61814, \"ops\": [\"x--\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"x--\"], \"target\": 61813}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 61814, \"ops\": [\"x++\", \"--x\", \"--x\"], \"target\": 28110}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 28149, \"ops\": [\"x++\", \"--x\", \"--x\"], \"target\": 28110}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 61814, \"ops\": [\"x++\", \"--x\", \"--x\"], \"target\": 82823}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 28149, \"ops\": [\"x++\", \"--x\", \"--x\"], \"target\": 61813}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a sequence of operations \"++x\", \"x++\", \"--x\", \"x--\", and a target value, find initial value so that the\n// final value is the target value.\n// Sample Input:\n// ops = [\"x++\", \"--x\", \"--x\"]\n// target = 12\n// Sample Output:\n// 13\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, vector<string> ops, int target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, ops, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(19143213, {\"x++\", \"--x\", \"--x\"}, 19143212, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(88812, {\"x++\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x--\", \"x--\", \"x--\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"x--\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"x--\", \"x++\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x++\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"++x\", \"--x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"x++\", \"x++\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"--x\", \"++x\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"--x\", \"--x\", \"--x\", \"--x\", \"x++\", \"++x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"--x\", \"x++\", \"++x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"--x\", \"++x\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\"}, 88808, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(28149, {\"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x++\", \"++x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"x++\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"--x\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"++x\", \"--x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"x++\", \"--x\", \"++x\", \"--x\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x++\", \"x++\", \"--x\", \"--x\", \"x--\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"--x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"--x\", \"--x\", \"x--\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"--x\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"x--\", \"++x\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x++\", \"--x\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"x++\", \"x--\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"x++\", \"--x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"++x\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"--x\", \"++x\", \"--x\", \"x++\", \"x++\", \"x++\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x--\", \"++x\", \"--x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"x--\", \"--x\", \"x++\", \"x--\", \"++x\", \"x--\", \"++x\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"++x\", \"x++\", \"x++\", \"--x\", \"++x\", \"++x\", \"--x\", \"++x\", \"x--\", \"x++\", \"++x\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"x++\", \"x++\", \"--x\", \"++x\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"x--\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x++\", \"++x\", \"x--\", \"x--\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"++x\", \"++x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"++x\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x++\", \"++x\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x++\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x--\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x--\", \"--x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"x++\", \"++x\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x++\", \"x++\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"--x\", \"x++\", \"x--\", \"--x\", \"x++\", \"++x\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x++\", \"x++\", \"--x\", \"x--\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"x--\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"x--\", \"x--\", \"x++\", \"x++\", \"++x\", \"x++\", \"x++\", \"x++\", \"x++\", \"++x\", \"x--\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"x--\", \"++x\", \"x--\", \"x++\", \"++x\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"--x\", \"--x\", \"--x\", \"--x\", \"++x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"--x\", \"x++\", \"x--\", \"--x\", \"x--\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"x--\", \"x++\", \"x++\", \"++x\", \"x--\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x--\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"x--\", \"--x\", \"x--\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"x--\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"x--\", \"++x\", \"--x\", \"x--\", \"x++\", \"x--\", \"++x\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x++\"}, 28110, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(82833, {\"--x\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"--x\", \"--x\", \"x--\", \"--x\", \"--x\", \"++x\", \"++x\", \"++x\", \"x++\", \"--x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"x--\", \"x++\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"++x\", \"x++\", \"x--\", \"--x\", \"x--\", \"x++\", \"x--\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"++x\", \"++x\", \"x++\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"++x\", \"x++\", \"++x\", \"--x\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"--x\", \"++x\", \"--x\", \"x--\", \"++x\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"x--\", \"++x\", \"x--\", \"x--\", \"x--\", \"++x\", \"x--\", \"++x\", \"x++\", \"x--\", \"x++\", \"++x\", \"x++\", \"--x\", \"--x\", \"--x\", \"x++\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"x--\", \"--x\", \"x--\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"--x\", \"++x\", \"--x\", \"x--\", \"--x\", \"x++\", \"--x\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"x++\", \"x--\", \"--x\", \"++x\", \"--x\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"x++\", \"x--\", \"x--\", \"x--\", \"++x\", \"--x\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"--x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"x--\", \"x++\", \"--x\", \"x++\", \"++x\", \"--x\", \"x--\", \"--x\", \"--x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x--\", \"++x\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"++x\", \"x++\", \"x--\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x++\", \"--x\", \"x++\", \"x--\", \"--x\", \"x++\", \"x++\", \"++x\", \"--x\", \"++x\", \"x++\", \"x--\", \"x++\", \"x--\", \"x--\", \"x--\", \"x++\", \"x++\", \"--x\", \"--x\", \"x--\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"++x\", \"x--\", \"x++\", \"x++\", \"x++\", \"++x\", \"++x\", \"--x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\", \"x--\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"x--\", \"--x\", \"--x\", \"x++\", \"--x\", \"x--\", \"x++\", \"x++\", \"++x\", \"x--\", \"++x\", \"++x\", \"x++\", \"x--\", \"--x\", \"++x\", \"--x\", \"x--\", \"--x\", \"++x\", \"--x\", \"--x\", \"++x\", \"x++\", \"--x\", \"x++\", \"--x\", \"x--\", \"++x\", \"--x\", \"x--\", \"x--\", \"x++\", \"++x\", \"x++\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"++x\", \"x++\", \"x++\", \"x++\", \"++x\", \"++x\", \"x++\", \"++x\", \"++x\", \"++x\", \"x--\", \"++x\", \"x--\", \"x--\", \"x++\", \"--x\", \"++x\", \"x++\", \"x++\", \"x--\", \"++x\", \"++x\", \"x--\", \"x--\", \"--x\", \"x--\", \"--x\", \"x--\", \"x--\", \"++x\", \"++x\", \"x--\", \"--x\", \"x++\", \"--x\", \"--x\", \"x++\", \"x++\", \"x++\", \"x++\", \"++x\", \"--x\", \"x++\", \"x++\", \"--x\", \"++x\", \"x++\", \"--x\", \"--x\", \"x--\", \"--x\", \"x++\"}, 82823, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(61814, {\"x--\", \"x++\", \"++x\", \"--x\", \"x++\", \"--x\", \"x--\"}, 61813, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(61814, {\"x++\", \"--x\", \"--x\"}, 28110, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(28149, {\"x++\", \"--x\", \"--x\"}, 28110, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(61814, {\"x++\", \"--x\", \"--x\"}, 82823, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(28149, {\"x++\", \"--x\", \"--x\"}, 61813, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
222 | TP3/codeforces.CompareInAnyCase | C++ | Verifies that the inputs satisfy the problem:
Ignoring case, compare s, t lexicographically. Output 0 if they are =, -1 if s < t, 1 if s > t. | /**
* Verifies that the inputs satisfy the problem:
* Ignoring case, compare s, t lexicographically. Output 0 if they are =, -1 if s < t, 1 if s > t.
*/
bool sat(int n, string s, string t) { | bool sat(int n, string s, string t) { | [
"n",
"s",
"t"
] | def sat(n: int, s, t):
if n == 0:
return s.lower() == t.lower()
if n == 1:
return s.lower() > t.lower()
if n == -1:
return s.lower() < t.lower()
return False | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 0, \"s\": \"aaAab\", \"t\": \"aAaaB\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 0, \"s\": \"JyNuTexTETiGAVIC\", \"t\": \"JynUTEXTetigAViC\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": -1, \"s\": \"tExTYtOHahekomArof\", \"t\": \"TExTYTohaHeKomryGUSeteXTUrYgir\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": -1, \"s\": \"RObAQuYK\", \"t\": \"robaQUYKkuLY\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 1, \"s\": \"DUTeX\", \"t\": \"dutdE\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 1, \"s\": \"aaAab\", \"t\": \"dutdE\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 0, \"s\": \"DUTeX\", \"t\": \"aAaaB\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": -1, \"s\": \"aaAab\", \"t\": \"aAaaB\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 0, \"s\": \"aaAab\", \"t\": \"\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Ignoring case, compare s, t lexicographically. Output 0 if they are =, -1 if s < t, 1 if s > t.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, string s, string t, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, s, t), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(0, \"aaAab\", \"aAaaB\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, \"JyNuTexTETiGAVIC\", \"JynUTEXTetigAViC\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-1, \"tExTYtOHahekomArof\", \"TExTYTohaHeKomryGUSeteXTUrYgir\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-1, \"RObAQuYK\", \"robaQUYKkuLY\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1, \"DUTeX\", \"dutdE\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1, \"aaAab\", \"dutdE\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, \"DUTeX\", \"aAaaB\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-1, \"aaAab\", \"aAaaB\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, \"aaAab\", \"\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
223 | TP3/codeforces.SlidingOne | C++ | Verifies that the inputs satisfy the problem:
We are given a 5x5 matrix with a single 1 like:
0 0 0 0 0
0 0 0 0 1
0 0 0 0 0
0 0 0 0 0
0 0 0 0 0
Find a (minimal) sequence of row and column swaps to move the 1 to the center. A move is a string
in "0"-"4" indicating a row swap and "a"-"e" indicating a column swap | /**
* Verifies that the inputs satisfy the problem:
* We are given a 5x5 matrix with a single 1 like:
* 0 0 0 0 0
* 0 0 0 0 1
* 0 0 0 0 0
* 0 0 0 0 0
* 0 0 0 0 0
* Find a (minimal) sequence of row and column swaps to move the 1 to the center. A move is a string
* in "0"-"4" indicating a row swap and "a"-"e" indicating a column swap
*/
bool sat(string s, vector<vector<int>> matrix, int max_moves) { | bool sat(string s, vector<vector<int>> matrix, int max_moves) { | [
"s",
"matrix",
"max_moves"
] | def sat(s: str, matrix, max_moves):
matrix = [m[:] for m in matrix]
for c in s:
if c in '01234':
i = '01234'.index(c)
(matrix[i], matrix[i + 1]) = (matrix[i + 1], matrix[i])
if c in 'abcde':
j = 'abcde'.index(c)
for row in matrix:
(row[j], row[j + 1]) = (row[j + 1], row[j])
return len(s) <= max_moves and matrix[2][2] == 1 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"1dc\", \"matrix\": [[0, 0, 0, 0, 0], [0, 0, 0, 0, 1], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 3}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"01ab\", \"matrix\": [[1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 4}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"01b\", \"matrix\": [[0, 1, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 3}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"01\", \"matrix\": [[0, 0, 1, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 2}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"s\": \"01\", \"matrix\": [[1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 2}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"01\", \"matrix\": [[0, 0, 0, 0, 0], [0, 0, 0, 0, 1], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"01\", \"matrix\": [[1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 3}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"01\", \"matrix\": [[1, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0], [0, 0, 0, 0, 0]], \"max_moves\": 4}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// We are given a 5x5 matrix with a single 1 like:\n// 0 0 0 0 0\n// 0 0 0 0 1\n// 0 0 0 0 0\n// 0 0 0 0 0\n// 0 0 0 0 0\n// Find a (minimal) sequence of row and column swaps to move the 1 to the center. A move is a string\n// in \"0\"-\"4\" indicating a row swap and \"a\"-\"e\" indicating a column swap\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<vector<int>> matrix, int max_moves, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, matrix, max_moves), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"1dc\", {{0, 0, 0, 0, 0}, {0, 0, 0, 0, 1}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 3, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01ab\", {{1, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 4, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01b\", {{0, 1, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 3, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01\", {{0, 0, 1, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01\", {{1, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 2, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01\", {{0, 0, 0, 0, 0}, {0, 0, 0, 0, 1}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01\", {{1, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 3, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"01\", {{1, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}, {0, 0, 0, 0, 0}}, 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
224 | TP3/codeforces.SortPlusPlus | C++ | Verifies that the inputs satisfy the problem:
Sort numbers in a sum of digits, e.g., 1+3+2+1 -> 1+1+2+3 | /**
* Verifies that the inputs satisfy the problem:
* Sort numbers in a sum of digits, e.g., 1+3+2+1 -> 1+1+2+3
*/
bool sat(string s, string inp) { | bool sat(string s, string inp) { | [
"s",
"inp"
] | def sat(s: str, inp):
return all((s.count(c) == inp.count(c) for c in inp + s)) and all((s[i - 2] <= s[i] for i in range(2, len(s), 2))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"1+1+1+1+1+2+2+2+3+3+3\", \"inp\": \"1+1+3+1+3+2+2+1+3+1+2\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"1+1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3\", \"inp\": \"2+3+1+2+2+2+1+1+1+3+2+3+3+3+2+3+1+3+3+2+1+2+3+1+2+1+3+2+3+1+1+2+2+3+1+2+2+1+3+2+3+2+3+2+2\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"2+2+3\", \"inp\": \"3+2+2\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"1+1+1+1+2+2+2+2+2+3+3+3+3+3+3\", \"inp\": \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3\", \"inp\": \"2+2+2+1+1+1+2+1+3+3+3+3+2+2+2+1+2+3+3+1+3+2+3+2+3+2+2+3+2+3+1+2+1+3+3+2+3+1+1+3+3+1\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"1+1+1+1+1+2+2+2+3+3+3\", \"inp\": \"\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"1+1+1+1+2+2+2+2+2+3+3+3+3+3+3\", \"inp\": \"3+2+2\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"1+1+1+1+1+2+2+2+3+3+3\", \"inp\": \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"2+2+3\", \"inp\": \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Sort numbers in a sum of digits, e.g., 1+3+2+1 -> 1+1+2+3\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string inp, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, inp), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"1+1+1+1+1+2+2+2+3+3+3\", \"1+1+3+1+3+2+2+1+3+1+2\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3\", \"2+3+1+2+2+2+1+1+1+3+2+3+3+3+2+3+1+3+3+2+1+2+3+1+2+1+3+2+3+1+1+2+2+3+1+2+2+1+3+2+3+2+3+2+2\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"2+2+3\", \"3+2+2\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+2+2+2+2+2+3+3+3+3+3+3\", \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+1+1+1+1+1+1+1+2+2+2+2+2+2+2+2+2+2+2+2+2+2+2+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3+3\", \"2+2+2+1+1+1+2+1+3+3+3+3+2+2+2+1+2+3+3+1+3+2+3+2+3+2+2+3+2+3+1+2+1+3+3+2+3+1+1+3+3+1\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+1+2+2+2+3+3+3\", \"\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+2+2+2+2+2+3+3+3+3+3+3\", \"3+2+2\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1+1+1+1+1+2+2+2+3+3+3\", \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"2+2+3\", \"3+2+1+1+3+3+2+2+2+3+2+3+3+1+1\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
225 | TP3/codeforces.CapitalizeFirstLetter | C++ | Verifies that the inputs satisfy the problem:
Capitalize the first letter of word | /**
* Verifies that the inputs satisfy the problem:
* Capitalize the first letter of word
*/
bool sat(string s, string word) { | bool sat(string s, string word) { | [
"s",
"word"
] | def sat(s: str, word):
for i in range(len(word)):
if i == 0:
if s[i] != word[i].upper():
return False
elif s[i] != word[i]:
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"Konjac\", \"word\": \"konjac\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"Nojapoxe\", \"word\": \"nojapoxe\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"Silon\", \"word\": \"silon\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"Fekovo\", \"word\": \"fekovo\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"Mo\", \"word\": \"mo\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"Mo\", \"word\": \"konjac\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"Fekovo\", \"word\": \"mo\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"Konjac\", \"word\": \"mo\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"Nojapoxe\", \"word\": \"mo\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Capitalize the first letter of word\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string word, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, word), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"Konjac\", \"konjac\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Nojapoxe\", \"nojapoxe\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Silon\", \"silon\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Fekovo\", \"fekovo\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Mo\", \"mo\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Mo\", \"konjac\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Fekovo\", \"mo\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Konjac\", \"mo\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"Nojapoxe\", \"mo\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
226 | TP3/codeforces.LongestSubsetString | C++ | Verifies that the inputs satisfy the problem:
You are given a string consisting of a's, b's and c's, find any longest substring containing no repeated
consecutive characters.
Sample Input:
`"abbbc"`
Sample Output:
`"abc"` | /**
* Verifies that the inputs satisfy the problem:
* You are given a string consisting of a's, b's and c's, find any longest substring containing no repeated
* consecutive characters.
* Sample Input:
* `"abbbc"`
* Sample Output:
* `"abc"`
*/
bool sat(string t, string s, int target) { | bool sat(string t, string s, int target) { | [
"t",
"s",
"target"
] | def sat(t: str, s, target):
i = 0
for c in t:
while c != s[i]:
i += 1
i += 1
return len(t) >= target and all((t[i] != t[i + 1] for i in range(len(t) - 1))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"t\": \"abcabac\", \"s\": \"abbbcabbac\", \"target\": 7}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"t\": \"cbcbacacacacbcacbacbabacabcbcacbacabcabacba\", \"s\": \"cbbbbbcbbbbbbbaccacacaacbbcaaacbbaacbabacabccbbbcaacbbacaabcabbaacbbaa\", \"target\": 43}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"t\": \"bcb\", \"s\": \"bcb\", \"target\": 3}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"t\": \"c\", \"s\": \"c\", \"target\": 1}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"t\": \"bcbcaba\", \"s\": \"bcbcabba\", \"target\": 7}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"t\": \"c\", \"s\": \"bcb\", \"target\": 7}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"t\": \"c\", \"s\": \"bcb\", \"target\": 43}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"t\": \"bcb\", \"s\": \"bcb\", \"target\": 7}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"t\": \"bcb\", \"s\": \"bcb\", \"target\": 43}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// You are given a string consisting of a's, b's and c's, find any longest substring containing no repeated\n// consecutive characters.\n// Sample Input:\n// `\"abbbc\"`\n// Sample Output:\n// `\"abc\"`\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string t, string s, int target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(t, s, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"abcabac\", \"abbbcabbac\", 7, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cbcbacacacacbcacbacbabacabcbcacbacabcabacba\", \"cbbbbbcbbbbbbbaccacacaacbbcaaacbbaacbabacabccbbbcaacbbacaabcabbaacbbaa\", 43, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bcb\", \"bcb\", 3, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"c\", \"c\", 1, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bcbcaba\", \"bcbcabba\", 7, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"c\", \"bcb\", 7, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"c\", \"bcb\", 43, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bcb\", \"bcb\", 7, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bcb\", \"bcb\", 43, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
227 | TP3/codeforces.FindHomogeneousSubstring | C++ | Verifies that the inputs satisfy the problem:
You are given a string consisting of 0's and 1's. Find an index after which the subsequent k characters are
all 0's or all 1's.
Sample Input:
s = 0000111111100000, k = 5
Sample Output:
4
(or 5 or 6 or 11) | /**
* Verifies that the inputs satisfy the problem:
* You are given a string consisting of 0's and 1's. Find an index after which the subsequent k characters are
* all 0's or all 1's.
* Sample Input:
* s = 0000111111100000, k = 5
* Sample Output:
* 4
* (or 5 or 6 or 11)
*/
bool sat(int n, string s, int k) { | bool sat(int n, string s, int k) { | [
"n",
"s",
"k"
] | def sat(n: int, s, k):
return s[n:n + k] == s[n] * k | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 6, \"s\": \"0000101111111000010\", \"k\": 5}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 0, \"s\": \"000000\", \"k\": 4}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 4, \"s\": \"001100000000000000000000101010100111101110000100\", \"k\": 18}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 13, \"s\": \"10100111100110001010011110100111010110010000101101110100010\", \"k\": 3}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 54, \"s\": \"010110011110100000001010010010001101001110110001111011000000000000000000000011101010111000111011001100111101101\", \"k\": 18}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 4, \"s\": \"000000\", \"k\": 5}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 4, \"s\": \"0000101111111000010\", \"k\": 5}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 4, \"s\": \"0000101111111000010\", \"k\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 4, \"s\": \"0000101111111000010\", \"k\": 3}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// You are given a string consisting of 0's and 1's. Find an index after which the subsequent k characters are\n// all 0's or all 1's.\n// Sample Input:\n// s = 0000111111100000, k = 5\n// Sample Output:\n// 4\n// (or 5 or 6 or 11)\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, string s, int k, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, s, k), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(6, \"0000101111111000010\", 5, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, \"000000\", 4, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, \"001100000000000000000000101010100111101110000100\", 18, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(13, \"10100111100110001010011110100111010110010000101101110100010\", 3, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(54, \"010110011110100000001010010010001101001110110001111011000000000000000000000011101010111000111011001100111101101\", 18, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, \"000000\", 5, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, \"0000101111111000010\", 5, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, \"0000101111111000010\", 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, \"0000101111111000010\", 3, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
228 | TP3/codeforces.Triple0 | C++ | Verifies that the inputs satisfy the problem:
Find the missing triple of integers to make them all add up to 0 coordinatewise | /**
* Verifies that the inputs satisfy the problem:
* Find the missing triple of integers to make them all add up to 0 coordinatewise
*/
bool sat(vector<int> delta, vector<vector<int>> nums) { | bool sat(vector<int> delta, vector<vector<int>> nums) { | [
"delta",
"nums"
] | def sat(delta: List[int], nums):
return all((sum((vec[i] for vec in nums)) + delta[i] == 0 for i in range(3))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"delta\": [-27, -2, -61], \"nums\": [[1, 2, 3], [9, -2, 8], [17, 2, 50]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"delta\": [145, -72, -301], \"nums\": [[-48, -64, 10], [-6, 46, 95], [89, 95, 20], [-96, 45, 74], [-78, 19, 47], [-6, -69, 55]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"delta\": [-21, 14, 110], \"nums\": [[-17, -87, 34], [-8, -47, -68], [92, -14, -18], [18, 89, 85], [52, 89, -56], [-38, -19, -53], [-78, -25, -34]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"delta\": [56, 310, -215], \"nums\": [[35, -53, 59], [78, -51, 93], [-20, -17, -17], [64, 46, -24], [-81, -100, 47], [-98, -21, 47], [48, -85, -55], [-82, -29, 65]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"delta\": [-167, 8, -33], \"nums\": [[-16, 53, 37], [-54, -85, 65], [-46, 49, -81], [88, -47, -35], [53, -82, 4], [45, 94, 39], [72, -57, 27], [40, 35, -44], [-15, 32, 21]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"delta\": [-27, -2, -61], \"nums\": []}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"delta\": [-27, -2, -61], \"nums\": [[-48, -64, 10], [-6, 46, 95], [89, 95, 20], [-96, 45, 74], [-78, 19, 47], [-6, -69, 55]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"delta\": [-21, 14, 110], \"nums\": [[1, 2, 3], [9, -2, 8], [17, 2, 50]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"delta\": [-21, 14, 110], \"nums\": [[-48, -64, 10], [-6, 46, 95], [89, 95, 20], [-96, 45, 74], [-78, 19, 47], [-6, -69, 55]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the missing triple of integers to make them all add up to 0 coordinatewise\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> delta, vector<vector<int>> nums, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(delta, nums), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({-27, -2, -61}, {{1, 2, 3}, {9, -2, 8}, {17, 2, 50}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({145, -72, -301}, {{-48, -64, 10}, {-6, 46, 95}, {89, 95, 20}, {-96, 45, 74}, {-78, 19, 47}, {-6, -69, 55}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-21, 14, 110}, {{-17, -87, 34}, {-8, -47, -68}, {92, -14, -18}, {18, 89, 85}, {52, 89, -56}, {-38, -19, -53}, {-78, -25, -34}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({56, 310, -215}, {{35, -53, 59}, {78, -51, 93}, {-20, -17, -17}, {64, 46, -24}, {-81, -100, 47}, {-98, -21, 47}, {48, -85, -55}, {-82, -29, 65}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-167, 8, -33}, {{-16, 53, 37}, {-54, -85, 65}, {-46, 49, -81}, {88, -47, -35}, {53, -82, 4}, {45, 94, 39}, {72, -57, 27}, {40, 35, -44}, {-15, 32, 21}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-27, -2, -61}, {}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-27, -2, -61}, {{-48, -64, 10}, {-6, 46, 95}, {89, 95, 20}, {-96, 45, 74}, {-78, 19, 47}, {-6, -69, 55}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-21, 14, 110}, {{1, 2, 3}, {9, -2, 8}, {17, 2, 50}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-21, 14, 110}, {{-48, -64, 10}, {-6, 46, 95}, {89, 95, 20}, {-96, 45, 74}, {-78, 19, 47}, {-6, -69, 55}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
229 | TP3/codeforces.TotalDifference | C++ | Verifies that the inputs satisfy the problem:
Find n such that n + a == b * (the sum of the first c integers) | /**
* Verifies that the inputs satisfy the problem:
* Find n such that n + a == b * (the sum of the first c integers)
*/
bool sat(int n, int a, int b, int c) { | bool sat(int n, int a, int b, int c) { | [
"n",
"a",
"b",
"c"
] | def sat(n: int, a, b, c):
return n + a == sum([b * i for i in range(c)]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 18983, \"a\": 17, \"b\": 100, \"c\": 20}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 25330, \"a\": 62, \"b\": 92, \"c\": 24}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 54036, \"a\": 14, \"b\": 50, \"c\": 47}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 4852, \"a\": 62, \"b\": 63, \"c\": 13}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 20641, \"a\": 5, \"b\": 31, \"c\": 37}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 4852, \"a\": 5, \"b\": 63, \"c\": 24}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 4852, \"a\": 5, \"b\": 63, \"c\": 37}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 4852, \"a\": 5, \"b\": 63, \"c\": 13}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 4852, \"a\": 5, \"b\": 31, \"c\": 20}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find n such that n + a == b * (the sum of the first c integers)\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, int a, int b, int c, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, a, b, c), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(18983, 17, 100, 20, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(25330, 62, 92, 24, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(54036, 14, 50, 47, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4852, 62, 63, 13, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(20641, 5, 31, 37, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4852, 5, 63, 24, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4852, 5, 63, 37, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4852, 5, 63, 13, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4852, 5, 31, 20, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
230 | TP3/codeforces.TripleDouble | C++ | Verifies that the inputs satisfy the problem:
Find the smallest n such that if v is tripled n times and w is doubled n times, v exceeds w. | /**
* Verifies that the inputs satisfy the problem:
* Find the smallest n such that if v is tripled n times and w is doubled n times, v exceeds w.
*/
bool sat(int n, int v, int w) { | bool sat(int n, int v, int w) { | [
"n",
"v",
"w"
] | def sat(n: int, v, w):
for i in range(n):
if not v <= w:
return False
v *= 3
w *= 2
return v > w | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 5, \"v\": 17, \"w\": 100}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 7, \"v\": 75129500, \"w\": 979292947}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 1, \"v\": 609909721, \"w\": 872375011}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 3, \"v\": 313946483, \"w\": 806690290}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 7, \"v\": 54888266, \"w\": 670740803}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 3, \"v\": 17, \"w\": 100}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 3, \"v\": 17, \"w\": 670740803}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 3, \"v\": 17, \"w\": 872375011}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 7, \"v\": 17, \"w\": 100}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the smallest n such that if v is tripled n times and w is doubled n times, v exceeds w.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, int v, int w, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, v, w), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(5, 17, 100, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(7, 75129500, 979292947, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1, 609909721, 872375011, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, 313946483, 806690290, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(7, 54888266, 670740803, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, 17, 100, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, 17, 670740803, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, 17, 872375011, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(7, 17, 100, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
231 | TP3/codeforces.RepeatDec | C++ | Verifies that the inputs satisfy the problem:
Find the result of applying the following operation to integer m, n times: if the last digit is zero, remove
the zero, otherwise subtract 1. | /**
* Verifies that the inputs satisfy the problem:
* Find the result of applying the following operation to integer m, n times: if the last digit is zero, remove
* the zero, otherwise subtract 1.
*/
bool sat(long long res, long long m, int n) { | bool sat(long long res, long long m, int n) { | [
"res",
"m",
"n"
] | def sat(res: int, m, n):
for i in range(n):
m = m - 1 if m % 10 else m // 10
return res == m | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"res\": 123457898765430, \"m\": 1234578987654321, \"n\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"res\": 79846422, \"m\": 79846428, \"n\": 6}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"res\": 1796921, \"m\": 17969245, \"n\": 9}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"res\": 27760071, \"m\": 27760074, \"n\": 3}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"res\": 47223041, \"m\": 47223044, \"n\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"res\": 1796921, \"m\": 47223044, \"n\": 4}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"res\": 1796921, \"m\": 17969245, \"n\": 6}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"res\": 1796921, \"m\": 17969245, \"n\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"res\": 1796921, \"m\": 47223044, \"n\": 6}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the result of applying the following operation to integer m, n times: if the last digit is zero, remove\n// the zero, otherwise subtract 1.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(long long res, long long m, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(res, m, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(123457898765430, 1234578987654321, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(79846422, 79846428, 6, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1796921, 17969245, 9, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(27760071, 27760074, 3, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(47223041, 47223044, 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1796921, 47223044, 4, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1796921, 17969245, 6, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1796921, 17969245, 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1796921, 47223044, 6, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
232 | TP3/codeforces.ShortestDecDelta | C++ | Verifies that the inputs satisfy the problem:
Find a the shortest sequence of integers going from 1 to n where each difference is at most 10.
Do not include 1 or n in the sequence. | /**
* Verifies that the inputs satisfy the problem:
* Find a the shortest sequence of integers going from 1 to n where each difference is at most 10.
* Do not include 1 or n in the sequence.
*/
bool sat(vector<int> li, int n, int upper) { | bool sat(vector<int> li, int n, int upper) { | [
"li",
"n",
"upper"
] | def sat(li: List[int], n, upper):
return len(li) <= upper and all((abs(a - b) <= 10 for (a, b) in zip([1] + li, li + [n]))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"li\": [11, 21, 31, 41, 51], \"n\": 61, \"upper\": 5}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"li\": [11, 21], \"n\": 22, \"upper\": 2}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"li\": [11, 21, 31, 41, 51], \"n\": 59, \"upper\": 5}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"li\": [11, 21, 31], \"n\": 38, \"upper\": 3}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"li\": [11, 21], \"n\": 61, \"upper\": 5}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"li\": [11, 21], \"n\": 38, \"upper\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"li\": [11, 21], \"n\": 38, \"upper\": 2}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"li\": [11, 21], \"n\": 61, \"upper\": 3}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a the shortest sequence of integers going from 1 to n where each difference is at most 10.\n// Do not include 1 or n in the sequence.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> li, int n, int upper, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(li, n, upper), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({11, 21, 31, 41, 51}, 61, 5, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21}, 22, 2, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21, 31, 41, 51}, 59, 5, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21, 31}, 38, 3, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21}, 61, 5, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21}, 38, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21}, 38, 2, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({11, 21}, 61, 3, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
233 | TP3/codeforces.MaxDelta | C++ | Verifies that the inputs satisfy the problem:
Given a sequence of integer pairs, p_i, m_i, where \sum p_i-m_i = 0, find the maximum value, over t, of
p_{t+1} + \sum_{i=1}^t p_i - m_i | /**
* Verifies that the inputs satisfy the problem:
* Given a sequence of integer pairs, p_i, m_i, where \\sum p_i-m_i = 0, find the maximum value, over t, of
* p_{t+1} + \\sum_{i=1}^t p_i - m_i
*/
bool sat(int n, vector<vector<int>> pairs) { | bool sat(int n, vector<vector<int>> pairs) { | [
"n",
"pairs"
] | def sat(n: int, pairs):
if not sum((p - m for (p, m) in pairs)) == 0:
return False
tot = 0
success = False
for (p, m) in pairs:
tot -= m
tot += p
if not tot <= n:
return False
if tot == n:
success = True
return success | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"n\": 9254359, \"pairs\": [[3, 0], [17, 1], [9254359, 19], [123, 9254359], [0, 123]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"n\": 2195918, \"pairs\": [[735272, 0], [959403, 509925], [627622, 420078], [26718, 90062], [175999, 98715], [428400, 1098754], [958640, 543606], [983032, 181754], [143406, 1301552], [183299, 437141], [133206, 199853], [679951, 366700], [383704, 737787], [476200, 226078], [923093, 81263], [574756, 679331], [766050, 5511], [214260, 445680], [434074, 747765], [769774, 209386], [512796, 2095723], [0, 612991]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"n\": 2720508, \"pairs\": [[266519, 0], [548032, 32788], [612482, 632311], [465240, 376403], [123288, 475698], [962873, 439482], [193531, 258475], [747616, 319130], [592192, 824307], [508933, 296745], [411467, 566648], [905981, 19854], [805465, 657818], [802088, 325540], [127441, 1703553], [19150, 964316], [0, 199230]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"n\": 0, \"pairs\": [[0, 0]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"n\": 2748619, \"pairs\": [[459604, 0], [364611, 68505], [562652, 512251], [668655, 471975], [464486, 626280], [138684, 177065], [163296, 68630], [188271, 104677], [367839, 338137], [73022, 362103], [464143, 484458], [214935, 189299], [643725, 283515], [908210, 541732], [710201, 234839], [854230, 34479], [3288, 675724], [846637, 396244], [0, 2526576]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"n\": 2195918, \"pairs\": [[0, 0]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"n\": 9254359, \"pairs\": [[0, 0]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"n\": 2195918, \"pairs\": [[3, 0], [17, 1], [9254359, 19], [123, 9254359], [0, 123]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"n\": 2720508, \"pairs\": [[3, 0], [17, 1], [9254359, 19], [123, 9254359], [0, 123]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a sequence of integer pairs, p_i, m_i, where \\sum p_i-m_i = 0, find the maximum value, over t, of\n// p_{t+1} + \\sum_{i=1}^t p_i - m_i\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int n, vector<vector<int>> pairs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(n, pairs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(9254359, {{3, 0}, {17, 1}, {9254359, 19}, {123, 9254359}, {0, 123}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2195918, {{735272, 0}, {959403, 509925}, {627622, 420078}, {26718, 90062}, {175999, 98715}, {428400, 1098754}, {958640, 543606}, {983032, 181754}, {143406, 1301552}, {183299, 437141}, {133206, 199853}, {679951, 366700}, {383704, 737787}, {476200, 226078}, {923093, 81263}, {574756, 679331}, {766050, 5511}, {214260, 445680}, {434074, 747765}, {769774, 209386}, {512796, 2095723}, {0, 612991}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2720508, {{266519, 0}, {548032, 32788}, {612482, 632311}, {465240, 376403}, {123288, 475698}, {962873, 439482}, {193531, 258475}, {747616, 319130}, {592192, 824307}, {508933, 296745}, {411467, 566648}, {905981, 19854}, {805465, 657818}, {802088, 325540}, {127441, 1703553}, {19150, 964316}, {0, 199230}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, {{0, 0}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2748619, {{459604, 0}, {364611, 68505}, {562652, 512251}, {668655, 471975}, {464486, 626280}, {138684, 177065}, {163296, 68630}, {188271, 104677}, {367839, 338137}, {73022, 362103}, {464143, 484458}, {214935, 189299}, {643725, 283515}, {908210, 541732}, {710201, 234839}, {854230, 34479}, {3288, 675724}, {846637, 396244}, {0, 2526576}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2195918, {{0, 0}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(9254359, {{0, 0}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2195918, {{3, 0}, {17, 1}, {9254359, 19}, {123, 9254359}, {0, 123}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2720508, {{3, 0}, {17, 1}, {9254359, 19}, {123, 9254359}, {0, 123}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
234 | TP3/codeforces.CommonCase | C++ | Verifies that the inputs satisfy the problem:
Given a word, replace it either with an upper-case or lower-case depending on whether or not it has more
capitals or lower-case letters. If it has strictly more capitals, use upper-case, otherwise, use lower-case. | /**
* Verifies that the inputs satisfy the problem:
* Given a word, replace it either with an upper-case or lower-case depending on whether or not it has more
* capitals or lower-case letters. If it has strictly more capitals, use upper-case, otherwise, use lower-case.
*/
bool sat(string s_case, string s) { | bool sat(string s_case, string s) { | [
"s_case",
"s"
] | def sat(s_case: str, s):
caps = 0
for c in s:
if c != c.lower():
caps += 1
return s_case == (s.upper() if caps > len(s) // 2 else s.lower()) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s_case\": \"CANYOUTELLIFITHASMORECAPITALS\", \"s\": \"CanYouTellIfItHASmoreCAPITALS\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s_case\": \"THUCYNICHIHIC\", \"s\": \"ThUcynICHiHIc\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s_case\": \"rizip\", \"s\": \"riziP\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s_case\": \"kanexajohibotipomyvokatumy\", \"s\": \"KANExAjoHiBotipomyVOkATuMY\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s_case\": \"RAC\", \"s\": \"rAC\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s_case\": \"rizip\", \"s\": \"rAC\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s_case\": \"THUCYNICHIHIC\", \"s\": \"rAC\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s_case\": \"rizip\", \"s\": \"ThUcynICHiHIc\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s_case\": \"CANYOUTELLIFITHASMORECAPITALS\", \"s\": \"\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a word, replace it either with an upper-case or lower-case depending on whether or not it has more\n// capitals or lower-case letters. If it has strictly more capitals, use upper-case, otherwise, use lower-case.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s_case, string s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s_case, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"CANYOUTELLIFITHASMORECAPITALS\", \"CanYouTellIfItHASmoreCAPITALS\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"THUCYNICHIHIC\", \"ThUcynICHiHIc\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"rizip\", \"riziP\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"kanexajohibotipomyvokatumy\", \"KANExAjoHiBotipomyVOkATuMY\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"RAC\", \"rAC\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"rizip\", \"rAC\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"THUCYNICHIHIC\", \"rAC\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"rizip\", \"ThUcynICHiHIc\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"CANYOUTELLIFITHASMORECAPITALS\", \"\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
235 | TP3/codeforces.Sssuubbstriiingg | C++ | Verifies that the inputs satisfy the problem:
Find increasing indices to make the substring "substring | /**
* Verifies that the inputs satisfy the problem:
* Find increasing indices to make the substring "substring
*/
bool sat(vector<int> inds, string string_arg1) { | bool sat(vector<int> inds, string string_arg1) { | [
"inds",
"string_arg1"
] | def sat(inds: List[int], string_arg1):
return inds == sorted(inds) and ''.join((string_arg1[i] for i in inds)) == 'substring' | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"inds\": [1, 3, 5, 7, 8, 9, 10, 15, 16], \"string_arg1\": \"Sssuubbstrissiingg\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"inds\": [0, 1, 4, 5, 7, 11, 12, 14, 16], \"string_arg1\": \"su absItIstrilnvgenw\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"inds\": [0, 2, 3, 4, 9, 14, 16, 20, 22], \"string_arg1\": \"sKubssB tzCzPrZiL inCgN\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"inds\": [0, 1, 3, 4, 5, 6, 7, 9, 10], \"string_arg1\": \"suUbstriPng\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"inds\": [0, 2, 4, 8, 12, 14, 15, 20, 23], \"string_arg1\": \"stuqb VqsMJptxriWYe nmfgNfW\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"inds\": [0, 1, 4, 5, 7, 11, 12, 14, 16], \"string_arg1\": \"Sssuubbstrissiingg\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"inds\": [1, 3, 5, 7, 8, 9, 10, 15, 16], \"string_arg1\": \"su absItIstrilnvgenw\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"inds\": [0, 1, 3, 4, 5, 6, 7, 9, 10], \"string_arg1\": \"Sssuubbstrissiingg\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"inds\": [0, 1, 3, 4, 5, 6, 7, 9, 10], \"string_arg1\": \"sKubssB tzCzPrZiL inCgN\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find increasing indices to make the substring \"substring\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> inds, string string_arg1, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(inds, string_arg1), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({1, 3, 5, 7, 8, 9, 10, 15, 16}, \"Sssuubbstrissiingg\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 4, 5, 7, 11, 12, 14, 16}, \"su absItIstrilnvgenw\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 2, 3, 4, 9, 14, 16, 20, 22}, \"sKubssB tzCzPrZiL inCgN\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 3, 4, 5, 6, 7, 9, 10}, \"suUbstriPng\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 2, 4, 8, 12, 14, 15, 20, 23}, \"stuqb VqsMJptxriWYe nmfgNfW\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 4, 5, 7, 11, 12, 14, 16}, \"Sssuubbstrissiingg\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 5, 7, 8, 9, 10, 15, 16}, \"su absItIstrilnvgenw\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 3, 4, 5, 6, 7, 9, 10}, \"Sssuubbstrissiingg\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 3, 4, 5, 6, 7, 9, 10}, \"sKubssB tzCzPrZiL inCgN\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
236 | TP3/codeforces.Sstriiinggssuubb | C++ | Verifies that the inputs satisfy the problem:
Find increasing indices to make the substring "intelligent" (with a surprise twist) | /**
* Verifies that the inputs satisfy the problem:
* Find increasing indices to make the substring "intelligent" (with a surprise twist)
*/
bool sat(vector<int> inds, string string_arg1) { | bool sat(vector<int> inds, string string_arg1) { | [
"inds",
"string_arg1"
] | def sat(inds: List[int], string_arg1):
return inds == sorted(inds) and ''.join((string_arg1[i] for i in inds)) == 'intelligent' | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"inds\": [-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12], \"string_arg1\": \"enlightenment\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"inds\": [-11, -10, -8, -6, -4, -4, -3, -2, -1, 1, 3], \"string_arg1\": \"inntGetlige\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"inds\": [-14, -9, -1, 2, 3, 3, 4, 11, 15, 16, 17], \"string_arg1\": \"gteliikeenGgqIHent\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"inds\": [-19, -15, -14, -11, 3, 3, 4, 6, 12, 18, 22], \"string_arg1\": \"xaGliigNntJfeeSm nnEyt\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"inds\": [-20, -19, -12, -11, -3, -3, -1, 9, 10, 15, 21], \"string_arg1\": \" einliJSgeteq ne CAlti\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"inds\": [-14, -9, -1, 2, 3, 3, 4, 11, 15, 16, 17], \"string_arg1\": \" einliJSgeteq ne CAlti\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"inds\": [-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12], \"string_arg1\": \" einliJSgeteq ne CAlti\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"inds\": [-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12], \"string_arg1\": \"gteliikeenGgqIHent\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"inds\": [-11, -10, -8, -6, -4, -4, -3, -2, -1, 1, 3], \"string_arg1\": \"enlightenment\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find increasing indices to make the substring \"intelligent\" (with a surprise twist)\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> inds, string string_arg1, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(inds, string_arg1), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12}, \"enlightenment\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-11, -10, -8, -6, -4, -4, -3, -2, -1, 1, 3}, \"inntGetlige\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-14, -9, -1, 2, 3, 3, 4, 11, 15, 16, 17}, \"gteliikeenGgqIHent\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-19, -15, -14, -11, 3, 3, 4, 6, 12, 18, 22}, \"xaGliigNntJfeeSm nnEyt\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-20, -19, -12, -11, -3, -3, -1, 9, 10, 15, 21}, \" einliJSgeteq ne CAlti\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-14, -9, -1, 2, 3, 3, 4, 11, 15, 16, 17}, \" einliJSgeteq ne CAlti\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12}, \" einliJSgeteq ne CAlti\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-10, -5, -1, 0, 2, 2, 3, 4, 7, 8, 12}, \"gteliikeenGgqIHent\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-11, -10, -8, -6, -4, -4, -3, -2, -1, 1, 3}, \"enlightenment\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
237 | TP3/codeforces.Moving0s | C++ | Verifies that the inputs satisfy the problem:
Find a sequence of 0's and 1's so that, after n_steps of swapping each adjacent (0, 1), the target sequence
is achieved. | /**
* Verifies that the inputs satisfy the problem:
* Find a sequence of 0's and 1's so that, after n_steps of swapping each adjacent (0, 1), the target sequence
* is achieved.
*/
bool sat(vector<int> seq, vector<int> target, int n_steps) { | bool sat(vector<int> seq, vector<int> target, int n_steps) { | [
"seq",
"target",
"n_steps"
] | def sat(seq: List[int], target, n_steps):
s = seq[:]
for step in range(n_steps):
for i in range(len(seq) - 1):
if (s[i], s[i + 1]) == (0, 1):
(s[i], s[i + 1]) = (1, 0)
return s == target | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1], \"target\": [1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0], \"n_steps\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"seq\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0], \"target\": [1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], \"n_steps\": 9}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], \"target\": [1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0], \"n_steps\": 4}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"seq\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1], \"target\": [1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0], \"n_steps\": 12}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"seq\": [0, 0, 0, 1, 1, 1, 0], \"target\": [1, 1, 1, 0, 0, 0, 0], \"n_steps\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], \"target\": [1, 1, 1, 0, 0, 0, 0], \"n_steps\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1], \"target\": [1, 1, 1, 0, 0, 0, 0], \"n_steps\": 3}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1], \"target\": [], \"n_steps\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"seq\": [0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1], \"target\": [1, 1, 1, 0, 0, 0, 0], \"n_steps\": 9}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a sequence of 0's and 1's so that, after n_steps of swapping each adjacent (0, 1), the target sequence\n// is achieved.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> seq, vector<int> target, int n_steps, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(seq, target, n_steps), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1}, {1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0}, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0}, {1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 9, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1}, {1, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0}, 4, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1}, {1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 12, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 1, 1, 1, 0}, {1, 1, 1, 0, 0, 0, 0}, 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1}, {1, 1, 1, 0, 0, 0, 0}, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1}, {1, 1, 1, 0, 0, 0, 0}, 3, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1}, {}, 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 1}, {1, 1, 1, 0, 0, 0, 0}, 9, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
238 | TP3/codeforces.Factor47 | C++ | Verifies that the inputs satisfy the problem:
Find a integer factor of n whose decimal representation consists only of 7's and 4's. | /**
* Verifies that the inputs satisfy the problem:
* Find a integer factor of n whose decimal representation consists only of 7's and 4's.
*/
bool sat(int d, long long n) { | bool sat(int d, long long n) { | [
"d",
"n"
] | def sat(d: int, n):
return n % d == 0 and all((i in '47' for i in str(d))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"d\": 77477, \"n\": 6002685529}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"d\": 4, \"n\": 16}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"d\": 74474, \"n\": 1212213298}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"d\": 447, \"n\": 322734}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"d\": 44477, \"n\": 2962924309}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"d\": 77477, \"n\": 322734}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"d\": 74474, \"n\": 16}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"d\": 4, \"n\": 1212213298}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"d\": 77477, \"n\": 16}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a integer factor of n whose decimal representation consists only of 7's and 4's.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int d, long long n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(d, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(77477, 6002685529, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, 16, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(74474, 1212213298, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(447, 322734, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(44477, 2962924309, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(77477, 322734, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(74474, 16, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, 1212213298, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(77477, 16, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
239 | TP3/codeforces.Count47 | C++ | Verifies that the inputs satisfy the problem:
Find a number bigger than n whose decimal representation has k 4's and 7's where k's decimal representation
consists only of 4's and 7's | /**
* Verifies that the inputs satisfy the problem:
* Find a number bigger than n whose decimal representation has k 4's and 7's where k's decimal representation
* consists only of 4's and 7's
*/
bool sat(int d, int n) { | bool sat(int d, int n) { | [
"d",
"n"
] | def sat(d: int, n):
return d > n and all((i in '47' for i in str(str(d).count('4') + str(d).count('7')))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"d\": 4444000, \"n\": 123456}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"d\": 4444, \"n\": 550}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"d\": 4444, \"n\": 406}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"d\": 4444, \"n\": 595}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"d\": 4444, \"n\": 344}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"d\": 4444, \"n\": 123456}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a number bigger than n whose decimal representation has k 4's and 7's where k's decimal representation\n// consists only of 4's and 7's\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int d, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(d, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(4444000, 123456, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4444, 550, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4444, 406, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4444, 595, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4444, 344, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4444, 123456, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
240 | TP3/codeforces.MaybeReversed | C++ | Verifies that the inputs satisfy the problem:
Either reverse a string or don't based on the reverse flag | /**
* Verifies that the inputs satisfy the problem:
* Either reverse a string or don't based on the reverse flag
*/
bool sat(string s, string target, bool reverse) { | bool sat(string s, string target, bool reverse) { | [
"s",
"target",
"reverse"
] | def sat(s: str, target, reverse):
return (s[::-1] == target) == reverse | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"em esrever\", \"target\": \"reverse me\", \"reverse\": true}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"anynobuht\", \"target\": \"thubonyna\", \"reverse\": true}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"nivosypetextyzavalagx\", \"target\": \"nivosypetextyzavalag\", \"reverse\": false}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"lx\", \"target\": \"l\", \"reverse\": false}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"yvotxeteviwewahcer\", \"target\": \"rechawewivetextovy\", \"reverse\": true}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"anynobuht\", \"target\": \"l\", \"reverse\": true}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"lx\", \"target\": \"l\", \"reverse\": true}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"em esrever\", \"target\": \"\", \"reverse\": true}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"lx\", \"target\": \"thubonyna\", \"reverse\": true}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Either reverse a string or don't based on the reverse flag\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string target, bool reverse, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, target, reverse), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"em esrever\", \"reverse me\", true, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"anynobuht\", \"thubonyna\", true, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"nivosypetextyzavalagx\", \"nivosypetextyzavalag\", false, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"lx\", \"l\", false, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"yvotxeteviwewahcer\", \"rechawewivetextovy\", true, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"anynobuht\", \"l\", true, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"lx\", \"l\", true, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"em esrever\", \"\", true, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"lx\", \"thubonyna\", true, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
241 | TP3/codeforces.MinBigger | C++ | Verifies that the inputs satisfy the problem:
The vector of numbers val_counts represents multiple copies of integers, e.g.,
val_counts=[[3, 2], [4, 6]] corresponds to 3, 3, 4, 4, 4, 4, 4, 4
For each number, decide how many to take so that the total number taken is <= upper and the sum of those
taken exceeds half the total sum. | /**
* Verifies that the inputs satisfy the problem:
* The vector of numbers val_counts represents multiple copies of integers, e.g.,
* val_counts=[[3, 2], [4, 6]] corresponds to 3, 3, 4, 4, 4, 4, 4, 4
* For each number, decide how many to take so that the total number taken is <= upper and the sum of those
* taken exceeds half the total sum.
*/
bool sat(vector<int> taken, vector<vector<int>> val_counts, int upper) { | bool sat(vector<int> taken, vector<vector<int>> val_counts, int upper) { | [
"taken",
"val_counts",
"upper"
] | def sat(taken: List[int], val_counts, upper):
advantage = 0
if not (len(taken) == len(val_counts) and sum(taken) <= upper):
return False
for (i, (val, count)) in zip(taken, val_counts):
if not 0 <= i <= count:
return False
advantage += val * i - val * count / 2
return advantage > 0 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"taken\": [0, 0, 0, 10, 0, 1], \"val_counts\": [[4, 3], [5, 2], [9, 3], [13, 13], [8, 11], [56, 1]], \"upper\": 11}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"taken\": [0, 12, 0, 54, 0], \"val_counts\": [[51, 67], [78, 13], [7, 68], [84, 54], [39, 38]], \"upper\": 66}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"taken\": [0, 0, 65, 0, 32, 0, 56, 0, 0], \"val_counts\": [[28, 29], [42, 54], [62, 85], [42, 95], [92, 32], [36, 35], [78, 56], [43, 20], [49, 17]], \"upper\": 153}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"taken\": [53, 0, 37, 0], \"val_counts\": [[44, 92], [28, 7], [56, 37], [37, 66]], \"upper\": 90}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"taken\": [0, 0, 0, 65], \"val_counts\": [[23, 93], [64, 14], [36, 8], [89, 92]], \"upper\": 65}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"taken\": [0, 0, 0, 65], \"val_counts\": [[44, 92], [28, 7], [56, 37], [37, 66]], \"upper\": 153}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"taken\": [0, 0, 0, 10, 0, 1], \"val_counts\": [], \"upper\": 11}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"taken\": [0, 0, 0, 65], \"val_counts\": [[44, 92], [28, 7], [56, 37], [37, 66]], \"upper\": 65}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"taken\": [0, 0, 0, 65], \"val_counts\": [[44, 92], [28, 7], [56, 37], [37, 66]], \"upper\": 90}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// The list of numbers val_counts represents multiple copies of integers, e.g.,\n// val_counts=[[3, 2], [4, 6]] corresponds to 3, 3, 4, 4, 4, 4, 4, 4\n// For each number, decide how many to take so that the total number taken is <= upper and the sum of those\n// taken exceeds half the total sum.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> taken, vector<vector<int>> val_counts, int upper, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(taken, val_counts, upper), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 0, 0, 10, 0, 1}, {{4, 3}, {5, 2}, {9, 3}, {13, 13}, {8, 11}, {56, 1}}, 11, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 12, 0, 54, 0}, {{51, 67}, {78, 13}, {7, 68}, {84, 54}, {39, 38}}, 66, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 65, 0, 32, 0, 56, 0, 0}, {{28, 29}, {42, 54}, {62, 85}, {42, 95}, {92, 32}, {36, 35}, {78, 56}, {43, 20}, {49, 17}}, 153, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({53, 0, 37, 0}, {{44, 92}, {28, 7}, {56, 37}, {37, 66}}, 90, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 65}, {{23, 93}, {64, 14}, {36, 8}, {89, 92}}, 65, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 65}, {{44, 92}, {28, 7}, {56, 37}, {37, 66}}, 153, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 10, 0, 1}, {}, 11, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 65}, {{44, 92}, {28, 7}, {56, 37}, {37, 66}}, 65, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 65}, {{44, 92}, {28, 7}, {56, 37}, {37, 66}}, 90, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
242 | TP3/codeforces.Dada | C++ | Verifies that the inputs satisfy the problem:
Find a string with a given number of a's and d's | /**
* Verifies that the inputs satisfy the problem:
* Find a string with a given number of a's and d's
*/
bool sat(string s, int a, int d) { | bool sat(string s, int a, int d) { | [
"s",
"a",
"d"
] | def sat(s: str, a, d):
return s.count('a') == a and s.count('d') == d and (len(s) == a + d) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaddddddddddddddddd\", \"a\": 5129, \"d\": 17}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 5798, \"d\": 1873}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 2645, \"d\": 1270}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 2996, \"d\": 6808}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 5798, \"d\": 1270}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 2645, \"d\": 17}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", \"a\": 5798, \"d\": 17}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"\", \"a\": 5129, \"d\": 17}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a string with a given number of a's and d's\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, int a, int d, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, a, d), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaddddddddddddddddd\", 5129, 17, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 5798, 1873, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 2645, 1270, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 2996, 6808, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 5798, 1270, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 2645, 17, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaadddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd\", 5798, 17, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"\", 5129, 17, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
243 | TP3/codeforces.DistinctDigits | C++ | Verifies that the inputs satisfy the problem:
Find vector of count or more different numbers each between a and b that each have no repeated digits | /**
* Verifies that the inputs satisfy the problem:
* Find vector of count or more different numbers each between a and b that each have no repeated digits
*/
bool sat(vector<int> nums, int a, int b, int count) { | bool sat(vector<int> nums, int a, int b, int count) { | [
"nums",
"a",
"b",
"count"
] | def sat(nums: List[int], a, b, count):
if not all((len(str(n)) == len(set(str(n))) and a <= n <= b for n in nums)):
return False
return len(set(nums)) >= count | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"nums\": [102, 103, 104, 105, 106, 107, 108, 109, 120, 123, 124, 125, 126, 127, 128, 129, 130, 132, 134, 135, 136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 180, 182, 183, 184, 185, 186, 187, 189, 190, 192, 193, 194, 195, 196, 197, 198, 201, 203, 204, 205, 206, 207, 208, 209, 210, 213, 214, 215, 216, 217, 218, 219, 230, 231, 234, 235, 236, 237, 238, 239, 240, 241, 243, 245, 246, 247, 248, 249, 250, 251, 253, 254, 256, 257, 258, 259, 260, 261, 263, 264, 265, 267, 268, 269, 270, 271, 273, 274, 275, 276, 278, 279, 280, 281, 283, 284, 285, 286, 287, 289, 290, 291, 293, 294, 295, 296, 297, 298, 301, 302, 304, 305, 306, 307, 308, 309, 310, 312, 314, 315, 316, 317, 318, 319, 320, 321, 324, 325, 326, 327, 328, 329, 340, 341, 342, 345, 346, 347, 348, 349, 350, 351, 352, 354, 356, 357, 358, 359, 360, 361, 362, 364, 365, 367, 368, 369, 370, 371, 372, 374, 375, 376, 378, 379, 380, 381, 382, 384, 385, 386, 387, 389, 390, 391, 392, 394, 395, 396, 397, 398, 401, 402, 403, 405, 406, 407, 408, 409, 410, 412, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 426, 427, 428, 429, 430, 431, 432, 435, 436, 437, 438, 439, 450, 451, 452, 453, 456, 457, 458, 459, 460, 461, 462, 463, 465, 467, 468, 469, 470, 471, 472, 473, 475, 476, 478, 479, 480, 481, 482, 483, 485, 486, 487, 489, 490, 491, 492, 493, 495, 496, 497, 498, 501, 502, 503, 504, 506, 507, 508, 509, 510, 512, 513, 514, 516, 517, 518, 519, 520, 521, 523, 524, 526, 527, 528, 529, 530, 531, 532, 534, 536, 537, 538, 539, 540, 541, 542, 543, 546, 547, 548, 549, 560, 561, 562, 563, 564, 567, 568, 569, 570, 571, 572, 573, 574, 576, 578, 579, 580, 581, 582, 583, 584, 586, 587, 589, 590, 591, 592, 593, 594, 596, 597, 598, 601, 602, 603, 604, 605, 607, 608, 609, 610, 612, 613, 614, 615, 617, 618, 619, 620, 621, 623, 624, 625, 627, 628, 629, 630, 631, 632, 634, 635, 637, 638, 639, 640, 641, 642, 643, 645, 647, 648, 649, 650, 651, 652, 653, 654, 657, 658, 659, 670, 671, 672, 673, 674, 675, 678, 679, 680, 681, 682, 683, 684, 685, 687, 689, 690, 691, 692, 693, 694, 695, 697, 698, 701, 702, 703, 704, 705, 706, 708, 709, 710, 712, 713, 714, 715, 716, 718, 719, 720, 721, 723, 724, 725, 726, 728, 729, 730, 731, 732, 734, 735, 736, 738, 739, 740, 741, 742, 743, 745, 746, 748, 749, 750, 751, 752, 753, 754, 756, 758, 759, 760, 761, 762, 763, 764, 765, 768, 769, 780, 781, 782, 783, 784, 785, 786, 789, 790, 791, 792, 793, 794, 795, 796, 798, 801, 802, 803, 804, 805, 806, 807, 809, 810, 812, 813, 814, 815, 816, 817, 819, 820, 821, 823, 824, 825, 826, 827, 829, 830, 831, 832, 834, 835, 836, 837, 839, 840, 841, 842, 843, 845, 846, 847, 849, 850, 851, 852, 853, 854, 856, 857, 859, 860, 861, 862, 863, 864, 865, 867, 869, 870, 871, 872, 873, 874, 875, 876, 879, 890, 891, 892, 893, 894, 895, 896, 897, 901, 902, 903, 904, 905, 906, 907, 908, 910, 912, 913, 914, 915, 916, 917, 918, 920, 921, 923, 924, 925, 926, 927, 928, 930, 931, 932, 934, 935, 936, 937, 938, 940, 941, 942, 943, 945, 946, 947, 948, 950, 951, 952, 953, 954, 956, 957, 958, 960, 961, 962, 963, 964, 965, 967, 968, 970, 971, 972, 973, 974, 975, 976, 978, 980, 981, 982, 983, 984, 985, 986, 987], \"a\": 100, \"b\": 1000, \"count\": 648}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"nums\": [79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 102, 103, 104, 105, 106, 107, 108, 109, 120, 123, 124, 125, 126, 127, 128, 129, 130, 132, 134, 135, 136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169], \"a\": 79, \"b\": 169, \"count\": 67}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"nums\": [31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 102, 103, 104, 105], \"a\": 31, \"b\": 105, \"count\": 66}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"nums\": [52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95], \"a\": 52, \"b\": 95, \"count\": 40}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"nums\": [136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169, 170, 172, 173, 174, 175, 176], \"a\": 136, \"b\": 176, \"count\": 34}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"nums\": [52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95], \"a\": 79, \"b\": 95, \"count\": 34}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"nums\": [52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95], \"a\": 31, \"b\": 95, \"count\": 66}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"nums\": [52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95], \"a\": 79, \"b\": 95, \"count\": 40}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"nums\": [52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95], \"a\": 79, \"b\": 95, \"count\": 67}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a list of count or more different numbers each between a and b that each have no repeated digits\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> nums, int a, int b, int count, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(nums, a, b, count), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({102, 103, 104, 105, 106, 107, 108, 109, 120, 123, 124, 125, 126, 127, 128, 129, 130, 132, 134, 135, 136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169, 170, 172, 173, 174, 175, 176, 178, 179, 180, 182, 183, 184, 185, 186, 187, 189, 190, 192, 193, 194, 195, 196, 197, 198, 201, 203, 204, 205, 206, 207, 208, 209, 210, 213, 214, 215, 216, 217, 218, 219, 230, 231, 234, 235, 236, 237, 238, 239, 240, 241, 243, 245, 246, 247, 248, 249, 250, 251, 253, 254, 256, 257, 258, 259, 260, 261, 263, 264, 265, 267, 268, 269, 270, 271, 273, 274, 275, 276, 278, 279, 280, 281, 283, 284, 285, 286, 287, 289, 290, 291, 293, 294, 295, 296, 297, 298, 301, 302, 304, 305, 306, 307, 308, 309, 310, 312, 314, 315, 316, 317, 318, 319, 320, 321, 324, 325, 326, 327, 328, 329, 340, 341, 342, 345, 346, 347, 348, 349, 350, 351, 352, 354, 356, 357, 358, 359, 360, 361, 362, 364, 365, 367, 368, 369, 370, 371, 372, 374, 375, 376, 378, 379, 380, 381, 382, 384, 385, 386, 387, 389, 390, 391, 392, 394, 395, 396, 397, 398, 401, 402, 403, 405, 406, 407, 408, 409, 410, 412, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 426, 427, 428, 429, 430, 431, 432, 435, 436, 437, 438, 439, 450, 451, 452, 453, 456, 457, 458, 459, 460, 461, 462, 463, 465, 467, 468, 469, 470, 471, 472, 473, 475, 476, 478, 479, 480, 481, 482, 483, 485, 486, 487, 489, 490, 491, 492, 493, 495, 496, 497, 498, 501, 502, 503, 504, 506, 507, 508, 509, 510, 512, 513, 514, 516, 517, 518, 519, 520, 521, 523, 524, 526, 527, 528, 529, 530, 531, 532, 534, 536, 537, 538, 539, 540, 541, 542, 543, 546, 547, 548, 549, 560, 561, 562, 563, 564, 567, 568, 569, 570, 571, 572, 573, 574, 576, 578, 579, 580, 581, 582, 583, 584, 586, 587, 589, 590, 591, 592, 593, 594, 596, 597, 598, 601, 602, 603, 604, 605, 607, 608, 609, 610, 612, 613, 614, 615, 617, 618, 619, 620, 621, 623, 624, 625, 627, 628, 629, 630, 631, 632, 634, 635, 637, 638, 639, 640, 641, 642, 643, 645, 647, 648, 649, 650, 651, 652, 653, 654, 657, 658, 659, 670, 671, 672, 673, 674, 675, 678, 679, 680, 681, 682, 683, 684, 685, 687, 689, 690, 691, 692, 693, 694, 695, 697, 698, 701, 702, 703, 704, 705, 706, 708, 709, 710, 712, 713, 714, 715, 716, 718, 719, 720, 721, 723, 724, 725, 726, 728, 729, 730, 731, 732, 734, 735, 736, 738, 739, 740, 741, 742, 743, 745, 746, 748, 749, 750, 751, 752, 753, 754, 756, 758, 759, 760, 761, 762, 763, 764, 765, 768, 769, 780, 781, 782, 783, 784, 785, 786, 789, 790, 791, 792, 793, 794, 795, 796, 798, 801, 802, 803, 804, 805, 806, 807, 809, 810, 812, 813, 814, 815, 816, 817, 819, 820, 821, 823, 824, 825, 826, 827, 829, 830, 831, 832, 834, 835, 836, 837, 839, 840, 841, 842, 843, 845, 846, 847, 849, 850, 851, 852, 853, 854, 856, 857, 859, 860, 861, 862, 863, 864, 865, 867, 869, 870, 871, 872, 873, 874, 875, 876, 879, 890, 891, 892, 893, 894, 895, 896, 897, 901, 902, 903, 904, 905, 906, 907, 908, 910, 912, 913, 914, 915, 916, 917, 918, 920, 921, 923, 924, 925, 926, 927, 928, 930, 931, 932, 934, 935, 936, 937, 938, 940, 941, 942, 943, 945, 946, 947, 948, 950, 951, 952, 953, 954, 956, 957, 958, 960, 961, 962, 963, 964, 965, 967, 968, 970, 971, 972, 973, 974, 975, 976, 978, 980, 981, 982, 983, 984, 985, 986, 987}, 100, 1000, 648, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 102, 103, 104, 105, 106, 107, 108, 109, 120, 123, 124, 125, 126, 127, 128, 129, 130, 132, 134, 135, 136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169}, 79, 169, 67, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({31, 32, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 102, 103, 104, 105}, 31, 105, 66, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95}, 52, 95, 40, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({136, 137, 138, 139, 140, 142, 143, 145, 146, 147, 148, 149, 150, 152, 153, 154, 156, 157, 158, 159, 160, 162, 163, 164, 165, 167, 168, 169, 170, 172, 173, 174, 175, 176}, 136, 176, 34, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95}, 79, 95, 34, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95}, 31, 95, 66, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95}, 79, 95, 40, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({52, 53, 54, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95}, 79, 95, 67, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
244 | TP3/codeforces.EasySum | C++ | Verifies that the inputs satisfy the problem:
Add up 1 or 2 for numbers in vector depending on whether they exceed a threshold | /**
* Verifies that the inputs satisfy the problem:
* Add up 1 or 2 for numbers in vector depending on whether they exceed a threshold
*/
bool sat(int tot, vector<int> nums, int thresh) { | bool sat(int tot, vector<int> nums, int thresh) { | [
"tot",
"nums",
"thresh"
] | def sat(tot: int, nums, thresh):
return tot == sum((1 if i < thresh else 2 for i in nums)) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"tot\": 12, \"nums\": [2, 8, 25, 18, 99, 11, 17, 16], \"thresh\": 17}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"tot\": 3, \"nums\": [60, 63, 11], \"thresh\": 99}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"tot\": 9, \"nums\": [32, 24, 19, 88, 6, 33, 13], \"thresh\": 33}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"tot\": 53, \"nums\": [60, 72, 32, 29, 90, 9, 39, 67, 31, 71, 68, 72, 28, 85, 75, 60, 42, 66, 4, 71, 57, 45, 88, 20, 66, 97, 33, 43, 48], \"thresh\": 30}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"tot\": 28, \"nums\": [61, 98, 33, 32, 4, 99, 91, 63, 76, 83, 52, 0, 19, 49, 85, 5, 54, 71, 41, 93, 54, 78, 92], \"thresh\": 91}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"tot\": 9, \"nums\": [60, 63, 11], \"thresh\": 17}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"tot\": 9, \"nums\": [60, 63, 11], \"thresh\": 91}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"tot\": 3, \"nums\": [60, 63, 11], \"thresh\": 33}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"tot\": 9, \"nums\": [60, 63, 11], \"thresh\": 99}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Add up 1 or 2 for numbers in a list depending on whether they exceed a threshold\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int tot, vector<int> nums, int thresh, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(tot, nums, thresh), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(12, {2, 8, 25, 18, 99, 11, 17, 16}, 17, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, {60, 63, 11}, 99, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(9, {32, 24, 19, 88, 6, 33, 13}, 33, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(53, {60, 72, 32, 29, 90, 9, 39, 67, 31, 71, 68, 72, 28, 85, 75, 60, 42, 66, 4, 71, 57, 45, 88, 20, 66, 97, 33, 43, 48}, 30, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(28, {61, 98, 33, 32, 4, 99, 91, 63, 76, 83, 52, 0, 19, 49, 85, 5, 54, 71, 41, 93, 54, 78, 92}, 91, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(9, {60, 63, 11}, 17, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(9, {60, 63, 11}, 91, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, {60, 63, 11}, 33, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(9, {60, 63, 11}, 99, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
245 | TP3/codeforces.HalfPairs | C++ | Verifies that the inputs satisfy the problem:
Find vector of pairs of integers where the number of pairs in which the second number is more than
two greater than the first number is a given constant | /**
* Verifies that the inputs satisfy the problem:
* Find vector of pairs of integers where the number of pairs in which the second number is more than
* two greater than the first number is a given constant
*/
bool sat(vector<vector<int>> ans, int target) { | bool sat(vector<vector<int>> ans, int target) { | [
"ans",
"target"
] | def sat(ans: List[List[int]], target):
for i in range(len(ans)):
(a, b) = ans[i]
if b - a >= 2:
target -= 1
return target == 0 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"ans\": [[0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2], [0, 2]], \"target\": 17}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"ans\": [], \"target\": 0}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"ans\": [[0, 2]], \"target\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"ans\": [[0, 2], [0, 2]], \"target\": 2}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"ans\": [[0, 2]], \"target\": 0}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"ans\": [], \"target\": 1}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"ans\": [[0, 2]], \"target\": 2}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"ans\": [[0, 2]], \"target\": 17}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a list of pairs of integers where the number of pairs in which the second number is more than\n// two greater than the first number is a given constant\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> ans, int target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(ans, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}, {0, 2}}, 17, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 0, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 2}}, 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 2}, {0, 2}}, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 2}}, 0, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 1, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 2}}, 2, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 2}}, 17, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
246 | TP3/codeforces.FivePowers | C++ | Verifies that the inputs satisfy the problem:
What are the last two digits of 5^n? | /**
* Verifies that the inputs satisfy the problem:
* What are the last two digits of 5^n?
*/
bool sat(string s, int n) { | bool sat(string s, int n) { | [
"s",
"n"
] | def sat(s: str, n):
return int(str(5 ** n)[:-2] + s) == 5 ** n | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"25\", \"n\": 7012}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"1\", \"n\": 0}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"5\", \"n\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"25\", \"n\": 2}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"25\", \"n\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"25\", \"n\": 0}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"25\", \"n\": 1}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"5\", \"n\": 2}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"1\", \"n\": 1}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// What are the last two digits of 5^n?\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"25\", 7012, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1\", 0, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"5\", 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"25\", 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"25\", 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"25\", 0, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"25\", 1, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"5\", 2, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"1\", 1, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
247 | TP3/codeforces.CombinationLock | C++ | Verifies that the inputs satisfy the problem:
Shortest Combination Lock Path
Given a starting a final lock position, find the (minimal) intermediate states, where each transition
involves increasing or decreasing a single digit (mod 10).
Example:
start = "012"
combo = "329"
output: ['112', '212', '312', '322', '321', '320'] | /**
* Verifies that the inputs satisfy the problem:
* Shortest Combination Lock Path
* Given a starting a final lock position, find the (minimal) intermediate states, where each transition
* involves increasing or decreasing a single digit (mod 10).
* Example:
* start = "012"
* combo = "329"
* output: ['112', '212', '312', '322', '321', '320']
*/
bool sat(vector<string> states, string start, string combo, int target_len) { | bool sat(vector<string> states, string start, string combo, int target_len) { | [
"states",
"start",
"combo",
"target_len"
] | def sat(states: List[str], start, combo, target_len):
if not (all((len(s) == len(start) for s in states)) and all((c in '0123456789' for s in states for c in s))):
return False
for (a, b) in zip([start] + states, states + [combo]):
if not sum((i != j for (i, j) in zip(a, b))) == 1:
return False
if not all((abs(int(i) - int(j)) in {0, 1, 9} for (i, j) in zip(a, b))):
return False
return len(states) <= target_len | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"states\": [\"524\", \"624\", \"724\", \"734\", \"744\", \"754\", \"764\", \"774\", \"775\", \"776\", \"777\"], \"start\": \"424\", \"combo\": \"778\", \"target_len\": 12}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"states\": [\"67872\", \"57872\", \"47872\", \"46872\", \"45872\", \"44872\", \"43872\", \"43772\", \"43672\", \"43572\", \"43582\", \"43592\", \"43502\", \"43503\", \"43504\", \"43505\"], \"start\": \"77872\", \"combo\": \"43506\", \"target_len\": 16}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"states\": [\"168\", \"178\", \"188\", \"189\"], \"start\": \"268\", \"combo\": \"180\", \"target_len\": 4}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"states\": [\"5675159714\", \"6675159714\", \"7675159714\", \"8675159714\", \"9675159714\", \"9775159714\", \"9765159714\", \"9755159714\", \"9756159714\", \"9757159714\", \"9758159714\", \"9758059714\", \"9758049714\", \"9758039714\", \"9758029714\", \"9758019714\", \"9758010714\", \"9758011714\", \"9758012714\", \"9758013714\", \"9758013814\", \"9758013824\", \"9758013834\", \"9758013844\", \"9758013843\", \"9758013842\", \"9758013841\"], \"start\": \"4675159714\", \"combo\": \"9758013840\", \"target_len\": 27}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"states\": [\"142716\", \"042716\", \"942716\", \"842716\", \"852716\", \"862716\", \"872716\", \"882716\", \"892716\", \"891716\", \"891816\", \"891916\", \"891016\", \"891116\", \"891216\", \"891226\", \"891236\", \"891246\"], \"start\": \"242716\", \"combo\": \"891245\", \"target_len\": 18}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"states\": [\"168\", \"178\", \"188\", \"189\"], \"start\": \"268\", \"combo\": \"778\", \"target_len\": 4}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"states\": [\"168\", \"178\", \"188\", \"189\"], \"start\": \"424\", \"combo\": \"778\", \"target_len\": 27}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"states\": [\"168\", \"178\", \"188\", \"189\"], \"start\": \"424\", \"combo\": \"180\", \"target_len\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"states\": [\"168\", \"178\", \"188\", \"189\"], \"start\": \"424\", \"combo\": \"778\", \"target_len\": 4}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Shortest Combination Lock Path\n// Given a starting a final lock position, find the (minimal) intermediate states, where each transition\n// involves increasing or decreasing a single digit (mod 10).\n// Example:\n// start = \"012\"\n// combo = \"329\"\n// output: ['112', '212', '312', '322', '321', '320']\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<string> states, string start, string combo, int target_len, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(states, start, combo, target_len), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({\"524\", \"624\", \"724\", \"734\", \"744\", \"754\", \"764\", \"774\", \"775\", \"776\", \"777\"}, \"424\", \"778\", 12, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"67872\", \"57872\", \"47872\", \"46872\", \"45872\", \"44872\", \"43872\", \"43772\", \"43672\", \"43572\", \"43582\", \"43592\", \"43502\", \"43503\", \"43504\", \"43505\"}, \"77872\", \"43506\", 16, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"168\", \"178\", \"188\", \"189\"}, \"268\", \"180\", 4, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"5675159714\", \"6675159714\", \"7675159714\", \"8675159714\", \"9675159714\", \"9775159714\", \"9765159714\", \"9755159714\", \"9756159714\", \"9757159714\", \"9758159714\", \"9758059714\", \"9758049714\", \"9758039714\", \"9758029714\", \"9758019714\", \"9758010714\", \"9758011714\", \"9758012714\", \"9758013714\", \"9758013814\", \"9758013824\", \"9758013834\", \"9758013844\", \"9758013843\", \"9758013842\", \"9758013841\"}, \"4675159714\", \"9758013840\", 27, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"142716\", \"042716\", \"942716\", \"842716\", \"852716\", \"862716\", \"872716\", \"882716\", \"892716\", \"891716\", \"891816\", \"891916\", \"891016\", \"891116\", \"891216\", \"891226\", \"891236\", \"891246\"}, \"242716\", \"891245\", 18, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"168\", \"178\", \"188\", \"189\"}, \"268\", \"778\", 4, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"168\", \"178\", \"188\", \"189\"}, \"424\", \"778\", 27, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"168\", \"178\", \"188\", \"189\"}, \"424\", \"180\", 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"168\", \"178\", \"188\", \"189\"}, \"424\", \"778\", 4, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
248 | TP3/codeforces.CombinationLockObfuscated | C++ | Verifies that the inputs satisfy the problem:
Figure out what this does only from the code | /**
* Verifies that the inputs satisfy the problem:
* Figure out what this does only from the code
*/
bool sat(vector<string> states, string start, string combo, int target_len) { | bool sat(vector<string> states, string start, string combo, int target_len) { | [
"states",
"start",
"combo",
"target_len"
] | def sat(states: List[str], start, combo, target_len):
return all((sum(((int(a[i]) - int(b[i])) ** 2 % 10 for i in range(len(start)))) == 1 for (a, b) in zip([start] + states, states[:target_len] + [combo]))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"states\": [\"524\", \"624\", \"724\", \"734\", \"744\", \"754\", \"764\", \"774\", \"775\", \"776\", \"777\"], \"start\": \"424\", \"combo\": \"778\", \"target_len\": 12}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"states\": [], \"start\": \"50\", \"combo\": \"59\", \"target_len\": 0}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"states\": [\"13\"], \"start\": \"23\", \"combo\": \"12\", \"target_len\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"states\": [], \"start\": \"4\", \"combo\": \"3\", \"target_len\": 0}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"states\": [\"3184377\", \"4184377\", \"5184377\", \"6184377\", \"7184377\", \"7084377\", \"7094377\", \"7004377\", \"7003377\", \"7002377\", \"7002277\", \"7002177\", \"7002077\", \"7002977\", \"7002987\", \"7002997\", \"7002996\", \"7002995\"], \"start\": \"2184377\", \"combo\": \"7002994\", \"target_len\": 18}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"states\": [], \"start\": \"50\", \"combo\": \"12\", \"target_len\": 0}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"states\": [], \"start\": \"23\", \"combo\": \"12\", \"target_len\": 1}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"states\": [], \"start\": \"4\", \"combo\": \"12\", \"target_len\": 0}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"states\": [], \"start\": \"23\", \"combo\": \"12\", \"target_len\": 0}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Figure out what this does only from the code\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<string> states, string start, string combo, int target_len, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(states, start, combo, target_len), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({\"524\", \"624\", \"724\", \"734\", \"744\", \"754\", \"764\", \"774\", \"775\", \"776\", \"777\"}, \"424\", \"778\", 12, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"50\", \"59\", 0, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"13\"}, \"23\", \"12\", 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"4\", \"3\", 0, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"3184377\", \"4184377\", \"5184377\", \"6184377\", \"7184377\", \"7084377\", \"7094377\", \"7004377\", \"7003377\", \"7002377\", \"7002277\", \"7002177\", \"7002077\", \"7002977\", \"7002987\", \"7002997\", \"7002996\", \"7002995\"}, \"2184377\", \"7002994\", 18, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"50\", \"12\", 0, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"23\", \"12\", 1, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"4\", \"12\", 0, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, \"23\", \"12\", 0, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
249 | TP3/codeforces.InvertPermutation | C++ | Verifies that the inputs satisfy the problem:
Find a string that, when a given permutation of characters is applied, has a given result. | /**
* Verifies that the inputs satisfy the problem:
* Find a string that, when a given permutation of characters is applied, has a given result.
*/
bool sat(string s, string perm, string target) { | bool sat(string s, string perm, string target) { | [
"s",
"perm",
"target"
] | def sat(s: str, perm, target):
return ''.join((perm[(perm.index(c) + 1) % len(perm)] if c in perm else c for c in s)) == target | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"gwkki pew tiy rgwew?\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"hello are you there?\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"zpotopjtfprwzrudtrg sucydthpxid xwxyxgymytoi aykwxgyjuhixgpepops gtxg nyfwnu ew vubucir\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"xapypakygatextifyth divufyjacof cecuchuquypo sulechukijocharapad hych mugemi re binivot\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"nyhtxgwbtli\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"mujychenyzo\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"mywrgieyxgteyftl qwntqyxibyrguaumyy jpxgifwxgwgyl oyktvteu myyvt rgprwzrpj rtxgyltnyzylpltktj bweylwaurguowxtrimy\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"quethoruchyrugyz wemywuconuthisiquu kachogechehuz pulybyri quuby thatextak tychuzymuxuzazylyk neruzesithipecytoqu\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"rgthtrwz xwmyikuxgurwzrirgi vtnizijwot htcyntqwdix\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"gwkki pew tiy rgwew?\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"mujychenyzo\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"nyhtxgwbtli\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"hello are you there?\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"gwkki pew tiy rgwew?\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"nyhtxgwbtli\", \"perm\": \"qwertyuiopasdfghjklzxcvbnm\", \"target\": \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a string that, when a given permutation of characters is applied, has a given result.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string perm, string target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, perm, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"gwkki pew tiy rgwew?\", \"qwertyuiopasdfghjklzxcvbnm\", \"hello are you there?\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"zpotopjtfprwzrudtrg sucydthpxid xwxyxgymytoi aykwxgyjuhixgpepops gtxg nyfwnu ew vubucir\", \"qwertyuiopasdfghjklzxcvbnm\", \"xapypakygatextifyth divufyjacof cecuchuquypo sulechukijocharapad hych mugemi re binivot\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"nyhtxgwbtli\", \"qwertyuiopasdfghjklzxcvbnm\", \"mujychenyzo\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"mywrgieyxgteyftl qwntqyxibyrguaumyy jpxgifwxgwgyl oyktvteu myyvt rgprwzrpj rtxgyltnyzylpltktj bweylwaurguowxtrimy\", \"qwertyuiopasdfghjklzxcvbnm\", \"quethoruchyrugyz wemywuconuthisiquu kachogechehuz pulybyri quuby thatextak tychuzymuxuzazylyk neruzesithipecytoqu\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"rgthtrwz xwmyikuxgurwzrirgi vtnizijwot htcyntqwdix\", \"qwertyuiopasdfghjklzxcvbnm\", \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"gwkki pew tiy rgwew?\", \"qwertyuiopasdfghjklzxcvbnm\", \"mujychenyzo\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"nyhtxgwbtli\", \"qwertyuiopasdfghjklzxcvbnm\", \"hello are you there?\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"gwkki pew tiy rgwew?\", \"qwertyuiopasdfghjklzxcvbnm\", \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"nyhtxgwbtli\", \"qwertyuiopasdfghjklzxcvbnm\", \"thyjytex cequolichitextotho bymoxokepy jyvumywefoc\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
250 | TP3/codeforces.SameDifferent | C++ | Verifies that the inputs satisfy the problem:
Given vector of integers and a target length, create of the given length such that:
* The first vector must be all different numbers.
* The second must be all the same number.
* The two vectors together comprise a sublist of all the vector items | /**
* Verifies that the inputs satisfy the problem:
* Given vector of integers and a target length, create of the given length such that:
* * The first vector must be all different numbers.
* * The second must be all the same number.
* * The two vectors together comprise a sublist of all the vector items
*/
bool sat(vector<vector<int>> lists, vector<int> items, int length_arg2) { | bool sat(vector<vector<int>> lists, vector<int> items, int length_arg2) { | [
"lists",
"items",
"length_arg2"
] | def sat(lists: List[List[int]], items, length_arg2):
(a, b) = lists
if not len(a) == len(b) == length_arg2:
return False
if not len(set(a)) == len(a):
return False
if not len(set(b)) == 1:
return False
for i in a + b:
if not (a + b).count(i) <= items.count(i):
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"lists\": [[4, 9, 1, 5], [5, 5, 5, 5]], \"items\": [5, 4, 9, 4, 5, 5, 5, 1, 5, 5], \"length_arg2\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"lists\": [[3, 2], [5, 5]], \"items\": [5, 3, 2, 1, 0, 1, 4, 2, 5, 4, 6, 7, 8], \"length_arg2\": 2}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"lists\": [[0, 9, 7, 6, 1, 5, 4, 3, 8, 2], [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]], \"items\": [0, 9, 7, 2, 6, 1, 6, 5, 4, 6, 5, 2, 6, 4, 2, 2, 7, 2, 7, 3, 4, 4, 8, 8, 1, 2, 6, 4, 7, 0, 4, 4, 6, 8, 4, 8, 3, 6, 6, 4, 7, 0, 3, 0, 7, 9, 3, 2, 7, 7, 1, 2, 8, 9, 4, 6, 8, 2, 2, 4, 6, 5, 3, 3, 2, 8, 8, 2, 7, 8, 7, 6, 9, 7, 3, 2, 0, 5], \"length_arg2\": 10}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"lists\": [[8, 1, 2, 7, 5, 3, 9, 4, 6, 0], [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]], \"items\": [8, 1, 8, 2, 7, 0, 5, 8, 1, 5, 7, 2, 7, 1, 3, 5, 2, 9, 2, 0, 5, 1, 9, 1, 7, 9, 4, 7, 3, 5, 5, 8, 8, 8, 3, 8, 7, 5, 5, 0, 3, 4, 2, 8, 0, 6, 7, 6, 6, 3, 0, 1, 1, 7, 6, 0, 9, 9, 9, 5, 6, 1, 0, 0, 6, 3, 3, 0, 4, 0, 6, 9, 1, 3, 2, 9, 4, 2, 4, 7, 2, 7, 6, 0, 9, 2, 2, 8, 9, 1, 3, 5, 8, 3, 3], \"length_arg2\": 10}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"lists\": [[5, 8, 2, 4, 9, 0, 6, 7, 3, 1], [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]], \"items\": [5, 8, 2, 2, 5, 1, 4, 9, 2, 0, 5, 4, 6, 5, 1, 7, 3, 2, 4, 6, 7, 2, 7, 3, 3, 1, 7, 9, 3, 2, 2, 9, 1, 2, 1, 1, 8, 6, 6, 2, 7, 6, 5, 2, 7, 6, 5, 0, 0, 8, 4, 5, 5, 3, 7, 5, 2, 0, 3, 1, 0, 8, 1, 3, 0, 1, 9, 4, 9, 1, 9, 7, 7, 1, 9, 7, 9, 4, 0, 8, 3, 7, 4, 3, 1, 6, 5, 8, 0, 9, 5, 7, 5, 6, 0, 1, 3, 1, 8], \"length_arg2\": 10}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"lists\": [[4, 9, 1, 5], [5, 5, 5, 5]], \"items\": [5, 4, 9, 4, 5, 5, 5, 1, 5, 5], \"length_arg2\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"lists\": [[4, 9, 1, 5], [5, 5, 5, 5]], \"items\": [], \"length_arg2\": 4}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"lists\": [[4, 9, 1, 5], [5, 5, 5, 5]], \"items\": [5, 4, 9, 4, 5, 5, 5, 1, 5, 5], \"length_arg2\": 10}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"lists\": [[3, 2], [5, 5]], \"items\": [5, 3, 2, 1, 0, 1, 4, 2, 5, 4, 6, 7, 8], \"length_arg2\": 4}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a list of integers and a target length, create of the given length such that:\n// * The first list must be all different numbers.\n// * The second must be all the same number.\n// * The two lists together comprise a sublist of all the list items\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> lists, vector<int> items, int length_arg2, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(lists, items, length_arg2), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{4, 9, 1, 5}, {5, 5, 5, 5}}, {5, 4, 9, 4, 5, 5, 5, 1, 5, 5}, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 2}, {5, 5}}, {5, 3, 2, 1, 0, 1, 4, 2, 5, 4, 6, 7, 8}, 2, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 9, 7, 6, 1, 5, 4, 3, 8, 2}, {2, 2, 2, 2, 2, 2, 2, 2, 2, 2}}, {0, 9, 7, 2, 6, 1, 6, 5, 4, 6, 5, 2, 6, 4, 2, 2, 7, 2, 7, 3, 4, 4, 8, 8, 1, 2, 6, 4, 7, 0, 4, 4, 6, 8, 4, 8, 3, 6, 6, 4, 7, 0, 3, 0, 7, 9, 3, 2, 7, 7, 1, 2, 8, 9, 4, 6, 8, 2, 2, 4, 6, 5, 3, 3, 2, 8, 8, 2, 7, 8, 7, 6, 9, 7, 3, 2, 0, 5}, 10, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{8, 1, 2, 7, 5, 3, 9, 4, 6, 0}, {0, 0, 0, 0, 0, 0, 0, 0, 0, 0}}, {8, 1, 8, 2, 7, 0, 5, 8, 1, 5, 7, 2, 7, 1, 3, 5, 2, 9, 2, 0, 5, 1, 9, 1, 7, 9, 4, 7, 3, 5, 5, 8, 8, 8, 3, 8, 7, 5, 5, 0, 3, 4, 2, 8, 0, 6, 7, 6, 6, 3, 0, 1, 1, 7, 6, 0, 9, 9, 9, 5, 6, 1, 0, 0, 6, 3, 3, 0, 4, 0, 6, 9, 1, 3, 2, 9, 4, 2, 4, 7, 2, 7, 6, 0, 9, 2, 2, 8, 9, 1, 3, 5, 8, 3, 3}, 10, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{5, 8, 2, 4, 9, 0, 6, 7, 3, 1}, {1, 1, 1, 1, 1, 1, 1, 1, 1, 1}}, {5, 8, 2, 2, 5, 1, 4, 9, 2, 0, 5, 4, 6, 5, 1, 7, 3, 2, 4, 6, 7, 2, 7, 3, 3, 1, 7, 9, 3, 2, 2, 9, 1, 2, 1, 1, 8, 6, 6, 2, 7, 6, 5, 2, 7, 6, 5, 0, 0, 8, 4, 5, 5, 3, 7, 5, 2, 0, 3, 1, 0, 8, 1, 3, 0, 1, 9, 4, 9, 1, 9, 7, 7, 1, 9, 7, 9, 4, 0, 8, 3, 7, 4, 3, 1, 6, 5, 8, 0, 9, 5, 7, 5, 6, 0, 1, 3, 1, 8}, 10, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{4, 9, 1, 5}, {5, 5, 5, 5}}, {5, 4, 9, 4, 5, 5, 5, 1, 5, 5}, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{4, 9, 1, 5}, {5, 5, 5, 5}}, {}, 4, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{4, 9, 1, 5}, {5, 5, 5, 5}}, {5, 4, 9, 4, 5, 5, 5, 1, 5, 5}, 10, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{3, 2}, {5, 5}}, {5, 3, 2, 1, 0, 1, 4, 2, 5, 4, 6, 7, 8}, 4, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
251 | TP3/codeforces.OnesAndTwos | C++ | Verifies that the inputs satisfy the problem:
Find a sequence of 1's and 2's of a given length that that adds up to n | /**
* Verifies that the inputs satisfy the problem:
* Find a sequence of 1's and 2's of a given length that that adds up to n
*/
bool sat(vector<int> seq, int n, int length_arg2) { | bool sat(vector<int> seq, int n, int length_arg2) { | [
"seq",
"n",
"length_arg2"
] | def sat(seq: List[int], n, length_arg2):
return all((i in [1, 2] for i in seq)) and sum(seq) == n and (len(seq) == length_arg2) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"seq\": [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], \"n\": 58, \"length_arg2\": 56}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"seq\": [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1], \"n\": 83, \"length_arg2\": 44}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"seq\": [], \"n\": 0, \"length_arg2\": 0}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"seq\": [1, 1], \"n\": 2, \"length_arg2\": 2}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"seq\": [], \"n\": 58, \"length_arg2\": 0}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"seq\": [], \"n\": 2, \"length_arg2\": 0}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"seq\": [], \"n\": 83, \"length_arg2\": 2}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"seq\": [], \"n\": 2, \"length_arg2\": 2}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a sequence of 1's and 2's of a given length that that adds up to n\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> seq, int n, int length_arg2, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(seq, n, length_arg2), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 58, 56, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1}, 83, 44, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 0, 0, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1}, 2, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 58, 0, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 2, 0, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 83, 2, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 2, 2, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
252 | TP3/codeforces.MinConsecutiveSum | C++ | Verifies that the inputs satisfy the problem:
Find a sequence of k consecutive indices whose sum is minimal | /**
* Verifies that the inputs satisfy the problem:
* Find a sequence of k consecutive indices whose sum is minimal
*/
bool sat(int start, int k, int upper, vector<int> seq) { | bool sat(int start, int k, int upper, vector<int> seq) { | [
"start",
"k",
"upper",
"seq"
] | def sat(start: int, k, upper, seq):
return 0 <= start <= len(seq) - k and sum(seq[start:start + k]) <= upper | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"start\": 8, \"k\": 3, \"upper\": 6, \"seq\": [17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"start\": 6, \"k\": 2, \"upper\": -172, \"seq\": [79, 18, -98, -13, 88, -93, -77, -95, 40, -3, -22]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"start\": 4, \"k\": 3, \"upper\": -238, \"seq\": [34, -9, -41, -62, -99, -58, -81, 66, -51, 90, -8, -56, -80, -66, -50, -74, -4, -47, 63, -86, 66, 72, 38, -3, 9, 92, 25, -77, 86, -24, -23, 9, 10, 36, -82, -48, -74, -1, -80, 55, -2, -86, 95, -52, -14, -87]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"start\": 1, \"k\": 8, \"upper\": -75, \"seq\": [17, -90, 61, -29, 57, 7, -45, -37, 1, 69]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"start\": 2, \"k\": 8, \"upper\": -4, \"seq\": [-17, 55, 6, -2, -14, -19, 86, -4, -8, -49, 40, 82]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"start\": 4, \"k\": 2, \"upper\": 6, \"seq\": [17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"start\": 1, \"k\": 8, \"upper\": 6, \"seq\": [17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"start\": 6, \"k\": 8, \"upper\": 6, \"seq\": [17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"start\": 6, \"k\": 2, \"upper\": 6, \"seq\": [17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a sequence of k consecutive indices whose sum is minimal\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int start, int k, int upper, vector<int> seq, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(start, k, upper, seq), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(8, 3, 6, {17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, 2, -172, {79, 18, -98, -13, 88, -93, -77, -95, 40, -3, -22}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, 3, -238, {34, -9, -41, -62, -99, -58, -81, 66, -51, 90, -8, -56, -80, -66, -50, -74, -4, -47, 63, -86, 66, 72, 38, -3, 9, 92, 25, -77, 86, -24, -23, 9, 10, 36, -82, -48, -74, -1, -80, 55, -2, -86, 95, -52, -14, -87}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1, 8, -75, {17, -90, 61, -29, 57, 7, -45, -37, 1, 69}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2, 8, -4, {-17, 55, 6, -2, -14, -19, 86, -4, -8, -49, 40, 82}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(4, 2, 6, {17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1, 8, 6, {17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, 8, 6, {17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(6, 2, 6, {17, 1, 2, 65, 18, 91, -30, 100, 3, 1, 2}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
253 | TP3/codeforces.MaxConsecutiveSum | C++ | Verifies that the inputs satisfy the problem:
Find a sequence of k consecutive indices whose sum is maximal | /**
* Verifies that the inputs satisfy the problem:
* Find a sequence of k consecutive indices whose sum is maximal
*/
bool sat(int start, int k, int lower, vector<int> seq) { | bool sat(int start, int k, int lower, vector<int> seq) { | [
"start",
"k",
"lower",
"seq"
] | def sat(start: int, k, lower, seq):
return 0 <= start <= len(seq) - k and sum(seq[start:start + k]) >= lower | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"start\": 3, \"k\": 3, \"lower\": 150, \"seq\": [3, 1, 2, 65, 18, 91, -30, 100, 0, 19, 52]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"start\": 0, \"k\": 9, \"lower\": -183, \"seq\": [44, -94, 25, -63, -39, -71, -34, 84, -35]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"start\": 7, \"k\": 3, \"lower\": 86, \"seq\": [19, 82, -24, -9, -92, 50, -89, -15, 45, 56, -64]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"start\": 0, \"k\": 1, \"lower\": -36, \"seq\": [-36]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"start\": 3, \"k\": 1, \"lower\": 93, \"seq\": [-61, -46, 89, 93, -13, 14, -95, -74, -92, -38, -93, 64, -78, 3, 92, -10, -4, 43, 72, 12, 3, -3, -15, -96, 72, -71, -30, 53, 17, -87, 49, 17, -69, 78, 6, -77, -99, 91, 13, 9, 81, -55, 75, 48, -65, 18, -83, 10, -12, 88, 60, -72, -7, -49, -56, -76, 82, 18, 77, 52, -92, -88, 39, 13, -16, 82, 4, 44, -19, 54, 6, 55, 77, -38, -30, -55, -16]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"start\": 0, \"k\": 1, \"lower\": 86, \"seq\": [-36]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"start\": 0, \"k\": 1, \"lower\": 93, \"seq\": [-36]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"start\": 0, \"k\": 9, \"lower\": 93, \"seq\": [-36]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"start\": 0, \"k\": 3, \"lower\": 86, \"seq\": [-36]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a sequence of k consecutive indices whose sum is maximal\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int start, int k, int lower, vector<int> seq, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(start, k, lower, seq), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(3, 3, 150, {3, 1, 2, 65, 18, 91, -30, 100, 0, 19, 52}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 9, -183, {44, -94, 25, -63, -39, -71, -34, 84, -35}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(7, 3, 86, {19, 82, -24, -9, -92, 50, -89, -15, 45, 56, -64}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 1, -36, {-36}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(3, 1, 93, {-61, -46, 89, 93, -13, 14, -95, -74, -92, -38, -93, 64, -78, 3, 92, -10, -4, 43, 72, 12, 3, -3, -15, -96, 72, -71, -30, 53, 17, -87, 49, 17, -69, 78, 6, -77, -99, 91, 13, 9, 81, -55, 75, 48, -65, 18, -83, 10, -12, 88, 60, -72, -7, -49, -56, -76, 82, 18, 77, 52, -92, -88, 39, 13, -16, 82, 4, 44, -19, 54, 6, 55, 77, -38, -30, -55, -16}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 1, 86, {-36}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 1, 93, {-36}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 9, 93, {-36}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0, 3, 86, {-36}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
254 | TP3/codeforces.MaxConsecutiveProduct | C++ | Verifies that the inputs satisfy the problem:
Find a sequence of k consecutive indices whose product is maximal, possibly looping around | /**
* Verifies that the inputs satisfy the problem:
* Find a sequence of k consecutive indices whose product is maximal, possibly looping around
*/
bool sat(int start, int k, long long lower, vector<int> seq) { | bool sat(int start, int k, long long lower, vector<int> seq) { | [
"start",
"k",
"lower",
"seq"
] | def sat(start: int, k, lower, seq):
prod = 1
for i in range(start, start + k):
prod *= seq[i]
return prod >= lower | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"start\": -2, \"k\": 3, \"lower\": 100000, \"seq\": [91, 1, 2, 64, 18, 91, -30, 100, 3, 65, 18]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"start\": -8, \"k\": 8, \"lower\": 774420991987500, \"seq\": [-50, -99, -99, -65, -69, -87, 90, 45]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"start\": -5, \"k\": 6, \"lower\": 188917681120, \"seq\": [73, -32, 30, 92, 73, 8, 31, 40, -59, -97, -16, -83, -86, 78, -91, -18, -31, 31, 37, 79, 63, 38, 14, 68, -73, 91, 71, 87, 54, -7, -74, -63, -57, -46, -78, -22, 71, 52, 32, -82, 71, 76, -28, 83, -65, -65, 70, -35, 83, -40, 69, 78, -81, 0, -69, -1, 0, 61, 92, 55, -89, 60, 74, 99, -53, -22, 50, 28, -60, 6, 27, -53, -77, 99, 1, -69, -67, 81, -89, 45, 59, -28, 24, -21, -65, -56, -89, -30, 58, 78, 73, 9, 81, -39, -99, 43, 32, 58, -56, -83, 82, 97, 70]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"start\": -5, \"k\": 2, \"lower\": 5589, \"seq\": [8, -66, 75, 74, 40, 14, -81, -69, 99, 27, -18]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"start\": -10, \"k\": 10, \"lower\": -8326797433194240, \"seq\": [49, -99, 80, 26, 54, 13, 37, 13, -52, -47]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"start\": -8, \"k\": 2, \"lower\": 100000, \"seq\": [-50, -99, -99, -65, -69, -87, 90, 45]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"start\": -2, \"k\": 3, \"lower\": 5589, \"seq\": [-50, -99, -99, -65, -69, -87, 90, 45]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"start\": -5, \"k\": 2, \"lower\": 5589, \"seq\": [-50, -99, -99, -65, -69, -87, 90, 45]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"start\": -2, \"k\": 2, \"lower\": 5589, \"seq\": [-50, -99, -99, -65, -69, -87, 90, 45]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a sequence of k consecutive indices whose product is maximal, possibly looping around\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int start, int k, long long lower, vector<int> seq, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(start, k, lower, seq), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(-2, 3, 100000, {91, 1, 2, 64, 18, 91, -30, 100, 3, 65, 18}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-8, 8, 774420991987500, {-50, -99, -99, -65, -69, -87, 90, 45}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-5, 6, 188917681120, {73, -32, 30, 92, 73, 8, 31, 40, -59, -97, -16, -83, -86, 78, -91, -18, -31, 31, 37, 79, 63, 38, 14, 68, -73, 91, 71, 87, 54, -7, -74, -63, -57, -46, -78, -22, 71, 52, 32, -82, 71, 76, -28, 83, -65, -65, 70, -35, 83, -40, 69, 78, -81, 0, -69, -1, 0, 61, 92, 55, -89, 60, 74, 99, -53, -22, 50, 28, -60, 6, 27, -53, -77, 99, 1, -69, -67, 81, -89, 45, 59, -28, 24, -21, -65, -56, -89, -30, 58, 78, 73, 9, 81, -39, -99, 43, 32, 58, -56, -83, 82, 97, 70}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-5, 2, 5589, {8, -66, 75, 74, 40, 14, -81, -69, 99, 27, -18}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-10, 10, -8326797433194240, {49, -99, 80, 26, 54, 13, 37, 13, -52, -47}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-8, 2, 100000, {-50, -99, -99, -65, -69, -87, 90, 45}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-2, 3, 5589, {-50, -99, -99, -65, -69, -87, 90, 45}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-5, 2, 5589, {-50, -99, -99, -65, -69, -87, 90, 45}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-2, 2, 5589, {-50, -99, -99, -65, -69, -87, 90, 45}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
255 | TP3/codeforces.DistinctOddSum | C++ | Verifies that the inputs satisfy the problem:
Find n distinct positive odd integers that sum to tot | /**
* Verifies that the inputs satisfy the problem:
* Find n distinct positive odd integers that sum to tot
*/
bool sat(vector<int> nums, int tot, int n) { | bool sat(vector<int> nums, int tot, int n) { | [
"nums",
"tot",
"n"
] | def sat(nums: List[int], tot, n):
return len(nums) == len(set(nums)) == n and sum(nums) == tot and all((i >= i % 2 > 0 for i in nums)) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"nums\": [1, 3, 5, 7, 12329], \"tot\": 12345, \"n\": 5}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"nums\": [1, 3, 1815], \"tot\": 1819, \"n\": 3}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"nums\": [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 32545], \"tot\": 37729, \"n\": 73}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"nums\": [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 5259], \"tot\": 5359, \"n\": 11}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"nums\": [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 31321], \"tot\": 36505, \"n\": 73}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"nums\": [1, 3, 1815], \"tot\": 36505, \"n\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"nums\": [1, 3, 1815], \"tot\": 36505, \"n\": 5}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"nums\": [1, 3, 1815], \"tot\": 5359, \"n\": 5}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"nums\": [1, 3, 1815], \"tot\": 1819, \"n\": 5}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find n distinct positive odd integers that sum to tot\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> nums, int tot, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(nums, tot, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({1, 3, 5, 7, 12329}, 12345, 5, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 1815}, 1819, 3, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 32545}, 37729, 73, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 5259}, 5359, 11, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 31321}, 36505, 73, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 1815}, 36505, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 1815}, 36505, 5, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 1815}, 5359, 5, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 3, 1815}, 1819, 5, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
256 | TP3/codeforces.MinRotations | C++ | Verifies that the inputs satisfy the problem:
We begin with the string `"a...z"`
An `r`-rotation of a string means shifting it to the right (positive) or left (negative) by `r` characters and
cycling around. Given a target string of length n, find the n rotations that put the consecutive characters
of that string at the beginning of the r-rotation, with minimal sum of absolute values of the `r`'s.
For example if the string was `'dad'`, the minimal rotations would be `[3, -3, 3]` with a total of `9`. | /**
* Verifies that the inputs satisfy the problem:
* We begin with the string `"a...z"`
* An `r`-rotation of a string means shifting it to the right (positive) or left (negative) by `r` characters and
* cycling around. Given a target string of length n, find the n rotations that put the consecutive characters
* of that string at the beginning of the r-rotation, with minimal sum of absolute values of the `r`'s.
* For example if the string was `'dad'`, the minimal rotations would be `[3, -3, 3]` with a total of `9`.
*/
bool sat(vector<int> rotations, string target, int upper) { | bool sat(vector<int> rotations, string target, int upper) { | [
"rotations",
"target",
"upper"
] | def sat(rotations: List[int], target, upper):
s = 'abcdefghijklmnopqrstuvwxyz'
if not len(rotations) == len(target):
return False
for (r, c) in zip(rotations, target):
s = s[r:] + s[:r]
if not s[0] == c:
return False
return sum((abs(r) for r in rotations)) <= upper | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"rotations\": [-4, -8, -1, -10, 1, 13, -12, -11, -9], \"target\": \"wonderful\", \"upper\": 69}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"rotations\": [-7, 1, 7, 13, -3, -7, 7, -7], \"target\": \"tubolele\", \"upper\": 52}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"rotations\": [-8, -4, 2, 4, -6, -8, 2, 10, 8, -4, 4, 7], \"target\": \"soquogisawah\", \"upper\": 67}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"rotations\": [9, -9, 2, 2, 11, 11], \"target\": \"jacepa\", \"upper\": 44}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"rotations\": [12, -4, -12, 2, 12, 10, 8, 2, 3, -3, -7, -9], \"target\": \"miwykucehexo\", \"upper\": 84}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"rotations\": [9, -9, 2, 2, 11, 11], \"target\": \"tubolele\", \"upper\": 52}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"rotations\": [9, -9, 2, 2, 11, 11], \"target\": \"tubolele\", \"upper\": 67}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"rotations\": [9, -9, 2, 2, 11, 11], \"target\": \"wonderful\", \"upper\": 44}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"rotations\": [9, -9, 2, 2, 11, 11], \"target\": \"wonderful\", \"upper\": 69}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// We begin with the string `\"a...z\"`\n// An `r`-rotation of a string means shifting it to the right (positive) or left (negative) by `r` characters and\n// cycling around. Given a target string of length n, find the n rotations that put the consecutive characters\n// of that string at the beginning of the r-rotation, with minimal sum of absolute values of the `r`'s.\n// For example if the string was `'dad'`, the minimal rotations would be `[3, -3, 3]` with a total of `9`.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> rotations, string target, int upper, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(rotations, target, upper), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({-4, -8, -1, -10, 1, 13, -12, -11, -9}, \"wonderful\", 69, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-7, 1, 7, 13, -3, -7, 7, -7}, \"tubolele\", 52, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-8, -4, 2, 4, -6, -8, 2, 10, 8, -4, 4, 7}, \"soquogisawah\", 67, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({9, -9, 2, 2, 11, 11}, \"jacepa\", 44, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({12, -4, -12, 2, 12, 10, 8, 2, 3, -3, -7, -9}, \"miwykucehexo\", 84, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({9, -9, 2, 2, 11, 11}, \"tubolele\", 52, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({9, -9, 2, 2, 11, 11}, \"tubolele\", 67, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({9, -9, 2, 2, 11, 11}, \"wonderful\", 44, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({9, -9, 2, 2, 11, 11}, \"wonderful\", 69, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
257 | TP3/codeforces.BillSums | C++ | Verifies that the inputs satisfy the problem:
Find the shortest sequence (length <= max_len) that sum to n, where each number is in denominations | /**
* Verifies that the inputs satisfy the problem:
* Find the shortest sequence (length <= max_len) that sum to n, where each number is in denominations
*/
bool sat(vector<int> bills, vector<int> denominations, int n, int max_len) { | bool sat(vector<int> bills, vector<int> denominations, int n, int max_len) { | [
"bills",
"denominations",
"n",
"max_len"
] | def sat(bills: List[int], denominations, n, max_len):
return sum(bills) == n and all((b in denominations for b in bills)) and (len(bills) <= max_len) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"bills\": [35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84], \"denominations\": [1, 25, 35, 84], \"n\": 980, \"max_len\": 14}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"bills\": [1, 1, 1, 1, 1, 44, 44, 44, 44, 44, 44, 44, 69, 69, 69, 69, 69, 69], \"denominations\": [1, 44, 69], \"n\": 727, \"max_len\": 18}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"bills\": [1, 1, 25, 25, 25, 25, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29], \"denominations\": [1, 25, 29], \"n\": 537, \"max_len\": 21}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"bills\": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23], \"denominations\": [1, 23], \"n\": 293, \"max_len\": 29}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"bills\": [35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84], \"denominations\": [1, 23], \"n\": 293, \"max_len\": 18}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"bills\": [35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84], \"denominations\": [1, 23], \"n\": 293, \"max_len\": 14}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"bills\": [35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84], \"denominations\": [1, 23], \"n\": 727, \"max_len\": 21}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"bills\": [35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84], \"denominations\": [1, 23], \"n\": 727, \"max_len\": 14}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the shortest sequence (length <= max_len) that sum to n, where each number is in denominations\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> bills, vector<int> denominations, int n, int max_len, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(bills, denominations, n, max_len), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84}, {1, 25, 35, 84}, 980, 14, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 1, 1, 1, 44, 44, 44, 44, 44, 44, 44, 69, 69, 69, 69, 69, 69}, {1, 44, 69}, 727, 18, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 25, 25, 25, 25, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29}, {1, 25, 29}, 537, 21, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23}, {1, 23}, 293, 29, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84}, {1, 23}, 293, 18, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84}, {1, 23}, 293, 14, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84}, {1, 23}, 727, 21, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({35, 35, 35, 35, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84}, {1, 23}, 727, 14, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
258 | TP3/codeforces.BoxVolume | C++ | Verifies that the inputs satisfy the problem:
Find the side lengths of a box in fewest dimensions (dimension <= max_dim) whose volume is n,
where each side length is in options | /**
* Verifies that the inputs satisfy the problem:
* Find the side lengths of a box in fewest dimensions (dimension <= max_dim) whose volume is n,
* where each side length is in options
*/
bool sat(vector<int> sides, vector<int> options, int n, int max_dim) { | bool sat(vector<int> sides, vector<int> options, int n, int max_dim) { | [
"sides",
"options",
"n",
"max_dim"
] | def sat(sides: List[int], options, n, max_dim):
prod = 1
for b in sides:
prod *= b
return prod == n and set(sides) <= set(options) and (len(sides) <= max_dim) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"sides\": [512, 512], \"options\": [2, 256, 512], \"n\": 262144, \"max_dim\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"sides\": [512, 512, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024], \"options\": [2, 64, 16, 4], \"n\": 256, \"max_dim\": 2}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"sides\": [25, 15625], \"options\": [5, 15625, 25], \"n\": 390625, \"max_dim\": 2}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"sides\": [49, 117649], \"options\": [7, 117649, 49], \"n\": 5764801, \"max_dim\": 2}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"sides\": [64], \"options\": [2, 64], \"n\": 64, \"max_dim\": 1}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"sides\": [64], \"options\": [2, 64], \"n\": 390625, \"max_dim\": 4}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"sides\": [64], \"options\": [2, 64], \"n\": 262144, \"max_dim\": 2}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"sides\": [64], \"options\": [2, 64], \"n\": 390625, \"max_dim\": 2}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"sides\": [64], \"options\": [2, 64], \"n\": 256, \"max_dim\": 1}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the side lengths of a box in fewest dimensions (dimension <= max_dim) whose volume is n,\n// where each side length is in options\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> sides, vector<int> options, int n, int max_dim, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(sides, options, n, max_dim), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({512, 512}, {2, 256, 512}, 262144, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({512, 512, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024, 1024}, {2, 64, 16, 4}, 256, 2, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({25, 15625}, {5, 15625, 25}, 390625, 2, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({49, 117649}, {7, 117649, 49}, 5764801, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({64}, {2, 64}, 64, 1, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({64}, {2, 64}, 390625, 4, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({64}, {2, 64}, 262144, 2, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({64}, {2, 64}, 390625, 2, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({64}, {2, 64}, 256, 1, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
259 | TP3/algebra.QuadraticRoot | C++ | Verifies that the inputs satisfy the problem:
Find any (real) solution to: a x^2 + b x + c where coeffs = [a, b, c].
For example, since x^2 - 3x + 2 has a root at 1, sat(x = 1., coeffs = [1., -3., 2.]) is True. | /**
* Verifies that the inputs satisfy the problem:
* Find any (real) solution to: a x^2 + b x + c where coeffs = [a, b, c].
* For example, since x^2 - 3x + 2 has a root at 1, sat(x = 1., coeffs = [1., -3., 2.]) is True.
*/
bool sat(double x, vector<double> coeffs) { | bool sat(double x, vector<double> coeffs) { | [
"x",
"coeffs"
] | def sat(x: float, coeffs):
(a, b, c) = coeffs
return abs(a * x ** 2 + b * x + c) < 1e-06 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": 0.2573006862551025, \"coeffs\": [2.5, 1.3, -0.5]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": 2.2467990270530227, \"coeffs\": [0.0685642998539026, -0.10446230957339113, -0.11141402891228723]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 11.7261249651681, \"coeffs\": [0.2622487694588566, 0.48521166316030495, -41.749384651642444]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": 0.1878869429484059, \"coeffs\": [145.72190605632582, 0.027358325157428014, -5.149342624051854]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": 524.9318042993127, \"coeffs\": [1.1222556871110754, -0.007015312913509468, -309237.6867547677]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 11.7261249651681, \"coeffs\": [145.72190605632582, 0.027358325157428014, -5.149342624051854]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 11.7261249651681, \"coeffs\": [2.5, 1.3, -0.5]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 524.9318042993127, \"coeffs\": [0.2622487694588566, 0.48521166316030495, -41.749384651642444]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": 11.7261249651681, \"coeffs\": [1.1222556871110754, -0.007015312913509468, -309237.6867547677]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find any (real) solution to: a x^2 + b x + c where coeffs = [a, b, c].\n// For example, since x^2 - 3x + 2 has a root at 1, sat(x = 1., coeffs = [1., -3., 2.]) is True.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(double x, vector<double> coeffs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, coeffs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(0.2573006862551025, {2.5, 1.3, -0.5}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(2.2467990270530227, {0.0685642998539026, -0.10446230957339113, -0.11141402891228723}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(11.7261249651681, {0.2622487694588566, 0.48521166316030495, -41.749384651642444}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.1878869429484059, {145.72190605632582, 0.027358325157428014, -5.149342624051854}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(524.9318042993127, {1.1222556871110754, -0.007015312913509468, -309237.6867547677}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(11.7261249651681, {145.72190605632582, 0.027358325157428014, -5.149342624051854}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(11.7261249651681, {2.5, 1.3, -0.5}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(524.9318042993127, {0.2622487694588566, 0.48521166316030495, -41.749384651642444}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(11.7261249651681, {1.1222556871110754, -0.007015312913509468, -309237.6867547677}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
260 | TP3/algebra.AllQuadraticRoots | C++ | Verifies that the inputs satisfy the problem:
Find all (real) solutions to: x^2 + b x + c (i.e., factor into roots), here coeffs = [b, c] | /**
* Verifies that the inputs satisfy the problem:
* Find all (real) solutions to: x^2 + b x + c (i.e., factor into roots), here coeffs = [b, c]
*/
bool sat(vector<double> roots, vector<double> coeffs) { | bool sat(vector<double> roots, vector<double> coeffs) { | [
"roots",
"coeffs"
] | def sat(roots: List[float], coeffs):
(b, c) = coeffs
(r1, r2) = roots
return abs(r1 + r2 + b) + abs(r1 * r2 - c) < 1e-06 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"roots\": [0.3104686356149273, -1.6104686356149274], \"coeffs\": [1.3, -0.5]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"roots\": [1.9526922712051686, -0.4841432818979936], \"coeffs\": [-1.468548989307175, -0.9453828447181172]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"roots\": [2.1346659105187733, -0.111641354609892], \"coeffs\": [-2.0230245559088815, -0.23831699388987454]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"roots\": [33.938628259671454, -0.14825633213285272], \"coeffs\": [-33.7903719275386, -5.03161654339928]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"roots\": [0.10226923150034484, -9.257375070533051], \"coeffs\": [9.155105839032705, -0.9467446341738642]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"roots\": [1.9526922712051686, -0.4841432818979936], \"coeffs\": [1.3, -0.5]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"roots\": [0.10226923150034484, -9.257375070533051], \"coeffs\": [1.3, -0.5]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"roots\": [2.1346659105187733, -0.111641354609892], \"coeffs\": [-33.7903719275386, -5.03161654339928]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"roots\": [0.3104686356149273, -1.6104686356149274], \"coeffs\": [-33.7903719275386, -5.03161654339928]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find all (real) solutions to: x^2 + b x + c (i.e., factor into roots), here coeffs = [b, c]\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<double> roots, vector<double> coeffs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(roots, coeffs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0.3104686356149273, -1.6104686356149274}, {1.3, -0.5}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1.9526922712051686, -0.4841432818979936}, {-1.468548989307175, -0.9453828447181172}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2.1346659105187733, -0.111641354609892}, {-2.0230245559088815, -0.23831699388987454}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({33.938628259671454, -0.14825633213285272}, {-33.7903719275386, -5.03161654339928}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.10226923150034484, -9.257375070533051}, {9.155105839032705, -0.9467446341738642}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1.9526922712051686, -0.4841432818979936}, {1.3, -0.5}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.10226923150034484, -9.257375070533051}, {1.3, -0.5}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2.1346659105187733, -0.111641354609892}, {-33.7903719275386, -5.03161654339928}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.3104686356149273, -1.6104686356149274}, {-33.7903719275386, -5.03161654339928}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
261 | TP3/algebra.CubicRoot | C++ | Verifies that the inputs satisfy the problem:
Find any (real) solution to: a x^3 + b x^2 + c x + d where coeffs = [a, b, c, d]
For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6, sat(x = 1., coeffs = [-6., 11., -6.]) is True. | /**
* Verifies that the inputs satisfy the problem:
* Find any (real) solution to: a x^3 + b x^2 + c x + d where coeffs = [a, b, c, d]
* For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6, sat(x = 1., coeffs = [-6., 11., -6.]) is True.
*/
bool sat(double x, vector<double> coeffs) { | bool sat(double x, vector<double> coeffs) { | [
"x",
"coeffs"
] | def sat(x: float, coeffs):
return abs(sum((c * x ** (3 - i) for (i, c) in enumerate(coeffs)))) < 1e-06 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": -1.772776344958769, \"coeffs\": [2.0, 1.0, 0.0, 8.0]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": 1072.8678418091922, \"coeffs\": [0.009597657937719273, -10.297175825569942, 0.15891220226280925, 10.530249049250433]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 0.43601500265481397, \"coeffs\": [-0.17749172356645268, -1.3894267878542186, 0.03752944532850555, 0.2624916128068381]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": 0.8356682286587807, \"coeffs\": [-2.3153234528266906, 11.247619504308075, -72.3705721705674, 53.97429005428236]}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"x\": -1.772776344958769, \"coeffs\": [0.009597657937719273, -10.297175825569942, 0.15891220226280925, 10.530249049250433]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 1072.8678418091922, \"coeffs\": [2.0, 1.0, 0.0, 8.0]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 0.43601500265481397, \"coeffs\": [2.0, 1.0, 0.0, 8.0]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 0.8356682286587807, \"coeffs\": [2.0, 1.0, 0.0, 8.0]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find any (real) solution to: a x^3 + b x^2 + c x + d where coeffs = [a, b, c, d]\n// For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6, sat(x = 1., coeffs = [-6., 11., -6.]) is True.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(double x, vector<double> coeffs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, coeffs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(-1.772776344958769, {2.0, 1.0, 0.0, 8.0}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1072.8678418091922, {0.009597657937719273, -10.297175825569942, 0.15891220226280925, 10.530249049250433}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.43601500265481397, {-0.17749172356645268, -1.3894267878542186, 0.03752944532850555, 0.2624916128068381}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.8356682286587807, {-2.3153234528266906, 11.247619504308075, -72.3705721705674, 53.97429005428236}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-1.772776344958769, {0.009597657937719273, -10.297175825569942, 0.15891220226280925, 10.530249049250433}, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1072.8678418091922, {2.0, 1.0, 0.0, 8.0}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.43601500265481397, {2.0, 1.0, 0.0, 8.0}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.8356682286587807, {2.0, 1.0, 0.0, 8.0}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
262 | TP3/algebra.AllCubicRoots | C++ | Verifies that the inputs satisfy the problem:
Find all 3 distinct real roots of x^3 + a x^2 + b x + c, i.e., factor into (x-r1)(x-r2)(x-r3).
coeffs = [a, b, c]. For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6,
sat(roots = [1., 2., 3.], coeffs = [-6., 11., -6.]) is True. | /**
* Verifies that the inputs satisfy the problem:
* Find all 3 distinct real roots of x^3 + a x^2 + b x + c, i.e., factor into (x-r1)(x-r2)(x-r3).
* coeffs = [a, b, c]. For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6,
* sat(roots = [1., 2., 3.], coeffs = [-6., 11., -6.]) is True.
*/
bool sat(vector<double> roots, vector<double> coeffs) { | bool sat(vector<double> roots, vector<double> coeffs) { | [
"roots",
"coeffs"
] | def sat(roots: List[float], coeffs):
(r1, r2, r3) = roots
(a, b, c) = coeffs
return abs(r1 + r2 + r3 + a) + abs(r1 * r2 + r1 * r3 + r2 * r3 - b) + abs(r1 * r2 * r3 + c) < 1e-06 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"roots\": [1.2469796037174672, -0.44504186791262906, -1.8019377358048383], \"coeffs\": [1.0, -2.0, -1.0]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"roots\": [0.45107312046279446, 0.35498554340792055, -292.44544467335487], \"coeffs\": [291.6393860094841, -235.56805995170293, 46.827662118172]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"roots\": [0.33710995325737675, 0.3086912357129851, -0.39351216235665026], \"coeffs\": [-0.25228902661371166, -0.1500677342820565, 0.04095001209455085]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"roots\": [0.9627868626597909, 0.6054724871768047, -0.8118448171856856], \"coeffs\": [-0.7564145326509102, -0.6902422688120567, 0.4732575941427041]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"roots\": [2.2860337730132825, -1.6213509948589593, -5.784682018960652], \"coeffs\": [5.119999240806329, -7.551441647258393, -21.440710634524915]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"roots\": [0.33710995325737675, 0.3086912357129851, -0.39351216235665026], \"coeffs\": [291.6393860094841, -235.56805995170293, 46.827662118172]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"roots\": [0.33710995325737675, 0.3086912357129851, -0.39351216235665026], \"coeffs\": [1.0, -2.0, -1.0]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"roots\": [0.45107312046279446, 0.35498554340792055, -292.44544467335487], \"coeffs\": [1.0, -2.0, -1.0]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"roots\": [0.9627868626597909, 0.6054724871768047, -0.8118448171856856], \"coeffs\": [291.6393860094841, -235.56805995170293, 46.827662118172]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find all 3 distinct real roots of x^3 + a x^2 + b x + c, i.e., factor into (x-r1)(x-r2)(x-r3).\n// coeffs = [a, b, c]. For example, since (x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x - 6,\n// sat(roots = [1., 2., 3.], coeffs = [-6., 11., -6.]) is True.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<double> roots, vector<double> coeffs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(roots, coeffs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({1.2469796037174672, -0.44504186791262906, -1.8019377358048383}, {1.0, -2.0, -1.0}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.45107312046279446, 0.35498554340792055, -292.44544467335487}, {291.6393860094841, -235.56805995170293, 46.827662118172}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.33710995325737675, 0.3086912357129851, -0.39351216235665026}, {-0.25228902661371166, -0.1500677342820565, 0.04095001209455085}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.9627868626597909, 0.6054724871768047, -0.8118448171856856}, {-0.7564145326509102, -0.6902422688120567, 0.4732575941427041}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2.2860337730132825, -1.6213509948589593, -5.784682018960652}, {5.119999240806329, -7.551441647258393, -21.440710634524915}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.33710995325737675, 0.3086912357129851, -0.39351216235665026}, {291.6393860094841, -235.56805995170293, 46.827662118172}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.33710995325737675, 0.3086912357129851, -0.39351216235665026}, {1.0, -2.0, -1.0}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.45107312046279446, 0.35498554340792055, -292.44544467335487}, {1.0, -2.0, -1.0}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0.9627868626597909, 0.6054724871768047, -0.8118448171856856}, {291.6393860094841, -235.56805995170293, 46.827662118172}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
263 | TP3/basic.SumOfDigits | C++ | Verifies that the inputs satisfy the problem:
Find a number that its digits sum to a specific value. | /**
* Verifies that the inputs satisfy the problem:
* Find a number that its digits sum to a specific value.
*/
bool sat(string x, int s) { | bool sat(string x, int s) { | [
"x",
"s"
] | def sat(x: str, s):
return s == sum([int(d) for d in x]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": \"9999999999999999999999999999994\", \"s\": 274}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": \"9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998\", \"s\": 40427}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": \"999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999997\", \"s\": 8071}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": \"99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998\", \"s\": 86120}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": \"9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999991\", \"s\": 26785}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": \"9999999999999999999999999999994\", \"s\": 40427}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": \"9999999999999999999999999999994\", \"s\": 86120}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": \"9999999999999999999999999999994\", \"s\": 26785}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": \"999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999997\", \"s\": 86120}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a number that its digits sum to a specific value.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string x, int s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"9999999999999999999999999999994\", 274, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998\", 40427, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999997\", 8071, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"99999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999998\", 86120, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"9999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999991\", 26785, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"9999999999999999999999999999994\", 40427, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"9999999999999999999999999999994\", 86120, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"9999999999999999999999999999994\", 26785, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999997\", 86120, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
264 | TP3/basic.FloatWithDecimalValue | C++ | Verifies that the inputs satisfy the problem:
Create a float with a specific decimal. | /**
* Verifies that the inputs satisfy the problem:
* Create a float with a specific decimal.
*/
bool sat(float z, int v, float d) { | bool sat(float z, int v, float d) { | [
"z",
"v",
"d"
] | def sat(z: float, v, d):
return int(z * 1 / d % 10) == v | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"z\": 0.1, \"v\": 1, \"d\": 0.1}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"z\": 900.0, \"v\": 9, \"d\": 100.0}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"z\": 0.5, \"v\": 5, \"d\": 0.1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"z\": 5000.0, \"v\": 5, \"d\": 1000.0}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"z\": 900.0, \"v\": 9, \"d\": 0.1}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"z\": 0.5, \"v\": 9, \"d\": 0.1}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"z\": 0.1, \"v\": 5, \"d\": 0.1}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"z\": 900.0, \"v\": 1, \"d\": 0.1}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Create a float with a specific decimal.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(float z, int v, float d, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(z, v, d), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(0.1, 1, 0.1, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(900.0, 9, 100.0, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.5, 5, 0.1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(5000.0, 5, 1000.0, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(900.0, 9, 0.1, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.5, 9, 0.1, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(0.1, 5, 0.1, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(900.0, 1, 0.1, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
265 | TP3/basic.ArithmeticSequence | C++ | Verifies that the inputs satisfy the problem:
Create vector that is a subrange of an arithmetic sequence. | /**
* Verifies that the inputs satisfy the problem:
* Create vector that is a subrange of an arithmetic sequence.
*/
bool sat(vector<int> x, int a, int s, int e) { | bool sat(vector<int> x, int a, int s, int e) { | [
"x",
"a",
"s",
"e"
] | def sat(x: List[int], a, s, e):
return x[0] == a and x[-1] <= e and (x[-1] + s > e) and all([x[i] + s == x[i + 1] for i in range(len(x) - 1)]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197], \"a\": 7, \"s\": 5, \"e\": 200}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [-22010, -22002, -21994, -21986, -21978, -21970, -21962, -21954, -21946, -21938, -21930, -21922, -21914, -21906, -21898, -21890, -21882, -21874, -21866, -21858, -21850, -21842, -21834, -21826, -21818, -21810, -21802, -21794, -21786, -21778, -21770, -21762, -21754, -21746, -21738, -21730, -21722, -21714, -21706, -21698, -21690, -21682, -21674, -21666, -21658, -21650, -21642, -21634, -21626, -21618, -21610, -21602, -21594, -21586, -21578, -21570, -21562, -21554, -21546, -21538, -21530, -21522, -21514, -21506, -21498, -21490, -21482, -21474, -21466, -21458, -21450, -21442, -21434, -21426, -21418, -21410, -21402, -21394, -21386, -21378, -21370, -21362, -21354, -21346, -21338, -21330, -21322, -21314, -21306, -21298, -21290, -21282, -21274, -21266, -21258, -21250, -21242, -21234, -21226, -21218, -21210, -21202, -21194, -21186, -21178, -21170, -21162, -21154, -21146, -21138, -21130, -21122, -21114, -21106, -21098, -21090, -21082, -21074, -21066, -21058, -21050, -21042, -21034, -21026, -21018, -21010, -21002, -20994, -20986, -20978, -20970, -20962, -20954, -20946, -20938, -20930, -20922, -20914, -20906, -20898, -20890, -20882, -20874, -20866, -20858, -20850, -20842, -20834, -20826, -20818, -20810, -20802, -20794, -20786, -20778, -20770, -20762, -20754, -20746, -20738, -20730, -20722, -20714, -20706, -20698, -20690, -20682, -20674, -20666, -20658, -20650, -20642, -20634, -20626, -20618, -20610, -20602, -20594, -20586, -20578, -20570, -20562, -20554, -20546, -20538, -20530, -20522, -20514, -20506, -20498, -20490, -20482, -20474, -20466, -20458, -20450, -20442, -20434, -20426, -20418, -20410, -20402, -20394, -20386, -20378, -20370, -20362, -20354, -20346, -20338, -20330, -20322, -20314, -20306, -20298, -20290, -20282, -20274, -20266, -20258, -20250, -20242, -20234, -20226, -20218, -20210, -20202, -20194, -20186, -20178, -20170, -20162, -20154, -20146, -20138, -20130, -20122, -20114, -20106, -20098, -20090, -20082, -20074, -20066, -20058, -20050, -20042, -20034, -20026, -20018, -20010, -20002, -19994, -19986, -19978, -19970, -19962, -19954, -19946, -19938, -19930, -19922, -19914, -19906, -19898, -19890, -19882, -19874, -19866, -19858, -19850, -19842, -19834, -19826, -19818, -19810, -19802, -19794, -19786, -19778, -19770, -19762, -19754, -19746, -19738, -19730, -19722, -19714, -19706, -19698, -19690, -19682, -19674, -19666, -19658, -19650, -19642, -19634, -19626, -19618, -19610, -19602, -19594, -19586, -19578, -19570, -19562, -19554, -19546, -19538, -19530, -19522, -19514, -19506, -19498, -19490, -19482, -19474, -19466, -19458, -19450, -19442, -19434, -19426, -19418, -19410, -19402, -19394, -19386, -19378, -19370, -19362, -19354, -19346, -19338, -19330, -19322, -19314, -19306, -19298, -19290, -19282, -19274, -19266, -19258, -19250, -19242, -19234, -19226, -19218, -19210, -19202, -19194, -19186, -19178, -19170, -19162, -19154, -19146, -19138, -19130, -19122, -19114, -19106, -19098, -19090, -19082, -19074, -19066, -19058, -19050, -19042, -19034, -19026, -19018, -19010, -19002, -18994, -18986, -18978, -18970, -18962, -18954, -18946, -18938, -18930, -18922, -18914, -18906, -18898], \"a\": -22010, \"s\": 8, \"e\": -18891}}, {\"idx\": 2, \"outputs\": false, \"inputs\": {\"x\": [7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197], \"a\": 7, \"s\": 8, \"e\": -18891}}, {\"idx\": 3, \"outputs\": false, \"inputs\": {\"x\": [7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197], \"a\": -22010, \"s\": 8, \"e\": -18891}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"x\": [7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197], \"a\": -22010, \"s\": 5, \"e\": -18891}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197], \"a\": 7, \"s\": 5, \"e\": -18891}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Create a list that is a subrange of an arithmetic sequence.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int a, int s, int e, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, s, e), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197}, 7, 5, 200, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-22010, -22002, -21994, -21986, -21978, -21970, -21962, -21954, -21946, -21938, -21930, -21922, -21914, -21906, -21898, -21890, -21882, -21874, -21866, -21858, -21850, -21842, -21834, -21826, -21818, -21810, -21802, -21794, -21786, -21778, -21770, -21762, -21754, -21746, -21738, -21730, -21722, -21714, -21706, -21698, -21690, -21682, -21674, -21666, -21658, -21650, -21642, -21634, -21626, -21618, -21610, -21602, -21594, -21586, -21578, -21570, -21562, -21554, -21546, -21538, -21530, -21522, -21514, -21506, -21498, -21490, -21482, -21474, -21466, -21458, -21450, -21442, -21434, -21426, -21418, -21410, -21402, -21394, -21386, -21378, -21370, -21362, -21354, -21346, -21338, -21330, -21322, -21314, -21306, -21298, -21290, -21282, -21274, -21266, -21258, -21250, -21242, -21234, -21226, -21218, -21210, -21202, -21194, -21186, -21178, -21170, -21162, -21154, -21146, -21138, -21130, -21122, -21114, -21106, -21098, -21090, -21082, -21074, -21066, -21058, -21050, -21042, -21034, -21026, -21018, -21010, -21002, -20994, -20986, -20978, -20970, -20962, -20954, -20946, -20938, -20930, -20922, -20914, -20906, -20898, -20890, -20882, -20874, -20866, -20858, -20850, -20842, -20834, -20826, -20818, -20810, -20802, -20794, -20786, -20778, -20770, -20762, -20754, -20746, -20738, -20730, -20722, -20714, -20706, -20698, -20690, -20682, -20674, -20666, -20658, -20650, -20642, -20634, -20626, -20618, -20610, -20602, -20594, -20586, -20578, -20570, -20562, -20554, -20546, -20538, -20530, -20522, -20514, -20506, -20498, -20490, -20482, -20474, -20466, -20458, -20450, -20442, -20434, -20426, -20418, -20410, -20402, -20394, -20386, -20378, -20370, -20362, -20354, -20346, -20338, -20330, -20322, -20314, -20306, -20298, -20290, -20282, -20274, -20266, -20258, -20250, -20242, -20234, -20226, -20218, -20210, -20202, -20194, -20186, -20178, -20170, -20162, -20154, -20146, -20138, -20130, -20122, -20114, -20106, -20098, -20090, -20082, -20074, -20066, -20058, -20050, -20042, -20034, -20026, -20018, -20010, -20002, -19994, -19986, -19978, -19970, -19962, -19954, -19946, -19938, -19930, -19922, -19914, -19906, -19898, -19890, -19882, -19874, -19866, -19858, -19850, -19842, -19834, -19826, -19818, -19810, -19802, -19794, -19786, -19778, -19770, -19762, -19754, -19746, -19738, -19730, -19722, -19714, -19706, -19698, -19690, -19682, -19674, -19666, -19658, -19650, -19642, -19634, -19626, -19618, -19610, -19602, -19594, -19586, -19578, -19570, -19562, -19554, -19546, -19538, -19530, -19522, -19514, -19506, -19498, -19490, -19482, -19474, -19466, -19458, -19450, -19442, -19434, -19426, -19418, -19410, -19402, -19394, -19386, -19378, -19370, -19362, -19354, -19346, -19338, -19330, -19322, -19314, -19306, -19298, -19290, -19282, -19274, -19266, -19258, -19250, -19242, -19234, -19226, -19218, -19210, -19202, -19194, -19186, -19178, -19170, -19162, -19154, -19146, -19138, -19130, -19122, -19114, -19106, -19098, -19090, -19082, -19074, -19066, -19058, -19050, -19042, -19034, -19026, -19018, -19010, -19002, -18994, -18986, -18978, -18970, -18962, -18954, -18946, -18938, -18930, -18922, -18914, -18906, -18898}, -22010, 8, -18891, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197}, 7, 8, -18891, false); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197}, -22010, 8, -18891, false); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197}, -22010, 5, -18891, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 12, 17, 22, 27, 32, 37, 42, 47, 52, 57, 62, 67, 72, 77, 82, 87, 92, 97, 102, 107, 112, 117, 122, 127, 132, 137, 142, 147, 152, 157, 162, 167, 172, 177, 182, 187, 192, 197}, 7, 5, -18891, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
266 | TP3/basic.GeometricSequence | C++ | Verifies that the inputs satisfy the problem:
Create vector that is a subrange of an gemoetric sequence. | /**
* Verifies that the inputs satisfy the problem:
* Create vector that is a subrange of an gemoetric sequence.
*/
bool sat(vector<int> x, int a, int r, int l) { | bool sat(vector<int> x, int a, int r, int l) { | [
"x",
"a",
"r",
"l"
] | def sat(x: List[int], a, r, l):
return x[0] == a and len(x) == l and all([x[i] * r == x[i + 1] for i in range(len(x) - 1)]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096], \"a\": 8, \"r\": 2, \"l\": 10}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [-484, -1936, -7744, -30976, -123904, -495616, -1982464, -7929856, -31719424, -126877696], \"a\": -484, \"r\": 4, \"l\": 10}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": [889, 6223, 43561, 304927, 2134489, 14941423, 104589961], \"a\": 889, \"r\": 7, \"l\": 7}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": [-777, -3108], \"a\": -777, \"r\": 4, \"l\": 2}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": [-736, -2944], \"a\": -736, \"r\": 4, \"l\": 2}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [-736, -2944], \"a\": 8, \"r\": 4, \"l\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": [-777, -3108], \"a\": 8, \"r\": 2, \"l\": 7}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": [-736, -2944], \"a\": 8, \"r\": 2, \"l\": 7}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": [-777, -3108], \"a\": 8, \"r\": 2, \"l\": 2}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Create a list that is a subrange of an gemoetric sequence.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int a, int r, int l, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, r, l), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096}, 8, 2, 10, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-484, -1936, -7744, -30976, -123904, -495616, -1982464, -7929856, -31719424, -126877696}, -484, 4, 10, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({889, 6223, 43561, 304927, 2134489, 14941423, 104589961}, 889, 7, 7, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-777, -3108}, -777, 4, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-736, -2944}, -736, 4, 2, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-736, -2944}, 8, 4, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-777, -3108}, 8, 2, 7, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-736, -2944}, 8, 2, 7, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-777, -3108}, 8, 2, 2, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
267 | TP3/basic.LineIntersection | C++ | Verifies that the inputs satisfy the problem:
Find the intersection of two lines.
Solution should be vector of the (x,y) coordinates.
Accuracy of fifth decimal digit is required. | /**
* Verifies that the inputs satisfy the problem:
* Find the intersection of two lines.
* Solution should be vector of the (x,y) coordinates.
* Accuracy of fifth decimal digit is required.
*/
bool sat(vector<int> e, int a, int b, int c, int d) { | bool sat(vector<int> e, int a, int b, int c, int d) { | [
"e",
"a",
"b",
"c",
"d"
] | def sat(e: List[int], a, b, c, d):
x = e[0] / e[1]
return abs(a * x + b - c * x - d) < 10 ** (-5) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"e\": [2022, 1], \"a\": 2, \"b\": -1, \"c\": 1, \"d\": 2021}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"e\": [121071740, -66898748], \"a\": -77698407, \"b\": -31793716, \"c\": -10799659, \"d\": 89278024}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"e\": [-4469067, -5500683], \"a\": 89600582, \"b\": -47657198, \"c\": 95101265, \"d\": -52126265}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"e\": [19721977, 47740036], \"a\": -11422303, \"b\": -57150416, \"c\": -59162339, \"d\": -37428439}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"e\": [22933768, -7360388], \"a\": -18517001, \"b\": -13662763, \"c\": -11156613, \"d\": 9271005}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"e\": [2022, 1], \"a\": 2, \"b\": -57150416, \"c\": 1, \"d\": 2021}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"e\": [2022, 1], \"a\": 2, \"b\": -13662763, \"c\": 1, \"d\": 2021}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"e\": [2022, 1], \"a\": 2, \"b\": -1, \"c\": 1, \"d\": 89278024}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"e\": [2022, 1], \"a\": 2, \"b\": -1, \"c\": 95101265, \"d\": 2021}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the intersection of two lines.\n// Solution should be a list of the (x,y) coordinates.\n// Accuracy of fifth decimal digit is required.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> e, int a, int b, int c, int d, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(e, a, b, c, d), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({2022, 1}, 2, -1, 1, 2021, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({121071740, -66898748}, -77698407, -31793716, -10799659, 89278024, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({-4469067, -5500683}, 89600582, -47657198, 95101265, -52126265, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({19721977, 47740036}, -11422303, -57150416, -59162339, -37428439, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({22933768, -7360388}, -18517001, -13662763, -11156613, 9271005, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2022, 1}, 2, -57150416, 1, 2021, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2022, 1}, 2, -13662763, 1, 2021, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2022, 1}, 2, -1, 1, 89278024, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2022, 1}, 2, -1, 95101265, 2021, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
268 | TP3/basic.IfProblem | C++ | Verifies that the inputs satisfy the problem:
Satisfy a simple if statement | /**
* Verifies that the inputs satisfy the problem:
* Satisfy a simple if statement
*/
bool sat(int x, int a, int b) { | bool sat(int x, int a, int b) { | [
"x",
"a",
"b"
] | def sat(x: int, a, b):
if a < 50:
return x + a == b
else:
return x - 2 * a == b | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": 1994453, \"a\": 324554, \"b\": 1345345}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": 40553895, \"a\": 51, \"b\": 40553793}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 72369483, \"a\": 50, \"b\": 72369383}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": 42412714, \"a\": 90, \"b\": 42412534}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": -26537933, \"a\": 62, \"b\": -26538057}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 1994453, \"a\": 51, \"b\": 1345345}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 1994453, \"a\": 51, \"b\": 40553793}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 1994453, \"a\": 90, \"b\": 1345345}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": 1994453, \"a\": 62, \"b\": 1345345}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Satisfy a simple if statement\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int x, int a, int b, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, b), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(1994453, 324554, 1345345, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(40553895, 51, 40553793, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(72369483, 50, 72369383, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(42412714, 90, 42412534, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-26537933, 62, -26538057, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1994453, 51, 1345345, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1994453, 51, 40553793, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1994453, 90, 1345345, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1994453, 62, 1345345, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
269 | TP3/basic.IfProblemWithAnd | C++ | Verifies that the inputs satisfy the problem:
Satisfy a simple if statement with an and clause | /**
* Verifies that the inputs satisfy the problem:
* Satisfy a simple if statement with an and clause
*/
bool sat(int x, int a, int b) { | bool sat(int x, int a, int b) { | [
"x",
"a",
"b"
] | def sat(x: int, a, b):
if x > 0 and a > 50:
return x - a == b
else:
return x + a == b | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": -8040931, \"a\": 9384594, \"b\": 1343663}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": 40523023, \"a\": 57, \"b\": 40522966}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 71682972, \"a\": 29, \"b\": 71683001}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": 8820494, \"a\": 92, \"b\": 8820402}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": 46712787, \"a\": 64, \"b\": 46712723}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 8820494, \"a\": 64, \"b\": 1343663}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 46712787, \"a\": 64, \"b\": 1343663}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 8820494, \"a\": 57, \"b\": 1343663}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": 8820494, \"a\": 29, \"b\": 8820402}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Satisfy a simple if statement with an and clause\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int x, int a, int b, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, b), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(-8040931, 9384594, 1343663, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(40523023, 57, 40522966, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(71682972, 29, 71683001, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(8820494, 92, 8820402, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(46712787, 64, 46712723, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(8820494, 64, 1343663, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(46712787, 64, 1343663, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(8820494, 57, 1343663, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(8820494, 29, 8820402, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
270 | TP3/basic.IfProblemWithOr | C++ | Verifies that the inputs satisfy the problem:
Satisfy a simple if statement with an or clause | /**
* Verifies that the inputs satisfy the problem:
* Satisfy a simple if statement with an or clause
*/
bool sat(int x, int a, int b) { | bool sat(int x, int a, int b) { | [
"x",
"a",
"b"
] | def sat(x: int, a, b):
if x > 0 or a > 50:
return x - a == b
else:
return x + a == b | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": 1483732, \"a\": 253532, \"b\": 1230200}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": -84904688, \"a\": 22, \"b\": -84904666}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 74723532, \"a\": 10, \"b\": 74723522}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": -39109341, \"a\": 66, \"b\": -39109407}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": 18773123, \"a\": 24, \"b\": 18773099}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 1483732, \"a\": 10, \"b\": 1230200}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 18773123, \"a\": 66, \"b\": 1230200}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 18773123, \"a\": 24, \"b\": 1230200}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": 1483732, \"a\": 66, \"b\": 1230200}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Satisfy a simple if statement with an or clause\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int x, int a, int b, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, b), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(1483732, 253532, 1230200, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-84904688, 22, -84904666, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(74723532, 10, 74723522, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-39109341, 66, -39109407, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(18773123, 24, 18773099, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1483732, 10, 1230200, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(18773123, 66, 1230200, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(18773123, 24, 1230200, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(1483732, 66, 1230200, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
271 | TP3/basic.IfCases | C++ | Verifies that the inputs satisfy the problem:
Satisfy a simple if statement with multiple cases | /**
* Verifies that the inputs satisfy the problem:
* Satisfy a simple if statement with multiple cases
*/
bool sat(int x, int a, int b) { | bool sat(int x, int a, int b) { | [
"x",
"a",
"b"
] | def sat(x: int, a, b):
if a == 1:
return x % 2 == 0
elif a == -1:
return x % 2 == 1
else:
return x + a == b | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": 54368635, \"a\": 4, \"b\": 54368639}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": -83354926, \"a\": -4, \"b\": -83354930}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": 71965667, \"a\": -3, \"b\": 71965664}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": 36068128, \"a\": 2, \"b\": 36068130}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": 14385906, \"a\": -3, \"b\": 14385903}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": 36068128, \"a\": 2, \"b\": 71965664}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": 36068128, \"a\": 2, \"b\": 14385903}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": 36068128, \"a\": 4, \"b\": 54368639}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": 71965667, \"a\": 2, \"b\": 14385903}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Satisfy a simple if statement with multiple cases\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(int x, int a, int b, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, a, b), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(54368635, 4, 54368639, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(-83354926, -4, -83354930, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(71965667, -3, 71965664, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(36068128, 2, 36068130, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(14385906, -3, 14385903, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(36068128, 2, 71965664, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(36068128, 2, 14385903, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(36068128, 4, 54368639, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(71965667, 2, 14385903, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
272 | TP3/basic.ListPosSum | C++ | Verifies that the inputs satisfy the problem:
Find vector of n non-negative integers that sum up to s | /**
* Verifies that the inputs satisfy the problem:
* Find vector of n non-negative integers that sum up to s
*/
bool sat(vector<int> x, int n, int s) { | bool sat(vector<int> x, int n, int s) { | [
"x",
"n",
"s"
] | def sat(x: List[int], n, s):
return len(x) == n and sum(x) == s and all([a > 0 for a in x]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [15, 1, 1, 1, 1], \"n\": 5, \"s\": 19}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [88975268, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], \"n\": 83, \"s\": 88975350}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": [54588729, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], \"n\": 49, \"s\": 54588777}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": [33073458, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1], \"n\": 66, \"s\": 33073523}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": [67591957, 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], \"n\": 27, \"s\": 67591983}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [15, 1, 1, 1, 1], \"n\": 5, \"s\": 88975350}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": [15, 1, 1, 1, 1], \"n\": 5, \"s\": 67591983}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": [15, 1, 1, 1, 1], \"n\": 27, \"s\": 19}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": [15, 1, 1, 1, 1], \"n\": 5, \"s\": 33073523}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a list of n non-negative integers that sum up to s\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int n, int s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, n, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({15, 1, 1, 1, 1}, 5, 19, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({88975268, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 83, 88975350, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({54588729, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 49, 54588777, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({33073458, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1}, 66, 33073523, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({67591957, 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}, 27, 67591983, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({15, 1, 1, 1, 1}, 5, 88975350, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({15, 1, 1, 1, 1}, 5, 67591983, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({15, 1, 1, 1, 1}, 27, 19, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({15, 1, 1, 1, 1}, 5, 33073523, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
273 | TP3/basic.ListDistinctSum | C++ | Verifies that the inputs satisfy the problem:
Construct vector of n distinct integers that sum up to s | /**
* Verifies that the inputs satisfy the problem:
* Construct vector of n distinct integers that sum up to s
*/
bool sat(vector<int> x, int n, int s) { | bool sat(vector<int> x, int n, int s) { | [
"x",
"n",
"s"
] | def sat(x: List[int], n, s):
return len(x) == n and sum(x) == s and (len(set(x)) == n) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [1, -1, 2, 2019], \"n\": 4, \"s\": 2021}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, 2603027], \"n\": 124, \"s\": 2603089}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": [1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 113, -113, 114, -114, 115, -115, 116, -116, 117, -117, 118, -118, 119, -119, 120, -120, 121, -121, 122, -122, 123, -123, 124, -124, 125, -125, 126, -126, 127, -127, 128, -128, 129, -129, 130, -130, 131, -131, 132, -132, 133, -133, 134, -134, 135, -135, 136, -136, 137, -137, 138, -138, 139, -139, 140, -140, 141, -141, 142, -142, 143, -143, 144, -144, 145, -145, 146, -146, 147, -147, 148, -148, 149, -149, 150, -150, 151, -151, 152, -152, 153, -153, 154, -154, 155, -155, 156, -156, 157, -157, 158, -158, 159, -159, 160, -160, 161, -161, 162, -162, 163, -163, 164, -164, 165, -165, 166, -166, 167, -167, 168, -168, 169, -169, 170, -170, 171, -171, 172, -172, 173, -173, 174, -174, 175, -175, 176, -176, 177, -177, 178, -178, 179, -179, 180, -180, 181, -181, 182, -182, 183, -183, 184, -184, 185, -185, 186, -186, 187, -187, 188, -188, 189, -189, 190, -190, 191, -191, 192, -192, 193, -193, 194, -194, 195, -195, 196, -196, 197, -197, 198, -198, 199, -199, 200, -200, 201, -201, 202, -202, 203, -203, 204, -204, 205, -205, 206, -206, 207, -207, 208, -208, 209, -209, 210, -210, 211, -211, 212, -212, 213, -213, 214, -214, 215, -215, 216, -216, 217, -217, 218, -218, 219, -219, 220, -220, 221, -221, 222, -222, 223, -223, 224, -224, 225, -225, 226, -226, 227, -227, 228, -228, 229, -229, 230, -230, 231, -231, 232, -232, 233, -233, 234, -234, 235, -235, 236, -236, 237, -237, 238, -238, 239, -239, 240, -240, 241, -241, 242, -242, 243, -243, 244, -244, 245, -245, 246, -246, 247, -247, 248, -248, 249, -249, 250, -250, 251, -251, 252, -252, 253, -253, 254, -254, 255, -255, 256, -256, 257, -257, 258, -258, 259, -259, 260, -260, 261, -261, 262, -262, 263, -263, 264, -264, 265, -265, 266, -266, 267, -267, 268, -268, 269, -269, 270, -270, 271, -271, 272, -272, 273, -273, 274, -274, 275, -275, 276, -276, 277, -277, 278, -278, 279, -279, 280, -280, 281, -281, 282, -282, 283, -283, 284, -284, 285, -285, 286, -286, 287, -287, 288, -288, 289, -289, 290, -290, 291, -291, 292, -292, 293, -293, 294, -294, 295, -295, 296, -296, 297, -297, 298, -298, 299, -299, 300, -300, 301, -301, 302, -302, 303, -303, 304, -304, 305, -305, 306, -306, 307, -307, 308, -308, 309, -309, 310, -310, 311, -311, 312, -312, 313, -313, 314, -314, 315, -315, 316, -316, 317, -317, 318, -318, 319, -319, 320, -320, 321, -321, 322, -322, 323, -323, 324, -324, 325, -325, 326, -326, 327, -327, 328, -328, 329, -329, 330, -330, 331, -331, 332, -332, 333, -333, 334, -334, 335, -335, 336, -336, 337, -337, 338, -338, 339, -339, 340, -340, 341, -341, 342, -342, 343, -343, 344, -344, 345, -345, 346, -346, 347, -347, 348, -348, 349, -349, 350, -350, 351, -351, 352, -352, 353, -353, 354, -354, 355, -355, 356, -356, 357, -357, 358, -358, 359, -359, 360, -360, 361, -361, 362, -362, 363, -363, 364, -364, 365, -365, 366, -366, 367, -367, 368, -368, 369, -369, 370, -370, 371, -371, 372, -372, 373, -373, 374, -374, 375, -375, 376, -376, 377, -377, 378, -378, 379, -379, 380, -380, 381, -381, 382, -382, 383, -383, 384, -384, 385, -385, 386, -386, 387, -387, 388, -388, 389, -389, 390, -390, 391, -391, 392, -392, 393, -393, 394, -394, 395, -395, 396, -396, 397, -397, 398, -398, 399, -399, 400, -400, 401, -401, 402, -402, 403, -403, 404, -404, 405, -405, 406, -406, 407, -407, 408, -408, 409, -409, 410, -410, 411, -411, 8609609], \"n\": 823, \"s\": 8609609}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": [1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 113, -113, 114, -114, 115, -115, 116, -116, 117, -117, 118, -118, 119, -119, 120, -120, 121, -121, 122, -122, 123, -123, 124, -124, 125, -125, 126, -126, 127, -127, 128, -128, 129, -129, 130, -130, 131, -131, 132, -132, 133, -133, 134, -134, 135, -135, 136, -136, 137, -137, 138, -138, 139, -139, 140, -140, 141, -141, 142, -142, 143, -143, 144, -144, 145, -145, 146, -146, 147, -147, 148, -148, 149, -149, 150, -150, 151, -151, 152, -152, 153, -153, 154, -154, 155, -155, 156, -156, 157, -157, 158, -158, 159, -159, 160, -160, 161, -161, 162, -162, 163, -163, 164, -164, 165, -165, 166, -166, 167, -167, 168, -168, 169, -169, 170, -170, 171, -171, 172, -172, 173, -173, 174, -174, 175, -175, 176, -176, 177, -177, 178, -178, 179, -179, 180, -180, 181, -181, 182, -182, 183, -183, 184, -184, 185, -185, 186, -186, 187, -187, 188, -188, 189, -189, 190, -190, 191, -191, 192, -192, 193, -193, 194, -194, 195, -195, 196, -196, 197, -197, 198, -198, 199, -199, 200, -200, 201, -201, 202, -202, 203, -203, 204, -204, 205, -205, 206, -206, 207, -207, 208, -208, 209, -209, 210, -210, 211, -211, 212, -212, 213, -213, 214, -214, 215, -215, 216, -216, 217, -217, 218, -218, 219, -219, 220, -220, 221, -221, 222, -222, 223, -223, 224, -224, 225, -225, 226, -226, 227, -227, 228, -228, 229, -229, 230, -230, 231, -231, 232, -232, 233, -233, 234, -234, 235, -235, 236, -236, 237, -237, 238, -238, 239, -239, 240, -240, 241, -241, 242, -242, 243, -243, 244, -244, 245, -245, 246, -246, 247, -247, 248, -248, 249, -249, 250, -250, 251, -251, 252, -252, 253, -253, 254, -254, 255, -255, 256, -256, 257, -257, 258, -258, 259, -259, 260, -260, 261, -261, 262, -262, 263, -263, 264, -264, 265, -265, 266, -266, 267, -267, 268, -268, 269, -269, 270, -270, 271, -271, 272, -272, 273, -273, 274, -274, 275, -275, 276, -276, 277, -277, 278, -278, 279, -279, 280, -280, 281, -281, 282, -282, 283, -283, 284, -284, 285, -285, 286, -286, 287, -287, 288, -288, 289, -289, 290, -290, 291, -291, 292, -292, 293, -293, 294, -294, 295, -295, 296, -296, 297, -297, 298, -298, 299, -299, 300, -300, 301, -301, 302, -302, 303, -303, 304, -304, 305, -305, 306, -306, 307, -307, 308, -308, 309, -309, 310, -310, 311, -311, 312, -312, 313, -313, 314, -314, 315, -315, 316, -316, 317, -317, 318, -318, 319, -319, 320, -320, 321, -321, 322, -322, 323, -323, 324, -324, 325, -325, 326, -326, 327, -327, 328, -328, 329, -329, 330, -330, 331, -331, 332, -332, 333, -333, 334, -334, 335, -335, 336, -336, 337, -337, 338, -338, 339, -339, 340, -340, 341, -341, 342, -342, 343, -343, 344, -344, 345, -345, 346, -346, 347, -347, 348, -348, 349, -349, 350, -350, 351, -351, 352, -352, 353, -353, 354, -354, 355, -355, 356, -356, 357, -357, 358, -358, 359, -359, 360, -360, 361, -361, 362, -362, 363, -363, 364, -364, 365, -365, 366, -366, 367, -367, 368, -368, 369, -369, 370, -370, 371, -371, 372, -372, 373, -373, 374, -374, 375, -375, 376, -376, 377, -377, 378, -378, 379, -379, 380, -380, 381, -381, 382, -382, 383, -383, 384, -384, 385, -385, 386, -386, 387, -387, 388, -388, 389, -389, 390, -390, 391, -391, 392, -392, 393, -393, 394, -394, 395, -395, 396, -396, 397, -397, 398, 86694353], \"n\": 796, \"s\": 86694751}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": [1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 38417364], \"n\": 225, \"s\": 38417364}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [1, -1, 2, 2019], \"n\": 225, \"s\": 2021}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": [1, -1, 2, 2019], \"n\": 4, \"s\": 2603089}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": [1, -1, 2, 2019], \"n\": 4, \"s\": 38417364}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": [], \"n\": 4, \"s\": 2021}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Construct a list of n distinct integers that sum up to s\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int n, int s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, n, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({1, -1, 2, 2019}, 4, 2021, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, 2603027}, 124, 2603089, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 113, -113, 114, -114, 115, -115, 116, -116, 117, -117, 118, -118, 119, -119, 120, -120, 121, -121, 122, -122, 123, -123, 124, -124, 125, -125, 126, -126, 127, -127, 128, -128, 129, -129, 130, -130, 131, -131, 132, -132, 133, -133, 134, -134, 135, -135, 136, -136, 137, -137, 138, -138, 139, -139, 140, -140, 141, -141, 142, -142, 143, -143, 144, -144, 145, -145, 146, -146, 147, -147, 148, -148, 149, -149, 150, -150, 151, -151, 152, -152, 153, -153, 154, -154, 155, -155, 156, -156, 157, -157, 158, -158, 159, -159, 160, -160, 161, -161, 162, -162, 163, -163, 164, -164, 165, -165, 166, -166, 167, -167, 168, -168, 169, -169, 170, -170, 171, -171, 172, -172, 173, -173, 174, -174, 175, -175, 176, -176, 177, -177, 178, -178, 179, -179, 180, -180, 181, -181, 182, -182, 183, -183, 184, -184, 185, -185, 186, -186, 187, -187, 188, -188, 189, -189, 190, -190, 191, -191, 192, -192, 193, -193, 194, -194, 195, -195, 196, -196, 197, -197, 198, -198, 199, -199, 200, -200, 201, -201, 202, -202, 203, -203, 204, -204, 205, -205, 206, -206, 207, -207, 208, -208, 209, -209, 210, -210, 211, -211, 212, -212, 213, -213, 214, -214, 215, -215, 216, -216, 217, -217, 218, -218, 219, -219, 220, -220, 221, -221, 222, -222, 223, -223, 224, -224, 225, -225, 226, -226, 227, -227, 228, -228, 229, -229, 230, -230, 231, -231, 232, -232, 233, -233, 234, -234, 235, -235, 236, -236, 237, -237, 238, -238, 239, -239, 240, -240, 241, -241, 242, -242, 243, -243, 244, -244, 245, -245, 246, -246, 247, -247, 248, -248, 249, -249, 250, -250, 251, -251, 252, -252, 253, -253, 254, -254, 255, -255, 256, -256, 257, -257, 258, -258, 259, -259, 260, -260, 261, -261, 262, -262, 263, -263, 264, -264, 265, -265, 266, -266, 267, -267, 268, -268, 269, -269, 270, -270, 271, -271, 272, -272, 273, -273, 274, -274, 275, -275, 276, -276, 277, -277, 278, -278, 279, -279, 280, -280, 281, -281, 282, -282, 283, -283, 284, -284, 285, -285, 286, -286, 287, -287, 288, -288, 289, -289, 290, -290, 291, -291, 292, -292, 293, -293, 294, -294, 295, -295, 296, -296, 297, -297, 298, -298, 299, -299, 300, -300, 301, -301, 302, -302, 303, -303, 304, -304, 305, -305, 306, -306, 307, -307, 308, -308, 309, -309, 310, -310, 311, -311, 312, -312, 313, -313, 314, -314, 315, -315, 316, -316, 317, -317, 318, -318, 319, -319, 320, -320, 321, -321, 322, -322, 323, -323, 324, -324, 325, -325, 326, -326, 327, -327, 328, -328, 329, -329, 330, -330, 331, -331, 332, -332, 333, -333, 334, -334, 335, -335, 336, -336, 337, -337, 338, -338, 339, -339, 340, -340, 341, -341, 342, -342, 343, -343, 344, -344, 345, -345, 346, -346, 347, -347, 348, -348, 349, -349, 350, -350, 351, -351, 352, -352, 353, -353, 354, -354, 355, -355, 356, -356, 357, -357, 358, -358, 359, -359, 360, -360, 361, -361, 362, -362, 363, -363, 364, -364, 365, -365, 366, -366, 367, -367, 368, -368, 369, -369, 370, -370, 371, -371, 372, -372, 373, -373, 374, -374, 375, -375, 376, -376, 377, -377, 378, -378, 379, -379, 380, -380, 381, -381, 382, -382, 383, -383, 384, -384, 385, -385, 386, -386, 387, -387, 388, -388, 389, -389, 390, -390, 391, -391, 392, -392, 393, -393, 394, -394, 395, -395, 396, -396, 397, -397, 398, -398, 399, -399, 400, -400, 401, -401, 402, -402, 403, -403, 404, -404, 405, -405, 406, -406, 407, -407, 408, -408, 409, -409, 410, -410, 411, -411, 8609609}, 823, 8609609, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 113, -113, 114, -114, 115, -115, 116, -116, 117, -117, 118, -118, 119, -119, 120, -120, 121, -121, 122, -122, 123, -123, 124, -124, 125, -125, 126, -126, 127, -127, 128, -128, 129, -129, 130, -130, 131, -131, 132, -132, 133, -133, 134, -134, 135, -135, 136, -136, 137, -137, 138, -138, 139, -139, 140, -140, 141, -141, 142, -142, 143, -143, 144, -144, 145, -145, 146, -146, 147, -147, 148, -148, 149, -149, 150, -150, 151, -151, 152, -152, 153, -153, 154, -154, 155, -155, 156, -156, 157, -157, 158, -158, 159, -159, 160, -160, 161, -161, 162, -162, 163, -163, 164, -164, 165, -165, 166, -166, 167, -167, 168, -168, 169, -169, 170, -170, 171, -171, 172, -172, 173, -173, 174, -174, 175, -175, 176, -176, 177, -177, 178, -178, 179, -179, 180, -180, 181, -181, 182, -182, 183, -183, 184, -184, 185, -185, 186, -186, 187, -187, 188, -188, 189, -189, 190, -190, 191, -191, 192, -192, 193, -193, 194, -194, 195, -195, 196, -196, 197, -197, 198, -198, 199, -199, 200, -200, 201, -201, 202, -202, 203, -203, 204, -204, 205, -205, 206, -206, 207, -207, 208, -208, 209, -209, 210, -210, 211, -211, 212, -212, 213, -213, 214, -214, 215, -215, 216, -216, 217, -217, 218, -218, 219, -219, 220, -220, 221, -221, 222, -222, 223, -223, 224, -224, 225, -225, 226, -226, 227, -227, 228, -228, 229, -229, 230, -230, 231, -231, 232, -232, 233, -233, 234, -234, 235, -235, 236, -236, 237, -237, 238, -238, 239, -239, 240, -240, 241, -241, 242, -242, 243, -243, 244, -244, 245, -245, 246, -246, 247, -247, 248, -248, 249, -249, 250, -250, 251, -251, 252, -252, 253, -253, 254, -254, 255, -255, 256, -256, 257, -257, 258, -258, 259, -259, 260, -260, 261, -261, 262, -262, 263, -263, 264, -264, 265, -265, 266, -266, 267, -267, 268, -268, 269, -269, 270, -270, 271, -271, 272, -272, 273, -273, 274, -274, 275, -275, 276, -276, 277, -277, 278, -278, 279, -279, 280, -280, 281, -281, 282, -282, 283, -283, 284, -284, 285, -285, 286, -286, 287, -287, 288, -288, 289, -289, 290, -290, 291, -291, 292, -292, 293, -293, 294, -294, 295, -295, 296, -296, 297, -297, 298, -298, 299, -299, 300, -300, 301, -301, 302, -302, 303, -303, 304, -304, 305, -305, 306, -306, 307, -307, 308, -308, 309, -309, 310, -310, 311, -311, 312, -312, 313, -313, 314, -314, 315, -315, 316, -316, 317, -317, 318, -318, 319, -319, 320, -320, 321, -321, 322, -322, 323, -323, 324, -324, 325, -325, 326, -326, 327, -327, 328, -328, 329, -329, 330, -330, 331, -331, 332, -332, 333, -333, 334, -334, 335, -335, 336, -336, 337, -337, 338, -338, 339, -339, 340, -340, 341, -341, 342, -342, 343, -343, 344, -344, 345, -345, 346, -346, 347, -347, 348, -348, 349, -349, 350, -350, 351, -351, 352, -352, 353, -353, 354, -354, 355, -355, 356, -356, 357, -357, 358, -358, 359, -359, 360, -360, 361, -361, 362, -362, 363, -363, 364, -364, 365, -365, 366, -366, 367, -367, 368, -368, 369, -369, 370, -370, 371, -371, 372, -372, 373, -373, 374, -374, 375, -375, 376, -376, 377, -377, 378, -378, 379, -379, 380, -380, 381, -381, 382, -382, 383, -383, 384, -384, 385, -385, 386, -386, 387, -387, 388, -388, 389, -389, 390, -390, 391, -391, 392, -392, 393, -393, 394, -394, 395, -395, 396, -396, 397, -397, 398, 86694353}, 796, 86694751, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, -2, 3, -3, 4, -4, 5, -5, 6, -6, 7, -7, 8, -8, 9, -9, 10, -10, 11, -11, 12, -12, 13, -13, 14, -14, 15, -15, 16, -16, 17, -17, 18, -18, 19, -19, 20, -20, 21, -21, 22, -22, 23, -23, 24, -24, 25, -25, 26, -26, 27, -27, 28, -28, 29, -29, 30, -30, 31, -31, 32, -32, 33, -33, 34, -34, 35, -35, 36, -36, 37, -37, 38, -38, 39, -39, 40, -40, 41, -41, 42, -42, 43, -43, 44, -44, 45, -45, 46, -46, 47, -47, 48, -48, 49, -49, 50, -50, 51, -51, 52, -52, 53, -53, 54, -54, 55, -55, 56, -56, 57, -57, 58, -58, 59, -59, 60, -60, 61, -61, 62, -62, 63, -63, 64, -64, 65, -65, 66, -66, 67, -67, 68, -68, 69, -69, 70, -70, 71, -71, 72, -72, 73, -73, 74, -74, 75, -75, 76, -76, 77, -77, 78, -78, 79, -79, 80, -80, 81, -81, 82, -82, 83, -83, 84, -84, 85, -85, 86, -86, 87, -87, 88, -88, 89, -89, 90, -90, 91, -91, 92, -92, 93, -93, 94, -94, 95, -95, 96, -96, 97, -97, 98, -98, 99, -99, 100, -100, 101, -101, 102, -102, 103, -103, 104, -104, 105, -105, 106, -106, 107, -107, 108, -108, 109, -109, 110, -110, 111, -111, 112, -112, 38417364}, 225, 38417364, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, 2019}, 225, 2021, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, 2019}, 4, 2603089, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, -1, 2, 2019}, 4, 38417364, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 4, 2021, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
274 | TP3/basic.ConcatStrings | C++ | Verifies that the inputs satisfy the problem:
Concatenate the vector of characters in s | /**
* Verifies that the inputs satisfy the problem:
* Concatenate the vector of characters in s
*/
bool sat(string x, vector<char> s, int n) { | bool sat(string x, vector<char> s, int n) { | [
"x",
"s",
"n"
] | def sat(x: str, s, n):
return len(x) == n and all([x[i] == s[i] for i in range(n)]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": \"abcd\", \"s\": [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\"], \"n\": 4}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": \"I&W&pc-U( A(SWR#\", \"s\": [\"I\", \"&\", \"W\", \"&\", \"p\", \"c\", \"-\", \"U\", \"(\", \" \", \"A\", \"(\", \"S\", \"W\", \"R\", \"#\", \"m\", \"v\", \"@\", \"8\", \"%\", \"a\", \".\", \"K\", \"O\", \"[\", \"[\", \"#\", \"q\", \"k\", \"K\"], \"n\": 16}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": \"LCbrtVR%R8V#<\", \"s\": [\"L\", \"C\", \"b\", \"r\", \"t\", \"V\", \"R\", \"%\", \"R\", \"8\", \"V\", \"#\", \"<\", \"!\", \"U\", \"y\", \"x\"], \"n\": 13}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": \"-&)&cl/H\", \"s\": [\"-\", \"&\", \")\", \"&\", \"c\", \"l\", \"/\", \"H\", \"1\", \"j\", \"z\", \"o\", \"E\", \"|\", \"8\", \"&\", \"0\", \"&\", \"y\", \"!\", \"r\", \"H\", \"S\", \"P\", \"5\"], \"n\": 8}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": \"0@Rk$$t03#!awkqH\", \"s\": [\"0\", \"@\", \"R\", \"k\", \"$\", \"$\", \"t\", \"0\", \"3\", \"#\", \"!\", \"a\", \"w\", \"k\", \"q\", \"H\", \"-\", \"m\"], \"n\": 16}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": \"abcd\", \"s\": [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\"], \"n\": 13}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": \"LCbrtVR%R8V#<\", \"s\": [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\"], \"n\": 4}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": \"abcd\", \"s\": [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\"], \"n\": 8}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": \"-&)&cl/H\", \"s\": [\"a\", \"b\", \"c\", \"d\", \"e\", \"f\"], \"n\": 4}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Concatenate the list of characters in s\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string x, vector<char> s, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, s, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"abcd\", {'a', 'b', 'c', 'd', 'e', 'f'}, 4, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"I&W&pc-U( A(SWR#\", {'I', '&', 'W', '&', 'p', 'c', '-', 'U', '(', ' ', 'A', '(', 'S', 'W', 'R', '#', 'm', 'v', '@', '8', '%', 'a', '.', 'K', 'O', '[', '[', '#', 'q', 'k', 'K'}, 16, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"LCbrtVR%R8V#<\", {'L', 'C', 'b', 'r', 't', 'V', 'R', '%', 'R', '8', 'V', '#', '<', '!', 'U', 'y', 'x'}, 13, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"-&)&cl/H\", {'-', '&', ')', '&', 'c', 'l', '/', 'H', '1', 'j', 'z', 'o', 'E', '|', '8', '&', '0', '&', 'y', '!', 'r', 'H', 'S', 'P', '5'}, 8, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"0@Rk$$t03#!awkqH\", {'0', '@', 'R', 'k', '$', '$', 't', '0', '3', '#', '!', 'a', 'w', 'k', 'q', 'H', '-', 'm'}, 16, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"abcd\", {'a', 'b', 'c', 'd', 'e', 'f'}, 13, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"LCbrtVR%R8V#<\", {'a', 'b', 'c', 'd', 'e', 'f'}, 4, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"abcd\", {'a', 'b', 'c', 'd', 'e', 'f'}, 8, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"-&)&cl/H\", {'a', 'b', 'c', 'd', 'e', 'f'}, 4, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
275 | TP3/basic.SublistSum | C++ | Verifies that the inputs satisfy the problem:
Sum values of sublist by range specifications | /**
* Verifies that the inputs satisfy the problem:
* Sum values of sublist by range specifications
*/
bool sat(vector<int> x, int t, int a, int e, int s) { | bool sat(vector<int> x, int t, int a, int e, int s) { | [
"x",
"t",
"a",
"e",
"s"
] | def sat(x: List[int], t, a, e, s):
non_zero = [z for z in x if z != 0]
return t == sum([x[i] for i in range(a, e, s)]) and len(set(non_zero)) == len(non_zero) and all([x[i] != 0 for i in range(a, e, s)]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [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, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0], \"t\": 100, \"a\": 25, \"e\": 125, \"s\": 25}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 170, 0, 0, 0, 0, 0, 0], \"t\": 170, \"a\": 93, \"e\": 100, \"s\": 9}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": [0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 144, 0, 0, 0, 0, 0, 0, 0, 0], \"t\": 180, \"a\": 3, \"e\": 39, \"s\": 9}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": [0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0], \"t\": 3, \"a\": 2, \"e\": 17, \"s\": 5}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": [0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 10, 0, 0, 0, 14, 0, 0, 0, 18, 0, 0, 0, 22, 0, 0, 0, 26, 0, 0, 0, 30, 0, 0, 0, 34, 0, 0, 0, 38, 0, 0, 0, 42, 0, 0, 0, 46, 0, 0, 0, -196, 0, 0], \"t\": 90, \"a\": 6, \"e\": 53, \"s\": 4}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0], \"t\": 3, \"a\": 2, \"e\": 17, \"s\": 4}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": [0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0], \"t\": 3, \"a\": 3, \"e\": 17, \"s\": 9}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": [0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0], \"t\": 3, \"a\": 6, \"e\": 17, \"s\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": [0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0], \"t\": 3, \"a\": 6, \"e\": 17, \"s\": 9}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Sum values of sublist by range specifications\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int t, int a, int e, int s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, t, a, e, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({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, 25, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 75, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -50, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 100, 25, 125, 25, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 170, 0, 0, 0, 0, 0, 0}, 170, 93, 100, 9, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 3, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 0, 0, 0, 0, 21, 0, 0, 0, 0, 0, 0, 0, 0, 144, 0, 0, 0, 0, 0, 0, 0, 0}, 180, 3, 39, 9, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0}, 3, 2, 17, 5, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 0, 0, 0, 0, 6, 0, 0, 0, 10, 0, 0, 0, 14, 0, 0, 0, 18, 0, 0, 0, 22, 0, 0, 0, 26, 0, 0, 0, 30, 0, 0, 0, 34, 0, 0, 0, 38, 0, 0, 0, 42, 0, 0, 0, 46, 0, 0, 0, -196, 0, 0}, 90, 6, 53, 4, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0}, 3, 2, 17, 4, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0}, 3, 3, 17, 9, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0}, 3, 6, 17, 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 0, 2, 0, 0, 0, 0, 7, 0, 0, 0, 0, -6, 0, 0, 0, 0}, 3, 6, 17, 9, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
276 | TP3/basic.CumulativeSum | C++ | Verifies that the inputs satisfy the problem:
Find how many values have cumulative sum less than target | /**
* Verifies that the inputs satisfy the problem:
* Find how many values have cumulative sum less than target
*/
bool sat(vector<int> x, int t, int n) { | bool sat(vector<int> x, int t, int n) { | [
"x",
"t",
"n"
] | def sat(x: List[int], t, n):
if not all([v > 0 for v in x]):
return False
s = 0
i = 0
for v in sorted(x):
s += v
if s > t:
return i == n
i += 1
return i == n | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"x\": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 50], \"t\": 50, \"n\": 10}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"x\": [1, 1, 38], \"t\": 38, \"n\": 2}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"x\": [1, 1, 23], \"t\": 23, \"n\": 2}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"x\": [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 56], \"t\": 56, \"n\": 10}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"x\": [1, 1, 1, 1, 1, 1, 1, 1, 15], \"t\": 15, \"n\": 8}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"x\": [1, 1, 23], \"t\": 50, \"n\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"x\": [1, 1, 23], \"t\": 23, \"n\": 8}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"x\": [1, 1, 23], \"t\": 56, \"n\": 8}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"x\": [1, 1, 23], \"t\": 15, \"n\": 8}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find how many values have cumulative sum less than target\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> x, int t, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(x, t, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 50}, 50, 10, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 38}, 38, 2, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 23}, 23, 2, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 56}, 56, 10, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 1, 1, 1, 1, 1, 1, 15}, 15, 8, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 23}, 50, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 23}, 23, 8, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 23}, 56, 8, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 1, 23}, 15, 8, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
277 | TP3/basic.BasicStrCounts | C++ | Verifies that the inputs satisfy the problem:
Find a string that has count1 occurrences of s1 and count2 occurrences of s2 and starts and ends with
the same 10 characters | /**
* Verifies that the inputs satisfy the problem:
* Find a string that has count1 occurrences of s1 and count2 occurrences of s2 and starts and ends with
* the same 10 characters
*/
bool sat(string s, string s1, string s2, int count1, int count2) { | bool sat(string s, string s1, string s2, int count1, int count2) { | [
"s",
"s1",
"s2",
"count1",
"count2"
] | def sat(s: str, s1, s2, count1, count2):
return s.count(s1) == count1 and s.count(s2) == count2 and (s[:10] == s[-10:]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"s1\": \"a\", \"s2\": \"b\", \"count1\": 50, \"count2\": 30}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"??????????qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t???????????\", \"s1\": \"t\", \"s2\": \"qu\", \"count1\": 86, \"count2\": 83}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"??????????qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc???????????\", \"s1\": \"kuc\", \"s2\": \"qu\", \"count1\": 63, \"count2\": 58}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"??????????tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te???????????\", \"s1\": \"te\", \"s2\": \"tex\", \"count1\": 97, \"count2\": 53}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"??????????n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot???????????\", \"s1\": \"hot\", \"s2\": \"n\", \"count1\": 48, \"count2\": 92}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"s1\": \"t\", \"s2\": \"b\", \"count1\": 63, \"count2\": 53}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"s1\": \"a\", \"s2\": \"\", \"count1\": 50, \"count2\": 30}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"s1\": \"\", \"s2\": \"b\", \"count1\": 50, \"count2\": 30}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"s1\": \"t\", \"s2\": \"b\", \"count1\": 63, \"count2\": 30}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a string that has count1 occurrences of s1 and count2 occurrences of s2 and starts and ends with\n// the same 10 characters\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string s1, string s2, int count1, int count2, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, s1, s2, count1, count2), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"a\", \"b\", 50, 30, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t?t???????????\", \"t\", \"qu\", 86, 83, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?qu?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc?kuc???????????\", \"kuc\", \"qu\", 63, 58, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?tex?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te?te???????????\", \"te\", \"tex\", 97, 53, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?n?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot?hot???????????\", \"hot\", \"n\", 48, 92, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"t\", \"b\", 63, 53, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"a\", \"\", 50, 30, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"\", \"b\", 50, 30, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"??????????b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?b?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a?a???????????\", \"t\", \"b\", 63, 30, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
278 | TP3/basic.ZipStr | C++ | Verifies that the inputs satisfy the problem:
Find a string that contains each string in substrings alternating, e.g., 'cdaotg' for 'cat' and 'dog' | /**
* Verifies that the inputs satisfy the problem:
* Find a string that contains each string in substrings alternating, e.g., 'cdaotg' for 'cat' and 'dog'
*/
bool sat(string s, vector<string> substrings) { | bool sat(string s, vector<string> substrings) { | [
"s",
"substrings"
] | def sat(s: str, substrings):
return all((sub in s[i::len(substrings)] for (i, sub) in enumerate(substrings))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"fbbooaadorzd b a l l\", \"substrings\": [\"foo\", \"bar\", \"baz\", \"oddball\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"qcguheiy fh ei lm oy tv ae m e n e \", \"substrings\": [\"quifelota\", \"chyhimyvemene\", \"ge\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"kcrriueotmbcyauotttrehe xo tx ia rz i t e x \", \"substrings\": [\"kitytextiritex\", \"cumathoxaz\", \"rebute\", \"rocor\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"tweu s y c\", \"substrings\": [\"te\", \"wusyc\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"cruytseu c a j a x u n o\", \"substrings\": [\"cute\", \"rysucajaxuno\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"cruytseu c a j a x u n o\", \"substrings\": [\"te\", \"wusyc\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"tweu s y c\", \"substrings\": [\"foo\", \"bar\", \"baz\", \"oddball\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"qcguheiy fh ei lm oy tv ae m e n e \", \"substrings\": [\"te\", \"wusyc\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"tweu s y c\", \"substrings\": [\"cute\", \"rysucajaxuno\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a string that contains each string in substrings alternating, e.g., 'cdaotg' for 'cat' and 'dog'\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<string> substrings, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, substrings), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"fbbooaadorzd b a l l\", {\"foo\", \"bar\", \"baz\", \"oddball\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"qcguheiy fh ei lm oy tv ae m e n e \", {\"quifelota\", \"chyhimyvemene\", \"ge\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"kcrriueotmbcyauotttrehe xo tx ia rz i t e x \", {\"kitytextiritex\", \"cumathoxaz\", \"rebute\", \"rocor\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tweu s y c\", {\"te\", \"wusyc\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cruytseu c a j a x u n o\", {\"cute\", \"rysucajaxuno\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cruytseu c a j a x u n o\", {\"te\", \"wusyc\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tweu s y c\", {\"foo\", \"bar\", \"baz\", \"oddball\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"qcguheiy fh ei lm oy tv ae m e n e \", {\"te\", \"wusyc\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tweu s y c\", {\"cute\", \"rysucajaxuno\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
279 | TP3/basic.ReverseCat | C++ | Verifies that the inputs satisfy the problem:
Find a string that contains all the substrings reversed and forward | /**
* Verifies that the inputs satisfy the problem:
* Find a string that contains all the substrings reversed and forward
*/
bool sat(string s, vector<string> substrings) { | bool sat(string s, vector<string> substrings) { | [
"s",
"substrings"
] | def sat(s: str, substrings):
return all((sub in s and sub[::-1] in s for sub in substrings)) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"foobarbazoofrabzab\", \"substrings\": [\"foo\", \"bar\", \"baz\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"kepijilufuwisejyzatlechogyvonaxegitextazyjesiwufulijipekxetigexanovygohcel\", \"substrings\": [\"kepijilufuwisejyzat\", \"lechogyvonaxegitex\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"ripihuquyrenytuquosafyjichyguzocuzuqufuthixequybutyneryuquhipirijyfasouququzucozugyhcbyuqexihtuf\", \"substrings\": [\"ripihuquyrenytu\", \"quosafyji\", \"chyguzocuzuqu\", \"futhixequyb\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"thacovatukolivamaquyfezisothizypkabenegiquememifavilokutavocahtpyzihtosizefyuqamakfimemeuqigeneb\", \"substrings\": [\"thacovatukoliva\", \"maquyfezisothizyp\", \"ka\", \"benegiquememif\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"tvochemachylitvutextynydakelopifazapydomozamochugttilyhcamehcovipolekadynytxetuvguhcomazomodypazaf\", \"substrings\": [\"t\", \"vochemachylit\", \"vutextynydakelopi\", \"fazapydomozamochug\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"kepijilufuwisejyzatlechogyvonaxegitextazyjesiwufulijipekxetigexanovygohcel\", \"substrings\": [\"foo\", \"bar\", \"baz\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"foobarbazoofrabzab\", \"substrings\": [\"ripihuquyrenytu\", \"quosafyji\", \"chyguzocuzuqu\", \"futhixequyb\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"foobarbazoofrabzab\", \"substrings\": [\"thacovatukoliva\", \"maquyfezisothizyp\", \"ka\", \"benegiquememif\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"foobarbazoofrabzab\", \"substrings\": [\"t\", \"vochemachylit\", \"vutextynydakelopi\", \"fazapydomozamochug\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a string that contains all the substrings reversed and forward\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<string> substrings, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, substrings), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"foobarbazoofrabzab\", {\"foo\", \"bar\", \"baz\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"kepijilufuwisejyzatlechogyvonaxegitextazyjesiwufulijipekxetigexanovygohcel\", {\"kepijilufuwisejyzat\", \"lechogyvonaxegitex\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"ripihuquyrenytuquosafyjichyguzocuzuqufuthixequybutyneryuquhipirijyfasouququzucozugyhcbyuqexihtuf\", {\"ripihuquyrenytu\", \"quosafyji\", \"chyguzocuzuqu\", \"futhixequyb\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"thacovatukolivamaquyfezisothizypkabenegiquememifavilokutavocahtpyzihtosizefyuqamakfimemeuqigeneb\", {\"thacovatukoliva\", \"maquyfezisothizyp\", \"ka\", \"benegiquememif\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tvochemachylitvutextynydakelopifazapydomozamochugttilyhcamehcovipolekadynytxetuvguhcomazomodypazaf\", {\"t\", \"vochemachylit\", \"vutextynydakelopi\", \"fazapydomozamochug\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"kepijilufuwisejyzatlechogyvonaxegitextazyjesiwufulijipekxetigexanovygohcel\", {\"foo\", \"bar\", \"baz\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"foobarbazoofrabzab\", {\"ripihuquyrenytu\", \"quosafyji\", \"chyguzocuzuqu\", \"futhixequyb\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"foobarbazoofrabzab\", {\"thacovatukoliva\", \"maquyfezisothizyp\", \"ka\", \"benegiquememif\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"foobarbazoofrabzab\", {\"t\", \"vochemachylit\", \"vutextynydakelopi\", \"fazapydomozamochug\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
280 | TP3/basic.PenultimateString | C++ | Verifies that the inputs satisfy the problem:
Find the alphabetically second to last last string in vector. | /**
* Verifies that the inputs satisfy the problem:
* Find the alphabetically second to last last string in vector.
*/
bool sat(string s, vector<string> strings) { | bool sat(string s, vector<string> strings) { | [
"s",
"strings"
] | def sat(s: str, strings):
return s in strings and sum((t > s for t in strings)) == 1 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"fly\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"sovywos\", \"strings\": [\"ryzapychybykydege\", \"mivowepe\", \"sovywos\", \"chanyrorybynid\", \"vafechajufo\", \"nokymocymoxac\", \"jahejafuquoduk\", \"gogy\", \"bytothice\", \"ruminuvixixutudigom\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"pythujutisoxofe\", \"strings\": [\"mipelavychekecy\", \"pythujutisoxofe\", \"diliwagacivychinofiw\", \"na\", \"dobynaramithibolo\", \"cugupyfytextofoxat\", \"gyfokebo\", \"bymitextitextizoc\", \"rekimuk\", \"bepumyxitubachek\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"xyzeryberi\", \"strings\": [\"hunuvarufefikaq\", \"xejegu\", \"minoc\", \"puthyvyc\", \"xyzeryberi\", \"tyl\", \"thyvojyvijazetonowa\", \"jahygywuchitho\", \"quuvuvigy\", \"zuhechywituthexe\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"xasuwytextochypuli\", \"strings\": [\"wesolotelunyzecemexi\", \"pociquuwygocysahef\", \"lequusigipitexti\", \"quojuxaq\", \"fyt\", \"m\", \"bavalepynoza\", \"zihath\", \"lodomijibuxoju\", \"xasuwytextochypuli\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"fly\", \"strings\": [\"hunuvarufefikaq\", \"xejegu\", \"minoc\", \"puthyvyc\", \"xyzeryberi\", \"tyl\", \"thyvojyvijazetonowa\", \"jahygywuchitho\", \"quuvuvigy\", \"zuhechywituthexe\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"fly\", \"strings\": []}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"sovywos\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"xasuwytextochypuli\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the alphabetically second to last last string in a list.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<string> strings, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, strings), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"fly\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"sovywos\", {\"ryzapychybykydege\", \"mivowepe\", \"sovywos\", \"chanyrorybynid\", \"vafechajufo\", \"nokymocymoxac\", \"jahejafuquoduk\", \"gogy\", \"bytothice\", \"ruminuvixixutudigom\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"pythujutisoxofe\", {\"mipelavychekecy\", \"pythujutisoxofe\", \"diliwagacivychinofiw\", \"na\", \"dobynaramithibolo\", \"cugupyfytextofoxat\", \"gyfokebo\", \"bymitextitextizoc\", \"rekimuk\", \"bepumyxitubachek\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"xyzeryberi\", {\"hunuvarufefikaq\", \"xejegu\", \"minoc\", \"puthyvyc\", \"xyzeryberi\", \"tyl\", \"thyvojyvijazetonowa\", \"jahygywuchitho\", \"quuvuvigy\", \"zuhechywituthexe\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"xasuwytextochypuli\", {\"wesolotelunyzecemexi\", \"pociquuwygocysahef\", \"lequusigipitexti\", \"quojuxaq\", \"fyt\", \"m\", \"bavalepynoza\", \"zihath\", \"lodomijibuxoju\", \"xasuwytextochypuli\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"fly\", {\"hunuvarufefikaq\", \"xejegu\", \"minoc\", \"puthyvyc\", \"xyzeryberi\", \"tyl\", \"thyvojyvijazetonowa\", \"jahygywuchitho\", \"quuvuvigy\", \"zuhechywituthexe\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"fly\", {}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"sovywos\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"xasuwytextochypuli\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
281 | TP3/basic.PenultimateRevString | C++ | Verifies that the inputs satisfy the problem:
Find the reversed version of the alphabetically second string in vector. | /**
* Verifies that the inputs satisfy the problem:
* Find the reversed version of the alphabetically second string in vector.
*/
bool sat(string s, vector<string> strings) { | bool sat(string s, vector<string> strings) { | [
"s",
"strings"
] | def sat(s: str, strings):
return s[::-1] in strings and sum((t < s[::-1] for t in strings)) == 1 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"tac\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"xobezej\", \"strings\": [\"rawithelen\", \"que\", \"pikuf\", \"koze\", \"zehyquorofyxytextef\", \"text\", \"jezebox\", \"zychopucebychokyz\", \"pyzyxatevafugedix\", \"buzogehabojyb\"]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"yhahahimynojytyhtag\", \"strings\": [\"thythanaham\", \"quiroxebadivogis\", \"kyh\", \"xa\", \"gathytyjonymihahahy\", \"musyzisequyxyhenico\", \"poxizitizexokigewifi\", \"mife\", \"chyjuratexta\", \"gyrato\"]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"cavofidakinanycibah\", \"strings\": [\"habicynanikadifovac\", \"bozehathyfoz\", \"hud\", \"textudunachuxarise\", \"hewohahatazabab\", \"lutumelimevabutha\", \"wocher\", \"wacifufixudizon\", \"tazibedo\", \"xytu\"]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"tesotaxegawohcatug\", \"strings\": [\"vekykothumygochuth\", \"xujatajazisiqu\", \"vapyvymobymethotexto\", \"tygope\", \"g\", \"ripalotextaj\", \"tecehuthojodogucivaj\", \"xyjulecometihesej\", \"ribo\", \"gutachowagexatoset\"]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"tac\", \"strings\": [\"thythanaham\", \"quiroxebadivogis\", \"kyh\", \"xa\", \"gathytyjonymihahahy\", \"musyzisequyxyhenico\", \"poxizitizexokigewifi\", \"mife\", \"chyjuratexta\", \"gyrato\"]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"cavofidakinanycibah\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"tac\", \"strings\": []}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"yhahahimynojytyhtag\", \"strings\": [\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find the reversed version of the alphabetically second string in a list.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, vector<string> strings, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, strings), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"tac\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"xobezej\", {\"rawithelen\", \"que\", \"pikuf\", \"koze\", \"zehyquorofyxytextef\", \"text\", \"jezebox\", \"zychopucebychokyz\", \"pyzyxatevafugedix\", \"buzogehabojyb\"}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"yhahahimynojytyhtag\", {\"thythanaham\", \"quiroxebadivogis\", \"kyh\", \"xa\", \"gathytyjonymihahahy\", \"musyzisequyxyhenico\", \"poxizitizexokigewifi\", \"mife\", \"chyjuratexta\", \"gyrato\"}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cavofidakinanycibah\", {\"habicynanikadifovac\", \"bozehathyfoz\", \"hud\", \"textudunachuxarise\", \"hewohahatazabab\", \"lutumelimevabutha\", \"wocher\", \"wacifufixudizon\", \"tazibedo\", \"xytu\"}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tesotaxegawohcatug\", {\"vekykothumygochuth\", \"xujatajazisiqu\", \"vapyvymobymethotexto\", \"tygope\", \"g\", \"ripalotextaj\", \"tecehuthojodogucivaj\", \"xyjulecometihesej\", \"ribo\", \"gutachowagexatoset\"}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tac\", {\"thythanaham\", \"quiroxebadivogis\", \"kyh\", \"xa\", \"gathytyjonymihahahy\", \"musyzisequyxyhenico\", \"poxizitizexokigewifi\", \"mife\", \"chyjuratexta\", \"gyrato\"}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"cavofidakinanycibah\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"tac\", {}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"yhahahimynojytyhtag\", {\"cat\", \"dog\", \"bird\", \"fly\", \"moose\"}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
282 | TP3/basic.CenteredString | C++ | Verifies that the inputs satisfy the problem:
Find a substring of the given length centered within the target string. | /**
* Verifies that the inputs satisfy the problem:
* Find a substring of the given length centered within the target string.
*/
bool sat(string s, string target, int length_arg2) { | bool sat(string s, string target, int length_arg2) { | [
"s",
"target",
"length_arg2"
] | def sat(s: str, target, length_arg2):
return target[(len(target) - length_arg2) // 2:(len(target) + length_arg2) // 2] == s | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"s\": \"barbaz\", \"target\": \"foobarbazwow\", \"length_arg2\": 6}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"s\": \"j\", \"target\": \"rujus\", \"length_arg2\": 1}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"s\": \"bulu\", \"target\": \"bulu\", \"length_arg2\": 4}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"s\": \"uhujuwi\", \"target\": \"defojuhujuwilumec\", \"length_arg2\": 7}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"s\": \"enuhij\", \"target\": \"tenuhije\", \"length_arg2\": 6}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"s\": \"j\", \"target\": \"rujus\", \"length_arg2\": 7}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"s\": \"j\", \"target\": \"bulu\", \"length_arg2\": 7}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"s\": \"j\", \"target\": \"rujus\", \"length_arg2\": 4}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"s\": \"j\", \"target\": \"bulu\", \"length_arg2\": 6}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a substring of the given length centered within the target string.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string s, string target, int length_arg2, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(s, target, length_arg2), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"barbaz\", \"foobarbazwow\", 6, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j\", \"rujus\", 1, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"bulu\", \"bulu\", 4, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"uhujuwi\", \"defojuhujuwilumec\", 7, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"enuhij\", \"tenuhije\", 6, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j\", \"rujus\", 7, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j\", \"bulu\", 7, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j\", \"rujus\", 4, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"j\", \"bulu\", 6, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
283 | TP3/basic.SubstrCount | C++ | Verifies that the inputs satisfy the problem:
Find a substring with a certain count in a given string | /**
* Verifies that the inputs satisfy the problem:
* Find a substring with a certain count in a given string
*/
bool sat(string substring, string string_arg1, int count) { | bool sat(string substring, string string_arg1, int count) { | [
"substring",
"string_arg1",
"count"
] | def sat(substring: str, string_arg1, count):
return string_arg1.count(substring) == count | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"substring\": \"ooo\", \"string_arg1\": \"moooboooofasd\", \"count\": 2}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"substring\": \"q\", \"string_arg1\": \"nyvyfytibuquyquuchudemixyzychumanachozyquiquowutextyvomyzychyme\", \"count\": 4}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"substring\": \"o\", \"string_arg1\": \"cokomoquiwythyluwamymothynihythenyfeteth\", \"count\": 4}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"substring\": \"c\", \"string_arg1\": \"cutextolichymocajethamopyvepethytextydynykihywyxivytextequylejekuf\", \"count\": 3}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"substring\": \"y\", \"string_arg1\": \"modacequytextytextilaleguthovamipehywaciripetext\", \"count\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"substring\": \"o\", \"string_arg1\": \"moooboooofasd\", \"count\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"substring\": \"o\", \"string_arg1\": \"moooboooofasd\", \"count\": 4}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"substring\": \"c\", \"string_arg1\": \"moooboooofasd\", \"count\": 3}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"substring\": \"o\", \"string_arg1\": \"moooboooofasd\", \"count\": 2}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a substring with a certain count in a given string\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string substring, string string_arg1, int count, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(substring, string_arg1, count), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"ooo\", \"moooboooofasd\", 2, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"q\", \"nyvyfytibuquyquuchudemixyzychumanachozyquiquowutextyvomyzychyme\", 4, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"o\", \"cokomoquiwythyluwamymothynihythenyfeteth\", 4, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"c\", \"cutextolichymocajethamopyvepethytextydynykihywyxivytextequylejekuf\", 3, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"y\", \"modacequytextytextilaleguthovamipehywaciripetext\", 3, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"o\", \"moooboooofasd\", 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"o\", \"moooboooofasd\", 4, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"c\", \"moooboooofasd\", 3, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"o\", \"moooboooofasd\", 2, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
284 | TP3/basic.CompleteParens | C++ | Verifies that the inputs satisfy the problem:
Add parentheses to the beginning and end of s to make all parentheses balanced | /**
* Verifies that the inputs satisfy the problem:
* Add parentheses to the beginning and end of s to make all parentheses balanced
*/
bool sat(string t, string s) { | bool sat(string t, string s) { | [
"t",
"s"
] | def sat(t: str, s):
for i in range(len(t) + 1):
depth = t[:i].count('(') - t[:i].count(')')
if not depth >= 0:
return False
return depth == 0 and s in t | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"t\": \"(((((((((())(Add)some))parens()to()(balance(()(()(me!)(((()))))))))))))\", \"s\": \"))(Add)some))parens()to()(balance(()(()(me!)((((\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"t\": \"((((((((((po)(())kf((((cy()))((tex()())()))))))))))))\", \"s\": \"(po)(())kf((((cy()))((tex()())(\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"t\": \"((((((yf)()(()))hik()t((()))))))\", \"s\": \"yf)()(()))hik()t(((\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"t\": \"((((((((((((((((((()((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k)))))))))))))))))\", \"s\": \")((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"t\": \"(((())())l)\", \"s\": \"))())l\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"t\": \"(((())())l)\", \"s\": \")((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"t\": \"(((())())l)\", \"s\": \"yf)()(()))hik()t(((\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"t\": \"((((((yf)()(()))hik()t((()))))))\", \"s\": \"(po)(())kf((((cy()))((tex()())(\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"t\": \"(((())())l)\", \"s\": \"))(Add)some))parens()to()(balance(()(()(me!)((((\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Add parentheses to the beginning and end of s to make all parentheses balanced\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(string t, string s, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(t, s), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver(\"(((((((((())(Add)some))parens()to()(balance(()(()(me!)(((()))))))))))))\", \"))(Add)some))parens()to()(balance(()(()(me!)((((\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"((((((((((po)(())kf((((cy()))((tex()())()))))))))))))\", \"(po)(())kf((((cy()))((tex()())(\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"((((((yf)()(()))hik()t((()))))))\", \"yf)()(()))hik()t(((\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"((((((((((((((((((()((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k)))))))))))))))))\", \")((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"(((())())l)\", \"))())l\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"(((())())l)\", \")((le(()()chu)())nol))((sic(((da)()ty((()te))xy(())))))k\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"(((())())l)\", \"yf)()(()))hik()t(((\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"((((((yf)()(()))hik()t((()))))))\", \"(po)(())kf((((cy()))((tex()())(\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver(\"(((())())l)\", \"))(Add)some))parens()to()(balance(()(()(me!)((((\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
285 | TP3/chess.EightQueensOrFewer | C++ | Verifies that the inputs satisfy the problem:
Position min(m, n) <= 8 queens on an m x n chess board so that no pair is attacking each other. | /**
* Verifies that the inputs satisfy the problem:
* Position min(m, n) <= 8 queens on an m x n chess board so that no pair is attacking each other.
*/
bool sat(vector<vector<int>> squares, int m, int n) { | bool sat(vector<vector<int>> squares, int m, int n) { | [
"squares",
"m",
"n"
] | def sat(squares: List[List[int]], m, n):
k = min(m, n)
if not (all((i in range(m) and j in range(n) for (i, j) in squares)) and len(squares) == k):
return False
return 4 * k == len({t for (i, j) in squares for t in [('row', i), ('col', j), ('SE', i + j), ('NE', i - j)]}) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"squares\": [[0, 0], [1, 4], [2, 7], [3, 5], [4, 2], [5, 6], [6, 1], [7, 3]], \"m\": 8, \"n\": 8}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 5], [3, 0], [4, 2], [5, 4]], \"m\": 9, \"n\": 6}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 59, \"n\": 4}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"squares\": [[0, 0], [1, 4], [2, 7], [3, 5], [4, 2], [5, 6], [6, 1], [7, 3]], \"m\": 38, \"n\": 8}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 9, \"n\": 4}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 9, \"n\": 6}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 8, \"n\": 8}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 38, \"n\": 8}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 0], [3, 2]], \"m\": 8, \"n\": 6}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Position min(m, n) <= 8 queens on an m x n chess board so that no pair is attacking each other.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> squares, int m, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(squares, m, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 0}, {1, 4}, {2, 7}, {3, 5}, {4, 2}, {5, 6}, {6, 1}, {7, 3}}, 8, 8, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 5}, {3, 0}, {4, 2}, {5, 4}}, 9, 6, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 59, 4, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {1, 4}, {2, 7}, {3, 5}, {4, 2}, {5, 6}, {6, 1}, {7, 3}}, 38, 8, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 9, 4, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 9, 6, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 8, 8, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 38, 8, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 0}, {3, 2}}, 8, 6, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
286 | TP3/chess.MoreQueens | C++ | Verifies that the inputs satisfy the problem:
Position min(m, n) > 8 queens on an m x n chess board so that no pair is attacking each other. | /**
* Verifies that the inputs satisfy the problem:
* Position min(m, n) > 8 queens on an m x n chess board so that no pair is attacking each other.
*/
bool sat(vector<vector<int>> squares, int m, int n) { | bool sat(vector<vector<int>> squares, int m, int n) { | [
"squares",
"m",
"n"
] | def sat(squares: List[List[int]], m, n):
k = min(m, n)
if not all((i in range(m) and j in range(n) for (i, j) in squares)):
return False
if not len(squares) == k:
return False
if not len({i for (i, j) in squares}) == k:
return False
if not len({j for (i, j) in squares}) == k:
return False
if not len({i + j for (i, j) in squares}) == k:
return False
if not len({i - j for (i, j) in squares}) == k:
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"squares\": [[8, 8], [0, 3], [1, 5], [2, 7], [3, 1], [4, 6], [5, 0], [6, 2], [7, 4]], \"m\": 9, \"n\": 9}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"squares\": [[78, 78], [0, 1], [1, 3], [2, 5], [3, 7], [4, 9], [5, 11], [6, 13], [7, 15], [8, 17], [9, 19], [10, 21], [11, 23], [12, 25], [13, 27], [14, 29], [15, 31], [16, 33], [17, 35], [18, 37], [19, 39], [20, 41], [21, 43], [22, 45], [23, 47], [24, 49], [25, 51], [26, 53], [27, 55], [28, 57], [29, 59], [30, 61], [31, 63], [32, 65], [33, 67], [34, 69], [35, 71], [36, 73], [37, 75], [38, 77], [39, 0], [40, 2], [41, 4], [42, 6], [43, 8], [44, 10], [45, 12], [46, 14], [47, 16], [48, 18], [49, 20], [50, 22], [51, 24], [52, 26], [53, 28], [54, 30], [55, 32], [56, 34], [57, 36], [58, 38], [59, 40], [60, 42], [61, 44], [62, 46], [63, 48], [64, 50], [65, 52], [66, 54], [67, 56], [68, 58], [69, 60], [70, 62], [71, 64], [72, 66], [73, 68], [74, 70], [75, 72], [76, 74], [77, 76]], \"m\": 79, \"n\": 95}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"squares\": [[0, 39], [1, 41], [2, 43], [3, 45], [4, 47], [5, 49], [6, 51], [7, 53], [8, 55], [9, 57], [10, 59], [11, 61], [12, 63], [13, 65], [14, 67], [15, 69], [16, 71], [17, 73], [18, 75], [19, 77], [20, 79], [21, 1], [22, 3], [23, 5], [24, 7], [25, 9], [26, 11], [27, 13], [28, 15], [29, 17], [30, 19], [31, 21], [32, 23], [33, 25], [34, 27], [35, 29], [36, 31], [37, 33], [38, 35], [39, 37], [40, 42], [41, 44], [42, 46], [43, 48], [44, 50], [45, 52], [46, 54], [47, 56], [48, 58], [49, 60], [50, 62], [51, 64], [52, 66], [53, 68], [54, 70], [55, 72], [56, 74], [57, 76], [58, 78], [59, 0], [60, 2], [61, 4], [62, 6], [63, 8], [64, 10], [65, 12], [66, 14], [67, 16], [68, 18], [69, 20], [70, 22], [71, 24], [72, 26], [73, 28], [74, 30], [75, 32], [76, 34], [77, 36], [78, 38], [79, 40]], \"m\": 80, \"n\": 88}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"squares\": [[0, 1], [1, 3], [2, 5], [3, 7], [4, 9], [5, 11], [6, 13], [7, 15], [8, 0], [9, 2], [10, 4], [11, 6], [12, 8], [13, 10], [14, 12], [15, 14]], \"m\": 56, \"n\": 16}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"squares\": [[22, 22], [0, 1], [1, 3], [2, 5], [3, 7], [4, 9], [5, 11], [6, 13], [7, 15], [8, 17], [9, 19], [10, 21], [11, 0], [12, 2], [13, 4], [14, 6], [15, 8], [16, 10], [17, 12], [18, 14], [19, 16], [20, 18], [21, 20]], \"m\": 23, \"n\": 45}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"squares\": [[8, 8], [0, 3], [1, 5], [2, 7], [3, 1], [4, 6], [5, 0], [6, 2], [7, 4]], \"m\": 79, \"n\": 88}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"squares\": [[8, 8], [0, 3], [1, 5], [2, 7], [3, 1], [4, 6], [5, 0], [6, 2], [7, 4]], \"m\": 23, \"n\": 88}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"squares\": [[8, 8], [0, 3], [1, 5], [2, 7], [3, 1], [4, 6], [5, 0], [6, 2], [7, 4]], \"m\": 79, \"n\": 16}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"squares\": [], \"m\": 9, \"n\": 9}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Position min(m, n) > 8 queens on an m x n chess board so that no pair is attacking each other.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> squares, int m, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(squares, m, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{8, 8}, {0, 3}, {1, 5}, {2, 7}, {3, 1}, {4, 6}, {5, 0}, {6, 2}, {7, 4}}, 9, 9, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{78, 78}, {0, 1}, {1, 3}, {2, 5}, {3, 7}, {4, 9}, {5, 11}, {6, 13}, {7, 15}, {8, 17}, {9, 19}, {10, 21}, {11, 23}, {12, 25}, {13, 27}, {14, 29}, {15, 31}, {16, 33}, {17, 35}, {18, 37}, {19, 39}, {20, 41}, {21, 43}, {22, 45}, {23, 47}, {24, 49}, {25, 51}, {26, 53}, {27, 55}, {28, 57}, {29, 59}, {30, 61}, {31, 63}, {32, 65}, {33, 67}, {34, 69}, {35, 71}, {36, 73}, {37, 75}, {38, 77}, {39, 0}, {40, 2}, {41, 4}, {42, 6}, {43, 8}, {44, 10}, {45, 12}, {46, 14}, {47, 16}, {48, 18}, {49, 20}, {50, 22}, {51, 24}, {52, 26}, {53, 28}, {54, 30}, {55, 32}, {56, 34}, {57, 36}, {58, 38}, {59, 40}, {60, 42}, {61, 44}, {62, 46}, {63, 48}, {64, 50}, {65, 52}, {66, 54}, {67, 56}, {68, 58}, {69, 60}, {70, 62}, {71, 64}, {72, 66}, {73, 68}, {74, 70}, {75, 72}, {76, 74}, {77, 76}}, 79, 95, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 39}, {1, 41}, {2, 43}, {3, 45}, {4, 47}, {5, 49}, {6, 51}, {7, 53}, {8, 55}, {9, 57}, {10, 59}, {11, 61}, {12, 63}, {13, 65}, {14, 67}, {15, 69}, {16, 71}, {17, 73}, {18, 75}, {19, 77}, {20, 79}, {21, 1}, {22, 3}, {23, 5}, {24, 7}, {25, 9}, {26, 11}, {27, 13}, {28, 15}, {29, 17}, {30, 19}, {31, 21}, {32, 23}, {33, 25}, {34, 27}, {35, 29}, {36, 31}, {37, 33}, {38, 35}, {39, 37}, {40, 42}, {41, 44}, {42, 46}, {43, 48}, {44, 50}, {45, 52}, {46, 54}, {47, 56}, {48, 58}, {49, 60}, {50, 62}, {51, 64}, {52, 66}, {53, 68}, {54, 70}, {55, 72}, {56, 74}, {57, 76}, {58, 78}, {59, 0}, {60, 2}, {61, 4}, {62, 6}, {63, 8}, {64, 10}, {65, 12}, {66, 14}, {67, 16}, {68, 18}, {69, 20}, {70, 22}, {71, 24}, {72, 26}, {73, 28}, {74, 30}, {75, 32}, {76, 34}, {77, 36}, {78, 38}, {79, 40}}, 80, 88, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {1, 3}, {2, 5}, {3, 7}, {4, 9}, {5, 11}, {6, 13}, {7, 15}, {8, 0}, {9, 2}, {10, 4}, {11, 6}, {12, 8}, {13, 10}, {14, 12}, {15, 14}}, 56, 16, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{22, 22}, {0, 1}, {1, 3}, {2, 5}, {3, 7}, {4, 9}, {5, 11}, {6, 13}, {7, 15}, {8, 17}, {9, 19}, {10, 21}, {11, 0}, {12, 2}, {13, 4}, {14, 6}, {15, 8}, {16, 10}, {17, 12}, {18, 14}, {19, 16}, {20, 18}, {21, 20}}, 23, 45, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{8, 8}, {0, 3}, {1, 5}, {2, 7}, {3, 1}, {4, 6}, {5, 0}, {6, 2}, {7, 4}}, 79, 88, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{8, 8}, {0, 3}, {1, 5}, {2, 7}, {3, 1}, {4, 6}, {5, 0}, {6, 2}, {7, 4}}, 23, 88, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{8, 8}, {0, 3}, {1, 5}, {2, 7}, {3, 1}, {4, 6}, {5, 0}, {6, 2}, {7, 4}}, 79, 16, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 9, 9, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
287 | TP3/chess.KnightsTour | C++ | Verifies that the inputs satisfy the problem:
Find an (open) tour of knight moves on an m x n chess-board that visits each square once. | /**
* Verifies that the inputs satisfy the problem:
* Find an (open) tour of knight moves on an m x n chess-board that visits each square once.
*/
bool sat(vector<vector<int>> tour, int m, int n) { | bool sat(vector<vector<int>> tour, int m, int n) { | [
"tour",
"m",
"n"
] | def sat(tour: List[List[int]], m, n):
if not all(({abs(i1 - i2), abs(j1 - j2)} == {1, 2} for ([i1, j1], [i2, j2]) in zip(tour, tour[1:]))):
return False
return sorted(tour) == [[i, j] for i in range(m) for j in range(n)] | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [6, 1], [7, 3], [6, 5], [7, 7], [5, 6], [3, 7], [1, 6], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [1, 7], [2, 5], [0, 6], [2, 7], [4, 6], [6, 7], [7, 5], [5, 4], [6, 6], [7, 4], [6, 2], [7, 0], [5, 1], [3, 0], [1, 1], [3, 2], [2, 4], [0, 3], [1, 5], [0, 7], [2, 6], [4, 7], [3, 5], [1, 4], [0, 2], [1, 0], [2, 2], [4, 1], [6, 0], [7, 2], [5, 3], [3, 4], [4, 2], [5, 0], [7, 1], [6, 3], [4, 4], [2, 3], [3, 1], [5, 2], [3, 3], [4, 5], [5, 7], [3, 6], [5, 5], [4, 3], [6, 4], [7, 6]], \"m\": 8, \"n\": 8}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [6, 1], [8, 0], [7, 2], [8, 4], [7, 6], [8, 8], [6, 7], [8, 6], [7, 8], [5, 7], [3, 8], [1, 7], [0, 5], [1, 3], [0, 1], [2, 0], [1, 2], [0, 4], [2, 5], [0, 6], [1, 8], [3, 7], [5, 8], [7, 7], [8, 5], [7, 3], [8, 1], [6, 0], [4, 1], [3, 3], [1, 4], [0, 2], [1, 0], [3, 1], [5, 2], [7, 1], [5, 0], [6, 2], [8, 3], [6, 4], [4, 5], [2, 6], [0, 7], [2, 8], [1, 6], [0, 8], [2, 7], [4, 8], [5, 6], [6, 8], [8, 7], [7, 5], [5, 4], [6, 6], [4, 7], [3, 5], [2, 3], [1, 5], [3, 6], [2, 4], [0, 3], [1, 1], [3, 0], [2, 2], [4, 3], [5, 1], [7, 0], [8, 2], [7, 4], [5, 5], [6, 3], [4, 2], [3, 4], [4, 6], [6, 5], [5, 3], [3, 2], [4, 4]], \"m\": 9, \"n\": 9}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [6, 1], [5, 3], [6, 5], [4, 6], [2, 5], [0, 6], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [6, 2], [4, 1], [6, 0], [5, 2], [3, 3], [5, 4], [6, 6], [4, 5], [2, 6], [0, 5], [1, 3], [0, 1], [2, 0], [1, 2], [0, 4], [1, 6], [3, 5], [5, 6], [6, 4], [4, 3], [2, 2], [3, 0], [5, 1], [6, 3], [5, 5], [3, 4], [4, 2], [2, 3], [1, 1], [0, 3], [1, 5], [3, 6], [4, 4], [3, 2], [2, 4]], \"m\": 7, \"n\": 7}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [5, 2], [4, 4], [2, 5], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [2, 4], [4, 5], [3, 3], [5, 4], [3, 5], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [4, 2], [2, 3], [1, 5], [0, 3], [1, 1], [3, 2], [5, 3], [4, 1], [2, 2], [3, 4], [5, 5], [4, 3], [5, 1], [3, 0]], \"m\": 6, \"n\": 6}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [6, 1], [5, 3], [6, 5], [5, 7], [3, 6], [1, 7], [0, 5], [1, 3], [0, 1], [2, 0], [4, 1], [6, 0], [5, 2], [6, 4], [5, 6], [3, 7], [1, 6], [0, 4], [1, 2], [3, 3], [4, 5], [6, 6], [4, 7], [2, 6], [0, 7], [1, 5], [0, 3], [2, 4], [3, 2], [1, 1], [3, 0], [5, 1], [6, 3], [4, 4], [2, 5], [0, 6], [2, 7], [4, 6], [6, 7], [5, 5], [3, 4], [4, 2], [5, 0], [6, 2], [5, 4], [3, 5], [1, 4], [2, 2], [4, 3], [3, 1], [1, 0], [0, 2], [2, 3]], \"m\": 7, \"n\": 8}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [5, 2], [4, 4], [2, 5], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [2, 4], [4, 5], [3, 3], [5, 4], [3, 5], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [4, 2], [2, 3], [1, 5], [0, 3], [1, 1], [3, 2], [5, 3], [4, 1], [2, 2], [3, 4], [5, 5], [4, 3], [5, 1], [3, 0]], \"m\": 6, \"n\": 8}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [5, 2], [4, 4], [2, 5], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [2, 4], [4, 5], [3, 3], [5, 4], [3, 5], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [4, 2], [2, 3], [1, 5], [0, 3], [1, 1], [3, 2], [5, 3], [4, 1], [2, 2], [3, 4], [5, 5], [4, 3], [5, 1], [3, 0]], \"m\": 9, \"n\": 6}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [5, 2], [4, 4], [2, 5], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [2, 4], [4, 5], [3, 3], [5, 4], [3, 5], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [4, 2], [2, 3], [1, 5], [0, 3], [1, 1], [3, 2], [5, 3], [4, 1], [2, 2], [3, 4], [5, 5], [4, 3], [5, 1], [3, 0]], \"m\": 6, \"n\": 9}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"tour\": [[0, 0], [2, 1], [4, 0], [5, 2], [4, 4], [2, 5], [0, 4], [1, 2], [2, 0], [0, 1], [1, 3], [0, 5], [2, 4], [4, 5], [3, 3], [5, 4], [3, 5], [1, 4], [0, 2], [1, 0], [3, 1], [5, 0], [4, 2], [2, 3], [1, 5], [0, 3], [1, 1], [3, 2], [5, 3], [4, 1], [2, 2], [3, 4], [5, 5], [4, 3], [5, 1], [3, 0]], \"m\": 9, \"n\": 9}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find an (open) tour of knight moves on an m x n chess-board that visits each square once.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> tour, int m, int n, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(tour, m, n), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {6, 1}, {7, 3}, {6, 5}, {7, 7}, {5, 6}, {3, 7}, {1, 6}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {1, 7}, {2, 5}, {0, 6}, {2, 7}, {4, 6}, {6, 7}, {7, 5}, {5, 4}, {6, 6}, {7, 4}, {6, 2}, {7, 0}, {5, 1}, {3, 0}, {1, 1}, {3, 2}, {2, 4}, {0, 3}, {1, 5}, {0, 7}, {2, 6}, {4, 7}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {2, 2}, {4, 1}, {6, 0}, {7, 2}, {5, 3}, {3, 4}, {4, 2}, {5, 0}, {7, 1}, {6, 3}, {4, 4}, {2, 3}, {3, 1}, {5, 2}, {3, 3}, {4, 5}, {5, 7}, {3, 6}, {5, 5}, {4, 3}, {6, 4}, {7, 6}}, 8, 8, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {6, 1}, {8, 0}, {7, 2}, {8, 4}, {7, 6}, {8, 8}, {6, 7}, {8, 6}, {7, 8}, {5, 7}, {3, 8}, {1, 7}, {0, 5}, {1, 3}, {0, 1}, {2, 0}, {1, 2}, {0, 4}, {2, 5}, {0, 6}, {1, 8}, {3, 7}, {5, 8}, {7, 7}, {8, 5}, {7, 3}, {8, 1}, {6, 0}, {4, 1}, {3, 3}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 2}, {7, 1}, {5, 0}, {6, 2}, {8, 3}, {6, 4}, {4, 5}, {2, 6}, {0, 7}, {2, 8}, {1, 6}, {0, 8}, {2, 7}, {4, 8}, {5, 6}, {6, 8}, {8, 7}, {7, 5}, {5, 4}, {6, 6}, {4, 7}, {3, 5}, {2, 3}, {1, 5}, {3, 6}, {2, 4}, {0, 3}, {1, 1}, {3, 0}, {2, 2}, {4, 3}, {5, 1}, {7, 0}, {8, 2}, {7, 4}, {5, 5}, {6, 3}, {4, 2}, {3, 4}, {4, 6}, {6, 5}, {5, 3}, {3, 2}, {4, 4}}, 9, 9, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {6, 1}, {5, 3}, {6, 5}, {4, 6}, {2, 5}, {0, 6}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {6, 2}, {4, 1}, {6, 0}, {5, 2}, {3, 3}, {5, 4}, {6, 6}, {4, 5}, {2, 6}, {0, 5}, {1, 3}, {0, 1}, {2, 0}, {1, 2}, {0, 4}, {1, 6}, {3, 5}, {5, 6}, {6, 4}, {4, 3}, {2, 2}, {3, 0}, {5, 1}, {6, 3}, {5, 5}, {3, 4}, {4, 2}, {2, 3}, {1, 1}, {0, 3}, {1, 5}, {3, 6}, {4, 4}, {3, 2}, {2, 4}}, 7, 7, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {5, 2}, {4, 4}, {2, 5}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {2, 4}, {4, 5}, {3, 3}, {5, 4}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {4, 2}, {2, 3}, {1, 5}, {0, 3}, {1, 1}, {3, 2}, {5, 3}, {4, 1}, {2, 2}, {3, 4}, {5, 5}, {4, 3}, {5, 1}, {3, 0}}, 6, 6, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {6, 1}, {5, 3}, {6, 5}, {5, 7}, {3, 6}, {1, 7}, {0, 5}, {1, 3}, {0, 1}, {2, 0}, {4, 1}, {6, 0}, {5, 2}, {6, 4}, {5, 6}, {3, 7}, {1, 6}, {0, 4}, {1, 2}, {3, 3}, {4, 5}, {6, 6}, {4, 7}, {2, 6}, {0, 7}, {1, 5}, {0, 3}, {2, 4}, {3, 2}, {1, 1}, {3, 0}, {5, 1}, {6, 3}, {4, 4}, {2, 5}, {0, 6}, {2, 7}, {4, 6}, {6, 7}, {5, 5}, {3, 4}, {4, 2}, {5, 0}, {6, 2}, {5, 4}, {3, 5}, {1, 4}, {2, 2}, {4, 3}, {3, 1}, {1, 0}, {0, 2}, {2, 3}}, 7, 8, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {5, 2}, {4, 4}, {2, 5}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {2, 4}, {4, 5}, {3, 3}, {5, 4}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {4, 2}, {2, 3}, {1, 5}, {0, 3}, {1, 1}, {3, 2}, {5, 3}, {4, 1}, {2, 2}, {3, 4}, {5, 5}, {4, 3}, {5, 1}, {3, 0}}, 6, 8, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {5, 2}, {4, 4}, {2, 5}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {2, 4}, {4, 5}, {3, 3}, {5, 4}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {4, 2}, {2, 3}, {1, 5}, {0, 3}, {1, 1}, {3, 2}, {5, 3}, {4, 1}, {2, 2}, {3, 4}, {5, 5}, {4, 3}, {5, 1}, {3, 0}}, 9, 6, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {5, 2}, {4, 4}, {2, 5}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {2, 4}, {4, 5}, {3, 3}, {5, 4}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {4, 2}, {2, 3}, {1, 5}, {0, 3}, {1, 1}, {3, 2}, {5, 3}, {4, 1}, {2, 2}, {3, 4}, {5, 5}, {4, 3}, {5, 1}, {3, 0}}, 6, 9, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {2, 1}, {4, 0}, {5, 2}, {4, 4}, {2, 5}, {0, 4}, {1, 2}, {2, 0}, {0, 1}, {1, 3}, {0, 5}, {2, 4}, {4, 5}, {3, 3}, {5, 4}, {3, 5}, {1, 4}, {0, 2}, {1, 0}, {3, 1}, {5, 0}, {4, 2}, {2, 3}, {1, 5}, {0, 3}, {1, 1}, {3, 2}, {5, 3}, {4, 1}, {2, 2}, {3, 4}, {5, 5}, {4, 3}, {5, 1}, {3, 0}}, 9, 9, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
288 | TP3/compression.LZW | C++ | Verifies that the inputs satisfy the problem:
Find a (short) compression that decompresses to the given string for the provided implementation of the
Lempel-Ziv decompression algorithm from https:\/\/en.wikipedia.org\/wiki\/Lempel%E2%80%93Ziv%E2%80%93Welch | /**
* Verifies that the inputs satisfy the problem:
* Find a (short) compression that decompresses to the given string for the provided implementation of the
* Lempel-Ziv decompression algorithm from https:\\/\\/en.wikipedia.org\\/wiki\\/Lempel%E2%80%93Ziv%E2%80%93Welch
*/
bool sat(vector<int> seq, int compressed_len, string text) { | bool sat(vector<int> seq, int compressed_len, string text) { | [
"seq",
"compressed_len",
"text"
] | def sat(seq: List[int], compressed_len, text):
index = [chr(i) for i in range(256)]
pieces = ['']
for i in seq:
pieces.append(pieces[-1] + pieces[-1][0] if i == len(index) else index[i])
index.append(pieces[-2] + pieces[-1][0])
return ''.join(pieces) == text and len(seq) <= compressed_len | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"seq\": [72, 101, 108, 108, 111, 261, 262, 263, 264, 265, 32, 119, 111, 114, 108, 100, 33], \"compressed_len\": 17, \"text\": \"Hellooooooooooooooooooooo world!\"}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"seq\": [], \"compressed_len\": 0, \"text\": \"\"}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"seq\": [99, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 265], \"compressed_len\": 45, \"text\": \"cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\"}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"seq\": [99, 117, 112, 101, 119, 111, 113, 117, 97, 98, 105, 259, 109, 101, 99, 97, 99, 105, 99, 104, 121, 116, 111, 103, 121, 99, 121, 107, 277, 276, 122, 121, 100, 105, 122, 117, 116, 101, 120, 278, 106, 111, 107, 111, 115, 97, 112, 121, 115, 101, 293, 295, 306, 104, 105, 108, 265, 101, 263, 121, 112, 97, 103, 274, 310, 275, 105, 109, 267, 121, 104, 117, 263, 105, 116, 286, 117, 119, 117, 284, 275, 281, 298, 105, 103, 111, 109, 121, 108, 111, 307, 278, 263, 111, 275, 272, 310, 107, 97, 345, 99, 101, 106, 105, 119, 121, 122, 318, 111, 100, 346, 310, 108, 285, 306, 105, 315, 112, 105, 114, 265, 97, 102, 117, 115, 117, 98, 97, 381, 102, 344, 358, 117, 108, 330, 117, 366, 115, 105, 115, 121, 376, 104, 101, 122, 330, 294, 278, 108, 328, 117, 101, 118, 121], \"compressed_len\": 154, \"text\": \"cupewoquabipemecacichytogycykythyzydizutextojokosapysetextethilabequypagichichimipyhuquithyzuwukychycokigomylotextoquochachikalocejiwyzagodothilythetiquypirabafusubasufylejulitudosisyrahezitextoluquevy\"}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"seq\": [115, 105], \"compressed_len\": 2, \"text\": \"si\"}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"seq\": [], \"compressed_len\": 17, \"text\": \"si\"}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"seq\": [], \"compressed_len\": 154, \"text\": \"si\"}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"seq\": [115, 105], \"compressed_len\": 2, \"text\": \"\"}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"seq\": [115, 105], \"compressed_len\": 45, \"text\": \"\"}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a (short) compression that decompresses to the given string for the provided implementation of the\n// Lempel-Ziv decompression algorithm from https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Welch\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> seq, int compressed_len, string text, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(seq, compressed_len, text), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({72, 101, 108, 108, 111, 261, 262, 263, 264, 265, 32, 119, 111, 114, 108, 100, 33}, 17, \"Hellooooooooooooooooooooo world!\", true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 0, \"\", true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({99, 257, 258, 259, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 265}, 45, \"cccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccc\", true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({99, 117, 112, 101, 119, 111, 113, 117, 97, 98, 105, 259, 109, 101, 99, 97, 99, 105, 99, 104, 121, 116, 111, 103, 121, 99, 121, 107, 277, 276, 122, 121, 100, 105, 122, 117, 116, 101, 120, 278, 106, 111, 107, 111, 115, 97, 112, 121, 115, 101, 293, 295, 306, 104, 105, 108, 265, 101, 263, 121, 112, 97, 103, 274, 310, 275, 105, 109, 267, 121, 104, 117, 263, 105, 116, 286, 117, 119, 117, 284, 275, 281, 298, 105, 103, 111, 109, 121, 108, 111, 307, 278, 263, 111, 275, 272, 310, 107, 97, 345, 99, 101, 106, 105, 119, 121, 122, 318, 111, 100, 346, 310, 108, 285, 306, 105, 315, 112, 105, 114, 265, 97, 102, 117, 115, 117, 98, 97, 381, 102, 344, 358, 117, 108, 330, 117, 366, 115, 105, 115, 121, 376, 104, 101, 122, 330, 294, 278, 108, 328, 117, 101, 118, 121}, 154, \"cupewoquabipemecacichytogycykythyzydizutextojokosapysetextethilabequypagichichimipyhuquithyzuwukychycokigomylotextoquochachikalocejiwyzagodothilythetiquypirabafusubasufylejulitudosisyrahezitextoluquevy\", true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({115, 105}, 2, \"si\", true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 17, \"si\", false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 154, \"si\", false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({115, 105}, 2, \"\", false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({115, 105}, 45, \"\", false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
289 | TP3/compression.PackingHam | C++ | Verifies that the inputs satisfy the problem:
Pack a certain number of binary strings so that they have a minimum hamming distance between each other. | /**
* Verifies that the inputs satisfy the problem:
* Pack a certain number of binary strings so that they have a minimum hamming distance between each other.
*/
bool sat(vector<string> words, int num, int bits, int dist) { | bool sat(vector<string> words, int num, int bits, int dist) { | [
"words",
"num",
"bits",
"dist"
] | def sat(words: List[str], num, bits, dist):
if not (len(words) == num and all((len(word) == bits and set(word) <= {'0', '1'} for word in words))):
return False
return all((sum([a != b for (a, b) in zip(words[i], words[j])]) >= dist for i in range(num) for j in range(i))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"words\": [\"110000100000100100110001010011111011011111011111011011000001011000000011111001101\", \"000010100101110100110101110101010100101000101010111100011111001110000011010000010\", \"100000101110001011111011100101000101101001111101001000010010010000101111000111010\", \"111010110001000100110011110101001110000110111100001111100011001011100000111100101\", \"010011011010010111101010001110001001111010110000011001000101001110000011000111001\"], \"num\": 5, \"bits\": 81, \"dist\": 30}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"words\": [\"0110001010011111011011111011111011011000001011000000011111001101\", \"1110001111100111000001101000001011000010000010010100110010101100\", \"0000101001011101001011110011010001101011101010101001010001010101\", \"1111011100101000101101001111101001000010010010000101111000111010\", \"0111110001100101110000011110010110000010111000101110011001100010\", \"1110101100010001011001111011001101100111101010011100001101111000\", \"1101010001110001001111010110000011001000101001110000011000111001\", \"1111011111000001101111011000011101001101101001011110011100001001\", \"0101101110101001000111111010111101111010000000100100001000000100\", \"1110010001000011110111110111100010010101010110001000011001111111\", \"0011011111101011110111001101100111101000011110100001011000010011\", \"0010001110100111011100010001101010000001001100110010100001110110\", \"0010001111000110011000010010111101001000001001101000011001110011\", \"0001100001000110110101000010010011000001011111000110001001111001\", \"1100110010100101101001011010000110011110010011010110111000111100\", \"1111110010111101000001001100001101000000001000010010111011110111\", \"1000100001010110000101110001001011101000111001010010000101101010\", \"1011010010000110001010110010000111111011100101111101010000110101\", \"1001101000010110010000010000011011001111011010100110010110011110\", \"0010010110011111010000110010100111100110111101000101100100001011\", \"0001100101001000100011011110110001001111011001011101010011011001\", \"0001001011100000110010001011001010111010110101100100000011111011\", \"1101100110111000101001110001010011100110000110100100010000011100\", \"0101010010000111110011100001111010101111000110011001001000101010\", \"1000111101001111111100110001111001111000110111100101100001010111\", \"0101101010010010000100011000011100011001110001111000110111110100\", \"0101000011110010010001000101010101101111001001011110001010100010\", \"1010001111110010110010011011111110011100011000110001011010111001\", \"0011010001011000101001110100100011101001101110110001011110111100\", \"1000110101110010001100010000010011110111011100111000001111000001\", \"0111000101010100010110100001001101111010000111010101000000000110\", \"1000010101110111011011101001101011011101100001001111001110011110\", \"0000111111110001100011100000001001000010101011111001111111000011\", \"1110101100100000100000111110011011001110000101100100110110111010\", \"1110101001111110100111010100100110001100011101111000111010100110\", \"0001011111100000101010100011110000000011100110000011110010101000\", \"1101011100010000001101111101000110111000001111101001000011101100\", \"1011010111010011001010110001011001100110000110010100110010110001\", \"1100100011111000111000111101000011010011001010010000101001001100\", \"1010000000010001011010111110010110101011000011000001011010000001\", \"1001110010100101010010011001110100000000010010101110010101000101\", \"1101001111111011111101000111101001111110010110110001111001111111\", \"0101010101001000010110000010001011011110000110110011011100101010\", \"1011101011110011100010010111101000111110011100001111000101101010\", \"1011010000100001111010101110101101010011010000001001011111001010\", \"0001000000011111101111001100110011011110110101110011001111101000\", \"1110101011000001110000010100111100110000111010011100010111001100\", \"0011100011000001100101100010111010010001010010000110001001001111\", \"1100110110101000000001010110110000111101000101011110111011110111\", \"0010010001111010100000110011001111110111101100001011011111010010\", \"1000101100000001011000111100000111001101100111010010101101111101\", \"0001011101011001111011011100001101110010101011100010001001000100\", \"1111111001000011110001001001111000010100100110000001100011010001\", \"1110000000000101101110000110000001010001111011110001100100100010\", \"1111111101111011000100011000111010000010000010000110010111010110\", \"0111110101000001111001100000001011101110110011100011001010001011\", \"0100110100101011100111011110101100011011111010110011011100010001\", \"0100101010000100111010110000001110001101000111111101100110110111\", \"0001111111110011100110000100100110110100111000010011010101111101\", \"0101010100101111001000110011101010001100001001010001011001101010\", \"1110110000011000100011101111101111010000100000001110011001101110\", \"0011010000000101000010010101110010001010010100000000011011000001\", \"1100110010100111010000010100011111110110101111100001111101110010\", \"1000110000010111010001011010011110011010011010100101111110010010\", \"0100100110100011111010000000111010010110011011100001001001110111\", \"0001011101110101001100110110110101110001111010101100110100000101\", \"1100110001000101011110000010000110011000101001100100000101101101\", \"0101000100101001111110110111110001100010100010001110000110100101\", \"0011110111111010101111000000100010010011010111011101110101110010\", \"0010111100010010000001010101010001001010010100110000100011001100\", \"1101001001001011101011001110010000110000011110111111001100100110\", \"0000100001110000111000010101110000101111110011011000000110110101\", \"1111101100110110011101011011100010011100110111101011001111100110\", \"0100001010010011000010110011001110101000000110101101010001110111\", \"0001000110101111100100100011110101111001111111011110111101111100\", \"1010110111000000110110100111101000010110111111101011101010100000\", \"0010000101010110011000111010101111000001111100100101010010111000\", \"0010011001001000111011100011100011100000011101000000010111101011\"], \"num\": 78, \"bits\": 64, \"dist\": 16}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"words\": [\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"], \"num\": 28, \"bits\": 11, \"dist\": 1}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"words\": [\"110000100000110001010011111011011111011111011011000001011000000011111001101\", \"000010100100110101110101010100101000101010111100011111001110000011010000010\", \"100000101111111011100101000101101001111101001000010010010000101111000111010\", \"111010110000110011110101001110000110111100001111100011001011100000111100101\", \"010011011011101010001110001001111010110000011001000101001110000011000111001\", \"010110111010111101000000010010000100000010011110111110000011011110110000111\", \"111010000111110010001000011110111110111100010010101010110001000011001111111\", \"001000111011000000100110011001010000111011000110111111010111101110011011001\"], \"num\": 8, \"bits\": 75, \"dist\": 24}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"words\": [], \"num\": 5, \"bits\": 81, \"dist\": 30}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"words\": [\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"], \"num\": 5, \"bits\": 11, \"dist\": 1}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"words\": [\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"], \"num\": 5, \"bits\": 64, \"dist\": 1}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"words\": [\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"], \"num\": 5, \"bits\": 81, \"dist\": 1}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Pack a certain number of binary strings so that they have a minimum hamming distance between each other.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<string> words, int num, int bits, int dist, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(words, num, bits, dist), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({\"110000100000100100110001010011111011011111011111011011000001011000000011111001101\", \"000010100101110100110101110101010100101000101010111100011111001110000011010000010\", \"100000101110001011111011100101000101101001111101001000010010010000101111000111010\", \"111010110001000100110011110101001110000110111100001111100011001011100000111100101\", \"010011011010010111101010001110001001111010110000011001000101001110000011000111001\"}, 5, 81, 30, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"0110001010011111011011111011111011011000001011000000011111001101\", \"1110001111100111000001101000001011000010000010010100110010101100\", \"0000101001011101001011110011010001101011101010101001010001010101\", \"1111011100101000101101001111101001000010010010000101111000111010\", \"0111110001100101110000011110010110000010111000101110011001100010\", \"1110101100010001011001111011001101100111101010011100001101111000\", \"1101010001110001001111010110000011001000101001110000011000111001\", \"1111011111000001101111011000011101001101101001011110011100001001\", \"0101101110101001000111111010111101111010000000100100001000000100\", \"1110010001000011110111110111100010010101010110001000011001111111\", \"0011011111101011110111001101100111101000011110100001011000010011\", \"0010001110100111011100010001101010000001001100110010100001110110\", \"0010001111000110011000010010111101001000001001101000011001110011\", \"0001100001000110110101000010010011000001011111000110001001111001\", \"1100110010100101101001011010000110011110010011010110111000111100\", \"1111110010111101000001001100001101000000001000010010111011110111\", \"1000100001010110000101110001001011101000111001010010000101101010\", \"1011010010000110001010110010000111111011100101111101010000110101\", \"1001101000010110010000010000011011001111011010100110010110011110\", \"0010010110011111010000110010100111100110111101000101100100001011\", \"0001100101001000100011011110110001001111011001011101010011011001\", \"0001001011100000110010001011001010111010110101100100000011111011\", \"1101100110111000101001110001010011100110000110100100010000011100\", \"0101010010000111110011100001111010101111000110011001001000101010\", \"1000111101001111111100110001111001111000110111100101100001010111\", \"0101101010010010000100011000011100011001110001111000110111110100\", \"0101000011110010010001000101010101101111001001011110001010100010\", \"1010001111110010110010011011111110011100011000110001011010111001\", \"0011010001011000101001110100100011101001101110110001011110111100\", \"1000110101110010001100010000010011110111011100111000001111000001\", \"0111000101010100010110100001001101111010000111010101000000000110\", \"1000010101110111011011101001101011011101100001001111001110011110\", \"0000111111110001100011100000001001000010101011111001111111000011\", \"1110101100100000100000111110011011001110000101100100110110111010\", \"1110101001111110100111010100100110001100011101111000111010100110\", \"0001011111100000101010100011110000000011100110000011110010101000\", \"1101011100010000001101111101000110111000001111101001000011101100\", \"1011010111010011001010110001011001100110000110010100110010110001\", \"1100100011111000111000111101000011010011001010010000101001001100\", \"1010000000010001011010111110010110101011000011000001011010000001\", \"1001110010100101010010011001110100000000010010101110010101000101\", \"1101001111111011111101000111101001111110010110110001111001111111\", \"0101010101001000010110000010001011011110000110110011011100101010\", \"1011101011110011100010010111101000111110011100001111000101101010\", \"1011010000100001111010101110101101010011010000001001011111001010\", \"0001000000011111101111001100110011011110110101110011001111101000\", \"1110101011000001110000010100111100110000111010011100010111001100\", \"0011100011000001100101100010111010010001010010000110001001001111\", \"1100110110101000000001010110110000111101000101011110111011110111\", \"0010010001111010100000110011001111110111101100001011011111010010\", \"1000101100000001011000111100000111001101100111010010101101111101\", \"0001011101011001111011011100001101110010101011100010001001000100\", \"1111111001000011110001001001111000010100100110000001100011010001\", \"1110000000000101101110000110000001010001111011110001100100100010\", \"1111111101111011000100011000111010000010000010000110010111010110\", \"0111110101000001111001100000001011101110110011100011001010001011\", \"0100110100101011100111011110101100011011111010110011011100010001\", \"0100101010000100111010110000001110001101000111111101100110110111\", \"0001111111110011100110000100100110110100111000010011010101111101\", \"0101010100101111001000110011101010001100001001010001011001101010\", \"1110110000011000100011101111101111010000100000001110011001101110\", \"0011010000000101000010010101110010001010010100000000011011000001\", \"1100110010100111010000010100011111110110101111100001111101110010\", \"1000110000010111010001011010011110011010011010100101111110010010\", \"0100100110100011111010000000111010010110011011100001001001110111\", \"0001011101110101001100110110110101110001111010101100110100000101\", \"1100110001000101011110000010000110011000101001100100000101101101\", \"0101000100101001111110110111110001100010100010001110000110100101\", \"0011110111111010101111000000100010010011010111011101110101110010\", \"0010111100010010000001010101010001001010010100110000100011001100\", \"1101001001001011101011001110010000110000011110111111001100100110\", \"0000100001110000111000010101110000101111110011011000000110110101\", \"1111101100110110011101011011100010011100110111101011001111100110\", \"0100001010010011000010110011001110101000000110101101010001110111\", \"0001000110101111100100100011110101111001111111011110111101111100\", \"1010110111000000110110100111101000010110111111101011101010100000\", \"0010000101010110011000111010101111000001111100100101010010111000\", \"0010011001001000111011100011100011100000011101000000010111101011\"}, 78, 64, 16, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"}, 28, 11, 1, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"110000100000110001010011111011011111011111011011000001011000000011111001101\", \"000010100100110101110101010100101000101010111100011111001110000011010000010\", \"100000101111111011100101000101101001111101001000010010010000101111000111010\", \"111010110000110011110101001110000110111100001111100011001011100000111100101\", \"010011011011101010001110001001111010110000011001000101001110000011000111001\", \"010110111010111101000000010010000100000010011110111110000011011110110000111\", \"111010000111110010001000011110111110111100010010101010110001000011001111111\", \"001000111011000000100110011001010000111011000110111111010111101110011011001\"}, 8, 75, 24, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 5, 81, 30, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"}, 5, 11, 1, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"}, 5, 64, 1, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({\"11011000001\", \"01100010100\", \"11000010000\", \"11100011111\", \"01101011101\", \"00001010010\", \"01000010010\", \"11110111001\", \"10000010111\", \"01111100011\", \"01100111101\", \"11101011000\", \"11001000101\", \"11010100011\", \"01001101101\", \"11110111110\", \"01111010000\", \"01011011101\", \"10010101010\", \"11100100010\", \"11101000011\", \"00110111111\", \"10000001001\", \"00100011101\", \"01001000001\", \"00100011110\", \"11000001011\", \"00011000010\"}, 5, 81, 1, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
290 | TP3/conways_game_of_life.Oscillators | C++ | Verifies that the inputs satisfy the problem:
Find a pattern in Conway's Game of Life https:\/\/en.wikipedia.org\/wiki\/Conway%27s_Game_of_Life that repeats
with a certain period https:\/\/en.wikipedia.org\/wiki\/Oscillator_%28cellular_automaton%29#:~:text=Game%20of%20Life | /**
* Verifies that the inputs satisfy the problem:
* Find a pattern in Conway's Game of Life https:\\/\\/en.wikipedia.org\\/wiki\\/Conway%27s_Game_of_Life that repeats
* with a certain period https:\\/\\/en.wikipedia.org\\/wiki\\/Oscillator_%28cellular_automaton%29#:~:text=Game%20of%20Life
*/
bool sat(vector<vector<int>> init, int period) { | bool sat(vector<vector<int>> init, int period) { | [
"init",
"period"
] | def sat(init: List[List[int]], period):
target = {x + y * 1j for (x, y) in init}
deltas = (1j, -1j, 1, -1, 1 + 1j, 1 - 1j, -1 + 1j, -1 - 1j)
live = target
for t in range(period):
visible = {z + d for z in live for d in deltas}
live = {z for z in visible if sum((z + d in live for d in deltas)) in ([2, 3] if z in live else [3])}
if live == target:
return t + 1 == period | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"init\": [[-6, 2], [6, -2], [-1, 2], [-6, 4], [1, 2], [-1, 4], [6, 2], [1, 4], [-4, 6], [-3, 6], [-2, 6], [6, 4], [2, 6], [3, 6], [4, 6], [-6, -3], [-1, -2], [-1, -3], [1, -3], [6, -3], [-4, 1], [-3, 1], [-2, 1], [-6, 3], [2, 1], [3, 1], [4, 1], [-1, 3], [1, 3], [6, 3], [-4, -6], [-3, -6], [-2, -6], [-6, -4], [2, -6], [3, -6], [4, -6], [-1, -4], [-6, -2], [1, -4], [-4, -1], [-3, -1], [-2, -1], [6, -4], [1, -2], [2, -1], [3, -1], [4, -1]], \"period\": 3}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"init\": [], \"period\": 1}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"init\": [[-1, -7], [0, -7], [1, -7], [-1, 7], [0, 7], [1, 7]], \"period\": 2}}, {\"idx\": 3, \"outputs\": false, \"inputs\": {\"init\": [], \"period\": 3}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"init\": [], \"period\": 2}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"init\": [[-1, -7], [0, -7], [1, -7], [-1, 7], [0, 7], [1, 7]], \"period\": 3}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"init\": [], \"period\": 3}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a pattern in Conway's Game of Life https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life that repeats\n// with a certain period https://en.wikipedia.org/wiki/Oscillator_%28cellular_automaton%29#:~:text=Game%20of%20Life\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> init, int period, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(init, period), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{-6, 2}, {6, -2}, {-1, 2}, {-6, 4}, {1, 2}, {-1, 4}, {6, 2}, {1, 4}, {-4, 6}, {-3, 6}, {-2, 6}, {6, 4}, {2, 6}, {3, 6}, {4, 6}, {-6, -3}, {-1, -2}, {-1, -3}, {1, -3}, {6, -3}, {-4, 1}, {-3, 1}, {-2, 1}, {-6, 3}, {2, 1}, {3, 1}, {4, 1}, {-1, 3}, {1, 3}, {6, 3}, {-4, -6}, {-3, -6}, {-2, -6}, {-6, -4}, {2, -6}, {3, -6}, {4, -6}, {-1, -4}, {-6, -2}, {1, -4}, {-4, -1}, {-3, -1}, {-2, -1}, {6, -4}, {1, -2}, {2, -1}, {3, -1}, {4, -1}}, 3, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 1, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{-1, -7}, {0, -7}, {1, -7}, {-1, 7}, {0, 7}, {1, 7}}, 2, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 3, false); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 2, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{-1, -7}, {0, -7}, {1, -7}, {-1, 7}, {0, 7}, {1, 7}}, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 3, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
291 | TP3/conways_game_of_life.ReverseLifeStep | C++ | Verifies that the inputs satisfy the problem:
Given a target pattern in Conway's Game of Life (see https:\/\/en.wikipedia.org\/wiki\/Conway%27s_Game_of_Life ),
specified by [x,y] coordinates of live cells, find a position that leads to that pattern on the next step. | /**
* Verifies that the inputs satisfy the problem:
* Given a target pattern in Conway's Game of Life (see https:\\/\\/en.wikipedia.org\\/wiki\\/Conway%27s_Game_of_Life ),
* specified by [x,y] coordinates of live cells, find a position that leads to that pattern on the next step.
*/
bool sat(vector<vector<int>> position, vector<vector<int>> target) { | bool sat(vector<vector<int>> position, vector<vector<int>> target) { | [
"position",
"target"
] | def sat(position: List[List[int]], target):
live = {x + y * 1j for (x, y) in position}
deltas = (1j, -1j, 1, -1, 1 + 1j, 1 - 1j, -1 + 1j, -1 - 1j)
visible = {z + d for z in live for d in deltas}
next_step = {z for z in visible if sum((z + d in live for d in deltas)) in ([2, 3] if z in live else [3])}
return next_step == {x + y * 1j for (x, y) in target} | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"position\": [[-3, 3], [0, 3], [-2, 4], [1, 4], [2, 4], [-3, 7], [3, 6], [0, 11], [3, -7], [4, -6], [-3, -2], [4, -4], [-4, -3]], \"target\": [[1, 3], [1, 4], [2, 5]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"position\": [], \"target\": []}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"position\": [[-1, -4], [0, -4], [1, -4], [-1, -3], [0, -2]], \"target\": [[-1, -4], [-1, -3], [0, -5], [0, -4], [1, -3]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"position\": [[4, 4], [4, 2], [1, 3], [2, 4]], \"target\": [[3, 3]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"position\": [[5, -8], [4, -7], [0, -4], [2, -5], [0, -3]], \"target\": [[1, -4]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"position\": [], \"target\": [[1, 3], [1, 4], [2, 5]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"position\": [], \"target\": [[3, 3]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"position\": [[4, 4], [4, 2], [1, 3], [2, 4]], \"target\": []}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"position\": [], \"target\": [[1, 3], [1, 4], [2, 5]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Given a target pattern in Conway's Game of Life (see https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life ),\n// specified by [x,y] coordinates of live cells, find a position that leads to that pattern on the next step.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> position, vector<vector<int>> target, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(position, target), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{-3, 3}, {0, 3}, {-2, 4}, {1, 4}, {2, 4}, {-3, 7}, {3, 6}, {0, 11}, {3, -7}, {4, -6}, {-3, -2}, {4, -4}, {-4, -3}}, {{1, 3}, {1, 4}, {2, 5}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{-1, -4}, {0, -4}, {1, -4}, {-1, -3}, {0, -2}}, {{-1, -4}, {-1, -3}, {0, -5}, {0, -4}, {1, -3}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{4, 4}, {4, 2}, {1, 3}, {2, 4}}, {{3, 3}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{5, -8}, {4, -7}, {0, -4}, {2, -5}, {0, -3}}, {{1, -4}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {{1, 3}, {1, 4}, {2, 5}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {{3, 3}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{4, 4}, {4, 2}, {1, 3}, {2, 4}}, {}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, {{1, 3}, {1, 4}, {2, 5}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
292 | TP3/games.Nim | C++ | Verifies that the inputs satisfy the problem:
Beat a bot at Nim, a two-player game involving a number of heaps of objects. Players alternate, in each turn
removing one or more objects from a single non-empty heap. The player who takes the last object wins.
- initial_state is vector of numbers of objects in each heap
- moves is vector of your moves: [heap, number of objects to take]
- you play first | /**
* Verifies that the inputs satisfy the problem:
* Beat a bot at Nim, a two-player game involving a number of heaps of objects. Players alternate, in each turn
* removing one or more objects from a single non-empty heap. The player who takes the last object wins.
* - initial_state is vector of numbers of objects in each heap
* - moves is vector of your moves: [heap, number of objects to take]
* - you play first
*/
bool sat(vector<vector<int>> moves, vector<int> initial_state) { | bool sat(vector<vector<int>> moves, vector<int> initial_state) { | [
"moves",
"initial_state"
] | def sat(moves: List[List[int]], initial_state):
def bot_move():
vals = sorted(state, reverse=True)
i_largest = state.index(vals[0])
state[i_largest] -= max(vals[0] - vals[1], 1)
state = initial_state[:]
for (i, n) in moves:
if not 0 < n <= state[i]:
return False
state[i] -= n
if set(state) == {0}:
return True
if not any(state):
return False
bot_move() | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"moves\": [[1, 9], [3, 11], [2, 3], [7, 1], [0, 1], [6, 1], [5, 1], [5, 1], [5, 1], [5, 1], [0, 1], [8, 1], [0, 1], [7, 1], [0, 1], [8, 3], [0, 1], [9, 1], [5, 1], [5, 1], [5, 1], [5, 1], [5, 1], [5, 1], [5, 1], [5, 1]], \"initial_state\": [5, 9, 3, 11, 18, 25, 1, 2, 4, 1]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"moves\": [[6, 1], [1, 1], [5, 1], [4, 1], [6, 1], [5, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1]], \"initial_state\": [4, 1, 8, 0, 5, 9, 2, 0]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"moves\": [[0, 1], [2, 2], [0, 1], [2, 1], [3, 1], [3, 1], [3, 1], [3, 1]], \"initial_state\": [2, 5, 3, 7, 0]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"moves\": [[5, 5], [1, 1], [5, 1], [1, 1], [3, 1], [5, 1], [1, 1], [3, 1], [5, 1]], \"initial_state\": [3, 3, 2, 2, 3, 8]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"moves\": [[1, 2], [2, 3], [1, 1], [1, 1], [1, 1], [1, 1], [1, 1]], \"initial_state\": [5, 8, 3, 0]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"moves\": [[0, 1], [2, 2], [0, 1], [2, 1], [3, 1], [3, 1], [3, 1], [3, 1]], \"initial_state\": [5, 8, 3, 0]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"moves\": [[1, 2], [2, 3], [1, 1], [1, 1], [1, 1], [1, 1], [1, 1]], \"initial_state\": [2, 5, 3, 7, 0]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"moves\": [[0, 1], [2, 2], [0, 1], [2, 1], [3, 1], [3, 1], [3, 1], [3, 1]], \"initial_state\": [4, 1, 8, 0, 5, 9, 2, 0]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"moves\": [[6, 1], [1, 1], [5, 1], [4, 1], [6, 1], [5, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1], [2, 1], [5, 1]], \"initial_state\": [5, 9, 3, 11, 18, 25, 1, 2, 4, 1]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Beat a bot at Nim, a two-player game involving a number of heaps of objects. Players alternate, in each turn\n// removing one or more objects from a single non-empty heap. The player who takes the last object wins.\n// - initial_state is list of numbers of objects in each heap\n// - moves is a list of your moves: [heap, number of objects to take]\n// - you play first\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> moves, vector<int> initial_state, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(moves, initial_state), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{1, 9}, {3, 11}, {2, 3}, {7, 1}, {0, 1}, {6, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}, {0, 1}, {8, 1}, {0, 1}, {7, 1}, {0, 1}, {8, 3}, {0, 1}, {9, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}, {5, 1}}, {5, 9, 3, 11, 18, 25, 1, 2, 4, 1}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{6, 1}, {1, 1}, {5, 1}, {4, 1}, {6, 1}, {5, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}}, {4, 1, 8, 0, 5, 9, 2, 0}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {2, 2}, {0, 1}, {2, 1}, {3, 1}, {3, 1}, {3, 1}, {3, 1}}, {2, 5, 3, 7, 0}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{5, 5}, {1, 1}, {5, 1}, {1, 1}, {3, 1}, {5, 1}, {1, 1}, {3, 1}, {5, 1}}, {3, 3, 2, 2, 3, 8}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{1, 2}, {2, 3}, {1, 1}, {1, 1}, {1, 1}, {1, 1}, {1, 1}}, {5, 8, 3, 0}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {2, 2}, {0, 1}, {2, 1}, {3, 1}, {3, 1}, {3, 1}, {3, 1}}, {5, 8, 3, 0}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{1, 2}, {2, 3}, {1, 1}, {1, 1}, {1, 1}, {1, 1}, {1, 1}}, {2, 5, 3, 7, 0}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 1}, {2, 2}, {0, 1}, {2, 1}, {3, 1}, {3, 1}, {3, 1}, {3, 1}}, {4, 1, 8, 0, 5, 9, 2, 0}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{6, 1}, {1, 1}, {5, 1}, {4, 1}, {6, 1}, {5, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}, {2, 1}, {5, 1}}, {5, 9, 3, 11, 18, 25, 1, 2, 4, 1}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
293 | TP3/games.RockPaperScissors | C++ | Verifies that the inputs satisfy the problem:
Find optimal probabilities for playing Rock-Paper-Scissors zero-sum game, with best worst-case guarantee | /**
* Verifies that the inputs satisfy the problem:
* Find optimal probabilities for playing Rock-Paper-Scissors zero-sum game, with best worst-case guarantee
*/
bool sat(vector<double> probs) { | bool sat(vector<double> probs) { | [
"probs"
] | def sat(probs: List[float]):
if not (len(probs) == 3 and abs(sum(probs) - 1) < 1e-06):
return False
return max((probs[(i + 2) % 3] - probs[(i + 1) % 3] for i in range(3))) < 1e-06 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"probs\": [0.3333333333333333, 0.3333333333333333, 0.3333333333333333]}}, {\"idx\": 1, \"outputs\": false, \"inputs\": {\"probs\": []}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find optimal probabilities for playing Rock-Paper-Scissors zero-sum game, with best worst-case guarantee\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<double> probs, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(probs), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0.3333333333333333, 0.3333333333333333, 0.3333333333333333}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, false); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
294 | TP3/games.Nash | C++ | Verifies that the inputs satisfy the problem:
Find an eps-Nash-equilibrium for a given two-player game with payoffs described by matrices A, B.
For example, for the classic Prisoner dilemma:
A=[[-1., -3.], [0., -2.]], B=[[-1., 0.], [-3., -2.]], and strategies = [[0, 1], [0, 1]]
eps is the error tolerance | /**
* Verifies that the inputs satisfy the problem:
* Find an eps-Nash-equilibrium for a given two-player game with payoffs described by matrices A, B.
* For example, for the classic Prisoner dilemma:
* A=[[-1., -3.], [0., -2.]], B=[[-1., 0.], [-3., -2.]], and strategies = [[0, 1], [0, 1]]
* eps is the error tolerance
*/
bool sat(vector<vector<double>> strategies, vector<vector<double>> a, vector<vector<double>> b, float eps) { | bool sat(vector<vector<double>> strategies, vector<vector<double>> a, vector<vector<double>> b, float eps) { | [
"strategies",
"a",
"b",
"eps"
] | def sat(strategies: List[List[float]], a, b, eps):
(m, n) = (len(a), len(a[0]))
(p, q) = strategies
if not (len(b) == m and all((len(row) == n for row in a + b))):
return False
if not (len(p) == m and len(q) == n):
return False
if not (sum(p) == sum(q) == 1.0 and min(p + q) >= 0.0):
return False
v = sum((a[i][j] * p[i] * q[j] for i in range(m) for j in range(n)))
w = sum((b[i][j] * p[i] * q[j] for i in range(m) for j in range(n)))
return all((sum((a[i][j] * q[j] for j in range(n))) <= v + eps for i in range(m))) and all((sum((b[i][j] * p[i] for i in range(m))) <= w + eps for j in range(n))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"strategies\": [[0.42960486365369255, 0.5703951363463075], [0.4361488482822452, 0.5638511517177548]], \"a\": [[1.0, -1.0], [-1.3, 0.8]], \"b\": [[-0.9, 1.1], [0.7, -0.8]], \"eps\": 0.01}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"strategies\": [[0.4354633944760987, 0.5645366055239013], [0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348]], \"a\": [[0.9394017211111316, 0.5326904938119557, 0.617450333400489, 0.07750724076509141], [0.756918495043564, 0.5987975773955155, 0.28503122921448076, 0.7148712045728678]], \"b\": [[0.47704793270151036, 0.9967233100094641, 0.43547864272640946, 0.9382488381534949], [0.48601490893804844, 0.3087161727805493, 0.6280353585345546, 0.15082948768323623]], \"eps\": 0.1}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"strategies\": [[0.5717710105617204, 0.4282289894382796], [0.0, 1.0]], \"a\": [[0.9444870024490782, 0.7161326423023922], [0.7473004023372711, 0.11785202213841373]], \"b\": [[0.8988707260215308, 0.8870580242476404], [0.6443468211990571, 0.10176972379787386]], \"eps\": 0.5}}, {\"idx\": 3, \"outputs\": false, \"inputs\": {\"strategies\": [[0.5717710105617204, 0.4282289894382796], [0.0, 1.0]], \"a\": [[0.9444870024490782, 0.7161326423023922], [0.7473004023372711, 0.11785202213841373]], \"b\": [[-0.9, 1.1], [0.7, -0.8]], \"eps\": 0.1}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"strategies\": [[0.4354633944760987, 0.5645366055239013], [0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348]], \"a\": [[1.0, -1.0], [-1.3, 0.8]], \"b\": [[-0.9, 1.1], [0.7, -0.8]], \"eps\": 0.1}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"strategies\": [[0.5717710105617204, 0.4282289894382796], [0.0, 1.0]], \"a\": [[1.0, -1.0], [-1.3, 0.8]], \"b\": [[-0.9, 1.1], [0.7, -0.8]], \"eps\": 0.1}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"strategies\": [[0.4354633944760987, 0.5645366055239013], [0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348]], \"a\": [[1.0, -1.0], [-1.3, 0.8]], \"b\": [[-0.9, 1.1], [0.7, -0.8]], \"eps\": 0.01}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find an eps-Nash-equilibrium for a given two-player game with payoffs described by matrices A, B.\n// For example, for the classic Prisoner dilemma:\n// A=[[-1., -3.], [0., -2.]], B=[[-1., 0.], [-3., -2.]], and strategies = [[0, 1], [0, 1]]\n// eps is the error tolerance\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<double>> strategies, vector<vector<double>> a, vector<vector<double>> b, float eps, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(strategies, a, b, eps), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0.42960486365369255, 0.5703951363463075}, {0.4361488482822452, 0.5638511517177548}}, {{1.0, -1.0}, {-1.3, 0.8}}, {{-0.9, 1.1}, {0.7, -0.8}}, 0.01, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.4354633944760987, 0.5645366055239013}, {0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348}}, {{0.9394017211111316, 0.5326904938119557, 0.617450333400489, 0.07750724076509141}, {0.756918495043564, 0.5987975773955155, 0.28503122921448076, 0.7148712045728678}}, {{0.47704793270151036, 0.9967233100094641, 0.43547864272640946, 0.9382488381534949}, {0.48601490893804844, 0.3087161727805493, 0.6280353585345546, 0.15082948768323623}}, 0.1, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.5717710105617204, 0.4282289894382796}, {0.0, 1.0}}, {{0.9444870024490782, 0.7161326423023922}, {0.7473004023372711, 0.11785202213841373}}, {{0.8988707260215308, 0.8870580242476404}, {0.6443468211990571, 0.10176972379787386}}, 0.5, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.5717710105617204, 0.4282289894382796}, {0.0, 1.0}}, {{0.9444870024490782, 0.7161326423023922}, {0.7473004023372711, 0.11785202213841373}}, {{-0.9, 1.1}, {0.7, -0.8}}, 0.1, false); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.4354633944760987, 0.5645366055239013}, {0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348}}, {{1.0, -1.0}, {-1.3, 0.8}}, {{-0.9, 1.1}, {0.7, -0.8}}, 0.1, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.5717710105617204, 0.4282289894382796}, {0.0, 1.0}}, {{1.0, -1.0}, {-1.3, 0.8}}, {{-0.9, 1.1}, {0.7, -0.8}}, 0.1, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.4354633944760987, 0.5645366055239013}, {0.0, 0.2828159025289151, 0.49078428558568143, 0.22639981188540348}}, {{1.0, -1.0}, {-1.3, 0.8}}, {{-0.9, 1.1}, {0.7, -0.8}}, 0.01, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
295 | TP3/games.ZeroSum | C++ | Verifies that the inputs satisfy the problem:
Compute minimax optimal strategies for a given zero-sum game up to error tolerance eps.
For example, rock paper scissors has
A = [[0., -1., 1.], [1., 0., -1.], [-1., 1., 0.]] and strategies = [[0.33, 0.33, 0.34]] * 2 | /**
* Verifies that the inputs satisfy the problem:
* Compute minimax optimal strategies for a given zero-sum game up to error tolerance eps.
* For example, rock paper scissors has
* A = [[0., -1., 1.], [1., 0., -1.], [-1., 1., 0.]] and strategies = [[0.33, 0.33, 0.34]] * 2
*/
bool sat(vector<vector<double>> strategies, vector<vector<float>> a, float eps) { | bool sat(vector<vector<double>> strategies, vector<vector<float>> a, float eps) { | [
"strategies",
"a",
"eps"
] | def sat(strategies: List[List[float]], a, eps):
(m, n) = (len(a), len(a[0]))
(p, q) = strategies
if not all((len(row) == n for row in a)):
return False
if not (len(p) == m and len(q) == n):
return False
if not (sum(p) == sum(q) == 1.0 and min(p + q) >= 0.0):
return False
v = sum((a[i][j] * p[i] * q[j] for i in range(m) for j in range(n)))
return all((sum((a[i][j] * q[j] for j in range(n))) <= v + eps for i in range(m))) and all((sum((a[i][j] * p[i] for i in range(m))) >= v - eps for j in range(n))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"strategies\": [[0.3395291201141192, 0.35390334563719866, 0.3065675342486822], [0.2441140024178156, 0.5226765797961148, 0.23320941778606952]], \"a\": [[0.0, -0.5, 1.0], [0.75, 0.0, -1.0], [-1.0, 0.4, 0.0]], \"eps\": 0.01}}, {\"idx\": 1, \"outputs\": false, \"inputs\": {\"strategies\": [[0.3, 0.2, 0.5], [0.3, 0.2, 0.5]], \"a\": [[0.0, -0.5, 1.0], [0.75, 0.0, -1.0], [-1.0, 0.4, 0.0]], \"eps\": 0.01}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Compute minimax optimal strategies for a given zero-sum game up to error tolerance eps.\n// For example, rock paper scissors has\n// A = [[0., -1., 1.], [1., 0., -1.], [-1., 1., 0.]] and strategies = [[0.33, 0.33, 0.34]] * 2\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<double>> strategies, vector<vector<float>> a, float eps, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(strategies, a, eps), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0.3395291201141192, 0.35390334563719866, 0.3065675342486822}, {0.2441140024178156, 0.5226765797961148, 0.23320941778606952}}, {{0.0, -0.5, 1.0}, {0.75, 0.0, -1.0}, {-1.0, 0.4, 0.0}}, 0.01, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0.3, 0.2, 0.5}, {0.3, 0.2, 0.5}}, {{0.0, -0.5, 1.0}, {0.75, 0.0, -1.0}, {-1.0, 0.4, 0.0}}, 0.01, false); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
296 | TP3/graphs.AnyEdge | C++ | Verifies that the inputs satisfy the problem:
Find any edge in edges. | /**
* Verifies that the inputs satisfy the problem:
* Find any edge in edges.
*/
bool sat(vector<int> e, vector<vector<int>> edges) { | bool sat(vector<int> e, vector<vector<int>> edges) { | [
"e",
"edges"
] | def sat(e: List[int], edges):
return e in edges | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"e\": [0, 217], \"edges\": [[0, 217], [40, 11], [17, 29], [11, 12], [31, 51]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"e\": [0, 1], \"edges\": [[0, 1], [1, 1], [0, 0]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"e\": [1, 0], \"edges\": [[1, 0], [0, 1], [1, 1]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"e\": [1, 15], \"edges\": [[1, 15], [15, 3], [5, 12], [11, 0], [8, 5], [1, 9], [3, 6], [5, 10], [12, 0], [6, 6], [9, 2], [13, 15], [2, 9], [5, 1], [10, 11], [4, 12], [0, 6], [8, 12], [15, 14], [1, 13], [11, 7], [15, 4], [13, 5], [7, 14], [14, 5], [12, 2], [7, 8], [2, 14], [3, 15], [2, 2], [7, 2], [3, 4], [4, 2], [1, 3], [4, 4], [3, 11], [14, 6], [14, 8], [14, 12], [7, 15], [7, 3], [7, 10], [10, 8], [7, 13], [2, 15], [14, 0], [1, 5], [11, 15], [1, 8], [6, 4], [15, 8], [9, 3], [1, 10], [2, 3], [4, 13], [7, 5], [2, 11], [0, 1], [15, 6], [0, 2], [5, 5]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"e\": [7, 84], \"edges\": [[7, 84], [72, 0], [65, 93], [66, 13], [39, 15], [91, 6], [16, 77], [43, 71], [34, 72], [83, 1], [91, 93], [41, 20], [71, 69], [51, 60], [75, 22], [25, 82], [93, 45], [54, 31], [38, 22], [76, 33], [18, 81], [91, 74], [28, 97], [39, 69], [15, 26], [83, 75], [57, 24], [94, 38], [26, 23], [40, 48], [37, 20], [90, 84], [75, 8], [36, 21], [93, 11], [97, 74], [79, 74], [69, 36], [3, 29], [66, 82], [49, 15], [52, 43], [76, 25], [39, 11], [9, 93], [68, 55], [53, 46], [29, 90], [12, 81], [44, 66], [54, 55], [2, 30], [1, 6], [8, 61], [67, 10], [61, 84], [72, 51], [13, 27], [93, 53], [44, 38], [86, 14], [90, 8], [22, 62], [5, 72], [63, 36], [31, 51], [83, 5], [36, 53], [92, 78], [44, 80], [23, 16], [43, 16], [18, 37], [34, 14], [23, 6], [19, 61], [59, 10], [85, 30], [25, 80], [76, 39], [21, 28], [60, 47], [15, 43], [26, 80], [59, 19], [83, 81], [4, 64], [3, 71], [52, 34], [90, 14], [44, 84], [37, 56], [76, 10], [69, 89], [30, 38], [17, 38], [42, 7], [79, 62], [15, 87], [45, 4], [96, 0], [44, 43], [84, 42], [26, 22], [1, 91], [1, 11], [68, 7], [72, 32], [8, 0], [64, 59], [16, 86], [25, 46], [65, 30], [10, 43], [89, 43], [55, 0], [91, 66], [49, 0], [22, 77], [80, 21], [16, 58], [55, 45], [64, 13], [55, 56], [89, 96], [84, 20], [11, 74], [92, 91], [36, 15], [51, 8], [4, 44], [55, 55], [6, 83], [76, 5], [3, 11], [15, 96], [18, 15], [43, 58], [19, 70], [87, 41], [43, 47], [2, 51], [47, 32], [14, 93], [27, 61], [21, 26], [78, 88], [52, 40], [21, 79], [12, 8], [74, 73], [5, 22], [50, 4], [15, 67], [87, 10], [90, 24], [17, 45], [75, 96], [27, 81], [76, 29], [52, 93], [74, 40], [48, 62], [5, 75], [68, 58], [61, 19], [56, 54], [4, 29], [26, 60], [24, 1], [37, 41], [95, 63], [49, 37], [81, 18], [79, 91], [82, 8], [29, 73], [55, 84], [18, 13], [32, 7], [77, 63], [26, 72], [90, 5], [95, 4], [46, 13], [0, 64], [84, 34], [52, 51], [32, 30], [24, 55], [51, 17], [12, 7], [73, 34], [54, 47], [96, 95], [65, 67], [46, 90], [58, 17], [54, 2], [45, 10], [84, 45], [46, 6], [0, 4], [16, 60], [50, 35], [86, 45], [89, 19], [48, 10], [4, 57], [43, 62], [19, 30], [2, 35], [83, 68], [36, 26], [69, 4], [41, 82], [12, 52], [77, 95], [90, 75], [78, 58], [93, 29], [38, 87], [15, 82], [42, 86], [39, 90], [20, 53], [79, 25], [68, 81], [64, 82], [45, 56], [14, 85], [97, 13], [46, 15], [46, 43], [8, 71], [90, 72], [97, 66], [80, 57], [25, 8], [90, 74]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"e\": [1, 0], \"edges\": [[0, 1], [1, 1], [0, 0]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"e\": [0, 217], \"edges\": []}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"e\": [7, 84], \"edges\": [[0, 1], [1, 1], [0, 0]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"e\": [1, 15], \"edges\": [[1, 0], [0, 1], [1, 1]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find any edge in edges.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> e, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(e, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 217}, {{0, 217}, {40, 11}, {17, 29}, {11, 12}, {31, 51}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1}, {{0, 1}, {1, 1}, {0, 0}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 0}, {{1, 0}, {0, 1}, {1, 1}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 15}, {{1, 15}, {15, 3}, {5, 12}, {11, 0}, {8, 5}, {1, 9}, {3, 6}, {5, 10}, {12, 0}, {6, 6}, {9, 2}, {13, 15}, {2, 9}, {5, 1}, {10, 11}, {4, 12}, {0, 6}, {8, 12}, {15, 14}, {1, 13}, {11, 7}, {15, 4}, {13, 5}, {7, 14}, {14, 5}, {12, 2}, {7, 8}, {2, 14}, {3, 15}, {2, 2}, {7, 2}, {3, 4}, {4, 2}, {1, 3}, {4, 4}, {3, 11}, {14, 6}, {14, 8}, {14, 12}, {7, 15}, {7, 3}, {7, 10}, {10, 8}, {7, 13}, {2, 15}, {14, 0}, {1, 5}, {11, 15}, {1, 8}, {6, 4}, {15, 8}, {9, 3}, {1, 10}, {2, 3}, {4, 13}, {7, 5}, {2, 11}, {0, 1}, {15, 6}, {0, 2}, {5, 5}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 84}, {{7, 84}, {72, 0}, {65, 93}, {66, 13}, {39, 15}, {91, 6}, {16, 77}, {43, 71}, {34, 72}, {83, 1}, {91, 93}, {41, 20}, {71, 69}, {51, 60}, {75, 22}, {25, 82}, {93, 45}, {54, 31}, {38, 22}, {76, 33}, {18, 81}, {91, 74}, {28, 97}, {39, 69}, {15, 26}, {83, 75}, {57, 24}, {94, 38}, {26, 23}, {40, 48}, {37, 20}, {90, 84}, {75, 8}, {36, 21}, {93, 11}, {97, 74}, {79, 74}, {69, 36}, {3, 29}, {66, 82}, {49, 15}, {52, 43}, {76, 25}, {39, 11}, {9, 93}, {68, 55}, {53, 46}, {29, 90}, {12, 81}, {44, 66}, {54, 55}, {2, 30}, {1, 6}, {8, 61}, {67, 10}, {61, 84}, {72, 51}, {13, 27}, {93, 53}, {44, 38}, {86, 14}, {90, 8}, {22, 62}, {5, 72}, {63, 36}, {31, 51}, {83, 5}, {36, 53}, {92, 78}, {44, 80}, {23, 16}, {43, 16}, {18, 37}, {34, 14}, {23, 6}, {19, 61}, {59, 10}, {85, 30}, {25, 80}, {76, 39}, {21, 28}, {60, 47}, {15, 43}, {26, 80}, {59, 19}, {83, 81}, {4, 64}, {3, 71}, {52, 34}, {90, 14}, {44, 84}, {37, 56}, {76, 10}, {69, 89}, {30, 38}, {17, 38}, {42, 7}, {79, 62}, {15, 87}, {45, 4}, {96, 0}, {44, 43}, {84, 42}, {26, 22}, {1, 91}, {1, 11}, {68, 7}, {72, 32}, {8, 0}, {64, 59}, {16, 86}, {25, 46}, {65, 30}, {10, 43}, {89, 43}, {55, 0}, {91, 66}, {49, 0}, {22, 77}, {80, 21}, {16, 58}, {55, 45}, {64, 13}, {55, 56}, {89, 96}, {84, 20}, {11, 74}, {92, 91}, {36, 15}, {51, 8}, {4, 44}, {55, 55}, {6, 83}, {76, 5}, {3, 11}, {15, 96}, {18, 15}, {43, 58}, {19, 70}, {87, 41}, {43, 47}, {2, 51}, {47, 32}, {14, 93}, {27, 61}, {21, 26}, {78, 88}, {52, 40}, {21, 79}, {12, 8}, {74, 73}, {5, 22}, {50, 4}, {15, 67}, {87, 10}, {90, 24}, {17, 45}, {75, 96}, {27, 81}, {76, 29}, {52, 93}, {74, 40}, {48, 62}, {5, 75}, {68, 58}, {61, 19}, {56, 54}, {4, 29}, {26, 60}, {24, 1}, {37, 41}, {95, 63}, {49, 37}, {81, 18}, {79, 91}, {82, 8}, {29, 73}, {55, 84}, {18, 13}, {32, 7}, {77, 63}, {26, 72}, {90, 5}, {95, 4}, {46, 13}, {0, 64}, {84, 34}, {52, 51}, {32, 30}, {24, 55}, {51, 17}, {12, 7}, {73, 34}, {54, 47}, {96, 95}, {65, 67}, {46, 90}, {58, 17}, {54, 2}, {45, 10}, {84, 45}, {46, 6}, {0, 4}, {16, 60}, {50, 35}, {86, 45}, {89, 19}, {48, 10}, {4, 57}, {43, 62}, {19, 30}, {2, 35}, {83, 68}, {36, 26}, {69, 4}, {41, 82}, {12, 52}, {77, 95}, {90, 75}, {78, 58}, {93, 29}, {38, 87}, {15, 82}, {42, 86}, {39, 90}, {20, 53}, {79, 25}, {68, 81}, {64, 82}, {45, 56}, {14, 85}, {97, 13}, {46, 15}, {46, 43}, {8, 71}, {90, 72}, {97, 66}, {80, 57}, {25, 8}, {90, 74}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 0}, {{0, 1}, {1, 1}, {0, 0}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 217}, {}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({7, 84}, {{0, 1}, {1, 1}, {0, 0}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 15}, {{1, 0}, {0, 1}, {1, 1}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
297 | TP3/graphs.AnyTriangle | C++ | Verifies that the inputs satisfy the problem:
Find any triangle in the given directed graph. | /**
* Verifies that the inputs satisfy the problem:
* Find any triangle in the given directed graph.
*/
bool sat(vector<int> tri, vector<vector<int>> edges) { | bool sat(vector<int> tri, vector<vector<int>> edges) { | [
"tri",
"edges"
] | def sat(tri: List[int], edges):
(a, b, c) = tri
return [a, b] in edges and [b, c] in edges and ([c, a] in edges) and (a != b != c != a) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"tri\": [17, 22, 31], \"edges\": [[0, 17], [0, 22], [17, 22], [17, 31], [22, 31], [31, 17]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"tri\": [56, 3, 75], \"edges\": [[19, 48], [14, 42], [19, 14], [56, 3], [37, 16], [46, 5], [14, 14], [62, 40], [12, 41], [37, 1], [46, 40], [4, 9], [70, 39], [75, 49], [61, 55], [65, 61], [5, 1], [67, 44], [46, 68], [49, 62], [41, 61], [39, 43], [44, 60], [71, 40], [8, 42], [54, 67], [33, 27], [25, 70], [50, 3], [53, 22], [61, 34], [5, 16], [39, 62], [30, 44], [10, 3], [21, 67], [41, 54], [10, 66], [34, 1], [45, 44], [38, 47], [25, 36], [2, 47], [46, 2], [38, 4], [50, 66], [45, 18], [45, 50], [63, 57], [19, 43], [39, 66], [29, 13], [39, 65], [63, 39], [7, 25], [34, 51], [65, 54], [13, 64], [9, 70], [28, 12], [41, 69], [67, 53], [33, 38], [59, 27], [18, 37], [11, 3], [13, 23], [33, 50], [44, 49], [9, 50], [23, 55], [59, 66], [4, 74], [50, 12], [14, 24], [0, 28], [75, 29], [62, 60], [68, 35], [69, 55], [3, 19], [72, 30], [25, 9], [12, 58], [3, 66], [43, 8], [12, 11], [15, 56], [30, 75], [35, 57], [19, 20], [71, 36], [34, 35], [30, 17], [7, 52], [49, 31], [39, 58], [48, 32], [4, 57], [75, 31], [42, 1], [0, 48], [22, 13], [18, 17], [71, 52], [41, 19], [48, 12], [9, 48], [63, 65], [68, 63], [46, 39], [24, 30], [46, 61], [55, 25], [75, 36], [49, 5], [44, 12], [29, 5], [64, 69], [15, 64], [8, 66], [49, 25], [24, 53], [7, 39], [41, 2], [29, 48], [51, 30], [41, 21], [46, 30], [63, 75], [19, 3], [58, 72], [62, 59], [68, 54], [9, 61], [70, 74], [56, 48], [74, 48], [2, 9], [51, 22], [69, 61], [0, 35], [28, 46], [7, 11], [56, 57], [14, 67], [15, 4], [53, 12], [64, 42], [20, 15], [52, 53], [44, 16], [8, 7], [21, 7], [42, 45], [4, 66], [39, 59], [20, 1], [60, 0], [52, 28], [75, 63], [59, 14], [40, 69], [74, 46], [60, 67], [6, 57], [38, 68], [24, 22], [59, 61], [53, 30], [10, 56], [49, 59], [12, 27], [75, 22], [24, 25], [37, 11], [56, 12], [62, 47], [22, 9], [34, 17], [57, 10], [52, 43], [17, 22], [14, 73], [54, 75], [28, 22], [18, 51], [38, 46], [6, 22], [75, 15], [10, 1], [37, 12], [67, 34], [28, 43], [5, 2], [60, 40], [9, 22], [3, 75], [50, 1], [19, 8], [17, 57], [43, 60], [45, 60], [57, 32], [52, 35], [18, 22], [11, 38], [16, 57], [31, 39], [13, 18], [61, 54], [25, 10], [23, 46], [47, 5], [42, 66], [73, 67], [44, 28], [65, 34], [35, 50], [67, 1], [12, 44], [17, 51], [70, 23], [44, 35], [0, 16], [65, 53], [10, 74], [5, 60], [45, 8], [13, 46], [57, 6], [72, 47], [1, 36], [60, 4], [11, 31], [46, 21], [60, 29], [58, 44], [53, 41], [33, 44], [47, 34], [58, 35], [74, 51], [71, 35], [58, 10], [47, 59], [32, 36], [16, 67], [62, 9], [14, 44], [12, 32], [6, 19], [35, 21], [49, 71], [7, 7], [25, 39], [25, 24], [45, 40], [44, 20], [9, 37], [58, 18], [59, 52], [12, 23], [26, 49], [62, 69], [8, 2], [66, 52], [25, 42], [34, 70], [64, 1], [29, 57], [8, 26], [25, 63], [75, 56], [51, 49], [70, 9], [63, 51], [6, 28], [1, 38], [47, 27], [74, 26], [27, 63], [20, 47], [25, 37], [31, 67], [59, 71], [56, 32], [28, 65], [37, 10], [30, 50], [42, 32], [56, 63], [32, 65], [48, 70], [37, 21], [10, 11], [5, 24], [51, 8], [46, 6], [75, 23], [42, 28], [60, 26], [37, 9], [0, 19], [11, 34], [66, 51], [49, 42], [16, 37], [52, 55], [20, 39], [46, 12], [1, 70], [45, 37], [18, 63], [63, 23], [54, 7], [18, 11], [51, 28], [21, 65], [28, 71], [46, 53], [14, 36], [35, 71], [30, 5], [50, 62], [32, 28], [64, 38], [66, 61], [0, 10]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"tri\": [51, 11, 39], \"edges\": [[51, 44], [11, 59], [57, 15], [18, 1], [41, 1], [44, 6], [58, 44], [43, 10], [41, 9], [50, 43], [56, 0], [47, 4], [42, 45], [51, 15], [60, 18], [11, 56], [21, 45], [39, 42], [57, 34], [60, 25], [57, 33], [6, 17], [26, 43], [38, 25], [29, 18], [39, 43], [34, 4], [22, 61], [0, 9], [1, 20], [36, 28], [10, 37], [53, 7], [49, 60], [12, 48], [31, 33], [4, 8], [5, 56], [27, 59], [56, 29], [60, 17], [17, 27], [24, 58], [46, 47], [60, 35], [4, 37], [41, 43], [37, 33], [30, 7], [53, 31], [3, 60], [24, 39], [14, 41], [14, 54], [33, 35], [50, 1], [60, 57], [23, 17], [34, 15], [60, 26], [22, 0], [5, 4], [8, 41], [16, 4], [56, 40], [60, 44], [2, 26], [42, 21], [21, 28], [58, 32], [58, 12], [31, 22], [43, 0], [28, 3], [35, 21], [54, 18], [0, 58], [3, 9], [6, 59], [57, 46], [48, 45], [30, 12], [46, 27], [41, 55], [52, 58], [30, 21], [51, 24], [23, 18], [31, 59], [34, 49], [41, 34], [19, 58], [1, 32], [52, 16], [17, 8], [20, 3], [56, 12], [3, 51], [60, 31], [41, 5], [58, 23], [59, 6], [39, 2], [6, 6], [11, 38], [3, 44], [61, 58], [13, 46], [56, 1], [35, 14], [25, 7], [29, 60], [16, 32], [32, 32], [7, 44], [3, 48], [38, 21], [19, 43], [60, 4], [56, 56], [21, 33], [15, 11], [32, 0], [8, 10], [44, 11], [37, 36], [24, 28], [4, 23], [37, 22], [44, 4], [34, 28], [1, 7], [15, 48], [11, 20], [60, 13], [7, 30], [51, 18], [3, 56], [14, 57], [14, 22], [55, 13], [47, 50], [36, 14], [42, 46], [7, 29], [58, 36], [52, 49], [33, 4], [51, 51], [47, 55], [7, 60], [4, 17], [53, 6], [59, 28], [51, 52], [50, 24], [30, 18], [37, 42], [51, 30], [6, 37], [0, 41], [38, 30], [0, 24], [43, 38], [33, 2], [10, 21], [44, 33], [57, 29], [28, 45], [2, 27], [59, 38], [41, 28], [49, 61], [54, 23], [44, 32], [58, 33], [2, 43], [34, 39], [37, 28], [40, 56], [55, 59], [28, 43], [36, 36], [29, 41], [16, 35], [50, 33], [51, 4], [33, 11], [26, 17], [2, 49], [7, 18], [15, 60], [14, 47], [40, 16], [47, 19], [18, 43], [38, 53], [28, 10], [46, 12], [26, 48], [1, 45], [9, 45], [2, 12], [8, 55], [19, 24], [2, 10], [17, 38], [30, 48], [2, 13], [59, 22], [11, 39], [32, 47], [23, 26], [43, 25], [9, 34], [46, 30], [36, 32], [33, 36], [38, 54], [33, 14], [48, 46], [29, 53], [46, 60], [14, 10], [0, 3], [13, 39], [53, 53], [22, 16], [33, 31], [33, 13], [54, 51], [25, 34], [14, 33], [19, 56], [51, 10], [58, 43], [4, 20], [28, 54], [3, 34], [47, 45], [1, 58], [55, 43], [13, 21], [31, 46], [23, 57], [58, 15], [54, 36], [44, 7], [16, 52], [20, 40], [46, 18], [59, 19], [14, 44], [3, 4], [58, 52], [31, 42], [21, 17], [42, 18], [46, 57], [7, 35], [52, 4], [30, 11], [17, 14], [60, 10], [57, 59], [59, 46], [18, 15], [35, 27], [46, 31], [49, 18], [21, 23], [50, 25], [24, 59], [51, 26], [36, 34], [27, 17], [13, 16], [54, 56], [53, 13], [27, 25], [8, 33], [52, 7], [45, 61], [39, 0], [6, 51], [35, 23], [31, 5], [38, 33], [47, 58], [28, 61], [36, 0], [18, 30], [51, 11], [39, 51], [39, 36], [60, 37], [37, 43], [46, 42]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"tri\": [2, 7, 1], \"edges\": [[8, 0], [2, 7], [1, 2], [4, 5], [2, 1], [7, 1], [5, 6], [6, 3], [3, 8], [3, 4], [0, 1], [6, 6], [4, 0], [2, 8], [1, 5], [4, 2]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"tri\": [3, 2, 5], \"edges\": [[4, 4], [5, 5], [3, 5], [3, 1], [0, 1], [4, 0], [3, 2], [5, 3], [1, 3], [2, 5], [2, 0]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"tri\": [56, 3, 75], \"edges\": [[0, 17], [0, 22], [17, 22], [17, 31], [22, 31], [31, 17]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"tri\": [56, 3, 75], \"edges\": [[4, 4], [5, 5], [3, 5], [3, 1], [0, 1], [4, 0], [3, 2], [5, 3], [1, 3], [2, 5], [2, 0]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"tri\": [3, 2, 5], \"edges\": [[0, 17], [0, 22], [17, 22], [17, 31], [22, 31], [31, 17]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"tri\": [2, 7, 1], \"edges\": [[4, 4], [5, 5], [3, 5], [3, 1], [0, 1], [4, 0], [3, 2], [5, 3], [1, 3], [2, 5], [2, 0]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find any triangle in the given directed graph.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> tri, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(tri, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({17, 22, 31}, {{0, 17}, {0, 22}, {17, 22}, {17, 31}, {22, 31}, {31, 17}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({56, 3, 75}, {{19, 48}, {14, 42}, {19, 14}, {56, 3}, {37, 16}, {46, 5}, {14, 14}, {62, 40}, {12, 41}, {37, 1}, {46, 40}, {4, 9}, {70, 39}, {75, 49}, {61, 55}, {65, 61}, {5, 1}, {67, 44}, {46, 68}, {49, 62}, {41, 61}, {39, 43}, {44, 60}, {71, 40}, {8, 42}, {54, 67}, {33, 27}, {25, 70}, {50, 3}, {53, 22}, {61, 34}, {5, 16}, {39, 62}, {30, 44}, {10, 3}, {21, 67}, {41, 54}, {10, 66}, {34, 1}, {45, 44}, {38, 47}, {25, 36}, {2, 47}, {46, 2}, {38, 4}, {50, 66}, {45, 18}, {45, 50}, {63, 57}, {19, 43}, {39, 66}, {29, 13}, {39, 65}, {63, 39}, {7, 25}, {34, 51}, {65, 54}, {13, 64}, {9, 70}, {28, 12}, {41, 69}, {67, 53}, {33, 38}, {59, 27}, {18, 37}, {11, 3}, {13, 23}, {33, 50}, {44, 49}, {9, 50}, {23, 55}, {59, 66}, {4, 74}, {50, 12}, {14, 24}, {0, 28}, {75, 29}, {62, 60}, {68, 35}, {69, 55}, {3, 19}, {72, 30}, {25, 9}, {12, 58}, {3, 66}, {43, 8}, {12, 11}, {15, 56}, {30, 75}, {35, 57}, {19, 20}, {71, 36}, {34, 35}, {30, 17}, {7, 52}, {49, 31}, {39, 58}, {48, 32}, {4, 57}, {75, 31}, {42, 1}, {0, 48}, {22, 13}, {18, 17}, {71, 52}, {41, 19}, {48, 12}, {9, 48}, {63, 65}, {68, 63}, {46, 39}, {24, 30}, {46, 61}, {55, 25}, {75, 36}, {49, 5}, {44, 12}, {29, 5}, {64, 69}, {15, 64}, {8, 66}, {49, 25}, {24, 53}, {7, 39}, {41, 2}, {29, 48}, {51, 30}, {41, 21}, {46, 30}, {63, 75}, {19, 3}, {58, 72}, {62, 59}, {68, 54}, {9, 61}, {70, 74}, {56, 48}, {74, 48}, {2, 9}, {51, 22}, {69, 61}, {0, 35}, {28, 46}, {7, 11}, {56, 57}, {14, 67}, {15, 4}, {53, 12}, {64, 42}, {20, 15}, {52, 53}, {44, 16}, {8, 7}, {21, 7}, {42, 45}, {4, 66}, {39, 59}, {20, 1}, {60, 0}, {52, 28}, {75, 63}, {59, 14}, {40, 69}, {74, 46}, {60, 67}, {6, 57}, {38, 68}, {24, 22}, {59, 61}, {53, 30}, {10, 56}, {49, 59}, {12, 27}, {75, 22}, {24, 25}, {37, 11}, {56, 12}, {62, 47}, {22, 9}, {34, 17}, {57, 10}, {52, 43}, {17, 22}, {14, 73}, {54, 75}, {28, 22}, {18, 51}, {38, 46}, {6, 22}, {75, 15}, {10, 1}, {37, 12}, {67, 34}, {28, 43}, {5, 2}, {60, 40}, {9, 22}, {3, 75}, {50, 1}, {19, 8}, {17, 57}, {43, 60}, {45, 60}, {57, 32}, {52, 35}, {18, 22}, {11, 38}, {16, 57}, {31, 39}, {13, 18}, {61, 54}, {25, 10}, {23, 46}, {47, 5}, {42, 66}, {73, 67}, {44, 28}, {65, 34}, {35, 50}, {67, 1}, {12, 44}, {17, 51}, {70, 23}, {44, 35}, {0, 16}, {65, 53}, {10, 74}, {5, 60}, {45, 8}, {13, 46}, {57, 6}, {72, 47}, {1, 36}, {60, 4}, {11, 31}, {46, 21}, {60, 29}, {58, 44}, {53, 41}, {33, 44}, {47, 34}, {58, 35}, {74, 51}, {71, 35}, {58, 10}, {47, 59}, {32, 36}, {16, 67}, {62, 9}, {14, 44}, {12, 32}, {6, 19}, {35, 21}, {49, 71}, {7, 7}, {25, 39}, {25, 24}, {45, 40}, {44, 20}, {9, 37}, {58, 18}, {59, 52}, {12, 23}, {26, 49}, {62, 69}, {8, 2}, {66, 52}, {25, 42}, {34, 70}, {64, 1}, {29, 57}, {8, 26}, {25, 63}, {75, 56}, {51, 49}, {70, 9}, {63, 51}, {6, 28}, {1, 38}, {47, 27}, {74, 26}, {27, 63}, {20, 47}, {25, 37}, {31, 67}, {59, 71}, {56, 32}, {28, 65}, {37, 10}, {30, 50}, {42, 32}, {56, 63}, {32, 65}, {48, 70}, {37, 21}, {10, 11}, {5, 24}, {51, 8}, {46, 6}, {75, 23}, {42, 28}, {60, 26}, {37, 9}, {0, 19}, {11, 34}, {66, 51}, {49, 42}, {16, 37}, {52, 55}, {20, 39}, {46, 12}, {1, 70}, {45, 37}, {18, 63}, {63, 23}, {54, 7}, {18, 11}, {51, 28}, {21, 65}, {28, 71}, {46, 53}, {14, 36}, {35, 71}, {30, 5}, {50, 62}, {32, 28}, {64, 38}, {66, 61}, {0, 10}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({51, 11, 39}, {{51, 44}, {11, 59}, {57, 15}, {18, 1}, {41, 1}, {44, 6}, {58, 44}, {43, 10}, {41, 9}, {50, 43}, {56, 0}, {47, 4}, {42, 45}, {51, 15}, {60, 18}, {11, 56}, {21, 45}, {39, 42}, {57, 34}, {60, 25}, {57, 33}, {6, 17}, {26, 43}, {38, 25}, {29, 18}, {39, 43}, {34, 4}, {22, 61}, {0, 9}, {1, 20}, {36, 28}, {10, 37}, {53, 7}, {49, 60}, {12, 48}, {31, 33}, {4, 8}, {5, 56}, {27, 59}, {56, 29}, {60, 17}, {17, 27}, {24, 58}, {46, 47}, {60, 35}, {4, 37}, {41, 43}, {37, 33}, {30, 7}, {53, 31}, {3, 60}, {24, 39}, {14, 41}, {14, 54}, {33, 35}, {50, 1}, {60, 57}, {23, 17}, {34, 15}, {60, 26}, {22, 0}, {5, 4}, {8, 41}, {16, 4}, {56, 40}, {60, 44}, {2, 26}, {42, 21}, {21, 28}, {58, 32}, {58, 12}, {31, 22}, {43, 0}, {28, 3}, {35, 21}, {54, 18}, {0, 58}, {3, 9}, {6, 59}, {57, 46}, {48, 45}, {30, 12}, {46, 27}, {41, 55}, {52, 58}, {30, 21}, {51, 24}, {23, 18}, {31, 59}, {34, 49}, {41, 34}, {19, 58}, {1, 32}, {52, 16}, {17, 8}, {20, 3}, {56, 12}, {3, 51}, {60, 31}, {41, 5}, {58, 23}, {59, 6}, {39, 2}, {6, 6}, {11, 38}, {3, 44}, {61, 58}, {13, 46}, {56, 1}, {35, 14}, {25, 7}, {29, 60}, {16, 32}, {32, 32}, {7, 44}, {3, 48}, {38, 21}, {19, 43}, {60, 4}, {56, 56}, {21, 33}, {15, 11}, {32, 0}, {8, 10}, {44, 11}, {37, 36}, {24, 28}, {4, 23}, {37, 22}, {44, 4}, {34, 28}, {1, 7}, {15, 48}, {11, 20}, {60, 13}, {7, 30}, {51, 18}, {3, 56}, {14, 57}, {14, 22}, {55, 13}, {47, 50}, {36, 14}, {42, 46}, {7, 29}, {58, 36}, {52, 49}, {33, 4}, {51, 51}, {47, 55}, {7, 60}, {4, 17}, {53, 6}, {59, 28}, {51, 52}, {50, 24}, {30, 18}, {37, 42}, {51, 30}, {6, 37}, {0, 41}, {38, 30}, {0, 24}, {43, 38}, {33, 2}, {10, 21}, {44, 33}, {57, 29}, {28, 45}, {2, 27}, {59, 38}, {41, 28}, {49, 61}, {54, 23}, {44, 32}, {58, 33}, {2, 43}, {34, 39}, {37, 28}, {40, 56}, {55, 59}, {28, 43}, {36, 36}, {29, 41}, {16, 35}, {50, 33}, {51, 4}, {33, 11}, {26, 17}, {2, 49}, {7, 18}, {15, 60}, {14, 47}, {40, 16}, {47, 19}, {18, 43}, {38, 53}, {28, 10}, {46, 12}, {26, 48}, {1, 45}, {9, 45}, {2, 12}, {8, 55}, {19, 24}, {2, 10}, {17, 38}, {30, 48}, {2, 13}, {59, 22}, {11, 39}, {32, 47}, {23, 26}, {43, 25}, {9, 34}, {46, 30}, {36, 32}, {33, 36}, {38, 54}, {33, 14}, {48, 46}, {29, 53}, {46, 60}, {14, 10}, {0, 3}, {13, 39}, {53, 53}, {22, 16}, {33, 31}, {33, 13}, {54, 51}, {25, 34}, {14, 33}, {19, 56}, {51, 10}, {58, 43}, {4, 20}, {28, 54}, {3, 34}, {47, 45}, {1, 58}, {55, 43}, {13, 21}, {31, 46}, {23, 57}, {58, 15}, {54, 36}, {44, 7}, {16, 52}, {20, 40}, {46, 18}, {59, 19}, {14, 44}, {3, 4}, {58, 52}, {31, 42}, {21, 17}, {42, 18}, {46, 57}, {7, 35}, {52, 4}, {30, 11}, {17, 14}, {60, 10}, {57, 59}, {59, 46}, {18, 15}, {35, 27}, {46, 31}, {49, 18}, {21, 23}, {50, 25}, {24, 59}, {51, 26}, {36, 34}, {27, 17}, {13, 16}, {54, 56}, {53, 13}, {27, 25}, {8, 33}, {52, 7}, {45, 61}, {39, 0}, {6, 51}, {35, 23}, {31, 5}, {38, 33}, {47, 58}, {28, 61}, {36, 0}, {18, 30}, {51, 11}, {39, 51}, {39, 36}, {60, 37}, {37, 43}, {46, 42}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2, 7, 1}, {{8, 0}, {2, 7}, {1, 2}, {4, 5}, {2, 1}, {7, 1}, {5, 6}, {6, 3}, {3, 8}, {3, 4}, {0, 1}, {6, 6}, {4, 0}, {2, 8}, {1, 5}, {4, 2}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({3, 2, 5}, {{4, 4}, {5, 5}, {3, 5}, {3, 1}, {0, 1}, {4, 0}, {3, 2}, {5, 3}, {1, 3}, {2, 5}, {2, 0}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({56, 3, 75}, {{0, 17}, {0, 22}, {17, 22}, {17, 31}, {22, 31}, {31, 17}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({56, 3, 75}, {{4, 4}, {5, 5}, {3, 5}, {3, 1}, {0, 1}, {4, 0}, {3, 2}, {5, 3}, {1, 3}, {2, 5}, {2, 0}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({3, 2, 5}, {{0, 17}, {0, 22}, {17, 22}, {17, 31}, {22, 31}, {31, 17}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({2, 7, 1}, {{4, 4}, {5, 5}, {3, 5}, {3, 1}, {0, 1}, {4, 0}, {3, 2}, {5, 3}, {1, 3}, {2, 5}, {2, 0}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
298 | TP3/graphs.PlantedClique | C++ | Verifies that the inputs satisfy the problem:
Find a clique of the given size in the given undirected graph. It is guaranteed that such a clique exists. | /**
* Verifies that the inputs satisfy the problem:
* Find a clique of the given size in the given undirected graph. It is guaranteed that such a clique exists.
*/
bool sat(vector<int> nodes, int size, vector<vector<int>> edges) { | bool sat(vector<int> nodes, int size, vector<vector<int>> edges) { | [
"nodes",
"size",
"edges"
] | def sat(nodes: List[int], size, edges):
if not len(nodes) == len(set(nodes)) >= size:
return False
edge_set = {(a, b) for (a, b) in edges}
for a in nodes:
for b in nodes:
if not (a == b or (a, b) in edge_set or (b, a) in edge_set):
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"nodes\": [0, 17, 22], \"size\": 3, \"edges\": [[0, 17], [0, 22], [17, 22], [17, 31], [22, 31], [31, 17]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"nodes\": [], \"size\": 0, \"edges\": [[1, 0]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"nodes\": [], \"size\": 0, \"edges\": [[0, 1], [1, 0]]}}, {\"idx\": 3, \"outputs\": false, \"inputs\": {\"nodes\": [0, 17, 22], \"size\": 0, \"edges\": [[0, 1], [1, 0]]}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"nodes\": [], \"size\": 3, \"edges\": [[1, 0]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"nodes\": [], \"size\": 3, \"edges\": [[0, 1], [1, 0]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"nodes\": [0, 17, 22], \"size\": 3, \"edges\": []}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a clique of the given size in the given undirected graph. It is guaranteed that such a clique exists.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> nodes, int size, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(nodes, size, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 17, 22}, 3, {{0, 17}, {0, 22}, {17, 22}, {17, 31}, {22, 31}, {31, 17}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 0, {{1, 0}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 0, {{0, 1}, {1, 0}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 17, 22}, 0, {{0, 1}, {1, 0}}, false); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 3, {{1, 0}}, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 3, {{0, 1}, {1, 0}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 17, 22}, 3, {}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
300 | TP3/graphs.UnweightedShortestPath | C++ | Verifies that the inputs satisfy the problem:
Find a path from node u to node v, of a bounded length, in the given digraph on vertices 0, 1,..., n. | /**
* Verifies that the inputs satisfy the problem:
* Find a path from node u to node v, of a bounded length, in the given digraph on vertices 0, 1,..., n.
*/
bool sat(vector<int> path, vector<vector<int>> edges, int u, int v, int bound) { | bool sat(vector<int> path, vector<vector<int>> edges, int u, int v, int bound) { | [
"path",
"edges",
"u",
"v",
"bound"
] | def sat(path: List[int], edges, u, v, bound):
if not (path[0] == u and path[-1] == v and all(([i, j] in edges for (i, j) in zip(path, path[1:])))):
return False
return len(path) <= bound | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"path\": [0, 11, 33], \"edges\": [[0, 11], [0, 7], [7, 5], [0, 22], [11, 22], [11, 33], [22, 33]], \"u\": 0, \"v\": 33, \"bound\": 3}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"path\": [14, 0, 11, 1], \"edges\": [[12, 4], [33, 15], [37, 12], [11, 1], [34, 19], [42, 36], [2, 38], [6, 25], [29, 25], [30, 6], [16, 31], [10, 41], [15, 2], [3, 19], [1, 26], [17, 17], [19, 4], [0, 6], [42, 5], [11, 13], [22, 15], [39, 11], [35, 34], [39, 20], [7, 31], [38, 27], [9, 30], [31, 25], [0, 9], [13, 34], [31, 34], [19, 42], [37, 32], [4, 13], [11, 43], [14, 0], [22, 41], [20, 17], [0, 15], [13, 4], [20, 6], [34, 42], [42, 10], [32, 19], [41, 8], [26, 42], [0, 13], [28, 42], [9, 0], [32, 26], [6, 4], [27, 19], [37, 9], [7, 6], [25, 14], [23, 14], [31, 39], [18, 27], [34, 36], [24, 16], [24, 31], [16, 17], [2, 4], [34, 40], [28, 6], [41, 9], [17, 18], [43, 11], [11, 39], [43, 29], [1, 19], [27, 27], [4, 42], [0, 16], [16, 14], [40, 22], [22, 22], [38, 16], [3, 34], [33, 23], [2, 18], [3, 11], [4, 5], [18, 3], [23, 11], [41, 22], [7, 26], [31, 42], [35, 33], [15, 28], [34, 10], [36, 3], [9, 38], [17, 5], [3, 9], [37, 21], [36, 1], [25, 6], [22, 12], [42, 3], [16, 32], [0, 11], [24, 33], [15, 31], [18, 34], [11, 8], [30, 41], [19, 19], [4, 11], [22, 16], [1, 13], [6, 22], [12, 30], [19, 15], [3, 21], [38, 29], [32, 39], [1, 17], [16, 20], [10, 39], [32, 27], [37, 6], [18, 18], [22, 32], [31, 32], [24, 32], [22, 25], [38, 18], [38, 21], [39, 12], [9, 17], [10, 42], [29, 36], [34, 23], [27, 29], [17, 24], [24, 28], [31, 23], [28, 7], [5, 2], [24, 26], [27, 13], [43, 19], [37, 36], [2, 13], [10, 11], [30, 11], [29, 32], [4, 24], [17, 27], [21, 2], [24, 43], [26, 37], [16, 6], [43, 35], [42, 27], [26, 12], [39, 3], [38, 25], [20, 5], [36, 8], [25, 42], [27, 40], [39, 23], [6, 12], [27, 32], [12, 34], [2, 5], [40, 35], [15, 12], [22, 29], [21, 11], [0, 22], [13, 23], [27, 4], [35, 24], [32, 29], [4, 14], [9, 7], [32, 11], [11, 26], [26, 41], [2, 16], [38, 23], [30, 29], [6, 31], [1, 34], [4, 39], [24, 3], [25, 22], [9, 14], [33, 26], [34, 38], [35, 29], [32, 38], [5, 42], [42, 24], [15, 38], [41, 14], [39, 9], [4, 36], [21, 24], [36, 9]], \"u\": 14, \"v\": 1, \"bound\": 4}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"path\": [1, 2], \"edges\": [[2, 6], [6, 2], [2, 5], [4, 7], [4, 1], [0, 2], [3, 3], [6, 1], [4, 0], [1, 3], [5, 2], [4, 2], [6, 7], [2, 2], [2, 3], [4, 4], [5, 0], [0, 7], [4, 3], [6, 4], [0, 0], [3, 0], [2, 7], [1, 7], [3, 2], [1, 2], [2, 4], [7, 5]], \"u\": 1, \"v\": 2, \"bound\": 2}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"path\": [4, 2], \"edges\": [[6, 0], [6, 2], [6, 5], [6, 4], [1, 4], [4, 3], [5, 3], [4, 4], [3, 1], [4, 6], [4, 2], [0, 2], [6, 6], [2, 3], [1, 0], [1, 5], [0, 0], [5, 4], [0, 1], [1, 2], [0, 4], [2, 5], [3, 0]], \"u\": 4, \"v\": 2, \"bound\": 2}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"path\": [1], \"edges\": [[1, 1], [2, 0], [1, 0], [2, 2]], \"u\": 1, \"v\": 1, \"bound\": 1}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"path\": [1], \"edges\": [[1, 1], [2, 0], [1, 0], [2, 2]], \"u\": 0, \"v\": 1, \"bound\": 2}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"path\": [0, 11, 33], \"edges\": [], \"u\": 0, \"v\": 33, \"bound\": 3}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"path\": [1], \"edges\": [[1, 1], [2, 0], [1, 0], [2, 2]], \"u\": 0, \"v\": 2, \"bound\": 1}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"path\": [1], \"edges\": [[1, 1], [2, 0], [1, 0], [2, 2]], \"u\": 0, \"v\": 2, \"bound\": 3}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a path from node u to node v, of a bounded length, in the given digraph on vertices 0, 1,..., n.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> path, vector<vector<int>> edges, int u, int v, int bound, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(path, edges, u, v, bound), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 11, 33}, {{0, 11}, {0, 7}, {7, 5}, {0, 22}, {11, 22}, {11, 33}, {22, 33}}, 0, 33, 3, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({14, 0, 11, 1}, {{12, 4}, {33, 15}, {37, 12}, {11, 1}, {34, 19}, {42, 36}, {2, 38}, {6, 25}, {29, 25}, {30, 6}, {16, 31}, {10, 41}, {15, 2}, {3, 19}, {1, 26}, {17, 17}, {19, 4}, {0, 6}, {42, 5}, {11, 13}, {22, 15}, {39, 11}, {35, 34}, {39, 20}, {7, 31}, {38, 27}, {9, 30}, {31, 25}, {0, 9}, {13, 34}, {31, 34}, {19, 42}, {37, 32}, {4, 13}, {11, 43}, {14, 0}, {22, 41}, {20, 17}, {0, 15}, {13, 4}, {20, 6}, {34, 42}, {42, 10}, {32, 19}, {41, 8}, {26, 42}, {0, 13}, {28, 42}, {9, 0}, {32, 26}, {6, 4}, {27, 19}, {37, 9}, {7, 6}, {25, 14}, {23, 14}, {31, 39}, {18, 27}, {34, 36}, {24, 16}, {24, 31}, {16, 17}, {2, 4}, {34, 40}, {28, 6}, {41, 9}, {17, 18}, {43, 11}, {11, 39}, {43, 29}, {1, 19}, {27, 27}, {4, 42}, {0, 16}, {16, 14}, {40, 22}, {22, 22}, {38, 16}, {3, 34}, {33, 23}, {2, 18}, {3, 11}, {4, 5}, {18, 3}, {23, 11}, {41, 22}, {7, 26}, {31, 42}, {35, 33}, {15, 28}, {34, 10}, {36, 3}, {9, 38}, {17, 5}, {3, 9}, {37, 21}, {36, 1}, {25, 6}, {22, 12}, {42, 3}, {16, 32}, {0, 11}, {24, 33}, {15, 31}, {18, 34}, {11, 8}, {30, 41}, {19, 19}, {4, 11}, {22, 16}, {1, 13}, {6, 22}, {12, 30}, {19, 15}, {3, 21}, {38, 29}, {32, 39}, {1, 17}, {16, 20}, {10, 39}, {32, 27}, {37, 6}, {18, 18}, {22, 32}, {31, 32}, {24, 32}, {22, 25}, {38, 18}, {38, 21}, {39, 12}, {9, 17}, {10, 42}, {29, 36}, {34, 23}, {27, 29}, {17, 24}, {24, 28}, {31, 23}, {28, 7}, {5, 2}, {24, 26}, {27, 13}, {43, 19}, {37, 36}, {2, 13}, {10, 11}, {30, 11}, {29, 32}, {4, 24}, {17, 27}, {21, 2}, {24, 43}, {26, 37}, {16, 6}, {43, 35}, {42, 27}, {26, 12}, {39, 3}, {38, 25}, {20, 5}, {36, 8}, {25, 42}, {27, 40}, {39, 23}, {6, 12}, {27, 32}, {12, 34}, {2, 5}, {40, 35}, {15, 12}, {22, 29}, {21, 11}, {0, 22}, {13, 23}, {27, 4}, {35, 24}, {32, 29}, {4, 14}, {9, 7}, {32, 11}, {11, 26}, {26, 41}, {2, 16}, {38, 23}, {30, 29}, {6, 31}, {1, 34}, {4, 39}, {24, 3}, {25, 22}, {9, 14}, {33, 26}, {34, 38}, {35, 29}, {32, 38}, {5, 42}, {42, 24}, {15, 38}, {41, 14}, {39, 9}, {4, 36}, {21, 24}, {36, 9}}, 14, 1, 4, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1, 2}, {{2, 6}, {6, 2}, {2, 5}, {4, 7}, {4, 1}, {0, 2}, {3, 3}, {6, 1}, {4, 0}, {1, 3}, {5, 2}, {4, 2}, {6, 7}, {2, 2}, {2, 3}, {4, 4}, {5, 0}, {0, 7}, {4, 3}, {6, 4}, {0, 0}, {3, 0}, {2, 7}, {1, 7}, {3, 2}, {1, 2}, {2, 4}, {7, 5}}, 1, 2, 2, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({4, 2}, {{6, 0}, {6, 2}, {6, 5}, {6, 4}, {1, 4}, {4, 3}, {5, 3}, {4, 4}, {3, 1}, {4, 6}, {4, 2}, {0, 2}, {6, 6}, {2, 3}, {1, 0}, {1, 5}, {0, 0}, {5, 4}, {0, 1}, {1, 2}, {0, 4}, {2, 5}, {3, 0}}, 4, 2, 2, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1}, {{1, 1}, {2, 0}, {1, 0}, {2, 2}}, 1, 1, 1, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1}, {{1, 1}, {2, 0}, {1, 0}, {2, 2}}, 0, 1, 2, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 11, 33}, {}, 0, 33, 3, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1}, {{1, 1}, {2, 0}, {1, 0}, {2, 2}}, 0, 2, 1, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({1}, {{1, 1}, {2, 0}, {1, 0}, {2, 2}}, 0, 2, 3, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
301 | TP3/graphs.AnyPath | C++ | Verifies that the inputs satisfy the problem:
Find any path from node 0 to node n in a given digraph on vertices 0, 1,..., n. | /**
* Verifies that the inputs satisfy the problem:
* Find any path from node 0 to node n in a given digraph on vertices 0, 1,..., n.
*/
bool sat(vector<int> path, vector<vector<int>> edges) { | bool sat(vector<int> path, vector<vector<int>> edges) { | [
"path",
"edges"
] | def sat(path: List[int], edges):
for i in range(len(path) - 1):
if not [path[i], path[i + 1]] in edges:
return False
if not path[0] == 0:
return False
if not path[-1] == max((max(edge) for edge in edges)):
return False
return True | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"path\": [0, 2, 5, 6, 7], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"path\": [0, 27, 14, 11, 34, 36, 22, 35, 17, 5, 29, 3, 16, 44], \"edges\": [[16, 8], [13, 33], [29, 37], [25, 10], [3, 33], [43, 10], [19, 9], [26, 16], [0, 9], [18, 36], [40, 32], [24, 10], [25, 35], [15, 14], [18, 2], [17, 5], [15, 26], [28, 28], [4, 39], [26, 9], [35, 22], [42, 11], [44, 13], [6, 34], [33, 0], [36, 34], [41, 34], [31, 1], [41, 27], [20, 43], [30, 33], [15, 18], [8, 20], [31, 14], [21, 33], [40, 28], [35, 39], [19, 14], [35, 10], [3, 34], [14, 11], [34, 36], [29, 3], [20, 33], [27, 14], [5, 29], [15, 6], [21, 20], [36, 1], [30, 40], [44, 6], [24, 43], [24, 30], [3, 16], [8, 34], [15, 36], [33, 36], [19, 17], [35, 17], [20, 29], [0, 27], [36, 38], [1, 0], [43, 18], [5, 36], [22, 10], [5, 32], [11, 34], [4, 15], [4, 9], [4, 6], [24, 12], [8, 27], [42, 38], [25, 2], [2, 12], [1, 34], [36, 22], [24, 42], [4, 18], [30, 13], [16, 44], [4, 21], [22, 35], [33, 32], [24, 26], [21, 44]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"path\": [0], \"edges\": [[0, 0]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"path\": [0, 44, 38, 53, 63], \"edges\": [[2, 33], [39, 59], [22, 21], [55, 39], [34, 13], [28, 62], [34, 56], [41, 23], [52, 39], [27, 62], [19, 12], [14, 63], [48, 1], [53, 1], [47, 55], [43, 35], [13, 51], [18, 30], [7, 17], [25, 52], [35, 46], [16, 45], [7, 22], [42, 40], [35, 41], [21, 52], [35, 43], [22, 30], [20, 47], [48, 25], [32, 11], [38, 35], [39, 35], [34, 62], [19, 32], [15, 51], [62, 29], [54, 26], [1, 6], [42, 51], [26, 62], [18, 8], [47, 40], [30, 41], [42, 15], [35, 36], [12, 55], [38, 53], [52, 37], [4, 44], [13, 61], [2, 58], [9, 48], [2, 11], [52, 0], [11, 35], [33, 7], [49, 40], [21, 46], [1, 30], [60, 34], [36, 46], [8, 52], [43, 58], [53, 63], [61, 16], [50, 16], [33, 44], [23, 26], [27, 16], [52, 18], [59, 1], [29, 44], [37, 57], [25, 2], [3, 15], [33, 19], [22, 6], [59, 51], [58, 32], [46, 37], [15, 9], [1, 35], [48, 6], [15, 59], [58, 28], [6, 24], [4, 38], [37, 20], [52, 28], [43, 40], [28, 39], [58, 31], [62, 35], [63, 11], [24, 40], [44, 38], [0, 44], [57, 11], [0, 16], [41, 1], [62, 55], [8, 51], [5, 8], [46, 26], [40, 6], [45, 42], [24, 32], [19, 31], [6, 55], [30, 2], [43, 57], [25, 48], [53, 31], [29, 13], [63, 39], [37, 46], [32, 40], [16, 16], [53, 59], [11, 57], [33, 20], [19, 11], [47, 51], [50, 15], [19, 36]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"path\": [0, 5, 3, 6, 7], \"edges\": [[3, 5], [2, 1], [4, 5], [3, 6], [6, 7], [5, 3], [4, 3], [6, 2], [5, 2], [7, 0], [3, 4], [0, 5], [0, 0], [1, 0], [0, 2], [3, 1]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"path\": [0, 44, 38, 53, 63], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"path\": [0, 5, 3, 6, 7], \"edges\": [[0, 0]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"path\": [0, 44, 38, 53, 63], \"edges\": [[0, 0]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"path\": [0, 5, 3, 6, 7], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find any path from node 0 to node n in a given digraph on vertices 0, 1,..., n.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> path, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(path, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 2, 5, 6, 7}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 27, 14, 11, 34, 36, 22, 35, 17, 5, 29, 3, 16, 44}, {{16, 8}, {13, 33}, {29, 37}, {25, 10}, {3, 33}, {43, 10}, {19, 9}, {26, 16}, {0, 9}, {18, 36}, {40, 32}, {24, 10}, {25, 35}, {15, 14}, {18, 2}, {17, 5}, {15, 26}, {28, 28}, {4, 39}, {26, 9}, {35, 22}, {42, 11}, {44, 13}, {6, 34}, {33, 0}, {36, 34}, {41, 34}, {31, 1}, {41, 27}, {20, 43}, {30, 33}, {15, 18}, {8, 20}, {31, 14}, {21, 33}, {40, 28}, {35, 39}, {19, 14}, {35, 10}, {3, 34}, {14, 11}, {34, 36}, {29, 3}, {20, 33}, {27, 14}, {5, 29}, {15, 6}, {21, 20}, {36, 1}, {30, 40}, {44, 6}, {24, 43}, {24, 30}, {3, 16}, {8, 34}, {15, 36}, {33, 36}, {19, 17}, {35, 17}, {20, 29}, {0, 27}, {36, 38}, {1, 0}, {43, 18}, {5, 36}, {22, 10}, {5, 32}, {11, 34}, {4, 15}, {4, 9}, {4, 6}, {24, 12}, {8, 27}, {42, 38}, {25, 2}, {2, 12}, {1, 34}, {36, 22}, {24, 42}, {4, 18}, {30, 13}, {16, 44}, {4, 21}, {22, 35}, {33, 32}, {24, 26}, {21, 44}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0}, {{0, 0}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 44, 38, 53, 63}, {{2, 33}, {39, 59}, {22, 21}, {55, 39}, {34, 13}, {28, 62}, {34, 56}, {41, 23}, {52, 39}, {27, 62}, {19, 12}, {14, 63}, {48, 1}, {53, 1}, {47, 55}, {43, 35}, {13, 51}, {18, 30}, {7, 17}, {25, 52}, {35, 46}, {16, 45}, {7, 22}, {42, 40}, {35, 41}, {21, 52}, {35, 43}, {22, 30}, {20, 47}, {48, 25}, {32, 11}, {38, 35}, {39, 35}, {34, 62}, {19, 32}, {15, 51}, {62, 29}, {54, 26}, {1, 6}, {42, 51}, {26, 62}, {18, 8}, {47, 40}, {30, 41}, {42, 15}, {35, 36}, {12, 55}, {38, 53}, {52, 37}, {4, 44}, {13, 61}, {2, 58}, {9, 48}, {2, 11}, {52, 0}, {11, 35}, {33, 7}, {49, 40}, {21, 46}, {1, 30}, {60, 34}, {36, 46}, {8, 52}, {43, 58}, {53, 63}, {61, 16}, {50, 16}, {33, 44}, {23, 26}, {27, 16}, {52, 18}, {59, 1}, {29, 44}, {37, 57}, {25, 2}, {3, 15}, {33, 19}, {22, 6}, {59, 51}, {58, 32}, {46, 37}, {15, 9}, {1, 35}, {48, 6}, {15, 59}, {58, 28}, {6, 24}, {4, 38}, {37, 20}, {52, 28}, {43, 40}, {28, 39}, {58, 31}, {62, 35}, {63, 11}, {24, 40}, {44, 38}, {0, 44}, {57, 11}, {0, 16}, {41, 1}, {62, 55}, {8, 51}, {5, 8}, {46, 26}, {40, 6}, {45, 42}, {24, 32}, {19, 31}, {6, 55}, {30, 2}, {43, 57}, {25, 48}, {53, 31}, {29, 13}, {63, 39}, {37, 46}, {32, 40}, {16, 16}, {53, 59}, {11, 57}, {33, 20}, {19, 11}, {47, 51}, {50, 15}, {19, 36}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 5, 3, 6, 7}, {{3, 5}, {2, 1}, {4, 5}, {3, 6}, {6, 7}, {5, 3}, {4, 3}, {6, 2}, {5, 2}, {7, 0}, {3, 4}, {0, 5}, {0, 0}, {1, 0}, {0, 2}, {3, 1}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 44, 38, 53, 63}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 5, 3, 6, 7}, {{0, 0}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 44, 38, 53, 63}, {{0, 0}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 5, 3, 6, 7}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
302 | TP3/graphs.EvenPath | C++ | Verifies that the inputs satisfy the problem:
Find a path with an even number of nodes from nodes 0 to n in the given digraph on vertices 0, 1,..., n. | /**
* Verifies that the inputs satisfy the problem:
* Find a path with an even number of nodes from nodes 0 to n in the given digraph on vertices 0, 1,..., n.
*/
bool sat(vector<int> path, vector<vector<int>> edges) { | bool sat(vector<int> path, vector<vector<int>> edges) { | [
"path",
"edges"
] | def sat(path: List[int], edges):
if not (path[0] == 0 and path[-1] == max((max(e) for e in edges))):
return False
if not all([[a, b] in edges for (a, b) in zip(path, path[1:])]):
return False
return len(path) % 2 == 0 | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"path\": [0, 1, 2, 5, 6, 7], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"path\": [0, 2, 2, 3], \"edges\": [[3, 2], [2, 1], [0, 2], [1, 0], [2, 2], [2, 3], [2, 0]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"path\": [0, 5, 46, 3, 25, 47, 37, 55], \"edges\": [[5, 15], [51, 42], [23, 5], [36, 2], [18, 43], [8, 47], [37, 6], [20, 25], [13, 25], [17, 2], [53, 30], [4, 50], [25, 47], [27, 5], [47, 7], [6, 18], [16, 30], [51, 3], [6, 13], [3, 12], [30, 13], [14, 43], [0, 5], [20, 7], [8, 3], [29, 55], [13, 11], [18, 39], [37, 13], [25, 8], [45, 30], [32, 8], [55, 43], [34, 42], [31, 21], [26, 19], [18, 1], [51, 35], [51, 51], [53, 22], [8, 23], [29, 21], [0, 44], [16, 38], [7, 16], [22, 45], [37, 16], [54, 20], [24, 13], [47, 37], [11, 10], [31, 31], [37, 55], [18, 6], [27, 43], [51, 38], [33, 38], [31, 3], [15, 35], [42, 11], [53, 4], [51, 24], [14, 27], [13, 18], [9, 55], [29, 0], [50, 31], [16, 18], [46, 3], [42, 44], [25, 12], [50, 10], [28, 51], [3, 25], [18, 26], [16, 0], [15, 37], [45, 48], [23, 50], [1, 15], [29, 35], [48, 32], [27, 10], [39, 49], [0, 36], [46, 2], [51, 29], [39, 6], [51, 33], [30, 54], [53, 2], [26, 6], [6, 4], [15, 2], [35, 27], [6, 36], [53, 19], [49, 54], [4, 44], [53, 6], [47, 41], [37, 21], [50, 48], [42, 47], [6, 2], [5, 46], [2, 50], [39, 29], [11, 42], [46, 33], [11, 22]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"path\": [0, 53, 36, 24, 33, 10, 54, 19, 52, 46, 37, 68, 56, 74], \"edges\": [[13, 29], [70, 66], [46, 37], [1, 57], [37, 1], [43, 0], [71, 49], [49, 49], [1, 0], [13, 38], [34, 7], [56, 74], [44, 74], [35, 54], [41, 59], [53, 47], [48, 28], [52, 46], [36, 22], [74, 72], [43, 36], [65, 24], [14, 67], [64, 28], [8, 39], [71, 14], [22, 24], [20, 43], [67, 21], [12, 39], [40, 41], [54, 19], [26, 69], [48, 14], [24, 25], [24, 16], [45, 62], [43, 57], [71, 1], [31, 24], [27, 66], [64, 18], [73, 33], [25, 22], [31, 60], [67, 3], [4, 44], [41, 55], [0, 23], [7, 14], [46, 50], [40, 53], [4, 33], [8, 12], [64, 55], [19, 52], [52, 62], [3, 42], [33, 10], [67, 10], [1, 33], [39, 18], [18, 7], [2, 47], [29, 55], [29, 42], [44, 67], [55, 55], [25, 42], [39, 53], [59, 21], [44, 50], [31, 30], [60, 71], [49, 9], [20, 16], [37, 68], [58, 73], [41, 7], [30, 74], [61, 31], [71, 42], [72, 19], [66, 33], [24, 33], [57, 40], [3, 28], [59, 64], [16, 12], [72, 20], [3, 5], [59, 52], [70, 8], [71, 13], [20, 71], [64, 31], [22, 27], [53, 36], [49, 23], [40, 4], [55, 68], [32, 12], [21, 15], [57, 63], [8, 70], [72, 56], [33, 3], [41, 28], [4, 0], [44, 10], [33, 2], [36, 24], [59, 58], [45, 33], [61, 66], [21, 48], [10, 54], [46, 13], [40, 25], [28, 6], [65, 53], [0, 53], [51, 22], [71, 17], [52, 9], [30, 34], [68, 64], [54, 8], [35, 13], [64, 54], [45, 67], [47, 22], [69, 52], [18, 73], [21, 60], [72, 29], [7, 36], [68, 56], [17, 14], [44, 54], [46, 29], [72, 67], [17, 53], [54, 51], [26, 46], [65, 21], [27, 3], [50, 5]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"path\": [0, 74, 9, 50, 68, 18, 90, 92], \"edges\": [[67, 92], [18, 52], [25, 21], [83, 58], [36, 36], [26, 63], [48, 15], [53, 32], [62, 30], [41, 21], [91, 25], [82, 79], [33, 58], [65, 81], [57, 57], [62, 36], [85, 24], [14, 19], [58, 11], [20, 31], [76, 82], [92, 37], [73, 88], [90, 37], [68, 18], [70, 18], [45, 65], [45, 78], [87, 36], [41, 72], [66, 4], [25, 58], [18, 16], [72, 68], [21, 0], [44, 8], [51, 21], [30, 15], [18, 90], [75, 47], [42, 7], [13, 13], [27, 46], [78, 39], [71, 28], [85, 39], [56, 52], [60, 37], [37, 18], [82, 83], [84, 9], [31, 54], [81, 32], [46, 82], [10, 66], [85, 71], [3, 5], [15, 18], [83, 64], [9, 50], [60, 70], [7, 13], [81, 63], [32, 6], [18, 80], [22, 34], [60, 0], [88, 72], [9, 19], [74, 0], [87, 22], [41, 17], [66, 80], [33, 9], [71, 46], [23, 79], [64, 44], [40, 67], [78, 4], [8, 31], [15, 41], [42, 92], [22, 28], [57, 84], [69, 65], [35, 16], [1, 10], [7, 82], [62, 52], [8, 12], [51, 12], [5, 2], [83, 30], [76, 83], [0, 27], [30, 80], [33, 14], [39, 12], [51, 78], [30, 47], [25, 26], [11, 63], [52, 24], [32, 49], [0, 74], [51, 16], [1, 16], [14, 90], [49, 74], [69, 14], [72, 30], [61, 31], [54, 20], [46, 78], [4, 50], [13, 37], [61, 1], [4, 35], [29, 70], [20, 89], [28, 6], [74, 9], [86, 53], [58, 6], [57, 91], [10, 40], [15, 74], [23, 60], [5, 37], [50, 68], [78, 22], [90, 59], [74, 21], [80, 71], [92, 82], [42, 43], [68, 74], [43, 55], [67, 90], [87, 68], [40, 2], [55, 68], [52, 30], [10, 21], [44, 1], [39, 9], [12, 18], [61, 38], [65, 37], [10, 12], [21, 10], [81, 3], [65, 20], [31, 25], [59, 77], [43, 59], [75, 75], [71, 13], [17, 37], [31, 13], [6, 33], [24, 40], [52, 70], [70, 5], [4, 8], [20, 29], [11, 10], [43, 67], [11, 80], [49, 19], [81, 64], [44, 28], [18, 20], [91, 91], [90, 92], [81, 16], [31, 81], [7, 81], [54, 53], [65, 16], [91, 32]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"path\": [0, 74, 9, 50, 68, 18, 90, 92], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"path\": [0, 53, 36, 24, 33, 10, 54, 19, 52, 46, 37, 68, 56, 74], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"path\": [0, 1, 2, 5, 6, 7], \"edges\": [[3, 2], [2, 1], [0, 2], [1, 0], [2, 2], [2, 3], [2, 0]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"path\": [0, 5, 46, 3, 25, 47, 37, 55], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [1, 2]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a path with an even number of nodes from nodes 0 to n in the given digraph on vertices 0, 1,..., n.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> path, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(path, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 1, 2, 5, 6, 7}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 2, 2, 3}, {{3, 2}, {2, 1}, {0, 2}, {1, 0}, {2, 2}, {2, 3}, {2, 0}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 5, 46, 3, 25, 47, 37, 55}, {{5, 15}, {51, 42}, {23, 5}, {36, 2}, {18, 43}, {8, 47}, {37, 6}, {20, 25}, {13, 25}, {17, 2}, {53, 30}, {4, 50}, {25, 47}, {27, 5}, {47, 7}, {6, 18}, {16, 30}, {51, 3}, {6, 13}, {3, 12}, {30, 13}, {14, 43}, {0, 5}, {20, 7}, {8, 3}, {29, 55}, {13, 11}, {18, 39}, {37, 13}, {25, 8}, {45, 30}, {32, 8}, {55, 43}, {34, 42}, {31, 21}, {26, 19}, {18, 1}, {51, 35}, {51, 51}, {53, 22}, {8, 23}, {29, 21}, {0, 44}, {16, 38}, {7, 16}, {22, 45}, {37, 16}, {54, 20}, {24, 13}, {47, 37}, {11, 10}, {31, 31}, {37, 55}, {18, 6}, {27, 43}, {51, 38}, {33, 38}, {31, 3}, {15, 35}, {42, 11}, {53, 4}, {51, 24}, {14, 27}, {13, 18}, {9, 55}, {29, 0}, {50, 31}, {16, 18}, {46, 3}, {42, 44}, {25, 12}, {50, 10}, {28, 51}, {3, 25}, {18, 26}, {16, 0}, {15, 37}, {45, 48}, {23, 50}, {1, 15}, {29, 35}, {48, 32}, {27, 10}, {39, 49}, {0, 36}, {46, 2}, {51, 29}, {39, 6}, {51, 33}, {30, 54}, {53, 2}, {26, 6}, {6, 4}, {15, 2}, {35, 27}, {6, 36}, {53, 19}, {49, 54}, {4, 44}, {53, 6}, {47, 41}, {37, 21}, {50, 48}, {42, 47}, {6, 2}, {5, 46}, {2, 50}, {39, 29}, {11, 42}, {46, 33}, {11, 22}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 53, 36, 24, 33, 10, 54, 19, 52, 46, 37, 68, 56, 74}, {{13, 29}, {70, 66}, {46, 37}, {1, 57}, {37, 1}, {43, 0}, {71, 49}, {49, 49}, {1, 0}, {13, 38}, {34, 7}, {56, 74}, {44, 74}, {35, 54}, {41, 59}, {53, 47}, {48, 28}, {52, 46}, {36, 22}, {74, 72}, {43, 36}, {65, 24}, {14, 67}, {64, 28}, {8, 39}, {71, 14}, {22, 24}, {20, 43}, {67, 21}, {12, 39}, {40, 41}, {54, 19}, {26, 69}, {48, 14}, {24, 25}, {24, 16}, {45, 62}, {43, 57}, {71, 1}, {31, 24}, {27, 66}, {64, 18}, {73, 33}, {25, 22}, {31, 60}, {67, 3}, {4, 44}, {41, 55}, {0, 23}, {7, 14}, {46, 50}, {40, 53}, {4, 33}, {8, 12}, {64, 55}, {19, 52}, {52, 62}, {3, 42}, {33, 10}, {67, 10}, {1, 33}, {39, 18}, {18, 7}, {2, 47}, {29, 55}, {29, 42}, {44, 67}, {55, 55}, {25, 42}, {39, 53}, {59, 21}, {44, 50}, {31, 30}, {60, 71}, {49, 9}, {20, 16}, {37, 68}, {58, 73}, {41, 7}, {30, 74}, {61, 31}, {71, 42}, {72, 19}, {66, 33}, {24, 33}, {57, 40}, {3, 28}, {59, 64}, {16, 12}, {72, 20}, {3, 5}, {59, 52}, {70, 8}, {71, 13}, {20, 71}, {64, 31}, {22, 27}, {53, 36}, {49, 23}, {40, 4}, {55, 68}, {32, 12}, {21, 15}, {57, 63}, {8, 70}, {72, 56}, {33, 3}, {41, 28}, {4, 0}, {44, 10}, {33, 2}, {36, 24}, {59, 58}, {45, 33}, {61, 66}, {21, 48}, {10, 54}, {46, 13}, {40, 25}, {28, 6}, {65, 53}, {0, 53}, {51, 22}, {71, 17}, {52, 9}, {30, 34}, {68, 64}, {54, 8}, {35, 13}, {64, 54}, {45, 67}, {47, 22}, {69, 52}, {18, 73}, {21, 60}, {72, 29}, {7, 36}, {68, 56}, {17, 14}, {44, 54}, {46, 29}, {72, 67}, {17, 53}, {54, 51}, {26, 46}, {65, 21}, {27, 3}, {50, 5}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 74, 9, 50, 68, 18, 90, 92}, {{67, 92}, {18, 52}, {25, 21}, {83, 58}, {36, 36}, {26, 63}, {48, 15}, {53, 32}, {62, 30}, {41, 21}, {91, 25}, {82, 79}, {33, 58}, {65, 81}, {57, 57}, {62, 36}, {85, 24}, {14, 19}, {58, 11}, {20, 31}, {76, 82}, {92, 37}, {73, 88}, {90, 37}, {68, 18}, {70, 18}, {45, 65}, {45, 78}, {87, 36}, {41, 72}, {66, 4}, {25, 58}, {18, 16}, {72, 68}, {21, 0}, {44, 8}, {51, 21}, {30, 15}, {18, 90}, {75, 47}, {42, 7}, {13, 13}, {27, 46}, {78, 39}, {71, 28}, {85, 39}, {56, 52}, {60, 37}, {37, 18}, {82, 83}, {84, 9}, {31, 54}, {81, 32}, {46, 82}, {10, 66}, {85, 71}, {3, 5}, {15, 18}, {83, 64}, {9, 50}, {60, 70}, {7, 13}, {81, 63}, {32, 6}, {18, 80}, {22, 34}, {60, 0}, {88, 72}, {9, 19}, {74, 0}, {87, 22}, {41, 17}, {66, 80}, {33, 9}, {71, 46}, {23, 79}, {64, 44}, {40, 67}, {78, 4}, {8, 31}, {15, 41}, {42, 92}, {22, 28}, {57, 84}, {69, 65}, {35, 16}, {1, 10}, {7, 82}, {62, 52}, {8, 12}, {51, 12}, {5, 2}, {83, 30}, {76, 83}, {0, 27}, {30, 80}, {33, 14}, {39, 12}, {51, 78}, {30, 47}, {25, 26}, {11, 63}, {52, 24}, {32, 49}, {0, 74}, {51, 16}, {1, 16}, {14, 90}, {49, 74}, {69, 14}, {72, 30}, {61, 31}, {54, 20}, {46, 78}, {4, 50}, {13, 37}, {61, 1}, {4, 35}, {29, 70}, {20, 89}, {28, 6}, {74, 9}, {86, 53}, {58, 6}, {57, 91}, {10, 40}, {15, 74}, {23, 60}, {5, 37}, {50, 68}, {78, 22}, {90, 59}, {74, 21}, {80, 71}, {92, 82}, {42, 43}, {68, 74}, {43, 55}, {67, 90}, {87, 68}, {40, 2}, {55, 68}, {52, 30}, {10, 21}, {44, 1}, {39, 9}, {12, 18}, {61, 38}, {65, 37}, {10, 12}, {21, 10}, {81, 3}, {65, 20}, {31, 25}, {59, 77}, {43, 59}, {75, 75}, {71, 13}, {17, 37}, {31, 13}, {6, 33}, {24, 40}, {52, 70}, {70, 5}, {4, 8}, {20, 29}, {11, 10}, {43, 67}, {11, 80}, {49, 19}, {81, 64}, {44, 28}, {18, 20}, {91, 91}, {90, 92}, {81, 16}, {31, 81}, {7, 81}, {54, 53}, {65, 16}, {91, 32}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 74, 9, 50, 68, 18, 90, 92}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 53, 36, 24, 33, 10, 54, 19, 52, 46, 37, 68, 56, 74}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 1, 2, 5, 6, 7}, {{3, 2}, {2, 1}, {0, 2}, {1, 0}, {2, 2}, {2, 3}, {2, 0}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 5, 46, 3, 25, 47, 37, 55}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {1, 2}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
303 | TP3/graphs.OddPath | C++ | Verifies that the inputs satisfy the problem:
Find a path with an even number of nodes from nodes 0 to 1 in the given digraph on vertices 0, 1,..., n. | /**
* Verifies that the inputs satisfy the problem:
* Find a path with an even number of nodes from nodes 0 to 1 in the given digraph on vertices 0, 1,..., n.
*/
bool sat(vector<int> p, vector<vector<int>> edges) { | bool sat(vector<int> p, vector<vector<int>> edges) { | [
"p",
"edges"
] | def sat(p: List[int], edges):
return p[0] == 0 and p[-1] == 1 == len(p) % 2 and all([[a, b] in edges for (a, b) in zip(p, p[1:])]) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"p\": [0, 2, 5, 6, 1], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [6, 1]]}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"p\": [0, 8, 1], \"edges\": [[1, 6], [2, 3], [2, 7], [0, 8], [7, 8], [7, 2], [1, 5], [8, 7], [7, 0], [0, 0], [8, 1], [5, 7], [4, 7], [6, 1], [4, 4], [7, 4]]}}, {\"idx\": 2, \"outputs\": true, \"inputs\": {\"p\": [0, 34, 29, 36, 21, 23, 40, 31, 31, 5, 1], \"edges\": [[40, 31], [16, 32], [41, 10], [14, 9], [36, 26], [14, 12], [22, 6], [36, 6], [13, 22], [0, 34], [6, 28], [27, 22], [31, 5], [2, 3], [34, 37], [17, 14], [1, 4], [22, 26], [32, 18], [20, 10], [28, 17], [2, 22], [22, 30], [36, 41], [7, 35], [24, 29], [31, 31], [26, 39], [14, 32], [33, 27], [33, 9], [30, 37], [40, 14], [19, 17], [15, 11], [7, 40], [6, 36], [20, 19], [7, 12], [17, 25], [14, 24], [34, 25], [27, 34], [35, 41], [34, 3], [25, 12], [34, 29], [21, 23], [2, 12], [25, 26], [28, 16], [17, 2], [15, 28], [29, 0], [32, 16], [13, 29], [23, 26], [3, 11], [39, 3], [40, 16], [22, 39], [12, 30], [12, 24], [38, 24], [5, 1], [21, 39], [33, 39], [29, 36], [23, 40], [34, 20], [35, 10], [13, 7], [10, 2], [32, 26], [37, 4], [36, 21], [1, 18], [23, 11], [19, 11], [35, 5], [10, 32], [9, 17], [21, 2]]}}, {\"idx\": 3, \"outputs\": true, \"inputs\": {\"p\": [0, 17, 15, 3, 5, 13, 1], \"edges\": [[6, 6], [3, 6], [5, 0], [7, 16], [9, 12], [10, 3], [3, 5], [14, 17], [10, 14], [15, 3], [17, 15], [8, 18], [1, 12], [3, 7], [12, 17], [15, 15], [6, 2], [10, 9], [5, 13], [2, 15], [8, 5], [9, 15], [10, 6], [10, 17], [3, 9], [2, 6], [4, 1], [7, 12], [13, 1], [15, 17], [13, 5], [14, 10], [0, 17], [0, 11], [4, 17], [1, 11], [12, 18]]}}, {\"idx\": 4, \"outputs\": true, \"inputs\": {\"p\": [0, 7, 7, 6, 3, 2, 1], \"edges\": [[4, 8], [7, 6], [2, 0], [3, 2], [6, 3], [4, 5], [11, 5], [11, 0], [1, 5], [12, 12], [12, 1], [4, 11], [3, 3], [2, 10], [10, 6], [0, 7], [2, 7], [6, 11], [2, 9], [7, 7], [8, 9], [2, 1], [4, 6], [9, 4]]}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"p\": [0, 7, 7, 6, 3, 2, 1], \"edges\": [[1, 6], [2, 3], [2, 7], [0, 8], [7, 8], [7, 2], [1, 5], [8, 7], [7, 0], [0, 0], [8, 1], [5, 7], [4, 7], [6, 1], [4, 4], [7, 4]]}}, {\"idx\": 6, \"outputs\": false, \"inputs\": {\"p\": [0, 2, 5, 6, 1], \"edges\": []}}, {\"idx\": 7, \"outputs\": false, \"inputs\": {\"p\": [0, 17, 15, 3, 5, 13, 1], \"edges\": [[0, 1], [0, 2], [1, 3], [1, 4], [2, 5], [3, 4], [5, 6], [6, 7], [6, 1]]}}, {\"idx\": 8, \"outputs\": false, \"inputs\": {\"p\": [0, 17, 15, 3, 5, 13, 1], \"edges\": [[1, 6], [2, 3], [2, 7], [0, 8], [7, 8], [7, 2], [1, 5], [8, 7], [7, 0], [0, 0], [8, 1], [5, 7], [4, 7], [6, 1], [4, 4], [7, 4]]}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a path with an even number of nodes from nodes 0 to 1 in the given digraph on vertices 0, 1,..., n.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<int> p, vector<vector<int>> edges, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(p, edges), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({0, 2, 5, 6, 1}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {6, 1}}, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 8, 1}, {{1, 6}, {2, 3}, {2, 7}, {0, 8}, {7, 8}, {7, 2}, {1, 5}, {8, 7}, {7, 0}, {0, 0}, {8, 1}, {5, 7}, {4, 7}, {6, 1}, {4, 4}, {7, 4}}, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 34, 29, 36, 21, 23, 40, 31, 31, 5, 1}, {{40, 31}, {16, 32}, {41, 10}, {14, 9}, {36, 26}, {14, 12}, {22, 6}, {36, 6}, {13, 22}, {0, 34}, {6, 28}, {27, 22}, {31, 5}, {2, 3}, {34, 37}, {17, 14}, {1, 4}, {22, 26}, {32, 18}, {20, 10}, {28, 17}, {2, 22}, {22, 30}, {36, 41}, {7, 35}, {24, 29}, {31, 31}, {26, 39}, {14, 32}, {33, 27}, {33, 9}, {30, 37}, {40, 14}, {19, 17}, {15, 11}, {7, 40}, {6, 36}, {20, 19}, {7, 12}, {17, 25}, {14, 24}, {34, 25}, {27, 34}, {35, 41}, {34, 3}, {25, 12}, {34, 29}, {21, 23}, {2, 12}, {25, 26}, {28, 16}, {17, 2}, {15, 28}, {29, 0}, {32, 16}, {13, 29}, {23, 26}, {3, 11}, {39, 3}, {40, 16}, {22, 39}, {12, 30}, {12, 24}, {38, 24}, {5, 1}, {21, 39}, {33, 39}, {29, 36}, {23, 40}, {34, 20}, {35, 10}, {13, 7}, {10, 2}, {32, 26}, {37, 4}, {36, 21}, {1, 18}, {23, 11}, {19, 11}, {35, 5}, {10, 32}, {9, 17}, {21, 2}}, true); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 17, 15, 3, 5, 13, 1}, {{6, 6}, {3, 6}, {5, 0}, {7, 16}, {9, 12}, {10, 3}, {3, 5}, {14, 17}, {10, 14}, {15, 3}, {17, 15}, {8, 18}, {1, 12}, {3, 7}, {12, 17}, {15, 15}, {6, 2}, {10, 9}, {5, 13}, {2, 15}, {8, 5}, {9, 15}, {10, 6}, {10, 17}, {3, 9}, {2, 6}, {4, 1}, {7, 12}, {13, 1}, {15, 17}, {13, 5}, {14, 10}, {0, 17}, {0, 11}, {4, 17}, {1, 11}, {12, 18}}, true); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 7, 7, 6, 3, 2, 1}, {{4, 8}, {7, 6}, {2, 0}, {3, 2}, {6, 3}, {4, 5}, {11, 5}, {11, 0}, {1, 5}, {12, 12}, {12, 1}, {4, 11}, {3, 3}, {2, 10}, {10, 6}, {0, 7}, {2, 7}, {6, 11}, {2, 9}, {7, 7}, {8, 9}, {2, 1}, {4, 6}, {9, 4}}, true); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 7, 7, 6, 3, 2, 1}, {{1, 6}, {2, 3}, {2, 7}, {0, 8}, {7, 8}, {7, 2}, {1, 5}, {8, 7}, {7, 0}, {0, 0}, {8, 1}, {5, 7}, {4, 7}, {6, 1}, {4, 4}, {7, 4}}, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 2, 5, 6, 1}, {}, false); \n cout << \"TEST-\" << 6 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 17, 15, 3, 5, 13, 1}, {{0, 1}, {0, 2}, {1, 3}, {1, 4}, {2, 5}, {3, 4}, {5, 6}, {6, 7}, {6, 1}}, false); \n cout << \"TEST-\" << 7 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({0, 17, 15, 3, 5, 13, 1}, {{1, 6}, {2, 3}, {2, 7}, {0, 8}, {7, 8}, {7, 2}, {1, 5}, {8, 7}, {7, 0}, {0, 0}, {8, 1}, {5, 7}, {4, 7}, {6, 1}, {4, 4}, {7, 4}}, false); \n cout << \"TEST-\" << 8 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5",
"6",
"7",
"8"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |
304 | TP3/graphs.Zarankiewicz | C++ | Verifies that the inputs satisfy the problem:
Find a bipartite graph with n vertices on each side, z edges, and no K_3,3 subgraph. | /**
* Verifies that the inputs satisfy the problem:
* Find a bipartite graph with n vertices on each side, z edges, and no K_3,3 subgraph.
*/
bool sat(vector<vector<int>> edges, int z, int n, int t) { | bool sat(vector<vector<int>> edges, int z, int n, int t) { | [
"edges",
"z",
"n",
"t"
] | def sat(edges: List[List[int]], z, n, t):
from itertools import combinations
edges = {(a, b) for (a, b) in edges if a in range(n) and b in range(n)}
if not len(edges) >= z:
return False
return all((any(((a, b) not in edges for a in left for b in right)) for left in combinations(range(n), t) for right in combinations(range(n), t))) | {
"test_list": "[{\"idx\": 0, \"outputs\": true, \"inputs\": {\"edges\": [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 4], [2, 0], [2, 1], [2, 3], [2, 4], [3, 0], [3, 2], [3, 3], [3, 4], [4, 1], [4, 2], [4, 3], [4, 4]], \"z\": 20, \"n\": 5, \"t\": 3}}, {\"idx\": 1, \"outputs\": true, \"inputs\": {\"edges\": [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 3], [3, 0], [3, 2], [3, 3]], \"z\": 13, \"n\": 4, \"t\": 3}}, {\"idx\": 2, \"outputs\": false, \"inputs\": {\"edges\": [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 3], [3, 0], [3, 2], [3, 3]], \"z\": 20, \"n\": 4, \"t\": 3}}, {\"idx\": 3, \"outputs\": false, \"inputs\": {\"edges\": [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [1, 4], [2, 0], [2, 1], [2, 3], [2, 4], [3, 0], [3, 2], [3, 3], [3, 4], [4, 1], [4, 2], [4, 3], [4, 4]], \"z\": 20, \"n\": 4, \"t\": 3}}, {\"idx\": 4, \"outputs\": false, \"inputs\": {\"edges\": [], \"z\": 20, \"n\": 5, \"t\": 3}}, {\"idx\": 5, \"outputs\": false, \"inputs\": {\"edges\": [[0, 0], [0, 1], [0, 2], [0, 3], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 3], [3, 0], [3, 2], [3, 3]], \"z\": 20, \"n\": 5, \"t\": 3}}]",
"extension": "cpp",
"entry_fn_name": "sat",
"test_code": "#include <algorithm>\n#include <assert.h>\n#include <cstdlib>\n#include <iostream>\n#include <map>\n#include <set>\n#include <string>\n#include <tuple> \n#include <unordered_map>\n#include <vector>\n#include <math.h>\n#include <cmath>\n#include <bits/stdc++.h>\n#include <numeric>\n#include <functional>\n\nusing namespace std;\n// Question Prompt (NOT what is passed to the model)\n// Verifies that the inputs satisfy the problem:\n// Find a bipartite graph with n vertices on each side, z edges, and no K_3,3 subgraph.\n//\n// SOLUTION CODE\n// ============================================\nPLACEHOLDER_CODE_BODY\n\n// TESTING CODE \n// ============================================\nbool validateSolution(bool actual, bool expected){\n return actual == expected;\n}\n\nstring driver(vector<vector<int>> edges, int z, int n, int t, bool expected){\n try\n {\n if (validateSolution(PLACEHOLDER_FN_NAME(edges, z, n, t), expected)){\n return \"PASSED\";\n }\n return \"FAILED\";\n }\n catch (const std::overflow_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::runtime_error& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (const std::exception& exception_obj)\n {\n return typeid(exception_obj).name();\n }\n catch (...)\n {\n return \"UNK_ERROR\";\n }\n}\n\nint main() {\n string result = \"\";\n\n result = driver({{0, 0}, {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 1}, {1, 2}, {1, 4}, {2, 0}, {2, 1}, {2, 3}, {2, 4}, {3, 0}, {3, 2}, {3, 3}, {3, 4}, {4, 1}, {4, 2}, {4, 3}, {4, 4}}, 20, 5, 3, true); \n cout << \"TEST-\" << 0 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 1}, {1, 2}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 2}, {3, 3}}, 13, 4, 3, true); \n cout << \"TEST-\" << 1 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 1}, {1, 2}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 2}, {3, 3}}, 20, 4, 3, false); \n cout << \"TEST-\" << 2 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 1}, {1, 2}, {1, 4}, {2, 0}, {2, 1}, {2, 3}, {2, 4}, {3, 0}, {3, 2}, {3, 3}, {3, 4}, {4, 1}, {4, 2}, {4, 3}, {4, 4}}, 20, 4, 3, false); \n cout << \"TEST-\" << 3 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({}, 20, 5, 3, false); \n cout << \"TEST-\" << 4 << \"...\"\n << result\n << \"\\n\";\n\n result = driver({{0, 0}, {0, 1}, {0, 2}, {0, 3}, {1, 0}, {1, 1}, {1, 2}, {2, 0}, {2, 1}, {2, 3}, {3, 0}, {3, 2}, {3, 3}}, 20, 5, 3, false); \n cout << \"TEST-\" << 5 << \"...\"\n << result\n << \"\\n\";\n\n return 0;\n}",
"entry_cls_name": "Solution",
"test_case_ids": [
"0",
"1",
"2",
"3",
"4",
"5"
],
"commands": [
[
"g++",
"__FILENAME__",
"-o",
"main.exe"
],
[
"./main.exe"
]
],
"timeouts": [
10,
10
]
} |