{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'جبل'\nprint(text[::-1])\nprint(len(text))\nprint(text.count('ا'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'جبل'\nprint(text[::-1])\nprint(len(text))\nprint(text.count('ا'))\n```\nالجواب:", "qhash": "7b37b86604b9fdbf", "answer": "لبج\n3\n0", "completion": " الناتج:\n```text\nلبج\n3\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 10 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(17) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17']", "assert play(19) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19']", "assert play(6) == ['1', '2', '3', '4', '5', 'Tic']", "assert play(5) == ['1', '2', '3', '4', '5']", "assert play(25) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21', '22', '23', 'Tic', '25']"], "test_code": "assert play(17) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17']\nassert play(19) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19']\nassert play(6) == ['1', '2', '3', '4', '5', 'Tic']\nassert play(5) == ['1', '2', '3', '4', '5']\nassert play(25) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', 'Tac', '21', '22', '23', 'Tic', '25']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 10 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 10 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Tic'، مضاعفات 10 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(17) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', 'Tac', '11', 'Tic', '13', '14', '15', '16', '17']`\nالجواب:", "qhash": "d9cc48651ac7203d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 376\nc = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    c += 1\nprint(c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 376\nc = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    c += 1\nprint(c)\n```\nالجواب:", "qhash": "5ac86a8a24d1b6f9", "answer": "107", "completion": " الناتج:\n```text\n107\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert flip_words('in at a it desert on') == 'on/desert/it/a/at/in'", "assert flip_words('camel') == 'camel'", "assert flip_words('stone up pixel at garden desert banana matrix') == 'matrix/banana/desert/garden/at/pixel/up/stone'", "assert flip_words('river up garden') == 'garden/up/river'", "assert flip_words('on go rocket matrix pixel stone apple vector') == 'vector/apple/stone/pixel/matrix/rocket/go/on'", "assert flip_words('summer orange at by') == 'by/at/orange/summer'", "assert flip_words('river stone to music desert light') == 'light/desert/music/to/stone/river'"], "test_code": "assert flip_words('in at a it desert on') == 'on/desert/it/a/at/in'\nassert flip_words('camel') == 'camel'\nassert flip_words('stone up pixel at garden desert banana matrix') == 'matrix/banana/desert/garden/at/pixel/up/stone'\nassert flip_words('river up garden') == 'garden/up/river'\nassert flip_words('on go rocket matrix pixel stone apple vector') == 'vector/apple/stone/pixel/matrix/rocket/go/on'\nassert flip_words('summer orange at by') == 'by/at/orange/summer'\nassert flip_words('river stone to music desert light') == 'light/desert/music/to/stone/river'", "answer": "def flip_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef flip_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `flip_words('in at a it desert on') == 'on/desert/it/a/at/in'`\nالجواب:", "qhash": "6d6b75a5d4245df5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 4\n    return total", "tests": ["assert weighted_sum(4) == 1062", "assert weighted_sum(15) == 534936", "assert weighted_sum(2) == 51", "assert weighted_sum(15) == 534936", "assert weighted_sum(9) == 45999", "assert weighted_sum(1) == 3", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 1062\nassert weighted_sum(15) == 534936\nassert weighted_sum(2) == 51\nassert weighted_sum(15) == 534936\nassert weighted_sum(9) == 45999\nassert weighted_sum(1) == 3\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 4\n    return total", "completion": " ```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 4\n    return total\n```\n", "buggy": "def weighted_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 3 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 3 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 3 * i ** 4\n    return total\n```\nمثال: `weighted_sum(4) == 1062`\nالجواب:", "qhash": "02d9822074ce0a4b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_powers", "reference": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total", "tests": ["assert sum_powers(8) == 2040", "assert sum_powers(3) == 140", "assert sum_powers(0) == 0", "assert sum_powers(8) == 2040", "assert sum_powers(3) == 140", "assert sum_powers(1) == 10", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(8) == 2040\nassert sum_powers(3) == 140\nassert sum_powers(0) == 0\nassert sum_powers(8) == 2040\nassert sum_powers(3) == 140\nassert sum_powers(1) == 10\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total", "completion": " ```python\ndef sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total\n```\n", "buggy": "def sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 10 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 10 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 10 * i ** 2\n    return total\n```\nمثال: `sum_powers(8) == 2040`\nالجواب:", "qhash": "998b7f043e8ea271"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_text", "reference": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_text('desert winter 2024') == 'fgugtv ykpvgt 2024'", "assert shift_text('we') == 'yg'", "assert shift_text('it python desert camel A1') == 'kv ravjqp fgugtv ecogn A1'", "assert shift_text('winter apple desert garden') == 'ykpvgt crrng fgugtv ictfgp'", "assert shift_text('table window coffee light 2024') == 'vcdng ykpfqy eqhhgg nkijv 2024'", "assert shift_text('coffee data vector') == 'eqhhgg fcvc xgevqt'", "assert shift_text('') == ''"], "test_code": "assert shift_text('desert winter 2024') == 'fgugtv ykpvgt 2024'\nassert shift_text('we') == 'yg'\nassert shift_text('it python desert camel A1') == 'kv ravjqp fgugtv ecogn A1'\nassert shift_text('winter apple desert garden') == 'ykpvgt crrng fgugtv ictfgp'\nassert shift_text('table window coffee light 2024') == 'vcdng ykpfqy eqhhgg nkijv 2024'\nassert shift_text('coffee data vector') == 'eqhhgg fcvc xgevqt'\nassert shift_text('') == ''", "answer": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_text` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('desert winter 2024') == 'fgugtv ykpvgt 2024'`\nالجواب:", "qhash": "a5a8c379c99239a8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [25, 9, 33, -1, 22, 33, -15, -15]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [25, 9, 33, -1, 22, 33, -15, -15]\nprint(sorted(nums, key=lambda x: (abs(x - -3), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "745583fc35addafd", "answer": "[-1, -15, -15, 9, 22, 25, 33, 33]\n[33, 33, 25]", "completion": " الناتج:\n```text\n[-1, -15, -15, 9, 22, 25, 33, 33]\n[33, 33, 25]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'engine_summer'\nprint(name.replace('e', 'X'))\nprint(name.split('_'))\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'engine_summer'\nprint(name.replace('e', 'X'))\nprint(name.split('_'))\nprint(len(name))\n```\nالجواب:", "qhash": "001bac408de35548", "answer": "XnginX_summXr\n['engine', 'summer']\n13", "completion": " الناتج:\n```text\nXnginX_summXr\n['engine', 'summer']\n13\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 68774\nc = 0\nwhile n > 10:\n    n = n // 3\n    c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 68774\nc = 0\nwhile n > 10:\n    n = n // 3\n    c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "1be627aaaa5912d0", "answer": "10 8", "completion": " الناتج:\n```text\n10 8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(nums):\n    best = None\n    for x in nums:\n        if x % 11 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([-26, 56, 10, -23, 52, 14, -8, 8]) == None", "assert largest_div([-44, -11, -55]) == -11", "assert largest_div([1, 12, 23, 34]) == None", "assert largest_div([-25, 32, -28, 19, -40]) == None", "assert largest_div([26, -20, -25, -24, 24, -18, -2]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([-26, 56, 10, -23, 52, 14, -8, 8]) == None\nassert largest_div([-44, -11, -55]) == -11\nassert largest_div([1, 12, 23, 34]) == None\nassert largest_div([-25, 32, -28, 19, -40]) == None\nassert largest_div([26, -20, -25, -24, 24, -18, -2]) == None\nassert largest_div([]) == None", "answer": "def largest_div(nums):\n    best = None\n    for x in nums:\n        if x % 11 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(nums):\n    best = None\n    for x in nums:\n        if x % 11 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(nums):\n    best = None\n    for x in nums:\n        if x % 11 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 11، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(nums):\n    best = None\n    for x in nums:\n        if x % 11 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `largest_div([-26, 56, 10, -23, 52, 14, -8, 8]) == None`\nالجواب:", "qhash": "3452d3d41465b68e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=2):\n    if x > y:\n        return x * 8 - y\n    return x + y * 8\n\nprint(g(20))\nprint(g(20, -2))\nprint(g(g(-2), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=2):\n    if x > y:\n        return x * 8 - y\n    return x + y * 8\n\nprint(g(20))\nprint(g(20, -2))\nprint(g(g(-2), 20))\n```\nالجواب:", "qhash": "093cde5dcf2f401b", "answer": "158\n162\n174", "completion": " الناتج:\n```text\n158\n162\n174\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 11\nfor x in range(-3, 17, 1):\n    acc -= x * 1\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 11\nfor x in range(-3, 17, 1):\n    acc -= x * 1\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "47105142440ee49b", "answer": "-119\n16", "completion": " الناتج:\n```text\n-119\n16\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(g(2))\nprint(g(2, 3))\nprint(g(g(3), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(g(2))\nprint(g(2, 3))\nprint(g(g(3), 2))\n```\nالجواب:", "qhash": "36a183636a7551c6", "answer": "6\n5\n5", "completion": " الناتج:\n```text\n6\n5\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'hlr'}", "tests": ["assert freq_of('coffee') == {'h': 0, 'l': 0, 'r': 0}", "assert freq_of('light table') == {'h': 1, 'l': 2, 'r': 0}", "assert freq_of('orange a') == {'h': 0, 'l': 0, 'r': 1}", "assert freq_of('banana go coffee is planet data') == {'h': 0, 'l': 1, 'r': 0}", "assert freq_of('vector') == {'h': 0, 'l': 0, 'r': 1}", "assert freq_of('garden') == {'h': 0, 'l': 0, 'r': 1}", "assert freq_of('') == {'h': 0, 'l': 0, 'r': 0}"], "test_code": "assert freq_of('coffee') == {'h': 0, 'l': 0, 'r': 0}\nassert freq_of('light table') == {'h': 1, 'l': 2, 'r': 0}\nassert freq_of('orange a') == {'h': 0, 'l': 0, 'r': 1}\nassert freq_of('banana go coffee is planet data') == {'h': 0, 'l': 1, 'r': 0}\nassert freq_of('vector') == {'h': 0, 'l': 0, 'r': 1}\nassert freq_of('garden') == {'h': 0, 'l': 0, 'r': 1}\nassert freq_of('') == {'h': 0, 'l': 0, 'r': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'hlr'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'hlr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'h'، 'l'، 'r' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('coffee') == {'h': 0, 'l': 0, 'r': 0}`\nالجواب:", "qhash": "2cc6c2ea7d667af9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "backwards", "reference": "def backwards(s):\n    return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert backwards('desert in banana go brain up falcon rocket') == 'rocket_falcon_up_brain_go_banana_in_desert'", "assert backwards('by at winter light engine engine') == 'engine_engine_light_winter_at_by'", "assert backwards('up a planet planet code apple an') == 'an_apple_code_planet_planet_a_up'", "assert backwards('') == ''", "assert backwards('table an cloud') == 'cloud_an_table'", "assert backwards('an engine') == 'engine_an'", "assert backwards('by brain cloud it go data') == 'data_go_it_cloud_brain_by'"], "test_code": "assert backwards('desert in banana go brain up falcon rocket') == 'rocket_falcon_up_brain_go_banana_in_desert'\nassert backwards('by at winter light engine engine') == 'engine_engine_light_winter_at_by'\nassert backwards('up a planet planet code apple an') == 'an_apple_code_planet_planet_a_up'\nassert backwards('') == ''\nassert backwards('table an cloud') == 'cloud_an_table'\nassert backwards('an engine') == 'engine_an'\nassert backwards('by brain cloud it go data') == 'data_go_it_cloud_brain_by'", "answer": "def backwards(s):\n    return '_'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef backwards(s):\n    return '_'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `backwards` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `backwards('desert in banana go brain up falcon rocket') == 'rocket_falcon_up_brain_go_banana_in_desert'`\nالجواب:", "qhash": "7f465c3bb8d1302b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 47", "tests": ["assert mfact(7) == 28", "assert mfact(9) == 21", "assert mfact(41) == 30", "assert mfact(38) == 42", "assert mfact(45) == 43", "assert mfact(55) == 5", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 28\nassert mfact(9) == 21\nassert mfact(41) == 30\nassert mfact(38) == 42\nassert mfact(45) == 43\nassert mfact(55) == 5\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 47", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(7) == 28`\nالجواب:", "qhash": "a62109bb98c8b5b4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 82) == 1)", "tests": ["assert rel_prime_count(47) == 23", "assert rel_prime_count(40) == 20", "assert rel_prime_count(74) == 36", "assert rel_prime_count(159) == 78", "assert rel_prime_count(75) == 37", "assert rel_prime_count(43) == 21", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(47) == 23\nassert rel_prime_count(40) == 20\nassert rel_prime_count(74) == 36\nassert rel_prime_count(159) == 78\nassert rel_prime_count(75) == 37\nassert rel_prime_count(43) == 21\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 82) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 82) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 82 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(47) == 23`\nالجواب:", "qhash": "018aea94ec86ca4e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 52030\ncount = 0\nwhile x > 7:\n    x = x // 3\n    count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 52030\ncount = 0\nwhile x > 7:\n    x = x // 3\n    count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "e7077f621eb71298", "answer": "7 8", "completion": " الناتج:\n```text\n7 8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 73", "tests": ["assert mfact(7) == 21", "assert mfact(60) == 58", "assert mfact(23) == 39", "assert mfact(60) == 58", "assert mfact(31) == 12", "assert mfact(15) == 34", "assert mfact(0) == 1"], "test_code": "assert mfact(7) == 21\nassert mfact(60) == 58\nassert mfact(23) == 39\nassert mfact(60) == 58\nassert mfact(31) == 12\nassert mfact(15) == 34\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 73", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(7) == 21`\nالجواب:", "qhash": "139037b1cb475974"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(28) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', '24', 'Foo', '26', 'Bar', '28']", "assert label_numbers(10) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo']", "assert label_numbers(23) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23']", "assert label_numbers(11) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11']", "assert label_numbers(18) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar']"], "test_code": "assert label_numbers(28) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', '24', 'Foo', '26', 'Bar', '28']\nassert label_numbers(10) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo']\nassert label_numbers(23) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23']\nassert label_numbers(11) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11']\nassert label_numbers(18) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Foo'، مضاعفات 9 تصبح 'Bar'، المضاعفات المشتركة تصبح 'FooBar'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(28) == ['1', '2', '3', '4', 'Foo', '6', '7', '8', 'Bar', 'Foo', '11', '12', '13', '14', 'Foo', '16', '17', 'Bar', '19', 'Foo', '21', '22', '23', '24', 'Foo', '26', 'Bar', '28']`\nالجواب:", "qhash": "68f0ffb63887320c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'دفتر'\nprint(s.count('ر'))\nprint(len(s))\nprint(len(s.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'دفتر'\nprint(s.count('ر'))\nprint(len(s))\nprint(len(s.replace(' ', '')))\n```\nالجواب:", "qhash": "1b43fa5ecde9a573", "answer": "1\n4\n4", "completion": " الناتج:\n```text\n1\n4\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('planet apple vector pixel river') == 'wshula hwwsl cljavy wpels ypcly'", "assert shift_letters('table 2024') == 'ahisl 2024'", "assert shift_letters('desert 2024') == 'klzlya 2024'", "assert shift_letters('stone matrix code pixel A1') == 'zavul thaype jvkl wpels A1'", "assert shift_letters('matrix python at banana falcon') == 'thaype wfaovu ha ihuhuh mhsjvu'", "assert shift_letters('vector summer') == 'cljavy zbttly'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('planet apple vector pixel river') == 'wshula hwwsl cljavy wpels ypcly'\nassert shift_letters('table 2024') == 'ahisl 2024'\nassert shift_letters('desert 2024') == 'klzlya 2024'\nassert shift_letters('stone matrix code pixel A1') == 'zavul thaype jvkl wpels A1'\nassert shift_letters('matrix python at banana falcon') == 'thaype wfaovu ha ihuhuh mhsjvu'\nassert shift_letters('vector summer') == 'cljavy zbttly'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('planet apple vector pixel river') == 'wshula hwwsl cljavy wpels ypcly'`\nالجواب:", "qhash": "690c4b372059955d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "rec_prod", "reference": "def rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 1)) % 13", "tests": ["assert rec_prod(8) == 7", "assert rec_prod(3) == 6", "assert rec_prod(11) == 1", "assert rec_prod(18) == 0", "assert rec_prod(48) == 0", "assert rec_prod(43) == 0", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(8) == 7\nassert rec_prod(3) == 6\nassert rec_prod(11) == 1\nassert rec_prod(18) == 0\nassert rec_prod(48) == 0\nassert rec_prod(43) == 0\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 1)) % 13", "completion": " ```python\ndef rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 1)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef rec_prod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `rec_prod(8) == 7`\nالجواب:", "qhash": "dd9fe75fc3f14a33"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'aest'}", "tests": ["assert count_chars('table orange table') == {'a': 3, 'e': 3, 's': 0, 't': 2}", "assert count_chars('light on') == {'a': 0, 'e': 0, 's': 0, 't': 1}", "assert count_chars('summer it to planet') == {'a': 1, 'e': 2, 's': 1, 't': 3}", "assert count_chars('up light a winter on') == {'a': 1, 'e': 1, 's': 0, 't': 2}", "assert count_chars('signal river coffee rocket brain') == {'a': 2, 'e': 4, 's': 1, 't': 1}", "assert count_chars('falcon it is') == {'a': 1, 'e': 0, 's': 1, 't': 1}", "assert count_chars('') == {'a': 0, 'e': 0, 's': 0, 't': 0}"], "test_code": "assert count_chars('table orange table') == {'a': 3, 'e': 3, 's': 0, 't': 2}\nassert count_chars('light on') == {'a': 0, 'e': 0, 's': 0, 't': 1}\nassert count_chars('summer it to planet') == {'a': 1, 'e': 2, 's': 1, 't': 3}\nassert count_chars('up light a winter on') == {'a': 1, 'e': 1, 's': 0, 't': 2}\nassert count_chars('signal river coffee rocket brain') == {'a': 2, 'e': 4, 's': 1, 't': 1}\nassert count_chars('falcon it is') == {'a': 1, 'e': 0, 's': 1, 't': 1}\nassert count_chars('') == {'a': 0, 'e': 0, 's': 0, 't': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'aest'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'aest'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'a'، 'e'، 's'، 't' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('table orange table') == {'a': 3, 'e': 3, 's': 0, 't': 2}`\nالجواب:", "qhash": "6cb26931322f1b39"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rot", "reference": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rot('at') == 'ha'", "assert rot('up !') == 'bw !'", "assert rot('cloud data window matrix rocket OK') == 'jsvbk khah dpukvd thaype yvjrla OK'", "assert rot('python python orange to') == 'wfaovu wfaovu vyhunl av'", "assert rot('of OK') == 'vm OK'", "assert rot('planet A1') == 'wshula A1'", "assert rot('') == ''"], "test_code": "assert rot('at') == 'ha'\nassert rot('up !') == 'bw !'\nassert rot('cloud data window matrix rocket OK') == 'jsvbk khah dpukvd thaype yvjrla OK'\nassert rot('python python orange to') == 'wfaovu wfaovu vyhunl av'\nassert rot('of OK') == 'vm OK'\nassert rot('planet A1') == 'wshula A1'\nassert rot('') == ''", "answer": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-19)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rot` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 19 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('at') == 'ha'`\nالجواب:", "qhash": "fb7c414789b33122"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'imrt'}", "tests": ["assert char_freq('engine') == {'i': 1, 'm': 0, 'r': 0, 't': 0}", "assert char_freq('by on matrix summer') == {'i': 1, 'm': 3, 'r': 2, 't': 1}", "assert char_freq('stone') == {'i': 0, 'm': 0, 'r': 0, 't': 1}", "assert char_freq('code') == {'i': 0, 'm': 0, 'r': 0, 't': 0}", "assert char_freq('banana signal') == {'i': 1, 'm': 0, 'r': 0, 't': 0}", "assert char_freq('light an rocket of matrix') == {'i': 2, 'm': 1, 'r': 2, 't': 3}", "assert char_freq('') == {'i': 0, 'm': 0, 'r': 0, 't': 0}"], "test_code": "assert char_freq('engine') == {'i': 1, 'm': 0, 'r': 0, 't': 0}\nassert char_freq('by on matrix summer') == {'i': 1, 'm': 3, 'r': 2, 't': 1}\nassert char_freq('stone') == {'i': 0, 'm': 0, 'r': 0, 't': 1}\nassert char_freq('code') == {'i': 0, 'm': 0, 'r': 0, 't': 0}\nassert char_freq('banana signal') == {'i': 1, 'm': 0, 'r': 0, 't': 0}\nassert char_freq('light an rocket of matrix') == {'i': 2, 'm': 1, 'r': 2, 't': 3}\nassert char_freq('') == {'i': 0, 'm': 0, 'r': 0, 't': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'imrt'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'imrt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'i'، 'm'، 'r'، 't' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('engine') == {'i': 1, 'm': 0, 'r': 0, 't': 0}`\nالجواب:", "qhash": "c658eb9387fc190b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]", "tests": ["assert roll([12, 28, 15, 41, 46]) == [46, 12, 28, 15, 41]", "assert roll([-6, 2, 40, 33, -9, 24, 43, 48, 17, 7, 47, 10]) == [7, 47, 10, -6, 2, 40, 33, -9, 24, 43, 48, 17]", "assert roll([41, 36, 34, 5, 26, 18, 22]) == [34, 5, 26, 18, 22, 41, 36]", "assert roll([-5, 2, -3, 2, 29, 46, 3, 36]) == [2, -3, 2, 29, 46, 3, 36, -5]", "assert roll([0, 4, 32, 26, -3, 17, 46, 15]) == [4, 32, 26, -3, 17, 46, 15, 0]", "assert roll([49, 37, 17, -2, 46, 4]) == [-2, 46, 4, 49, 37, 17]", "assert roll([]) == []"], "test_code": "assert roll([12, 28, 15, 41, 46]) == [46, 12, 28, 15, 41]\nassert roll([-6, 2, 40, 33, -9, 24, 43, 48, 17, 7, 47, 10]) == [7, 47, 10, -6, 2, 40, 33, -9, 24, 43, 48, 17]\nassert roll([41, 36, 34, 5, 26, 18, 22]) == [34, 5, 26, 18, 22, 41, 36]\nassert roll([-5, 2, -3, 2, 29, 46, 3, 36]) == [2, -3, 2, 29, 46, 3, 36, -5]\nassert roll([0, 4, 32, 26, -3, 17, 46, 15]) == [4, 32, 26, -3, 17, 46, 15, 0]\nassert roll([49, 37, 17, -2, 46, 4]) == [-2, 46, 4, 49, 37, 17]\nassert roll([]) == []", "answer": "def roll(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]", "completion": " ```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return ____\n```\nمثال: `roll([12, 28, 15, 41, 46]) == [46, 12, 28, 15, 41]`\nالجواب:", "qhash": "596d9218ece3b072"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([33, 18, 19, 7, -16, 57, -19]) == -16", "assert biggest_mult([-16, -40, -40]) == -16", "assert biggest_mult([1, 9]) == None", "assert biggest_mult([-30, -13, -22]) == None", "assert biggest_mult([14, -32, 35]) == -32", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([33, 18, 19, 7, -16, 57, -19]) == -16\nassert biggest_mult([-16, -40, -40]) == -16\nassert biggest_mult([1, 9]) == None\nassert biggest_mult([-30, -13, -22]) == None\nassert biggest_mult([14, -32, 35]) == -32\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(nums):\n    best = 0\n    for x in nums:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(nums):\n    best = 0\n    for x in nums:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([33, 18, 19, 7, -16, 57, -19]) == -16`\nالجواب:", "qhash": "8f0ae5ba65e38d8a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return -1 * x ** 2 + (2) * x + (1)", "tests": ["assert quad(5) == -14", "assert quad(16) == -223", "assert quad(11) == -98", "assert quad(3) == -2", "assert quad(11) == -98", "assert quad(16) == -223", "assert quad(-7) == -62", "assert quad(0) == 1"], "test_code": "assert quad(5) == -14\nassert quad(16) == -223\nassert quad(11) == -98\nassert quad(3) == -2\nassert quad(11) == -98\nassert quad(16) == -223\nassert quad(-7) == -62\nassert quad(0) == 1", "answer": "def quad(x):\n    return -1 * x ** 2 + (2) * x + (1)", "completion": " ```python\ndef quad(x):\n    return -1 * x ** 2 + (2) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -1x² + 2x + 1.\nمثال: `quad(5) == -14`\nالجواب:", "qhash": "ee57e09b2d5a049d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [(x + 7) // 5 for x in range(-5, 6) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [(x + 7) // 5 for x in range(-5, 6) if x % 5 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "635c41ed880bef62", "answer": "[0, 1]\n2 1", "completion": " الناتج:\n```text\n[0, 1]\n2 1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=2):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(calc(-8))\nprint(calc(-8, -2))\nprint(calc(calc(-2), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=2):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(calc(-8))\nprint(calc(-8, -2))\nprint(calc(calc(-2), -8))\n```\nالجواب:", "qhash": "61710b655e4219c4", "answer": "-12\n-4\n20", "completion": " الناتج:\n```text\n-12\n-4\n20\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 97", "tests": ["assert digit_score(85403) == 14", "assert digit_score(534940) == 19", "assert digit_score(266673) == 81", "assert digit_score(721399) == 4", "assert digit_score(163057) == 39", "assert digit_score(253985) == 73", "assert digit_score(845614) == 31", "assert digit_score(0) == 0"], "test_code": "assert digit_score(85403) == 14\nassert digit_score(534940) == 19\nassert digit_score(266673) == 81\nassert digit_score(721399) == 4\nassert digit_score(163057) == 39\nassert digit_score(253985) == 73\nassert digit_score(845614) == 31\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 97", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 97.\nمثال: `digit_score(85403) == 14`\nالجواب:", "qhash": "0c7af6a616135d32"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'حاسوب بيت'\nprint(text.split())\nprint(text.find('س'))\nprint(text[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'حاسوب بيت'\nprint(text.split())\nprint(text.find('س'))\nprint(text[-1])\n```\nالجواب:", "qhash": "19ef259a3e3016f9", "answer": "['حاسوب', 'بيت']\n2\nت", "completion": " الناتج:\n```text\n['حاسوب', 'بيت']\n2\nت\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return 3 * x ** 2 + (-4) * x + (-4)", "tests": ["assert quad(3) == 11", "assert quad(19) == 1003", "assert quad(15) == 611", "assert quad(-17) == 931", "assert quad(-8) == 220", "assert quad(-17) == 931", "assert quad(-17) == 931", "assert quad(0) == -4"], "test_code": "assert quad(3) == 11\nassert quad(19) == 1003\nassert quad(15) == 611\nassert quad(-17) == 931\nassert quad(-8) == 220\nassert quad(-17) == 931\nassert quad(-17) == 931\nassert quad(0) == -4", "answer": "def quad(x):\n    return 3 * x ** 2 + (-4) * x + (-4)", "completion": " ```python\ndef quad(x):\n    return 3 * x ** 2 + (-4) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 3x² - 4x - 4.\nمثال: `quad(3) == 11`\nالجواب:", "qhash": "069fd79593903247"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['banana', 'cloud', 'python', 'winter', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['banana', 'cloud', 'python', 'winter', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "f06cd0414401661b", "answer": "['cloud', 'river', 'banana', 'python', 'winter']\n['winter', 'python', 'banana']", "completion": " الناتج:\n```text\n['cloud', 'river', 'banana', 'python', 'winter']\n['winter', 'python', 'banana']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x * 3 + 3 for x in range(-2, 5) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x * 3 + 3 for x in range(-2, 5) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "0836215b35aaad52", "answer": "[0, 6, 12]\n3 18", "completion": " الناتج:\n```text\n[0, 6, 12]\n3 18\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "caesar", "reference": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-13)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert caesar('code stone an is Hello') == 'pbqr fgbar na vf Hryyb'", "assert caesar('river table') == 'evire gnoyr'", "assert caesar('matrix up we stone') == 'zngevk hc jr fgbar'", "assert caesar('vector it orange') == 'irpgbe vg benatr'", "assert caesar('on an !') == 'ba na !'", "assert caesar('stone') == 'fgbar'", "assert caesar('') == ''"], "test_code": "assert caesar('code stone an is Hello') == 'pbqr fgbar na vf Hryyb'\nassert caesar('river table') == 'evire gnoyr'\nassert caesar('matrix up we stone') == 'zngevk hc jr fgbar'\nassert caesar('vector it orange') == 'irpgbe vg benatr'\nassert caesar('on an !') == 'ba na !'\nassert caesar('stone') == 'fgbar'\nassert caesar('') == ''", "answer": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-13)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-13)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `caesar` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 13 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('code stone an is Hello') == 'pbqr fgbar na vf Hryyb'`\nالجواب:", "qhash": "2ae71bd172326e9b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ben'}", "tests": ["assert letter_stats('orange summer is') == {'b': 0, 'e': 2, 'n': 1}", "assert letter_stats('planet banana') == {'b': 1, 'e': 1, 'n': 3}", "assert letter_stats('camel') == {'b': 0, 'e': 1, 'n': 0}", "assert letter_stats('summer an signal music') == {'b': 0, 'e': 1, 'n': 2}", "assert letter_stats('engine music coffee rocket python desert') == {'b': 0, 'e': 7, 'n': 3}", "assert letter_stats('window a vector falcon winter') == {'b': 0, 'e': 2, 'n': 3}", "assert letter_stats('') == {'b': 0, 'e': 0, 'n': 0}"], "test_code": "assert letter_stats('orange summer is') == {'b': 0, 'e': 2, 'n': 1}\nassert letter_stats('planet banana') == {'b': 1, 'e': 1, 'n': 3}\nassert letter_stats('camel') == {'b': 0, 'e': 1, 'n': 0}\nassert letter_stats('summer an signal music') == {'b': 0, 'e': 1, 'n': 2}\nassert letter_stats('engine music coffee rocket python desert') == {'b': 0, 'e': 7, 'n': 3}\nassert letter_stats('window a vector falcon winter') == {'b': 0, 'e': 2, 'n': 3}\nassert letter_stats('') == {'b': 0, 'e': 0, 'n': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ben'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'ben'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 'e'، 'n' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('orange summer is') == {'b': 0, 'e': 2, 'n': 1}`\nالجواب:", "qhash": "752752e8b4694241"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 12\nfor x in range(4, 27, 1):\n    acc -= x * 2\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 12\nfor x in range(4, 27, 1):\n    acc -= x * 2\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "425ccf087327cc67", "answer": "-678\n26", "completion": " الناتج:\n```text\n-678\n26\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "xs = [12, 24, 22, 11, 1, 31, 22, 33, 22]\nprint(xs[2:9])\nprint(xs[::-2])\nprint(sum(xs[2:9]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nxs = [12, 24, 22, 11, 1, 31, 22, 33, 22]\nprint(xs[2:9])\nprint(xs[::-2])\nprint(sum(xs[2:9]))\n```\nالجواب:", "qhash": "e30111a0778d306c", "answer": "[22, 11, 1, 31, 22, 33, 22]\n[22, 22, 1, 22, 12]\n142", "completion": " الناتج:\n```text\n[22, 11, 1, 31, 22, 33, 22]\n[22, 22, 1, 22, 12]\n142\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "total_pow", "reference": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 2\n    return total", "tests": ["assert total_pow(6) == 728", "assert total_pow(4) == 240", "assert total_pow(10) == 3080", "assert total_pow(6) == 728", "assert total_pow(2) == 40", "assert total_pow(1) == 8", "assert total_pow(0) == 0"], "test_code": "assert total_pow(6) == 728\nassert total_pow(4) == 240\nassert total_pow(10) == 3080\nassert total_pow(6) == 728\nassert total_pow(2) == 40\nassert total_pow(1) == 8\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 2\n    return total", "completion": " ```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 2\n    return total\n```\n", "buggy": "def total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 8 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 8 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 8 * i ** 2\n    return total\n```\nمثال: `total_pow(6) == 728`\nالجواب:", "qhash": "d81c01b26e312290"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return -9 * x ** 2 + (1) * x + (6)", "tests": ["assert poly(3) == -72", "assert poly(-10) == -904", "assert poly(-7) == -442", "assert poly(-6) == -324", "assert poly(12) == -1278", "assert poly(15) == -2004", "assert poly(16) == -2282", "assert poly(0) == 6"], "test_code": "assert poly(3) == -72\nassert poly(-10) == -904\nassert poly(-7) == -442\nassert poly(-6) == -324\nassert poly(12) == -1278\nassert poly(15) == -2004\nassert poly(16) == -2282\nassert poly(0) == 6", "answer": "def poly(x):\n    return -9 * x ** 2 + (1) * x + (6)", "completion": " ```python\ndef poly(x):\n    return -9 * x ** 2 + (1) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -9x² + 1x + 6.\nمثال: `poly(3) == -72`\nالجواب:", "qhash": "39c5870c108b4517"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([38, 4, 36, 12, -13, -5, 15, -9]) == 36", "assert largest_div([-6, -9, -3]) == -3", "assert largest_div([1, 4, 7]) == None", "assert largest_div([]) == None", "assert largest_div([-13, 23, -30]) == -30", "assert largest_div([]) == None"], "test_code": "assert largest_div([38, 4, 36, 12, -13, -5, 15, -9]) == 36\nassert largest_div([-6, -9, -3]) == -3\nassert largest_div([1, 4, 7]) == None\nassert largest_div([]) == None\nassert largest_div([-13, 23, -30]) == -30\nassert largest_div([]) == None", "answer": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `largest_div([38, 4, 36, 12, -13, -5, 15, -9]) == 36`\nالجواب:", "qhash": "73c54600e1650796"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_join", "reference": "def rev_join(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert rev_join('falcon table a window') == 'window-table-falcon'", "assert rev_join('') == ''", "assert rev_join('by window') == 'window-by'", "assert rev_join('rocket') == 'rocket'", "assert rev_join('matrix camel we window light desert') == 'desert-light-window-we-camel-matrix'", "assert rev_join('up of window matrix by') == 'by-matrix-window-of-up'", "assert rev_join('apple to') == 'to-apple'"], "test_code": "assert rev_join('falcon table a window') == 'window-table-falcon'\nassert rev_join('') == ''\nassert rev_join('by window') == 'window-by'\nassert rev_join('rocket') == 'rocket'\nassert rev_join('matrix camel we window light desert') == 'desert-light-window-we-camel-matrix'\nassert rev_join('up of window matrix by') == 'by-matrix-window-of-up'\nassert rev_join('apple to') == 'to-apple'", "answer": "def rev_join(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef rev_join(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_join` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `rev_join('falcon table a window') == 'window-table-falcon'`\nالجواب:", "qhash": "48443820381868f3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'منى': 38, 'رنا': 19, 'سلمى': 47, 'أحمد': 27, 'سعيد': 11}\nd['أحمد'] += 18\nd['هشام'] = 44\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 29])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'منى': 38, 'رنا': 19, 'سلمى': 47, 'أحمد': 27, 'سعيد': 11}\nd['أحمد'] += 18\nd['هشام'] = 44\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 29])\n```\nالجواب:", "qhash": "88430566ca30ca88", "answer": "6\nسلمى\n204\n['منى', 'سلمى', 'أحمد', 'هشام']", "completion": " الناتج:\n```text\n6\nسلمى\n204\n['منى', 'سلمى', 'أحمد', 'هشام']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_terms", "reference": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 4\n    return total", "tests": ["assert sum_terms(4) == 354", "assert sum_terms(14) == 127687", "assert sum_terms(7) == 4676", "assert sum_terms(14) == 127687", "assert sum_terms(4) == 354", "assert sum_terms(1) == 1", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 354\nassert sum_terms(14) == 127687\nassert sum_terms(7) == 4676\nassert sum_terms(14) == 127687\nassert sum_terms(4) == 354\nassert sum_terms(1) == 1\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 4\n    return total", "completion": " ```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 4\n    return total\n```\n", "buggy": "def sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 1 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 1 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 1 * i ** 4\n    return total\n```\nمثال: `sum_terms(4) == 354`\nالجواب:", "qhash": "61100d134488ec60"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 2\nfor n in range(9, 17, 2):\n    s += n * 8\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 2\nfor n in range(9, 17, 2):\n    s += n * 8\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "03a229e1fe4f1b5e", "answer": "386\n15", "completion": " الناتج:\n```text\n386\n15\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_letter", "reference": "def count_letter(text):\n    return sum(1 for w in text.split() if 'ش' in w)", "tests": ["assert count_letter('مطر ليل حديقة مطر حديقة صديق سوق') == 0", "assert count_letter('') == 0", "assert count_letter('خبز جمل شجرة بحر باب') == 1", "assert count_letter('لغة وردة') == 0", "assert count_letter('قمر طالب') == 0", "assert count_letter('بيت جمل قمر جمل معلم') == 0", "assert count_letter('فجر سماء سلام دفتر سلام شمس قهوة') == 1", "assert count_letter('') == 0"], "test_code": "assert count_letter('مطر ليل حديقة مطر حديقة صديق سوق') == 0\nassert count_letter('') == 0\nassert count_letter('خبز جمل شجرة بحر باب') == 1\nassert count_letter('لغة وردة') == 0\nassert count_letter('قمر طالب') == 0\nassert count_letter('بيت جمل قمر جمل معلم') == 0\nassert count_letter('فجر سماء سلام دفتر سلام شمس قهوة') == 1\nassert count_letter('') == 0", "answer": "def count_letter(text):\n    return sum(1 for w in text.split() if 'ش' in w)", "completion": " ```python\ndef count_letter(text):\n    return sum(1 for w in text.split() if 'ش' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ش» مرة واحدة على الأقل.\nمثال: `count_letter('مطر ليل حديقة مطر حديقة صديق سوق') == 0`\nالجواب:", "qhash": "622cd34e88ea0286"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'بيت حصان'\nprint(w[::-1])\nprint(len(w.replace(' ', '')))\nprint(w.find('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'بيت حصان'\nprint(w[::-1])\nprint(len(w.replace(' ', '')))\nprint(w.find('ب'))\n```\nالجواب:", "qhash": "a5bd68f596a7387c", "answer": "ناصح تيب\n7\n0", "completion": " الناتج:\n```text\nناصح تيب\n7\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 64:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([19, 17, 28, 1, 5, 35, 29, 33, 18]) == [19, 36, 64, 0, 5, 40, 0, 33, 51]", "assert cumulative([]) == []", "assert cumulative([9]) == [9]", "assert cumulative([-4]) == [-4]", "assert cumulative([61]) == [61]", "assert cumulative([25, -3, 6, 18, 43, 25, 51, 50]) == [25, 22, 28, 46, 0, 25, 0, 50]", "assert cumulative([]) == []"], "test_code": "assert cumulative([19, 17, 28, 1, 5, 35, 29, 33, 18]) == [19, 36, 64, 0, 5, 40, 0, 33, 51]\nassert cumulative([]) == []\nassert cumulative([9]) == [9]\nassert cumulative([-4]) == [-4]\nassert cumulative([61]) == [61]\nassert cumulative([25, -3, 6, 18, 43, 25, 51, 50]) == [25, 22, 28, 46, 0, 25, 0, 50]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 64:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 64:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 64 (القيمة المسجلة حينها 0).\nمثال: `cumulative([19, 17, 28, 1, 5, 35, 29, 33, 18]) == [19, 36, 64, 0, 5, 40, 0, 33, 51]`\nالجواب:", "qhash": "511899db61f4a73d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "div_not", "reference": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert div_not([3, 67, 70, 30, 20, 32, 88]) == 1", "assert div_not([72, 50, -10]) == 0", "assert div_not([71, 4, 3]) == 0", "assert div_not([80, -26, -8, 50, 13, -33, 87, 69, 57]) == 0", "assert div_not([20, -18, 52, 26, 6, 51, 36]) == 0", "assert div_not([-12, -36]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([3, 67, 70, 30, 20, 32, 88]) == 1\nassert div_not([72, 50, -10]) == 0\nassert div_not([71, 4, 3]) == 0\nassert div_not([80, -26, -8, 50, 13, -33, 87, 69, 57]) == 0\nassert div_not([20, -18, 52, 26, 6, 51, 36]) == 0\nassert div_not([-12, -36]) == 0\nassert div_not([]) == 0", "answer": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `div_not([3, 67, 70, 30, 20, 32, 88]) == 1`\nالجواب:", "qhash": "767ea5fb403c9e27"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_ar", "reference": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))", "tests": ["assert count_ar('عربية نور مدرسة') == 0", "assert count_ar('طالب فجر سفينة') == 0", "assert count_ar('حاسوب حديقة دفتر نور ليل سماء سلام جبل') == 0", "assert count_ar('سماء شجرة سلام باب نور مدينة لغة سلام') == 0", "assert count_ar('لغة ليل شجرة صديق علم') == 0", "assert count_ar('صحراء مكتبة نهار وردة نور مدينة سيارة') == 0", "assert count_ar('حديقة شمس ميناء') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('عربية نور مدرسة') == 0\nassert count_ar('طالب فجر سفينة') == 0\nassert count_ar('حاسوب حديقة دفتر نور ليل سماء سلام جبل') == 0\nassert count_ar('سماء شجرة سلام باب نور مدينة لغة سلام') == 0\nassert count_ar('لغة ليل شجرة صديق علم') == 0\nassert count_ar('صحراء مكتبة نهار وردة نور مدينة سيارة') == 0\nassert count_ar('حديقة شمس ميناء') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))", "completion": " ```python\ndef count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_ar` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ي».\nمثال: `count_ar('عربية نور مدرسة') == 0`\nالجواب:", "qhash": "95d32fe4bb5ab313"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def h(x, y=5):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(h(-3))\nprint(h(-3, -7))\nprint(h(h(-7), -3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef h(x, y=5):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(h(-3))\nprint(h(-3, -7))\nprint(h(h(-7), -3))\n```\nالجواب:", "qhash": "f77132a657d28972", "answer": "7\n1\n9", "completion": " الناتج:\n```text\n7\n1\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['data', 'winter', 'signal', 'python', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['data', 'winter', 'signal', 'python', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "c6a03d08e3b2fbfe", "answer": "['data', 'stone', 'winter', 'signal', 'python']\n['winter', 'signal', 'python']", "completion": " الناتج:\n```text\n['data', 'stone', 'winter', 'signal', 'python']\n['winter', 'signal', 'python']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rotate_letters", "reference": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (7)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rotate_letters('coffee light falcon planet pixel A1') == 'jvmmll spnoa mhsjvu wshula wpels A1'", "assert rotate_letters('winter pixel') == 'dpualy wpels'", "assert rotate_letters('pixel river A1') == 'wpels ypcly A1'", "assert rotate_letters('engine we') == 'lunpul dl'", "assert rotate_letters('apple Hello') == 'hwwsl Hlssv'", "assert rotate_letters('brain') == 'iyhpu'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('coffee light falcon planet pixel A1') == 'jvmmll spnoa mhsjvu wshula wpels A1'\nassert rotate_letters('winter pixel') == 'dpualy wpels'\nassert rotate_letters('pixel river A1') == 'wpels ypcly A1'\nassert rotate_letters('engine we') == 'lunpul dl'\nassert rotate_letters('apple Hello') == 'hwwsl Hlssv'\nassert rotate_letters('brain') == 'iyhpu'\nassert rotate_letters('') == ''", "answer": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (7)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (7)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rotate_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 7 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('coffee light falcon planet pixel A1') == 'jvmmll spnoa mhsjvu wshula wpels A1'`\nالجواب:", "qhash": "24bd701c3a89ec56"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_join", "reference": "def rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert rev_join('light cloud light an window') == 'window/an/light/cloud/light'", "assert rev_join('matrix pixel by python river') == 'river/python/by/pixel/matrix'", "assert rev_join('planet stone signal winter') == 'winter/signal/stone/planet'", "assert rev_join('light coffee an falcon table is') == 'is/table/falcon/an/coffee/light'", "assert rev_join('an planet signal planet') == 'planet/signal/planet/an'", "assert rev_join('river rocket coffee window') == 'window/coffee/rocket/river'", "assert rev_join('stone') == 'stone'"], "test_code": "assert rev_join('light cloud light an window') == 'window/an/light/cloud/light'\nassert rev_join('matrix pixel by python river') == 'river/python/by/pixel/matrix'\nassert rev_join('planet stone signal winter') == 'winter/signal/stone/planet'\nassert rev_join('light coffee an falcon table is') == 'is/table/falcon/an/coffee/light'\nassert rev_join('an planet signal planet') == 'planet/signal/planet/an'\nassert rev_join('river rocket coffee window') == 'window/coffee/rocket/river'\nassert rev_join('stone') == 'stone'", "answer": "def rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_join` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `rev_join('light cloud light an window') == 'window/an/light/cloud/light'`\nالجواب:", "qhash": "ab76a225a50a0014"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_powers", "reference": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total", "tests": ["assert sum_powers(3) == 252", "assert sum_powers(4) == 700", "assert sum_powers(7) == 5488", "assert sum_powers(8) == 9072", "assert sum_powers(3) == 252", "assert sum_powers(1) == 7", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(3) == 252\nassert sum_powers(4) == 700\nassert sum_powers(7) == 5488\nassert sum_powers(8) == 9072\nassert sum_powers(3) == 252\nassert sum_powers(1) == 7\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total", "completion": " ```python\ndef sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total\n```\n", "buggy": "def sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 3\n    return total\n```\nمثال: `sum_powers(3) == 252`\nالجواب:", "qhash": "687212dd1211828a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('حصان قمر فجر قهوة عمل دفتر قلم') == 3", "assert prefix_hits('بيت قهوة') == 1", "assert prefix_hits('قمر قهوة بيت قمر') == 3", "assert prefix_hits('مدرسة شجرة') == 0", "assert prefix_hits('جمل وردة صديق قمر قمر مكتبة طالب') == 2", "assert prefix_hits('قمر دفتر قهوة سفينة') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('حصان قمر فجر قهوة عمل دفتر قلم') == 3\nassert prefix_hits('بيت قهوة') == 1\nassert prefix_hits('قمر قهوة بيت قمر') == 3\nassert prefix_hits('مدرسة شجرة') == 0\nassert prefix_hits('جمل وردة صديق قمر قمر مكتبة طالب') == 2\nassert prefix_hits('قمر دفتر قهوة سفينة') == 2\nassert prefix_hits('') == 0", "answer": "def prefix_hits(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ق'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ق»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ق'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('حصان قمر فجر قهوة عمل دفتر قلم') == 3`\nالجواب:", "qhash": "64333a87778b0685"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_hits", "reference": "def count_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)", "tests": ["assert count_hits('شجرة حديقة رمل حديقة معلم ليل') == 1", "assert count_hits('حديقة طالب سلام') == 0", "assert count_hits('مطر صحراء قلم قلم علم') == 0", "assert count_hits('') == 0", "assert count_hits('ميناء خبز تفاحة') == 0", "assert count_hits('خبز صديق رمل') == 0", "assert count_hits('لغة ليل معلم سوق برتقال سوق سفينة') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('شجرة حديقة رمل حديقة معلم ليل') == 1\nassert count_hits('حديقة طالب سلام') == 0\nassert count_hits('مطر صحراء قلم قلم علم') == 0\nassert count_hits('') == 0\nassert count_hits('ميناء خبز تفاحة') == 0\nassert count_hits('خبز صديق رمل') == 0\nassert count_hits('لغة ليل معلم سوق برتقال سوق سفينة') == 0\nassert count_hits('') == 0", "answer": "def count_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)", "completion": " ```python\ndef count_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ج» مرة واحدة على الأقل.\nمثال: `count_hits('شجرة حديقة رمل حديقة معلم ليل') == 1`\nالجواب:", "qhash": "2f046a62ad643547"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "xs = [36, 34, 26, 17, 25, 1, -8]\nprint(xs[1:6])\nprint(xs[::3])\nprint(len(xs[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nxs = [36, 34, 26, 17, 25, 1, -8]\nprint(xs[1:6])\nprint(xs[::3])\nprint(len(xs[1:6]))\n```\nالجواب:", "qhash": "4bc3ca38a0b8a0c6", "answer": "[34, 26, 17, 25, 1]\n[36, 17, -8]\n5", "completion": " الناتج:\n```text\n[34, 26, 17, 25, 1]\n[36, 17, -8]\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n <= 3:\n        return 4\n    return 2 * rec(n - 1) + 0\n\nprint(rec(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n <= 3:\n        return 4\n    return 2 * rec(n - 1) + 0\n\nprint(rec(7))\n```\nالجواب:", "qhash": "8435f490b38a4f90", "answer": "64", "completion": " الناتج:\n```text\n64\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "tests": ["assert series(5) == 1958", "assert series(1) == 2", "assert series(10) == 50666", "assert series(4) == 708", "assert series(7) == 9352", "assert series(1) == 2", "assert series(0) == 0"], "test_code": "assert series(5) == 1958\nassert series(1) == 2\nassert series(10) == 50666\nassert series(4) == 708\nassert series(7) == 9352\nassert series(1) == 2\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 2 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 2 * i ** 4\n    return total\n```\nمثال: `series(5) == 1958`\nالجواب:", "qhash": "36c7776baf55f0e2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_of_div", "reference": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_of_div([-21, 50, 29, 26, 58, 11, 16]) == 50", "assert max_of_div([-20, -10, -15]) == -10", "assert max_of_div([1]) == None", "assert max_of_div([31, 16, 2, -31, 32, -23, 17]) == None", "assert max_of_div([-33, 19, 37, -9, 5, -21, 24, -50]) == 5", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-21, 50, 29, 26, 58, 11, 16]) == 50\nassert max_of_div([-20, -10, -15]) == -10\nassert max_of_div([1]) == None\nassert max_of_div([31, 16, 2, -31, 32, -23, 17]) == None\nassert max_of_div([-33, 19, 37, -9, 5, -21, 24, -50]) == 5\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 5 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 5 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `max_of_div([-21, 50, 29, 26, 58, 11, 16]) == 50`\nالجواب:", "qhash": "39c5ea8b065fed2f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 23", "tests": ["assert step_product(6) == 18", "assert step_product(42) == 19", "assert step_product(13) == 6", "assert step_product(47) == 0", "assert step_product(11) == 6", "assert step_product(30) == 7", "assert step_product(0) == 1"], "test_code": "assert step_product(6) == 18\nassert step_product(42) == 19\nassert step_product(13) == 6\nassert step_product(47) == 0\nassert step_product(11) == 6\nassert step_product(30) == 7\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 23", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(6) == 18`\nالجواب:", "qhash": "f1ff3781991550b5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([76, 6, 62, 57, 20, 6, 9, 87, 84, 83, 52]) == 3", "assert tally_div([86, 19, 45, 38]) == 0", "assert tally_div([27, 82, 45, -34, -24, 85, 57, 89, -22, 28, 49, 83]) == 1", "assert tally_div([60, 30, 12, 30, 87, 15, -33, 62, 82, -20, 52, -11]) == 2", "assert tally_div([-1, 41, 19, -17, 60, 77]) == 0", "assert tally_div([13, 60, -5]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([76, 6, 62, 57, 20, 6, 9, 87, 84, 83, 52]) == 3\nassert tally_div([86, 19, 45, 38]) == 0\nassert tally_div([27, 82, 45, -34, -24, 85, 57, 89, -22, 28, 49, 83]) == 1\nassert tally_div([60, 30, 12, 30, 87, 15, -33, 62, 82, -20, 52, -11]) == 2\nassert tally_div([-1, 41, 19, -17, 60, 77]) == 0\nassert tally_div([13, 60, -5]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([76, 6, 62, 57, 20, 6, 9, 87, 84, 83, 52]) == 3`\nالجواب:", "qhash": "bc5804b75ab55610"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 45) == 1)", "tests": ["assert coprimes(13) == 7", "assert coprimes(66) == 35", "assert coprimes(165) == 88", "assert coprimes(102) == 54", "assert coprimes(112) == 60", "assert coprimes(46) == 25", "assert coprimes(1) == 1"], "test_code": "assert coprimes(13) == 7\nassert coprimes(66) == 35\nassert coprimes(165) == 88\nassert coprimes(102) == 54\nassert coprimes(112) == 60\nassert coprimes(46) == 25\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 45) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 45) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 45 في أي قاسم أكبر من 1.\nمثال: `coprimes(13) == 7`\nالجواب:", "qhash": "7f1e90b65c77ec79"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_of_div", "reference": "def max_of_div(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_of_div([-3, -18, -11, -24, 39, 6, 12, 43]) == 12", "assert max_of_div([-12, -20, -12]) == -12", "assert max_of_div([1, 5, 9, 13]) == None", "assert max_of_div([18, -6, 12, -20, -4]) == 12", "assert max_of_div([19, -33, -17]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-3, -18, -11, -24, 39, 6, 12, 43]) == 12\nassert max_of_div([-12, -20, -12]) == -12\nassert max_of_div([1, 5, 9, 13]) == None\nassert max_of_div([18, -6, 12, -20, -4]) == 12\nassert max_of_div([19, -33, -17]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_of_div(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_of_div(arr):\n    best = 0\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_of_div(arr):\n    best = 0\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_of_div([-3, -18, -11, -24, 39, 6, 12, 43]) == 12`\nالجواب:", "qhash": "03f1f8d2ac3c9461"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'table'\nprint(text.split('_'))\nprint(text[1:4])\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'table'\nprint(text.split('_'))\nprint(text[1:4])\nprint(len(text))\n```\nالجواب:", "qhash": "d603d793b7428f57", "answer": "['table']\nabl\n5", "completion": " الناتج:\n```text\n['table']\nabl\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([80, 71, 15, 60, 88, 91, 50]) == [80, 151, 166, 0, 88, 179, 0]", "assert acc_reset([197, 177, 63, 193, 162, 61, 32, 177, 92]) == [197, 0, 63, 0, 162, 0, 32, 0, 92]", "assert acc_reset([4, 75, 171, 122, 77, -3, 55]) == [4, 79, 0, 122, 199, 196, 0]", "assert acc_reset([17]) == [17]", "assert acc_reset([]) == []", "assert acc_reset([74]) == [74]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([80, 71, 15, 60, 88, 91, 50]) == [80, 151, 166, 0, 88, 179, 0]\nassert acc_reset([197, 177, 63, 193, 162, 61, 32, 177, 92]) == [197, 0, 63, 0, 162, 0, 32, 0, 92]\nassert acc_reset([4, 75, 171, 122, 77, -3, 55]) == [4, 79, 0, 122, 199, 196, 0]\nassert acc_reset([17]) == [17]\nassert acc_reset([]) == []\nassert acc_reset([74]) == [74]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 200 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([80, 71, 15, 60, 88, 91, 50]) == [80, 151, 166, 0, 88, 179, 0]`\nالجواب:", "qhash": "a871413e8e1f7546"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 1\nfor j in range(-2, 12, 4):\n    result -= j * 1\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 1\nfor j in range(-2, 12, 4):\n    result -= j * 1\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "fb91092b0db5f222", "answer": "-15\n10", "completion": " الناتج:\n```text\n-15\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizz", "reference": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz']", "assert fizz(25) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23', '24', '25']", "assert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10']", "assert fizz(9) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz']", "assert fizz(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']"], "test_code": "assert fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz']\nassert fizz(25) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23', '24', '25']\nassert fizz(10) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10']\nassert fizz(9) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz']\nassert fizz(12) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12']", "answer": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Fizz'، مضاعفات 9 تصبح 'Buzz'، المضاعفات المشتركة تصبح 'FizzBuzz'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizz(14) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz']`\nالجواب:", "qhash": "de0a86920f6979e8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 13\nfor x in range(8, 14, 3):\n    result -= x * 1\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 13\nfor x in range(8, 14, 3):\n    result -= x * 1\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "883ccf32be6676bd", "answer": "-6\n11", "completion": " الناتج:\n```text\n-6\n11\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 29", "tests": ["assert fact_mod(6) == 18", "assert fact_mod(46) == 14", "assert fact_mod(9) == 17", "assert fact_mod(2) == 2", "assert fact_mod(23) == 21", "assert fact_mod(15) == 15", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 18\nassert fact_mod(46) == 14\nassert fact_mod(9) == 17\nassert fact_mod(2) == 2\nassert fact_mod(23) == 21\nassert fact_mod(15) == 15\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 29", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(6) == 18`\nالجواب:", "qhash": "0037fbcd5a83ce36"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 3\nfor x in range(-3, 6, 4):\n    total += x * 3\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 3\nfor x in range(-3, 6, 4):\n    total += x * 3\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "f3a95764cd095caf", "answer": "12\n5", "completion": " الناتج:\n```text\n12\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'egh'}", "tests": ["assert freq_of('to window') == {'e': 0, 'g': 0, 'h': 0}", "assert freq_of('engine window is') == {'e': 2, 'g': 1, 'h': 0}", "assert freq_of('up of planet matrix engine up') == {'e': 3, 'g': 1, 'h': 0}", "assert freq_of('in apple') == {'e': 1, 'g': 0, 'h': 0}", "assert freq_of('matrix window table') == {'e': 1, 'g': 0, 'h': 0}", "assert freq_of('rocket by it') == {'e': 1, 'g': 0, 'h': 0}", "assert freq_of('') == {'e': 0, 'g': 0, 'h': 0}"], "test_code": "assert freq_of('to window') == {'e': 0, 'g': 0, 'h': 0}\nassert freq_of('engine window is') == {'e': 2, 'g': 1, 'h': 0}\nassert freq_of('up of planet matrix engine up') == {'e': 3, 'g': 1, 'h': 0}\nassert freq_of('in apple') == {'e': 1, 'g': 0, 'h': 0}\nassert freq_of('matrix window table') == {'e': 1, 'g': 0, 'h': 0}\nassert freq_of('rocket by it') == {'e': 1, 'g': 0, 'h': 0}\nassert freq_of('') == {'e': 0, 'g': 0, 'h': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'egh'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'egh'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'g'، 'h' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('to window') == {'e': 0, 'g': 0, 'h': 0}`\nالجواب:", "qhash": "7856684c651a4239"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 2 for d in str(n)) % 64", "tests": ["assert digit_power(87486) == 37", "assert digit_power(171058) == 12", "assert digit_power(798266) == 14", "assert digit_power(447896) == 6", "assert digit_power(561028) == 2", "assert digit_power(938187) == 12", "assert digit_power(783760) == 15", "assert digit_power(0) == 0"], "test_code": "assert digit_power(87486) == 37\nassert digit_power(171058) == 12\nassert digit_power(798266) == 14\nassert digit_power(447896) == 6\nassert digit_power(561028) == 2\nassert digit_power(938187) == 12\nassert digit_power(783760) == 15\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 2 for d in str(n)) % 64", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 2 for d in str(n)) % 64\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 64.\nمثال: `digit_power(87486) == 37`\nالجواب:", "qhash": "427742f8f79bb63a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'cloud_pixel'\nprint(name.upper())\nprint(name[::-1])\nprint(name[-3:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'cloud_pixel'\nprint(name.upper())\nprint(name[::-1])\nprint(name[-3:])\n```\nالجواب:", "qhash": "546c6bada82bf01a", "answer": "CLOUD_PIXEL\nlexip_duolc\nxel", "completion": " الناتج:\n```text\nCLOUD_PIXEL\nlexip_duolc\nxel\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [(x + 8) // 5 for x in range(2, 9) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [(x + 8) // 5 for x in range(2, 9) if x % 5 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "b5433db0a346eee8", "answer": "[2]\n1 2", "completion": " الناتج:\n```text\n[2]\n1 2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'نور حاسوب'\nprint(len(w.replace(' ', '')))\nprint(w[-1])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'نور حاسوب'\nprint(len(w.replace(' ', '')))\nprint(w[-1])\nprint(w.split())\n```\nالجواب:", "qhash": "76283019f784514b", "answer": "8\nب\n['نور', 'حاسوب']", "completion": " الناتج:\n```text\n8\nب\n['نور', 'حاسوب']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 321\nsteps = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    steps += 1\nprint(steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 321\nsteps = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    steps += 1\nprint(steps)\n```\nالجواب:", "qhash": "3c7ca54c126a05f3", "answer": "24", "completion": " الناتج:\n```text\n24\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 13\nfor n in range(6, 10, 4):\n    result -= n * 4\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 13\nfor n in range(6, 10, 4):\n    result -= n * 4\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "adba41f2378e1bd8", "answer": "-11\n6", "completion": " الناتج:\n```text\n-11\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "game", "reference": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert game(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23']", "assert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']", "assert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']", "assert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16']", "assert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']"], "test_code": "assert game(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23']\nassert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']\nassert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']\nassert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16']\nassert game(8) == ['1', '2', '3', '4', '5', 'Red', '7', '8']", "answer": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `game` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Red'، مضاعفات 9 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `game(23) == ['1', '2', '3', '4', '5', 'Red', '7', '8', 'Blue', '10', '11', 'Red', '13', '14', '15', '16', '17', 'RedBlue', '19', '20', '21', '22', '23']`\nالجواب:", "qhash": "03f63e82d3ff39e7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 55) == 1)", "tests": ["assert coprimes(93) == 68", "assert coprimes(99) == 72", "assert coprimes(176) == 128", "assert coprimes(143) == 104", "assert coprimes(33) == 24", "assert coprimes(133) == 97", "assert coprimes(1) == 1"], "test_code": "assert coprimes(93) == 68\nassert coprimes(99) == 72\nassert coprimes(176) == 128\nassert coprimes(143) == 104\nassert coprimes(33) == 24\nassert coprimes(133) == 97\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 55) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 55) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 55 في أي قاسم أكبر من 1.\nمثال: `coprimes(93) == 68`\nالجواب:", "qhash": "bad8ca990d9c8a6d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "backwards", "reference": "def backwards(s):\n    return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert backwards('rocket a music summer apple we music river') == 'river,music,apple,summer,music,rocket'", "assert backwards('') == ''", "assert backwards('matrix falcon at light an garden coffee by') == 'coffee,garden,light,falcon,matrix'", "assert backwards('music go is an light a stone') == 'stone,light,music'", "assert backwards('') == ''", "assert backwards('engine banana apple a matrix garden') == 'garden,matrix,apple,banana,engine'", "assert backwards('python music python signal music') == 'music,signal,python,music,python'"], "test_code": "assert backwards('rocket a music summer apple we music river') == 'river,music,apple,summer,music,rocket'\nassert backwards('') == ''\nassert backwards('matrix falcon at light an garden coffee by') == 'coffee,garden,light,falcon,matrix'\nassert backwards('music go is an light a stone') == 'stone,light,music'\nassert backwards('') == ''\nassert backwards('engine banana apple a matrix garden') == 'garden,matrix,apple,banana,engine'\nassert backwards('python music python signal music') == 'music,signal,python,music,python'", "answer": "def backwards(s):\n    return ','.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef backwards(s):\n    return ','.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `backwards` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 4 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `backwards('rocket a music summer apple we music river') == 'river,music,apple,summer,music,rocket'`\nالجواب:", "qhash": "de59c76e04f59bb0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=8):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(calc(-9))\nprint(calc(-9, 5))\nprint(calc(calc(5), -9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=8):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(calc(-9))\nprint(calc(-9, 5))\nprint(calc(calc(5), -9))\n```\nالجواب:", "qhash": "d95299f1ac6ce545", "answer": "-9\n-9\n9", "completion": " الناتج:\n```text\n-9\n-9\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_hits", "reference": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ت'))", "tests": ["assert count_hits('سوق سفينة حاسوب نهر قلم مدرسة حاسوب') == 0", "assert count_hits('') == 0", "assert count_hits('وردة سوق بيت حديقة') == 0", "assert count_hits('علم حديقة جبل نور حاسوب رمل شمس') == 0", "assert count_hits('فجر كتاب برمجة سماء') == 0", "assert count_hits('') == 0", "assert count_hits('') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('سوق سفينة حاسوب نهر قلم مدرسة حاسوب') == 0\nassert count_hits('') == 0\nassert count_hits('وردة سوق بيت حديقة') == 0\nassert count_hits('علم حديقة جبل نور حاسوب رمل شمس') == 0\nassert count_hits('فجر كتاب برمجة سماء') == 0\nassert count_hits('') == 0\nassert count_hits('') == 0\nassert count_hits('') == 0", "answer": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ت'))", "completion": " ```python\ndef count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ت'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ت».\nمثال: `count_hits('سوق سفينة حاسوب نهر قلم مدرسة حاسوب') == 0`\nالجواب:", "qhash": "d65cb1061f82aa91"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 40", "tests": ["assert digit_power(91995) == 33", "assert digit_power(454161) == 31", "assert digit_power(254445) == 10", "assert digit_power(338761) == 6", "assert digit_power(717597) == 4", "assert digit_power(318958) == 26", "assert digit_power(67024) == 31", "assert digit_power(0) == 0"], "test_code": "assert digit_power(91995) == 33\nassert digit_power(454161) == 31\nassert digit_power(254445) == 10\nassert digit_power(338761) == 6\nassert digit_power(717597) == 4\nassert digit_power(318958) == 26\nassert digit_power(67024) == 31\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 40", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 40\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 40.\nمثال: `digit_power(91995) == 33`\nالجواب:", "qhash": "b24d18460a0a1b75"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return -5 * x ** 2 + (-2) * x + (-6)", "tests": ["assert quad(2) == -30", "assert quad(7) == -265", "assert quad(-19) == -1773", "assert quad(1) == -13", "assert quad(7) == -265", "assert quad(-7) == -237", "assert quad(6) == -198", "assert quad(0) == -6"], "test_code": "assert quad(2) == -30\nassert quad(7) == -265\nassert quad(-19) == -1773\nassert quad(1) == -13\nassert quad(7) == -265\nassert quad(-7) == -237\nassert quad(6) == -198\nassert quad(0) == -6", "answer": "def quad(x):\n    return -5 * x ** 2 + (-2) * x + (-6)", "completion": " ```python\ndef quad(x):\n    return -5 * x ** 2 + (-2) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -5x² - 2x - 6.\nمثال: `quad(2) == -30`\nالجواب:", "qhash": "d3c6b7f2d14f521f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "div_not", "reference": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 9 != 0:\n            count += 1\n    return count", "tests": ["assert div_not([4, 19, 8, 4, 67, 10]) == 0", "assert div_not([-39, 46, 71, 84, 57, 25, -28]) == 3", "assert div_not([16, 66, -30, 5, 65, 2, 56, 9, 24, -30]) == 4", "assert div_not([-19, 0, 47, -30, 21]) == 2", "assert div_not([43, 45, 51, 85, -5, -26, -30, 72, 68, 22, 15, 16]) == 3", "assert div_not([45]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([4, 19, 8, 4, 67, 10]) == 0\nassert div_not([-39, 46, 71, 84, 57, 25, -28]) == 3\nassert div_not([16, 66, -30, 5, 65, 2, 56, 9, 24, -30]) == 4\nassert div_not([-19, 0, 47, -30, 21]) == 2\nassert div_not([43, 45, 51, 85, -5, -26, -30, 72, 68, 22, 15, 16]) == 3\nassert div_not([45]) == 0\nassert div_not([]) == 0", "answer": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 9 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 9 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 9. اكتب الحل كاملًا.\n```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `div_not([4, 19, 8, 4, 67, 10]) == 0`\nالجواب:", "qhash": "bf425db49336f203"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 109:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([11, 3, 51, 4, 51, 39]) == [11, 14, 65, 69, 0, 39]", "assert capped_cumsum([55, 30]) == [55, 85]", "assert capped_cumsum([26, 67, 0, 59, 3, 68, 39, 23, 28, 29]) == [26, 93, 93, 0, 3, 71, 0, 23, 51, 80]", "assert capped_cumsum([4]) == [4]", "assert capped_cumsum([-6, 59, 31, 28, -7, 45, 17]) == [-6, 53, 84, 0, -7, 38, 55]", "assert capped_cumsum([35, 36, 2, 97, 44, 31, 73, 8]) == [35, 71, 73, 0, 44, 75, 0, 8]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([11, 3, 51, 4, 51, 39]) == [11, 14, 65, 69, 0, 39]\nassert capped_cumsum([55, 30]) == [55, 85]\nassert capped_cumsum([26, 67, 0, 59, 3, 68, 39, 23, 28, 29]) == [26, 93, 93, 0, 3, 71, 0, 23, 51, 80]\nassert capped_cumsum([4]) == [4]\nassert capped_cumsum([-6, 59, 31, 28, -7, 45, 17]) == [-6, 53, 84, 0, -7, 38, 55]\nassert capped_cumsum([35, 36, 2, 97, 44, 31, 73, 8]) == [35, 71, 73, 0, 44, 75, 0, 8]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 109:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 109:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 109 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([11, 3, 51, 4, 51, 39]) == [11, 14, 65, 69, 0, 39]`\nالجواب:", "qhash": "4d2805a551e0a0aa"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(xs):\n    if not xs:\n        return []\n    k = 2 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([40, 1, 21, 9, 30, 43, 26, 12]) == [26, 12, 40, 1, 21, 9, 30, 43]", "assert roll([-7, -6, 31, -4, 15, 21, 4, 41, 19, 5, 2, 2]) == [2, 2, -7, -6, 31, -4, 15, 21, 4, 41, 19, 5]", "assert roll([13, -6, -5, -8, 50, 18]) == [50, 18, 13, -6, -5, -8]", "assert roll([6, 27, -1, 32, -3, 5, -4, 2, 18]) == [2, 18, 6, 27, -1, 32, -3, 5, -4]", "assert roll([18, 44, -8, 42, 40, 18, 23]) == [18, 23, 18, 44, -8, 42, 40]", "assert roll([10, 16]) == [10, 16]", "assert roll([]) == []"], "test_code": "assert roll([40, 1, 21, 9, 30, 43, 26, 12]) == [26, 12, 40, 1, 21, 9, 30, 43]\nassert roll([-7, -6, 31, -4, 15, 21, 4, 41, 19, 5, 2, 2]) == [2, 2, -7, -6, 31, -4, 15, 21, 4, 41, 19, 5]\nassert roll([13, -6, -5, -8, 50, 18]) == [50, 18, 13, -6, -5, -8]\nassert roll([6, 27, -1, 32, -3, 5, -4, 2, 18]) == [2, 18, 6, 27, -1, 32, -3, 5, -4]\nassert roll([18, 44, -8, 42, 40, 18, 23]) == [18, 23, 18, 44, -8, 42, 40]\nassert roll([10, 16]) == [10, 16]\nassert roll([]) == []", "answer": "def roll(xs):\n    if not xs:\n        return []\n    k = 2 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 2 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 2 % len(xs)\n    return ____\n```\nمثال: `roll([40, 1, 21, 9, 30, 43, 26, 12]) == [26, 12, 40, 1, 21, 9, 30, 43]`\nالجواب:", "qhash": "f74e2bd081f3cb6d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "starts_count", "reference": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count", "tests": ["assert starts_count('خبز بحر سلام ماء') == 0", "assert starts_count('سيارة فجر مدينة يمل مدرسة نهار') == 1", "assert starts_count('يمل لغة يمل حاسوب مطر حاسوب') == 2", "assert starts_count('سلام قمر يمل ليل بحر عمل حصان') == 1", "assert starts_count('حديقة فجر شجرة قلم مكتبة مطر') == 0", "assert starts_count('ماء فجر يمل مدرسة') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('خبز بحر سلام ماء') == 0\nassert starts_count('سيارة فجر مدينة يمل مدرسة نهار') == 1\nassert starts_count('يمل لغة يمل حاسوب مطر حاسوب') == 2\nassert starts_count('سلام قمر يمل ليل بحر عمل حصان') == 1\nassert starts_count('حديقة فجر شجرة قلم مكتبة مطر') == 0\nassert starts_count('ماء فجر يمل مدرسة') == 1\nassert starts_count('') == 0", "answer": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count", "completion": " ```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count\n```\n", "buggy": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ي' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ي»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ي' in w:\n            count += 1\n    return count\n```\nمثال: `starts_count('خبز بحر سلام ماء') == 0`\nالجواب:", "qhash": "12ef21ba618c4b12"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "turn_list", "reference": "def turn_list(xs):\n    if not xs:\n        return []\n    k = 11 % len(xs)\n    return xs[k:] + xs[:k]", "tests": ["assert turn_list([39, 22, 19]) == [19, 39, 22]", "assert turn_list([26, -7, -3, 1, 47, 28]) == [28, 26, -7, -3, 1, 47]", "assert turn_list([15]) == [15]", "assert turn_list([18, 33, -7, 6, 48, -8, -1, 2, 31, 43, 15]) == [18, 33, -7, 6, 48, -8, -1, 2, 31, 43, 15]", "assert turn_list([29, 33, 37, -3, 5, 28, 43, -5, 10, 5]) == [33, 37, -3, 5, 28, 43, -5, 10, 5, 29]", "assert turn_list([49, 21, 26, 19, 19, 6]) == [6, 49, 21, 26, 19, 19]", "assert turn_list([]) == []"], "test_code": "assert turn_list([39, 22, 19]) == [19, 39, 22]\nassert turn_list([26, -7, -3, 1, 47, 28]) == [28, 26, -7, -3, 1, 47]\nassert turn_list([15]) == [15]\nassert turn_list([18, 33, -7, 6, 48, -8, -1, 2, 31, 43, 15]) == [18, 33, -7, 6, 48, -8, -1, 2, 31, 43, 15]\nassert turn_list([29, 33, 37, -3, 5, 28, 43, -5, 10, 5]) == [33, 37, -3, 5, 28, 43, -5, 10, 5, 29]\nassert turn_list([49, 21, 26, 19, 19, 6]) == [6, 49, 21, 26, 19, 19]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n    if not xs:\n        return []\n    k = 11 % len(xs)\n    return xs[k:] + xs[:k]", "completion": " ```python\ndef turn_list(xs):\n    if not xs:\n        return []\n    k = 11 % len(xs)\n    return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 11 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef turn_list(xs):\n    if not xs:\n        return []\n    k = 11 % len(xs)\n    return ____\n```\nمثال: `turn_list([39, 22, 19]) == [19, 39, 22]`\nالجواب:", "qhash": "7904968159d9a880"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [-3, -3, 29, -8, 14, 19]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-3, -3, 29, -8, 14, 19]\nprint(sorted(nums, key=lambda x: (abs(x - 8), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "9e512c2af86ce3d0", "answer": "[14, -3, -3, 19, -8, 29]\n[29, 19, 14]", "completion": " الناتج:\n```text\n[14, -3, -3, 19, -8, 29]\n[29, 19, 14]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x * 0 + -2 for x in range(-3, 4) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x * 0 + -2 for x in range(-3, 4) if x % 3 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "e22122066e0dc762", "answer": "[-2, -2]\n2 -4", "completion": " الناتج:\n```text\n[-2, -2]\n2 -4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'cloud_cloud'\nprint(text.count('o'))\nprint(text.capitalize())\nprint(text.index('o') + len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'cloud_cloud'\nprint(text.count('o'))\nprint(text.capitalize())\nprint(text.index('o') + len(text))\n```\nالجواب:", "qhash": "2859ceb84c27576b", "answer": "2\nCloud_cloud\n13", "completion": " الناتج:\n```text\n2\nCloud_cloud\n13\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 5 for x in xs if -2 <= x <= 38)", "tests": ["assert between_times([29, 21, -1, 39, 36, 24, 47, 30, 27, 27]) == [-5, 105, 120, 135, 135, 145, 150, 180]", "assert between_times([13, -24, 38, 19]) == [65, 95, 190]", "assert between_times([57]) == []", "assert between_times([]) == []", "assert between_times([1, 52, 42, -22, -20]) == [5]", "assert between_times([41, -16, 38, 16, -6]) == [80, 190]", "assert between_times([9, 36, -27, -7, 36, -2, 53, -26]) == [-10, 45, 180, 180]", "assert between_times([]) == []"], "test_code": "assert between_times([29, 21, -1, 39, 36, 24, 47, 30, 27, 27]) == [-5, 105, 120, 135, 135, 145, 150, 180]\nassert between_times([13, -24, 38, 19]) == [65, 95, 190]\nassert between_times([57]) == []\nassert between_times([]) == []\nassert between_times([1, 52, 42, -22, -20]) == [5]\nassert between_times([41, -16, 38, 16, -6]) == [80, 190]\nassert between_times([9, 36, -27, -7, 36, -2, 53, -26]) == [-10, 45, 180, 180]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 5 for x in xs if -2 <= x <= 38)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 5 for x in xs if -2 <= x <= 38)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [-2, 38].\nمثال: `between_times([29, 21, -1, 39, 36, 24, 47, 30, 27, 27]) == [-5, 105, 120, 135, 135, 145, 150, 180]`\nالجواب:", "qhash": "42fe5e9ac1d2956e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return -7 * x ** 2 + (3) * x + (-5)", "tests": ["assert evaluate(5) == -165", "assert evaluate(-9) == -599", "assert evaluate(3) == -59", "assert evaluate(12) == -977", "assert evaluate(-12) == -1049", "assert evaluate(7) == -327", "assert evaluate(-9) == -599", "assert evaluate(0) == -5"], "test_code": "assert evaluate(5) == -165\nassert evaluate(-9) == -599\nassert evaluate(3) == -59\nassert evaluate(12) == -977\nassert evaluate(-12) == -1049\nassert evaluate(7) == -327\nassert evaluate(-9) == -599\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n    return -7 * x ** 2 + (3) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n    return -7 * x ** 2 + (3) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -7x² + 3x - 5.\nمثال: `evaluate(5) == -165`\nالجواب:", "qhash": "a3d032a88cf7f00a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([12, 12, 46, 1, 2, 22, 27, 51]) == None", "assert largest_div([-24, -16, -8]) == -8", "assert largest_div([1, 9, 17, 25]) == None", "assert largest_div([-36, 0, -16, -33, -1]) == 0", "assert largest_div([16, -40, -13, -27, -39]) == 16", "assert largest_div([]) == None"], "test_code": "assert largest_div([12, 12, 46, 1, 2, 22, 27, 51]) == None\nassert largest_div([-24, -16, -8]) == -8\nassert largest_div([1, 9, 17, 25]) == None\nassert largest_div([-36, 0, -16, -33, -1]) == 0\nassert largest_div([16, -40, -13, -27, -39]) == 16\nassert largest_div([]) == None", "answer": "def largest_div(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(arr):\n    best = 0\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(arr):\n    best = 0\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `largest_div([12, 12, 46, 1, 2, 22, 27, 51]) == None`\nالجواب:", "qhash": "c8d968d2f064d6b6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Foo'\n        if i % 10 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(15) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'FooBar', '11', 'Foo', '13', 'Foo', '15']", "assert label_numbers(5) == ['1', 'Foo', '3', 'Foo', '5']", "assert label_numbers(8) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo']", "assert label_numbers(6) == ['1', 'Foo', '3', 'Foo', '5', 'Foo']", "assert label_numbers(14) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'FooBar', '11', 'Foo', '13', 'Foo']"], "test_code": "assert label_numbers(15) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'FooBar', '11', 'Foo', '13', 'Foo', '15']\nassert label_numbers(5) == ['1', 'Foo', '3', 'Foo', '5']\nassert label_numbers(8) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo']\nassert label_numbers(6) == ['1', 'Foo', '3', 'Foo', '5', 'Foo']\nassert label_numbers(14) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'FooBar', '11', 'Foo', '13', 'Foo']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Foo'\n        if i % 10 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Foo'\n        if i % 10 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Foo'، مضاعفات 10 تصبح 'Bar'، المضاعفات المشتركة تصبح 'FooBar'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(15) == ['1', 'Foo', '3', 'Foo', '5', 'Foo', '7', 'Foo', '9', 'FooBar', '11', 'Foo', '13', 'Foo', '15']`\nالجواب:", "qhash": "b42e344b1388d044"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_initial", "reference": "def count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "tests": ["assert count_initial('خبز مدرسة تفاحة معلم شمس ميناء تفاحة') == 2", "assert count_initial('تفاحة سماء فجر شمس فجر قمر تفاحة') == 2", "assert count_initial('برمجة حصان بحر بحر قلم تفاحة بيت') == 1", "assert count_initial('تفاحة مكتبة سوق نهر طائرة لغة') == 1", "assert count_initial('علم برمجة بحر تفاحة طالب تفاحة حديقة دفتر') == 2", "assert count_initial('بحر قمر تفاحة نهر') == 1", "assert count_initial('') == 0"], "test_code": "assert count_initial('خبز مدرسة تفاحة معلم شمس ميناء تفاحة') == 2\nassert count_initial('تفاحة سماء فجر شمس فجر قمر تفاحة') == 2\nassert count_initial('برمجة حصان بحر بحر قلم تفاحة بيت') == 1\nassert count_initial('تفاحة مكتبة سوق نهر طائرة لغة') == 1\nassert count_initial('علم برمجة بحر تفاحة طالب تفاحة حديقة دفتر') == 2\nassert count_initial('بحر قمر تفاحة نهر') == 1\nassert count_initial('') == 0", "answer": "def count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "completion": " ```python\ndef count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count\n```\n", "buggy": "def count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ت'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ت»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ت'):\n            count += 1\n    return count\n```\nمثال: `count_initial('خبز مدرسة تفاحة معلم شمس ميناء تفاحة') == 2`\nالجواب:", "qhash": "c1112ab31aebf83d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert mirror_words('garden data data is camel of signal table') == 'table signal camel data data garden'", "assert mirror_words('coffee') == 'coffee'", "assert mirror_words('data code') == 'code data'", "assert mirror_words('we up an summer vector of matrix go') == 'matrix vector summer'", "assert mirror_words('python camel go in table it') == 'table camel python'", "assert mirror_words('apple data code up python brain') == 'brain python code data apple'", "assert mirror_words('') == ''"], "test_code": "assert mirror_words('garden data data is camel of signal table') == 'table signal camel data data garden'\nassert mirror_words('coffee') == 'coffee'\nassert mirror_words('data code') == 'code data'\nassert mirror_words('we up an summer vector of matrix go') == 'matrix vector summer'\nassert mirror_words('python camel go in table it') == 'table camel python'\nassert mirror_words('apple data code up python brain') == 'brain python code data apple'\nassert mirror_words('') == ''", "answer": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 4 من آخرها إلى أولها، موصولة بالفاصل ' '.\nمثال: `mirror_words('garden data data is camel of signal table') == 'table signal camel data data garden'`\nالجواب:", "qhash": "1ad0d636e2f872b1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "mult_sum", "reference": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "tests": ["assert mult_sum(278) == 11064", "assert mult_sum(2) == 0", "assert mult_sum(260) == 9715", "assert mult_sum(228) == 7284", "assert mult_sum(91) == 1140", "assert mult_sum(200) == 5788", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(278) == 11064\nassert mult_sum(2) == 0\nassert mult_sum(260) == 9715\nassert mult_sum(228) == 7284\nassert mult_sum(91) == 1140\nassert mult_sum(200) == 5788\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)", "completion": " ```python\ndef mult_sum(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `mult_sum` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 6 أو 7 دون باقٍ.\nمثال: `mult_sum(278) == 11064`\nالجواب:", "qhash": "8d4f683af792b13b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "tests": ["assert add_multiples(228) == 11091", "assert add_multiples(16) == 66", "assert add_multiples(197) == 8332", "assert add_multiples(115) == 2860", "assert add_multiples(281) == 16942", "assert add_multiples(230) == 11319", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(228) == 11091\nassert add_multiples(16) == 66\nassert add_multiples(197) == 8332\nassert add_multiples(115) == 2860\nassert add_multiples(281) == 16942\nassert add_multiples(230) == 11319\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 7 دون باقٍ.\nمثال: `add_multiples(228) == 11091`\nالجواب:", "qhash": "0d5d02cb75120538"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'summer'\nprint(name.index('e') + len(name))\nprint(name.count('e'))\nprint(name.replace('e', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'summer'\nprint(name.index('e') + len(name))\nprint(name.count('e'))\nprint(name.replace('e', '#'))\n```\nالجواب:", "qhash": "0d8fdadeab0c7bbf", "answer": "10\n1\nsumm#r", "completion": " الناتج:\n```text\n10\n1\nsumm#r\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return text.count('ب')", "tests": ["assert how_many('جمل نهار سيارة') == 0", "assert how_many('بحر نهار قهوة رمل مطر طالب دفتر') == 2", "assert how_many('') == 0", "assert how_many('ماء سيارة طائرة مطر باب بيت علم نهر') == 3", "assert how_many('سفينة مدرسة فجر') == 0", "assert how_many('عربية حصان كتاب') == 2", "assert how_many('كتاب رمل رمل خبز') == 2", "assert how_many('') == 0"], "test_code": "assert how_many('جمل نهار سيارة') == 0\nassert how_many('بحر نهار قهوة رمل مطر طالب دفتر') == 2\nassert how_many('') == 0\nassert how_many('ماء سيارة طائرة مطر باب بيت علم نهر') == 3\nassert how_many('سفينة مدرسة فجر') == 0\nassert how_many('عربية حصان كتاب') == 2\nassert how_many('كتاب رمل رمل خبز') == 2\nassert how_many('') == 0", "answer": "def how_many(text):\n    return text.count('ب')", "completion": " ```python\ndef how_many(text):\n    return text.count('ب')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ب» في النص.\nمثال: `how_many('جمل نهار سيارة') == 0`\nالجواب:", "qhash": "57f70ed8f865a043"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 54", "tests": ["assert digit_power(98407) == 28", "assert digit_power(125736) == 24", "assert digit_power(86752) == 28", "assert digit_power(583026) == 24", "assert digit_power(911651) == 23", "assert digit_power(518711) == 23", "assert digit_power(616854) == 30", "assert digit_power(0) == 0"], "test_code": "assert digit_power(98407) == 28\nassert digit_power(125736) == 24\nassert digit_power(86752) == 28\nassert digit_power(583026) == 24\nassert digit_power(911651) == 23\nassert digit_power(518711) == 23\nassert digit_power(616854) == 30\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 54", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 54\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 54.\nمثال: `digit_power(98407) == 28`\nالجواب:", "qhash": "0e8bb0dcaf72bee8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'apple'\nprint(name.find('l'))\nprint(name.split('_'))\nprint(name.replace('l', '*'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'apple'\nprint(name.find('l'))\nprint(name.split('_'))\nprint(name.replace('l', '*'))\n```\nالجواب:", "qhash": "cadaa47d598ed83c", "answer": "3\n['apple']\napp*e", "completion": " الناتج:\n```text\n3\n['apple']\napp*e\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "total_pow", "reference": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 4\n    return total", "tests": ["assert total_pow(3) == 686", "assert total_pow(0) == 0", "assert total_pow(13) == 624897", "assert total_pow(5) == 6853", "assert total_pow(0) == 0", "assert total_pow(1) == 7", "assert total_pow(0) == 0"], "test_code": "assert total_pow(3) == 686\nassert total_pow(0) == 0\nassert total_pow(13) == 624897\nassert total_pow(5) == 6853\nassert total_pow(0) == 0\nassert total_pow(1) == 7\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 4\n    return total", "completion": " ```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 4\n    return total\n```\n", "buggy": "def total_pow(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef total_pow(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 4\n    return total\n```\nمثال: `total_pow(3) == 686`\nالجواب:", "qhash": "bbb5538be90ea2ca"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_terms", "reference": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 1\n    return total", "tests": ["assert sum_terms(4) == 50", "assert sum_terms(13) == 455", "assert sum_terms(14) == 525", "assert sum_terms(3) == 30", "assert sum_terms(1) == 5", "assert sum_terms(1) == 5", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(4) == 50\nassert sum_terms(13) == 455\nassert sum_terms(14) == 525\nassert sum_terms(3) == 30\nassert sum_terms(1) == 5\nassert sum_terms(1) == 5\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 1\n    return total", "completion": " ```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 1\n    return total\n```\n", "buggy": "def sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 5 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 5 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 5 * i ** 1\n    return total\n```\nمثال: `sum_terms(4) == 50`\nالجواب:", "qhash": "d26137abb5aa9a34"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'matrix'\nprint(name[::-1])\nprint(name.replace('i', 'X'))\nprint(name.index('i') + len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'matrix'\nprint(name[::-1])\nprint(name.replace('i', 'X'))\nprint(name.index('i') + len(name))\n```\nالجواب:", "qhash": "d470020754826fea", "answer": "xirtam\nmatrXx\n10", "completion": " الناتج:\n```text\nxirtam\nmatrXx\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('أحمد', 9), ('علي', 20), ('هشام', 48), ('منى', 70)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('أحمد', 9), ('علي', 20), ('هشام', 48), ('منى', 70)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "8b9152688d1348d6", "answer": "[('أحمد', 9), ('علي', 20), ('هشام', 48), ('منى', 70)]\n['منى', 'هشام']", "completion": " الناتج:\n```text\n[('أحمد', 9), ('علي', 20), ('هشام', 48), ('منى', 70)]\n['منى', 'هشام']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return 1 * x ** 2 + (9) * x + (-5)", "tests": ["assert quad(3) == 31", "assert quad(-11) == 17", "assert quad(9) == 157", "assert quad(-16) == 107", "assert quad(-12) == 31", "assert quad(-5) == -25", "assert quad(12) == 247", "assert quad(0) == -5"], "test_code": "assert quad(3) == 31\nassert quad(-11) == 17\nassert quad(9) == 157\nassert quad(-16) == 107\nassert quad(-12) == 31\nassert quad(-5) == -25\nassert quad(12) == 247\nassert quad(0) == -5", "answer": "def quad(x):\n    return 1 * x ** 2 + (9) * x + (-5)", "completion": " ```python\ndef quad(x):\n    return 1 * x ** 2 + (9) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 1x² + 9x - 5.\nمثال: `quad(3) == 31`\nالجواب:", "qhash": "021140d93378c2ec"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(arr):\n    if not arr:\n        return []\n    k = 13 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert roll([41, 37, 43, 50]) == [50, 41, 37, 43]", "assert roll([2, 41, 40, 49, 35, 0, 40, 19, 40, 26]) == [19, 40, 26, 2, 41, 40, 49, 35, 0, 40]", "assert roll([24, -5, 38, 20, -7, 37, 19, 20, 47, 43, 41, 45]) == [45, 24, -5, 38, 20, -7, 37, 19, 20, 47, 43, 41]", "assert roll([12, 29, 26]) == [26, 12, 29]", "assert roll([8, 47, -8, 39, 35, -8, 24]) == [47, -8, 39, 35, -8, 24, 8]", "assert roll([28, 34, 20, 49, 49, 11, 18]) == [34, 20, 49, 49, 11, 18, 28]", "assert roll([]) == []"], "test_code": "assert roll([41, 37, 43, 50]) == [50, 41, 37, 43]\nassert roll([2, 41, 40, 49, 35, 0, 40, 19, 40, 26]) == [19, 40, 26, 2, 41, 40, 49, 35, 0, 40]\nassert roll([24, -5, 38, 20, -7, 37, 19, 20, 47, 43, 41, 45]) == [45, 24, -5, 38, 20, -7, 37, 19, 20, 47, 43, 41]\nassert roll([12, 29, 26]) == [26, 12, 29]\nassert roll([8, 47, -8, 39, 35, -8, 24]) == [47, -8, 39, 35, -8, 24, 8]\nassert roll([28, 34, 20, 49, 49, 11, 18]) == [34, 20, 49, 49, 11, 18, 28]\nassert roll([]) == []", "answer": "def roll(arr):\n    if not arr:\n        return []\n    k = 13 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef roll(arr):\n    if not arr:\n        return []\n    k = 13 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 13 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(arr):\n    if not arr:\n        return []\n    k = 13 % len(arr)\n    return ____\n```\nمثال: `roll([41, 37, 43, 50]) == [50, 41, 37, 43]`\nالجواب:", "qhash": "8249a0d2e83a4085"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(xs):\n    if not xs:\n        return []\n    k = 5 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([45, 2, 32]) == [2, 32, 45]", "assert shift_list([31, 46, 49, -4, -3, 42, 49, 0, 31]) == [-3, 42, 49, 0, 31, 31, 46, 49, -4]", "assert shift_list([35, 29, 40, 34, 24, -1, -9, 1, -4, -8, 4, 6]) == [1, -4, -8, 4, 6, 35, 29, 40, 34, 24, -1, -9]", "assert shift_list([25, 48]) == [48, 25]", "assert shift_list([41, 2, 2]) == [2, 2, 41]", "assert shift_list([1, 31, 3, 8, 27, -3, 7, 8, 16, 38, 41, 38]) == [8, 16, 38, 41, 38, 1, 31, 3, 8, 27, -3, 7]", "assert shift_list([]) == []"], "test_code": "assert shift_list([45, 2, 32]) == [2, 32, 45]\nassert shift_list([31, 46, 49, -4, -3, 42, 49, 0, 31]) == [-3, 42, 49, 0, 31, 31, 46, 49, -4]\nassert shift_list([35, 29, 40, 34, 24, -1, -9, 1, -4, -8, 4, 6]) == [1, -4, -8, 4, 6, 35, 29, 40, 34, 24, -1, -9]\nassert shift_list([25, 48]) == [48, 25]\nassert shift_list([41, 2, 2]) == [2, 2, 41]\nassert shift_list([1, 31, 3, 8, 27, -3, 7, 8, 16, 38, 41, 38]) == [8, 16, 38, 41, 38, 1, 31, 3, 8, 27, -3, 7]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n    if not xs:\n        return []\n    k = 5 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef shift_list(xs):\n    if not xs:\n        return []\n    k = 5 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(xs):\n    if not xs:\n        return []\n    k = 5 % len(xs)\n    return ____\n```\nمثال: `shift_list([45, 2, 32]) == [2, 32, 45]`\nالجواب:", "qhash": "227cb2784e19dd98"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['python', 'music', 'cloud', 'desert', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['python', 'music', 'cloud', 'desert', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "8eb6bf2d3d4dd482", "answer": "['music', 'cloud', 'python', 'desert', 'rocket']\n['rocket', 'python', 'desert']", "completion": " الناتج:\n```text\n['music', 'cloud', 'python', 'desert', 'rocket']\n['rocket', 'python', 'desert']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "rec_prod", "reference": "def rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 4)) % 89", "tests": ["assert rec_prod(3) == 3", "assert rec_prod(3) == 3", "assert rec_prod(24) == 16", "assert rec_prod(6) == 12", "assert rec_prod(45) == 59", "assert rec_prod(44) == 33", "assert rec_prod(0) == 1"], "test_code": "assert rec_prod(3) == 3\nassert rec_prod(3) == 3\nassert rec_prod(24) == 16\nassert rec_prod(6) == 12\nassert rec_prod(45) == 59\nassert rec_prod(44) == 33\nassert rec_prod(0) == 1", "answer": "def rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 4)) % 89", "completion": " ```python\ndef rec_prod(n):\n    if n <= 0:\n        return 1\n    return (n * rec_prod(n - 4)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef rec_prod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `rec_prod(3) == 3`\nالجواب:", "qhash": "5f7c5011a6d1e97f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert invert_words('stone coffee winter coffee') == 'coffee/winter/coffee/stone'", "assert invert_words('in pixel engine data banana python') == 'python/banana/data/engine/pixel/in'", "assert invert_words('vector to brain rocket table') == 'table/rocket/brain/to/vector'", "assert invert_words('go rocket in brain') == 'brain/in/rocket/go'", "assert invert_words('') == ''", "assert invert_words('camel engine light an on pixel') == 'pixel/on/an/light/engine/camel'", "assert invert_words('signal coffee stone') == 'stone/coffee/signal'"], "test_code": "assert invert_words('stone coffee winter coffee') == 'coffee/winter/coffee/stone'\nassert invert_words('in pixel engine data banana python') == 'python/banana/data/engine/pixel/in'\nassert invert_words('vector to brain rocket table') == 'table/rocket/brain/to/vector'\nassert invert_words('go rocket in brain') == 'brain/in/rocket/go'\nassert invert_words('') == ''\nassert invert_words('camel engine light an on pixel') == 'pixel/on/an/light/engine/camel'\nassert invert_words('signal coffee stone') == 'stone/coffee/signal'", "answer": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `invert_words('stone coffee winter coffee') == 'coffee/winter/coffee/stone'`\nالجواب:", "qhash": "98cd96a6de5cfaab"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 3 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(4) == ['1', 'Sun', 'Moon', 'Sun']", "assert play(4) == ['1', 'Sun', 'Moon', 'Sun']", "assert play(12) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon']", "assert play(8) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun']", "assert play(10) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun']"], "test_code": "assert play(4) == ['1', 'Sun', 'Moon', 'Sun']\nassert play(4) == ['1', 'Sun', 'Moon', 'Sun']\nassert play(12) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun', '11', 'SunMoon']\nassert play(8) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun']\nassert play(10) == ['1', 'Sun', 'Moon', 'Sun', '5', 'SunMoon', '7', 'Sun', 'Moon', 'Sun']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 3 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 3 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Sun'، مضاعفات 3 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(4) == ['1', 'Sun', 'Moon', 'Sun']`\nالجواب:", "qhash": "f410edd5db0d6315"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_gcd1", "reference": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 86) == 1)", "tests": ["assert count_gcd1(72) == 35", "assert count_gcd1(29) == 15", "assert count_gcd1(143) == 70", "assert count_gcd1(107) == 53", "assert count_gcd1(166) == 81", "assert count_gcd1(10) == 5", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(72) == 35\nassert count_gcd1(29) == 15\nassert count_gcd1(143) == 70\nassert count_gcd1(107) == 53\nassert count_gcd1(166) == 81\nassert count_gcd1(10) == 5\nassert count_gcd1(1) == 1", "answer": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 86) == 1)", "completion": " ```python\ndef count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 86) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_gcd1` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 86 في أي قاسم أكبر من 1.\nمثال: `count_gcd1(72) == 35`\nالجواب:", "qhash": "9e3c5a499cb8c8c2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def h(x, y=4):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(h(5))\nprint(h(5, -10))\nprint(h(h(-10), 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef h(x, y=4):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(h(5))\nprint(h(5, -10))\nprint(h(h(-10), 5))\n```\nالجواب:", "qhash": "b1b627bdfe986d42", "answer": "-24\n-10\n-46", "completion": " الناتج:\n```text\n-24\n-10\n-46\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 65", "tests": ["assert sum_digit_pow(59227) == 64", "assert sum_digit_pow(308047) == 9", "assert sum_digit_pow(46317) == 5", "assert sum_digit_pow(124795) == 45", "assert sum_digit_pow(636939) == 16", "assert sum_digit_pow(244255) == 39", "assert sum_digit_pow(16347) == 5", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(59227) == 64\nassert sum_digit_pow(308047) == 9\nassert sum_digit_pow(46317) == 5\nassert sum_digit_pow(124795) == 45\nassert sum_digit_pow(636939) == 16\nassert sum_digit_pow(244255) == 39\nassert sum_digit_pow(16347) == 5\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 65", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 65\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 65.\nمثال: `sum_digit_pow(59227) == 64`\nالجواب:", "qhash": "842936ef998b2427"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 283\nc = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    c += 1\nprint(c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 283\nc = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    c += 1\nprint(c)\n```\nالجواب:", "qhash": "6634be5f51c1fb88", "answer": "60", "completion": " الناتج:\n```text\n60\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_text", "reference": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_text('vector we we') == 'enlcxa fn fn'", "assert shift_text('river music winter desert') == 'arena vdbrl frwcna mnbnac'", "assert shift_text('up A1') == 'dy A1'", "assert shift_text('on banana go') == 'xw kjwjwj px'", "assert shift_text('python 2024') == 'yhcqxw 2024'", "assert shift_text('signal') == 'brpwju'", "assert shift_text('') == ''"], "test_code": "assert shift_text('vector we we') == 'enlcxa fn fn'\nassert shift_text('river music winter desert') == 'arena vdbrl frwcna mnbnac'\nassert shift_text('up A1') == 'dy A1'\nassert shift_text('on banana go') == 'xw kjwjwj px'\nassert shift_text('python 2024') == 'yhcqxw 2024'\nassert shift_text('signal') == 'brpwju'\nassert shift_text('') == ''", "answer": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_text` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('vector we we') == 'enlcxa fn fn'`\nالجواب:", "qhash": "dc68ea2873e4a63d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('وليد', 55), ('نور', 13), ('باسل', 37), ('مريم', 11)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('وليد', 55), ('نور', 13), ('باسل', 37), ('مريم', 11)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "a8f223785d909b66", "answer": "[('مريم', 11), ('نور', 13), ('باسل', 37), ('وليد', 55)]\n['وليد', 'باسل']", "completion": " الناتج:\n```text\n[('مريم', 11), ('نور', 13), ('باسل', 37), ('وليد', 55)]\n['وليد', 'باسل']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n    return sum(int(d) ** 5 for d in str(n)) % 44", "tests": ["assert dig_pow_mod(10957) == 2", "assert dig_pow_mod(201783) == 43", "assert dig_pow_mod(510285) == 23", "assert dig_pow_mod(987582) == 9", "assert dig_pow_mod(121465) == 35", "assert dig_pow_mod(28275) == 8", "assert dig_pow_mod(805205) == 22", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(10957) == 2\nassert dig_pow_mod(201783) == 43\nassert dig_pow_mod(510285) == 23\nassert dig_pow_mod(987582) == 9\nassert dig_pow_mod(121465) == 35\nassert dig_pow_mod(28275) == 8\nassert dig_pow_mod(805205) == 22\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n    return sum(int(d) ** 5 for d in str(n)) % 44", "completion": " ```python\ndef dig_pow_mod(n):\n    return sum(int(d) ** 5 for d in str(n)) % 44\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `dig_pow_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^5 لكل أرقام n) mod 44.\nمثال: `dig_pow_mod(10957) == 2`\nالجواب:", "qhash": "664a0f84c3f47a55"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert rev_long_words('brain go camel in pixel in stone') == 'stone/pixel/camel/brain'", "assert rev_long_words('light code banana') == 'banana/code/light'", "assert rev_long_words('planet apple stone table matrix pixel at') == 'pixel/matrix/table/stone/apple/planet'", "assert rev_long_words('summer stone garden by') == 'garden/stone/summer'", "assert rev_long_words('river pixel garden brain we is river banana') == 'banana/river/brain/garden/pixel/river'", "assert rev_long_words('an apple stone at data is vector matrix') == 'matrix/vector/data/stone/apple'", "assert rev_long_words('of stone orange pixel at apple') == 'apple/pixel/orange/stone'"], "test_code": "assert rev_long_words('brain go camel in pixel in stone') == 'stone/pixel/camel/brain'\nassert rev_long_words('light code banana') == 'banana/code/light'\nassert rev_long_words('planet apple stone table matrix pixel at') == 'pixel/matrix/table/stone/apple/planet'\nassert rev_long_words('summer stone garden by') == 'garden/stone/summer'\nassert rev_long_words('river pixel garden brain we is river banana') == 'banana/river/brain/garden/pixel/river'\nassert rev_long_words('an apple stone at data is vector matrix') == 'matrix/vector/data/stone/apple'\nassert rev_long_words('of stone orange pixel at apple') == 'apple/pixel/orange/stone'", "answer": "def rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `rev_long_words('brain go camel in pixel in stone') == 'stone/pixel/camel/brain'`\nالجواب:", "qhash": "5a6a1a5bfcb2ce74"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "tests": ["assert total_multiples(58) == 759", "assert total_multiples(32) == 214", "assert total_multiples(170) == 6132", "assert total_multiples(248) == 13233", "assert total_multiples(292) == 18375", "assert total_multiples(248) == 13233", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(58) == 759\nassert total_multiples(32) == 214\nassert total_multiples(170) == 6132\nassert total_multiples(248) == 13233\nassert total_multiples(292) == 18375\nassert total_multiples(248) == 13233\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 7 دون باقٍ.\nمثال: `total_multiples(58) == 759`\nالجواب:", "qhash": "82218f76e06bfc0a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 47", "tests": ["assert sum_digit_pow(20862) == 14", "assert sum_digit_pow(19848) == 38", "assert sum_digit_pow(202694) == 0", "assert sum_digit_pow(397059) == 10", "assert sum_digit_pow(289724) == 30", "assert sum_digit_pow(550716) == 42", "assert sum_digit_pow(246902) == 0", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(20862) == 14\nassert sum_digit_pow(19848) == 38\nassert sum_digit_pow(202694) == 0\nassert sum_digit_pow(397059) == 10\nassert sum_digit_pow(289724) == 30\nassert sum_digit_pow(550716) == 42\nassert sum_digit_pow(246902) == 0\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 47", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 47.\nمثال: `sum_digit_pow(20862) == 14`\nالجواب:", "qhash": "b6beae2589f2879c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [36, 8, 19, 4, 14]\nprint(a[3:4])\nprint(a[::-2])\nprint(min(a[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [36, 8, 19, 4, 14]\nprint(a[3:4])\nprint(a[::-2])\nprint(min(a[3:4]))\n```\nالجواب:", "qhash": "c27f2e3d4152bef9", "answer": "[4]\n[14, 19, 36]\n4", "completion": " الناتج:\n```text\n[4]\n[14, 19, 36]\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'نور'\nprint(text[::-1])\nprint(text[-1])\nprint(text[0])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'نور'\nprint(text[::-1])\nprint(text[-1])\nprint(text[0])\n```\nالجواب:", "qhash": "cc709beef4a121e8", "answer": "رون\nر\nن", "completion": " الناتج:\n```text\nرون\nر\nن\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_gcd1", "reference": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 20) == 1)", "tests": ["assert count_gcd1(140) == 56", "assert count_gcd1(77) == 31", "assert count_gcd1(177) == 71", "assert count_gcd1(27) == 11", "assert count_gcd1(61) == 25", "assert count_gcd1(167) == 67", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(140) == 56\nassert count_gcd1(77) == 31\nassert count_gcd1(177) == 71\nassert count_gcd1(27) == 11\nassert count_gcd1(61) == 25\nassert count_gcd1(167) == 67\nassert count_gcd1(1) == 1", "answer": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 20) == 1)", "completion": " ```python\ndef count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 20) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_gcd1` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 20 في أي قاسم أكبر من 1.\nمثال: `count_gcd1(140) == 56`\nالجواب:", "qhash": "0f61c962f33b1185"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 3\n    return total", "tests": ["assert scaled_powers(4) == 1000", "assert scaled_powers(5) == 2250", "assert scaled_powers(6) == 4410", "assert scaled_powers(7) == 7840", "assert scaled_powers(8) == 12960", "assert scaled_powers(1) == 10", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(4) == 1000\nassert scaled_powers(5) == 2250\nassert scaled_powers(6) == 4410\nassert scaled_powers(7) == 7840\nassert scaled_powers(8) == 12960\nassert scaled_powers(1) == 10\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 3\n    return total", "completion": " ```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 3\n    return total\n```\n", "buggy": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n):\n        total += 10 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 10 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n):\n        total += 10 * i ** 3\n    return total\n```\nمثال: `scaled_powers(4) == 1000`\nالجواب:", "qhash": "b09edb0316adc8e4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_powers", "reference": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 1\n    return total", "tests": ["assert sum_powers(7) == 84", "assert sum_powers(14) == 315", "assert sum_powers(13) == 273", "assert sum_powers(12) == 234", "assert sum_powers(12) == 234", "assert sum_powers(1) == 3", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(7) == 84\nassert sum_powers(14) == 315\nassert sum_powers(13) == 273\nassert sum_powers(12) == 234\nassert sum_powers(12) == 234\nassert sum_powers(1) == 3\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 1\n    return total", "completion": " ```python\ndef sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 3 * i ** 1\n    return total\n```\n", "buggy": "def sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 3 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 3 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 3 * i ** 1\n    return total\n```\nمثال: `sum_powers(7) == 84`\nالجواب:", "qhash": "64fac9411a18e3d9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return 7 * x ** 2 + (-7) * x + (7)", "tests": ["assert poly(10) == 637", "assert poly(7) == 301", "assert poly(-8) == 511", "assert poly(-11) == 931", "assert poly(13) == 1099", "assert poly(-18) == 2401", "assert poly(-20) == 2947", "assert poly(0) == 7"], "test_code": "assert poly(10) == 637\nassert poly(7) == 301\nassert poly(-8) == 511\nassert poly(-11) == 931\nassert poly(13) == 1099\nassert poly(-18) == 2401\nassert poly(-20) == 2947\nassert poly(0) == 7", "answer": "def poly(x):\n    return 7 * x ** 2 + (-7) * x + (7)", "completion": " ```python\ndef poly(x):\n    return 7 * x ** 2 + (-7) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 7x² - 7x + 7.\nمثال: `poly(10) == 637`\nالجواب:", "qhash": "c93feb4007b05ba4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(115) == 952", "assert sum_multiples(59) == 252", "assert sum_multiples(207) == 3045", "assert sum_multiples(129) == 1197", "assert sum_multiples(53) == 196", "assert sum_multiples(197) == 2842", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(115) == 952\nassert sum_multiples(59) == 252\nassert sum_multiples(207) == 3045\nassert sum_multiples(129) == 1197\nassert sum_multiples(53) == 196\nassert sum_multiples(197) == 2842\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 7 أو 14 دون باقٍ.\nمثال: `sum_multiples(115) == 952`\nالجواب:", "qhash": "336b53bc679c8637"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 67", "tests": ["assert digit_score(54589) == 14", "assert digit_score(126362) == 7", "assert digit_score(533476) == 65", "assert digit_score(491642) == 10", "assert digit_score(269216) == 39", "assert digit_score(369032) == 2", "assert digit_score(74298) == 48", "assert digit_score(0) == 0"], "test_code": "assert digit_score(54589) == 14\nassert digit_score(126362) == 7\nassert digit_score(533476) == 65\nassert digit_score(491642) == 10\nassert digit_score(269216) == 39\nassert digit_score(369032) == 2\nassert digit_score(74298) == 48\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 67", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 67\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 67.\nمثال: `digit_score(54589) == 14`\nالجواب:", "qhash": "d0beed7ddc8fb23d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total", "tests": ["assert weighted_sum(6) == 3087", "assert weighted_sum(1) == 7", "assert weighted_sum(4) == 700", "assert weighted_sum(4) == 700", "assert weighted_sum(11) == 30492", "assert weighted_sum(1) == 7", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(6) == 3087\nassert weighted_sum(1) == 7\nassert weighted_sum(4) == 700\nassert weighted_sum(4) == 700\nassert weighted_sum(11) == 30492\nassert weighted_sum(1) == 7\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total", "completion": " ```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 3\n    return total\n```\n", "buggy": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 7 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 7 * i ** 3\n    return total\n```\nمثال: `weighted_sum(6) == 3087`\nالجواب:", "qhash": "2bc4c8f9912b9386"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 31035\nsteps = 0\nwhile n > 8:\n    n = n // 7\n    steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 31035\nsteps = 0\nwhile n > 8:\n    n = n // 7\n    steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "f904e4ad3251e318", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return text.count('ن')", "tests": ["assert how_many('سوق سلام ميناء ليل عمل') == 1", "assert how_many('بحر صديق سوق شجرة ماء سفينة') == 1", "assert how_many('مطر برمجة باب سلام') == 0", "assert how_many('جبل خبز نهر') == 1", "assert how_many('') == 0", "assert how_many('') == 0", "assert how_many('مدرسة بيت حاسوب معلم خبز معلم') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('سوق سلام ميناء ليل عمل') == 1\nassert how_many('بحر صديق سوق شجرة ماء سفينة') == 1\nassert how_many('مطر برمجة باب سلام') == 0\nassert how_many('جبل خبز نهر') == 1\nassert how_many('') == 0\nassert how_many('') == 0\nassert how_many('مدرسة بيت حاسوب معلم خبز معلم') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return text.count('ن')", "completion": " ```python\ndef how_many(text):\n    return text.count('ن')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ن» في النص.\nمثال: `how_many('سوق سلام ميناء ليل عمل') == 1`\nالجواب:", "qhash": "d70527d9de70c49f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "spin", "reference": "def spin(xs):\n    if not xs:\n        return []\n    k = 3 % len(xs)\n    return xs[k:] + xs[:k]", "tests": ["assert spin([35, 18, 46, 41]) == [41, 35, 18, 46]", "assert spin([41, 36]) == [36, 41]", "assert spin([37, 3, 36, 12, 0, 9, 5, 38, -5, 41, 43]) == [12, 0, 9, 5, 38, -5, 41, 43, 37, 3, 36]", "assert spin([48, 44, 30, 3, 49, -4, 37, 20]) == [3, 49, -4, 37, 20, 48, 44, 30]", "assert spin([29, 7, 25, 43, 12, 17, 10, 42, -8, 39, 21, -7]) == [43, 12, 17, 10, 42, -8, 39, 21, -7, 29, 7, 25]", "assert spin([-1, 38, 3]) == [-1, 38, 3]", "assert spin([]) == []"], "test_code": "assert spin([35, 18, 46, 41]) == [41, 35, 18, 46]\nassert spin([41, 36]) == [36, 41]\nassert spin([37, 3, 36, 12, 0, 9, 5, 38, -5, 41, 43]) == [12, 0, 9, 5, 38, -5, 41, 43, 37, 3, 36]\nassert spin([48, 44, 30, 3, 49, -4, 37, 20]) == [3, 49, -4, 37, 20, 48, 44, 30]\nassert spin([29, 7, 25, 43, 12, 17, 10, 42, -8, 39, 21, -7]) == [43, 12, 17, 10, 42, -8, 39, 21, -7, 29, 7, 25]\nassert spin([-1, 38, 3]) == [-1, 38, 3]\nassert spin([]) == []", "answer": "def spin(xs):\n    if not xs:\n        return []\n    k = 3 % len(xs)\n    return xs[k:] + xs[:k]", "completion": " ```python\ndef spin(xs):\n    if not xs:\n        return []\n    k = 3 % len(xs)\n    return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef spin(xs):\n    if not xs:\n        return []\n    k = 3 % len(xs)\n    return ____\n```\nمثال: `spin([35, 18, 46, 41]) == [41, 35, 18, 46]`\nالجواب:", "qhash": "3a28123f14bc95cb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('orange vector A1') == 'dgpcvt ktridg A1'", "assert encode('winter is !') == 'lxcitg xh !'", "assert encode('camel') == 'rpbta'", "assert encode('stone data on') == 'hidct spip dc'", "assert encode('apple planet table rocket river') == 'peeat eapcti ipqat gdrzti gxktg'", "assert encode('cloud') == 'radjs'", "assert encode('') == ''"], "test_code": "assert encode('orange vector A1') == 'dgpcvt ktridg A1'\nassert encode('winter is !') == 'lxcitg xh !'\nassert encode('camel') == 'rpbta'\nassert encode('stone data on') == 'hidct spip dc'\nassert encode('apple planet table rocket river') == 'peeat eapcti ipqat gdrzti gxktg'\nassert encode('cloud') == 'radjs'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('orange vector A1') == 'dgpcvt ktridg A1'`\nالجواب:", "qhash": "8e626d4eb294bbcd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def h(x, y=1):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(h(11))\nprint(h(11, 14))\nprint(h(h(14), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef h(x, y=1):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(h(11))\nprint(h(11, 14))\nprint(h(h(14), 11))\n```\nالجواب:", "qhash": "b2b516ec7512480f", "answer": "-23\n-17\n-51", "completion": " الناتج:\n```text\n-23\n-17\n-51\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 15 == 0)", "tests": ["assert sum_multiples(30) == 135", "assert sum_multiples(81) == 1053", "assert sum_multiples(157) == 4134", "assert sum_multiples(265) == 11748", "assert sum_multiples(209) == 7245", "assert sum_multiples(81) == 1053", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(30) == 135\nassert sum_multiples(81) == 1053\nassert sum_multiples(157) == 4134\nassert sum_multiples(265) == 11748\nassert sum_multiples(209) == 7245\nassert sum_multiples(81) == 1053\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 15 دون باقٍ.\nمثال: `sum_multiples(30) == 135`\nالجواب:", "qhash": "40fa2bcbaece3369"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']", "assert fizzbuzz(21) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi']", "assert fizzbuzz(21) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi']", "assert fizzbuzz(24) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi', '22', '23', 'Yo']", "assert fizzbuzz(8) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo']"], "test_code": "assert fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']\nassert fizzbuzz(21) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi']\nassert fizzbuzz(21) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi']\nassert fizzbuzz(24) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9', '10', '11', '12', '13', 'Hi', '15', 'Yo', '17', '18', '19', '20', 'Hi', '22', '23', 'Yo']\nassert fizzbuzz(8) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Hi'، مضاعفات 8 تصبح 'Yo'، المضاعفات المشتركة تصبح 'HiYo'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(9) == ['1', '2', '3', '4', '5', '6', 'Hi', 'Yo', '9']`\nالجواب:", "qhash": "05a0bbb612fe9927"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "decode", "reference": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert decode('a up A1') == 'p je A1'", "assert decode('it OK') == 'xi OK'", "assert decode('code it in') == 'rdst xi xc'", "assert decode('go to 2024') == 'vd id 2024'", "assert decode('vector A1') == 'ktridg A1'", "assert decode('stone vector apple') == 'hidct ktridg peeat'", "assert decode('') == ''"], "test_code": "assert decode('a up A1') == 'p je A1'\nassert decode('it OK') == 'xi OK'\nassert decode('code it in') == 'rdst xi xc'\nassert decode('go to 2024') == 'vd id 2024'\nassert decode('vector A1') == 'ktridg A1'\nassert decode('stone vector apple') == 'hidct ktridg peeat'\nassert decode('') == ''", "answer": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `decode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('a up A1') == 'p je A1'`\nالجواب:", "qhash": "1808b192ee6c3d10"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(19) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19']", "assert play(7) == ['1', '2', '3', '4', '5', '6', 'Sun']", "assert play(19) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19']", "assert play(10) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10']", "assert play(2) == ['1', '2']"], "test_code": "assert play(19) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19']\nassert play(7) == ['1', '2', '3', '4', '5', '6', 'Sun']\nassert play(19) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19']\nassert play(10) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10']\nassert play(2) == ['1', '2']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Sun'، مضاعفات 9 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(19) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19']`\nالجواب:", "qhash": "3487e991f2c31d21"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "tally", "reference": "def tally(s):\n    return {c: s.count(c) for c in 'cr'}", "tests": ["assert tally('pixel vector music') == {'c': 2, 'r': 1}", "assert tally('up pixel it at desert signal') == {'c': 0, 'r': 1}", "assert tally('up by') == {'c': 0, 'r': 0}", "assert tally('apple brain code apple table') == {'c': 1, 'r': 1}", "assert tally('vector cloud') == {'c': 2, 'r': 1}", "assert tally('a') == {'c': 0, 'r': 0}", "assert tally('') == {'c': 0, 'r': 0}"], "test_code": "assert tally('pixel vector music') == {'c': 2, 'r': 1}\nassert tally('up pixel it at desert signal') == {'c': 0, 'r': 1}\nassert tally('up by') == {'c': 0, 'r': 0}\nassert tally('apple brain code apple table') == {'c': 1, 'r': 1}\nassert tally('vector cloud') == {'c': 2, 'r': 1}\nassert tally('a') == {'c': 0, 'r': 0}\nassert tally('') == {'c': 0, 'r': 0}", "answer": "def tally(s):\n    return {c: s.count(c) for c in 'cr'}", "completion": " ```python\ndef tally(s):\n    return {c: s.count(c) for c in 'cr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `tally` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'c'، 'r' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `tally('pixel vector music') == {'c': 2, 'r': 1}`\nالجواب:", "qhash": "8e79139f306ed60e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 43:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([21, 11, 7, 1, 22, 12, 21, 9]) == [21, 32, 39, 40, 0, 12, 33, 42]", "assert cumulative([-5, 2, -7, 23, 39]) == [-5, -3, -10, 13, 0]", "assert cumulative([15, 4, 36, 25, 43, -6, 0, 21]) == [15, 19, 0, 25, 0, -6, -6, 15]", "assert cumulative([6, 43, 7, 18, 16, -3, 10, 32, 26, -10]) == [6, 0, 7, 25, 41, 38, 0, 32, 0, -10]", "assert cumulative([31, 40, 41, 37, 18, 43, 38, 42, -5]) == [31, 0, 41, 0, 18, 0, 38, 0, -5]", "assert cumulative([42, 26, -9, 39, -10, 17]) == [42, 0, -9, 30, 20, 37]", "assert cumulative([]) == []"], "test_code": "assert cumulative([21, 11, 7, 1, 22, 12, 21, 9]) == [21, 32, 39, 40, 0, 12, 33, 42]\nassert cumulative([-5, 2, -7, 23, 39]) == [-5, -3, -10, 13, 0]\nassert cumulative([15, 4, 36, 25, 43, -6, 0, 21]) == [15, 19, 0, 25, 0, -6, -6, 15]\nassert cumulative([6, 43, 7, 18, 16, -3, 10, 32, 26, -10]) == [6, 0, 7, 25, 41, 38, 0, 32, 0, -10]\nassert cumulative([31, 40, 41, 37, 18, 43, 38, 42, -5]) == [31, 0, 41, 0, 18, 0, 38, 0, -5]\nassert cumulative([42, 26, -9, 39, -10, 17]) == [42, 0, -9, 30, 20, 37]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 43:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 43:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 43 (القيمة المسجلة حينها 0).\nمثال: `cumulative([21, 11, 7, 1, 22, 12, 21, 9]) == [21, 32, 39, 40, 0, 12, 33, 42]`\nالجواب:", "qhash": "303099860094a2c4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'فيصل': 28, 'عمر': 47, 'نور': 49, 'هشام': 8}\nmarks['عمر'] += 7\nmarks['سلمى'] = 60\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'فيصل': 28, 'عمر': 47, 'نور': 49, 'هشام': 8}\nmarks['عمر'] += 7\nmarks['سلمى'] = 60\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "205798ec1de3b3a4", "answer": "5\nسلمى\n199\n[('هشام', 8), ('فيصل', 28)]", "completion": " الناتج:\n```text\n5\nسلمى\n199\n[('هشام', 8), ('فيصل', 28)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([31, 33, 46, -16, 56]) == 56", "assert biggest_mult([-8, -2, -8]) == -2", "assert biggest_mult([1, 3, 5]) == None", "assert biggest_mult([-37, 30, 39, 40, -25, 39, -4, -21]) == 40", "assert biggest_mult([-17, 21, -43, 42, -13, -44]) == 42", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([31, 33, 46, -16, 56]) == 56\nassert biggest_mult([-8, -2, -8]) == -2\nassert biggest_mult([1, 3, 5]) == None\nassert biggest_mult([-37, 30, 39, 40, -25, 39, -4, -21]) == 40\nassert biggest_mult([-17, 21, -43, 42, -13, -44]) == 42\nassert biggest_mult([]) == None", "answer": "def biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([31, 33, 46, -16, 56]) == 56`\nالجواب:", "qhash": "b8c6417ebc79d9b7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n <= 0:\n        return 1\n    return 3 * rec(n - 1) + 2\n\nprint(rec(1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n <= 0:\n        return 1\n    return 3 * rec(n - 1) + 2\n\nprint(rec(1))\n```\nالجواب:", "qhash": "0dcc8d8f1773442b", "answer": "5", "completion": " الناتج:\n```text\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "total_pow", "reference": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 3\n    return total", "tests": ["assert total_pow(7) == 1568", "assert total_pow(3) == 72", "assert total_pow(7) == 1568", "assert total_pow(10) == 6050", "assert total_pow(1) == 2", "assert total_pow(1) == 2", "assert total_pow(0) == 0"], "test_code": "assert total_pow(7) == 1568\nassert total_pow(3) == 72\nassert total_pow(7) == 1568\nassert total_pow(10) == 6050\nassert total_pow(1) == 2\nassert total_pow(1) == 2\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 3\n    return total", "completion": " ```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 3\n    return total\n```\n", "buggy": "def total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 3\n    return total\n```\nمثال: `total_pow(7) == 1568`\nالجواب:", "qhash": "1125aca7bf396c7a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [(x + 6) // 5 for x in range(-2, 10) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [(x + 6) // 5 for x in range(-2, 10) if x % 5 == 4]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "11942f629ed2c7b1", "answer": "[1, 2, 3]\n3 6", "completion": " الناتج:\n```text\n[1, 2, 3]\n3 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * -1 for x in xs if -17 <= x <= 8)", "tests": ["assert select_range([-14, 11, -13, 0, -24, 5, -26, -25, -8]) == [-5, 0, 8, 13, 14]", "assert select_range([29, 5, -26, 12]) == [-5]", "assert select_range([45, 23, -27, 54, 3, 60, 26, 2]) == [-3, -2]", "assert select_range([-1, 27, 13, -20, -2, -16]) == [1, 2, 16]", "assert select_range([1, 17]) == [-1]", "assert select_range([-7, 41, 58, 0, 17, -21]) == [0, 7]", "assert select_range([-29, 56, 41, 46, -22]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-14, 11, -13, 0, -24, 5, -26, -25, -8]) == [-5, 0, 8, 13, 14]\nassert select_range([29, 5, -26, 12]) == [-5]\nassert select_range([45, 23, -27, 54, 3, 60, 26, 2]) == [-3, -2]\nassert select_range([-1, 27, 13, -20, -2, -16]) == [1, 2, 16]\nassert select_range([1, 17]) == [-1]\nassert select_range([-7, 41, 58, 0, 17, -21]) == [0, 7]\nassert select_range([-29, 56, 41, 46, -22]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * -1 for x in xs if -17 <= x <= 8)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * -1 for x in xs if -17 <= x <= 8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -1 لكل عنصر x في المدى المغلق [-17, 8].\nمثال: `select_range([-14, 11, -13, 0, -24, 5, -26, -25, -8]) == [-5, 0, 8, 13, 14]`\nالجواب:", "qhash": "700e9e2cb147e3c0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 10007", "tests": ["assert fact_mod(6) == 18", "assert fact_mod(1) == 1", "assert fact_mod(53) == 8974", "assert fact_mod(45) == 6027", "assert fact_mod(47) == 7435", "assert fact_mod(4) == 4", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 18\nassert fact_mod(1) == 1\nassert fact_mod(53) == 8974\nassert fact_mod(45) == 6027\nassert fact_mod(47) == 7435\nassert fact_mod(4) == 4\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 10007", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 3)) % 10007\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 10007 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(6) == 18`\nالجواب:", "qhash": "6b807861cb260a09"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'برتقال'\nprint(kalima.find('ب'))\nprint(kalima[::-1])\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'برتقال'\nprint(kalima.find('ب'))\nprint(kalima[::-1])\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "946c3b8d4381c4c9", "answer": "0\nلاقترب\nبرتقال", "completion": " الناتج:\n```text\n0\nلاقترب\nبرتقال\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'planet'\nprint(name[0:1])\nprint(name.split('_'))\nprint(name.find('e'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'planet'\nprint(name[0:1])\nprint(name.split('_'))\nprint(name.find('e'))\n```\nالجواب:", "qhash": "eb6fa4689b4d39ba", "answer": "p\n['planet']\n4", "completion": " الناتج:\n```text\np\n['planet']\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([51, -3, -8, 9, -12, -26]) == -8", "assert largest_div([-10, -4, -10]) == -4", "assert largest_div([1]) == None", "assert largest_div([-2]) == -2", "assert largest_div([-10, -36, -6, -37, -47]) == -6", "assert largest_div([]) == None"], "test_code": "assert largest_div([51, -3, -8, 9, -12, -26]) == -8\nassert largest_div([-10, -4, -10]) == -4\nassert largest_div([1]) == None\nassert largest_div([-2]) == -2\nassert largest_div([-10, -36, -6, -37, -47]) == -6\nassert largest_div([]) == None", "answer": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(xs):\n    best = 0\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(xs):\n    best = 0\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `largest_div([51, -3, -8, 9, -12, -26]) == -8`\nالجواب:", "qhash": "1a14ce7d860d408c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=9):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(calc(19))\nprint(calc(19, 16))\nprint(calc(calc(16), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=9):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(calc(19))\nprint(calc(19, 16))\nprint(calc(calc(16), 19))\n```\nالجواب:", "qhash": "c1ec65e7c596a2e5", "answer": "48\n41\n98", "completion": " الناتج:\n```text\n48\n41\n98\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([7, 0, 53, 13, 60, 57, 0, 33, 3]) == 0", "assert count_div([84, 37, -31, -31, 16]) == 1", "assert count_div([14]) == 0", "assert count_div([17, -34, 5]) == 0", "assert count_div([6, -24, 69, -40, 21, 39, -5, 71, -7, 61, 36]) == 1", "assert count_div([-1, 23, 2]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([7, 0, 53, 13, 60, 57, 0, 33, 3]) == 0\nassert count_div([84, 37, -31, -31, 16]) == 1\nassert count_div([14]) == 0\nassert count_div([17, -34, 5]) == 0\nassert count_div([6, -24, 69, -40, 21, 39, -5, 71, -7, 61, 36]) == 1\nassert count_div([-1, 23, 2]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([7, 0, 53, 13, 60, 57, 0, 33, 3]) == 0`\nالجواب:", "qhash": "b8c148c677a40c86"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * 1 for x in xs if -10 <= x <= 6)", "tests": ["assert pick_between([-3, -11, 8, 4, -13, 1]) == [-3, 1, 4]", "assert pick_between([-18]) == []", "assert pick_between([-17]) == []", "assert pick_between([]) == []", "assert pick_between([-10, -14, -17, 55]) == [-10]", "assert pick_between([42, 20, 20, -12]) == []", "assert pick_between([-13, 59, -30, 10, 22, 9, 60, -11, 10]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-3, -11, 8, 4, -13, 1]) == [-3, 1, 4]\nassert pick_between([-18]) == []\nassert pick_between([-17]) == []\nassert pick_between([]) == []\nassert pick_between([-10, -14, -17, 55]) == [-10]\nassert pick_between([42, 20, 20, -12]) == []\nassert pick_between([-13, 59, -30, 10, 22, 9, 60, -11, 10]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * 1 for x in xs if -10 <= x <= 6)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * 1 for x in xs if -10 <= x <= 6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [-10, 6].\nمثال: `pick_between([-3, -11, 8, 4, -13, 1]) == [-3, 1, 4]`\nالجواب:", "qhash": "bccaba56a09c0353"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 47", "tests": ["assert mfact(12) == 8", "assert mfact(27) == 21", "assert mfact(15) == 34", "assert mfact(45) == 21", "assert mfact(18) == 19", "assert mfact(49) == 42", "assert mfact(0) == 1"], "test_code": "assert mfact(12) == 8\nassert mfact(27) == 21\nassert mfact(15) == 34\nassert mfact(45) == 21\nassert mfact(18) == 19\nassert mfact(49) == 42\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 47", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(12) == 8`\nالجواب:", "qhash": "62b6e2b5c0d39870"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 51", "tests": ["assert digit_power(43042) == 10", "assert digit_power(75620) == 29", "assert digit_power(670602) == 18", "assert digit_power(151158) == 0", "assert digit_power(406094) == 2", "assert digit_power(152765) == 2", "assert digit_power(711539) == 2", "assert digit_power(0) == 0"], "test_code": "assert digit_power(43042) == 10\nassert digit_power(75620) == 29\nassert digit_power(670602) == 18\nassert digit_power(151158) == 0\nassert digit_power(406094) == 2\nassert digit_power(152765) == 2\nassert digit_power(711539) == 2\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 51", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 51\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 51.\nمثال: `digit_power(43042) == 10`\nالجواب:", "qhash": "3d7834dcf14fcc16"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "pow_digits", "reference": "def pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 65", "tests": ["assert pow_digits(31686) == 62", "assert pow_digits(744217) == 43", "assert pow_digits(604818) == 5", "assert pow_digits(609104) == 35", "assert pow_digits(101564) == 17", "assert pow_digits(627663) == 51", "assert pow_digits(784254) == 11", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(31686) == 62\nassert pow_digits(744217) == 43\nassert pow_digits(604818) == 5\nassert pow_digits(609104) == 35\nassert pow_digits(101564) == 17\nassert pow_digits(627663) == 51\nassert pow_digits(784254) == 11\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 65", "completion": " ```python\ndef pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 65\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pow_digits` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 65.\nمثال: `pow_digits(31686) == 62`\nالجواب:", "qhash": "2fc76af5e2548f7d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'garden_pixel'\nprint(len(word))\nprint(word.replace('i', '0'))\nprint(word.count('i'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'garden_pixel'\nprint(len(word))\nprint(word.replace('i', '0'))\nprint(word.count('i'))\n```\nالجواب:", "qhash": "4e8a93057e80e28e", "answer": "12\ngarden_p0xel\n1", "completion": " الناتج:\n```text\n12\ngarden_p0xel\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'planet_summer'\nprint(text.upper())\nprint(text[::-1])\nprint(text.count('r'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'planet_summer'\nprint(text.upper())\nprint(text[::-1])\nprint(text.count('r'))\n```\nالجواب:", "qhash": "ce6a273f7db8bf45", "answer": "PLANET_SUMMER\nremmus_tenalp\n1", "completion": " الناتج:\n```text\nPLANET_SUMMER\nremmus_tenalp\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 50) == 1)", "tests": ["assert coprimes(116) == 46", "assert coprimes(178) == 71", "assert coprimes(163) == 66", "assert coprimes(91) == 37", "assert coprimes(33) == 14", "assert coprimes(115) == 46", "assert coprimes(1) == 1"], "test_code": "assert coprimes(116) == 46\nassert coprimes(178) == 71\nassert coprimes(163) == 66\nassert coprimes(91) == 37\nassert coprimes(33) == 14\nassert coprimes(115) == 46\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 50) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 50) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 50 في أي قاسم أكبر من 1.\nمثال: `coprimes(116) == 46`\nالجواب:", "qhash": "3d7825cd77c9f9eb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=1):\n    if x > y:\n        return x * 4 - y\n    return x + y * 4\n\nprint(g(12))\nprint(g(12, -3))\nprint(g(g(-3), 12))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=1):\n    if x > y:\n        return x * 4 - y\n    return x + y * 4\n\nprint(g(12))\nprint(g(12, -3))\nprint(g(g(-3), 12))\n```\nالجواب:", "qhash": "80cb776ea37042ef", "answer": "47\n51\n49", "completion": " الناتج:\n```text\n47\n51\n49\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 83", "tests": ["assert step_product(10) == 37", "assert step_product(41) == 77", "assert step_product(40) == 69", "assert step_product(48) == 63", "assert step_product(7) == 21", "assert step_product(26) == 80", "assert step_product(0) == 1"], "test_code": "assert step_product(10) == 37\nassert step_product(41) == 77\nassert step_product(40) == 69\nassert step_product(48) == 63\nassert step_product(7) == 21\nassert step_product(26) == 80\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 83", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 83\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 83 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(10) == 37`\nالجواب:", "qhash": "396e18482e993aef"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_initial", "reference": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "tests": ["assert count_initial('شمس وردة علم بحر جمل عربية') == 0", "assert count_initial('حاسوب بحر') == 0", "assert count_initial('قلم تفاحة صديق') == 1", "assert count_initial('قهوة قهوة عربية قمر ليل') == 3", "assert count_initial('صديق دفتر ليل قلم') == 1", "assert count_initial('ماء مكتبة جمل سماء') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('شمس وردة علم بحر جمل عربية') == 0\nassert count_initial('حاسوب بحر') == 0\nassert count_initial('قلم تفاحة صديق') == 1\nassert count_initial('قهوة قهوة عربية قمر ليل') == 3\nassert count_initial('صديق دفتر ليل قلم') == 1\nassert count_initial('ماء مكتبة جمل سماء') == 0\nassert count_initial('') == 0", "answer": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "completion": " ```python\ndef count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ق'):\n            count += 1\n    return count\n```\n", "buggy": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('ق'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ق»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('ق'):\n            count += 1\n    return count\n```\nمثال: `count_initial('شمس وردة علم بحر جمل عربية') == 0`\nالجواب:", "qhash": "c254b2df495fa603"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(555132694))\nprint(go(go(555132694)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(555132694))\nprint(go(go(555132694)))\n```\nالجواب:", "qhash": "0657ec547f65b0eb", "answer": "40\n4", "completion": " الناتج:\n```text\n40\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x ** 2 - 6 for x in range(-5, 7) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x ** 2 - 6 for x in range(-5, 7) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "27249293bce42291", "answer": "[19, -5, 3]\n3 17", "completion": " الناتج:\n```text\n[19, -5, 3]\n3 17\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [-3, -5, 0, 10, 24, -17, 28, -5]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-3, -5, 0, 10, 24, -17, 28, -5]\nprint(sorted(nums, key=lambda x: (abs(x - -2), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "a6a574c348ba2a8a", "answer": "[-3, 0, -5, -5, 10, -17, 24, 28]\n[28, 24, 10]", "completion": " الناتج:\n```text\n[-3, 0, -5, -5, 10, -17, 24, 28]\n[28, 24, 10]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=9):\n    if x > y:\n        return x * -5 - y\n    return x + y * -5\n\nprint(compute(-6))\nprint(compute(-6, 1))\nprint(compute(compute(1), -6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=9):\n    if x > y:\n        return x * -5 - y\n    return x + y * -5\n\nprint(compute(-6))\nprint(compute(-6, 1))\nprint(compute(compute(1), -6))\n```\nالجواب:", "qhash": "d91008f565a140ce", "answer": "-51\n-11\n-14", "completion": " الناتج:\n```text\n-51\n-11\n-14\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 1\n    return total", "tests": ["assert series(4) == 10", "assert series(5) == 15", "assert series(9) == 45", "assert series(11) == 66", "assert series(0) == 0", "assert series(1) == 1", "assert series(0) == 0"], "test_code": "assert series(4) == 10\nassert series(5) == 15\nassert series(9) == 45\nassert series(11) == 66\nassert series(0) == 0\nassert series(1) == 1\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 1\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 1\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(0, n):\n        total += 1 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 1 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(0, n):\n        total += 1 * i ** 1\n    return total\n```\nمثال: `series(4) == 10`\nالجواب:", "qhash": "a7e5c4f7b1650fbe"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 158:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([28, 54, 10, 9, 4, 62, 56, 9, 78, 16]) == [28, 82, 92, 101, 105, 0, 56, 65, 143, 0]", "assert reset_sum([132, 95, 86, 26, 34, 118, 87, 136, 25]) == [132, 0, 86, 112, 146, 0, 87, 0, 25]", "assert reset_sum([62, 49]) == [62, 111]", "assert reset_sum([122, 53, 60, 131]) == [122, 0, 60, 0]", "assert reset_sum([137, 83, 15, 102]) == [137, 0, 15, 117]", "assert reset_sum([125, 14, 60, 67, 98, 49, 138, 120]) == [125, 139, 0, 67, 0, 49, 0, 120]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([28, 54, 10, 9, 4, 62, 56, 9, 78, 16]) == [28, 82, 92, 101, 105, 0, 56, 65, 143, 0]\nassert reset_sum([132, 95, 86, 26, 34, 118, 87, 136, 25]) == [132, 0, 86, 112, 146, 0, 87, 0, 25]\nassert reset_sum([62, 49]) == [62, 111]\nassert reset_sum([122, 53, 60, 131]) == [122, 0, 60, 0]\nassert reset_sum([137, 83, 15, 102]) == [137, 0, 15, 117]\nassert reset_sum([125, 14, 60, 67, 98, 49, 138, 120]) == [125, 139, 0, 67, 0, 49, 0, 120]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 158:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 158:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 158 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([28, 54, 10, 9, 4, 62, 56, 9, 78, 16]) == [28, 82, 92, 101, 105, 0, 56, 65, 143, 0]`\nالجواب:", "qhash": "39b3d91ba8e05474"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ح'):\n            count += 1\n    return count", "tests": ["assert count_prefix('قلم لغة حصان سوق') == 1", "assert count_prefix('حصان لغة برتقال معلم') == 1", "assert count_prefix('عربية صحراء') == 0", "assert count_prefix('علم حاسوب حديقة حصان') == 3", "assert count_prefix('حاسوب جبل حديقة طائرة') == 2", "assert count_prefix('حصان طالب طائرة نور قمر') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('قلم لغة حصان سوق') == 1\nassert count_prefix('حصان لغة برتقال معلم') == 1\nassert count_prefix('عربية صحراء') == 0\nassert count_prefix('علم حاسوب حديقة حصان') == 3\nassert count_prefix('حاسوب جبل حديقة طائرة') == 2\nassert count_prefix('حصان طالب طائرة نور قمر') == 1\nassert count_prefix('') == 0", "answer": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ح'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ح'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(text):\n    count = 0\n    for w in text:\n        if w.startswith('ح'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ح»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(text):\n    count = 0\n    for w in text:\n        if w.startswith('ح'):\n            count += 1\n    return count\n```\nمثال: `count_prefix('قلم لغة حصان سوق') == 1`\nالجواب:", "qhash": "5ba861423907ba80"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('is at python vector') == 'hr zs oxsgnm udbsnq'", "assert shift_letters('stone banana') == 'rsnmd azmzmz'", "assert shift_letters('stone of apple code') == 'rsnmd ne zookd bncd'", "assert shift_letters('apple we go') == 'zookd vd fn'", "assert shift_letters('code A1') == 'bncd A1'", "assert shift_letters('river in we') == 'qhudq hm vd'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('is at python vector') == 'hr zs oxsgnm udbsnq'\nassert shift_letters('stone banana') == 'rsnmd azmzmz'\nassert shift_letters('stone of apple code') == 'rsnmd ne zookd bncd'\nassert shift_letters('apple we go') == 'zookd vd fn'\nassert shift_letters('code A1') == 'bncd A1'\nassert shift_letters('river in we') == 'qhudq hm vd'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('is at python vector') == 'hr zs oxsgnm udbsnq'`\nالجواب:", "qhash": "a976ff504be8b8e0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "how_many_div", "reference": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 8 != 0:\n            count += 1\n    return count", "tests": ["assert how_many_div([67, 36, 80, 81, 33, 57, 24, 4, 16, 56, 84]) == 2", "assert how_many_div([12, 31, -33, -17, 69, 44, -40, 20, 16, 70]) == 0", "assert how_many_div([54, -17, -36, 4, -16, 44, -15, 26, 39, 79]) == 2", "assert how_many_div([25]) == 0", "assert how_many_div([75, 23, 7, 73, 50, 80, -35, 49, 81]) == 1", "assert how_many_div([76, 17, 8, 8, 14, -13, 60, -5, 75, -14, 47]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([67, 36, 80, 81, 33, 57, 24, 4, 16, 56, 84]) == 2\nassert how_many_div([12, 31, -33, -17, 69, 44, -40, 20, 16, 70]) == 0\nassert how_many_div([54, -17, -36, 4, -16, 44, -15, 26, 39, 79]) == 2\nassert how_many_div([25]) == 0\nassert how_many_div([75, 23, 7, 73, 50, 80, -35, 49, 81]) == 1\nassert how_many_div([76, 17, 8, 8, 14, -13, 60, -5, 75, -14, 47]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 8 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 8 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 8. اكتب الحل كاملًا.\n```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `how_many_div([67, 36, 80, 81, 33, 57, 24, 4, 16, 56, 84]) == 2`\nالجواب:", "qhash": "1ecd64a0c754d45d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_coprime", "reference": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 69) == 1)", "tests": ["assert count_coprime(11) == 8", "assert count_coprime(44) == 29", "assert count_coprime(63) == 40", "assert count_coprime(55) == 35", "assert count_coprime(151) == 97", "assert count_coprime(139) == 89", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(11) == 8\nassert count_coprime(44) == 29\nassert count_coprime(63) == 40\nassert count_coprime(55) == 35\nassert count_coprime(151) == 97\nassert count_coprime(139) == 89\nassert count_coprime(1) == 1", "answer": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 69) == 1)", "completion": " ```python\ndef count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 69) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_coprime` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 69 في أي قاسم أكبر من 1.\nمثال: `count_coprime(11) == 8`\nالجواب:", "qhash": "e36be948844462d6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'يوسف': 23, 'مريم': 25, 'فيصل': 47}\nd['مريم'] += 17\nd['راشد'] = 44\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'يوسف': 23, 'مريم': 25, 'فيصل': 47}\nd['مريم'] += 17\nd['راشد'] = 44\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))\n```\nالجواب:", "qhash": "5459d187904c8b56", "answer": "4\nفيصل\n156\n-1", "completion": " الناتج:\n```text\n4\nفيصل\n156\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'rt'}", "tests": ["assert letter_stats('python summer window go') == {'r': 1, 't': 1}", "assert letter_stats('go is engine window orange on') == {'r': 1, 't': 0}", "assert letter_stats('python of up of') == {'r': 0, 't': 1}", "assert letter_stats('rocket we matrix code signal') == {'r': 2, 't': 2}", "assert letter_stats('is stone of we code data') == {'r': 0, 't': 2}", "assert letter_stats('it table camel') == {'r': 0, 't': 2}", "assert letter_stats('') == {'r': 0, 't': 0}"], "test_code": "assert letter_stats('python summer window go') == {'r': 1, 't': 1}\nassert letter_stats('go is engine window orange on') == {'r': 1, 't': 0}\nassert letter_stats('python of up of') == {'r': 0, 't': 1}\nassert letter_stats('rocket we matrix code signal') == {'r': 2, 't': 2}\nassert letter_stats('is stone of we code data') == {'r': 0, 't': 2}\nassert letter_stats('it table camel') == {'r': 0, 't': 2}\nassert letter_stats('') == {'r': 0, 't': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'rt'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'rt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'r'، 't' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('python summer window go') == {'r': 1, 't': 1}`\nالجواب:", "qhash": "d81dddc1ae8d4cf6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * -4 for x in xs if -20 <= x <= -6)", "tests": ["assert clip_scale([-24, -23, -7, 4, -27, -11, -30, -4, -19, -7]) == [28, 28, 44, 76]", "assert clip_scale([42, 54, 11, -18, 58, 22, 15, 20, 11, 16]) == [72]", "assert clip_scale([50, -3, 11]) == []", "assert clip_scale([57, 32, 31, -28, -17, -2, 25, -27, -2]) == [68]", "assert clip_scale([51, 39, -17, 21, -18, 35, -22, 33]) == [68, 72]", "assert clip_scale([55, 12, -18, 29]) == [72]", "assert clip_scale([5, 40, -1, 58, -25, 46, -14]) == [56]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-24, -23, -7, 4, -27, -11, -30, -4, -19, -7]) == [28, 28, 44, 76]\nassert clip_scale([42, 54, 11, -18, 58, 22, 15, 20, 11, 16]) == [72]\nassert clip_scale([50, -3, 11]) == []\nassert clip_scale([57, 32, 31, -28, -17, -2, 25, -27, -2]) == [68]\nassert clip_scale([51, 39, -17, 21, -18, 35, -22, 33]) == [68, 72]\nassert clip_scale([55, 12, -18, 29]) == [72]\nassert clip_scale([5, 40, -1, 58, -25, 46, -14]) == [56]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * -4 for x in xs if -20 <= x <= -6)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * -4 for x in xs if -20 <= x <= -6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [-20, -6].\nمثال: `clip_scale([-24, -23, -7, 4, -27, -11, -30, -4, -19, -7]) == [28, 28, 44, 76]`\nالجواب:", "qhash": "d58bf082bfe13c8a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(8, 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(8, 4))\n```\nالجواب:", "qhash": "d667b42fd291da49", "answer": "4096", "completion": " الناتج:\n```text\n4096\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "value_at", "reference": "def value_at(x):\n    return 2 * x ** 2 + (-7) * x + (0)", "tests": ["assert value_at(1) == -5", "assert value_at(19) == 589", "assert value_at(-11) == 319", "assert value_at(0) == 0", "assert value_at(-16) == 624", "assert value_at(-11) == 319", "assert value_at(-7) == 147", "assert value_at(0) == 0"], "test_code": "assert value_at(1) == -5\nassert value_at(19) == 589\nassert value_at(-11) == 319\nassert value_at(0) == 0\nassert value_at(-16) == 624\nassert value_at(-11) == 319\nassert value_at(-7) == 147\nassert value_at(0) == 0", "answer": "def value_at(x):\n    return 2 * x ** 2 + (-7) * x + (0)", "completion": " ```python\ndef value_at(x):\n    return 2 * x ** 2 + (-7) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `value_at` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 2x² - 7x + 0.\nمثال: `value_at(1) == -5`\nالجواب:", "qhash": "34a1b16dbd2e6c2f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 72", "tests": ["assert digit_power(1154) == 47", "assert digit_power(589502) == 59", "assert digit_power(323440) == 46", "assert digit_power(129271) == 10", "assert digit_power(990278) == 17", "assert digit_power(39165) == 18", "assert digit_power(803501) == 17", "assert digit_power(0) == 0"], "test_code": "assert digit_power(1154) == 47\nassert digit_power(589502) == 59\nassert digit_power(323440) == 46\nassert digit_power(129271) == 10\nassert digit_power(990278) == 17\nassert digit_power(39165) == 18\nassert digit_power(803501) == 17\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 72", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 72\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 72.\nمثال: `digit_power(1154) == 47`\nالجواب:", "qhash": "268e5833795d648d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (14)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('we by music') == 'ks pm aigwq'", "assert shift_letters('coffee a') == 'qcttss o'", "assert shift_letters('music in we is engine') == 'aigwq wb ks wg sbuwbs'", "assert shift_letters('river river signal falcon to') == 'fwjsf fwjsf gwuboz tozqcb hc'", "assert shift_letters('at we') == 'oh ks'", "assert shift_letters('by table on') == 'pm hopzs cb'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('we by music') == 'ks pm aigwq'\nassert shift_letters('coffee a') == 'qcttss o'\nassert shift_letters('music in we is engine') == 'aigwq wb ks wg sbuwbs'\nassert shift_letters('river river signal falcon to') == 'fwjsf fwjsf gwuboz tozqcb hc'\nassert shift_letters('at we') == 'oh ks'\nassert shift_letters('by table on') == 'pm hopzs cb'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (14)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (14)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 14 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('we by music') == 'ks pm aigwq'`\nالجواب:", "qhash": "e498afbb014f87b8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "spin", "reference": "def spin(items):\n    if not items:\n        return []\n    k = 4 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert spin([44, 11, 31, 38, 10, 44, 7]) == [38, 10, 44, 7, 44, 11, 31]", "assert spin([43, 33, 2, 39, 22, 13, -4]) == [39, 22, 13, -4, 43, 33, 2]", "assert spin([6, 13, 5, 23, 35, 31]) == [5, 23, 35, 31, 6, 13]", "assert spin([22, 31, 23, 27, 9, 42, 39, 14, 22]) == [42, 39, 14, 22, 22, 31, 23, 27, 9]", "assert spin([49, 5, 33]) == [33, 49, 5]", "assert spin([11, 13, 38, 2, 42, 7, 44, 32, -9, 34, 6]) == [32, -9, 34, 6, 11, 13, 38, 2, 42, 7, 44]", "assert spin([]) == []"], "test_code": "assert spin([44, 11, 31, 38, 10, 44, 7]) == [38, 10, 44, 7, 44, 11, 31]\nassert spin([43, 33, 2, 39, 22, 13, -4]) == [39, 22, 13, -4, 43, 33, 2]\nassert spin([6, 13, 5, 23, 35, 31]) == [5, 23, 35, 31, 6, 13]\nassert spin([22, 31, 23, 27, 9, 42, 39, 14, 22]) == [42, 39, 14, 22, 22, 31, 23, 27, 9]\nassert spin([49, 5, 33]) == [33, 49, 5]\nassert spin([11, 13, 38, 2, 42, 7, 44, 32, -9, 34, 6]) == [32, -9, 34, 6, 11, 13, 38, 2, 42, 7, 44]\nassert spin([]) == []", "answer": "def spin(items):\n    if not items:\n        return []\n    k = 4 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef spin(items):\n    if not items:\n        return []\n    k = 4 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef spin(items):\n    if not items:\n        return []\n    k = 4 % len(items)\n    return ____\n```\nمثال: `spin([44, 11, 31, 38, 10, 44, 7]) == [38, 10, 44, 7, 44, 11, 31]`\nالجواب:", "qhash": "3a1d3fc6f60fcddb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'مريم': 48, 'أحمد': 14, 'زينب': 48, 'سعيد': 15}\nd['زينب'] += 15\nd['سلمى'] = 39\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 16])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'مريم': 48, 'أحمد': 14, 'زينب': 48, 'سعيد': 15}\nd['زينب'] += 15\nd['سلمى'] = 39\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 16])\n```\nالجواب:", "qhash": "f09396fe673b1fdf", "answer": "5\nزينب\n179\n['مريم', 'زينب', 'سلمى']", "completion": " الناتج:\n```text\n5\nزينب\n179\n['مريم', 'زينب', 'سلمى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 18\nfor j in range(2, 5, 2):\n    acc += j * 4\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 18\nfor j in range(2, 5, 2):\n    acc += j * 4\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "930277ead6ad4368", "answer": "42\n4", "completion": " الناتج:\n```text\n42\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x ** 2 - 6 for x in range(5, 16) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x ** 2 - 6 for x in range(5, 16) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "efe020323ce690aa", "answer": "[30, 94, 190]\n3 314", "completion": " الناتج:\n```text\n[30, 94, 190]\n3 314\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n):\n    if n <= 1:\n        return 1\n    return 1 * calc(n - 1) + 4\n\nprint(calc(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n):\n    if n <= 1:\n        return 1\n    return 1 * calc(n - 1) + 4\n\nprint(calc(11))\n```\nالجواب:", "qhash": "ca8edf512e94fb9b", "answer": "41", "completion": " الناتج:\n```text\n41\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * -4 for x in xs if 11 <= x <= 45)", "tests": ["assert clip_scale([15, 30, 17, 8, 42, 3, 45, 29, 21, 36]) == [-180, -168, -144, -120, -116, -84, -68, -60]", "assert clip_scale([19, 55, 19]) == [-76, -76]", "assert clip_scale([-18, 19, 32, 49]) == [-128, -76]", "assert clip_scale([-7, 34, 18, 4, 34, 8, 19, 3, 28]) == [-136, -136, -112, -76, -72]", "assert clip_scale([-23, 41, -20]) == [-164]", "assert clip_scale([56, -4, 26, -7]) == [-104]", "assert clip_scale([27, 56, -20, -28, -16]) == [-108]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([15, 30, 17, 8, 42, 3, 45, 29, 21, 36]) == [-180, -168, -144, -120, -116, -84, -68, -60]\nassert clip_scale([19, 55, 19]) == [-76, -76]\nassert clip_scale([-18, 19, 32, 49]) == [-128, -76]\nassert clip_scale([-7, 34, 18, 4, 34, 8, 19, 3, 28]) == [-136, -136, -112, -76, -72]\nassert clip_scale([-23, 41, -20]) == [-164]\nassert clip_scale([56, -4, 26, -7]) == [-104]\nassert clip_scale([27, 56, -20, -28, -16]) == [-108]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * -4 for x in xs if 11 <= x <= 45)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * -4 for x in xs if 11 <= x <= 45)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [11, 45].\nمثال: `clip_scale([15, 30, 17, 8, 42, 3, 45, 29, 21, 36]) == [-180, -168, -144, -120, -116, -84, -68, -60]`\nالجواب:", "qhash": "2e0858726cda1431"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert total_multiples(300) == 7352", "assert total_multiples(222) == 3996", "assert total_multiples(28) == 60", "assert total_multiples(258) == 5676", "assert total_multiples(134) == 1520", "assert total_multiples(36) == 92", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(300) == 7352\nassert total_multiples(222) == 3996\nassert total_multiples(28) == 60\nassert total_multiples(258) == 5676\nassert total_multiples(134) == 1520\nassert total_multiples(36) == 92\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 8 أو 12 دون باقٍ.\nمثال: `total_multiples(300) == 7352`\nالجواب:", "qhash": "8d877a7acc5d67bd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([60, -12, -10, -14]) == None", "assert biggest_mult([-27, -9, -27]) == -9", "assert biggest_mult([1, 10, 19]) == None", "assert biggest_mult([-21, -27, -1, 25, -28, -1, 13, 26]) == -27", "assert biggest_mult([-43, -39, -22, -42, -44, -19, -22, -21]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([60, -12, -10, -14]) == None\nassert biggest_mult([-27, -9, -27]) == -9\nassert biggest_mult([1, 10, 19]) == None\nassert biggest_mult([-21, -27, -1, 25, -28, -1, 13, 26]) == -27\nassert biggest_mult([-43, -39, -22, -42, -44, -19, -22, -21]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 9 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 9 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([60, -12, -10, -14]) == None`\nالجواب:", "qhash": "ef7583e2cf96e72d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'ميناء'\nprint(len(s))\nprint(s.find('ء'))\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'ميناء'\nprint(len(s))\nprint(s.find('ء'))\nprint(s.split())\n```\nالجواب:", "qhash": "d08291fc256a757b", "answer": "5\n4\n['ميناء']", "completion": " الناتج:\n```text\n5\n4\n['ميناء']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 3)) % 73", "tests": ["assert prod_mod(5) == 10", "assert prod_mod(27) == 8", "assert prod_mod(5) == 10", "assert prod_mod(32) == 26", "assert prod_mod(17) == 3", "assert prod_mod(46) == 11", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(5) == 10\nassert prod_mod(27) == 8\nassert prod_mod(5) == 10\nassert prod_mod(32) == 26\nassert prod_mod(17) == 3\nassert prod_mod(46) == 11\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 3)) % 73", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 3)) % 73\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 73 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(5) == 10`\nالجواب:", "qhash": "305a1d4f882a1bbc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "lst = [3, 2, 40, -6, 30]\nprint(lst[1:3])\nprint(lst[::3])\nprint(max(lst[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nlst = [3, 2, 40, -6, 30]\nprint(lst[1:3])\nprint(lst[::3])\nprint(max(lst[1:3]))\n```\nالجواب:", "qhash": "72e7ebf9796777fe", "answer": "[2, 40]\n[3, -6]\n40", "completion": " الناتج:\n```text\n[2, 40]\n[3, -6]\n40\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'chm'}", "tests": ["assert char_freq('signal data by in') == {'c': 0, 'h': 0, 'm': 0}", "assert char_freq('engine music data') == {'c': 1, 'h': 0, 'm': 1}", "assert char_freq('window vector table stone it') == {'c': 1, 'h': 0, 'm': 0}", "assert char_freq('code code vector cloud summer coffee') == {'c': 5, 'h': 0, 'm': 2}", "assert char_freq('it') == {'c': 0, 'h': 0, 'm': 0}", "assert char_freq('window go engine of') == {'c': 0, 'h': 0, 'm': 0}", "assert char_freq('') == {'c': 0, 'h': 0, 'm': 0}"], "test_code": "assert char_freq('signal data by in') == {'c': 0, 'h': 0, 'm': 0}\nassert char_freq('engine music data') == {'c': 1, 'h': 0, 'm': 1}\nassert char_freq('window vector table stone it') == {'c': 1, 'h': 0, 'm': 0}\nassert char_freq('code code vector cloud summer coffee') == {'c': 5, 'h': 0, 'm': 2}\nassert char_freq('it') == {'c': 0, 'h': 0, 'm': 0}\nassert char_freq('window go engine of') == {'c': 0, 'h': 0, 'm': 0}\nassert char_freq('') == {'c': 0, 'h': 0, 'm': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'chm'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'chm'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'c'، 'h'، 'm' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('signal data by in') == {'c': 0, 'h': 0, 'm': 0}`\nالجواب:", "qhash": "bb8773ed4fb0aad8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(27) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13', '14', 'Ping', '16', '17', '18', '19', 'PingPong', '21', '22', '23', '24', 'Ping', '26', '27']", "assert label_numbers(13) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13']", "assert label_numbers(6) == ['1', '2', '3', '4', 'Ping', '6']", "assert label_numbers(14) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13', '14']", "assert label_numbers(5) == ['1', '2', '3', '4', 'Ping']"], "test_code": "assert label_numbers(27) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13', '14', 'Ping', '16', '17', '18', '19', 'PingPong', '21', '22', '23', '24', 'Ping', '26', '27']\nassert label_numbers(13) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13']\nassert label_numbers(6) == ['1', '2', '3', '4', 'Ping', '6']\nassert label_numbers(14) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13', '14']\nassert label_numbers(5) == ['1', '2', '3', '4', 'Ping']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Ping'، مضاعفات 10 تصبح 'Pong'، المضاعفات المشتركة تصبح 'PingPong'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(27) == ['1', '2', '3', '4', 'Ping', '6', '7', '8', '9', 'PingPong', '11', '12', '13', '14', 'Ping', '16', '17', '18', '19', 'PingPong', '21', '22', '23', '24', 'Ping', '26', '27']`\nالجواب:", "qhash": "d2920a3272411db0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [13, 39, 22, 29, 25, 15, -5, -3, 17]\nprint(a[0:3])\nprint(a[::3])\nprint(len(a[0:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [13, 39, 22, 29, 25, 15, -5, -3, 17]\nprint(a[0:3])\nprint(a[::3])\nprint(len(a[0:3]))\n```\nالجواب:", "qhash": "e456e716c45181dc", "answer": "[13, 39, 22]\n[13, 29, -5]\n3", "completion": " الناتج:\n```text\n[13, 39, 22]\n[13, 29, -5]\n3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('زينب', 66), ('يوسف', 31), ('هدى', 0), ('مريم', 93)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('زينب', 66), ('يوسف', 31), ('هدى', 0), ('مريم', 93)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "6a77a6bed4577fca", "answer": "[('هدى', 0), ('يوسف', 31), ('زينب', 66), ('مريم', 93)]\n['مريم', 'زينب']", "completion": " الناتج:\n```text\n[('هدى', 0), ('يوسف', 31), ('زينب', 66), ('مريم', 93)]\n['مريم', 'زينب']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return 5 * x ** 2 + (9) * x + (3)", "tests": ["assert poly(8) == 395", "assert poly(-17) == 1295", "assert poly(0) == 3", "assert poly(3) == 75", "assert poly(11) == 707", "assert poly(-1) == -1", "assert poly(17) == 1601", "assert poly(0) == 3"], "test_code": "assert poly(8) == 395\nassert poly(-17) == 1295\nassert poly(0) == 3\nassert poly(3) == 75\nassert poly(11) == 707\nassert poly(-1) == -1\nassert poly(17) == 1601\nassert poly(0) == 3", "answer": "def poly(x):\n    return 5 * x ** 2 + (9) * x + (3)", "completion": " ```python\ndef poly(x):\n    return 5 * x ** 2 + (9) * x + (3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 5x² + 9x + 3.\nمثال: `poly(8) == 395`\nالجواب:", "qhash": "38beeaf152b2e34d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ن'):\n            count += 1\n    return count", "tests": ["assert lead_count('قمر برتقال نهر خبز صديق سماء') == 1", "assert lead_count('تفاحة تفاحة ميناء حصان سماء نهار') == 1", "assert lead_count('نهر فجر قمر جمل سفينة نور') == 2", "assert lead_count('نهر مدينة تفاحة معلم حديقة') == 1", "assert lead_count('مدينة سماء نهر') == 1", "assert lead_count('برتقال عربية برمجة حديقة وردة حصان') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('قمر برتقال نهر خبز صديق سماء') == 1\nassert lead_count('تفاحة تفاحة ميناء حصان سماء نهار') == 1\nassert lead_count('نهر فجر قمر جمل سفينة نور') == 2\nassert lead_count('نهر مدينة تفاحة معلم حديقة') == 1\nassert lead_count('مدينة سماء نهر') == 1\nassert lead_count('برتقال عربية برمجة حديقة وردة حصان') == 0\nassert lead_count('') == 0", "answer": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ن'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ن'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ن'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ن»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ن'):\n            count += 1\n    return count\n```\nمثال: `lead_count('قمر برتقال نهر خبز صديق سماء') == 1`\nالجواب:", "qhash": "136ad59041d08469"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=0):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(calc(-7))\nprint(calc(-7, -5))\nprint(calc(calc(-5), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=0):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(calc(-7))\nprint(calc(-7, -5))\nprint(calc(calc(-5), -7))\n```\nالجواب:", "qhash": "1a7873f5faf447cf", "answer": "-7\n-17\n-3", "completion": " الناتج:\n```text\n-7\n-17\n-3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'صحراء جبل'\nprint(s[0])\nprint(len(s))\nprint(s.find('ح'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'صحراء جبل'\nprint(s[0])\nprint(len(s))\nprint(s.find('ح'))\n```\nالجواب:", "qhash": "230e909f285b3713", "answer": "ص\n9\n1", "completion": " الناتج:\n```text\nص\n9\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [-3, 18, 13, 26, -6, -5, 22, 21, 0]\nprint(items[2:5])\nprint(items[::3])\nprint(sum(items[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [-3, 18, 13, 26, -6, -5, 22, 21, 0]\nprint(items[2:5])\nprint(items[::3])\nprint(sum(items[2:5]))\n```\nالجواب:", "qhash": "eef964e5f6179e46", "answer": "[13, 26, -6]\n[-3, 26, 22]\n33", "completion": " الناتج:\n```text\n[13, 26, -6]\n[-3, 26, 22]\n33\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "tests": ["assert scaled_powers(7) == 9352", "assert scaled_powers(6) == 4550", "assert scaled_powers(0) == 0", "assert scaled_powers(1) == 2", "assert scaled_powers(14) == 255374", "assert scaled_powers(1) == 2", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(7) == 9352\nassert scaled_powers(6) == 4550\nassert scaled_powers(0) == 0\nassert scaled_powers(1) == 2\nassert scaled_powers(14) == 255374\nassert scaled_powers(1) == 2\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "completion": " ```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total\n```\n", "buggy": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 4\n    return total\n```\nمثال: `scaled_powers(7) == 9352`\nالجواب:", "qhash": "73c4055a55e2423d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 49627\nsteps = 0\nwhile n > 2:\n    n = n // 6\n    steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 49627\nsteps = 0\nwhile n > 2:\n    n = n // 6\n    steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "35b8a8b6c7df3116", "answer": "1 6", "completion": " الناتج:\n```text\n1 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_list", "reference": "def rotate_list(items):\n    if not items:\n        return []\n    k = 6 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_list([24, 28, 11]) == [24, 28, 11]", "assert rotate_list([6, 19, 19, 6, 4, 41]) == [6, 19, 19, 6, 4, 41]", "assert rotate_list([-7, -8, 18, 22, 44, 44, 19, 48, 20]) == [22, 44, 44, 19, 48, 20, -7, -8, 18]", "assert rotate_list([31]) == [31]", "assert rotate_list([-2, 11, 14, 24, 39, 24, 43]) == [11, 14, 24, 39, 24, 43, -2]", "assert rotate_list([31, 23, 9, 8, 39, -6]) == [31, 23, 9, 8, 39, -6]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([24, 28, 11]) == [24, 28, 11]\nassert rotate_list([6, 19, 19, 6, 4, 41]) == [6, 19, 19, 6, 4, 41]\nassert rotate_list([-7, -8, 18, 22, 44, 44, 19, 48, 20]) == [22, 44, 44, 19, 48, 20, -7, -8, 18]\nassert rotate_list([31]) == [31]\nassert rotate_list([-2, 11, 14, 24, 39, 24, 43]) == [11, 14, 24, 39, 24, 43, -2]\nassert rotate_list([31, 23, 9, 8, 39, -6]) == [31, 23, 9, 8, 39, -6]\nassert rotate_list([]) == []", "answer": "def rotate_list(items):\n    if not items:\n        return []\n    k = 6 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 6 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 6 % len(items)\n    return ____\n```\nمثال: `rotate_list([24, 28, 11]) == [24, 28, 11]`\nالجواب:", "qhash": "d39d89474a02a7dc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "nums = [5, 29, 40, -4, 25, 28, 37]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(len(nums[2:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [5, 29, 40, -4, 25, 28, 37]\nprint(nums[2:7])\nprint(nums[::-2])\nprint(len(nums[2:7]))\n```\nالجواب:", "qhash": "ab0b2ea784306518", "answer": "[40, -4, 25, 28, 37]\n[37, 25, 40, 5]\n5", "completion": " الناتج:\n```text\n[40, -4, 25, 28, 37]\n[37, 25, 40, 5]\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(lst):\n    if not lst:\n        return []\n    k = 18 % len(lst)\n    return lst[k:] + lst[:k]", "tests": ["assert shift_list([9, 49, 10, 7, 2, 5]) == [9, 49, 10, 7, 2, 5]", "assert shift_list([34, -1, 3, 19, 13, 4, 30, 45]) == [3, 19, 13, 4, 30, 45, 34, -1]", "assert shift_list([49, 39, 23, 39, 46, 46, 41]) == [46, 46, 41, 49, 39, 23, 39]", "assert shift_list([3, 1]) == [3, 1]", "assert shift_list([37, 5, 48, 42, 31, 2]) == [37, 5, 48, 42, 31, 2]", "assert shift_list([6, 40, 18, 43, 42, -9, 20, 0, 37, -6, 10]) == [0, 37, -6, 10, 6, 40, 18, 43, 42, -9, 20]", "assert shift_list([]) == []"], "test_code": "assert shift_list([9, 49, 10, 7, 2, 5]) == [9, 49, 10, 7, 2, 5]\nassert shift_list([34, -1, 3, 19, 13, 4, 30, 45]) == [3, 19, 13, 4, 30, 45, 34, -1]\nassert shift_list([49, 39, 23, 39, 46, 46, 41]) == [46, 46, 41, 49, 39, 23, 39]\nassert shift_list([3, 1]) == [3, 1]\nassert shift_list([37, 5, 48, 42, 31, 2]) == [37, 5, 48, 42, 31, 2]\nassert shift_list([6, 40, 18, 43, 42, -9, 20, 0, 37, -6, 10]) == [0, 37, -6, 10, 6, 40, 18, 43, 42, -9, 20]\nassert shift_list([]) == []", "answer": "def shift_list(lst):\n    if not lst:\n        return []\n    k = 18 % len(lst)\n    return lst[k:] + lst[:k]", "completion": " ```python\ndef shift_list(lst):\n    if not lst:\n        return []\n    k = 18 % len(lst)\n    return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 18 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(lst):\n    if not lst:\n        return []\n    k = 18 % len(lst)\n    return ____\n```\nمثال: `shift_list([9, 49, 10, 7, 2, 5]) == [9, 49, 10, 7, 2, 5]`\nالجواب:", "qhash": "6fe79e45b32d1178"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [27, -6, -10, 33, 5, 11]\nprint(sorted(nums, key=lambda x: (abs(x - 1), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [27, -6, -10, 33, 5, 11]\nprint(sorted(nums, key=lambda x: (abs(x - 1), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "872734dbc2d86eec", "answer": "[5, -6, 11, -10, 27, 33]\n[33, 27, 11]", "completion": " الناتج:\n```text\n[5, -6, 11, -10, 27, 33]\n[33, 27, 11]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'desert'\nprint(name.upper())\nprint(name[3:4])\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'desert'\nprint(name.upper())\nprint(name[3:4])\nprint(len(name))\n```\nالجواب:", "qhash": "bb9ee786aa699641", "answer": "DESERT\ne\n6", "completion": " الناتج:\n```text\nDESERT\ne\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_text", "reference": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_text('window at camel planet engine 2024') == 'xjoepx bu dbnfm qmbofu fohjof 2024'", "assert shift_text('up go an stone') == 'vq hp bo tupof'", "assert shift_text('desert camel on falcon') == 'eftfsu dbnfm po gbmdpo'", "assert shift_text('by') == 'cz'", "assert shift_text('planet to an stone A1') == 'qmbofu up bo tupof A1'", "assert shift_text('code signal cloud river !') == 'dpef tjhobm dmpve sjwfs !'", "assert shift_text('') == ''"], "test_code": "assert shift_text('window at camel planet engine 2024') == 'xjoepx bu dbnfm qmbofu fohjof 2024'\nassert shift_text('up go an stone') == 'vq hp bo tupof'\nassert shift_text('desert camel on falcon') == 'eftfsu dbnfm po gbmdpo'\nassert shift_text('by') == 'cz'\nassert shift_text('planet to an stone A1') == 'qmbofu up bo tupof A1'\nassert shift_text('code signal cloud river !') == 'dpef tjhobm dmpve sjwfs !'\nassert shift_text('') == ''", "answer": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_text` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('window at camel planet engine 2024') == 'xjoepx bu dbnfm qmbofu fohjof 2024'`\nالجواب:", "qhash": "7712398d5b9fadcc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_long_words('banana cloud vector planet engine camel falcon camel') == 'falcon_engine_planet_vector_banana'", "assert rev_long_words('go brain') == ''", "assert rev_long_words('it stone code go garden engine falcon an') == 'falcon_engine_garden'", "assert rev_long_words('table vector apple falcon in') == 'falcon_vector'", "assert rev_long_words('in a summer river in by cloud at') == 'summer'", "assert rev_long_words('signal desert signal') == 'signal_desert_signal'", "assert rev_long_words('banana code') == 'banana'"], "test_code": "assert rev_long_words('banana cloud vector planet engine camel falcon camel') == 'falcon_engine_planet_vector_banana'\nassert rev_long_words('go brain') == ''\nassert rev_long_words('it stone code go garden engine falcon an') == 'falcon_engine_garden'\nassert rev_long_words('table vector apple falcon in') == 'falcon_vector'\nassert rev_long_words('in a summer river in by cloud at') == 'summer'\nassert rev_long_words('signal desert signal') == 'signal_desert_signal'\nassert rev_long_words('banana code') == 'banana'", "answer": "def rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 6 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `rev_long_words('banana cloud vector planet engine camel falcon camel') == 'falcon_engine_planet_vector_banana'`\nالجواب:", "qhash": "b937e1292ede77e8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'cloud_light'\nprint(word[::-1])\nprint(word[-2:])\nprint(word.index('l') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'cloud_light'\nprint(word[::-1])\nprint(word[-2:])\nprint(word.index('l') + len(word))\n```\nالجواب:", "qhash": "c05a2bbffb907027", "answer": "thgil_duolc\nht\n12", "completion": " الناتج:\n```text\nthgil_duolc\nht\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 60:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([10, 23, 26, 1, 22, 8, 30, 18]) == [10, 33, 59, 60, 0, 8, 38, 56]", "assert capped_cumsum([2, 0, 3, 60, 11]) == [2, 2, 5, 0, 11]", "assert capped_cumsum([48, -8, 34, 18]) == [48, 40, 0, 18]", "assert capped_cumsum([3, 41, 31]) == [3, 44, 0]", "assert capped_cumsum([40, 28, 37, 27]) == [40, 0, 37, 0]", "assert capped_cumsum([22, 4, -10, 56, 27]) == [22, 26, 16, 0, 27]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([10, 23, 26, 1, 22, 8, 30, 18]) == [10, 33, 59, 60, 0, 8, 38, 56]\nassert capped_cumsum([2, 0, 3, 60, 11]) == [2, 2, 5, 0, 11]\nassert capped_cumsum([48, -8, 34, 18]) == [48, 40, 0, 18]\nassert capped_cumsum([3, 41, 31]) == [3, 44, 0]\nassert capped_cumsum([40, 28, 37, 27]) == [40, 0, 37, 0]\nassert capped_cumsum([22, 4, -10, 56, 27]) == [22, 26, 16, 0, 27]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 60:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 60:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 60 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([10, 23, 26, 1, 22, 8, 30, 18]) == [10, 33, 59, 60, 0, 8, 38, 56]`\nالجواب:", "qhash": "268d206dd3f6a552"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([13, 29, 39, 5, 67, 38, 83, 8, 86]) == 0", "assert tally_div([32, 82, -40, 30, 53]) == 0", "assert tally_div([53, -30, -28, 42, -12]) == 0", "assert tally_div([67, 31, 87, 42, 37, 42, 78, 34, -24, 86, 62]) == 0", "assert tally_div([69, -8, 80, 70, 40, -37, 8, 42]) == 0", "assert tally_div([86, 21, -18, 85, -2]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([13, 29, 39, 5, 67, 38, 83, 8, 86]) == 0\nassert tally_div([32, 82, -40, 30, 53]) == 0\nassert tally_div([53, -30, -28, 42, -12]) == 0\nassert tally_div([67, 31, 87, 42, 37, 42, 78, 34, -24, 86, 62]) == 0\nassert tally_div([69, -8, 80, 70, 40, -37, 8, 42]) == 0\nassert tally_div([86, 21, -18, 85, -2]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([13, 29, 39, 5, 67, 38, 83, 8, 86]) == 0`\nالجواب:", "qhash": "6864ccad827c7f78"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert invert_words('to rocket it go') == 'go-it-rocket-to'", "assert invert_words('coffee up at pixel matrix garden') == 'garden-matrix-pixel-at-up-coffee'", "assert invert_words('of we on matrix') == 'matrix-on-we-of'", "assert invert_words('a') == 'a'", "assert invert_words('a is camel a river engine coffee') == 'coffee-engine-river-a-camel-is-a'", "assert invert_words('desert') == 'desert'", "assert invert_words('') == ''"], "test_code": "assert invert_words('to rocket it go') == 'go-it-rocket-to'\nassert invert_words('coffee up at pixel matrix garden') == 'garden-matrix-pixel-at-up-coffee'\nassert invert_words('of we on matrix') == 'matrix-on-we-of'\nassert invert_words('a') == 'a'\nassert invert_words('a is camel a river engine coffee') == 'coffee-engine-river-a-camel-is-a'\nassert invert_words('desert') == 'desert'\nassert invert_words('') == ''", "answer": "def invert_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef invert_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `invert_words('to rocket it go') == 'go-it-rocket-to'`\nالجواب:", "qhash": "6a9b864c71851770"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizz", "reference": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Ping'\n        if i % 11 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizz(13) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13']", "assert fizz(14) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13', '14']", "assert fizz(22) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13', '14', '15', '16', '17', 'Ping', '19', '20', '21', 'Pong']", "assert fizz(7) == ['1', '2', '3', '4', '5', 'Ping', '7']", "assert fizz(0) == []"], "test_code": "assert fizz(13) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13']\nassert fizz(14) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13', '14']\nassert fizz(22) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13', '14', '15', '16', '17', 'Ping', '19', '20', '21', 'Pong']\nassert fizz(7) == ['1', '2', '3', '4', '5', 'Ping', '7']\nassert fizz(0) == []", "answer": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Ping'\n        if i % 11 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Ping'\n        if i % 11 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Ping'، مضاعفات 11 تصبح 'Pong'، المضاعفات المشتركة تصبح 'PingPong'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizz(13) == ['1', '2', '3', '4', '5', 'Ping', '7', '8', '9', '10', 'Pong', 'Ping', '13']`\nالجواب:", "qhash": "393b566c08657f63"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "power_sum", "reference": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 4\n    return total", "tests": ["assert power_sum(6) == 13650", "assert power_sum(1) == 6", "assert power_sum(8) == 52632", "assert power_sum(2) == 102", "assert power_sum(10) == 151998", "assert power_sum(1) == 6", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 13650\nassert power_sum(1) == 6\nassert power_sum(8) == 52632\nassert power_sum(2) == 102\nassert power_sum(10) == 151998\nassert power_sum(1) == 6\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 4\n    return total", "completion": " ```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 4\n    return total\n```\n", "buggy": "def power_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 6 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 6 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 6 * i ** 4\n    return total\n```\nمثال: `power_sum(6) == 13650`\nالجواب:", "qhash": "4a00f189a4e2a10d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'لغة'\nprint(s.replace(' ', '-'))\nprint(s.split())\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'لغة'\nprint(s.replace(' ', '-'))\nprint(s.split())\nprint(s[::-1])\n```\nالجواب:", "qhash": "cab7d94f14c5758a", "answer": "لغة\n['لغة']\nةغل", "completion": " الناتج:\n```text\nلغة\n['لغة']\nةغل\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 49720\nsteps = 0\nwhile n > 5:\n    n = n // 8\n    steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 49720\nsteps = 0\nwhile n > 5:\n    n = n // 8\n    steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "b9faf5cc62313360", "answer": "1 5", "completion": " الناتج:\n```text\n1 5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "multi_fact", "reference": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 1)) % 97", "tests": ["assert multi_fact(12) == 80", "assert multi_fact(24) == 20", "assert multi_fact(0) == 1", "assert multi_fact(47) == 53", "assert multi_fact(45) == 40", "assert multi_fact(1) == 1", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(12) == 80\nassert multi_fact(24) == 20\nassert multi_fact(0) == 1\nassert multi_fact(47) == 53\nassert multi_fact(45) == 40\nassert multi_fact(1) == 1\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 1)) % 97", "completion": " ```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 1)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `multi_fact(12) == 80`\nالجواب:", "qhash": "be4dbb209c14b9d7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_gcd1", "reference": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 88) == 1)", "tests": ["assert count_gcd1(107) == 49", "assert count_gcd1(56) == 25", "assert count_gcd1(198) == 90", "assert count_gcd1(66) == 30", "assert count_gcd1(135) == 62", "assert count_gcd1(94) == 43", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(107) == 49\nassert count_gcd1(56) == 25\nassert count_gcd1(198) == 90\nassert count_gcd1(66) == 30\nassert count_gcd1(135) == 62\nassert count_gcd1(94) == 43\nassert count_gcd1(1) == 1", "answer": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 88) == 1)", "completion": " ```python\ndef count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 88) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_gcd1` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 88 في أي قاسم أكبر من 1.\nمثال: `count_gcd1(107) == 49`\nالجواب:", "qhash": "0abc64e227deee73"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([-18, -6, 13, 57, -14, -28]) == 57", "assert largest_div([-12, -9, -9]) == -9", "assert largest_div([1, 4]) == None", "assert largest_div([8, -29, 8, -16, -23, 15, 28]) == 15", "assert largest_div([16, -44, 16, -42, 21, -46, -19, -9, 18]) == 21", "assert largest_div([]) == None"], "test_code": "assert largest_div([-18, -6, 13, 57, -14, -28]) == 57\nassert largest_div([-12, -9, -9]) == -9\nassert largest_div([1, 4]) == None\nassert largest_div([8, -29, 8, -16, -23, 15, 28]) == 15\nassert largest_div([16, -44, 16, -42, 21, -46, -19, -9, 18]) == 21\nassert largest_div([]) == None", "answer": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(xs):\n    best = 0\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(xs):\n    best = 0\n    for x in xs:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `largest_div([-18, -6, 13, 57, -14, -28]) == 57`\nالجواب:", "qhash": "b8eee87f8fc1b67c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 11 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(30) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21', 'Blue', '23', '24', 'Red', '26', '27', '28', '29', 'Red']", "assert label_numbers(25) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21', 'Blue', '23', '24', 'Red']", "assert label_numbers(2) == ['1', '2']", "assert label_numbers(17) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17']", "assert label_numbers(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18']"], "test_code": "assert label_numbers(30) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21', 'Blue', '23', '24', 'Red', '26', '27', '28', '29', 'Red']\nassert label_numbers(25) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21', 'Blue', '23', '24', 'Red']\nassert label_numbers(2) == ['1', '2']\nassert label_numbers(17) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17']\nassert label_numbers(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 11 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 11 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Red'، مضاعفات 11 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(30) == ['1', '2', '3', '4', 'Red', '6', '7', '8', '9', 'Red', 'Blue', '12', '13', '14', 'Red', '16', '17', '18', '19', 'Red', '21', 'Blue', '23', '24', 'Red', '26', '27', '28', '29', 'Red']`\nالجواب:", "qhash": "b45f246c11ef7896"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 43\nc = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    c += 1\nprint(c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 43\nc = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    c += 1\nprint(c)\n```\nالجواب:", "qhash": "3b18868a3540882b", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)", "tests": ["assert total_multiples(298) == 17523", "assert total_multiples(225) == 9942", "assert total_multiples(269) == 14127", "assert total_multiples(299) == 17523", "assert total_multiples(269) == 14127", "assert total_multiples(44) == 348", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(298) == 17523\nassert total_multiples(225) == 9942\nassert total_multiples(269) == 14127\nassert total_multiples(299) == 17523\nassert total_multiples(269) == 14127\nassert total_multiples(44) == 348\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 11 دون باقٍ.\nمثال: `total_multiples(298) == 17523`\nالجواب:", "qhash": "e11ff6b886e9fbbe"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('صديق شجرة قمر ليل وردة بيت') == 1", "assert prefix_hits('ليل قلم فجر جمل صحراء مدرسة') == 1", "assert prefix_hits('بيت حاسوب رمل صحراء صديق بيت') == 2", "assert prefix_hits('سماء صحراء مدينة') == 1", "assert prefix_hits('جمل ميناء سماء برمجة سفينة') == 0", "assert prefix_hits('برتقال عمل صديق صحراء') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صديق شجرة قمر ليل وردة بيت') == 1\nassert prefix_hits('ليل قلم فجر جمل صحراء مدرسة') == 1\nassert prefix_hits('بيت حاسوب رمل صحراء صديق بيت') == 2\nassert prefix_hits('سماء صحراء مدينة') == 1\nassert prefix_hits('جمل ميناء سماء برمجة سفينة') == 0\nassert prefix_hits('برتقال عمل صديق صحراء') == 2\nassert prefix_hits('') == 0", "answer": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ص'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ص»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ص'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('صديق شجرة قمر ليل وردة بيت') == 1`\nالجواب:", "qhash": "d2b6549acc7bc488"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 3\n    return total", "tests": ["assert series(7) == 3136", "assert series(1) == 4", "assert series(1) == 4", "assert series(1) == 4", "assert series(13) == 33124", "assert series(1) == 4", "assert series(0) == 0"], "test_code": "assert series(7) == 3136\nassert series(1) == 4\nassert series(1) == 4\nassert series(1) == 4\nassert series(13) == 33124\nassert series(1) == 4\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 3\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 3\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(1, n):\n        total += 4 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 4 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(1, n):\n        total += 4 * i ** 3\n    return total\n```\nمثال: `series(7) == 3136`\nالجواب:", "qhash": "887ccd6c1c3ea3d1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'رنا': 10, 'حسن': 13, 'وليد': 2, 'علي': 21, 'عمر': 37}\nmarks['علي'] += 8\nmarks['هشام'] = 6\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 15])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'رنا': 10, 'حسن': 13, 'وليد': 2, 'علي': 21, 'عمر': 37}\nmarks['علي'] += 8\nmarks['هشام'] = 6\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 15])\n```\nالجواب:", "qhash": "dbfd500a60faa2eb", "answer": "6\nعمر\n97\n['علي', 'عمر']", "completion": " الناتج:\n```text\n6\nعمر\n97\n['علي', 'عمر']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['river', 'planet', 'window', 'camel', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['river', 'planet', 'window', 'camel', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "10e864ca0ef8283c", "answer": "['river', 'camel', 'planet', 'window', 'winter']\n['winter', 'window', 'planet']", "completion": " الناتج:\n```text\n['river', 'camel', 'planet', 'window', 'winter']\n['winter', 'window', 'planet']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'كتاب نهار'\nprint(w[0])\nprint(w[::-1])\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'كتاب نهار'\nprint(w[0])\nprint(w[::-1])\nprint(w.split())\n```\nالجواب:", "qhash": "31d7985b1d4d744b", "answer": "ك\nراهن باتك\n['كتاب', 'نهار']", "completion": " الناتج:\n```text\nك\nراهن باتك\n['كتاب', 'نهار']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n    return sorted(x * 5 for x in xs if 6 <= x <= 23)", "tests": ["assert in_range_scaled([23, 27, -3, 30, 28, 11, -2, 7, 7]) == [35, 35, 55, 115]", "assert in_range_scaled([17, -16, 3, 33, 42, 59, 14]) == [70, 85]", "assert in_range_scaled([45, -17, 46, 32, 10, -10]) == [50]", "assert in_range_scaled([-6, 1, 57, 7, 26, 24, 36]) == [35]", "assert in_range_scaled([-13, -22, 53, -27, 39, -22]) == []", "assert in_range_scaled([41]) == []", "assert in_range_scaled([-16, 16, -9, 38, 41, 17, -27, -28, -27, 43]) == [80, 85]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([23, 27, -3, 30, 28, 11, -2, 7, 7]) == [35, 35, 55, 115]\nassert in_range_scaled([17, -16, 3, 33, 42, 59, 14]) == [70, 85]\nassert in_range_scaled([45, -17, 46, 32, 10, -10]) == [50]\nassert in_range_scaled([-6, 1, 57, 7, 26, 24, 36]) == [35]\nassert in_range_scaled([-13, -22, 53, -27, 39, -22]) == []\nassert in_range_scaled([41]) == []\nassert in_range_scaled([-16, 16, -9, 38, 41, 17, -27, -28, -27, 43]) == [80, 85]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n    return sorted(x * 5 for x in xs if 6 <= x <= 23)", "completion": " ```python\ndef in_range_scaled(xs):\n    return sorted(x * 5 for x in xs if 6 <= x <= 23)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `in_range_scaled` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [6, 23].\nمثال: `in_range_scaled([23, 27, -3, 30, 28, 11, -2, 7, 7]) == [35, 35, 55, 115]`\nالجواب:", "qhash": "e038c35e68eff962"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_letter", "reference": "def count_letter(text):\n    return text.count('ك')", "tests": ["assert count_letter('قمر سوق لغة نور بحر') == 0", "assert count_letter('سلام طالب مدرسة') == 0", "assert count_letter('') == 0", "assert count_letter('ماء لغة') == 0", "assert count_letter('قلم') == 0", "assert count_letter('علم دفتر نهار دفتر سماء صديق') == 0", "assert count_letter('كتاب سوق بحر ليل حصان برمجة فجر مطر') == 1", "assert count_letter('') == 0"], "test_code": "assert count_letter('قمر سوق لغة نور بحر') == 0\nassert count_letter('سلام طالب مدرسة') == 0\nassert count_letter('') == 0\nassert count_letter('ماء لغة') == 0\nassert count_letter('قلم') == 0\nassert count_letter('علم دفتر نهار دفتر سماء صديق') == 0\nassert count_letter('كتاب سوق بحر ليل حصان برمجة فجر مطر') == 1\nassert count_letter('') == 0", "answer": "def count_letter(text):\n    return text.count('ك')", "completion": " ```python\ndef count_letter(text):\n    return text.count('ك')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ك» في النص.\nمثال: `count_letter('قمر سوق لغة نور بحر') == 0`\nالجواب:", "qhash": "3b6d6be30fb4cdba"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if 'ي' in w)", "tests": ["assert how_many('ميناء قلم فجر رمل') == 1", "assert how_many('نور') == 0", "assert how_many('ليل جبل مدينة جمل حديقة مدرسة نهار مدرسة') == 3", "assert how_many('سوق عمل صحراء معلم فجر برمجة دفتر') == 0", "assert how_many('') == 0", "assert how_many('برمجة مدرسة') == 0", "assert how_many('جبل بحر مطر طائرة') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('ميناء قلم فجر رمل') == 1\nassert how_many('نور') == 0\nassert how_many('ليل جبل مدينة جمل حديقة مدرسة نهار مدرسة') == 3\nassert how_many('سوق عمل صحراء معلم فجر برمجة دفتر') == 0\nassert how_many('') == 0\nassert how_many('برمجة مدرسة') == 0\nassert how_many('جبل بحر مطر طائرة') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if 'ي' in w)", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if 'ي' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ي» مرة واحدة على الأقل.\nمثال: `how_many('ميناء قلم فجر رمل') == 1`\nالجواب:", "qhash": "39efc80c68e09a25"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 29077\nc = 0\nwhile m > 18:\n    m = m // 6\n    c += 1\nprint(m, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 29077\nc = 0\nwhile m > 18:\n    m = m // 6\n    c += 1\nprint(m, c)\n```\nالجواب:", "qhash": "eea348b397b59b8e", "answer": "3 5", "completion": " الناتج:\n```text\n3 5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 83", "tests": ["assert fact_mod(7) == 60", "assert fact_mod(12) == 51", "assert fact_mod(10) == 40", "assert fact_mod(47) == 47", "assert fact_mod(17) == 67", "assert fact_mod(38) == 5", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 60\nassert fact_mod(12) == 51\nassert fact_mod(10) == 40\nassert fact_mod(47) == 47\nassert fact_mod(17) == 67\nassert fact_mod(38) == 5\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 83", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 83\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 83 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(7) == 60`\nالجواب:", "qhash": "9f23434d3fd409c3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 9\nfor i in range(10, 14, 3):\n    total -= i * 1\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 9\nfor i in range(10, 14, 3):\n    total -= i * 1\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "32643fe38c4810ce", "answer": "-14\n13", "completion": " الناتج:\n```text\n-14\n13\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'ماء'\nprint(w[-1])\nprint(len(w))\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'ماء'\nprint(w[-1])\nprint(len(w))\nprint(w.split())\n```\nالجواب:", "qhash": "b04bd865a2e9cd18", "answer": "ء\n3\n['ماء']", "completion": " الناتج:\n```text\nء\n3\n['ماء']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert invert_words('up we river vector vector') == 'vector/vector/river'", "assert invert_words('apple cloud winter falcon window') == 'window/falcon/winter/cloud/apple'", "assert invert_words('') == ''", "assert invert_words('at an stone data cloud coffee data') == 'coffee/cloud/stone'", "assert invert_words('banana summer') == 'summer/banana'", "assert invert_words('planet river we falcon') == 'falcon/river/planet'", "assert invert_words('music an in table go') == 'table/music'"], "test_code": "assert invert_words('up we river vector vector') == 'vector/vector/river'\nassert invert_words('apple cloud winter falcon window') == 'window/falcon/winter/cloud/apple'\nassert invert_words('') == ''\nassert invert_words('at an stone data cloud coffee data') == 'coffee/cloud/stone'\nassert invert_words('banana summer') == 'summer/banana'\nassert invert_words('planet river we falcon') == 'falcon/river/planet'\nassert invert_words('music an in table go') == 'table/music'", "answer": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `invert_words('up we river vector vector') == 'vector/vector/river'`\nالجواب:", "qhash": "b2be81a1f74551c2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 118:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([28, 20, 1, 18, 34, 47]) == [28, 48, 49, 67, 101, 0]", "assert acc_reset([32, 34, 11, 107, 27, -2, 23]) == [32, 66, 77, 0, 27, 25, 48]", "assert acc_reset([46, 96, 41, 80, 4, 117, 82, 72]) == [46, 0, 41, 0, 4, 0, 82, 0]", "assert acc_reset([18, 40, 98, 15]) == [18, 58, 0, 15]", "assert acc_reset([31, 31, 24, 77, 86, 59]) == [31, 62, 86, 0, 86, 0]", "assert acc_reset([50]) == [50]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([28, 20, 1, 18, 34, 47]) == [28, 48, 49, 67, 101, 0]\nassert acc_reset([32, 34, 11, 107, 27, -2, 23]) == [32, 66, 77, 0, 27, 25, 48]\nassert acc_reset([46, 96, 41, 80, 4, 117, 82, 72]) == [46, 0, 41, 0, 4, 0, 82, 0]\nassert acc_reset([18, 40, 98, 15]) == [18, 58, 0, 15]\nassert acc_reset([31, 31, 24, 77, 86, 59]) == [31, 62, 86, 0, 86, 0]\nassert acc_reset([50]) == [50]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 118:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 118:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 118 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([28, 20, 1, 18, 34, 47]) == [28, 48, 49, 67, 101, 0]`\nالجواب:", "qhash": "9a9ef4189d145797"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'rocket'\nprint(name.index('o') + len(name))\nprint(name[-3:])\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'rocket'\nprint(name.index('o') + len(name))\nprint(name[-3:])\nprint(name.capitalize())\n```\nالجواب:", "qhash": "3ae26b3fcf396c15", "answer": "7\nket\nRocket", "completion": " الناتج:\n```text\n7\nket\nRocket\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 51", "tests": ["assert sum_digit_pow(75239) == 26", "assert sum_digit_pow(470345) == 23", "assert sum_digit_pow(76374) == 27", "assert sum_digit_pow(654029) == 26", "assert sum_digit_pow(237953) == 29", "assert sum_digit_pow(359498) == 38", "assert sum_digit_pow(265633) == 25", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(75239) == 26\nassert sum_digit_pow(470345) == 23\nassert sum_digit_pow(76374) == 27\nassert sum_digit_pow(654029) == 26\nassert sum_digit_pow(237953) == 29\nassert sum_digit_pow(359498) == 38\nassert sum_digit_pow(265633) == 25\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 51", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 51\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 51.\nمثال: `sum_digit_pow(75239) == 26`\nالجواب:", "qhash": "e72972255d2ae469"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_sel", "reference": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert count_sel([11, 23, 7, 89, 60, 64, 68, 19]) == 1", "assert count_sel([-3, -25, -23, 1, 66]) == 1", "assert count_sel([54, -30, -34, 85, 1, 54, -23, 13, 23]) == 2", "assert count_sel([79, 57, 74, -17, 73, 70, -5]) == 1", "assert count_sel([21, 44, 29]) == 0", "assert count_sel([-19, 62, 70, 48, 11, -15, 79, 69, -5]) == 2", "assert count_sel([]) == 0"], "test_code": "assert count_sel([11, 23, 7, 89, 60, 64, 68, 19]) == 1\nassert count_sel([-3, -25, -23, 1, 66]) == 1\nassert count_sel([54, -30, -34, 85, 1, 54, -23, 13, 23]) == 2\nassert count_sel([79, 57, 74, -17, 73, 70, -5]) == 1\nassert count_sel([21, 44, 29]) == 0\nassert count_sel([-19, 62, 70, 48, 11, -15, 79, 69, -5]) == 2\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_sel([11, 23, 7, 89, 60, 64, 68, 19]) == 1`\nالجواب:", "qhash": "3043d84eccc23b66"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * 5 for x in xs if -12 <= x <= -2)", "tests": ["assert select_range([1, 0, -7, -20, -3, 4]) == [-35, -15]", "assert select_range([14, 34, 24]) == []", "assert select_range([5, 12, -11, -20, -25, 36, -27, 54, 7, -11]) == [-55, -55]", "assert select_range([19, 49, 42, 6, 33]) == []", "assert select_range([24, -12, -14, -1, -25, 23, 5]) == [-60]", "assert select_range([-10, -24, -14, 30, -3, -10, -20, -8]) == [-50, -50, -40, -15]", "assert select_range([16, -11, -29, 36, -1, 43, 33, -30, 55, 8]) == [-55]", "assert select_range([]) == []"], "test_code": "assert select_range([1, 0, -7, -20, -3, 4]) == [-35, -15]\nassert select_range([14, 34, 24]) == []\nassert select_range([5, 12, -11, -20, -25, 36, -27, 54, 7, -11]) == [-55, -55]\nassert select_range([19, 49, 42, 6, 33]) == []\nassert select_range([24, -12, -14, -1, -25, 23, 5]) == [-60]\nassert select_range([-10, -24, -14, 30, -3, -10, -20, -8]) == [-50, -50, -40, -15]\nassert select_range([16, -11, -29, 36, -1, 43, 33, -30, 55, 8]) == [-55]\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * 5 for x in xs if -12 <= x <= -2)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * 5 for x in xs if -12 <= x <= -2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [-12, -2].\nمثال: `select_range([1, 0, -7, -20, -3, 4]) == [-35, -15]`\nالجواب:", "qhash": "d0c0c65a7c5b338d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "caesar", "reference": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert caesar('rocket') == 'pmaicr'", "assert caesar('it') == 'gr'", "assert caesar('table banana to 2024') == 'ryzjc zylyly rm 2024'", "assert caesar('falcon summer orange river light OK') == 'dyjaml qskkcp mpylec pgtcp jgefr OK'", "assert caesar('falcon summer stone') == 'dyjaml qskkcp qrmlc'", "assert caesar('apple !') == 'ynnjc !'", "assert caesar('') == ''"], "test_code": "assert caesar('rocket') == 'pmaicr'\nassert caesar('it') == 'gr'\nassert caesar('table banana to 2024') == 'ryzjc zylyly rm 2024'\nassert caesar('falcon summer orange river light OK') == 'dyjaml qskkcp mpylec pgtcp jgefr OK'\nassert caesar('falcon summer stone') == 'dyjaml qskkcp qrmlc'\nassert caesar('apple !') == 'ynnjc !'\nassert caesar('') == ''", "answer": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `caesar` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('rocket') == 'pmaicr'`\nالجواب:", "qhash": "22e8c93714df0ca4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 23", "tests": ["assert prod_mod(3) == 3", "assert prod_mod(46) == 0", "assert prod_mod(3) == 3", "assert prod_mod(7) == 21", "assert prod_mod(11) == 1", "assert prod_mod(43) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(3) == 3\nassert prod_mod(46) == 0\nassert prod_mod(3) == 3\nassert prod_mod(7) == 21\nassert prod_mod(11) == 1\nassert prod_mod(43) == 0\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 23", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(3) == 3`\nالجواب:", "qhash": "352936f0aab9fec1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_join", "reference": "def rev_join(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert rev_join('banana go signal garden summer coffee') == 'coffee,summer,garden,signal,banana'", "assert rev_join('up table apple in garden it desert') == 'desert,garden,apple,table'", "assert rev_join('brain go of camel') == 'camel,brain'", "assert rev_join('camel data an apple in stone in') == 'stone,apple,data,camel'", "assert rev_join('pixel music to desert data garden we') == 'garden,data,desert,music,pixel'", "assert rev_join('winter planet camel camel orange garden river pixel') == 'pixel,river,garden,orange,camel,camel,planet,winter'", "assert rev_join('garden garden in') == 'garden,garden'"], "test_code": "assert rev_join('banana go signal garden summer coffee') == 'coffee,summer,garden,signal,banana'\nassert rev_join('up table apple in garden it desert') == 'desert,garden,apple,table'\nassert rev_join('brain go of camel') == 'camel,brain'\nassert rev_join('camel data an apple in stone in') == 'stone,apple,data,camel'\nassert rev_join('pixel music to desert data garden we') == 'garden,data,desert,music,pixel'\nassert rev_join('winter planet camel camel orange garden river pixel') == 'pixel,river,garden,orange,camel,camel,planet,winter'\nassert rev_join('garden garden in') == 'garden,garden'", "answer": "def rev_join(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef rev_join(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_join` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `rev_join('banana go signal garden summer coffee') == 'coffee,summer,garden,signal,banana'`\nالجواب:", "qhash": "0bdd527144e3ee80"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "tests": ["assert total_multiples(263) == 7155", "assert total_multiples(20) == 37", "assert total_multiples(139) == 1900", "assert total_multiples(34) == 114", "assert total_multiples(16) == 19", "assert total_multiples(195) == 3709", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(263) == 7155\nassert total_multiples(20) == 37\nassert total_multiples(139) == 1900\nassert total_multiples(34) == 114\nassert total_multiples(16) == 19\nassert total_multiples(195) == 3709\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 9 أو 10 دون باقٍ.\nمثال: `total_multiples(263) == 7155`\nالجواب:", "qhash": "28a1570eae58f1ae"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [-2, 14, -13, -20, 17, 0, -8]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-2, 14, -13, -20, 17, 0, -8]\nprint(sorted(nums, key=lambda x: (abs(x - 25), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "57741bcfcc319660", "answer": "[17, 14, 0, -2, -8, -13, -20]\n[17, 14, 0]", "completion": " الناتج:\n```text\n[17, 14, 0, -2, -8, -13, -20]\n[17, 14, 0]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_join", "reference": "def rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert rev_join('music rocket rocket banana python vector it') == 'vector/python/banana/rocket/rocket/music'", "assert rev_join('engine planet an signal light') == 'light/signal/planet/engine'", "assert rev_join('engine') == 'engine'", "assert rev_join('it camel garden brain orange falcon a') == 'falcon/orange/brain/garden/camel'", "assert rev_join('to river orange matrix apple banana data') == 'data/banana/apple/matrix/orange/river'", "assert rev_join('pixel we pixel') == 'pixel/pixel'", "assert rev_join('winter desert banana') == 'banana/desert/winter'"], "test_code": "assert rev_join('music rocket rocket banana python vector it') == 'vector/python/banana/rocket/rocket/music'\nassert rev_join('engine planet an signal light') == 'light/signal/planet/engine'\nassert rev_join('engine') == 'engine'\nassert rev_join('it camel garden brain orange falcon a') == 'falcon/orange/brain/garden/camel'\nassert rev_join('to river orange matrix apple banana data') == 'data/banana/apple/matrix/orange/river'\nassert rev_join('pixel we pixel') == 'pixel/pixel'\nassert rev_join('winter desert banana') == 'banana/desert/winter'", "answer": "def rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef rev_join(s):\n    return '/'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_join` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `rev_join('music rocket rocket banana python vector it') == 'vector/python/banana/rocket/rocket/music'`\nالجواب:", "qhash": "1ed2e4e5cf3b3c10"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([17, 38, 10, 19, 30, 7]) == [17, 55, 65, 84, 0, 7]", "assert capped_cumsum([67, 31, 35, 19, 59, -7, 1]) == [67, 0, 35, 54, 0, -7, -6]", "assert capped_cumsum([13, 70]) == [13, 83]", "assert capped_cumsum([19, 48, -8, 4, 33, 37, 62, 76]) == [19, 67, 59, 63, 0, 37, 0, 76]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([17, 38, 10, 19, 30, 7]) == [17, 55, 65, 84, 0, 7]\nassert capped_cumsum([67, 31, 35, 19, 59, -7, 1]) == [67, 0, 35, 54, 0, -7, -6]\nassert capped_cumsum([13, 70]) == [13, 83]\nassert capped_cumsum([19, 48, -8, 4, 33, 37, 62, 76]) == [19, 67, 59, 63, 0, 37, 0, 76]\nassert capped_cumsum([]) == []\nassert capped_cumsum([]) == []\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 86 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([17, 38, 10, 19, 30, 7]) == [17, 55, 65, 84, 0, 7]`\nالجواب:", "qhash": "ba72582b5096c69b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "tests": ["assert sum_multiples(61) == 930", "assert sum_multiples(197) == 9702", "assert sum_multiples(248) == 15252", "assert sum_multiples(294) == 21462", "assert sum_multiples(86) == 1806", "assert sum_multiples(71) == 1260", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(61) == 930\nassert sum_multiples(197) == 9702\nassert sum_multiples(248) == 15252\nassert sum_multiples(294) == 21462\nassert sum_multiples(86) == 1806\nassert sum_multiples(71) == 1260\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 6 دون باقٍ.\nمثال: `sum_multiples(61) == 930`\nالجواب:", "qhash": "9ee7dec02f2355b0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 80:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([29, 33, 1, 35, 10, 7]) == [29, 62, 63, 0, 10, 17]", "assert reset_sum([49, 71, 65, 7, 29, -6, 29, 30]) == [49, 0, 65, 72, 0, -6, 23, 53]", "assert reset_sum([]) == []", "assert reset_sum([-9, 34, 68, 10, 71, 12, 48, 57]) == [-9, 25, 0, 10, 0, 12, 60, 0]", "assert reset_sum([18, 61, 22, 20]) == [18, 79, 0, 20]", "assert reset_sum([24, 9, -9, 39, 64, 51, 55, 23, -5, -1]) == [24, 33, 24, 63, 0, 51, 0, 23, 18, 17]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([29, 33, 1, 35, 10, 7]) == [29, 62, 63, 0, 10, 17]\nassert reset_sum([49, 71, 65, 7, 29, -6, 29, 30]) == [49, 0, 65, 72, 0, -6, 23, 53]\nassert reset_sum([]) == []\nassert reset_sum([-9, 34, 68, 10, 71, 12, 48, 57]) == [-9, 25, 0, 10, 0, 12, 60, 0]\nassert reset_sum([18, 61, 22, 20]) == [18, 79, 0, 20]\nassert reset_sum([24, 9, -9, 39, 64, 51, 55, 23, -5, -1]) == [24, 33, 24, 63, 0, 51, 0, 23, 18, 17]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 80:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 80:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 80 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([29, 33, 1, 35, 10, 7]) == [29, 62, 63, 0, 10, 17]`\nالجواب:", "qhash": "a296690c53e37226"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "filter_range", "reference": "def filter_range(xs):\n    return sorted(x * -2 for x in xs if -1 <= x <= 4)", "tests": ["assert filter_range([9, 2, 8, -5, 14]) == [-4]", "assert filter_range([-24, 19]) == []", "assert filter_range([17]) == []", "assert filter_range([43, 15, -24, -25, 9, 54, 48, -2]) == []", "assert filter_range([29]) == []", "assert filter_range([35, 53, -26, 25]) == []", "assert filter_range([6, 25, -2]) == []", "assert filter_range([]) == []"], "test_code": "assert filter_range([9, 2, 8, -5, 14]) == [-4]\nassert filter_range([-24, 19]) == []\nassert filter_range([17]) == []\nassert filter_range([43, 15, -24, -25, 9, 54, 48, -2]) == []\nassert filter_range([29]) == []\nassert filter_range([35, 53, -26, 25]) == []\nassert filter_range([6, 25, -2]) == []\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n    return sorted(x * -2 for x in xs if -1 <= x <= 4)", "completion": " ```python\ndef filter_range(xs):\n    return sorted(x * -2 for x in xs if -1 <= x <= 4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `filter_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -2 لكل عنصر x في المدى المغلق [-1, 4].\nمثال: `filter_range([9, 2, 8, -5, 14]) == [-4]`\nالجواب:", "qhash": "f1b29ef9ad3b46f6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert mirror_words('in vector camel river is falcon') == 'falcon is river camel vector in'", "assert mirror_words('we we python data') == 'data python we we'", "assert mirror_words('river engine apple cloud') == 'cloud apple engine river'", "assert mirror_words('river desert orange apple pixel summer') == 'summer pixel apple orange desert river'", "assert mirror_words('summer engine on by signal') == 'signal by on engine summer'", "assert mirror_words('matrix table a light window') == 'window light table matrix'", "assert mirror_words('is signal') == 'signal is'"], "test_code": "assert mirror_words('in vector camel river is falcon') == 'falcon is river camel vector in'\nassert mirror_words('we we python data') == 'data python we we'\nassert mirror_words('river engine apple cloud') == 'cloud apple engine river'\nassert mirror_words('river desert orange apple pixel summer') == 'summer pixel apple orange desert river'\nassert mirror_words('summer engine on by signal') == 'signal by on engine summer'\nassert mirror_words('matrix table a light window') == 'window light table matrix'\nassert mirror_words('is signal') == 'signal is'", "answer": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل ' '.\nمثال: `mirror_words('in vector camel river is falcon') == 'falcon is river camel vector in'`\nالجواب:", "qhash": "5ff7b14615f19106"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return 6 * x ** 2 + (-6) * x + (-7)", "tests": ["assert quad(9) == 425", "assert quad(-9) == 533", "assert quad(17) == 1625", "assert quad(1) == -7", "assert quad(12) == 785", "assert quad(-20) == 2513", "assert quad(-7) == 329", "assert quad(0) == -7"], "test_code": "assert quad(9) == 425\nassert quad(-9) == 533\nassert quad(17) == 1625\nassert quad(1) == -7\nassert quad(12) == 785\nassert quad(-20) == 2513\nassert quad(-7) == 329\nassert quad(0) == -7", "answer": "def quad(x):\n    return 6 * x ** 2 + (-6) * x + (-7)", "completion": " ```python\ndef quad(x):\n    return 6 * x ** 2 + (-6) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 6x² - 6x - 7.\nمثال: `quad(9) == 425`\nالجواب:", "qhash": "1a32f85d2b6bac2c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "turn_list", "reference": "def turn_list(arr):\n    if not arr:\n        return []\n    k = 4 % len(arr)\n    return arr[k:] + arr[:k]", "tests": ["assert turn_list([3, 8, 19, 28]) == [3, 8, 19, 28]", "assert turn_list([21, 5, 31, -7, -9, 8, 8, 44, 35, 9, 27, 19]) == [-9, 8, 8, 44, 35, 9, 27, 19, 21, 5, 31, -7]", "assert turn_list([37, 39, 10, 43, 36, 27, 38, 37, 27]) == [36, 27, 38, 37, 27, 37, 39, 10, 43]", "assert turn_list([42, 6, 32, 4, 28, 10, 41, 39]) == [28, 10, 41, 39, 42, 6, 32, 4]", "assert turn_list([25, -5, -5, 43, 37, 28, 18, 0, 5, -2, 48, 21]) == [37, 28, 18, 0, 5, -2, 48, 21, 25, -5, -5, 43]", "assert turn_list([29]) == [29]", "assert turn_list([]) == []"], "test_code": "assert turn_list([3, 8, 19, 28]) == [3, 8, 19, 28]\nassert turn_list([21, 5, 31, -7, -9, 8, 8, 44, 35, 9, 27, 19]) == [-9, 8, 8, 44, 35, 9, 27, 19, 21, 5, 31, -7]\nassert turn_list([37, 39, 10, 43, 36, 27, 38, 37, 27]) == [36, 27, 38, 37, 27, 37, 39, 10, 43]\nassert turn_list([42, 6, 32, 4, 28, 10, 41, 39]) == [28, 10, 41, 39, 42, 6, 32, 4]\nassert turn_list([25, -5, -5, 43, 37, 28, 18, 0, 5, -2, 48, 21]) == [37, 28, 18, 0, 5, -2, 48, 21, 25, -5, -5, 43]\nassert turn_list([29]) == [29]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n    if not arr:\n        return []\n    k = 4 % len(arr)\n    return arr[k:] + arr[:k]", "completion": " ```python\ndef turn_list(arr):\n    if not arr:\n        return []\n    k = 4 % len(arr)\n    return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef turn_list(arr):\n    if not arr:\n        return []\n    k = 4 % len(arr)\n    return ____\n```\nمثال: `turn_list([3, 8, 19, 28]) == [3, 8, 19, 28]`\nالجواب:", "qhash": "4ef50c356ef14b03"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 5 for d in str(n)) % 8", "tests": ["assert digit_power(54476) == 4", "assert digit_power(375237) == 1", "assert digit_power(482667) == 7", "assert digit_power(156931) == 3", "assert digit_power(236584) == 0", "assert digit_power(388985) == 1", "assert digit_power(40241) == 1", "assert digit_power(0) == 0"], "test_code": "assert digit_power(54476) == 4\nassert digit_power(375237) == 1\nassert digit_power(482667) == 7\nassert digit_power(156931) == 3\nassert digit_power(236584) == 0\nassert digit_power(388985) == 1\nassert digit_power(40241) == 1\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 5 for d in str(n)) % 8", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 5 for d in str(n)) % 8\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^5 لكل أرقام n) mod 8.\nمثال: `digit_power(54476) == 4`\nالجواب:", "qhash": "ffe173d32010dc33"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 8\nfor j in range(-1, 16, 1):\n    result -= j * 7\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 8\nfor j in range(-1, 16, 1):\n    result -= j * 7\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "66329cf03ac33c45", "answer": "-825\n15", "completion": " الناتج:\n```text\n-825\n15\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate", "reference": "def rotate(arr):\n    if not arr:\n        return []\n    k = 10 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate([1, 22, 32, 21, 8, 14]) == [32, 21, 8, 14, 1, 22]", "assert rotate([49, 14, 4, 5, 5, 16, 16, 46, -1, 39]) == [49, 14, 4, 5, 5, 16, 16, 46, -1, 39]", "assert rotate([34, 38, 40, 6, 2, 35, 25, -4, 22, 13, -1]) == [38, 40, 6, 2, 35, 25, -4, 22, 13, -1, 34]", "assert rotate([-4, -3]) == [-4, -3]", "assert rotate([25]) == [25]", "assert rotate([14, 29, 32, 20, 42, 27]) == [32, 20, 42, 27, 14, 29]", "assert rotate([]) == []"], "test_code": "assert rotate([1, 22, 32, 21, 8, 14]) == [32, 21, 8, 14, 1, 22]\nassert rotate([49, 14, 4, 5, 5, 16, 16, 46, -1, 39]) == [49, 14, 4, 5, 5, 16, 16, 46, -1, 39]\nassert rotate([34, 38, 40, 6, 2, 35, 25, -4, 22, 13, -1]) == [38, 40, 6, 2, 35, 25, -4, 22, 13, -1, 34]\nassert rotate([-4, -3]) == [-4, -3]\nassert rotate([25]) == [25]\nassert rotate([14, 29, 32, 20, 42, 27]) == [32, 20, 42, 27, 14, 29]\nassert rotate([]) == []", "answer": "def rotate(arr):\n    if not arr:\n        return []\n    k = 10 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 10 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 10 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 10 % len(arr)\n    return ____\n```\nمثال: `rotate([1, 22, 32, 21, 8, 14]) == [32, 21, 8, 14, 1, 22]`\nالجواب:", "qhash": "ba01d1bde318e8ed"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * -4 for x in xs if -10 <= x <= -5)", "tests": ["assert pick_between([-8, 4, -10, -20, -18, -2]) == [32, 40]", "assert pick_between([47, -20, 39, 17, 7, 31, 39, -6, -20, -26]) == [24]", "assert pick_between([-25, -12, 22]) == []", "assert pick_between([6, 35, 17, -25, 2, -6, 7]) == [24]", "assert pick_between([45, -24, -14]) == []", "assert pick_between([46, 5, 39, 8, 24, 38]) == []", "assert pick_between([-27, -25]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-8, 4, -10, -20, -18, -2]) == [32, 40]\nassert pick_between([47, -20, 39, 17, 7, 31, 39, -6, -20, -26]) == [24]\nassert pick_between([-25, -12, 22]) == []\nassert pick_between([6, 35, 17, -25, 2, -6, 7]) == [24]\nassert pick_between([45, -24, -14]) == []\nassert pick_between([46, 5, 39, 8, 24, 38]) == []\nassert pick_between([-27, -25]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * -4 for x in xs if -10 <= x <= -5)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * -4 for x in xs if -10 <= x <= -5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [-10, -5].\nمثال: `pick_between([-8, 4, -10, -20, -18, -2]) == [32, 40]`\nالجواب:", "qhash": "2033b7be5ffda451"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "turn_list", "reference": "def turn_list(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]", "tests": ["assert turn_list([19, 0, 7, 41, 50, 40, 49, 30]) == [0, 7, 41, 50, 40, 49, 30, 19]", "assert turn_list([0, -7, 38, 6, 10, 47, 41]) == [38, 6, 10, 47, 41, 0, -7]", "assert turn_list([43, 23, 9, -5, 15, 38, 8, 13]) == [23, 9, -5, 15, 38, 8, 13, 43]", "assert turn_list([5, 45]) == [45, 5]", "assert turn_list([16, -8, 26, 15, 42, 25, 9, 47]) == [-8, 26, 15, 42, 25, 9, 47, 16]", "assert turn_list([8, 5, 48, 15, 8, 44, 29, 14, 42, -3]) == [-3, 8, 5, 48, 15, 8, 44, 29, 14, 42]", "assert turn_list([]) == []"], "test_code": "assert turn_list([19, 0, 7, 41, 50, 40, 49, 30]) == [0, 7, 41, 50, 40, 49, 30, 19]\nassert turn_list([0, -7, 38, 6, 10, 47, 41]) == [38, 6, 10, 47, 41, 0, -7]\nassert turn_list([43, 23, 9, -5, 15, 38, 8, 13]) == [23, 9, -5, 15, 38, 8, 13, 43]\nassert turn_list([5, 45]) == [45, 5]\nassert turn_list([16, -8, 26, 15, 42, 25, 9, 47]) == [-8, 26, 15, 42, 25, 9, 47, 16]\nassert turn_list([8, 5, 48, 15, 8, 44, 29, 14, 42, -3]) == [-3, 8, 5, 48, 15, 8, 44, 29, 14, 42]\nassert turn_list([]) == []", "answer": "def turn_list(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]", "completion": " ```python\ndef turn_list(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef turn_list(xs):\n    if not xs:\n        return []\n    k = 9 % len(xs)\n    return ____\n```\nمثال: `turn_list([19, 0, 7, 41, 50, 40, 49, 30]) == [0, 7, 41, 50, 40, 49, 30, 19]`\nالجواب:", "qhash": "abe023deef6cae9a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "caesar", "reference": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert caesar('light coffee') == 'romnz iullkk'", "assert caesar('matrix python data Hello') == 'sgzxod veznut jgzg Hkrru'", "assert caesar('camel data banana A1') == 'igskr jgzg hgtgtg A1'", "assert caesar('we cloud matrix data') == 'ck iruaj sgzxod jgzg'", "assert caesar('in') == 'ot'", "assert caesar('brain') == 'hxgot'", "assert caesar('') == ''"], "test_code": "assert caesar('light coffee') == 'romnz iullkk'\nassert caesar('matrix python data Hello') == 'sgzxod veznut jgzg Hkrru'\nassert caesar('camel data banana A1') == 'igskr jgzg hgtgtg A1'\nassert caesar('we cloud matrix data') == 'ck iruaj sgzxod jgzg'\nassert caesar('in') == 'ot'\nassert caesar('brain') == 'hxgot'\nassert caesar('') == ''", "answer": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `caesar` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 6 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('light coffee') == 'romnz iullkk'`\nالجواب:", "qhash": "7030468e8c1af71b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 29:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([2, 12, 2, 1, 17, 5, 7, 11, 16, 6]) == [2, 14, 16, 17, 0, 5, 12, 23, 0, 6]", "assert cumulative([-7, -4]) == [-7, -11]", "assert cumulative([21, 8]) == [21, 29]", "assert cumulative([1, -6, 11, -5, -1, -5, 1]) == [1, -5, 6, 1, 0, -5, -4]", "assert cumulative([26, -7, 16]) == [26, 19, 0]", "assert cumulative([16]) == [16]", "assert cumulative([]) == []"], "test_code": "assert cumulative([2, 12, 2, 1, 17, 5, 7, 11, 16, 6]) == [2, 14, 16, 17, 0, 5, 12, 23, 0, 6]\nassert cumulative([-7, -4]) == [-7, -11]\nassert cumulative([21, 8]) == [21, 29]\nassert cumulative([1, -6, 11, -5, -1, -5, 1]) == [1, -5, 6, 1, 0, -5, -4]\nassert cumulative([26, -7, 16]) == [26, 19, 0]\nassert cumulative([16]) == [16]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 29:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 29:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 29 (القيمة المسجلة حينها 0).\nمثال: `cumulative([2, 12, 2, 1, 17, 5, 7, 11, 16, 6]) == [2, 14, 16, 17, 0, 5, 12, 23, 0, 6]`\nالجواب:", "qhash": "b7e2968522d63cf6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [28, 11, 31, -2, 12, 10, -8, 5]\nprint(items[3:7])\nprint(items[::2])\nprint(max(items[3:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [28, 11, 31, -2, 12, 10, -8, 5]\nprint(items[3:7])\nprint(items[::2])\nprint(max(items[3:7]))\n```\nالجواب:", "qhash": "c7f4d75e4cd68011", "answer": "[-2, 12, 10, -8]\n[28, 31, 12, -8]\n12", "completion": " الناتج:\n```text\n[-2, 12, 10, -8]\n[28, 31, 12, -8]\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * -1 for x in xs if -12 <= x <= 13)", "tests": ["assert select_range([-20, -5, -18, -17, 0, -19, -8, -10, 17]) == [0, 5, 8, 10]", "assert select_range([-27, 60, 48, -25, -11, -4, 40, -21]) == [4, 11]", "assert select_range([33, 31, 45, 38, 1, 39]) == [-1]", "assert select_range([57, 48, 44, 32, 4, -2, 29]) == [-4, 2]", "assert select_range([-26, -26, 18, -13, -9, -24, 13, 17, -9]) == [-13, 9, 9]", "assert select_range([6, 48, 27, -2, -21, -8, 50, 31, -6, 32]) == [-6, 2, 6, 8]", "assert select_range([27, 36, -9, 31, -27, 52, -21]) == [9]", "assert select_range([]) == []"], "test_code": "assert select_range([-20, -5, -18, -17, 0, -19, -8, -10, 17]) == [0, 5, 8, 10]\nassert select_range([-27, 60, 48, -25, -11, -4, 40, -21]) == [4, 11]\nassert select_range([33, 31, 45, 38, 1, 39]) == [-1]\nassert select_range([57, 48, 44, 32, 4, -2, 29]) == [-4, 2]\nassert select_range([-26, -26, 18, -13, -9, -24, 13, 17, -9]) == [-13, 9, 9]\nassert select_range([6, 48, 27, -2, -21, -8, 50, 31, -6, 32]) == [-6, 2, 6, 8]\nassert select_range([27, 36, -9, 31, -27, 52, -21]) == [9]\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * -1 for x in xs if -12 <= x <= 13)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * -1 for x in xs if -12 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -1 لكل عنصر x في المدى المغلق [-12, 13].\nمثال: `select_range([-20, -5, -18, -17, 0, -19, -8, -10, 17]) == [0, 5, 8, 10]`\nالجواب:", "qhash": "d9a76620eb131510"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "data = [2, 28, 34, 39, 1, 21]\nprint(data[2:5])\nprint(data[::2])\nprint(max(data[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndata = [2, 28, 34, 39, 1, 21]\nprint(data[2:5])\nprint(data[::2])\nprint(max(data[2:5]))\n```\nالجواب:", "qhash": "3fcc2d3913760991", "answer": "[34, 39, 1]\n[2, 34, 1]\n39", "completion": " الناتج:\n```text\n[34, 39, 1]\n[2, 34, 1]\n39\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 97", "tests": ["assert step_product(11) == 39", "assert step_product(30) == 23", "assert step_product(56) == 62", "assert step_product(42) == 88", "assert step_product(53) == 1", "assert step_product(40) == 61", "assert step_product(0) == 1"], "test_code": "assert step_product(11) == 39\nassert step_product(30) == 23\nassert step_product(56) == 62\nassert step_product(42) == 88\nassert step_product(53) == 1\nassert step_product(40) == 61\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 97", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 97\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 97 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(11) == 39`\nالجواب:", "qhash": "5d7773de14341ad2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(30) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16', '17', 'Tic', '19', '20', 'Tic', 'Tac', '23', 'Tic', '25', '26', 'Tic', '28', '29', 'Tic']", "assert label_numbers(16) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16']", "assert label_numbers(16) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16']", "assert label_numbers(15) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic']", "assert label_numbers(19) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16', '17', 'Tic', '19']"], "test_code": "assert label_numbers(30) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16', '17', 'Tic', '19', '20', 'Tic', 'Tac', '23', 'Tic', '25', '26', 'Tic', '28', '29', 'Tic']\nassert label_numbers(16) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16']\nassert label_numbers(16) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16']\nassert label_numbers(15) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic']\nassert label_numbers(19) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16', '17', 'Tic', '19']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Tic'، مضاعفات 11 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(30) == ['1', '2', 'Tic', '4', '5', 'Tic', '7', '8', 'Tic', '10', 'Tac', 'Tic', '13', '14', 'Tic', '16', '17', 'Tic', '19', '20', 'Tic', 'Tac', '23', 'Tic', '25', '26', 'Tic', '28', '29', 'Tic']`\nالجواب:", "qhash": "61397704d77381df"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(xs):\n    if not xs:\n        return []\n    k = 20 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert shift_list([45, 41, 31, 38, 16, 7, 7]) == [41, 31, 38, 16, 7, 7, 45]", "assert shift_list([44, 21, 32, 8, 0]) == [44, 21, 32, 8, 0]", "assert shift_list([49, 24, 44, 13, 12, -4, 0, 15, 28]) == [15, 28, 49, 24, 44, 13, 12, -4, 0]", "assert shift_list([38, 17, 5, 11, 32, 14, 49, -2, 38, 46]) == [38, 17, 5, 11, 32, 14, 49, -2, 38, 46]", "assert shift_list([-5, -2]) == [-5, -2]", "assert shift_list([50, 3, 12, 32, 29, 2, 21, 3, 30, 32]) == [50, 3, 12, 32, 29, 2, 21, 3, 30, 32]", "assert shift_list([]) == []"], "test_code": "assert shift_list([45, 41, 31, 38, 16, 7, 7]) == [41, 31, 38, 16, 7, 7, 45]\nassert shift_list([44, 21, 32, 8, 0]) == [44, 21, 32, 8, 0]\nassert shift_list([49, 24, 44, 13, 12, -4, 0, 15, 28]) == [15, 28, 49, 24, 44, 13, 12, -4, 0]\nassert shift_list([38, 17, 5, 11, 32, 14, 49, -2, 38, 46]) == [38, 17, 5, 11, 32, 14, 49, -2, 38, 46]\nassert shift_list([-5, -2]) == [-5, -2]\nassert shift_list([50, 3, 12, 32, 29, 2, 21, 3, 30, 32]) == [50, 3, 12, 32, 29, 2, 21, 3, 30, 32]\nassert shift_list([]) == []", "answer": "def shift_list(xs):\n    if not xs:\n        return []\n    k = 20 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef shift_list(xs):\n    if not xs:\n        return []\n    k = 20 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(xs):\n    if not xs:\n        return []\n    k = 20 % len(xs)\n    return ____\n```\nمثال: `shift_list([45, 41, 31, 38, 16, 7, 7]) == [41, 31, 38, 16, 7, 7, 45]`\nالجواب:", "qhash": "efe2b66bd15cbeec"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'عمر': 5, 'سلمى': 13, 'باسل': 42, 'فيصل': 24, 'نور': 44}\nd['باسل'] += 7\nd['هشام'] = 15\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 27])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'عمر': 5, 'سلمى': 13, 'باسل': 42, 'فيصل': 24, 'نور': 44}\nd['باسل'] += 7\nd['هشام'] = 15\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 27])\n```\nالجواب:", "qhash": "62945186d3e6350e", "answer": "6\nباسل\n150\n['باسل', 'نور']", "completion": " الناتج:\n```text\n6\nباسل\n150\n['باسل', 'نور']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "words_reversed", "reference": "def words_reversed(s):\n    return ','.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert words_reversed('in rocket music stone pixel music garden') == 'garden,music,pixel,stone,music,rocket,in'", "assert words_reversed('orange it by to stone at summer an') == 'an,summer,at,stone,to,by,it,orange'", "assert words_reversed('go falcon window on vector at banana') == 'banana,at,vector,on,window,falcon,go'", "assert words_reversed('code') == 'code'", "assert words_reversed('stone up vector engine coffee on engine we') == 'we,engine,on,coffee,engine,vector,up,stone'", "assert words_reversed('camel garden') == 'garden,camel'", "assert words_reversed('') == ''"], "test_code": "assert words_reversed('in rocket music stone pixel music garden') == 'garden,music,pixel,stone,music,rocket,in'\nassert words_reversed('orange it by to stone at summer an') == 'an,summer,at,stone,to,by,it,orange'\nassert words_reversed('go falcon window on vector at banana') == 'banana,at,vector,on,window,falcon,go'\nassert words_reversed('code') == 'code'\nassert words_reversed('stone up vector engine coffee on engine we') == 'we,engine,on,coffee,engine,vector,up,stone'\nassert words_reversed('camel garden') == 'garden,camel'\nassert words_reversed('') == ''", "answer": "def words_reversed(s):\n    return ','.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef words_reversed(s):\n    return ','.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `words_reversed` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `words_reversed('in rocket music stone pixel music garden') == 'garden,music,pixel,stone,music,rocket,in'`\nالجواب:", "qhash": "289eab533ada2e4e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [35, 34, 11, -6, 20, 40]\nprint(items[2:4])\nprint(items[::-1])\nprint(max(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [35, 34, 11, -6, 20, 40]\nprint(items[2:4])\nprint(items[::-1])\nprint(max(items[2:4]))\n```\nالجواب:", "qhash": "206c973476d3c6ab", "answer": "[11, -6]\n[40, 20, -6, 11, 34, 35]\n11", "completion": " الناتج:\n```text\n[11, -6]\n[40, 20, -6, 11, 34, 35]\n11\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "how_many_div", "reference": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 8 != 0:\n            count += 1\n    return count", "tests": ["assert how_many_div([30, 32, 49, 70, 15, 7]) == 3", "assert how_many_div([-3, -15, 69, 8, 68, 36, 67]) == 0", "assert how_many_div([41, 73, 0, 34, 82, 59, 75, 29, 36, 35, 29]) == 1", "assert how_many_div([27, 59, 52, -21, -21, 29, 22, 78, 45, 74]) == 2", "assert how_many_div([27, 49, 47, 81, 86, 54, -8, 26, 63, 18, 75, -20]) == 2", "assert how_many_div([14, -21, 81, 52, -5, 72, -29, 6, 2, -33, -4]) == 2", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([30, 32, 49, 70, 15, 7]) == 3\nassert how_many_div([-3, -15, 69, 8, 68, 36, 67]) == 0\nassert how_many_div([41, 73, 0, 34, 82, 59, 75, 29, 36, 35, 29]) == 1\nassert how_many_div([27, 59, 52, -21, -21, 29, 22, 78, 45, 74]) == 2\nassert how_many_div([27, 49, 47, 81, 86, 54, -8, 26, 63, 18, 75, -20]) == 2\nassert how_many_div([14, -21, 81, 52, -5, 72, -29, 6, 2, -33, -4]) == 2\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 8 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 8 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 8. اكتب الحل كاملًا.\n```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `how_many_div([30, 32, 49, 70, 15, 7]) == 3`\nالجواب:", "qhash": "1c69b53cca3088b8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'منى': 48, 'خالد': 15, 'يوسف': 9, 'وليد': 32, 'نور': 35}\npoints['منى'] += 8\npoints['علي'] = 55\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 15])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'منى': 48, 'خالد': 15, 'يوسف': 9, 'وليد': 32, 'نور': 35}\npoints['منى'] += 8\npoints['علي'] = 55\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 15])\n```\nالجواب:", "qhash": "d7e13f59947ef8f3", "answer": "6\nمنى\n202\n['منى', 'وليد', 'نور', 'علي']", "completion": " الناتج:\n```text\n6\nمنى\n202\n['منى', 'وليد', 'نور', 'علي']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'emns'}", "tests": ["assert count_chars('rocket desert coffee') == {'e': 5, 'm': 0, 'n': 0, 's': 1}", "assert count_chars('light it river coffee table light') == {'e': 4, 'm': 0, 'n': 0, 's': 0}", "assert count_chars('desert rocket') == {'e': 3, 'm': 0, 'n': 0, 's': 1}", "assert count_chars('orange brain') == {'e': 1, 'm': 0, 'n': 2, 's': 0}", "assert count_chars('window python') == {'e': 0, 'm': 0, 'n': 2, 's': 0}", "assert count_chars('code') == {'e': 1, 'm': 0, 'n': 0, 's': 0}", "assert count_chars('') == {'e': 0, 'm': 0, 'n': 0, 's': 0}"], "test_code": "assert count_chars('rocket desert coffee') == {'e': 5, 'm': 0, 'n': 0, 's': 1}\nassert count_chars('light it river coffee table light') == {'e': 4, 'm': 0, 'n': 0, 's': 0}\nassert count_chars('desert rocket') == {'e': 3, 'm': 0, 'n': 0, 's': 1}\nassert count_chars('orange brain') == {'e': 1, 'm': 0, 'n': 2, 's': 0}\nassert count_chars('window python') == {'e': 0, 'm': 0, 'n': 2, 's': 0}\nassert count_chars('code') == {'e': 1, 'm': 0, 'n': 0, 's': 0}\nassert count_chars('') == {'e': 0, 'm': 0, 'n': 0, 's': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'emns'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'emns'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'm'، 'n'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('rocket desert coffee') == {'e': 5, 'm': 0, 'n': 0, 's': 1}`\nالجواب:", "qhash": "e60e0436cfa30f0d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 4 for x in xs if 4 <= x <= 33)", "tests": ["assert between_times([-6, 11, -3, 34, 38, -4, 19]) == [44, 76]", "assert between_times([25, 1, 48, 32, 14]) == [56, 100, 128]", "assert between_times([-14, 57, 6, 41]) == [24]", "assert between_times([-15, 15, 14, 4, 2, -18, 38, 0]) == [16, 56, 60]", "assert between_times([-1, 8, -16, -6, -8, 24, 28]) == [32, 96, 112]", "assert between_times([39, -20, -24, -19, -4]) == []", "assert between_times([9, -27, 54, 43, -19, -28, 44, 33]) == [36, 132]", "assert between_times([]) == []"], "test_code": "assert between_times([-6, 11, -3, 34, 38, -4, 19]) == [44, 76]\nassert between_times([25, 1, 48, 32, 14]) == [56, 100, 128]\nassert between_times([-14, 57, 6, 41]) == [24]\nassert between_times([-15, 15, 14, 4, 2, -18, 38, 0]) == [16, 56, 60]\nassert between_times([-1, 8, -16, -6, -8, 24, 28]) == [32, 96, 112]\nassert between_times([39, -20, -24, -19, -4]) == []\nassert between_times([9, -27, 54, 43, -19, -28, 44, 33]) == [36, 132]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 4 for x in xs if 4 <= x <= 33)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 4 for x in xs if 4 <= x <= 33)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 4 لكل عنصر x في المدى المغلق [4, 33].\nمثال: `between_times([-6, 11, -3, 34, 38, -4, 19]) == [44, 76]`\nالجواب:", "qhash": "6d77660645e1992c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "pow_total", "reference": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total", "tests": ["assert pow_total(4) == 210", "assert pow_total(3) == 98", "assert pow_total(13) == 5733", "assert pow_total(5) == 385", "assert pow_total(11) == 3542", "assert pow_total(1) == 7", "assert pow_total(0) == 0"], "test_code": "assert pow_total(4) == 210\nassert pow_total(3) == 98\nassert pow_total(13) == 5733\nassert pow_total(5) == 385\nassert pow_total(11) == 3542\nassert pow_total(1) == 7\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total", "completion": " ```python\ndef pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total\n```\n", "buggy": "def pow_total(n):\n    total = 0\n    for i in range(1, n):\n        total += 7 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef pow_total(n):\n    total = 0\n    for i in range(1, n):\n        total += 7 * i ** 2\n    return total\n```\nمثال: `pow_total(4) == 210`\nالجواب:", "qhash": "cb774c48e69103ce"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 54:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([18, 32, 5, 15, 29, 15, 14]) == [18, 50, 0, 15, 44, 0, 14]", "assert reset_sum([1, 12, 33]) == [1, 13, 46]", "assert reset_sum([36, 1, 0]) == [36, 37, 37]", "assert reset_sum([3]) == [3]", "assert reset_sum([4, 1, 7, 21, 28]) == [4, 5, 12, 33, 0]", "assert reset_sum([25, 18, 22, 21, 39]) == [25, 43, 0, 21, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([18, 32, 5, 15, 29, 15, 14]) == [18, 50, 0, 15, 44, 0, 14]\nassert reset_sum([1, 12, 33]) == [1, 13, 46]\nassert reset_sum([36, 1, 0]) == [36, 37, 37]\nassert reset_sum([3]) == [3]\nassert reset_sum([4, 1, 7, 21, 28]) == [4, 5, 12, 33, 0]\nassert reset_sum([25, 18, 22, 21, 39]) == [25, 43, 0, 21, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 54:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 54:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 54 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([18, 32, 5, 15, 29, 15, 14]) == [18, 50, 0, 15, 44, 0, 14]`\nالجواب:", "qhash": "5b7ba695193b9dd8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x ** 2 - 3 for x in range(3, 11) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x ** 2 - 3 for x in range(3, 11) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "44bb500924a1c630", "answer": "[22, 78]\n2 100", "completion": " الناتج:\n```text\n[22, 78]\n2 100\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [10, 36, 6, -7, -8, 23, 33, 12]\nprint(a[3:8])\nprint(a[::-2])\nprint(len(a[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [10, 36, 6, -7, -8, 23, 33, 12]\nprint(a[3:8])\nprint(a[::-2])\nprint(len(a[3:8]))\n```\nالجواب:", "qhash": "1d96eff4c7ee9b00", "answer": "[-7, -8, 23, 33, 12]\n[12, 23, -7, 36]\n5", "completion": " الناتج:\n```text\n[-7, -8, 23, 33, 12]\n[12, 23, -7, 36]\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 60434\nc = 0\nwhile x > 9:\n    x = x // 5\n    c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 60434\nc = 0\nwhile x > 9:\n    x = x // 5\n    c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "0d9b2a3c272eaad8", "answer": "3 6", "completion": " الناتج:\n```text\n3 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(xs):\n    if not xs:\n        return []\n    k = 4 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "tests": ["assert roll([5, 4, 9, 38, 49, 7, 15, 10]) == [49, 7, 15, 10, 5, 4, 9, 38]", "assert roll([27, -5, 26, 40, 29]) == [-5, 26, 40, 29, 27]", "assert roll([15, 19, 47, 4, 12, -7, 47, 2, 43, 44]) == [47, 2, 43, 44, 15, 19, 47, 4, 12, -7]", "assert roll([33, 10, 3]) == [3, 33, 10]", "assert roll([23, 42, 24, 30]) == [23, 42, 24, 30]", "assert roll([46]) == [46]", "assert roll([]) == []"], "test_code": "assert roll([5, 4, 9, 38, 49, 7, 15, 10]) == [49, 7, 15, 10, 5, 4, 9, 38]\nassert roll([27, -5, 26, 40, 29]) == [-5, 26, 40, 29, 27]\nassert roll([15, 19, 47, 4, 12, -7, 47, 2, 43, 44]) == [47, 2, 43, 44, 15, 19, 47, 4, 12, -7]\nassert roll([33, 10, 3]) == [3, 33, 10]\nassert roll([23, 42, 24, 30]) == [23, 42, 24, 30]\nassert roll([46]) == [46]\nassert roll([]) == []", "answer": "def roll(xs):\n    if not xs:\n        return []\n    k = 4 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]", "completion": " ```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 4 % len(xs)\n    return xs[len(xs) - k:] + xs[:len(xs) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(xs):\n    if not xs:\n        return []\n    k = 4 % len(xs)\n    return ____\n```\nمثال: `roll([5, 4, 9, 38, 49, 7, 15, 10]) == [49, 7, 15, 10, 5, 4, 9, 38]`\nالجواب:", "qhash": "32ccd12473a5bfb0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 101", "tests": ["assert step_product(7) == 28", "assert step_product(27) == 55", "assert step_product(26) == 87", "assert step_product(12) == 25", "assert step_product(25) == 79", "assert step_product(29) == 99", "assert step_product(0) == 1"], "test_code": "assert step_product(7) == 28\nassert step_product(27) == 55\nassert step_product(26) == 87\nassert step_product(12) == 25\nassert step_product(25) == 79\nassert step_product(29) == 99\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 101", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 3)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(7) == 28`\nالجواب:", "qhash": "4b42af1855c818f2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return -6 * x ** 2 + (4) * x + (0)", "tests": ["assert p(4) == -80", "assert p(19) == -2090", "assert p(-8) == -416", "assert p(7) == -266", "assert p(17) == -1666", "assert p(11) == -682", "assert p(7) == -266", "assert p(0) == 0"], "test_code": "assert p(4) == -80\nassert p(19) == -2090\nassert p(-8) == -416\nassert p(7) == -266\nassert p(17) == -1666\nassert p(11) == -682\nassert p(7) == -266\nassert p(0) == 0", "answer": "def p(x):\n    return -6 * x ** 2 + (4) * x + (0)", "completion": " ```python\ndef p(x):\n    return -6 * x ** 2 + (4) * x + (0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -6x² + 4x + 0.\nمثال: `p(4) == -80`\nالجواب:", "qhash": "8f056247e25c8682"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('falcon at falcon by apple') == 'nitkwv ib nitkwv jg ixxtm'", "assert shift_letters('an stone we garden') == 'iv abwvm em oizlmv'", "assert shift_letters('garden apple music up up OK') == 'oizlmv ixxtm ucaqk cx cx OK'", "assert shift_letters('desert') == 'lmamzb'", "assert shift_letters('we brain') == 'em jziqv'", "assert shift_letters('in python light !') == 'qv xgbpwv tqopb !'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('falcon at falcon by apple') == 'nitkwv ib nitkwv jg ixxtm'\nassert shift_letters('an stone we garden') == 'iv abwvm em oizlmv'\nassert shift_letters('garden apple music up up OK') == 'oizlmv ixxtm ucaqk cx cx OK'\nassert shift_letters('desert') == 'lmamzb'\nassert shift_letters('we brain') == 'em jziqv'\nassert shift_letters('in python light !') == 'qv xgbpwv tqopb !'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('falcon at falcon by apple') == 'nitkwv ib nitkwv jg ixxtm'`\nالجواب:", "qhash": "69e68ac9ebdf1b13"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ب'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('قهوة سيارة قلم') == 0", "assert prefix_hits('مطر ميناء كتاب سفينة مدينة فجر برتقال') == 1", "assert prefix_hits('شمس باب بيت طائرة') == 2", "assert prefix_hits('بحر برتقال شجرة تفاحة قمر خبز برتقال') == 3", "assert prefix_hits('قمر خبز صحراء مدينة باب عمل') == 1", "assert prefix_hits('مطر باب برمجة مكتبة قهوة عربية') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('قهوة سيارة قلم') == 0\nassert prefix_hits('مطر ميناء كتاب سفينة مدينة فجر برتقال') == 1\nassert prefix_hits('شمس باب بيت طائرة') == 2\nassert prefix_hits('بحر برتقال شجرة تفاحة قمر خبز برتقال') == 3\nassert prefix_hits('قمر خبز صحراء مدينة باب عمل') == 1\nassert prefix_hits('مطر باب برمجة مكتبة قهوة عربية') == 2\nassert prefix_hits('') == 0", "answer": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ب'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ب'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(text):\n    count = 0\n    for w in text:\n        if w.startswith('ب'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ب»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(text):\n    count = 0\n    for w in text:\n        if w.startswith('ب'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('قهوة سيارة قلم') == 0`\nالجواب:", "qhash": "58d2d0acc5007681"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'TicTac', '19', 'Tic']", "assert play(13) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13']", "assert play(5) == ['1', 'Tic', '3', 'Tic', '5']", "assert play(6) == ['1', 'Tic', '3', 'Tic', '5', 'Tic']", "assert play(25) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'TicTac', '19', 'Tic', '21', 'Tic', '23', 'Tic', '25']"], "test_code": "assert play(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'TicTac', '19', 'Tic']\nassert play(13) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13']\nassert play(5) == ['1', 'Tic', '3', 'Tic', '5']\nassert play(6) == ['1', 'Tic', '3', 'Tic', '5', 'Tic']\nassert play(25) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'TicTac', '19', 'Tic', '21', 'Tic', '23', 'Tic', '25']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Tic'، مضاعفات 9 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(20) == ['1', 'Tic', '3', 'Tic', '5', 'Tic', '7', 'Tic', 'Tac', 'Tic', '11', 'Tic', '13', 'Tic', '15', 'Tic', '17', 'TicTac', '19', 'Tic']`\nالجواب:", "qhash": "d8ed6e118cef0264"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(6, 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(6, 5))\n```\nالجواب:", "qhash": "039015c4cd6dd128", "answer": "7776", "completion": " الناتج:\n```text\n7776\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [(x + 5) // 3 for x in range(-6, 1) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [(x + 5) // 3 for x in range(-6, 1) if x % 3 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "08628787fd822cf1", "answer": "[-1, 0, 1]\n3 0", "completion": " الناتج:\n```text\n[-1, 0, 1]\n3 0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45", "tests": ["assert digit_score(38547) == 34", "assert digit_score(910132) == 0", "assert digit_score(463280) == 30", "assert digit_score(834184) == 11", "assert digit_score(271024) == 35", "assert digit_score(36900) == 18", "assert digit_score(728827) == 21", "assert digit_score(0) == 0"], "test_code": "assert digit_score(38547) == 34\nassert digit_score(910132) == 0\nassert digit_score(463280) == 30\nassert digit_score(834184) == 11\nassert digit_score(271024) == 35\nassert digit_score(36900) == 18\nassert digit_score(728827) == 21\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 45.\nمثال: `digit_score(38547) == 34`\nالجواب:", "qhash": "de8680f95428a8a3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'فيصل': 41, 'مريم': 2, 'رنا': 2}\nscores['مريم'] += 3\nscores['عمر'] = 35\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(sorted(scores.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'فيصل': 41, 'مريم': 2, 'رنا': 2}\nscores['مريم'] += 3\nscores['عمر'] = 35\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(sorted(scores.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "746c9f4dff1c5487", "answer": "4\nفيصل\n83\n[('رنا', 2), ('مريم', 5)]", "completion": " الناتج:\n```text\n4\nفيصل\n83\n[('رنا', 2), ('مريم', 5)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(items):\n    if not items:\n        return []\n    k = 7 % len(items)\n    return items[k:] + items[:k]", "tests": ["assert shift_list([24, 1, 26, 37, 30]) == [26, 37, 30, 24, 1]", "assert shift_list([44, 1, 37, 31, 17, -7, 50, 44, 36]) == [44, 36, 44, 1, 37, 31, 17, -7, 50]", "assert shift_list([9, 10, 7, 17, 44, 19, 50, 8, 24, 29, -4, 13]) == [8, 24, 29, -4, 13, 9, 10, 7, 17, 44, 19, 50]", "assert shift_list([30, 50, 34, 38, 50, 3, 35]) == [30, 50, 34, 38, 50, 3, 35]", "assert shift_list([17, 13, 48, 19]) == [19, 17, 13, 48]", "assert shift_list([16, 10, 38, 19, 32]) == [38, 19, 32, 16, 10]", "assert shift_list([]) == []"], "test_code": "assert shift_list([24, 1, 26, 37, 30]) == [26, 37, 30, 24, 1]\nassert shift_list([44, 1, 37, 31, 17, -7, 50, 44, 36]) == [44, 36, 44, 1, 37, 31, 17, -7, 50]\nassert shift_list([9, 10, 7, 17, 44, 19, 50, 8, 24, 29, -4, 13]) == [8, 24, 29, -4, 13, 9, 10, 7, 17, 44, 19, 50]\nassert shift_list([30, 50, 34, 38, 50, 3, 35]) == [30, 50, 34, 38, 50, 3, 35]\nassert shift_list([17, 13, 48, 19]) == [19, 17, 13, 48]\nassert shift_list([16, 10, 38, 19, 32]) == [38, 19, 32, 16, 10]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n    if not items:\n        return []\n    k = 7 % len(items)\n    return items[k:] + items[:k]", "completion": " ```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 7 % len(items)\n    return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 7 % len(items)\n    return ____\n```\nمثال: `shift_list([24, 1, 26, 37, 30]) == [26, 37, 30, 24, 1]`\nالجواب:", "qhash": "606bf1a04b51a9a5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "find_max_div", "reference": "def find_max_div(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert find_max_div([4, 2, 12, -4, 54]) == 54", "assert find_max_div([-9, -9, -18]) == -9", "assert find_max_div([1, 10]) == None", "assert find_max_div([-15, -1, -36, 16, -2, 10, 19, 4, 5]) == -36", "assert find_max_div([7, 6, 18, 8, 48, -4, -22, -10, -8]) == 18", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([4, 2, 12, -4, 54]) == 54\nassert find_max_div([-9, -9, -18]) == -9\nassert find_max_div([1, 10]) == None\nassert find_max_div([-15, -1, -36, 16, -2, 10, 19, 4, 5]) == -36\nassert find_max_div([7, 6, 18, 8, 48, -4, -22, -10, -8]) == 18\nassert find_max_div([]) == None", "answer": "def find_max_div(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef find_max_div(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def find_max_div(arr):\n    best = None\n    for x in arr:\n        if x % 9 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef find_max_div(arr):\n    best = None\n    for x in arr:\n        if x % 9 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `find_max_div([4, 2, 12, -4, 54]) == 54`\nالجواب:", "qhash": "1d2d004547201700"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=8):\n    if x > y:\n        return x * -5 - y\n    return x + y * -5\n\nprint(f(-2))\nprint(f(-2, -8))\nprint(f(f(-8), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=8):\n    if x > y:\n        return x * -5 - y\n    return x + y * -5\n\nprint(f(-2))\nprint(f(-2, -8))\nprint(f(f(-8), -2))\n```\nالجواب:", "qhash": "01da4791bbeb1ad9", "answer": "-42\n18\n-38", "completion": " الناتج:\n```text\n-42\n18\n-38\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digits_mod", "reference": "def digits_mod(n):\n    return sum(int(d) ** 1 for d in str(n)) % 58", "tests": ["assert digits_mod(17105) == 14", "assert digits_mod(895283) == 35", "assert digits_mod(583294) == 31", "assert digits_mod(121799) == 29", "assert digits_mod(164630) == 20", "assert digits_mod(891996) == 42", "assert digits_mod(886438) == 37", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(17105) == 14\nassert digits_mod(895283) == 35\nassert digits_mod(583294) == 31\nassert digits_mod(121799) == 29\nassert digits_mod(164630) == 20\nassert digits_mod(891996) == 42\nassert digits_mod(886438) == 37\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n    return sum(int(d) ** 1 for d in str(n)) % 58", "completion": " ```python\ndef digits_mod(n):\n    return sum(int(d) ** 1 for d in str(n)) % 58\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digits_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 58.\nمثال: `digits_mod(17105) == 14`\nالجواب:", "qhash": "447ed838d0f6fa7d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)", "tests": ["assert coprimes(108) == 107", "assert coprimes(10) == 10", "assert coprimes(185) == 183", "assert coprimes(53) == 53", "assert coprimes(64) == 64", "assert coprimes(1) == 1", "assert coprimes(1) == 1"], "test_code": "assert coprimes(108) == 107\nassert coprimes(10) == 10\nassert coprimes(185) == 183\nassert coprimes(53) == 53\nassert coprimes(64) == 64\nassert coprimes(1) == 1\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 71 في أي قاسم أكبر من 1.\nمثال: `coprimes(108) == 107`\nالجواب:", "qhash": "f87537ea8beef5ab"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 37) == 1)", "tests": ["assert rel_prime_count(113) == 110", "assert rel_prime_count(179) == 175", "assert rel_prime_count(115) == 112", "assert rel_prime_count(93) == 91", "assert rel_prime_count(168) == 164", "assert rel_prime_count(97) == 95", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(113) == 110\nassert rel_prime_count(179) == 175\nassert rel_prime_count(115) == 112\nassert rel_prime_count(93) == 91\nassert rel_prime_count(168) == 164\nassert rel_prime_count(97) == 95\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 37) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 37) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 37 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(113) == 110`\nالجواب:", "qhash": "d2b7854abb6390a9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_coprime", "reference": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 81) == 1)", "tests": ["assert count_coprime(84) == 56", "assert count_coprime(16) == 11", "assert count_coprime(21) == 14", "assert count_coprime(87) == 58", "assert count_coprime(198) == 132", "assert count_coprime(22) == 15", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(84) == 56\nassert count_coprime(16) == 11\nassert count_coprime(21) == 14\nassert count_coprime(87) == 58\nassert count_coprime(198) == 132\nassert count_coprime(22) == 15\nassert count_coprime(1) == 1", "answer": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 81) == 1)", "completion": " ```python\ndef count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 81) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_coprime` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 81 في أي قاسم أكبر من 1.\nمثال: `count_coprime(84) == 56`\nالجواب:", "qhash": "cbdab27f8e44c1e1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['garden', 'data', 'cloud', 'river', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['garden', 'data', 'cloud', 'river', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "2d337c727c23e26f", "answer": "['data', 'cloud', 'river', 'stone', 'garden']\n['garden', 'stone', 'river']", "completion": " الناتج:\n```text\n['data', 'cloud', 'river', 'stone', 'garden']\n['garden', 'stone', 'river']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 3) == 1)", "tests": ["assert coprimes(127) == 85", "assert coprimes(91) == 61", "assert coprimes(96) == 64", "assert coprimes(125) == 84", "assert coprimes(7) == 5", "assert coprimes(19) == 13", "assert coprimes(1) == 1"], "test_code": "assert coprimes(127) == 85\nassert coprimes(91) == 61\nassert coprimes(96) == 64\nassert coprimes(125) == 84\nassert coprimes(7) == 5\nassert coprimes(19) == 13\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 3) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 3) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 3 في أي قاسم أكبر من 1.\nمثال: `coprimes(127) == 85`\nالجواب:", "qhash": "4ba549b4ea920f07"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Fizz'\n        if i % 11 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz']", "assert label_numbers(19) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19']", "assert label_numbers(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz']", "assert label_numbers(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'Fizz', '21']", "assert label_numbers(20) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'Fizz']"], "test_code": "assert label_numbers(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz']\nassert label_numbers(19) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19']\nassert label_numbers(8) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz']\nassert label_numbers(21) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'Fizz', '21']\nassert label_numbers(20) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz', '19', 'Fizz']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Fizz'\n        if i % 11 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Fizz'\n        if i % 11 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Fizz'، مضاعفات 11 تصبح 'Buzz'، المضاعفات المشتركة تصبح 'FizzBuzz'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(18) == ['1', 'Fizz', '3', 'Fizz', '5', 'Fizz', '7', 'Fizz', '9', 'Fizz', 'Buzz', 'Fizz', '13', 'Fizz', '15', 'Fizz', '17', 'Fizz']`\nالجواب:", "qhash": "d4d35291870a6150"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 15425\ncount = 0\nwhile x > 12:\n    x = x // 8\n    count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 15425\ncount = 0\nwhile x > 12:\n    x = x // 8\n    count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "08538d1c10ecde45", "answer": "3 4", "completion": " الناتج:\n```text\n3 4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "best_multiple", "reference": "def best_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert best_multiple([-4, 6, 56, 60, -10, 0, -9, 15]) == 60", "assert best_multiple([-36, -36, -24]) == -24", "assert best_multiple([1, 13, 25]) == None", "assert best_multiple([]) == None", "assert best_multiple([-21, 20, -27, 29]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-4, 6, 56, 60, -10, 0, -9, 15]) == 60\nassert best_multiple([-36, -36, -24]) == -24\nassert best_multiple([1, 13, 25]) == None\nassert best_multiple([]) == None\nassert best_multiple([-21, 20, -27, 29]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef best_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def best_multiple(xs):\n    best = 0\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef best_multiple(xs):\n    best = 0\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `best_multiple([-4, 6, 56, 60, -10, 0, -9, 15]) == 60`\nالجواب:", "qhash": "6ba6674e45a43f4a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * 5 for x in xs if 8 <= x <= 25)", "tests": ["assert pick_between([19, 11, 24, 9]) == [45, 55, 95, 120]", "assert pick_between([31, 58, -24, -11, 0, 48]) == []", "assert pick_between([49, -11, 22, 6]) == [110]", "assert pick_between([20, 38, 5, -28, 58]) == [100]", "assert pick_between([48, -1]) == []", "assert pick_between([39, 18, -20, 35, 56]) == [90]", "assert pick_between([35, 43, -27, 52, -9, 54, 30, 40, 41, 33]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([19, 11, 24, 9]) == [45, 55, 95, 120]\nassert pick_between([31, 58, -24, -11, 0, 48]) == []\nassert pick_between([49, -11, 22, 6]) == [110]\nassert pick_between([20, 38, 5, -28, 58]) == [100]\nassert pick_between([48, -1]) == []\nassert pick_between([39, 18, -20, 35, 56]) == [90]\nassert pick_between([35, 43, -27, 52, -9, 54, 30, 40, 41, 33]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * 5 for x in xs if 8 <= x <= 25)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * 5 for x in xs if 8 <= x <= 25)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [8, 25].\nمثال: `pick_between([19, 11, 24, 9]) == [45, 55, 95, 120]`\nالجواب:", "qhash": "6928a46937253e8c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * -4 for x in xs if -18 <= x <= -10)", "tests": ["assert between_times([-2, -2, -17, -24, -26, -25]) == [68]", "assert between_times([22, 36]) == []", "assert between_times([45, -12, 0, -25, 1]) == [48]", "assert between_times([-19, 47, 37, 58, 23, -22, 25, 28, -9]) == []", "assert between_times([-18, 13, -28, 47]) == [72]", "assert between_times([44]) == []", "assert between_times([-4, -30, 14, 59, 28, 4]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([-2, -2, -17, -24, -26, -25]) == [68]\nassert between_times([22, 36]) == []\nassert between_times([45, -12, 0, -25, 1]) == [48]\nassert between_times([-19, 47, 37, 58, 23, -22, 25, 28, -9]) == []\nassert between_times([-18, 13, -28, 47]) == [72]\nassert between_times([44]) == []\nassert between_times([-4, -30, 14, 59, 28, 4]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * -4 for x in xs if -18 <= x <= -10)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * -4 for x in xs if -18 <= x <= -10)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [-18, -10].\nمثال: `between_times([-2, -2, -17, -24, -26, -25]) == [68]`\nالجواب:", "qhash": "5048d1f90e08e96f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(0, 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(0, 0))\n```\nالجواب:", "qhash": "08b25399f69980f9", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'ch'}", "tests": ["assert char_freq('brain winter is') == {'c': 0, 'h': 0}", "assert char_freq('go at music we') == {'c': 1, 'h': 0}", "assert char_freq('python') == {'c': 0, 'h': 1}", "assert char_freq('table we') == {'c': 0, 'h': 0}", "assert char_freq('banana river is it') == {'c': 0, 'h': 0}", "assert char_freq('winter at winter') == {'c': 0, 'h': 0}", "assert char_freq('') == {'c': 0, 'h': 0}"], "test_code": "assert char_freq('brain winter is') == {'c': 0, 'h': 0}\nassert char_freq('go at music we') == {'c': 1, 'h': 0}\nassert char_freq('python') == {'c': 0, 'h': 1}\nassert char_freq('table we') == {'c': 0, 'h': 0}\nassert char_freq('banana river is it') == {'c': 0, 'h': 0}\nassert char_freq('winter at winter') == {'c': 0, 'h': 0}\nassert char_freq('') == {'c': 0, 'h': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'ch'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'ch'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'c'، 'h' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('brain winter is') == {'c': 0, 'h': 0}`\nالجواب:", "qhash": "8a5dc953917686a8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('garden window up Hello') == 'ictfgp ykpfqy wr Hgnnq'", "assert shift_letters('rocket pixel music by') == 'tqemgv rkzgn owuke da'", "assert shift_letters('of') == 'qh'", "assert shift_letters('by winter garden Hello') == 'da ykpvgt ictfgp Hgnnq'", "assert shift_letters('is rocket it is A1') == 'ku tqemgv kv ku A1'", "assert shift_letters('river river planet') == 'tkxgt tkxgt rncpgv'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('garden window up Hello') == 'ictfgp ykpfqy wr Hgnnq'\nassert shift_letters('rocket pixel music by') == 'tqemgv rkzgn owuke da'\nassert shift_letters('of') == 'qh'\nassert shift_letters('by winter garden Hello') == 'da ykpvgt ictfgp Hgnnq'\nassert shift_letters('is rocket it is A1') == 'ku tqemgv kv ku A1'\nassert shift_letters('river river planet') == 'tkxgt tkxgt rncpgv'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('garden window up Hello') == 'ictfgp ykpfqy wr Hgnnq'`\nالجواب:", "qhash": "6896749f525e221d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=7):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(compute(9))\nprint(compute(9, 3))\nprint(compute(compute(3), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=7):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(compute(9))\nprint(compute(9, 3))\nprint(compute(compute(3), 9))\n```\nالجواب:", "qhash": "9183f0bc73c20772", "answer": "2\n6\n1", "completion": " الناتج:\n```text\n2\n6\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [34, 23, 16, 33, -5, 38, 5, 9]\nprint(items[1:7])\nprint(items[::-2])\nprint(min(items[1:7]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [34, 23, 16, 33, -5, 38, 5, 9]\nprint(items[1:7])\nprint(items[::-2])\nprint(min(items[1:7]))\n```\nالجواب:", "qhash": "f1d868f306591b5c", "answer": "[23, 16, 33, -5, 38, 5]\n[9, 38, 33, 23]\n-5", "completion": " الناتج:\n```text\n[23, 16, 33, -5, 38, 5]\n[9, 38, 33, 23]\n-5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 2\nfor j in range(7, 31, 4):\n    total += j * 4\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 2\nfor j in range(7, 31, 4):\n    total += j * 4\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "abbcfb6e833d4964", "answer": "410\n27", "completion": " الناتج:\n```text\n410\n27\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_count", "reference": "def letter_count(text):\n    return sum(1 for w in text.split() if 'ح' in w)", "tests": ["assert letter_count('فجر باب نهار حاسوب قمر دفتر مدينة') == 1", "assert letter_count('') == 0", "assert letter_count('قلم باب') == 0", "assert letter_count('مدرسة مدينة') == 0", "assert letter_count('مكتبة ليل معلم سماء ميناء قهوة قلم كتاب') == 0", "assert letter_count('وردة سفينة') == 0", "assert letter_count('ليل') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('فجر باب نهار حاسوب قمر دفتر مدينة') == 1\nassert letter_count('') == 0\nassert letter_count('قلم باب') == 0\nassert letter_count('مدرسة مدينة') == 0\nassert letter_count('مكتبة ليل معلم سماء ميناء قهوة قلم كتاب') == 0\nassert letter_count('وردة سفينة') == 0\nassert letter_count('ليل') == 0\nassert letter_count('') == 0", "answer": "def letter_count(text):\n    return sum(1 for w in text.split() if 'ح' in w)", "completion": " ```python\ndef letter_count(text):\n    return sum(1 for w in text.split() if 'ح' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_count` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ح» مرة واحدة على الأقل.\nمثال: `letter_count('فجر باب نهار حاسوب قمر دفتر مدينة') == 1`\nالجواب:", "qhash": "4bac680e3b5cc69a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 142:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([37, 55, 34, 28, 62, 3]) == [37, 92, 126, 0, 62, 65]", "assert rolling_total([76, 15, -1, 20, 87, 110, 116]) == [76, 91, 90, 110, 0, 110, 0]", "assert rolling_total([7, 88, -8]) == [7, 95, 87]", "assert rolling_total([44, 63, 65, 116, 106, 53, 63, 11, 118]) == [44, 107, 0, 116, 0, 53, 116, 127, 0]", "assert rolling_total([44, 5]) == [44, 49]", "assert rolling_total([102, 77, -7, 129]) == [102, 0, -7, 122]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([37, 55, 34, 28, 62, 3]) == [37, 92, 126, 0, 62, 65]\nassert rolling_total([76, 15, -1, 20, 87, 110, 116]) == [76, 91, 90, 110, 0, 110, 0]\nassert rolling_total([7, 88, -8]) == [7, 95, 87]\nassert rolling_total([44, 63, 65, 116, 106, 53, 63, 11, 118]) == [44, 107, 0, 116, 0, 53, 116, 127, 0]\nassert rolling_total([44, 5]) == [44, 49]\nassert rolling_total([102, 77, -7, 129]) == [102, 0, -7, 122]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 142:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 142:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 142 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([37, 55, 34, 28, 62, 3]) == [37, 92, 126, 0, 62, 65]`\nالجواب:", "qhash": "0c980b6be1cc2ac7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'bdel'}", "tests": ["assert letter_stats('python rocket summer up we') == {'b': 0, 'd': 0, 'e': 3, 'l': 0}", "assert letter_stats('brain river window at an') == {'b': 1, 'd': 1, 'e': 1, 'l': 0}", "assert letter_stats('signal river planet of') == {'b': 0, 'd': 0, 'e': 2, 'l': 2}", "assert letter_stats('light go up a') == {'b': 0, 'd': 0, 'e': 0, 'l': 1}", "assert letter_stats('light is') == {'b': 0, 'd': 0, 'e': 0, 'l': 1}", "assert letter_stats('at banana table') == {'b': 2, 'd': 0, 'e': 1, 'l': 1}", "assert letter_stats('') == {'b': 0, 'd': 0, 'e': 0, 'l': 0}"], "test_code": "assert letter_stats('python rocket summer up we') == {'b': 0, 'd': 0, 'e': 3, 'l': 0}\nassert letter_stats('brain river window at an') == {'b': 1, 'd': 1, 'e': 1, 'l': 0}\nassert letter_stats('signal river planet of') == {'b': 0, 'd': 0, 'e': 2, 'l': 2}\nassert letter_stats('light go up a') == {'b': 0, 'd': 0, 'e': 0, 'l': 1}\nassert letter_stats('light is') == {'b': 0, 'd': 0, 'e': 0, 'l': 1}\nassert letter_stats('at banana table') == {'b': 2, 'd': 0, 'e': 1, 'l': 1}\nassert letter_stats('') == {'b': 0, 'd': 0, 'e': 0, 'l': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'bdel'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'bdel'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 'd'، 'e'، 'l' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('python rocket summer up we') == {'b': 0, 'd': 0, 'e': 3, 'l': 0}`\nالجواب:", "qhash": "d74083643eac54c0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert flip_words('in coffee in') == 'in,coffee,in'", "assert flip_words('by rocket garden') == 'garden,rocket,by'", "assert flip_words('table music up engine') == 'engine,up,music,table'", "assert flip_words('of music apple') == 'apple,music,of'", "assert flip_words('garden') == 'garden'", "assert flip_words('is') == 'is'", "assert flip_words('matrix falcon brain') == 'brain,falcon,matrix'"], "test_code": "assert flip_words('in coffee in') == 'in,coffee,in'\nassert flip_words('by rocket garden') == 'garden,rocket,by'\nassert flip_words('table music up engine') == 'engine,up,music,table'\nassert flip_words('of music apple') == 'apple,music,of'\nassert flip_words('garden') == 'garden'\nassert flip_words('is') == 'is'\nassert flip_words('matrix falcon brain') == 'brain,falcon,matrix'", "answer": "def flip_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef flip_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `flip_words('in coffee in') == 'in,coffee,in'`\nالجواب:", "qhash": "ddc4481f2c95cc86"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(lst):\n    if not lst:\n        return []\n    k = 5 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert roll([21, 4, 26, 30, 43]) == [21, 4, 26, 30, 43]", "assert roll([14, 35, 39, 3, 13, 14, 35]) == [39, 3, 13, 14, 35, 14, 35]", "assert roll([-2, 21, 19, -3, 5, 46]) == [21, 19, -3, 5, 46, -2]", "assert roll([10, 44, 4, 22, 1, -8, 43, 11, 1, 30]) == [-8, 43, 11, 1, 30, 10, 44, 4, 22, 1]", "assert roll([43, 14, 38, 38]) == [38, 43, 14, 38]", "assert roll([28, 9, 50, 5, 7, -4, -1]) == [50, 5, 7, -4, -1, 28, 9]", "assert roll([]) == []"], "test_code": "assert roll([21, 4, 26, 30, 43]) == [21, 4, 26, 30, 43]\nassert roll([14, 35, 39, 3, 13, 14, 35]) == [39, 3, 13, 14, 35, 14, 35]\nassert roll([-2, 21, 19, -3, 5, 46]) == [21, 19, -3, 5, 46, -2]\nassert roll([10, 44, 4, 22, 1, -8, 43, 11, 1, 30]) == [-8, 43, 11, 1, 30, 10, 44, 4, 22, 1]\nassert roll([43, 14, 38, 38]) == [38, 43, 14, 38]\nassert roll([28, 9, 50, 5, 7, -4, -1]) == [50, 5, 7, -4, -1, 28, 9]\nassert roll([]) == []", "answer": "def roll(lst):\n    if not lst:\n        return []\n    k = 5 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 5 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 5 % len(lst)\n    return ____\n```\nمثال: `roll([21, 4, 26, 30, 43]) == [21, 4, 26, 30, 43]`\nالجواب:", "qhash": "3d31879f3be175a5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "tests": ["assert sum_multiples(126) == 1638", "assert sum_multiples(282) == 8544", "assert sum_multiples(69) == 494", "assert sum_multiples(40) == 168", "assert sum_multiples(26) == 74", "assert sum_multiples(103) == 1184", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(126) == 1638\nassert sum_multiples(282) == 8544\nassert sum_multiples(69) == 494\nassert sum_multiples(40) == 168\nassert sum_multiples(26) == 74\nassert sum_multiples(103) == 1184\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 6 أو 14 دون باقٍ.\nمثال: `sum_multiples(126) == 1638`\nالجواب:", "qhash": "621ca35b3bc868d1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 46815\nsteps = 0\nwhile n > 6:\n    n = n // 3\n    steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 46815\nsteps = 0\nwhile n > 6:\n    n = n // 3\n    steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "efafbd0bb5e8ca0b", "answer": "2 9", "completion": " الناتج:\n```text\n2 9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 11\nfor i in range(-1, 19, 3):\n    total -= i * 1\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 11\nfor i in range(-1, 19, 3):\n    total -= i * 1\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "d2a4e7f79c305ce6", "answer": "-45\n17", "completion": " الناتج:\n```text\n-45\n17\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert rev_long_words('light an rocket signal on banana an') == 'an/banana/on/signal/rocket/an/light'", "assert rev_long_words('at pixel orange window summer winter desert summer') == 'summer/desert/winter/summer/window/orange/pixel/at'", "assert rev_long_words('') == ''", "assert rev_long_words('cloud') == 'cloud'", "assert rev_long_words('in desert banana coffee data') == 'data/coffee/banana/desert/in'", "assert rev_long_words('') == ''", "assert rev_long_words('an apple desert of at on at light') == 'light/at/on/at/of/desert/apple/an'"], "test_code": "assert rev_long_words('light an rocket signal on banana an') == 'an/banana/on/signal/rocket/an/light'\nassert rev_long_words('at pixel orange window summer winter desert summer') == 'summer/desert/winter/summer/window/orange/pixel/at'\nassert rev_long_words('') == ''\nassert rev_long_words('cloud') == 'cloud'\nassert rev_long_words('in desert banana coffee data') == 'data/coffee/banana/desert/in'\nassert rev_long_words('') == ''\nassert rev_long_words('an apple desert of at on at light') == 'light/at/on/at/of/desert/apple/an'", "answer": "def rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `rev_long_words('light an rocket signal on banana an') == 'an/banana/on/signal/rocket/an/light'`\nالجواب:", "qhash": "793cbf33e6d105d7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 5 <= x <= 15)", "tests": ["assert between_times([23, 19, 12, 19]) == [12]", "assert between_times([25, 21, 50, 50, 36, 41, 57, 13, 55]) == [13]", "assert between_times([]) == []", "assert between_times([44, 17, 45, 39]) == []", "assert between_times([12, 40, 43, -10, 51, -17]) == [12]", "assert between_times([-1, -6, 20, 60, -14, -6, 58, 44, -11, 52]) == []", "assert between_times([-19, 51]) == []", "assert between_times([]) == []"], "test_code": "assert between_times([23, 19, 12, 19]) == [12]\nassert between_times([25, 21, 50, 50, 36, 41, 57, 13, 55]) == [13]\nassert between_times([]) == []\nassert between_times([44, 17, 45, 39]) == []\nassert between_times([12, 40, 43, -10, 51, -17]) == [12]\nassert between_times([-1, -6, 20, 60, -14, -6, 58, 44, -11, 52]) == []\nassert between_times([-19, 51]) == []\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 5 <= x <= 15)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 1 for x in xs if 5 <= x <= 15)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [5, 15].\nمثال: `between_times([23, 19, 12, 19]) == [12]`\nالجواب:", "qhash": "861e91ba48fd3016"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digits_mod", "reference": "def digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 33", "tests": ["assert digits_mod(25261) == 28", "assert digits_mod(337918) == 22", "assert digits_mod(486201) == 9", "assert digits_mod(658585) == 31", "assert digits_mod(998246) == 14", "assert digits_mod(217395) == 12", "assert digits_mod(524386) == 28", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(25261) == 28\nassert digits_mod(337918) == 22\nassert digits_mod(486201) == 9\nassert digits_mod(658585) == 31\nassert digits_mod(998246) == 14\nassert digits_mod(217395) == 12\nassert digits_mod(524386) == 28\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 33", "completion": " ```python\ndef digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 33\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digits_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 33.\nمثال: `digits_mod(25261) == 28`\nالجواب:", "qhash": "aa2959ba891d2fc3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 170\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 170\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "f70994152646a64a", "answer": "10", "completion": " الناتج:\n```text\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "reverse_words", "reference": "def reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert reverse_words('winter river signal vector falcon river vector') == 'vector_river_falcon_vector_signal_river_winter'", "assert reverse_words('camel coffee python summer engine') == 'engine_summer_python_coffee_camel'", "assert reverse_words('up') == 'up'", "assert reverse_words('planet signal') == 'signal_planet'", "assert reverse_words('code pixel apple apple python we') == 'we_python_apple_apple_pixel_code'", "assert reverse_words('to') == 'to'", "assert reverse_words('') == ''"], "test_code": "assert reverse_words('winter river signal vector falcon river vector') == 'vector_river_falcon_vector_signal_river_winter'\nassert reverse_words('camel coffee python summer engine') == 'engine_summer_python_coffee_camel'\nassert reverse_words('up') == 'up'\nassert reverse_words('planet signal') == 'signal_planet'\nassert reverse_words('code pixel apple apple python we') == 'we_python_apple_apple_pixel_code'\nassert reverse_words('to') == 'to'\nassert reverse_words('') == ''", "answer": "def reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `reverse_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `reverse_words('winter river signal vector falcon river vector') == 'vector_river_falcon_vector_signal_river_winter'`\nالجواب:", "qhash": "adfb21c100aeda24"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * 4 for x in xs if -13 <= x <= 14)", "tests": ["assert clip_scale([2, 3, 15, 10, 16, -6, 17, -14, 6]) == [-24, 8, 12, 24, 40]", "assert clip_scale([16, 47, 58]) == []", "assert clip_scale([-8, 56, 36, 12, 34, 35, -30, 58, 2]) == [-32, 8, 48]", "assert clip_scale([28, 17, -14, 59, -28, 4, 59]) == [16]", "assert clip_scale([45, 34]) == []", "assert clip_scale([-13]) == [-52]", "assert clip_scale([9, -14, 12, -15, 29, 11, 20, -12, 57, -23]) == [-48, 36, 44, 48]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([2, 3, 15, 10, 16, -6, 17, -14, 6]) == [-24, 8, 12, 24, 40]\nassert clip_scale([16, 47, 58]) == []\nassert clip_scale([-8, 56, 36, 12, 34, 35, -30, 58, 2]) == [-32, 8, 48]\nassert clip_scale([28, 17, -14, 59, -28, 4, 59]) == [16]\nassert clip_scale([45, 34]) == []\nassert clip_scale([-13]) == [-52]\nassert clip_scale([9, -14, 12, -15, 29, 11, 20, -12, 57, -23]) == [-48, 36, 44, 48]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * 4 for x in xs if -13 <= x <= 14)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * 4 for x in xs if -13 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 4 لكل عنصر x في المدى المغلق [-13, 14].\nمثال: `clip_scale([2, 3, 15, 10, 16, -6, 17, -14, 6]) == [-24, 8, 12, 24, 40]`\nالجواب:", "qhash": "25b571bc5997cfe8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([20, -29, 17, -5]) == None", "assert biggest_mult([-60, -48, -12]) == -12", "assert biggest_mult([1, 13]) == None", "assert biggest_mult([-6, 27, -38, 14, -38]) == None", "assert biggest_mult([-27, -38, 4, -7, 2, 47]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([20, -29, 17, -5]) == None\nassert biggest_mult([-60, -48, -12]) == -12\nassert biggest_mult([1, 13]) == None\nassert biggest_mult([-6, 27, -38, 14, -38]) == None\nassert biggest_mult([-27, -38, 4, -7, 2, 47]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(nums):\n    best = None\n    for x in nums:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(nums):\n    best = 0\n    for x in nums:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(nums):\n    best = 0\n    for x in nums:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([20, -29, 17, -5]) == None`\nالجواب:", "qhash": "6b12ae7c5e1a09bd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n <= 1:\n        return 2\n    return 3 * go(n - 1) + 1\n\nprint(go(6))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n <= 1:\n        return 2\n    return 3 * go(n - 1) + 1\n\nprint(go(6))\n```\nالجواب:", "qhash": "ad1726701b6650f6", "answer": "607", "completion": " الناتج:\n```text\n607\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 220\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 220\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)\n```\nالجواب:", "qhash": "ae2b0ac7a3561f97", "answer": "114", "completion": " الناتج:\n```text\n114\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_terms", "reference": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total", "tests": ["assert sum_terms(3) == 12", "assert sum_terms(9) == 90", "assert sum_terms(1) == 2", "assert sum_terms(9) == 90", "assert sum_terms(9) == 90", "assert sum_terms(1) == 2", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(3) == 12\nassert sum_terms(9) == 90\nassert sum_terms(1) == 2\nassert sum_terms(9) == 90\nassert sum_terms(9) == 90\nassert sum_terms(1) == 2\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total", "completion": " ```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total\n```\n", "buggy": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 2 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 2 * i ** 1\n    return total\n```\nمثال: `sum_terms(3) == 12`\nالجواب:", "qhash": "d1e1a6c89471f7bd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 4\nfor j in range(2, 19, 2):\n    total += j * 2\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 4\nfor j in range(2, 19, 2):\n    total += j * 2\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "33c379ee5aa7b9e1", "answer": "184\n18", "completion": " الناتج:\n```text\n184\n18\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "words_reversed", "reference": "def words_reversed(s):\n    return '|'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert words_reversed('data summer stone it river') == 'river|stone|summer'", "assert words_reversed('an garden garden orange python garden rocket table') == 'table|rocket|garden|python|orange|garden|garden'", "assert words_reversed('coffee falcon python') == 'python|falcon|coffee'", "assert words_reversed('window planet is') == 'planet|window'", "assert words_reversed('') == ''", "assert words_reversed('brain desert music pixel engine') == 'engine|pixel|music|desert|brain'", "assert words_reversed('it camel') == 'camel'"], "test_code": "assert words_reversed('data summer stone it river') == 'river|stone|summer'\nassert words_reversed('an garden garden orange python garden rocket table') == 'table|rocket|garden|python|orange|garden|garden'\nassert words_reversed('coffee falcon python') == 'python|falcon|coffee'\nassert words_reversed('window planet is') == 'planet|window'\nassert words_reversed('') == ''\nassert words_reversed('brain desert music pixel engine') == 'engine|pixel|music|desert|brain'\nassert words_reversed('it camel') == 'camel'", "answer": "def words_reversed(s):\n    return '|'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef words_reversed(s):\n    return '|'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `words_reversed` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '|'.\nمثال: `words_reversed('data summer stone it river') == 'river|stone|summer'`\nالجواب:", "qhash": "f23ac760d2bfdc88"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "tests": ["assert sum_multiples(170) == 2985", "assert sum_multiples(245) == 5890", "assert sum_multiples(185) == 3522", "assert sum_multiples(161) == 2491", "assert sum_multiples(96) == 952", "assert sum_multiples(21) == 36", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(170) == 2985\nassert sum_multiples(245) == 5890\nassert sum_multiples(185) == 3522\nassert sum_multiples(161) == 2491\nassert sum_multiples(96) == 952\nassert sum_multiples(21) == 36\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 7 أو 15 دون باقٍ.\nمثال: `sum_multiples(170) == 2985`\nالجواب:", "qhash": "7c98239cc04e876d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)", "tests": ["assert rel_prime_count(31) == 31", "assert rel_prime_count(135) == 134", "assert rel_prime_count(177) == 175", "assert rel_prime_count(188) == 186", "assert rel_prime_count(171) == 169", "assert rel_prime_count(141) == 140", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(31) == 31\nassert rel_prime_count(135) == 134\nassert rel_prime_count(177) == 175\nassert rel_prime_count(188) == 186\nassert rel_prime_count(171) == 169\nassert rel_prime_count(141) == 140\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 83 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(31) == 31`\nالجواب:", "qhash": "f3575ef6bba73a46"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprime_count", "reference": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)", "tests": ["assert coprime_count(21) == 20", "assert coprime_count(67) == 61", "assert coprime_count(82) == 75", "assert coprime_count(60) == 55", "assert coprime_count(141) == 129", "assert coprime_count(84) == 77", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(21) == 20\nassert coprime_count(67) == 61\nassert coprime_count(82) == 75\nassert coprime_count(60) == 55\nassert coprime_count(141) == 129\nassert coprime_count(84) == 77\nassert coprime_count(1) == 1", "answer": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)", "completion": " ```python\ndef coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 11 في أي قاسم أكبر من 1.\nمثال: `coprime_count(21) == 20`\nالجواب:", "qhash": "eb02866afb199eb1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'gi'}", "tests": ["assert char_freq('music') == {'g': 0, 'i': 1}", "assert char_freq('coffee on code music desert') == {'g': 0, 'i': 1}", "assert char_freq('orange') == {'g': 1, 'i': 0}", "assert char_freq('a up up is') == {'g': 0, 'i': 1}", "assert char_freq('of') == {'g': 0, 'i': 0}", "assert char_freq('vector light summer apple') == {'g': 1, 'i': 1}", "assert char_freq('') == {'g': 0, 'i': 0}"], "test_code": "assert char_freq('music') == {'g': 0, 'i': 1}\nassert char_freq('coffee on code music desert') == {'g': 0, 'i': 1}\nassert char_freq('orange') == {'g': 1, 'i': 0}\nassert char_freq('a up up is') == {'g': 0, 'i': 1}\nassert char_freq('of') == {'g': 0, 'i': 0}\nassert char_freq('vector light summer apple') == {'g': 1, 'i': 1}\nassert char_freq('') == {'g': 0, 'i': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'gi'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'gi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'g'، 'i' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('music') == {'g': 0, 'i': 1}`\nالجواب:", "qhash": "808d483a33492413"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_ar", "reference": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ش'))", "tests": ["assert count_ar('برمجة نور نور قمر ميناء') == 0", "assert count_ar('خبز') == 0", "assert count_ar('ميناء سفينة خبز جبل') == 0", "assert count_ar('ميناء مدرسة بيت عمل') == 0", "assert count_ar('ميناء نهر') == 0", "assert count_ar('تفاحة سفينة صديق مدينة رمل وردة وردة طالب') == 0", "assert count_ar('') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('برمجة نور نور قمر ميناء') == 0\nassert count_ar('خبز') == 0\nassert count_ar('ميناء سفينة خبز جبل') == 0\nassert count_ar('ميناء مدرسة بيت عمل') == 0\nassert count_ar('ميناء نهر') == 0\nassert count_ar('تفاحة سفينة صديق مدينة رمل وردة وردة طالب') == 0\nassert count_ar('') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ش'))", "completion": " ```python\ndef count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ش'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_ar` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ش».\nمثال: `count_ar('برمجة نور نور قمر ميناء') == 0`\nالجواب:", "qhash": "b36add7ecd1b0665"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 43\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 43\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)\n```\nالجواب:", "qhash": "72326152cc6c759e", "answer": "29", "completion": " الناتج:\n```text\n29\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "pow_total", "reference": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 2\n    return total", "tests": ["assert pow_total(3) == 56", "assert pow_total(5) == 220", "assert pow_total(13) == 3276", "assert pow_total(15) == 4960", "assert pow_total(5) == 220", "assert pow_total(1) == 4", "assert pow_total(0) == 0"], "test_code": "assert pow_total(3) == 56\nassert pow_total(5) == 220\nassert pow_total(13) == 3276\nassert pow_total(15) == 4960\nassert pow_total(5) == 220\nassert pow_total(1) == 4\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 2\n    return total", "completion": " ```python\ndef pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 2\n    return total\n```\n", "buggy": "def pow_total(n):\n    total = 0\n    for i in range(0, n):\n        total += 4 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 4 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef pow_total(n):\n    total = 0\n    for i in range(0, n):\n        total += 4 * i ** 2\n    return total\n```\nمثال: `pow_total(3) == 56`\nالجواب:", "qhash": "9aa7832bb84cf76d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 59) == 1)", "tests": ["assert coprimes(141) == 139", "assert coprimes(99) == 98", "assert coprimes(91) == 90", "assert coprimes(39) == 39", "assert coprimes(177) == 174", "assert coprimes(59) == 58", "assert coprimes(1) == 1"], "test_code": "assert coprimes(141) == 139\nassert coprimes(99) == 98\nassert coprimes(91) == 90\nassert coprimes(39) == 39\nassert coprimes(177) == 174\nassert coprimes(59) == 58\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 59) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 59) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 59 في أي قاسم أكبر من 1.\nمثال: `coprimes(141) == 139`\nالجواب:", "qhash": "4d4d6f420f3a8303"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 13\nfor i in range(7, 19, 1):\n    total += i * 7\nprint(total)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 13\nfor i in range(7, 19, 1):\n    total += i * 7\nprint(total)\nprint(i)\n```\nالجواب:", "qhash": "455d523e8e24745e", "answer": "1063\n18", "completion": " الناتج:\n```text\n1063\n18\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "best_multiple", "reference": "def best_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert best_multiple([-29, 45, -20, 36, 41, 49, -12, 20]) == 36", "assert best_multiple([-6, -10, -10]) == -6", "assert best_multiple([1, 3]) == None", "assert best_multiple([-31, -19, 27, -14, -31, -11, -6, 40]) == 40", "assert best_multiple([-16, -2, 44, -5, -49]) == 44", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([-29, 45, -20, 36, 41, 49, -12, 20]) == 36\nassert best_multiple([-6, -10, -10]) == -6\nassert best_multiple([1, 3]) == None\nassert best_multiple([-31, -19, 27, -14, -31, -11, -6, 40]) == 40\nassert best_multiple([-16, -2, 44, -5, -49]) == 44\nassert best_multiple([]) == None", "answer": "def best_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef best_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def best_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 2 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef best_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 2 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `best_multiple([-29, 45, -20, 36, 41, 49, -12, 20]) == 36`\nالجواب:", "qhash": "8404742f119ed2ff"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "turn_list", "reference": "def turn_list(items):\n    if not items:\n        return []\n    k = 20 % len(items)\n    return items[k:] + items[:k]", "tests": ["assert turn_list([22, 23, 0]) == [0, 22, 23]", "assert turn_list([38, 43, 24, 43, 17, 30, 33, -8, -4]) == [24, 43, 17, 30, 33, -8, -4, 38, 43]", "assert turn_list([23, 23, 22, 2, -5]) == [23, 23, 22, 2, -5]", "assert turn_list([1, 24, 19]) == [19, 1, 24]", "assert turn_list([36]) == [36]", "assert turn_list([28, 33, 8, 40, 42]) == [28, 33, 8, 40, 42]", "assert turn_list([]) == []"], "test_code": "assert turn_list([22, 23, 0]) == [0, 22, 23]\nassert turn_list([38, 43, 24, 43, 17, 30, 33, -8, -4]) == [24, 43, 17, 30, 33, -8, -4, 38, 43]\nassert turn_list([23, 23, 22, 2, -5]) == [23, 23, 22, 2, -5]\nassert turn_list([1, 24, 19]) == [19, 1, 24]\nassert turn_list([36]) == [36]\nassert turn_list([28, 33, 8, 40, 42]) == [28, 33, 8, 40, 42]\nassert turn_list([]) == []", "answer": "def turn_list(items):\n    if not items:\n        return []\n    k = 20 % len(items)\n    return items[k:] + items[:k]", "completion": " ```python\ndef turn_list(items):\n    if not items:\n        return []\n    k = 20 % len(items)\n    return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef turn_list(items):\n    if not items:\n        return []\n    k = 20 % len(items)\n    return ____\n```\nمثال: `turn_list([22, 23, 0]) == [0, 22, 23]`\nالجواب:", "qhash": "3125d7e0d58c27a0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return -2 * x ** 2 + (9) * x + (7)", "tests": ["assert p(7) == -28", "assert p(17) == -418", "assert p(10) == -103", "assert p(15) == -308", "assert p(3) == 16", "assert p(-10) == -283", "assert p(-18) == -803", "assert p(0) == 7"], "test_code": "assert p(7) == -28\nassert p(17) == -418\nassert p(10) == -103\nassert p(15) == -308\nassert p(3) == 16\nassert p(-10) == -283\nassert p(-18) == -803\nassert p(0) == 7", "answer": "def p(x):\n    return -2 * x ** 2 + (9) * x + (7)", "completion": " ```python\ndef p(x):\n    return -2 * x ** 2 + (9) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -2x² + 9x + 7.\nمثال: `p(7) == -28`\nالجواب:", "qhash": "254dd440cb490b18"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_counts", "reference": "def char_counts(s):\n    return {c: s.count(c) for c in 'ert'}", "tests": ["assert char_counts('pixel by we') == {'e': 2, 'r': 0, 't': 0}", "assert char_counts('cloud code up signal') == {'e': 1, 'r': 0, 't': 0}", "assert char_counts('music garden vector camel') == {'e': 3, 'r': 2, 't': 1}", "assert char_counts('python light matrix brain') == {'e': 0, 'r': 2, 't': 3}", "assert char_counts('music stone to') == {'e': 1, 'r': 0, 't': 2}", "assert char_counts('camel planet') == {'e': 2, 'r': 0, 't': 1}", "assert char_counts('') == {'e': 0, 'r': 0, 't': 0}"], "test_code": "assert char_counts('pixel by we') == {'e': 2, 'r': 0, 't': 0}\nassert char_counts('cloud code up signal') == {'e': 1, 'r': 0, 't': 0}\nassert char_counts('music garden vector camel') == {'e': 3, 'r': 2, 't': 1}\nassert char_counts('python light matrix brain') == {'e': 0, 'r': 2, 't': 3}\nassert char_counts('music stone to') == {'e': 1, 'r': 0, 't': 2}\nassert char_counts('camel planet') == {'e': 2, 'r': 0, 't': 1}\nassert char_counts('') == {'e': 0, 'r': 0, 't': 0}", "answer": "def char_counts(s):\n    return {c: s.count(c) for c in 'ert'}", "completion": " ```python\ndef char_counts(s):\n    return {c: s.count(c) for c in 'ert'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_counts` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'r'، 't' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_counts('pixel by we') == {'e': 2, 'r': 0, 't': 0}`\nالجواب:", "qhash": "7113787065bd332a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 83340\nsteps = 0\nwhile m > 14:\n    m = m // 2\n    steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 83340\nsteps = 0\nwhile m > 14:\n    m = m // 2\n    steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "051b362f32b9e881", "answer": "10 13", "completion": " الناتج:\n```text\n10 13\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=6):\n    if x > y:\n        return x * -1 - y\n    return x + y * -1\n\nprint(calc(8))\nprint(calc(8, 14))\nprint(calc(calc(14), 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=6):\n    if x > y:\n        return x * -1 - y\n    return x + y * -1\n\nprint(calc(8))\nprint(calc(8, 14))\nprint(calc(calc(14), 8))\n```\nالجواب:", "qhash": "8440c4e8218a3ab2", "answer": "-14\n-6\n-28", "completion": " الناتج:\n```text\n-14\n-6\n-28\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n < 10:\n        return n\n    return n % 10 + rec(n // 10)\n\nprint(rec(636470429))\nprint(rec(rec(636470429)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n < 10:\n        return n\n    return n % 10 + rec(n // 10)\n\nprint(rec(636470429))\nprint(rec(rec(636470429)))\n```\nالجواب:", "qhash": "bd5fc2b4ccedcc51", "answer": "41\n5", "completion": " الناتج:\n```text\n41\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([5, 83, 15, 81, 9, 74, 62, 79, 2, 28]) == [5, 88, 103, 184, 0, 74, 136, 0, 2, 30]", "assert reset_sum([149]) == [149]", "assert reset_sum([]) == []", "assert reset_sum([46, 15, 104, 112, 43, 133, 83, 94, 183]) == [46, 61, 165, 0, 43, 176, 0, 94, 0]", "assert reset_sum([66, 12, 120, 21, 47]) == [66, 78, 0, 21, 68]", "assert reset_sum([19, 57, 101, 186, 28, 123, 85, 33]) == [19, 76, 177, 0, 28, 151, 0, 33]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([5, 83, 15, 81, 9, 74, 62, 79, 2, 28]) == [5, 88, 103, 184, 0, 74, 136, 0, 2, 30]\nassert reset_sum([149]) == [149]\nassert reset_sum([]) == []\nassert reset_sum([46, 15, 104, 112, 43, 133, 83, 94, 183]) == [46, 61, 165, 0, 43, 176, 0, 94, 0]\nassert reset_sum([66, 12, 120, 21, 47]) == [66, 78, 0, 21, 68]\nassert reset_sum([19, 57, 101, 186, 28, 123, 85, 33]) == [19, 76, 177, 0, 28, 151, 0, 33]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 188 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([5, 83, 15, 81, 9, 74, 62, 79, 2, 28]) == [5, 88, 103, 184, 0, 74, 136, 0, 2, 30]`\nالجواب:", "qhash": "98741a88d94e205a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([34, -22, -15, 23, -19, 54, -5]) == 54", "assert max_multiple([-15, -6, -3]) == -3", "assert max_multiple([1, 4]) == None", "assert max_multiple([12, 33, 15, 3, -36, 19]) == 33", "assert max_multiple([-44, -9, 0, -17, -42]) == 0", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([34, -22, -15, 23, -19, 54, -5]) == 54\nassert max_multiple([-15, -6, -3]) == -3\nassert max_multiple([1, 4]) == None\nassert max_multiple([12, 33, 15, 3, -36, 19]) == 33\nassert max_multiple([-44, -9, 0, -17, -42]) == 0\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 3 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 3 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([34, -22, -15, 23, -19, 54, -5]) == 54`\nالجواب:", "qhash": "a7a6f940f4260d70"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 223\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 223\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "4ded8c34ba126f50", "answer": "70", "completion": " الناتج:\n```text\n70\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=7):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(g(-1))\nprint(g(-1, 4))\nprint(g(g(4), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=7):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(g(-1))\nprint(g(-1, 4))\nprint(g(g(4), -1))\n```\nالجواب:", "qhash": "698a94abbf2ec497", "answer": "-15\n-9\n-8", "completion": " الناتج:\n```text\n-15\n-9\n-8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 92:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([44, 37, 29, 4, 35, 31, 41, 2, 13, 27]) == [44, 81, 0, 4, 39, 70, 0, 2, 15, 42]", "assert cumulative([5, 62, 34, 5]) == [5, 67, 0, 5]", "assert cumulative([48, 16, 78, 20, -2, 74, 20, 27, 51]) == [48, 64, 0, 20, 18, 92, 0, 27, 78]", "assert cumulative([70, 22, 26, 68, 82, 80, -5, -7]) == [70, 92, 0, 68, 0, 80, 75, 68]", "assert cumulative([86, 49, 52, -2, 33, 52, 0, 68, 61, 15]) == [86, 0, 52, 50, 83, 0, 0, 68, 0, 15]", "assert cumulative([]) == []", "assert cumulative([]) == []"], "test_code": "assert cumulative([44, 37, 29, 4, 35, 31, 41, 2, 13, 27]) == [44, 81, 0, 4, 39, 70, 0, 2, 15, 42]\nassert cumulative([5, 62, 34, 5]) == [5, 67, 0, 5]\nassert cumulative([48, 16, 78, 20, -2, 74, 20, 27, 51]) == [48, 64, 0, 20, 18, 92, 0, 27, 78]\nassert cumulative([70, 22, 26, 68, 82, 80, -5, -7]) == [70, 92, 0, 68, 0, 80, 75, 68]\nassert cumulative([86, 49, 52, -2, 33, 52, 0, 68, 61, 15]) == [86, 0, 52, 50, 83, 0, 0, 68, 0, 15]\nassert cumulative([]) == []\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 92:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 92:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 92 (القيمة المسجلة حينها 0).\nمثال: `cumulative([44, 37, 29, 4, 35, 31, 41, 2, 13, 27]) == [44, 81, 0, 4, 39, 70, 0, 2, 15, 42]`\nالجواب:", "qhash": "c2986da7e1a7054b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_hits", "reference": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)", "tests": ["assert letter_hits('معلم سوق سيارة صديق باب حاسوب سماء لغة') == 0", "assert letter_hits('رمل عربية معلم ليل') == 0", "assert letter_hits('خبز علم ميناء مطر بيت معلم جمل') == 1", "assert letter_hits('طائرة فجر شجرة مدرسة') == 2", "assert letter_hits('نور') == 0", "assert letter_hits('') == 0", "assert letter_hits('برتقال سفينة طالب صديق نور ماء طائرة') == 0", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('معلم سوق سيارة صديق باب حاسوب سماء لغة') == 0\nassert letter_hits('رمل عربية معلم ليل') == 0\nassert letter_hits('خبز علم ميناء مطر بيت معلم جمل') == 1\nassert letter_hits('طائرة فجر شجرة مدرسة') == 2\nassert letter_hits('نور') == 0\nassert letter_hits('') == 0\nassert letter_hits('برتقال سفينة طالب صديق نور ماء طائرة') == 0\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)", "completion": " ```python\ndef letter_hits(text):\n    return sum(1 for w in text.split() if 'ج' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ج» مرة واحدة على الأقل.\nمثال: `letter_hits('معلم سوق سيارة صديق باب حاسوب سماء لغة') == 0`\nالجواب:", "qhash": "d295502385234420"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([-15, 18, -16, 56]) == 56", "assert biggest_mult([-4, -8, -20]) == -4", "assert biggest_mult([1]) == None", "assert biggest_mult([17, 0, -38, 29, 21, -20, -29, 25, 22]) == 0", "assert biggest_mult([31, 9, -25, -42, 6, 34, 9]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-15, 18, -16, 56]) == 56\nassert biggest_mult([-4, -8, -20]) == -4\nassert biggest_mult([1]) == None\nassert biggest_mult([17, 0, -38, 29, 21, -20, -29, 25, 22]) == 0\nassert biggest_mult([31, 9, -25, -42, 6, 34, 9]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 4 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(values):\n    best = None\n    for x in values:\n        if x % 4 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([-15, 18, -16, 56]) == 56`\nالجواب:", "qhash": "633fb5f134e30ddb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n < 2:\n        return n + 2\n    return f(n - 1) + f(n - 2)\n\nprint(f(15))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n < 2:\n        return n + 2\n    return f(n - 1) + f(n - 2)\n\nprint(f(15))\n```\nالجواب:", "qhash": "7044e5d142aa5149", "answer": "2584", "completion": " الناتج:\n```text\n2584\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'هدى': 17, 'راشد': 27, 'سعيد': 12}\nmarks['سعيد'] += 20\nmarks['ليلى'] = 35\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'هدى': 17, 'راشد': 27, 'سعيد': 12}\nmarks['سعيد'] += 20\nmarks['ليلى'] = 35\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('يوسف', -1))\n```\nالجواب:", "qhash": "7df775567e395773", "answer": "4\nليلى\n111\n-1", "completion": " الناتج:\n```text\n4\nليلى\n111\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "mult_sum", "reference": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "tests": ["assert mult_sum(136) == 1699", "assert mult_sum(159) == 2430", "assert mult_sum(45) == 198", "assert mult_sum(229) == 4925", "assert mult_sum(114) == 1204", "assert mult_sum(11) == 8", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(136) == 1699\nassert mult_sum(159) == 2430\nassert mult_sum(45) == 198\nassert mult_sum(229) == 4925\nassert mult_sum(114) == 1204\nassert mult_sum(11) == 8\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)", "completion": " ```python\ndef mult_sum(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `mult_sum` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 8 أو 13 دون باقٍ.\nمثال: `mult_sum(136) == 1699`\nالجواب:", "qhash": "5ff4f96a6d26a7e0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)", "tests": ["assert rel_prime_count(33) == 33", "assert rel_prime_count(167) == 165", "assert rel_prime_count(19) == 19", "assert rel_prime_count(175) == 173", "assert rel_prime_count(21) == 21", "assert rel_prime_count(72) == 72", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(33) == 33\nassert rel_prime_count(167) == 165\nassert rel_prime_count(19) == 19\nassert rel_prime_count(175) == 173\nassert rel_prime_count(21) == 21\nassert rel_prime_count(72) == 72\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 83) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 83 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(33) == 33`\nالجواب:", "qhash": "83b1ed136ab2f4f5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'bs'}", "tests": ["assert count_chars('code code table apple vector') == {'b': 1, 's': 0}", "assert count_chars('code matrix to stone falcon is') == {'b': 0, 's': 2}", "assert count_chars('go pixel in') == {'b': 0, 's': 0}", "assert count_chars('river we code we camel') == {'b': 0, 's': 0}", "assert count_chars('apple river summer') == {'b': 0, 's': 1}", "assert count_chars('stone summer pixel music') == {'b': 0, 's': 3}", "assert count_chars('') == {'b': 0, 's': 0}"], "test_code": "assert count_chars('code code table apple vector') == {'b': 1, 's': 0}\nassert count_chars('code matrix to stone falcon is') == {'b': 0, 's': 2}\nassert count_chars('go pixel in') == {'b': 0, 's': 0}\nassert count_chars('river we code we camel') == {'b': 0, 's': 0}\nassert count_chars('apple river summer') == {'b': 0, 's': 1}\nassert count_chars('stone summer pixel music') == {'b': 0, 's': 3}\nassert count_chars('') == {'b': 0, 's': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'bs'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'bs'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('code code table apple vector') == {'b': 1, 's': 0}`\nالجواب:", "qhash": "3b358dc86be31fe4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 151:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([9, 79, 63, 8, 20, 79, 2, 41, 10, 20]) == [9, 88, 151, 0, 20, 99, 101, 142, 0, 20]", "assert acc_reset([142, -2, 126, 30, 133, 23, 78, 140, 86]) == [142, 140, 0, 30, 0, 23, 101, 0, 86]", "assert acc_reset([91, 59, 57, 6, 26, 21, 111, 22, -9]) == [91, 150, 0, 6, 32, 53, 0, 22, 13]", "assert acc_reset([24, 63, 84, 53]) == [24, 87, 0, 53]", "assert acc_reset([26, 3, 20]) == [26, 29, 49]", "assert acc_reset([81, 10, 57]) == [81, 91, 148]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([9, 79, 63, 8, 20, 79, 2, 41, 10, 20]) == [9, 88, 151, 0, 20, 99, 101, 142, 0, 20]\nassert acc_reset([142, -2, 126, 30, 133, 23, 78, 140, 86]) == [142, 140, 0, 30, 0, 23, 101, 0, 86]\nassert acc_reset([91, 59, 57, 6, 26, 21, 111, 22, -9]) == [91, 150, 0, 6, 32, 53, 0, 22, 13]\nassert acc_reset([24, 63, 84, 53]) == [24, 87, 0, 53]\nassert acc_reset([26, 3, 20]) == [26, 29, 49]\nassert acc_reset([81, 10, 57]) == [81, 91, 148]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 151:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 151:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 151 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([9, 79, 63, 8, 20, 79, 2, 41, 10, 20]) == [9, 88, 151, 0, 20, 99, 101, 142, 0, 20]`\nالجواب:", "qhash": "ee9feb6214ccbaad"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "nums = [-9, 6, 9, 10, 7, -9, -8]\nprint(nums[2:5])\nprint(nums[::-2])\nprint(sum(nums[2:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-9, 6, 9, 10, 7, -9, -8]\nprint(nums[2:5])\nprint(nums[::-2])\nprint(sum(nums[2:5]))\n```\nالجواب:", "qhash": "38c4fcce446704b2", "answer": "[9, 10, 7]\n[-8, 7, 9, -9]\n26", "completion": " الناتج:\n```text\n[9, 10, 7]\n[-8, 7, 9, -9]\n26\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "decode", "reference": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert decode('up cloud stone') == 'fa nwzfo dezyp'", "assert decode('light it apple light') == 'wtrse te laawp wtrse'", "assert decode('light') == 'wtrse'", "assert decode('rocket python river') == 'cznvpe ajeszy ctgpc'", "assert decode('desert vector Hello') == 'opdpce gpnezc Hpwwz'", "assert decode('on brain A1') == 'zy mclty A1'", "assert decode('') == ''"], "test_code": "assert decode('up cloud stone') == 'fa nwzfo dezyp'\nassert decode('light it apple light') == 'wtrse te laawp wtrse'\nassert decode('light') == 'wtrse'\nassert decode('rocket python river') == 'cznvpe ajeszy ctgpc'\nassert decode('desert vector Hello') == 'opdpce gpnezc Hpwwz'\nassert decode('on brain A1') == 'zy mclty A1'\nassert decode('') == ''", "answer": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-15)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `decode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 15 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('up cloud stone') == 'fa nwzfo dezyp'`\nالجواب:", "qhash": "e633bbb57292ca61"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'زينب': 28, 'سعيد': 49, 'منى': 3, 'فيصل': 35, 'عمر': 24}\nscores['منى'] += 20\nscores['رنا'] = 22\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('سلمى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'زينب': 28, 'سعيد': 49, 'منى': 3, 'فيصل': 35, 'عمر': 24}\nscores['منى'] += 20\nscores['رنا'] = 22\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('سلمى', -1))\n```\nالجواب:", "qhash": "3e53325f96f5315e", "answer": "6\nسعيد\n181\n-1", "completion": " الناتج:\n```text\n6\nسعيد\n181\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 68) == 1)", "tests": ["assert phi_upto(51) == 24", "assert phi_upto(130) == 61", "assert phi_upto(166) == 78", "assert phi_upto(168) == 79", "assert phi_upto(23) == 11", "assert phi_upto(28) == 13", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(51) == 24\nassert phi_upto(130) == 61\nassert phi_upto(166) == 78\nassert phi_upto(168) == 79\nassert phi_upto(23) == 11\nassert phi_upto(28) == 13\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 68) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 68) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 68 في أي قاسم أكبر من 1.\nمثال: `phi_upto(51) == 24`\nالجواب:", "qhash": "1d1631ad29b0985e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return 2 * x ** 2 + (8) * x + (7)", "tests": ["assert evaluate(3) == 49", "assert evaluate(-10) == 127", "assert evaluate(7) == 161", "assert evaluate(-16) == 391", "assert evaluate(-12) == 199", "assert evaluate(-7) == 49", "assert evaluate(12) == 391", "assert evaluate(0) == 7"], "test_code": "assert evaluate(3) == 49\nassert evaluate(-10) == 127\nassert evaluate(7) == 161\nassert evaluate(-16) == 391\nassert evaluate(-12) == 199\nassert evaluate(-7) == 49\nassert evaluate(12) == 391\nassert evaluate(0) == 7", "answer": "def evaluate(x):\n    return 2 * x ** 2 + (8) * x + (7)", "completion": " ```python\ndef evaluate(x):\n    return 2 * x ** 2 + (8) * x + (7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 2x² + 8x + 7.\nمثال: `evaluate(3) == 49`\nالجواب:", "qhash": "85ee281738315d8e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x ** 2 - 10 for x in range(3, 11) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x ** 2 - 10 for x in range(3, 11) if x % 3 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "5319025731a3dbde", "answer": "[6, 39, 90]\n3 135", "completion": " الناتج:\n```text\n[6, 39, 90]\n3 135\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'هشام': 17, 'أحمد': 6, 'فيصل': 37, 'نور': 34}\nscores['نور'] += 1\nscores['ليلى'] = 33\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(sorted(scores.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'هشام': 17, 'أحمد': 6, 'فيصل': 37, 'نور': 34}\nscores['نور'] += 1\nscores['ليلى'] = 33\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(sorted(scores.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "d0310cb7f4d773fb", "answer": "5\nفيصل\n128\n[('أحمد', 6), ('هشام', 17)]", "completion": " الناتج:\n```text\n5\nفيصل\n128\n[('أحمد', 6), ('هشام', 17)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "pow_digits", "reference": "def pow_digits(n):\n    return sum(int(d) ** 2 for d in str(n)) % 15", "tests": ["assert pow_digits(78390) == 8", "assert pow_digits(110806) == 12", "assert pow_digits(185601) == 7", "assert pow_digits(705797) == 13", "assert pow_digits(791277) == 8", "assert pow_digits(838330) == 5", "assert pow_digits(65562) == 6", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(78390) == 8\nassert pow_digits(110806) == 12\nassert pow_digits(185601) == 7\nassert pow_digits(705797) == 13\nassert pow_digits(791277) == 8\nassert pow_digits(838330) == 5\nassert pow_digits(65562) == 6\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n    return sum(int(d) ** 2 for d in str(n)) % 15", "completion": " ```python\ndef pow_digits(n):\n    return sum(int(d) ** 2 for d in str(n)) % 15\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pow_digits` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 15.\nمثال: `pow_digits(78390) == 8`\nالجواب:", "qhash": "d9ecc0379c1510f9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_matching", "reference": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert count_matching([47, 32, 32, 60, 12, 24]) == 0", "assert count_matching([-20]) == 0", "assert count_matching([49, 37, 14, 62, 78]) == 0", "assert count_matching([]) == 0", "assert count_matching([57, -30, -12, 20, 77, -3]) == 1", "assert count_matching([17, 25, 83]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([47, 32, 32, 60, 12, 24]) == 0\nassert count_matching([-20]) == 0\nassert count_matching([49, 37, 14, 62, 78]) == 0\nassert count_matching([]) == 0\nassert count_matching([57, -30, -12, 20, 77, -3]) == 1\nassert count_matching([17, 25, 83]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_matching([47, 32, 32, 60, 12, 24]) == 0`\nالجواب:", "qhash": "d38513dd0dd20697"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('light orange coffee') == 'nkijv qtcpig eqhhgg'", "assert shift_letters('summer python it 2024') == 'uwoogt ravjqp kv 2024'", "assert shift_letters('stone up window Hello') == 'uvqpg wr ykpfqy Hgnnq'", "assert shift_letters('of music by') == 'qh owuke da'", "assert shift_letters('light code data it') == 'nkijv eqfg fcvc kv'", "assert shift_letters('on desert 2024') == 'qp fgugtv 2024'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('light orange coffee') == 'nkijv qtcpig eqhhgg'\nassert shift_letters('summer python it 2024') == 'uwoogt ravjqp kv 2024'\nassert shift_letters('stone up window Hello') == 'uvqpg wr ykpfqy Hgnnq'\nassert shift_letters('of music by') == 'qh owuke da'\nassert shift_letters('light code data it') == 'nkijv eqfg fcvc kv'\nassert shift_letters('on desert 2024') == 'qp fgugtv 2024'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('light orange coffee') == 'nkijv qtcpig eqhhgg'`\nالجواب:", "qhash": "457d15f77fa11960"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 52) == 1)", "tests": ["assert rel_prime_count(117) == 54", "assert rel_prime_count(39) == 18", "assert rel_prime_count(58) == 27", "assert rel_prime_count(55) == 26", "assert rel_prime_count(156) == 72", "assert rel_prime_count(181) == 84", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(117) == 54\nassert rel_prime_count(39) == 18\nassert rel_prime_count(58) == 27\nassert rel_prime_count(55) == 26\nassert rel_prime_count(156) == 72\nassert rel_prime_count(181) == 84\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 52) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 52) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 52 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(117) == 54`\nالجواب:", "qhash": "3b005a43ba55638b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "eval_poly", "reference": "def eval_poly(x):\n    return -3 * x ** 2 + (0) * x + (-7)", "tests": ["assert eval_poly(8) == -199", "assert eval_poly(14) == -595", "assert eval_poly(-12) == -439", "assert eval_poly(-17) == -874", "assert eval_poly(-17) == -874", "assert eval_poly(7) == -154", "assert eval_poly(-17) == -874", "assert eval_poly(0) == -7"], "test_code": "assert eval_poly(8) == -199\nassert eval_poly(14) == -595\nassert eval_poly(-12) == -439\nassert eval_poly(-17) == -874\nassert eval_poly(-17) == -874\nassert eval_poly(7) == -154\nassert eval_poly(-17) == -874\nassert eval_poly(0) == -7", "answer": "def eval_poly(x):\n    return -3 * x ** 2 + (0) * x + (-7)", "completion": " ```python\ndef eval_poly(x):\n    return -3 * x ** 2 + (0) * x + (-7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `eval_poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -3x² + 0x - 7.\nمثال: `eval_poly(8) == -199`\nالجواب:", "qhash": "a221e185d880a6e8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'شمس حاسوب'\nprint(len(s.replace(' ', '')))\nprint(s.replace(' ', '-'))\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'شمس حاسوب'\nprint(len(s.replace(' ', '')))\nprint(s.replace(' ', '-'))\nprint(len(s))\n```\nالجواب:", "qhash": "c90b2d24aa0dc74d", "answer": "8\nشمس-حاسوب\n9", "completion": " الناتج:\n```text\n8\nشمس-حاسوب\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 35:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([14, 19, 11, 22, 6, 21, 16, 18, 22]) == [14, 33, 0, 22, 28, 0, 16, 34, 0]", "assert acc_reset([28, 22, 13, -7, 28, 29, 7]) == [28, 0, 13, 6, 34, 0, 7]", "assert acc_reset([-9, 20, 0, -6, 28, 27, 18]) == [-9, 11, 11, 5, 33, 0, 18]", "assert acc_reset([29, 11, 19, 28]) == [29, 0, 19, 0]", "assert acc_reset([22]) == [22]", "assert acc_reset([35, 22, 24, 16, 4, 20]) == [35, 0, 24, 0, 4, 24]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([14, 19, 11, 22, 6, 21, 16, 18, 22]) == [14, 33, 0, 22, 28, 0, 16, 34, 0]\nassert acc_reset([28, 22, 13, -7, 28, 29, 7]) == [28, 0, 13, 6, 34, 0, 7]\nassert acc_reset([-9, 20, 0, -6, 28, 27, 18]) == [-9, 11, 11, 5, 33, 0, 18]\nassert acc_reset([29, 11, 19, 28]) == [29, 0, 19, 0]\nassert acc_reset([22]) == [22]\nassert acc_reset([35, 22, 24, 16, 4, 20]) == [35, 0, 24, 0, 4, 24]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 35:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 35:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 35 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([14, 19, 11, 22, 6, 21, 16, 18, 22]) == [14, 33, 0, 22, 28, 0, 16, 34, 0]`\nالجواب:", "qhash": "ae5c4e36d2cbf074"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 4 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(7) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']", "assert play(1) == ['1']", "assert play(12) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac']", "assert play(8) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac']", "assert play(17) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac', '17']"], "test_code": "assert play(7) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']\nassert play(1) == ['1']\nassert play(12) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac']\nassert play(8) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac']\nassert play(17) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7', 'Tac', 'Tic', '10', '11', 'TicTac', '13', '14', 'Tic', 'Tac', '17']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 4 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Tic'\n        if i % 4 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Tic'، مضاعفات 4 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(7) == ['1', '2', 'Tic', 'Tac', '5', 'Tic', '7']`\nالجواب:", "qhash": "36c17d8f1c33fa19"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('to planet to it') == 'lg hdsfwl lg al'", "assert shift_letters('python a signal OK') == 'hqlzgf s kayfsd OK'", "assert shift_letters('desert on python is light OK') == 'vwkwjl gf hqlzgf ak dayzl OK'", "assert shift_letters('orange stone vector brain') == 'gjsfyw klgfw nwulgj tjsaf'", "assert shift_letters('vector matrix we by winter 2024') == 'nwulgj esljap ow tq oaflwj 2024'", "assert shift_letters('engine') == 'wfyafw'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('to planet to it') == 'lg hdsfwl lg al'\nassert shift_letters('python a signal OK') == 'hqlzgf s kayfsd OK'\nassert shift_letters('desert on python is light OK') == 'vwkwjl gf hqlzgf ak dayzl OK'\nassert shift_letters('orange stone vector brain') == 'gjsfyw klgfw nwulgj tjsaf'\nassert shift_letters('vector matrix we by winter 2024') == 'nwulgj esljap ow tq oaflwj 2024'\nassert shift_letters('engine') == 'wfyafw'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('to planet to it') == 'lg hdsfwl lg al'`\nالجواب:", "qhash": "4925b5bd3c3c9afd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate", "reference": "def rotate(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[k:] + arr[:k]", "tests": ["assert rotate([36, 1, 19, 44, 41]) == [36, 1, 19, 44, 41]", "assert rotate([-7, 26, 48, -5, 10, 17, 33, -5, 15]) == [48, -5, 10, 17, 33, -5, 15, -7, 26]", "assert rotate([0, -4, 1, -8, 23, -5, 30, 48, 38, 11]) == [0, -4, 1, -8, 23, -5, 30, 48, 38, 11]", "assert rotate([3, 45, 28, 9, 22, 20, 32, 38, 41]) == [28, 9, 22, 20, 32, 38, 41, 3, 45]", "assert rotate([-6, 30, 11, 35, 24, 36, 36, 33, 3, 9, 42]) == [9, 42, -6, 30, 11, 35, 24, 36, 36, 33, 3]", "assert rotate([-6, 16, 29]) == [29, -6, 16]", "assert rotate([]) == []"], "test_code": "assert rotate([36, 1, 19, 44, 41]) == [36, 1, 19, 44, 41]\nassert rotate([-7, 26, 48, -5, 10, 17, 33, -5, 15]) == [48, -5, 10, 17, 33, -5, 15, -7, 26]\nassert rotate([0, -4, 1, -8, 23, -5, 30, 48, 38, 11]) == [0, -4, 1, -8, 23, -5, 30, 48, 38, 11]\nassert rotate([3, 45, 28, 9, 22, 20, 32, 38, 41]) == [28, 9, 22, 20, 32, 38, 41, 3, 45]\nassert rotate([-6, 30, 11, 35, 24, 36, 36, 33, 3, 9, 42]) == [9, 42, -6, 30, 11, 35, 24, 36, 36, 33, 3]\nassert rotate([-6, 16, 29]) == [29, -6, 16]\nassert rotate([]) == []", "answer": "def rotate(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return ____\n```\nمثال: `rotate([36, 1, 19, 44, 41]) == [36, 1, 19, 44, 41]`\nالجواب:", "qhash": "01caeb5a1ec81253"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 22:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([2, 16, 4, 16, 9, 10]) == [2, 18, 22, 0, 9, 19]", "assert reset_sum([]) == []", "assert reset_sum([-6, -7]) == [-6, -13]", "assert reset_sum([-2, 0, 4, 14, 12]) == [-2, -2, 2, 16, 0]", "assert reset_sum([9, 14]) == [9, 0]", "assert reset_sum([8, 19]) == [8, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([2, 16, 4, 16, 9, 10]) == [2, 18, 22, 0, 9, 19]\nassert reset_sum([]) == []\nassert reset_sum([-6, -7]) == [-6, -13]\nassert reset_sum([-2, 0, 4, 14, 12]) == [-2, -2, 2, 16, 0]\nassert reset_sum([9, 14]) == [9, 0]\nassert reset_sum([8, 19]) == [8, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 22:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 22:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 22 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([2, 16, 4, 16, 9, 10]) == [2, 18, 22, 0, 9, 19]`\nالجواب:", "qhash": "731f7405dfc8711c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 1025\ncount = 0\nwhile n > 14:\n    n = n // 8\n    count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 1025\ncount = 0\nwhile n > 14:\n    n = n // 8\n    count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "e9f72efb95dc8719", "answer": "2 3", "completion": " الناتج:\n```text\n2 3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n <= 0:\n        return 1\n    return 3 * go(n - 1) + -3\n\nprint(go(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n <= 0:\n        return 1\n    return 3 * go(n - 1) + -3\n\nprint(go(9))\n```\nالجواب:", "qhash": "05f5b072ec0b623f", "answer": "-9840", "completion": " الناتج:\n```text\n-9840\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "only_div", "reference": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert only_div([41, 21, 22, 16, 41, 0, 87, 68, 8, 76, 71]) == 1", "assert only_div([43, -40]) == 0", "assert only_div([-26, -17, -7, 85, 40, 43, 33, 20, 35, -40]) == 1", "assert only_div([]) == 0", "assert only_div([-8, 26, 48, -34, 20, 30, 26, 81, 61, 9, 18]) == 5", "assert only_div([-32, 17, 29, -19, 84, 31, 56, 83, -12]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([41, 21, 22, 16, 41, 0, 87, 68, 8, 76, 71]) == 1\nassert only_div([43, -40]) == 0\nassert only_div([-26, -17, -7, 85, 40, 43, 33, 20, 35, -40]) == 1\nassert only_div([]) == 0\nassert only_div([-8, 26, 48, -34, 20, 30, 26, 81, 61, 9, 18]) == 5\nassert only_div([-32, 17, 29, -19, 84, 31, 56, 83, -12]) == 0\nassert only_div([]) == 0", "answer": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `only_div([41, 21, 22, 16, 41, 0, 87, 68, 8, 76, 71]) == 1`\nالجواب:", "qhash": "d0bec41d6a64a6ad"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "caesar", "reference": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert caesar('table') == 'yfgqj'", "assert caesar('table vector banana falcon') == 'yfgqj ajhytw gfsfsf kfqhts'", "assert caesar('an up winter by code') == 'fs zu bnsyjw gd htij'", "assert caesar('we summer to A1') == 'bj xzrrjw yt A1'", "assert caesar('banana by light an up') == 'gfsfsf gd qnlmy fs zu'", "assert caesar('orange signal') == 'twfslj xnlsfq'", "assert caesar('') == ''"], "test_code": "assert caesar('table') == 'yfgqj'\nassert caesar('table vector banana falcon') == 'yfgqj ajhytw gfsfsf kfqhts'\nassert caesar('an up winter by code') == 'fs zu bnsyjw gd htij'\nassert caesar('we summer to A1') == 'bj xzrrjw yt A1'\nassert caesar('banana by light an up') == 'gfsfsf gd qnlmy fs zu'\nassert caesar('orange signal') == 'twfslj xnlsfq'\nassert caesar('') == ''", "answer": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `caesar` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('table') == 'yfgqj'`\nالجواب:", "qhash": "a944cbf8c1b6145b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=9):\n    if x > y:\n        return x * 4 - y\n    return x + y * 4\n\nprint(calc(-2))\nprint(calc(-2, -5))\nprint(calc(calc(-5), -2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=9):\n    if x > y:\n        return x * 4 - y\n    return x + y * 4\n\nprint(calc(-2))\nprint(calc(-2, -5))\nprint(calc(calc(-5), -2))\n```\nالجواب:", "qhash": "6b6181cae7319822", "answer": "34\n-3\n126", "completion": " الناتج:\n```text\n34\n-3\n126\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=6):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(compute(4))\nprint(compute(4, -6))\nprint(compute(compute(-6), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=6):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(compute(4))\nprint(compute(4, -6))\nprint(compute(compute(-6), 4))\n```\nالجواب:", "qhash": "34c2873c7ce63645", "answer": "22\n18\n32", "completion": " الناتج:\n```text\n22\n18\n32\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 15\nfor n in range(6, 12, 4):\n    result += n * 6\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 15\nfor n in range(6, 12, 4):\n    result += n * 6\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "530a4882d471e94f", "answer": "111\n10", "completion": " الناتج:\n```text\n111\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizz", "reference": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', '10', 'Tac', '12', '13', 'Tic', '15', '16', '17', '18', '19', '20', 'Tic', 'Tac', '23', '24', '25', '26']", "assert fizz(1) == ['1']", "assert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Tic', '8']", "assert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Tic', '8']", "assert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Tic']"], "test_code": "assert fizz(26) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', '10', 'Tac', '12', '13', 'Tic', '15', '16', '17', '18', '19', '20', 'Tic', 'Tac', '23', '24', '25', '26']\nassert fizz(1) == ['1']\nassert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Tic', '8']\nassert fizz(8) == ['1', '2', '3', '4', '5', '6', 'Tic', '8']\nassert fizz(7) == ['1', '2', '3', '4', '5', '6', 'Tic']", "answer": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Tic'، مضاعفات 11 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizz(26) == ['1', '2', '3', '4', '5', '6', 'Tic', '8', '9', '10', 'Tac', '12', '13', 'Tic', '15', '16', '17', '18', '19', '20', 'Tic', 'Tac', '23', '24', '25', '26']`\nالجواب:", "qhash": "194df3b19360f89f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * -1 + -2 for x in range(3, 10) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * -1 + -2 for x in range(3, 10) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "77d625a8a6f7a9d7", "answer": "[-7, -10]\n2 -17", "completion": " الناتج:\n```text\n[-7, -10]\n2 -17\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_div", "reference": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "tests": ["assert sum_div(164) == 5799", "assert sum_div(169) == 6132", "assert sum_div(227) == 11091", "assert sum_div(195) == 7941", "assert sum_div(103) == 2310", "assert sum_div(275) == 16107", "assert sum_div(1) == 0"], "test_code": "assert sum_div(164) == 5799\nassert sum_div(169) == 6132\nassert sum_div(227) == 11091\nassert sum_div(195) == 7941\nassert sum_div(103) == 2310\nassert sum_div(275) == 16107\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)", "completion": " ```python\ndef sum_div(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 7 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_div` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 7 دون باقٍ.\nمثال: `sum_div(164) == 5799`\nالجواب:", "qhash": "2cb60fc0b5ae4b18"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 11", "tests": ["assert prod_mod(6) == 1", "assert prod_mod(34) == 0", "assert prod_mod(27) == 0", "assert prod_mod(8) == 10", "assert prod_mod(10) == 10", "assert prod_mod(23) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(6) == 1\nassert prod_mod(34) == 0\nassert prod_mod(27) == 0\nassert prod_mod(8) == 10\nassert prod_mod(10) == 10\nassert prod_mod(23) == 0\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 11", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 11\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 11 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(6) == 1`\nالجواب:", "qhash": "c85f8462377a3073"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 1)) % 23", "tests": ["assert mfact(5) == 5", "assert mfact(53) == 0", "assert mfact(21) == 1", "assert mfact(3) == 6", "assert mfact(45) == 0", "assert mfact(1) == 1", "assert mfact(0) == 1"], "test_code": "assert mfact(5) == 5\nassert mfact(53) == 0\nassert mfact(21) == 1\nassert mfact(3) == 6\nassert mfact(45) == 0\nassert mfact(1) == 1\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 1)) % 23", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 1)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(5) == 5`\nالجواب:", "qhash": "6741b1dd053e6a7a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [0, 24, 20, -17, 5, 11, -5]\nprint(sorted(nums, key=lambda x: (abs(x - 0), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [0, 24, 20, -17, 5, 11, -5]\nprint(sorted(nums, key=lambda x: (abs(x - 0), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "65c7a573ddc5f39b", "answer": "[0, -5, 5, 11, -17, 20, 24]\n[24, 20, 11]", "completion": " الناتج:\n```text\n[0, -5, 5, 11, -17, 20, 24]\n[24, 20, 11]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert flip_words('camel garden rocket in signal matrix') == 'matrix|signal|rocket|garden'", "assert flip_words('summer is table music') == 'summer'", "assert flip_words('river window planet we falcon') == 'falcon|planet|window'", "assert flip_words('up desert') == 'desert'", "assert flip_words('light apple python desert') == 'desert|python'", "assert flip_words('it') == ''", "assert flip_words('falcon apple python orange river window river') == 'window|orange|python|falcon'"], "test_code": "assert flip_words('camel garden rocket in signal matrix') == 'matrix|signal|rocket|garden'\nassert flip_words('summer is table music') == 'summer'\nassert flip_words('river window planet we falcon') == 'falcon|planet|window'\nassert flip_words('up desert') == 'desert'\nassert flip_words('light apple python desert') == 'desert|python'\nassert flip_words('it') == ''\nassert flip_words('falcon apple python orange river window river') == 'window|orange|python|falcon'", "answer": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 6 من آخرها إلى أولها، موصولة بالفاصل '|'.\nمثال: `flip_words('camel garden rocket in signal matrix') == 'matrix|signal|rocket|garden'`\nالجواب:", "qhash": "4782b1771a44a513"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n < 2:\n        return n + 2\n    return rec(n - 1) + rec(n - 2)\n\nprint(rec(11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n < 2:\n        return n + 2\n    return rec(n - 1) + rec(n - 2)\n\nprint(rec(11))\n```\nالجواب:", "qhash": "dfd15da54ed8a5b1", "answer": "377", "completion": " الناتج:\n```text\n377\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 4\n    return total", "tests": ["assert series(7) == 23380", "assert series(7) == 23380", "assert series(6) == 11375", "assert series(11) == 199870", "assert series(14) == 638435", "assert series(1) == 5", "assert series(0) == 0"], "test_code": "assert series(7) == 23380\nassert series(7) == 23380\nassert series(6) == 11375\nassert series(11) == 199870\nassert series(14) == 638435\nassert series(1) == 5\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 4\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 5 * i ** 4\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(0, n):\n        total += 5 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 5 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(0, n):\n        total += 5 * i ** 4\n    return total\n```\nمثال: `series(7) == 23380`\nالجواب:", "qhash": "30a2d42eab555e21"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'lo'}", "tests": ["assert letter_stats('pixel by orange camel rocket') == {'l': 2, 'o': 2}", "assert letter_stats('garden of up winter in') == {'l': 0, 'o': 1}", "assert letter_stats('brain apple') == {'l': 1, 'o': 0}", "assert letter_stats('winter light pixel river garden') == {'l': 2, 'o': 0}", "assert letter_stats('on go') == {'l': 0, 'o': 2}", "assert letter_stats('a by desert matrix') == {'l': 0, 'o': 0}", "assert letter_stats('') == {'l': 0, 'o': 0}"], "test_code": "assert letter_stats('pixel by orange camel rocket') == {'l': 2, 'o': 2}\nassert letter_stats('garden of up winter in') == {'l': 0, 'o': 1}\nassert letter_stats('brain apple') == {'l': 1, 'o': 0}\nassert letter_stats('winter light pixel river garden') == {'l': 2, 'o': 0}\nassert letter_stats('on go') == {'l': 0, 'o': 2}\nassert letter_stats('a by desert matrix') == {'l': 0, 'o': 0}\nassert letter_stats('') == {'l': 0, 'o': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'lo'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'lo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'l'، 'o' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('pixel by orange camel rocket') == {'l': 2, 'o': 2}`\nالجواب:", "qhash": "670d3f94586c5e11"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "lst = [11, 20, 8, 35, 2, -8, 32, 8]\nprint(lst[0:6])\nprint(lst[::3])\nprint(len(lst[0:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nlst = [11, 20, 8, 35, 2, -8, 32, 8]\nprint(lst[0:6])\nprint(lst[::3])\nprint(len(lst[0:6]))\n```\nالجواب:", "qhash": "6dd0aad7e4dac9ab", "answer": "[11, 20, 8, 35, 2, -8]\n[11, 35, 32]\n6", "completion": " الناتج:\n```text\n[11, 20, 8, 35, 2, -8]\n[11, 35, 32]\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'river'\nprint(word[-3:])\nprint(word[::-1])\nprint(word.replace('i', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'river'\nprint(word[-3:])\nprint(word[::-1])\nprint(word.replace('i', '#'))\n```\nالجواب:", "qhash": "85dd1599a755d1de", "answer": "ver\nrevir\nr#ver", "completion": " الناتج:\n```text\nver\nrevir\nr#ver\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return 1 * x ** 2 + (6) * x + (6)", "tests": ["assert quad(1) == 13", "assert quad(-18) == 222", "assert quad(-5) == 1", "assert quad(2) == 22", "assert quad(11) == 193", "assert quad(13) == 253", "assert quad(4) == 46", "assert quad(0) == 6"], "test_code": "assert quad(1) == 13\nassert quad(-18) == 222\nassert quad(-5) == 1\nassert quad(2) == 22\nassert quad(11) == 193\nassert quad(13) == 253\nassert quad(4) == 46\nassert quad(0) == 6", "answer": "def quad(x):\n    return 1 * x ** 2 + (6) * x + (6)", "completion": " ```python\ndef quad(x):\n    return 1 * x ** 2 + (6) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 1x² + 6x + 6.\nمثال: `quad(1) == 13`\nالجواب:", "qhash": "563e6fe8bb86d71b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=2):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(f(2))\nprint(f(2, -10))\nprint(f(f(-10), 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=2):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(f(2))\nprint(f(2, -10))\nprint(f(f(-10), 2))\n```\nالجواب:", "qhash": "f3177bc80a94b0c1", "answer": "2\n10\n-10", "completion": " الناتج:\n```text\n2\n10\n-10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "only_div", "reference": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert only_div([64, 17, 6, 31, 24, 90, 33]) == 0", "assert only_div([21, 73, -19, 11, 8, -7, 75, 72, 87, 74]) == 0", "assert only_div([12, 59, 74, -23, -34, 71, -16, 7, -7, -36]) == 0", "assert only_div([42, 70, 20, 75, 80, -2, 9, -14, -27]) == 0", "assert only_div([-31, -21, 40, 28, 7, 79, 90, 52, -35, 81]) == 0", "assert only_div([6, -25]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([64, 17, 6, 31, 24, 90, 33]) == 0\nassert only_div([21, 73, -19, 11, 8, -7, 75, 72, 87, 74]) == 0\nassert only_div([12, 59, 74, -23, -34, 71, -16, 7, -7, -36]) == 0\nassert only_div([42, 70, 20, 75, 80, -2, 9, -14, -27]) == 0\nassert only_div([-31, -21, 40, 28, 7, 79, 90, 52, -35, 81]) == 0\nassert only_div([6, -25]) == 0\nassert only_div([]) == 0", "answer": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `only_div([64, 17, 6, 31, 24, 90, 33]) == 0`\nالجواب:", "qhash": "c44b495b32ec730a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(258) == 12477", "assert add_multiples(231) == 10052", "assert add_multiples(143) == 3902", "assert add_multiples(186) == 6527", "assert add_multiples(75) == 1068", "assert add_multiples(168) == 5292", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(258) == 12477\nassert add_multiples(231) == 10052\nassert add_multiples(143) == 3902\nassert add_multiples(186) == 6527\nassert add_multiples(75) == 1068\nassert add_multiples(168) == 5292\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 14 دون باقٍ.\nمثال: `add_multiples(258) == 12477`\nالجواب:", "qhash": "2af3ecdf3b8e9874"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 143:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([59, 41, 47, 15, 59, 3, 48]) == [59, 100, 0, 15, 74, 77, 125]", "assert cumulative([128, 42]) == [128, 0]", "assert cumulative([50, 67, 96]) == [50, 117, 0]", "assert cumulative([128, 67, 139, 4, 135, 57, 54]) == [128, 0, 139, 143, 0, 57, 111]", "assert cumulative([43, 8, 133, 62, 104]) == [43, 51, 0, 62, 0]", "assert cumulative([112, 53, 124, 83, 90, -7, 39, 23, 126]) == [112, 0, 124, 0, 90, 83, 122, 0, 126]", "assert cumulative([]) == []"], "test_code": "assert cumulative([59, 41, 47, 15, 59, 3, 48]) == [59, 100, 0, 15, 74, 77, 125]\nassert cumulative([128, 42]) == [128, 0]\nassert cumulative([50, 67, 96]) == [50, 117, 0]\nassert cumulative([128, 67, 139, 4, 135, 57, 54]) == [128, 0, 139, 143, 0, 57, 111]\nassert cumulative([43, 8, 133, 62, 104]) == [43, 51, 0, 62, 0]\nassert cumulative([112, 53, 124, 83, 90, -7, 39, 23, 126]) == [112, 0, 124, 0, 90, 83, 122, 0, 126]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 143:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 143:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 143 (القيمة المسجلة حينها 0).\nمثال: `cumulative([59, 41, 47, 15, 59, 3, 48]) == [59, 100, 0, 15, 74, 77, 125]`\nالجواب:", "qhash": "4b12f5a9a8212c30"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n <= 1:\n        return 3\n    return 3 * f(n - 1) + 4\n\nprint(f(3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n <= 1:\n        return 3\n    return 3 * f(n - 1) + 4\n\nprint(f(3))\n```\nالجواب:", "qhash": "b06a934bd1c4ac55", "answer": "43", "completion": " الناتج:\n```text\n43\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(27) == 41", "assert add_multiples(165) == 2337", "assert add_multiples(257) == 5670", "assert add_multiples(167) == 2337", "assert add_multiples(142) == 1724", "assert add_multiples(144) == 1724", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(27) == 41\nassert add_multiples(165) == 2337\nassert add_multiples(257) == 5670\nassert add_multiples(167) == 2337\nassert add_multiples(142) == 1724\nassert add_multiples(144) == 1724\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 9 أو 14 دون باقٍ.\nمثال: `add_multiples(27) == 41`\nالجواب:", "qhash": "69724e11801bae92"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'summer'\nprint(len(word))\nprint(word.index('u') + len(word))\nprint(word[0:5])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'summer'\nprint(len(word))\nprint(word.index('u') + len(word))\nprint(word[0:5])\n```\nالجواب:", "qhash": "3432c53ff264e532", "answer": "6\n7\nsumme", "completion": " الناتج:\n```text\n6\n7\nsumme\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'وليد': 47, 'باسل': 45, 'أحمد': 18}\nd['أحمد'] += 13\nd['حسن'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 27])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'وليد': 47, 'باسل': 45, 'أحمد': 18}\nd['أحمد'] += 13\nd['حسن'] = 46\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 27])\n```\nالجواب:", "qhash": "9d71c4332c27afe9", "answer": "4\nوليد\n169\n['وليد', 'باسل', 'أحمد', 'حسن']", "completion": " الناتج:\n```text\n4\nوليد\n169\n['وليد', 'باسل', 'أحمد', 'حسن']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 95", "tests": ["assert digit_power(18101) == 11", "assert digit_power(489255) == 33", "assert digit_power(881659) == 37", "assert digit_power(155429) == 26", "assert digit_power(50707) == 19", "assert digit_power(886415) == 32", "assert digit_power(458610) == 24", "assert digit_power(0) == 0"], "test_code": "assert digit_power(18101) == 11\nassert digit_power(489255) == 33\nassert digit_power(881659) == 37\nassert digit_power(155429) == 26\nassert digit_power(50707) == 19\nassert digit_power(886415) == 32\nassert digit_power(458610) == 24\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 95", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 95\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 95.\nمثال: `digit_power(18101) == 11`\nالجواب:", "qhash": "fc8959fb89f31afc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=2):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(g(-10))\nprint(g(-10, 9))\nprint(g(g(9), -10))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=2):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(g(-10))\nprint(g(-10, 9))\nprint(g(g(9), -10))\n```\nالجواب:", "qhash": "013cce3e8f3bbf64", "answer": "-16\n-37\n1", "completion": " الناتج:\n```text\n-16\n-37\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 1 for d in str(n)) % 27", "tests": ["assert digit_score(87745) == 4", "assert digit_score(493799) == 14", "assert digit_score(342978) == 6", "assert digit_score(715849) == 7", "assert digit_score(577633) == 4", "assert digit_score(528513) == 24", "assert digit_score(932408) == 26", "assert digit_score(0) == 0"], "test_code": "assert digit_score(87745) == 4\nassert digit_score(493799) == 14\nassert digit_score(342978) == 6\nassert digit_score(715849) == 7\nassert digit_score(577633) == 4\nassert digit_score(528513) == 24\nassert digit_score(932408) == 26\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 1 for d in str(n)) % 27", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 1 for d in str(n)) % 27\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 27.\nمثال: `digit_score(87745) == 4`\nالجواب:", "qhash": "01da6e7f9747af5c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 56) == 1)", "tests": ["assert rel_prime_count(104) == 45", "assert rel_prime_count(176) == 75", "assert rel_prime_count(68) == 29", "assert rel_prime_count(12) == 5", "assert rel_prime_count(16) == 7", "assert rel_prime_count(107) == 46", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(104) == 45\nassert rel_prime_count(176) == 75\nassert rel_prime_count(68) == 29\nassert rel_prime_count(12) == 5\nassert rel_prime_count(16) == 7\nassert rel_prime_count(107) == 46\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 56) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 56) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 56 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(104) == 45`\nالجواب:", "qhash": "3d2be0d1cf3c27fa"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "running_sum", "reference": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 77:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert running_sum([31, 29, 39, 27, 40, 30, 19, 42, 18, 22]) == [31, 60, 0, 27, 67, 0, 19, 61, 0, 22]", "assert running_sum([52, 8, 47, 55, 74, 59, 60, 9, 54, 9]) == [52, 60, 0, 55, 0, 59, 0, 9, 63, 72]", "assert running_sum([1, 58]) == [1, 59]", "assert running_sum([35, -10]) == [35, 25]", "assert running_sum([50, 49, 47, 68]) == [50, 0, 47, 0]", "assert running_sum([43, 76, 12, 48, 40, -2, 55, -7, 1]) == [43, 0, 12, 60, 0, -2, 53, 46, 47]", "assert running_sum([]) == []"], "test_code": "assert running_sum([31, 29, 39, 27, 40, 30, 19, 42, 18, 22]) == [31, 60, 0, 27, 67, 0, 19, 61, 0, 22]\nassert running_sum([52, 8, 47, 55, 74, 59, 60, 9, 54, 9]) == [52, 60, 0, 55, 0, 59, 0, 9, 63, 72]\nassert running_sum([1, 58]) == [1, 59]\nassert running_sum([35, -10]) == [35, 25]\nassert running_sum([50, 49, 47, 68]) == [50, 0, 47, 0]\nassert running_sum([43, 76, 12, 48, 40, -2, 55, -7, 1]) == [43, 0, 12, 60, 0, -2, 53, 46, 47]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 77:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 77:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `running_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 77 (القيمة المسجلة حينها 0).\nمثال: `running_sum([31, 29, 39, 27, 40, 30, 19, 42, 18, 22]) == [31, 60, 0, 27, 67, 0, 19, 61, 0, 22]`\nالجواب:", "qhash": "12c98b74fc0cca0a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([21, 51, -14, 45]) == -14", "assert max_multiple([-8, -8, -10]) == -8", "assert max_multiple([1, 3]) == None", "assert max_multiple([2, 11, 18, -20, -37, 27]) == 18", "assert max_multiple([-17, -5, -37, -30]) == -30", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([21, 51, -14, 45]) == -14\nassert max_multiple([-8, -8, -10]) == -8\nassert max_multiple([1, 3]) == None\nassert max_multiple([2, 11, 18, -20, -37, 27]) == 18\nassert max_multiple([-17, -5, -37, -30]) == -30\nassert max_multiple([]) == None", "answer": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([21, 51, -14, 45]) == -14`\nالجواب:", "qhash": "692098b25622f328"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([30, 43, 34, 55, 57, 65]) == [30, 73, 107, 0, 57, 122]", "assert rolling_total([104, 132, 43, -3, -3, 38]) == [104, 0, 43, 40, 37, 75]", "assert rolling_total([117, 88, 27, 88, 125, 93, 62, 62, 44]) == [117, 0, 27, 115, 0, 93, 0, 62, 106]", "assert rolling_total([2, 77, 9, 138, 87, 31, 13]) == [2, 79, 88, 0, 87, 118, 131]", "assert rolling_total([10, 137, 127, -9, 26, 54]) == [10, 0, 127, 118, 0, 54]", "assert rolling_total([80, 34, 119, 34, 76]) == [80, 114, 0, 34, 110]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([30, 43, 34, 55, 57, 65]) == [30, 73, 107, 0, 57, 122]\nassert rolling_total([104, 132, 43, -3, -3, 38]) == [104, 0, 43, 40, 37, 75]\nassert rolling_total([117, 88, 27, 88, 125, 93, 62, 62, 44]) == [117, 0, 27, 115, 0, 93, 0, 62, 106]\nassert rolling_total([2, 77, 9, 138, 87, 31, 13]) == [2, 79, 88, 0, 87, 118, 131]\nassert rolling_total([10, 137, 127, -9, 26, 54]) == [10, 0, 127, 118, 0, 54]\nassert rolling_total([80, 34, 119, 34, 76]) == [80, 114, 0, 34, 110]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 138 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([30, 43, 34, 55, 57, 65]) == [30, 73, 107, 0, 57, 122]`\nالجواب:", "qhash": "a43ef84e9dae6f48"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'code'\nprint(text[::-1])\nprint(len(text))\nprint(text[-2:])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'code'\nprint(text[::-1])\nprint(len(text))\nprint(text[-2:])\n```\nالجواب:", "qhash": "af5ce2195e681bc1", "answer": "edoc\n4\nde", "completion": " الناتج:\n```text\nedoc\n4\nde\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "tests": ["assert rev_long_words('window coffee go planet river winter by a') == 'winter_planet_coffee_window'", "assert rev_long_words('desert of') == 'desert'", "assert rev_long_words('data window code pixel table') == 'window'", "assert rev_long_words('window by rocket summer a of') == 'summer_rocket_window'", "assert rev_long_words('it') == ''", "assert rev_long_words('river falcon banana') == 'banana_falcon'", "assert rev_long_words('by data desert stone in') == 'desert'"], "test_code": "assert rev_long_words('window coffee go planet river winter by a') == 'winter_planet_coffee_window'\nassert rev_long_words('desert of') == 'desert'\nassert rev_long_words('data window code pixel table') == 'window'\nassert rev_long_words('window by rocket summer a of') == 'summer_rocket_window'\nassert rev_long_words('it') == ''\nassert rev_long_words('river falcon banana') == 'banana_falcon'\nassert rev_long_words('by data desert stone in') == 'desert'", "answer": "def rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 6][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 6 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `rev_long_words('window coffee go planet river winter by a') == 'winter_planet_coffee_window'`\nالجواب:", "qhash": "e24fde0c46e4780f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'سلام خبز'\nprint(s.count('ا'))\nprint(len(s))\nprint(s.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'سلام خبز'\nprint(s.count('ا'))\nprint(len(s))\nprint(s.split())\n```\nالجواب:", "qhash": "da882fb1e916ef44", "answer": "1\n8\n['سلام', 'خبز']", "completion": " الناتج:\n```text\n1\n8\n['سلام', 'خبز']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(g(11))\nprint(g(11, 5))\nprint(g(g(5), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(g(11))\nprint(g(11, 5))\nprint(g(g(5), 11))\n```\nالجواب:", "qhash": "146cace0d7b59220", "answer": "7\n6\n12", "completion": " الناتج:\n```text\n7\n6\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return 5 * x ** 2 + (7) * x + (-6)", "tests": ["assert poly(6) == 216", "assert poly(1) == 6", "assert poly(-13) == 748", "assert poly(10) == 564", "assert poly(-12) == 630", "assert poly(1) == 6", "assert poly(-13) == 748", "assert poly(0) == -6"], "test_code": "assert poly(6) == 216\nassert poly(1) == 6\nassert poly(-13) == 748\nassert poly(10) == 564\nassert poly(-12) == 630\nassert poly(1) == 6\nassert poly(-13) == 748\nassert poly(0) == -6", "answer": "def poly(x):\n    return 5 * x ** 2 + (7) * x + (-6)", "completion": " ```python\ndef poly(x):\n    return 5 * x ** 2 + (7) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 5x² + 7x - 6.\nمثال: `poly(6) == 216`\nالجواب:", "qhash": "8ce89f8ec411ea78"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 31465\ncount = 0\nwhile n > 13:\n    n = n // 7\n    count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 31465\ncount = 0\nwhile n > 13:\n    n = n // 7\n    count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "337ef2eb72295d1f", "answer": "13 4", "completion": " الناتج:\n```text\n13 4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 71", "tests": ["assert fact_mod(11) == 18", "assert fact_mod(42) == 13", "assert fact_mod(25) == 69", "assert fact_mod(6) == 12", "assert fact_mod(32) == 47", "assert fact_mod(35) == 52", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(11) == 18\nassert fact_mod(42) == 13\nassert fact_mod(25) == 69\nassert fact_mod(6) == 12\nassert fact_mod(32) == 47\nassert fact_mod(35) == 52\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 71", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(11) == 18`\nالجواب:", "qhash": "fc9c4592cc8d5454"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'python_engine'\nprint(len(word))\nprint(word[2:6])\nprint(word.find('p'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'python_engine'\nprint(len(word))\nprint(word[2:6])\nprint(word.find('p'))\n```\nالجواب:", "qhash": "84ece0fa4d2071cc", "answer": "13\nthon\n0", "completion": " الناتج:\n```text\n13\nthon\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return -9 * x ** 2 + (9) * x + (9)", "tests": ["assert evaluate(4) == -99", "assert evaluate(20) == -3411", "assert evaluate(-9) == -801", "assert evaluate(-3) == -99", "assert evaluate(-19) == -3411", "assert evaluate(8) == -495", "assert evaluate(11) == -981", "assert evaluate(0) == 9"], "test_code": "assert evaluate(4) == -99\nassert evaluate(20) == -3411\nassert evaluate(-9) == -801\nassert evaluate(-3) == -99\nassert evaluate(-19) == -3411\nassert evaluate(8) == -495\nassert evaluate(11) == -981\nassert evaluate(0) == 9", "answer": "def evaluate(x):\n    return -9 * x ** 2 + (9) * x + (9)", "completion": " ```python\ndef evaluate(x):\n    return -9 * x ** 2 + (9) * x + (9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -9x² + 9x + 9.\nمثال: `evaluate(4) == -99`\nالجواب:", "qhash": "4f6bc782b4cd38b7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(22) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'PingPong', '19', '20', 'Ping', '22']", "assert play(1) == ['1']", "assert play(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'PingPong', '19']", "assert play(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10']", "assert play(8) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8']"], "test_code": "assert play(22) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'PingPong', '19', '20', 'Ping', '22']\nassert play(1) == ['1']\nassert play(19) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'PingPong', '19']\nassert play(10) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10']\nassert play(8) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Ping'، مضاعفات 9 تصبح 'Pong'، المضاعفات المشتركة تصبح 'PingPong'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(22) == ['1', '2', 'Ping', '4', '5', 'Ping', '7', '8', 'PingPong', '10', '11', 'Ping', '13', '14', 'Ping', '16', '17', 'PingPong', '19', '20', 'Ping', '22']`\nالجواب:", "qhash": "feaddcf91abb3d86"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n <= 1:\n        return 1\n    return 2 * rec(n - 1) + 1\n\nprint(rec(3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n <= 1:\n        return 1\n    return 2 * rec(n - 1) + 1\n\nprint(rec(3))\n```\nالجواب:", "qhash": "8164826118c32817", "answer": "7", "completion": " الناتج:\n```text\n7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "s = 'apple'\nprint(s.count('a'))\nprint(s.replace('a', '*'))\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'apple'\nprint(s.count('a'))\nprint(s.replace('a', '*'))\nprint(s.capitalize())\n```\nالجواب:", "qhash": "8908777a2cd80550", "answer": "1\n*pple\nApple", "completion": " الناتج:\n```text\n1\n*pple\nApple\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert mirror_words('camel vector cloud cloud winter') == 'winter-cloud-cloud-vector-camel'", "assert mirror_words('camel in python summer is python of planet') == 'planet-python-summer-python-camel'", "assert mirror_words('coffee python we') == 'python-coffee'", "assert mirror_words('camel music python rocket') == 'rocket-python-music-camel'", "assert mirror_words('pixel') == 'pixel'", "assert mirror_words('engine brain garden') == 'garden-brain-engine'", "assert mirror_words('camel engine') == 'engine-camel'"], "test_code": "assert mirror_words('camel vector cloud cloud winter') == 'winter-cloud-cloud-vector-camel'\nassert mirror_words('camel in python summer is python of planet') == 'planet-python-summer-python-camel'\nassert mirror_words('coffee python we') == 'python-coffee'\nassert mirror_words('camel music python rocket') == 'rocket-python-music-camel'\nassert mirror_words('pixel') == 'pixel'\nassert mirror_words('engine brain garden') == 'garden-brain-engine'\nassert mirror_words('camel engine') == 'engine-camel'", "answer": "def mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `mirror_words('camel vector cloud cloud winter') == 'winter-cloud-cloud-vector-camel'`\nالجواب:", "qhash": "cf67b47a24da0cd7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "total_pow", "reference": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 1\n    return total", "tests": ["assert total_pow(8) == 396", "assert total_pow(1) == 11", "assert total_pow(14) == 1155", "assert total_pow(4) == 110", "assert total_pow(5) == 165", "assert total_pow(1) == 11", "assert total_pow(0) == 0"], "test_code": "assert total_pow(8) == 396\nassert total_pow(1) == 11\nassert total_pow(14) == 1155\nassert total_pow(4) == 110\nassert total_pow(5) == 165\nassert total_pow(1) == 11\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 1\n    return total", "completion": " ```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 1\n    return total\n```\n", "buggy": "def total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 11 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 11 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n):\n        total += 11 * i ** 1\n    return total\n```\nمثال: `total_pow(8) == 396`\nالجواب:", "qhash": "31ae7cd7611ebab4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=5):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(compute(-8))\nprint(compute(-8, 12))\nprint(compute(compute(12), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=5):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(compute(-8))\nprint(compute(-8, 12))\nprint(compute(compute(12), -8))\n```\nالجواب:", "qhash": "79b23239437d91d4", "answer": "-8\n-8\n8", "completion": " الناتج:\n```text\n-8\n-8\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "lst = [16, 33, 16, 0, 10, 31, 30]\nprint(lst[1:3])\nprint(lst[::2])\nprint(len(lst[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nlst = [16, 33, 16, 0, 10, 31, 30]\nprint(lst[1:3])\nprint(lst[::2])\nprint(len(lst[1:3]))\n```\nالجواب:", "qhash": "76aabc85e556c233", "answer": "[33, 16]\n[16, 16, 10, 30]\n2", "completion": " الناتج:\n```text\n[33, 16]\n[16, 16, 10, 30]\n2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('فيصل', 56), ('يوسف', 23), ('خالد', 75), ('وليد', 68)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('فيصل', 56), ('يوسف', 23), ('خالد', 75), ('وليد', 68)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "380aa569569195f4", "answer": "[('يوسف', 23), ('فيصل', 56), ('وليد', 68), ('خالد', 75)]\n['خالد', 'وليد']", "completion": " الناتج:\n```text\n[('يوسف', 23), ('فيصل', 56), ('وليد', 68), ('خالد', 75)]\n['خالد', 'وليد']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=2):\n    if x > y:\n        return x * 8 - y\n    return x + y * 8\n\nprint(f(18))\nprint(f(18, 13))\nprint(f(f(13), 18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=2):\n    if x > y:\n        return x * 8 - y\n    return x + y * 8\n\nprint(f(18))\nprint(f(18, 13))\nprint(f(f(13), 18))\n```\nالجواب:", "qhash": "e0b5991cb1fe55cb", "answer": "142\n131\n798", "completion": " الناتج:\n```text\n142\n131\n798\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "tally_letter", "reference": "def tally_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))", "tests": ["assert tally_letter('عربية تفاحة حصان سفينة صديق سوق ليل') == 0", "assert tally_letter('نهر تفاحة') == 0", "assert tally_letter('وردة جمل حاسوب طالب') == 0", "assert tally_letter('حاسوب شجرة برتقال جبل قمر') == 0", "assert tally_letter('حديقة') == 0", "assert tally_letter('شمس عربية عربية لغة') == 0", "assert tally_letter('سيارة عمل ميناء معلم ماء') == 0", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('عربية تفاحة حصان سفينة صديق سوق ليل') == 0\nassert tally_letter('نهر تفاحة') == 0\nassert tally_letter('وردة جمل حاسوب طالب') == 0\nassert tally_letter('حاسوب شجرة برتقال جبل قمر') == 0\nassert tally_letter('حديقة') == 0\nassert tally_letter('شمس عربية عربية لغة') == 0\nassert tally_letter('سيارة عمل ميناء معلم ماء') == 0\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))", "completion": " ```python\ndef tally_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ي'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `tally_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ي».\nمثال: `tally_letter('عربية تفاحة حصان سفينة صديق سوق ليل') == 0`\nالجواب:", "qhash": "12a7df8943ea938a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'desert'\nprint(word.count('t'))\nprint(word.index('t') + len(word))\nprint(word.replace('t', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'desert'\nprint(word.count('t'))\nprint(word.index('t') + len(word))\nprint(word.replace('t', '#'))\n```\nالجواب:", "qhash": "d84d03db1bbe8700", "answer": "1\n11\ndeser#", "completion": " الناتج:\n```text\n1\n11\ndeser#\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x * 4 + 5 for x in range(2, 16) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x * 4 + 5 for x in range(2, 16) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "1dda0247241bf9e6", "answer": "[17, 25, 33, 41, 49, 57, 65]\n7 287", "completion": " الناتج:\n```text\n[17, 25, 33, 41, 49, 57, 65]\n7 287\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n <= 3:\n        return 2\n    return 3 * go(n - 1) + -2\n\nprint(go(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n <= 3:\n        return 2\n    return 3 * go(n - 1) + -2\n\nprint(go(13))\n```\nالجواب:", "qhash": "788bb8a6d152478c", "answer": "59050", "completion": " الناتج:\n```text\n59050\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "cycle", "reference": "def cycle(lst):\n    if not lst:\n        return []\n    k = 7 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert cycle([50, 42, 7, 48, 23]) == [48, 23, 50, 42, 7]", "assert cycle([32, 21, -2, 30]) == [21, -2, 30, 32]", "assert cycle([23, 34]) == [34, 23]", "assert cycle([43, 21, 1, 41, 13, -3, 28, 2, 6, 49, 9]) == [13, -3, 28, 2, 6, 49, 9, 43, 21, 1, 41]", "assert cycle([3, 23, 41, 35, 9, 22, 29, -6, 27, 1, 3, 3]) == [22, 29, -6, 27, 1, 3, 3, 3, 23, 41, 35, 9]", "assert cycle([33, 46, -3, 43, -6, 34, 41, 37, 32, -4, 5, 5]) == [34, 41, 37, 32, -4, 5, 5, 33, 46, -3, 43, -6]", "assert cycle([]) == []"], "test_code": "assert cycle([50, 42, 7, 48, 23]) == [48, 23, 50, 42, 7]\nassert cycle([32, 21, -2, 30]) == [21, -2, 30, 32]\nassert cycle([23, 34]) == [34, 23]\nassert cycle([43, 21, 1, 41, 13, -3, 28, 2, 6, 49, 9]) == [13, -3, 28, 2, 6, 49, 9, 43, 21, 1, 41]\nassert cycle([3, 23, 41, 35, 9, 22, 29, -6, 27, 1, 3, 3]) == [22, 29, -6, 27, 1, 3, 3, 3, 23, 41, 35, 9]\nassert cycle([33, 46, -3, 43, -6, 34, 41, 37, 32, -4, 5, 5]) == [34, 41, 37, 32, -4, 5, 5, 33, 46, -3, 43, -6]\nassert cycle([]) == []", "answer": "def cycle(lst):\n    if not lst:\n        return []\n    k = 7 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef cycle(lst):\n    if not lst:\n        return []\n    k = 7 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 7 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef cycle(lst):\n    if not lst:\n        return []\n    k = 7 % len(lst)\n    return ____\n```\nمثال: `cycle([50, 42, 7, 48, 23]) == [48, 23, 50, 42, 7]`\nالجواب:", "qhash": "7880740de2df6712"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "spin", "reference": "def spin(lst):\n    if not lst:\n        return []\n    k = 3 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert spin([37, 20, 2]) == [37, 20, 2]", "assert spin([22]) == [22]", "assert spin([14, -2, 6, 23, 21, 35, 30, 30, 6, -5, 49]) == [6, -5, 49, 14, -2, 6, 23, 21, 35, 30, 30]", "assert spin([1, 5, 9, 20, 23, 47, -6, 43, 24, 12]) == [43, 24, 12, 1, 5, 9, 20, 23, 47, -6]", "assert spin([8, 37, 24, 9, -5, 44, 31, 21]) == [44, 31, 21, 8, 37, 24, 9, -5]", "assert spin([6, 22, 36, 35, -7]) == [36, 35, -7, 6, 22]", "assert spin([]) == []"], "test_code": "assert spin([37, 20, 2]) == [37, 20, 2]\nassert spin([22]) == [22]\nassert spin([14, -2, 6, 23, 21, 35, 30, 30, 6, -5, 49]) == [6, -5, 49, 14, -2, 6, 23, 21, 35, 30, 30]\nassert spin([1, 5, 9, 20, 23, 47, -6, 43, 24, 12]) == [43, 24, 12, 1, 5, 9, 20, 23, 47, -6]\nassert spin([8, 37, 24, 9, -5, 44, 31, 21]) == [44, 31, 21, 8, 37, 24, 9, -5]\nassert spin([6, 22, 36, 35, -7]) == [36, 35, -7, 6, 22]\nassert spin([]) == []", "answer": "def spin(lst):\n    if not lst:\n        return []\n    k = 3 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef spin(lst):\n    if not lst:\n        return []\n    k = 3 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 3 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef spin(lst):\n    if not lst:\n        return []\n    k = 3 % len(lst)\n    return ____\n```\nمثال: `spin([37, 20, 2]) == [37, 20, 2]`\nالجواب:", "qhash": "29b192bfc5263a54"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'منى': 27, 'زينب': 39, 'خالد': 20, 'حسن': 22, 'فيصل': 42}\npoints['فيصل'] += 8\npoints['نور'] = 33\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('هدى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'منى': 27, 'زينب': 39, 'خالد': 20, 'حسن': 22, 'فيصل': 42}\npoints['فيصل'] += 8\npoints['نور'] = 33\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(points.get('هدى', -1))\n```\nالجواب:", "qhash": "f6097d0bb88094f1", "answer": "6\nفيصل\n191\n-1", "completion": " الناتج:\n```text\n6\nفيصل\n191\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [-6, 20, 20, 24, 26, 19, 27, -8, 9]\nprint(a[2:6])\nprint(a[::-1])\nprint(len(a[2:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [-6, 20, 20, 24, 26, 19, 27, -8, 9]\nprint(a[2:6])\nprint(a[::-1])\nprint(len(a[2:6]))\n```\nالجواب:", "qhash": "99eb2eb71e572551", "answer": "[20, 24, 26, 19]\n[9, -8, 27, 19, 26, 24, 20, 20, -6]\n4", "completion": " الناتج:\n```text\n[20, 24, 26, 19]\n[9, -8, 27, 19, 26, 24, 20, 20, -6]\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['data', 'banana', 'garden', 'stone', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['data', 'banana', 'garden', 'stone', 'code']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "cf7eef0d7ea9d640", "answer": "['data', 'code', 'stone', 'banana', 'garden']\n['garden', 'banana', 'stone']", "completion": " الناتج:\n```text\n['data', 'code', 'stone', 'banana', 'garden']\n['garden', 'banana', 'stone']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return -1 * x ** 2 + (8) * x + (-3)", "tests": ["assert quad(5) == 12", "assert quad(9) == -12", "assert quad(-2) == -23", "assert quad(-1) == -12", "assert quad(-7) == -108", "assert quad(-19) == -516", "assert quad(8) == -3", "assert quad(0) == -3"], "test_code": "assert quad(5) == 12\nassert quad(9) == -12\nassert quad(-2) == -23\nassert quad(-1) == -12\nassert quad(-7) == -108\nassert quad(-19) == -516\nassert quad(8) == -3\nassert quad(0) == -3", "answer": "def quad(x):\n    return -1 * x ** 2 + (8) * x + (-3)", "completion": " ```python\ndef quad(x):\n    return -1 * x ** 2 + (8) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -1x² + 8x - 3.\nمثال: `quad(5) == 12`\nالجواب:", "qhash": "a82047201b8ebe4b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue']", "assert fizzbuzz(20) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue', '19', 'Red']", "assert fizzbuzz(9) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue']", "assert fizzbuzz(25) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue', '19', 'Red', '21', '22', '23', '24', 'Red']", "assert fizzbuzz(3) == ['1', '2', '3']"], "test_code": "assert fizzbuzz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue']\nassert fizzbuzz(20) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue', '19', 'Red']\nassert fizzbuzz(9) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue']\nassert fizzbuzz(25) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue', '19', 'Red', '21', '22', '23', '24', 'Red']\nassert fizzbuzz(3) == ['1', '2', '3']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 9 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Red'، مضاعفات 9 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(18) == ['1', '2', '3', '4', 'Red', '6', '7', '8', 'Blue', 'Red', '11', '12', '13', '14', 'Red', '16', '17', 'Blue']`\nالجواب:", "qhash": "65d79e6071c51035"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "tests": ["assert total_multiples(177) == 7832", "assert total_multiples(239) == 14280", "assert total_multiples(70) == 1190", "assert total_multiples(283) == 20022", "assert total_multiples(283) == 20022", "assert total_multiples(293) == 21462", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(177) == 7832\nassert total_multiples(239) == 14280\nassert total_multiples(70) == 1190\nassert total_multiples(283) == 20022\nassert total_multiples(283) == 20022\nassert total_multiples(293) == 21462\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 4 دون باقٍ.\nمثال: `total_multiples(177) == 7832`\nالجواب:", "qhash": "49e549b2d2e56eb5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_count", "reference": "def letter_count(text):\n    return text.count('ح')", "tests": ["assert letter_count('مكتبة حديقة سوق برمجة فجر وردة') == 1", "assert letter_count('جمل بيت علم مدرسة') == 0", "assert letter_count('فجر حصان') == 1", "assert letter_count('علم عمل برمجة حاسوب فجر') == 1", "assert letter_count('') == 0", "assert letter_count('نهر وردة') == 0", "assert letter_count('سفينة شجرة سماء صديق') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('مكتبة حديقة سوق برمجة فجر وردة') == 1\nassert letter_count('جمل بيت علم مدرسة') == 0\nassert letter_count('فجر حصان') == 1\nassert letter_count('علم عمل برمجة حاسوب فجر') == 1\nassert letter_count('') == 0\nassert letter_count('نهر وردة') == 0\nassert letter_count('سفينة شجرة سماء صديق') == 0\nassert letter_count('') == 0", "answer": "def letter_count(text):\n    return text.count('ح')", "completion": " ```python\ndef letter_count(text):\n    return text.count('ح')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_count` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ح» في النص.\nمثال: `letter_count('مكتبة حديقة سوق برمجة فجر وردة') == 1`\nالجواب:", "qhash": "a7199570f2a59354"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert rev_long_words('brain is table a garden matrix signal light') == 'light-signal-matrix-garden-table-brain'", "assert rev_long_words('apple of on') == 'apple'", "assert rev_long_words('on orange go') == 'orange'", "assert rev_long_words('vector go signal go by rocket') == 'rocket-signal-vector'", "assert rev_long_words('') == ''", "assert rev_long_words('by winter at on on table window') == 'window-table-winter'", "assert rev_long_words('brain coffee data apple window table coffee window') == 'window-coffee-table-window-apple-coffee-brain'"], "test_code": "assert rev_long_words('brain is table a garden matrix signal light') == 'light-signal-matrix-garden-table-brain'\nassert rev_long_words('apple of on') == 'apple'\nassert rev_long_words('on orange go') == 'orange'\nassert rev_long_words('vector go signal go by rocket') == 'rocket-signal-vector'\nassert rev_long_words('') == ''\nassert rev_long_words('by winter at on on table window') == 'window-table-winter'\nassert rev_long_words('brain coffee data apple window table coffee window') == 'window-coffee-table-window-apple-coffee-brain'", "answer": "def rev_long_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `rev_long_words('brain is table a garden matrix signal light') == 'light-signal-matrix-garden-table-brain'`\nالجواب:", "qhash": "d4798ce77c300618"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "tests": ["assert lead_count('شجرة مدرسة نهر مدينة حاسوب دفتر') == 1", "assert lead_count('برمجة مدينة') == 0", "assert lead_count('برتقال نهار صحراء فجر معلم') == 0", "assert lead_count('لغة مكتبة دفتر سلام قهوة سلام') == 1", "assert lead_count('باب دفتر معلم عربية سيارة حاسوب سوق') == 1", "assert lead_count('دفتر حاسوب معلم جمل دفتر خبز') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('شجرة مدرسة نهر مدينة حاسوب دفتر') == 1\nassert lead_count('برمجة مدينة') == 0\nassert lead_count('برتقال نهار صحراء فجر معلم') == 0\nassert lead_count('لغة مكتبة دفتر سلام قهوة سلام') == 1\nassert lead_count('باب دفتر معلم عربية سيارة حاسوب سوق') == 1\nassert lead_count('دفتر حاسوب معلم جمل دفتر خبز') == 2\nassert lead_count('') == 0", "answer": "def lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('د'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «د»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('د'):\n            count += 1\n    return count\n```\nمثال: `lead_count('شجرة مدرسة نهر مدينة حاسوب دفتر') == 1`\nالجواب:", "qhash": "76d8decc4e19d7a0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_special", "reference": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "tests": ["assert count_special([75, 12, 69, 68, 69, 23, 51, 13, 11, 89, 54]) == 4", "assert count_special([76, 67, 32, -7]) == 0", "assert count_special([-11, 31, -10, 78, 22, 34, -20]) == 0", "assert count_special([5, -1, 56, 38, 31, -28, -22]) == 0", "assert count_special([-35, 13, 52, -21]) == 1", "assert count_special([]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([75, 12, 69, 68, 69, 23, 51, 13, 11, 89, 54]) == 4\nassert count_special([76, 67, 32, -7]) == 0\nassert count_special([-11, 31, -10, 78, 22, 34, -20]) == 0\nassert count_special([5, -1, 56, 38, 31, -28, -22]) == 0\nassert count_special([-35, 13, 52, -21]) == 1\nassert count_special([]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 2. اكتب الحل كاملًا.\n```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_special([75, 12, 69, 68, 69, 23, 51, 13, 11, 89, 54]) == 4`\nالجواب:", "qhash": "6072737ba1e9fc3f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "how_many_div", "reference": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 2 != 0:\n            count += 1\n    return count", "tests": ["assert how_many_div([72, 18, 68, 18, 25, 4, 43, 8, 23, 73, 4, 13]) == 0", "assert how_many_div([0, 17, 3, -23, 76, -6, 10]) == 0", "assert how_many_div([40, 11, 64, -28, 2, 53, 18, 1, 51]) == 0", "assert how_many_div([54, 39, -21, 40, 0, -23, 85, 47, 73, 52]) == 0", "assert how_many_div([-12]) == 0", "assert how_many_div([3, 14, 19, 19, -25, 30, 57, 20, 14, -18, -6, 70]) == 0", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([72, 18, 68, 18, 25, 4, 43, 8, 23, 73, 4, 13]) == 0\nassert how_many_div([0, 17, 3, -23, 76, -6, 10]) == 0\nassert how_many_div([40, 11, 64, -28, 2, 53, 18, 1, 51]) == 0\nassert how_many_div([54, 39, -21, 40, 0, -23, 85, 47, 73, 52]) == 0\nassert how_many_div([-12]) == 0\nassert how_many_div([3, 14, 19, 19, -25, 30, 57, 20, 14, -18, -6, 70]) == 0\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 2 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 2 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 2. اكتب الحل كاملًا.\n```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `how_many_div([72, 18, 68, 18, 25, 4, 43, 8, 23, 73, 4, 13]) == 0`\nالجواب:", "qhash": "f9431cab202c1e98"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [28, -6, 4, 32, 16, -5, 28, 36]\nprint(a[2:8])\nprint(a[::3])\nprint(min(a[2:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [28, -6, 4, 32, 16, -5, 28, 36]\nprint(a[2:8])\nprint(a[::3])\nprint(min(a[2:8]))\n```\nالجواب:", "qhash": "aca32d1b70255bf4", "answer": "[4, 32, 16, -5, 28, 36]\n[28, 32, 28]\n-5", "completion": " الناتج:\n```text\n[4, 32, 16, -5, 28, 36]\n[28, 32, 28]\n-5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digits_mod", "reference": "def digits_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 13", "tests": ["assert digits_mod(30287) == 9", "assert digits_mod(332262) == 1", "assert digits_mod(185815) == 11", "assert digits_mod(117589) == 0", "assert digits_mod(964656) == 9", "assert digits_mod(828915) == 5", "assert digits_mod(850116) == 10", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(30287) == 9\nassert digits_mod(332262) == 1\nassert digits_mod(185815) == 11\nassert digits_mod(117589) == 0\nassert digits_mod(964656) == 9\nassert digits_mod(828915) == 5\nassert digits_mod(850116) == 10\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 13", "completion": " ```python\ndef digits_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digits_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 13.\nمثال: `digits_mod(30287) == 9`\nالجواب:", "qhash": "55444e2f0a2276a0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "xs = [30, -8, 17, 10, 30, 40]\nprint(xs[0:4])\nprint(xs[::-2])\nprint(min(xs[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nxs = [30, -8, 17, 10, 30, 40]\nprint(xs[0:4])\nprint(xs[::-2])\nprint(min(xs[0:4]))\n```\nالجواب:", "qhash": "ae607227cb4a02db", "answer": "[30, -8, 17, 10]\n[40, 10, -8]\n-8", "completion": " الناتج:\n```text\n[30, -8, 17, 10]\n[40, 10, -8]\n-8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "s = 'vector'\nprint(len(s))\nprint(s.upper())\nprint(s.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'vector'\nprint(len(s))\nprint(s.upper())\nprint(s.capitalize())\n```\nالجواب:", "qhash": "1f4e2a6258b2cc4e", "answer": "6\nVECTOR\nVector", "completion": " الناتج:\n```text\n6\nVECTOR\nVector\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 1009", "tests": ["assert prod_mod(5) == 120", "assert prod_mod(42) == 700", "assert prod_mod(55) == 810", "assert prod_mod(22) == 165", "assert prod_mod(50) == 40", "assert prod_mod(19) == 991", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(5) == 120\nassert prod_mod(42) == 700\nassert prod_mod(55) == 810\nassert prod_mod(22) == 165\nassert prod_mod(50) == 40\nassert prod_mod(19) == 991\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 1009", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(5) == 120`\nالجواب:", "qhash": "5fa5c5c370c828d7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45", "tests": ["assert dig_pow_mod(55658) == 22", "assert dig_pow_mod(227591) == 35", "assert dig_pow_mod(189404) == 10", "assert dig_pow_mod(186354) == 10", "assert dig_pow_mod(514254) == 24", "assert dig_pow_mod(127747) == 6", "assert dig_pow_mod(16077) == 24", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(55658) == 22\nassert dig_pow_mod(227591) == 35\nassert dig_pow_mod(189404) == 10\nassert dig_pow_mod(186354) == 10\nassert dig_pow_mod(514254) == 24\nassert dig_pow_mod(127747) == 6\nassert dig_pow_mod(16077) == 24\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45", "completion": " ```python\ndef dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 45\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `dig_pow_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 45.\nمثال: `dig_pow_mod(55658) == 22`\nالجواب:", "qhash": "d88fac93428820d6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(8, 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(8, 2))\n```\nالجواب:", "qhash": "f739be4f710fda3d", "answer": "64", "completion": " الناتج:\n```text\n64\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'himu'}", "tests": ["assert freq_of('orange it engine apple') == {'h': 0, 'i': 2, 'm': 0, 'u': 0}", "assert freq_of('desert of') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}", "assert freq_of('a coffee') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}", "assert freq_of('in brain on') == {'h': 0, 'i': 2, 'm': 0, 'u': 0}", "assert freq_of('winter on orange') == {'h': 0, 'i': 1, 'm': 0, 'u': 0}", "assert freq_of('light music') == {'h': 1, 'i': 2, 'm': 1, 'u': 1}", "assert freq_of('') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}"], "test_code": "assert freq_of('orange it engine apple') == {'h': 0, 'i': 2, 'm': 0, 'u': 0}\nassert freq_of('desert of') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}\nassert freq_of('a coffee') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}\nassert freq_of('in brain on') == {'h': 0, 'i': 2, 'm': 0, 'u': 0}\nassert freq_of('winter on orange') == {'h': 0, 'i': 1, 'm': 0, 'u': 0}\nassert freq_of('light music') == {'h': 1, 'i': 2, 'm': 1, 'u': 1}\nassert freq_of('') == {'h': 0, 'i': 0, 'm': 0, 'u': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'himu'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'himu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'h'، 'i'، 'm'، 'u' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('orange it engine apple') == {'h': 0, 'i': 2, 'm': 0, 'u': 0}`\nالجواب:", "qhash": "39d52076655aa36a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=9):\n    if x > y:\n        return x * 5 - y\n    return x + y * 5\n\nprint(calc(-7))\nprint(calc(-7, 15))\nprint(calc(calc(15), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=9):\n    if x > y:\n        return x * 5 - y\n    return x + y * 5\n\nprint(calc(-7))\nprint(calc(-7, 15))\nprint(calc(calc(15), -7))\n```\nالجواب:", "qhash": "b03c30c4bde3279b", "answer": "38\n68\n337", "completion": " الناتج:\n```text\n38\n68\n337\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 8704\nsteps = 0\nwhile n > 13:\n    n = n // 7\n    steps += 1\nprint(n, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 8704\nsteps = 0\nwhile n > 13:\n    n = n // 7\n    steps += 1\nprint(n, steps)\n```\nالجواب:", "qhash": "46390f8dfdaa4f97", "answer": "3 4", "completion": " الناتج:\n```text\n3 4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_hits", "reference": "def count_hits(text):\n    return text.count('ك')", "tests": ["assert count_hits('صديق حصان مدينة برمجة شمس مدرسة نهر طالب') == 0", "assert count_hits('دفتر عربية بحر نور جمل بحر') == 0", "assert count_hits('') == 0", "assert count_hits('جمل مدرسة فجر جمل') == 0", "assert count_hits('رمل رمل فجر ميناء نور لغة مكتبة') == 1", "assert count_hits('') == 0", "assert count_hits('جمل سيارة فجر سلام') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('صديق حصان مدينة برمجة شمس مدرسة نهر طالب') == 0\nassert count_hits('دفتر عربية بحر نور جمل بحر') == 0\nassert count_hits('') == 0\nassert count_hits('جمل مدرسة فجر جمل') == 0\nassert count_hits('رمل رمل فجر ميناء نور لغة مكتبة') == 1\nassert count_hits('') == 0\nassert count_hits('جمل سيارة فجر سلام') == 0\nassert count_hits('') == 0", "answer": "def count_hits(text):\n    return text.count('ك')", "completion": " ```python\ndef count_hits(text):\n    return text.count('ك')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ك» في النص.\nمثال: `count_hits('صديق حصان مدينة برمجة شمس مدرسة نهر طالب') == 0`\nالجواب:", "qhash": "99b5f5572fb669dc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_in_text", "reference": "def count_in_text(text):\n    return sum(1 for w in text.split() if w.startswith('و'))", "tests": ["assert count_in_text('بحر سفينة نهار قمر طائرة جبل') == 0", "assert count_in_text('جبل برتقال شمس حصان فجر') == 0", "assert count_in_text('طائرة طالب رمل عمل عمل ليل مدرسة طالب') == 0", "assert count_in_text('') == 0", "assert count_in_text('عربية كتاب حصان كتاب') == 0", "assert count_in_text('بحر معلم') == 0", "assert count_in_text('قمر لغة صحراء لغة ليل') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('بحر سفينة نهار قمر طائرة جبل') == 0\nassert count_in_text('جبل برتقال شمس حصان فجر') == 0\nassert count_in_text('طائرة طالب رمل عمل عمل ليل مدرسة طالب') == 0\nassert count_in_text('') == 0\nassert count_in_text('عربية كتاب حصان كتاب') == 0\nassert count_in_text('بحر معلم') == 0\nassert count_in_text('قمر لغة صحراء لغة ليل') == 0\nassert count_in_text('') == 0", "answer": "def count_in_text(text):\n    return sum(1 for w in text.split() if w.startswith('و'))", "completion": " ```python\ndef count_in_text(text):\n    return sum(1 for w in text.split() if w.startswith('و'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_in_text` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «و».\nمثال: `count_in_text('بحر سفينة نهار قمر طائرة جبل') == 0`\nالجواب:", "qhash": "16ca62317513e5ae"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_letter", "reference": "def count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ص'))", "tests": ["assert count_letter('نور مدرسة كتاب سلام') == 0", "assert count_letter('مكتبة جبل حاسوب') == 0", "assert count_letter('جبل فجر نهر بيت سلام باب وردة') == 0", "assert count_letter('سلام مكتبة بيت') == 0", "assert count_letter('') == 0", "assert count_letter('شمس نهر باب بيت مدرسة جبل قمر') == 0", "assert count_letter('حاسوب قمر سفينة قمر معلم بيت') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('نور مدرسة كتاب سلام') == 0\nassert count_letter('مكتبة جبل حاسوب') == 0\nassert count_letter('جبل فجر نهر بيت سلام باب وردة') == 0\nassert count_letter('سلام مكتبة بيت') == 0\nassert count_letter('') == 0\nassert count_letter('شمس نهر باب بيت مدرسة جبل قمر') == 0\nassert count_letter('حاسوب قمر سفينة قمر معلم بيت') == 0\nassert count_letter('') == 0", "answer": "def count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ص'))", "completion": " ```python\ndef count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ص'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ص».\nمثال: `count_letter('نور مدرسة كتاب سلام') == 0`\nالجواب:", "qhash": "28418b04f662e022"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "top_divisible", "reference": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert top_divisible([7, 14, 13, 54, 6, -20, 49, 39]) == None", "assert top_divisible([-8, -32, -16]) == -8", "assert top_divisible([1, 9, 17, 25]) == None", "assert top_divisible([3, 33]) == None", "assert top_divisible([31, 15, -48, -44, 40, -16, -45, -45, -32]) == 40", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([7, 14, 13, 54, 6, -20, 49, 39]) == None\nassert top_divisible([-8, -32, -16]) == -8\nassert top_divisible([1, 9, 17, 25]) == None\nassert top_divisible([3, 33]) == None\nassert top_divisible([31, 15, -48, -44, 40, -16, -45, -45, -32]) == 40\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `top_divisible([7, 14, 13, 54, 6, -20, 49, 39]) == None`\nالجواب:", "qhash": "74a842f8ad4c83c2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [25, 28, 30, 10, 20, 40, -6]\nprint(a[2:3])\nprint(a[::3])\nprint(sum(a[2:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [25, 28, 30, 10, 20, 40, -6]\nprint(a[2:3])\nprint(a[::3])\nprint(sum(a[2:3]))\n```\nالجواب:", "qhash": "c84e441687e408d0", "answer": "[30]\n[25, 10, -6]\n30", "completion": " الناتج:\n```text\n[30]\n[25, 10, -6]\n30\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([35, -10, 14, -14, -3, -14, 10, -22, -10]) == None", "assert max_multiple([-16, -24, -16]) == -16", "assert max_multiple([1, 9, 17]) == None", "assert max_multiple([40]) == 40", "assert max_multiple([44, -13, 20, 7, 32]) == 32", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([35, -10, 14, -14, -3, -14, 10, -22, -10]) == None\nassert max_multiple([-16, -24, -16]) == -16\nassert max_multiple([1, 9, 17]) == None\nassert max_multiple([40]) == 40\nassert max_multiple([44, -13, 20, 7, 32]) == 32\nassert max_multiple([]) == None", "answer": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `max_multiple([35, -10, 14, -14, -3, -14, 10, -22, -10]) == None`\nالجواب:", "qhash": "b829352b13595542"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return text.count('و')", "tests": ["assert how_many('مدرسة مدرسة نور') == 1", "assert how_many('برمجة') == 0", "assert how_many('نهار تفاحة ليل ليل') == 0", "assert how_many('') == 0", "assert how_many('') == 0", "assert how_many('علم سيارة نهر وردة حديقة طالب شمس') == 1", "assert how_many('') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('مدرسة مدرسة نور') == 1\nassert how_many('برمجة') == 0\nassert how_many('نهار تفاحة ليل ليل') == 0\nassert how_many('') == 0\nassert how_many('') == 0\nassert how_many('علم سيارة نهر وردة حديقة طالب شمس') == 1\nassert how_many('') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return text.count('و')", "completion": " ```python\ndef how_many(text):\n    return text.count('و')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «و» في النص.\nمثال: `how_many('مدرسة مدرسة نور') == 1`\nالجواب:", "qhash": "109743e54c1eae0c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_coprime", "reference": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 23) == 1)", "tests": ["assert count_coprime(72) == 69", "assert count_coprime(122) == 117", "assert count_coprime(17) == 17", "assert count_coprime(144) == 138", "assert count_coprime(139) == 133", "assert count_coprime(36) == 35", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(72) == 69\nassert count_coprime(122) == 117\nassert count_coprime(17) == 17\nassert count_coprime(144) == 138\nassert count_coprime(139) == 133\nassert count_coprime(36) == 35\nassert count_coprime(1) == 1", "answer": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 23) == 1)", "completion": " ```python\ndef count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 23) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_coprime` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 23 في أي قاسم أكبر من 1.\nمثال: `count_coprime(72) == 69`\nالجواب:", "qhash": "94a4b184328880d9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_matching", "reference": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count", "tests": ["assert count_matching([82, 58, 63, 31, 55, 79, 5, 80, 17, 54]) == 0", "assert count_matching([72, 67, 60, -21, -23, 52, 50, 25, 82, 38, 49]) == 2", "assert count_matching([28, 28, -26, -33, 5, -31]) == 2", "assert count_matching([]) == 0", "assert count_matching([-18, 66, 41, -16, 13, -21, 45, -40, 24, -4, 42, 1]) == 3", "assert count_matching([28, 58, 81, -14, -31, 32, -28, -10, 27, 0, 27, 83]) == 3", "assert count_matching([]) == 0"], "test_code": "assert count_matching([82, 58, 63, 31, 55, 79, 5, 80, 17, 54]) == 0\nassert count_matching([72, 67, 60, -21, -23, 52, 50, 25, 82, 38, 49]) == 2\nassert count_matching([28, 28, -26, -33, 5, -31]) == 2\nassert count_matching([]) == 0\nassert count_matching([-18, 66, 41, -16, 13, -21, 45, -40, 24, -4, 42, 1]) == 3\nassert count_matching([28, 58, 81, -14, -31, 32, -28, -10, 27, 0, 27, 83]) == 3\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 5. اكتب الحل كاملًا.\n```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_matching([82, 58, 63, 31, 55, 79, 5, 80, 17, 54]) == 0`\nالجواب:", "qhash": "67fe4d912fab3c0b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_sel", "reference": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 6 != 0:\n            count += 1\n    return count", "tests": ["assert count_sel([5, 76, 20, 41, 47, 54, 67, 57, 24, 35, 88, 69]) == 3", "assert count_sel([89]) == 0", "assert count_sel([]) == 0", "assert count_sel([-38, -10, 4, -7, 61, 8, 9, 57, 84, 25]) == 4", "assert count_sel([81, 25, -33, 69, -40, 30, -1]) == 1", "assert count_sel([-7, -19, -1, -2, -13, 48, -31, 50, 14]) == 3", "assert count_sel([]) == 0"], "test_code": "assert count_sel([5, 76, 20, 41, 47, 54, 67, 57, 24, 35, 88, 69]) == 3\nassert count_sel([89]) == 0\nassert count_sel([]) == 0\nassert count_sel([-38, -10, 4, -7, 61, 8, 9, 57, 84, 25]) == 4\nassert count_sel([81, 25, -33, 69, -40, 30, -1]) == 1\nassert count_sel([-7, -19, -1, -2, -13, 48, -31, 50, 14]) == 3\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 6 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 6 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 6. اكتب الحل كاملًا.\n```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_sel([5, 76, 20, 41, 47, 54, 67, 57, 24, 35, 88, 69]) == 3`\nالجواب:", "qhash": "d05701347f961eab"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n < 10:\n        return n\n    return n % 10 + f(n // 10)\n\nprint(f(404634408))\nprint(f(f(404634408)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n < 10:\n        return n\n    return n % 10 + f(n // 10)\n\nprint(f(404634408))\nprint(f(f(404634408)))\n```\nالجواب:", "qhash": "2cef54ef920139a0", "answer": "33\n6", "completion": " الناتج:\n```text\n33\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_long_words", "reference": "def rev_long_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "tests": ["assert rev_long_words('summer matrix we of orange') == 'orange,of,we,matrix,summer'", "assert rev_long_words('pixel apple') == 'apple,pixel'", "assert rev_long_words('') == ''", "assert rev_long_words('camel camel music winter cloud of orange') == 'orange,of,cloud,winter,music,camel,camel'", "assert rev_long_words('it matrix of') == 'of,matrix,it'", "assert rev_long_words('brain go to rocket of planet') == 'planet,of,rocket,to,go,brain'", "assert rev_long_words('in by summer music we summer camel') == 'camel,summer,we,music,summer,by,in'"], "test_code": "assert rev_long_words('summer matrix we of orange') == 'orange,of,we,matrix,summer'\nassert rev_long_words('pixel apple') == 'apple,pixel'\nassert rev_long_words('') == ''\nassert rev_long_words('camel camel music winter cloud of orange') == 'orange,of,cloud,winter,music,camel,camel'\nassert rev_long_words('it matrix of') == 'of,matrix,it'\nassert rev_long_words('brain go to rocket of planet') == 'planet,of,rocket,to,go,brain'\nassert rev_long_words('in by summer music we summer camel') == 'camel,summer,we,music,summer,by,in'", "answer": "def rev_long_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])", "completion": " ```python\ndef rev_long_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 1][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_long_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 1 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `rev_long_words('summer matrix we of orange') == 'orange,of,we,matrix,summer'`\nالجواب:", "qhash": "a021923b5c3bebbf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_div", "reference": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 11 == 0)", "tests": ["assert sum_div(138) == 2974", "assert sum_div(170) == 4668", "assert sum_div(233) == 8725", "assert sum_div(222) == 7810", "assert sum_div(265) == 11220", "assert sum_div(281) == 12591", "assert sum_div(1) == 0"], "test_code": "assert sum_div(138) == 2974\nassert sum_div(170) == 4668\nassert sum_div(233) == 8725\nassert sum_div(222) == 7810\nassert sum_div(265) == 11220\nassert sum_div(281) == 12591\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_div` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 4 أو 11 دون باقٍ.\nمثال: `sum_div(138) == 2974`\nالجواب:", "qhash": "f424f0d88f9f3c5e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([17, -25, -21, 4, 56, 49, 42]) == -25", "assert max_multiple([-20, -25, -5]) == -5", "assert max_multiple([1]) == None", "assert max_multiple([7, -14, 8, 19, -19, 31, 20, -28]) == 20", "assert max_multiple([-22, -38, -48, -36, -41]) == None", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([17, -25, -21, 4, 56, 49, 42]) == -25\nassert max_multiple([-20, -25, -5]) == -5\nassert max_multiple([1]) == None\nassert max_multiple([7, -14, 8, 19, -19, 31, 20, -28]) == 20\nassert max_multiple([-22, -38, -48, -36, -41]) == None\nassert max_multiple([]) == None", "answer": "def max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(xs):\n    best = 0\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(xs):\n    best = 0\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([17, -25, -21, 4, 56, 49, 42]) == -25`\nالجواب:", "qhash": "28ea25528185dbc8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "words_starting", "reference": "def words_starting(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "tests": ["assert words_starting('نهار امل قمر خبز') == 1", "assert words_starting('ماء عربية') == 0", "assert words_starting('نهر ليل طائرة شجرة') == 0", "assert words_starting('امل بيت امل نهار بيت رمل جمل') == 2", "assert words_starting('رمل سفينة شمس نهر علم حديقة') == 0", "assert words_starting('وردة مدينة') == 0", "assert words_starting('') == 0"], "test_code": "assert words_starting('نهار امل قمر خبز') == 1\nassert words_starting('ماء عربية') == 0\nassert words_starting('نهر ليل طائرة شجرة') == 0\nassert words_starting('امل بيت امل نهار بيت رمل جمل') == 2\nassert words_starting('رمل سفينة شمس نهر علم حديقة') == 0\nassert words_starting('وردة مدينة') == 0\nassert words_starting('') == 0", "answer": "def words_starting(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "completion": " ```python\ndef words_starting(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ا'):\n            count += 1\n    return count\n```\n", "buggy": "def words_starting(text):\n    count = 0\n    for w in text:\n        if w.startswith('ا'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ا»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef words_starting(text):\n    count = 0\n    for w in text:\n        if w.startswith('ا'):\n            count += 1\n    return count\n```\nمثال: `words_starting('نهار امل قمر خبز') == 1`\nالجواب:", "qhash": "6c5f7a199d476b44"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "tests": ["assert lead_count('حديقة دفتر قهوة سماء جمل قمر حديقة دفتر') == 2", "assert lead_count('قهوة معلم دفتر سوق خبز') == 1", "assert lead_count('علم نور جمل ميناء سوق') == 0", "assert lead_count('عمل صحراء دفتر طائرة ماء') == 1", "assert lead_count('ميناء دفتر حصان دفتر مطر جبل') == 2", "assert lead_count('سوق خبز') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('حديقة دفتر قهوة سماء جمل قمر حديقة دفتر') == 2\nassert lead_count('قهوة معلم دفتر سوق خبز') == 1\nassert lead_count('علم نور جمل ميناء سوق') == 0\nassert lead_count('عمل صحراء دفتر طائرة ماء') == 1\nassert lead_count('ميناء دفتر حصان دفتر مطر جبل') == 2\nassert lead_count('سوق خبز') == 0\nassert lead_count('') == 0", "answer": "def lead_count(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(line):\n    count = 0\n    for w in line:\n        if w.startswith('د'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «د»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(line):\n    count = 0\n    for w in line:\n        if w.startswith('د'):\n            count += 1\n    return count\n```\nمثال: `lead_count('حديقة دفتر قهوة سماء جمل قمر حديقة دفتر') == 2`\nالجواب:", "qhash": "f0e1248a074f0d2a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=4):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(calc(-1))\nprint(calc(-1, 14))\nprint(calc(calc(14), -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=4):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(calc(-1))\nprint(calc(-1, 14))\nprint(calc(calc(14), -1))\n```\nالجواب:", "qhash": "22d4c9bcdb144453", "answer": "-13\n-43\n-43", "completion": " الناتج:\n```text\n-13\n-43\n-43\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)", "tests": ["assert multiples_total(54) == 702", "assert multiples_total(103) == 2652", "assert multiples_total(54) == 702", "assert multiples_total(279) == 19460", "assert multiples_total(75) == 1406", "assert multiples_total(230) == 13110", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(54) == 702\nassert multiples_total(103) == 2652\nassert multiples_total(54) == 702\nassert multiples_total(279) == 19460\nassert multiples_total(75) == 1406\nassert multiples_total(230) == 13110\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 10 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 10 دون باقٍ.\nمثال: `multiples_total(54) == 702`\nالجواب:", "qhash": "ce2bf2746c827278"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'gir'}", "tests": ["assert freq_of('of on engine winter brain of') == {'g': 1, 'i': 3, 'r': 2}", "assert freq_of('python engine engine matrix in river') == {'g': 2, 'i': 5, 'r': 3}", "assert freq_of('python brain vector apple by pixel') == {'g': 0, 'i': 2, 'r': 2}", "assert freq_of('to to a signal') == {'g': 1, 'i': 1, 'r': 0}", "assert freq_of('go camel') == {'g': 1, 'i': 0, 'r': 0}", "assert freq_of('up python matrix signal engine stone') == {'g': 2, 'i': 3, 'r': 1}", "assert freq_of('') == {'g': 0, 'i': 0, 'r': 0}"], "test_code": "assert freq_of('of on engine winter brain of') == {'g': 1, 'i': 3, 'r': 2}\nassert freq_of('python engine engine matrix in river') == {'g': 2, 'i': 5, 'r': 3}\nassert freq_of('python brain vector apple by pixel') == {'g': 0, 'i': 2, 'r': 2}\nassert freq_of('to to a signal') == {'g': 1, 'i': 1, 'r': 0}\nassert freq_of('go camel') == {'g': 1, 'i': 0, 'r': 0}\nassert freq_of('up python matrix signal engine stone') == {'g': 2, 'i': 3, 'r': 1}\nassert freq_of('') == {'g': 0, 'i': 0, 'r': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'gir'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'gir'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'g'، 'i'، 'r' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('of on engine winter brain of') == {'g': 1, 'i': 3, 'r': 2}`\nالجواب:", "qhash": "88801713a49c982d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_of_div", "reference": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_of_div([25, -19, -24, 60, -22, -23, 56, -29]) == 60", "assert max_of_div([-48, -24, -24]) == -24", "assert max_of_div([1, 13, 25]) == None", "assert max_of_div([-37, -24, 29, 25, 6]) == -24", "assert max_of_div([-36, -35, 3, 0, -24, -36, 32, 6]) == 0", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([25, -19, -24, 60, -22, -23, 56, -29]) == 60\nassert max_of_div([-48, -24, -24]) == -24\nassert max_of_div([1, 13, 25]) == None\nassert max_of_div([-37, -24, 29, 25, 6]) == -24\nassert max_of_div([-36, -35, 3, 0, -24, -36, 32, 6]) == 0\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 12 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 12 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_of_div([25, -19, -24, 60, -22, -23, 56, -29]) == 60`\nالجواب:", "qhash": "9c3ee48bc1a8c644"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "div_not", "reference": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert div_not([37, 39, 36, 32, 22, 64]) == 4", "assert div_not([-23, -12, 89, -32]) == 2", "assert div_not([-14, -19, 64, 43, 65, 10, -4, 48, -21, 60, 7, 2]) == 6", "assert div_not([16]) == 1", "assert div_not([38, 51, 7, 79, -18]) == 2", "assert div_not([-1, 31, 46, 16]) == 2", "assert div_not([]) == 0"], "test_code": "assert div_not([37, 39, 36, 32, 22, 64]) == 4\nassert div_not([-23, -12, 89, -32]) == 2\nassert div_not([-14, -19, 64, 43, 65, 10, -4, 48, -21, 60, 7, 2]) == 6\nassert div_not([16]) == 1\nassert div_not([38, 51, 7, 79, -18]) == 2\nassert div_not([-1, 31, 46, 16]) == 2\nassert div_not([]) == 0", "answer": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 2 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 2 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `div_not([37, 39, 36, 32, 22, 64]) == 4`\nالجواب:", "qhash": "9a93da7164cb8132"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 20\nfor x in range(10, 13, 3):\n    result += x * 4\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 20\nfor x in range(10, 13, 3):\n    result += x * 4\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "91138c39cc571e77", "answer": "60\n10", "completion": " الناتج:\n```text\n60\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'banana'\nprint(name[1:3])\nprint(name[-2:])\nprint(name.count('a'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'banana'\nprint(name[1:3])\nprint(name[-2:])\nprint(name.count('a'))\n```\nالجواب:", "qhash": "7fa179cf53af11bb", "answer": "an\nna\n3", "completion": " الناتج:\n```text\nan\nna\n3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizz", "reference": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizz(15) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8', 'FooBar', '10', '11', 'Foo', '13', '14', 'Foo']", "assert fizz(8) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8']", "assert fizz(4) == ['1', '2', 'Foo', '4']", "assert fizz(11) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8', 'FooBar', '10', '11']", "assert fizz(1) == ['1']"], "test_code": "assert fizz(15) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8', 'FooBar', '10', '11', 'Foo', '13', '14', 'Foo']\nassert fizz(8) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8']\nassert fizz(4) == ['1', '2', 'Foo', '4']\nassert fizz(11) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8', 'FooBar', '10', '11']\nassert fizz(1) == ['1']", "answer": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 9 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Foo'، مضاعفات 9 تصبح 'Bar'، المضاعفات المشتركة تصبح 'FooBar'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizz(15) == ['1', '2', 'Foo', '4', '5', 'Foo', '7', '8', 'FooBar', '10', '11', 'Foo', '13', '14', 'Foo']`\nالجواب:", "qhash": "70b04aaf4f6c3ce0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "only_div", "reference": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert only_div([2, 19, 2, 25, 3, 70, 76]) == 0", "assert only_div([11, -4, 22, 14, 44, 10]) == 0", "assert only_div([38, 70, 81, 27]) == 0", "assert only_div([]) == 0", "assert only_div([-33, 62, 1, -5, 49, 25, 32]) == 0", "assert only_div([27, 80, 34]) == 0", "assert only_div([]) == 0"], "test_code": "assert only_div([2, 19, 2, 25, 3, 70, 76]) == 0\nassert only_div([11, -4, 22, 14, 44, 10]) == 0\nassert only_div([38, 70, 81, 27]) == 0\nassert only_div([]) == 0\nassert only_div([-33, 62, 1, -5, 49, 25, 32]) == 0\nassert only_div([27, 80, 34]) == 0\nassert only_div([]) == 0", "answer": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `only_div([2, 19, 2, 25, 3, 70, 76]) == 0`\nالجواب:", "qhash": "4b84e787b96668bc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 48", "tests": ["assert digit_score(4549) == 22", "assert digit_score(894640) == 1", "assert digit_score(463435) == 43", "assert digit_score(993087) == 36", "assert digit_score(792772) == 46", "assert digit_score(544487) == 20", "assert digit_score(173603) == 38", "assert digit_score(0) == 0"], "test_code": "assert digit_score(4549) == 22\nassert digit_score(894640) == 1\nassert digit_score(463435) == 43\nassert digit_score(993087) == 36\nassert digit_score(792772) == 46\nassert digit_score(544487) == 20\nassert digit_score(173603) == 38\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 48", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 3 for d in str(n)) % 48\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 48.\nمثال: `digit_score(4549) == 22`\nالجواب:", "qhash": "fc313cdad074ce95"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * -5 for x in xs if -13 <= x <= 12)", "tests": ["assert pick_between([-6, 11, -5, -7, 17, -10, 9, 7]) == [-55, -45, -35, 25, 30, 35, 50]", "assert pick_between([31, 34, 43, 26, 37, 49, -1, 19, 44, 24]) == [5]", "assert pick_between([49, -3, 42, -5, 11, -5, 43]) == [-55, 15, 25, 25]", "assert pick_between([21, 23, 21, -3, 45, -16, -16, 13, 52, -17]) == [15]", "assert pick_between([12, -26, 55, -30, 12, 44, 19, 32, 0]) == [-60, -60, 0]", "assert pick_between([-12, 2, -7, 31, -26, 12, 13, 45, 28, -27]) == [-60, -10, 35, 60]", "assert pick_between([36, 50, -24, 33, 59, -27, 57]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-6, 11, -5, -7, 17, -10, 9, 7]) == [-55, -45, -35, 25, 30, 35, 50]\nassert pick_between([31, 34, 43, 26, 37, 49, -1, 19, 44, 24]) == [5]\nassert pick_between([49, -3, 42, -5, 11, -5, 43]) == [-55, 15, 25, 25]\nassert pick_between([21, 23, 21, -3, 45, -16, -16, 13, 52, -17]) == [15]\nassert pick_between([12, -26, 55, -30, 12, 44, 19, 32, 0]) == [-60, -60, 0]\nassert pick_between([-12, 2, -7, 31, -26, 12, 13, 45, 28, -27]) == [-60, -10, 35, 60]\nassert pick_between([36, 50, -24, 33, 59, -27, 57]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * -5 for x in xs if -13 <= x <= 12)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * -5 for x in xs if -13 <= x <= 12)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -5 لكل عنصر x في المدى المغلق [-13, 12].\nمثال: `pick_between([-6, 11, -5, -7, 17, -10, 9, 7]) == [-55, -45, -35, 25, 30, 35, 50]`\nالجواب:", "qhash": "9f347946a903fd53"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'gls'}", "tests": ["assert freq_of('banana stone') == {'g': 0, 'l': 0, 's': 1}", "assert freq_of('python river we coffee code') == {'g': 0, 'l': 0, 's': 0}", "assert freq_of('camel') == {'g': 0, 'l': 1, 's': 0}", "assert freq_of('orange cloud coffee by table') == {'g': 1, 'l': 2, 's': 0}", "assert freq_of('on music banana brain') == {'g': 0, 'l': 0, 's': 1}", "assert freq_of('in light coffee up stone python') == {'g': 1, 'l': 1, 's': 1}", "assert freq_of('') == {'g': 0, 'l': 0, 's': 0}"], "test_code": "assert freq_of('banana stone') == {'g': 0, 'l': 0, 's': 1}\nassert freq_of('python river we coffee code') == {'g': 0, 'l': 0, 's': 0}\nassert freq_of('camel') == {'g': 0, 'l': 1, 's': 0}\nassert freq_of('orange cloud coffee by table') == {'g': 1, 'l': 2, 's': 0}\nassert freq_of('on music banana brain') == {'g': 0, 'l': 0, 's': 1}\nassert freq_of('in light coffee up stone python') == {'g': 1, 'l': 1, 's': 1}\nassert freq_of('') == {'g': 0, 'l': 0, 's': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'gls'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'gls'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'g'، 'l'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('banana stone') == {'g': 0, 'l': 0, 's': 1}`\nالجواب:", "qhash": "0f2a151f6b397da3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "div_not", "reference": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert div_not([57, 86, 87, 41, 54, 9, 62, 59, 69, 34, 4, 40]) == 0", "assert div_not([69, -24, -31, 48, 8, 27, 81, -18, -37]) == 0", "assert div_not([50, 17, 18, -32]) == 0", "assert div_not([56, 82, 59, 16, -3, -12, 64, 4]) == 0", "assert div_not([84, 16, -33, 47, 1, 84]) == 0", "assert div_not([33, -25]) == 0", "assert div_not([]) == 0"], "test_code": "assert div_not([57, 86, 87, 41, 54, 9, 62, 59, 69, 34, 4, 40]) == 0\nassert div_not([69, -24, -31, 48, 8, 27, 81, -18, -37]) == 0\nassert div_not([50, 17, 18, -32]) == 0\nassert div_not([56, 82, 59, 16, -3, -12, 64, 4]) == 0\nassert div_not([84, 16, -33, 47, 1, 84]) == 0\nassert div_not([33, -25]) == 0\nassert div_not([]) == 0", "answer": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `div_not([57, 86, 87, 41, 54, 9, 62, 59, 69, 34, 4, 40]) == 0`\nالجواب:", "qhash": "1ba7aae2441baf73"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'لغة'\nprint(text.count('ا'))\nprint(text[::-1])\nprint(len(text.replace(' ', '')))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'لغة'\nprint(text.count('ا'))\nprint(text[::-1])\nprint(len(text.replace(' ', '')))\n```\nالجواب:", "qhash": "38613918bc74bcfd", "answer": "0\nةغل\n3", "completion": " الناتج:\n```text\n0\nةغل\n3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'ليلى': 7, 'هشام': 12, 'عمر': 21, 'باسل': 4, 'علي': 23}\nd['ليلى'] += 20\nd['منى'] = 11\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'ليلى': 7, 'هشام': 12, 'عمر': 21, 'باسل': 4, 'علي': 23}\nd['ليلى'] += 20\nd['منى'] = 11\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "c3c08f42ce2d87f4", "answer": "6\nليلى\n98\n[('باسل', 4), ('منى', 11)]", "completion": " الناتج:\n```text\n6\nليلى\n98\n[('باسل', 4), ('منى', 11)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 170:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([6, 50, 51, 80, 58, 18, 65, 25, 27, 24]) == [6, 56, 107, 0, 58, 76, 141, 166, 0, 24]", "assert cumulative([-9, 20, 59, 154, 82]) == [-9, 11, 70, 0, 82]", "assert cumulative([109, 30, 108, 30, 127, 144, 19]) == [109, 139, 0, 30, 157, 0, 19]", "assert cumulative([131, 7]) == [131, 138]", "assert cumulative([154, 67, 106, 103, 95, 131, 59, 123, 43, -1]) == [154, 0, 106, 0, 95, 0, 59, 0, 43, 42]", "assert cumulative([75, 124, 46]) == [75, 0, 46]", "assert cumulative([]) == []"], "test_code": "assert cumulative([6, 50, 51, 80, 58, 18, 65, 25, 27, 24]) == [6, 56, 107, 0, 58, 76, 141, 166, 0, 24]\nassert cumulative([-9, 20, 59, 154, 82]) == [-9, 11, 70, 0, 82]\nassert cumulative([109, 30, 108, 30, 127, 144, 19]) == [109, 139, 0, 30, 157, 0, 19]\nassert cumulative([131, 7]) == [131, 138]\nassert cumulative([154, 67, 106, 103, 95, 131, 59, 123, 43, -1]) == [154, 0, 106, 0, 95, 0, 59, 0, 43, 42]\nassert cumulative([75, 124, 46]) == [75, 0, 46]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 170:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 170:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 170 (القيمة المسجلة حينها 0).\nمثال: `cumulative([6, 50, 51, 80, 58, 18, 65, 25, 27, 24]) == [6, 56, 107, 0, 58, 76, 141, 166, 0, 24]`\nالجواب:", "qhash": "f70fbbb2f7d0f039"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 82723\nc = 0\nwhile x > 12:\n    x = x // 3\n    c += 1\nprint(x, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 82723\nc = 0\nwhile x > 12:\n    x = x // 3\n    c += 1\nprint(x, c)\n```\nالجواب:", "qhash": "ef3da7633b09975a", "answer": "12 8", "completion": " الناتج:\n```text\n12 8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "lst = [-5, -7, -3, 36, 25, -6, 21, 39]\nprint(lst[1:4])\nprint(lst[::2])\nprint(max(lst[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nlst = [-5, -7, -3, 36, 25, -6, 21, 39]\nprint(lst[1:4])\nprint(lst[::2])\nprint(max(lst[1:4]))\n```\nالجواب:", "qhash": "0bf73a5be89d0552", "answer": "[-7, -3, 36]\n[-5, -3, 25, 21]\n36", "completion": " الناتج:\n```text\n[-7, -3, 36]\n[-5, -3, 25, 21]\n36\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ehi'}", "tests": ["assert letter_stats('desert matrix falcon') == {'e': 2, 'h': 0, 'i': 1}", "assert letter_stats('coffee we') == {'e': 3, 'h': 0, 'i': 0}", "assert letter_stats('camel python vector of') == {'e': 2, 'h': 1, 'i': 0}", "assert letter_stats('code we code window') == {'e': 3, 'h': 0, 'i': 1}", "assert letter_stats('in table pixel falcon') == {'e': 2, 'h': 0, 'i': 2}", "assert letter_stats('we desert') == {'e': 3, 'h': 0, 'i': 0}", "assert letter_stats('') == {'e': 0, 'h': 0, 'i': 0}"], "test_code": "assert letter_stats('desert matrix falcon') == {'e': 2, 'h': 0, 'i': 1}\nassert letter_stats('coffee we') == {'e': 3, 'h': 0, 'i': 0}\nassert letter_stats('camel python vector of') == {'e': 2, 'h': 1, 'i': 0}\nassert letter_stats('code we code window') == {'e': 3, 'h': 0, 'i': 1}\nassert letter_stats('in table pixel falcon') == {'e': 2, 'h': 0, 'i': 2}\nassert letter_stats('we desert') == {'e': 3, 'h': 0, 'i': 0}\nassert letter_stats('') == {'e': 0, 'h': 0, 'i': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ehi'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'ehi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'h'، 'i' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('desert matrix falcon') == {'e': 2, 'h': 0, 'i': 1}`\nالجواب:", "qhash": "739e48559f2822bf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(29566791))\nprint(go(go(29566791)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(29566791))\nprint(go(go(29566791)))\n```\nالجواب:", "qhash": "d22caa470bd053a7", "answer": "45\n9", "completion": " الناتج:\n```text\n45\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(lst):\n    if not lst:\n        return []\n    k = 9 % len(lst)\n    return lst[k:] + lst[:k]", "tests": ["assert roll([48, 32, 41, 47, 17, 30, 35]) == [41, 47, 17, 30, 35, 48, 32]", "assert roll([48, 18, 21, 11, 22, 22]) == [11, 22, 22, 48, 18, 21]", "assert roll([34, 32, 37, 8, -6, 16, 7, 12, 18, 30, 14]) == [30, 14, 34, 32, 37, 8, -6, 16, 7, 12, 18]", "assert roll([32, 18, -2, 29]) == [18, -2, 29, 32]", "assert roll([44, 14, 9, 26, 19, 0]) == [26, 19, 0, 44, 14, 9]", "assert roll([14, 32, 35, 23, 10, 34, 17, 37, 46]) == [14, 32, 35, 23, 10, 34, 17, 37, 46]", "assert roll([]) == []"], "test_code": "assert roll([48, 32, 41, 47, 17, 30, 35]) == [41, 47, 17, 30, 35, 48, 32]\nassert roll([48, 18, 21, 11, 22, 22]) == [11, 22, 22, 48, 18, 21]\nassert roll([34, 32, 37, 8, -6, 16, 7, 12, 18, 30, 14]) == [30, 14, 34, 32, 37, 8, -6, 16, 7, 12, 18]\nassert roll([32, 18, -2, 29]) == [18, -2, 29, 32]\nassert roll([44, 14, 9, 26, 19, 0]) == [26, 19, 0, 44, 14, 9]\nassert roll([14, 32, 35, 23, 10, 34, 17, 37, 46]) == [14, 32, 35, 23, 10, 34, 17, 37, 46]\nassert roll([]) == []", "answer": "def roll(lst):\n    if not lst:\n        return []\n    k = 9 % len(lst)\n    return lst[k:] + lst[:k]", "completion": " ```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 9 % len(lst)\n    return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 9 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 9 % len(lst)\n    return ____\n```\nمثال: `roll([48, 32, 41, 47, 17, 30, 35]) == [41, 47, 17, 30, 35, 48, 32]`\nالجواب:", "qhash": "308dc0ec6ca9277e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)", "tests": ["assert rel_prime_count(47) == 41", "assert rel_prime_count(14) == 12", "assert rel_prime_count(73) == 63", "assert rel_prime_count(107) == 92", "assert rel_prime_count(104) == 90", "assert rel_prime_count(126) == 108", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(47) == 41\nassert rel_prime_count(14) == 12\nassert rel_prime_count(73) == 63\nassert rel_prime_count(107) == 92\nassert rel_prime_count(104) == 90\nassert rel_prime_count(126) == 108\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 7 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(47) == 41`\nالجواب:", "qhash": "a9846027fa42dc38"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'بحر'\nprint(text[0])\nprint(text.split())\nprint(text.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'بحر'\nprint(text[0])\nprint(text.split())\nprint(text.replace(' ', '-'))\n```\nالجواب:", "qhash": "cdbdee9e764f7229", "answer": "ب\n['بحر']\nبحر", "completion": " الناتج:\n```text\nب\n['بحر']\nبحر\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if 9 <= x <= 22)", "tests": ["assert pick_between([29, 21, 18, 21, 16, 32, 32]) == [64, 72, 84, 84]", "assert pick_between([10, -14, 23, 47, -16, 1]) == [40]", "assert pick_between([]) == []", "assert pick_between([60, -8, 25, -9, -3, 40, -25, -15]) == []", "assert pick_between([-16, 25, -17]) == []", "assert pick_between([-23]) == []", "assert pick_between([29, -28, 30, -13]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([29, 21, 18, 21, 16, 32, 32]) == [64, 72, 84, 84]\nassert pick_between([10, -14, 23, 47, -16, 1]) == [40]\nassert pick_between([]) == []\nassert pick_between([60, -8, 25, -9, -3, 40, -25, -15]) == []\nassert pick_between([-16, 25, -17]) == []\nassert pick_between([-23]) == []\nassert pick_between([29, -28, 30, -13]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if 9 <= x <= 22)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * 4 for x in xs if 9 <= x <= 22)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 4 لكل عنصر x في المدى المغلق [9, 22].\nمثال: `pick_between([29, 21, 18, 21, 16, 32, 32]) == [64, 72, 84, 84]`\nالجواب:", "qhash": "43869fd7ba5fe632"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([39, 29, 86, 29, 18, 15, 30, 36, 74, 79, 82, 49]) == 2", "assert count_div([-8, 18, -34, 64, 11, 37, 5, 4, 76]) == 0", "assert count_div([50, -39, 83, -25, 7, -20, -38, 49]) == 1", "assert count_div([61, 90, -25, 58]) == 0", "assert count_div([60, -19, -38, 29, 78, -38, 84, 84, 72, -13]) == 0", "assert count_div([-35, 21]) == 1", "assert count_div([]) == 0"], "test_code": "assert count_div([39, 29, 86, 29, 18, 15, 30, 36, 74, 79, 82, 49]) == 2\nassert count_div([-8, 18, -34, 64, 11, 37, 5, 4, 76]) == 0\nassert count_div([50, -39, 83, -25, 7, -20, -38, 49]) == 1\nassert count_div([61, 90, -25, 58]) == 0\nassert count_div([60, -19, -38, 29, 78, -38, 84, 84, 72, -13]) == 0\nassert count_div([-35, 21]) == 1\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 2. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([39, 29, 86, 29, 18, 15, 30, 36, 74, 79, 82, 49]) == 2`\nالجواب:", "qhash": "e9d0dda7eabb0f67"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n < 2:\n        return n + 0\n    return go(n - 1) + go(n - 2)\n\nprint(go(18))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n < 2:\n        return n + 0\n    return go(n - 1) + go(n - 2)\n\nprint(go(18))\n```\nالجواب:", "qhash": "33d04344bef75515", "answer": "2584", "completion": " الناتج:\n```text\n2584\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['window', 'engine', 'river', 'data', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['window', 'engine', 'river', 'data', 'stone']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "ba183287660890d5", "answer": "['data', 'river', 'stone', 'window', 'engine']\n['window', 'engine', 'stone']", "completion": " الناتج:\n```text\n['data', 'river', 'stone', 'window', 'engine']\n['window', 'engine', 'stone']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_in_text", "reference": "def count_in_text(text):\n    return sum(1 for w in text.split() if 'ك' in w)", "tests": ["assert count_in_text('حديقة ليل برمجة') == 0", "assert count_in_text('جبل نور جبل قمر') == 0", "assert count_in_text('نهر علم برتقال فجر') == 0", "assert count_in_text('مدرسة طالب قمر سلام بحر عربية قمر مدينة') == 0", "assert count_in_text('نهار شجرة رمل دفتر نهار ميناء قهوة') == 0", "assert count_in_text('علم مكتبة سلام جبل مدينة طائرة') == 1", "assert count_in_text('دفتر سماء سماء برمجة') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('حديقة ليل برمجة') == 0\nassert count_in_text('جبل نور جبل قمر') == 0\nassert count_in_text('نهر علم برتقال فجر') == 0\nassert count_in_text('مدرسة طالب قمر سلام بحر عربية قمر مدينة') == 0\nassert count_in_text('نهار شجرة رمل دفتر نهار ميناء قهوة') == 0\nassert count_in_text('علم مكتبة سلام جبل مدينة طائرة') == 1\nassert count_in_text('دفتر سماء سماء برمجة') == 0\nassert count_in_text('') == 0", "answer": "def count_in_text(text):\n    return sum(1 for w in text.split() if 'ك' in w)", "completion": " ```python\ndef count_in_text(text):\n    return sum(1 for w in text.split() if 'ك' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_in_text` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ك» مرة واحدة على الأقل.\nمثال: `count_in_text('حديقة ليل برمجة') == 0`\nالجواب:", "qhash": "d9ea9b6443f1afd7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'summer'\nprint(text[2:4])\nprint(text.capitalize())\nprint(text.find('u'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'summer'\nprint(text[2:4])\nprint(text.capitalize())\nprint(text.find('u'))\n```\nالجواب:", "qhash": "d9c6f836a06386d7", "answer": "mm\nSummer\n1", "completion": " الناتج:\n```text\nmm\nSummer\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_initial", "reference": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "tests": ["assert count_initial('كتاب سماء تفاحة سوق عمل') == 0", "assert count_initial('مكتبة صديق خبز جمل ليل حديقة') == 1", "assert count_initial('جمل قهوة نهر جبل') == 2", "assert count_initial('علم رمل ماء ميناء') == 0", "assert count_initial('جبل جمل فجر مدرسة') == 2", "assert count_initial('قهوة سفينة سيارة دفتر عربية مدرسة') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('كتاب سماء تفاحة سوق عمل') == 0\nassert count_initial('مكتبة صديق خبز جمل ليل حديقة') == 1\nassert count_initial('جمل قهوة نهر جبل') == 2\nassert count_initial('علم رمل ماء ميناء') == 0\nassert count_initial('جبل جمل فجر مدرسة') == 2\nassert count_initial('قهوة سفينة سيارة دفتر عربية مدرسة') == 0\nassert count_initial('') == 0", "answer": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "completion": " ```python\ndef count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ج'):\n            count += 1\n    return count\n```\n", "buggy": "def count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if 'ج' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ج»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_initial(sentence):\n    count = 0\n    for w in sentence.split():\n        if 'ج' in w:\n            count += 1\n    return count\n```\nمثال: `count_initial('كتاب سماء تفاحة سوق عمل') == 0`\nالجواب:", "qhash": "8eed26579d477e65"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 3\nfor i in range(0, 12, 3):\n    acc -= i * 6\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 3\nfor i in range(0, 12, 3):\n    acc -= i * 6\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "fe547bca683390dd", "answer": "-105\n9", "completion": " الناتج:\n```text\n-105\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_text", "reference": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_text('music A1') == 'emkau A1'", "assert shift_text('apple on on planet an') == 'shhdw gf gf hdsfwl sf'", "assert shift_text('engine it python rocket by 2024') == 'wfyafw al hqlzgf jgucwl tq 2024'", "assert shift_text('an it pixel camel OK') == 'sf al hapwd usewd OK'", "assert shift_text('falcon on is cloud') == 'xsdugf gf ak udgmv'", "assert shift_text('apple to !') == 'shhdw lg !'", "assert shift_text('') == ''"], "test_code": "assert shift_text('music A1') == 'emkau A1'\nassert shift_text('apple on on planet an') == 'shhdw gf gf hdsfwl sf'\nassert shift_text('engine it python rocket by 2024') == 'wfyafw al hqlzgf jgucwl tq 2024'\nassert shift_text('an it pixel camel OK') == 'sf al hapwd usewd OK'\nassert shift_text('falcon on is cloud') == 'xsdugf gf ak udgmv'\nassert shift_text('apple to !') == 'shhdw lg !'\nassert shift_text('') == ''", "answer": "def shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_text(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-8)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_text` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 8 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_text('music A1') == 'emkau A1'`\nالجواب:", "qhash": "77c3c96217727a6a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'عمر': 50, 'خالد': 47, 'هدى': 16, 'وليد': 41}\npoints['عمر'] += 14\npoints['يوسف'] = 40\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'عمر': 50, 'خالد': 47, 'هدى': 16, 'وليد': 41}\npoints['عمر'] += 14\npoints['يوسف'] = 40\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "fc61c9a784ea09f0", "answer": "5\nعمر\n208\n[('هدى', 16), ('يوسف', 40)]", "completion": " الناتج:\n```text\n5\nعمر\n208\n[('هدى', 16), ('يوسف', 40)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'زينب': 3, 'عمر': 0, 'باسل': 29, 'نور': 16, 'سلمى': 38}\nmarks['سلمى'] += 4\nmarks['علي'] = 12\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 20])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'زينب': 3, 'عمر': 0, 'باسل': 29, 'نور': 16, 'سلمى': 38}\nmarks['سلمى'] += 4\nmarks['علي'] = 12\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 20])\n```\nالجواب:", "qhash": "43a2b193042b911d", "answer": "6\nسلمى\n102\n['باسل', 'سلمى']", "completion": " الناتج:\n```text\n6\nسلمى\n102\n['باسل', 'سلمى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "tally_letter", "reference": "def tally_letter(text):\n    return sum(1 for w in text.split() if 'ع' in w)", "tests": ["assert tally_letter('مكتبة طالب شجرة جمل خبز') == 0", "assert tally_letter('طالب نور صحراء باب نور باب') == 0", "assert tally_letter('علم برتقال') == 1", "assert tally_letter('') == 0", "assert tally_letter('شجرة ميناء لغة صديق جبل شمس نهار قهوة') == 0", "assert tally_letter('') == 0", "assert tally_letter('عمل ميناء قهوة خبز نور') == 1", "assert tally_letter('') == 0"], "test_code": "assert tally_letter('مكتبة طالب شجرة جمل خبز') == 0\nassert tally_letter('طالب نور صحراء باب نور باب') == 0\nassert tally_letter('علم برتقال') == 1\nassert tally_letter('') == 0\nassert tally_letter('شجرة ميناء لغة صديق جبل شمس نهار قهوة') == 0\nassert tally_letter('') == 0\nassert tally_letter('عمل ميناء قهوة خبز نور') == 1\nassert tally_letter('') == 0", "answer": "def tally_letter(text):\n    return sum(1 for w in text.split() if 'ع' in w)", "completion": " ```python\ndef tally_letter(text):\n    return sum(1 for w in text.split() if 'ع' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `tally_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ع» مرة واحدة على الأقل.\nمثال: `tally_letter('مكتبة طالب شجرة جمل خبز') == 0`\nالجواب:", "qhash": "d641dec78deddaa8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'سيارة'\nprint(kalima[::-1])\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'سيارة'\nprint(kalima[::-1])\nprint(len(kalima.replace(' ', '')))\nprint(len(kalima))\n```\nالجواب:", "qhash": "1ba3eb46bce3a072", "answer": "ةرايس\n5\n5", "completion": " الناتج:\n```text\nةرايس\n5\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'ai'}", "tests": ["assert count_chars('by light in coffee coffee') == {'a': 0, 'i': 2}", "assert count_chars('engine pixel') == {'a': 0, 'i': 2}", "assert count_chars('summer data desert signal table a') == {'a': 5, 'i': 1}", "assert count_chars('go planet vector is python a') == {'a': 2, 'i': 1}", "assert count_chars('garden orange') == {'a': 2, 'i': 0}", "assert count_chars('camel matrix') == {'a': 2, 'i': 1}", "assert count_chars('') == {'a': 0, 'i': 0}"], "test_code": "assert count_chars('by light in coffee coffee') == {'a': 0, 'i': 2}\nassert count_chars('engine pixel') == {'a': 0, 'i': 2}\nassert count_chars('summer data desert signal table a') == {'a': 5, 'i': 1}\nassert count_chars('go planet vector is python a') == {'a': 2, 'i': 1}\nassert count_chars('garden orange') == {'a': 2, 'i': 0}\nassert count_chars('camel matrix') == {'a': 2, 'i': 1}\nassert count_chars('') == {'a': 0, 'i': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'ai'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'ai'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'a'، 'i' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('by light in coffee coffee') == {'a': 0, 'i': 2}`\nالجواب:", "qhash": "502210f8275a5b8f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 3", "tests": ["assert digit_power(28441) == 1", "assert digit_power(348865) == 1", "assert digit_power(185596) == 1", "assert digit_power(456879) == 0", "assert digit_power(414448) == 1", "assert digit_power(111633) == 0", "assert digit_power(941691) == 0", "assert digit_power(0) == 0"], "test_code": "assert digit_power(28441) == 1\nassert digit_power(348865) == 1\nassert digit_power(185596) == 1\nassert digit_power(456879) == 0\nassert digit_power(414448) == 1\nassert digit_power(111633) == 0\nassert digit_power(941691) == 0\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 3", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 3 for d in str(n)) % 3\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 3.\nمثال: `digit_power(28441) == 1`\nالجواب:", "qhash": "f674fdbe8cedfe2c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "value_at", "reference": "def value_at(x):\n    return 1 * x ** 2 + (-6) * x + (1)", "tests": ["assert value_at(9) == 28", "assert value_at(-4) == 41", "assert value_at(12) == 73", "assert value_at(4) == -7", "assert value_at(18) == 217", "assert value_at(14) == 113", "assert value_at(-16) == 353", "assert value_at(0) == 1"], "test_code": "assert value_at(9) == 28\nassert value_at(-4) == 41\nassert value_at(12) == 73\nassert value_at(4) == -7\nassert value_at(18) == 217\nassert value_at(14) == 113\nassert value_at(-16) == 353\nassert value_at(0) == 1", "answer": "def value_at(x):\n    return 1 * x ** 2 + (-6) * x + (1)", "completion": " ```python\ndef value_at(x):\n    return 1 * x ** 2 + (-6) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `value_at` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 1x² - 6x + 1.\nمثال: `value_at(9) == 28`\nالجواب:", "qhash": "465a07c9a705d531"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "game", "reference": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 5 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert game(6) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic']", "assert game(14) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic']", "assert game(1) == ['1']", "assert game(21) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', 'Tac', 'Tic', '17', 'Tic', '19', 'TicTac', '21']", "assert game(6) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic']"], "test_code": "assert game(6) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic']\nassert game(14) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic']\nassert game(1) == ['1']\nassert game(21) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic', '7', 'Tic', '9', 'TicTac', '11', 'Tic', '13', 'Tic', 'Tac', 'Tic', '17', 'Tic', '19', 'TicTac', '21']\nassert game(6) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic']", "answer": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 5 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Tic'\n        if i % 5 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `game` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Tic'، مضاعفات 5 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `game(6) == ['1', 'Tic', '3', 'Tic', 'Tac', 'Tic']`\nالجواب:", "qhash": "646f5001de265b83"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 1\n    return total", "tests": ["assert weighted_sum(7) == 168", "assert weighted_sum(3) == 36", "assert weighted_sum(13) == 546", "assert weighted_sum(11) == 396", "assert weighted_sum(7) == 168", "assert weighted_sum(1) == 6", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(7) == 168\nassert weighted_sum(3) == 36\nassert weighted_sum(13) == 546\nassert weighted_sum(11) == 396\nassert weighted_sum(7) == 168\nassert weighted_sum(1) == 6\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 1\n    return total", "completion": " ```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 1\n    return total\n```\n", "buggy": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 6 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 6 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 6 * i ** 1\n    return total\n```\nمثال: `weighted_sum(7) == 168`\nالجواب:", "qhash": "9ed5241209d153c1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n < 2:\n        return n + 3\n    return rec(n - 1) + rec(n - 2)\n\nprint(rec(13))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n < 2:\n        return n + 3\n    return rec(n - 1) + rec(n - 2)\n\nprint(rec(13))\n```\nالجواب:", "qhash": "5aabaa444ceff4aa", "answer": "1364", "completion": " الناتج:\n```text\n1364\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if 'ص' in w)", "tests": ["assert how_many('سوق برمجة حصان رمل تفاحة') == 1", "assert how_many('شجرة سلام وردة') == 0", "assert how_many('مدرسة شجرة') == 0", "assert how_many('حاسوب ماء برمجة تفاحة عربية عربية علم ميناء') == 0", "assert how_many('سماء خبز برتقال مدينة خبز فجر قمر قلم') == 0", "assert how_many('طائرة قلم حاسوب فجر') == 0", "assert how_many('جبل نهر حديقة') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('سوق برمجة حصان رمل تفاحة') == 1\nassert how_many('شجرة سلام وردة') == 0\nassert how_many('مدرسة شجرة') == 0\nassert how_many('حاسوب ماء برمجة تفاحة عربية عربية علم ميناء') == 0\nassert how_many('سماء خبز برتقال مدينة خبز فجر قمر قلم') == 0\nassert how_many('طائرة قلم حاسوب فجر') == 0\nassert how_many('جبل نهر حديقة') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if 'ص' in w)", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if 'ص' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ص» مرة واحدة على الأقل.\nمثال: `how_many('سوق برمجة حصان رمل تفاحة') == 1`\nالجواب:", "qhash": "4f8eff6b44f3ce44"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 17", "tests": ["assert sum_digit_pow(35632) == 2", "assert sum_digit_pow(650536) == 8", "assert sum_digit_pow(928789) == 9", "assert sum_digit_pow(358959) == 5", "assert sum_digit_pow(922518) == 10", "assert sum_digit_pow(847957) == 6", "assert sum_digit_pow(121874) == 6", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(35632) == 2\nassert sum_digit_pow(650536) == 8\nassert sum_digit_pow(928789) == 9\nassert sum_digit_pow(358959) == 5\nassert sum_digit_pow(922518) == 10\nassert sum_digit_pow(847957) == 6\nassert sum_digit_pow(121874) == 6\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 17", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 1 for d in str(n)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 17.\nمثال: `sum_digit_pow(35632) == 2`\nالجواب:", "qhash": "ce94cef48aeeabff"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return -8 * x ** 2 + (-5) * x + (-4)", "tests": ["assert p(9) == -697", "assert p(-1) == -7", "assert p(14) == -1642", "assert p(-12) == -1096", "assert p(8) == -556", "assert p(-20) == -3104", "assert p(13) == -1421", "assert p(0) == -4"], "test_code": "assert p(9) == -697\nassert p(-1) == -7\nassert p(14) == -1642\nassert p(-12) == -1096\nassert p(8) == -556\nassert p(-20) == -3104\nassert p(13) == -1421\nassert p(0) == -4", "answer": "def p(x):\n    return -8 * x ** 2 + (-5) * x + (-4)", "completion": " ```python\ndef p(x):\n    return -8 * x ** 2 + (-5) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -8x² - 5x - 4.\nمثال: `p(9) == -697`\nالجواب:", "qhash": "60cd1f2ed69e9150"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "tests": ["assert sum_multiples(122) == 1565", "assert sum_multiples(224) == 5188", "assert sum_multiples(72) == 580", "assert sum_multiples(36) == 144", "assert sum_multiples(235) == 5877", "assert sum_multiples(99) == 1008", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(122) == 1565\nassert sum_multiples(224) == 5188\nassert sum_multiples(72) == 580\nassert sum_multiples(36) == 144\nassert sum_multiples(235) == 5877\nassert sum_multiples(99) == 1008\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 7 أو 13 دون باقٍ.\nمثال: `sum_multiples(122) == 1565`\nالجواب:", "qhash": "fd4169a05e8a3c7d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['desert', 'banana', 'light', 'window', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['desert', 'banana', 'light', 'window', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "319a1c27a1361e43", "answer": "['light', 'desert', 'banana', 'window', 'winter']\n['winter', 'window', 'desert']", "completion": " الناتج:\n```text\n['light', 'desert', 'banana', 'window', 'winter']\n['winter', 'window', 'desert']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['rocket', 'table', 'coffee', 'brain', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['rocket', 'table', 'coffee', 'brain', 'signal']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "7e798b488dea16bf", "answer": "['table', 'brain', 'rocket', 'coffee', 'signal']\n['signal', 'rocket', 'coffee']", "completion": " الناتج:\n```text\n['table', 'brain', 'rocket', 'coffee', 'signal']\n['signal', 'rocket', 'coffee']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'gn'}", "tests": ["assert char_freq('window an') == {'g': 0, 'n': 2}", "assert char_freq('desert to coffee music at summer') == {'g': 0, 'n': 0}", "assert char_freq('cloud code vector signal window') == {'g': 1, 'n': 2}", "assert char_freq('camel falcon go falcon we we') == {'g': 1, 'n': 2}", "assert char_freq('an signal it vector window cloud') == {'g': 1, 'n': 3}", "assert char_freq('falcon code planet') == {'g': 0, 'n': 2}", "assert char_freq('') == {'g': 0, 'n': 0}"], "test_code": "assert char_freq('window an') == {'g': 0, 'n': 2}\nassert char_freq('desert to coffee music at summer') == {'g': 0, 'n': 0}\nassert char_freq('cloud code vector signal window') == {'g': 1, 'n': 2}\nassert char_freq('camel falcon go falcon we we') == {'g': 1, 'n': 2}\nassert char_freq('an signal it vector window cloud') == {'g': 1, 'n': 3}\nassert char_freq('falcon code planet') == {'g': 0, 'n': 2}\nassert char_freq('') == {'g': 0, 'n': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'gn'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'gn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'g'، 'n' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('window an') == {'g': 0, 'n': 2}`\nالجواب:", "qhash": "fb6ff6ad94225601"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'مطر'\nprint('ط' in text)\nprint(text[0])\nprint(text.find('ط'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'مطر'\nprint('ط' in text)\nprint(text[0])\nprint(text.find('ط'))\n```\nالجواب:", "qhash": "46499958c627b22e", "answer": "True\nم\n1", "completion": " الناتج:\n```text\nTrue\nم\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprime_count", "reference": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 16) == 1)", "tests": ["assert coprime_count(97) == 49", "assert coprime_count(53) == 27", "assert coprime_count(86) == 43", "assert coprime_count(54) == 27", "assert coprime_count(132) == 66", "assert coprime_count(82) == 41", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(97) == 49\nassert coprime_count(53) == 27\nassert coprime_count(86) == 43\nassert coprime_count(54) == 27\nassert coprime_count(132) == 66\nassert coprime_count(82) == 41\nassert coprime_count(1) == 1", "answer": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 16) == 1)", "completion": " ```python\ndef coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 16) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 16 في أي قاسم أكبر من 1.\nمثال: `coprime_count(97) == 49`\nالجواب:", "qhash": "7e2d2ae29fb4b583"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(7, 1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(7, 1))\n```\nالجواب:", "qhash": "13fd7b2dfcdf2c15", "answer": "7", "completion": " الناتج:\n```text\n7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([58, 22, 23, 30, -16]) == None", "assert biggest_mult([-7, -28, -21]) == -7", "assert biggest_mult([1, 8, 15, 22]) == None", "assert biggest_mult([7, -28]) == 7", "assert biggest_mult([-29, 35, -26, -25, 48]) == 35", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([58, 22, 23, 30, -16]) == None\nassert biggest_mult([-7, -28, -21]) == -7\nassert biggest_mult([1, 8, 15, 22]) == None\nassert biggest_mult([7, -28]) == 7\nassert biggest_mult([-29, 35, -26, -25, 48]) == 35\nassert biggest_mult([]) == None", "answer": "def biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(arr):\n    best = 0\n    for x in arr:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(arr):\n    best = 0\n    for x in arr:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([58, 22, 23, 30, -16]) == None`\nالجواب:", "qhash": "16cf44ed78aa29ee"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('صديق تفاحة تفاحة علم') == 2", "assert prefix_hits('طائرة سيارة صحراء سيارة قمر كتاب') == 0", "assert prefix_hits('صديق مكتبة سفينة جبل مكتبة') == 0", "assert prefix_hits('سلام لغة تفاحة') == 1", "assert prefix_hits('سفينة تفاحة نهار عربية') == 1", "assert prefix_hits('سفينة برتقال نور ماء مدينة تفاحة فجر') == 1", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('صديق تفاحة تفاحة علم') == 2\nassert prefix_hits('طائرة سيارة صحراء سيارة قمر كتاب') == 0\nassert prefix_hits('صديق مكتبة سفينة جبل مكتبة') == 0\nassert prefix_hits('سلام لغة تفاحة') == 1\nassert prefix_hits('سفينة تفاحة نهار عربية') == 1\nassert prefix_hits('سفينة برتقال نور ماء مدينة تفاحة فجر') == 1\nassert prefix_hits('') == 0", "answer": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ت'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(text):\n    count = 0\n    for w in text:\n        if w.startswith('ت'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ت»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(text):\n    count = 0\n    for w in text:\n        if w.startswith('ت'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('صديق تفاحة تفاحة علم') == 2`\nالجواب:", "qhash": "dd504302c4c4b3af"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 190\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 190\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "7d5c891f81300083", "answer": "106", "completion": " الناتج:\n```text\n106\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 378\ncount = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 378\ncount = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "8b474bc70eb8a4d5", "answer": "107", "completion": " الناتج:\n```text\n107\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 152:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([14, 8, 50, 13, 52, 36, 70, 42, 79, 78]) == [14, 22, 72, 85, 137, 0, 70, 112, 0, 78]", "assert reset_sum([3, 80, 42, -7, 61, 82, 5]) == [3, 83, 125, 118, 0, 82, 87]", "assert reset_sum([4, 52, 58, 55, 54, 4]) == [4, 56, 114, 0, 54, 58]", "assert reset_sum([38, 10, 121, 79, 3]) == [38, 48, 0, 79, 82]", "assert reset_sum([61, 8, 18, 12, 35, 42]) == [61, 69, 87, 99, 134, 0]", "assert reset_sum([126, 35, -4, 79, 80, 96, 106]) == [126, 0, -4, 75, 0, 96, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([14, 8, 50, 13, 52, 36, 70, 42, 79, 78]) == [14, 22, 72, 85, 137, 0, 70, 112, 0, 78]\nassert reset_sum([3, 80, 42, -7, 61, 82, 5]) == [3, 83, 125, 118, 0, 82, 87]\nassert reset_sum([4, 52, 58, 55, 54, 4]) == [4, 56, 114, 0, 54, 58]\nassert reset_sum([38, 10, 121, 79, 3]) == [38, 48, 0, 79, 82]\nassert reset_sum([61, 8, 18, 12, 35, 42]) == [61, 69, 87, 99, 134, 0]\nassert reset_sum([126, 35, -4, 79, 80, 96, 106]) == [126, 0, -4, 75, 0, 96, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 152:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 152:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 152 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([14, 8, 50, 13, 52, 36, 70, 42, 79, 78]) == [14, 22, 72, 85, 137, 0, 70, 112, 0, 78]`\nالجواب:", "qhash": "80085eaa19032d04"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']", "assert fizzbuzz(15) == ['1', '2', '3', 'Sun', 'Moon', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', 'Moon']", "assert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']", "assert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']", "assert fizzbuzz(1) == ['1']"], "test_code": "assert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']\nassert fizzbuzz(15) == ['1', '2', '3', 'Sun', 'Moon', '6', '7', 'Sun', '9', 'Moon', '11', 'Sun', '13', '14', 'Moon']\nassert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']\nassert fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']\nassert fizzbuzz(1) == ['1']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 4 تصبح 'Sun'، مضاعفات 5 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(5) == ['1', '2', '3', 'Sun', 'Moon']`\nالجواب:", "qhash": "85a09efa60d886dc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 64) == 1)", "tests": ["assert phi_upto(147) == 74", "assert phi_upto(54) == 27", "assert phi_upto(159) == 80", "assert phi_upto(195) == 98", "assert phi_upto(18) == 9", "assert phi_upto(36) == 18", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(147) == 74\nassert phi_upto(54) == 27\nassert phi_upto(159) == 80\nassert phi_upto(195) == 98\nassert phi_upto(18) == 9\nassert phi_upto(36) == 18\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 64) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 64) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 64 في أي قاسم أكبر من 1.\nمثال: `phi_upto(147) == 74`\nالجواب:", "qhash": "5f84636046f8e61d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'راشد': 46, 'عمر': 50, 'أحمد': 15, 'باسل': 22}\nscores['أحمد'] += 18\nscores['يوسف'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'راشد': 46, 'عمر': 50, 'أحمد': 15, 'باسل': 22}\nscores['أحمد'] += 18\nscores['يوسف'] = 34\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('باسل', -1))\n```\nالجواب:", "qhash": "a61780e8dde9a90d", "answer": "5\nعمر\n185\n22", "completion": " الناتج:\n```text\n5\nعمر\n185\n22\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [27, 9, 29, 23, 13, 5, 26, 5]\nprint(a[2:4])\nprint(a[::3])\nprint(min(a[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [27, 9, 29, 23, 13, 5, 26, 5]\nprint(a[2:4])\nprint(a[::3])\nprint(min(a[2:4]))\n```\nالجواب:", "qhash": "4803d06c2ce16232", "answer": "[29, 23]\n[27, 23, 26]\n23", "completion": " الناتج:\n```text\n[29, 23]\n[27, 23, 26]\n23\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'دفتر'\nprint(w.count('د'))\nprint(w[0])\nprint('د' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'دفتر'\nprint(w.count('د'))\nprint(w[0])\nprint('د' in w)\n```\nالجواب:", "qhash": "5cba468435637a8b", "answer": "1\nد\nTrue", "completion": " الناتج:\n```text\n1\nد\nTrue\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 1\nfor i in range(2, 17, 2):\n    acc += i * 8\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 1\nfor i in range(2, 17, 2):\n    acc += i * 8\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "9bdfa652bff03c59", "answer": "577\n16", "completion": " الناتج:\n```text\n577\n16\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "tally", "reference": "def tally(s):\n    return {c: s.count(c) for c in 'de'}", "tests": ["assert tally('vector at matrix') == {'d': 0, 'e': 1}", "assert tally('on on banana banana window music') == {'d': 1, 'e': 0}", "assert tally('it') == {'d': 0, 'e': 0}", "assert tally('signal') == {'d': 0, 'e': 0}", "assert tally('music') == {'d': 0, 'e': 0}", "assert tally('camel pixel rocket summer up we') == {'d': 0, 'e': 5}", "assert tally('') == {'d': 0, 'e': 0}"], "test_code": "assert tally('vector at matrix') == {'d': 0, 'e': 1}\nassert tally('on on banana banana window music') == {'d': 1, 'e': 0}\nassert tally('it') == {'d': 0, 'e': 0}\nassert tally('signal') == {'d': 0, 'e': 0}\nassert tally('music') == {'d': 0, 'e': 0}\nassert tally('camel pixel rocket summer up we') == {'d': 0, 'e': 5}\nassert tally('') == {'d': 0, 'e': 0}", "answer": "def tally(s):\n    return {c: s.count(c) for c in 'de'}", "completion": " ```python\ndef tally(s):\n    return {c: s.count(c) for c in 'de'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `tally` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'd'، 'e' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `tally('vector at matrix') == {'d': 0, 'e': 1}`\nالجواب:", "qhash": "6f39652bb0161776"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def h(x, y=4):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(h(0))\nprint(h(0, 13))\nprint(h(h(13), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef h(x, y=4):\n    if x > y:\n        return x * -2 - y\n    return x + y * -2\n\nprint(h(0))\nprint(h(0, 13))\nprint(h(h(13), 0))\n```\nالجواب:", "qhash": "279de924706df5d0", "answer": "-8\n-26\n-30", "completion": " الناتج:\n```text\n-8\n-26\n-30\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return -4 * x ** 2 + (5) * x + (4)", "tests": ["assert poly(8) == -212", "assert poly(-8) == -292", "assert poly(2) == -2", "assert poly(-9) == -365", "assert poly(19) == -1345", "assert poly(0) == 4", "assert poly(-12) == -632", "assert poly(0) == 4"], "test_code": "assert poly(8) == -212\nassert poly(-8) == -292\nassert poly(2) == -2\nassert poly(-9) == -365\nassert poly(19) == -1345\nassert poly(0) == 4\nassert poly(-12) == -632\nassert poly(0) == 4", "answer": "def poly(x):\n    return -4 * x ** 2 + (5) * x + (4)", "completion": " ```python\ndef poly(x):\n    return -4 * x ** 2 + (5) * x + (4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -4x² + 5x + 4.\nمثال: `poly(8) == -212`\nالجواب:", "qhash": "3d5ec45b069c160b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * 3 + -3 for x in range(1, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * 3 + -3 for x in range(1, 9) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "e3643d1a72c432f3", "answer": "[0, 6, 12, 18]\n4 36", "completion": " الناتج:\n```text\n[0, 6, 12, 18]\n4 36\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "cumulative", "reference": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 90:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert cumulative([34, 22, 9, 43, 9, 24, 24, 14]) == [34, 56, 65, 0, 9, 33, 57, 71]", "assert cumulative([27, 24, 41, 83, 24]) == [27, 51, 0, 83, 0]", "assert cumulative([15, 11, 3]) == [15, 26, 29]", "assert cumulative([47, 46, 51, 17, 61, 79, 10]) == [47, 0, 51, 68, 0, 79, 89]", "assert cumulative([55]) == [55]", "assert cumulative([32]) == [32]", "assert cumulative([]) == []"], "test_code": "assert cumulative([34, 22, 9, 43, 9, 24, 24, 14]) == [34, 56, 65, 0, 9, 33, 57, 71]\nassert cumulative([27, 24, 41, 83, 24]) == [27, 51, 0, 83, 0]\nassert cumulative([15, 11, 3]) == [15, 26, 29]\nassert cumulative([47, 46, 51, 17, 61, 79, 10]) == [47, 0, 51, 68, 0, 79, 89]\nassert cumulative([55]) == [55]\nassert cumulative([32]) == [32]\nassert cumulative([]) == []", "answer": "def cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 90:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef cumulative(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 90:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cumulative` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 90 (القيمة المسجلة حينها 0).\nمثال: `cumulative([34, 22, 9, 43, 9, 24, 24, 14]) == [34, 56, 65, 0, 9, 33, 57, 71]`\nالجواب:", "qhash": "a3cc0ae0a73be51e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_by", "reference": "def rotate_by(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[k:] + lst[:k]", "tests": ["assert rotate_by([36, 39, 36]) == [36, 36, 39]", "assert rotate_by([5, -7, 5, 25, 25, 48]) == [5, 25, 25, 48, 5, -7]", "assert rotate_by([-2, 8, 35, -1, 33, 5, 37, 9]) == [33, 5, 37, 9, -2, 8, 35, -1]", "assert rotate_by([-4, 42, 18, 3]) == [-4, 42, 18, 3]", "assert rotate_by([-3, 49, 24, 11, 17, 22, 45, 44, 2]) == [24, 11, 17, 22, 45, 44, 2, -3, 49]", "assert rotate_by([14, -1, 32, 14, 30, 28, 44, 6, 50, 22]) == [14, -1, 32, 14, 30, 28, 44, 6, 50, 22]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([36, 39, 36]) == [36, 36, 39]\nassert rotate_by([5, -7, 5, 25, 25, 48]) == [5, 25, 25, 48, 5, -7]\nassert rotate_by([-2, 8, 35, -1, 33, 5, 37, 9]) == [33, 5, 37, 9, -2, 8, 35, -1]\nassert rotate_by([-4, 42, 18, 3]) == [-4, 42, 18, 3]\nassert rotate_by([-3, 49, 24, 11, 17, 22, 45, 44, 2]) == [24, 11, 17, 22, 45, 44, 2, -3, 49]\nassert rotate_by([14, -1, 32, 14, 30, 28, 44, 6, 50, 22]) == [14, -1, 32, 14, 30, 28, 44, 6, 50, 22]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[k:] + lst[:k]", "completion": " ```python\ndef rotate_by(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[k:] + lst[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_by(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return ____\n```\nمثال: `rotate_by([36, 39, 36]) == [36, 36, 39]`\nالجواب:", "qhash": "3f02f637f8c62f75"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "tests": ["assert add_multiples(187) == 3138", "assert add_multiples(171) == 2605", "assert add_multiples(27) == 66", "assert add_multiples(84) == 678", "assert add_multiples(155) == 2118", "assert add_multiples(228) == 4797", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(187) == 3138\nassert add_multiples(171) == 2605\nassert add_multiples(27) == 66\nassert add_multiples(84) == 678\nassert add_multiples(155) == 2118\nassert add_multiples(228) == 4797\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 9 أو 13 دون باقٍ.\nمثال: `add_multiples(187) == 3138`\nالجواب:", "qhash": "3d1deb8592739252"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['cloud', 'window', 'data', 'light', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['cloud', 'window', 'data', 'light', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "aa1a1baf0856025f", "answer": "['data', 'cloud', 'light', 'table', 'window']\n['window', 'table', 'light']", "completion": " الناتج:\n```text\n['data', 'cloud', 'light', 'table', 'window']\n['window', 'table', 'light']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_by", "reference": "def rotate_by(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_by([35, 28, 1]) == [28, 1, 35]", "assert rotate_by([35, 13, -5, 23, 23, 42, -4, -1, -5, 34]) == [42, -4, -1, -5, 34, 35, 13, -5, 23, 23]", "assert rotate_by([47, 7, 12, 41, -5, 28, 19, 36, -1, 26, 45, 12]) == [36, -1, 26, 45, 12, 47, 7, 12, 41, -5, 28, 19]", "assert rotate_by([50, 0, -3, -6, 15, 24, 7, 0, 44, 46, 35, 4]) == [0, 44, 46, 35, 4, 50, 0, -3, -6, 15, 24, 7]", "assert rotate_by([-8, 23, 3, -1, 34]) == [-8, 23, 3, -1, 34]", "assert rotate_by([42, 41, 9, 10]) == [10, 42, 41, 9]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([35, 28, 1]) == [28, 1, 35]\nassert rotate_by([35, 13, -5, 23, 23, 42, -4, -1, -5, 34]) == [42, -4, -1, -5, 34, 35, 13, -5, 23, 23]\nassert rotate_by([47, 7, 12, 41, -5, 28, 19, 36, -1, 26, 45, 12]) == [36, -1, 26, 45, 12, 47, 7, 12, 41, -5, 28, 19]\nassert rotate_by([50, 0, -3, -6, 15, 24, 7, 0, 44, 46, 35, 4]) == [0, 44, 46, 35, 4, 50, 0, -3, -6, 15, 24, 7]\nassert rotate_by([-8, 23, 3, -1, 34]) == [-8, 23, 3, -1, 34]\nassert rotate_by([42, 41, 9, 10]) == [10, 42, 41, 9]\nassert rotate_by([]) == []", "answer": "def rotate_by(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef rotate_by(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_by(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return ____\n```\nمثال: `rotate_by([35, 28, 1]) == [28, 1, 35]`\nالجواب:", "qhash": "addf1e4a7e69bb27"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * 0 + 1 for x in range(1, 11) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * 0 + 1 for x in range(1, 11) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "69ce2e444175fc0a", "answer": "[1, 1]\n2 2", "completion": " الناتج:\n```text\n[1, 1]\n2 2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return 6 * x ** 2 + (8) * x + (8)", "tests": ["assert evaluate(8) == 456", "assert evaluate(-1) == 6", "assert evaluate(0) == 8", "assert evaluate(-3) == 38", "assert evaluate(-13) == 918", "assert evaluate(18) == 2096", "assert evaluate(6) == 272", "assert evaluate(0) == 8"], "test_code": "assert evaluate(8) == 456\nassert evaluate(-1) == 6\nassert evaluate(0) == 8\nassert evaluate(-3) == 38\nassert evaluate(-13) == 918\nassert evaluate(18) == 2096\nassert evaluate(6) == 272\nassert evaluate(0) == 8", "answer": "def evaluate(x):\n    return 6 * x ** 2 + (8) * x + (8)", "completion": " ```python\ndef evaluate(x):\n    return 6 * x ** 2 + (8) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 6x² + 8x + 8.\nمثال: `evaluate(8) == 456`\nالجواب:", "qhash": "4ae49e815bfd6f35"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 63) == 1)", "tests": ["assert coprimes(96) == 55", "assert coprimes(168) == 96", "assert coprimes(74) == 43", "assert coprimes(76) == 44", "assert coprimes(106) == 61", "assert coprimes(141) == 80", "assert coprimes(1) == 1"], "test_code": "assert coprimes(96) == 55\nassert coprimes(168) == 96\nassert coprimes(74) == 43\nassert coprimes(76) == 44\nassert coprimes(106) == 61\nassert coprimes(141) == 80\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 63) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 63) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 63 في أي قاسم أكبر من 1.\nمثال: `coprimes(96) == 55`\nالجواب:", "qhash": "46fc3f00e3317a8e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x ** 2 - 5 for x in range(-6, 3) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x ** 2 - 5 for x in range(-6, 3) if x % 3 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "da16125ab3c73faa", "answer": "[11, -4, -1]\n3 6", "completion": " الناتج:\n```text\n[11, -4, -1]\n3 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "rev_join", "reference": "def rev_join(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert rev_join('coffee banana window matrix an on orange') == 'orange|on|an|matrix|window|banana|coffee'", "assert rev_join('') == ''", "assert rev_join('is matrix camel') == 'camel|matrix|is'", "assert rev_join('') == ''", "assert rev_join('engine') == 'engine'", "assert rev_join('to is up a window light go') == 'go|light|window|up|is|to'", "assert rev_join('light brain is orange at to planet') == 'planet|to|at|orange|is|brain|light'"], "test_code": "assert rev_join('coffee banana window matrix an on orange') == 'orange|on|an|matrix|window|banana|coffee'\nassert rev_join('') == ''\nassert rev_join('is matrix camel') == 'camel|matrix|is'\nassert rev_join('') == ''\nassert rev_join('engine') == 'engine'\nassert rev_join('to is up a window light go') == 'go|light|window|up|is|to'\nassert rev_join('light brain is orange at to planet') == 'planet|to|at|orange|is|brain|light'", "answer": "def rev_join(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef rev_join(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `rev_join` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '|'.\nمثال: `rev_join('coffee banana window matrix an on orange') == 'orange|on|an|matrix|window|banana|coffee'`\nالجواب:", "qhash": "7e9f26cbf520be7a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'سلمى': 45, 'هشام': 3, 'يوسف': 9}\nmarks['يوسف'] += 6\nmarks['باسل'] = 52\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 27])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'سلمى': 45, 'هشام': 3, 'يوسف': 9}\nmarks['يوسف'] += 6\nmarks['باسل'] = 52\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 27])\n```\nالجواب:", "qhash": "319787d33df16c19", "answer": "4\nباسل\n115\n['سلمى', 'باسل']", "completion": " الناتج:\n```text\n4\nباسل\n115\n['سلمى', 'باسل']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'river'\nprint(name.count('i'))\nprint(name.upper())\nprint(len(name))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'river'\nprint(name.count('i'))\nprint(name.upper())\nprint(len(name))\n```\nالجواب:", "qhash": "bf4d551e665eb560", "answer": "1\nRIVER\n5", "completion": " الناتج:\n```text\n1\nRIVER\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "tests": ["assert lead_count('مدينة كتاب') == 0", "assert lead_count('قلم جبل حصان') == 1", "assert lead_count('سفينة معلم جبل قلم') == 1", "assert lead_count('قلم سلام فجر رمل جبل نور طائرة') == 1", "assert lead_count('ميناء برتقال سماء معلم دفتر قهوة') == 0", "assert lead_count('علم علم') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('مدينة كتاب') == 0\nassert lead_count('قلم جبل حصان') == 1\nassert lead_count('سفينة معلم جبل قلم') == 1\nassert lead_count('قلم سلام فجر رمل جبل نور طائرة') == 1\nassert lead_count('ميناء برتقال سماء معلم دفتر قهوة') == 0\nassert lead_count('علم علم') == 0\nassert lead_count('') == 0", "answer": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ج'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ج»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ج'):\n            count += 1\n    return count\n```\nمثال: `lead_count('مدينة كتاب') == 0`\nالجواب:", "qhash": "2e74ff3420086c64"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "reverse_words", "reference": "def reverse_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert reverse_words('brain we in data vector') == 'vector,data,brain'", "assert reverse_words('matrix brain in winter') == 'winter,brain,matrix'", "assert reverse_words('planet music engine window coffee desert apple python') == 'python,apple,desert,coffee,window,engine,music,planet'", "assert reverse_words('in engine desert up we table coffee') == 'coffee,table,desert,engine'", "assert reverse_words('') == ''", "assert reverse_words('orange table up summer') == 'summer,table,orange'", "assert reverse_words('we go light pixel apple river on table') == 'table,river,apple,pixel,light'"], "test_code": "assert reverse_words('brain we in data vector') == 'vector,data,brain'\nassert reverse_words('matrix brain in winter') == 'winter,brain,matrix'\nassert reverse_words('planet music engine window coffee desert apple python') == 'python,apple,desert,coffee,window,engine,music,planet'\nassert reverse_words('in engine desert up we table coffee') == 'coffee,table,desert,engine'\nassert reverse_words('') == ''\nassert reverse_words('orange table up summer') == 'summer,table,orange'\nassert reverse_words('we go light pixel apple river on table') == 'table,river,apple,pixel,light'", "answer": "def reverse_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef reverse_words(s):\n    return ','.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `reverse_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل ','.\nمثال: `reverse_words('brain we in data vector') == 'vector,data,brain'`\nالجواب:", "qhash": "6b705fc9e1c26226"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "tests": ["assert sum_multiples(287) == 11301", "assert sum_multiples(214) == 6275", "assert sum_multiples(220) == 6490", "assert sum_multiples(110) == 1595", "assert sum_multiples(146) == 3011", "assert sum_multiples(255) == 8861", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(287) == 11301\nassert sum_multiples(214) == 6275\nassert sum_multiples(220) == 6490\nassert sum_multiples(110) == 1595\nassert sum_multiples(146) == 3011\nassert sum_multiples(255) == 8861\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 5 أو 11 دون باقٍ.\nمثال: `sum_multiples(287) == 11301`\nالجواب:", "qhash": "9e17d6ce3019220d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n <= 1:\n        return 2\n    return 2 * rec(n - 1) + -1\n\nprint(rec(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n <= 1:\n        return 2\n    return 2 * rec(n - 1) + -1\n\nprint(rec(7))\n```\nالجواب:", "qhash": "f6dd299ead842eba", "answer": "65", "completion": " الناتج:\n```text\n65\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=6):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(g(17))\nprint(g(17, 3))\nprint(g(g(3), 17))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=6):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(g(17))\nprint(g(17, 3))\nprint(g(g(3), 17))\n```\nالجواب:", "qhash": "3f10db0c47e3dd53", "answer": "-74\n-71\n-89", "completion": " الناتج:\n```text\n-74\n-71\n-89\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 20\nfor j in range(-1, 6, 2):\n    result -= j * 2\nprint(result)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 20\nfor j in range(-1, 6, 2):\n    result -= j * 2\nprint(result)\nprint(j)\n```\nالجواب:", "qhash": "b1fd45e4b9d05433", "answer": "4\n5", "completion": " الناتج:\n```text\n4\n5\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_coprime", "reference": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)", "tests": ["assert count_coprime(102) == 101", "assert count_coprime(36) == 36", "assert count_coprime(17) == 17", "assert count_coprime(155) == 153", "assert count_coprime(112) == 111", "assert count_coprime(118) == 117", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(102) == 101\nassert count_coprime(36) == 36\nassert count_coprime(17) == 17\nassert count_coprime(155) == 153\nassert count_coprime(112) == 111\nassert count_coprime(118) == 117\nassert count_coprime(1) == 1", "answer": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)", "completion": " ```python\ndef count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 71) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_coprime` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 71 في أي قاسم أكبر من 1.\nمثال: `count_coprime(102) == 101`\nالجواب:", "qhash": "dd0ba90257a8a225"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 71", "tests": ["assert fact_mod(6) == 10", "assert fact_mod(3) == 6", "assert fact_mod(56) == 68", "assert fact_mod(30) == 5", "assert fact_mod(3) == 6", "assert fact_mod(60) == 64", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(6) == 10\nassert fact_mod(3) == 6\nassert fact_mod(56) == 68\nassert fact_mod(30) == 5\nassert fact_mod(3) == 6\nassert fact_mod(60) == 64\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 71", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 1)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(6) == 10`\nالجواب:", "qhash": "ebaa204116a82b5c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 32) == 1)", "tests": ["assert phi_upto(123) == 62", "assert phi_upto(193) == 97", "assert phi_upto(52) == 26", "assert phi_upto(21) == 11", "assert phi_upto(86) == 43", "assert phi_upto(142) == 71", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(123) == 62\nassert phi_upto(193) == 97\nassert phi_upto(52) == 26\nassert phi_upto(21) == 11\nassert phi_upto(86) == 43\nassert phi_upto(142) == 71\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 32) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 32) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 32 في أي قاسم أكبر من 1.\nمثال: `phi_upto(123) == 62`\nالجواب:", "qhash": "2c9ebd45cb2516e6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 53) == 1)", "tests": ["assert coprimes(132) == 130", "assert coprimes(143) == 141", "assert coprimes(48) == 48", "assert coprimes(48) == 48", "assert coprimes(89) == 88", "assert coprimes(49) == 49", "assert coprimes(1) == 1"], "test_code": "assert coprimes(132) == 130\nassert coprimes(143) == 141\nassert coprimes(48) == 48\nassert coprimes(48) == 48\nassert coprimes(89) == 88\nassert coprimes(49) == 49\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 53) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 53) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 53 في أي قاسم أكبر من 1.\nمثال: `coprimes(132) == 130`\nالجواب:", "qhash": "a76499acffe066ba"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "xs = [36, -6, 20, -6, 18]\nprint(xs[0:4])\nprint(xs[::2])\nprint(max(xs[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nxs = [36, -6, 20, -6, 18]\nprint(xs[0:4])\nprint(xs[::2])\nprint(max(xs[0:4]))\n```\nالجواب:", "qhash": "fc319428e94f24d0", "answer": "[36, -6, 20, -6]\n[36, 20, 18]\n36", "completion": " الناتج:\n```text\n[36, -6, 20, -6]\n[36, 20, 18]\n36\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(6, 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(6, 5))\n```\nالجواب:", "qhash": "b989389b86b08a3c", "answer": "7776", "completion": " الناتج:\n```text\n7776\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return 6 * x ** 2 + (-1) * x + (2)", "tests": ["assert p(7) == 289", "assert p(10) == 592", "assert p(10) == 592", "assert p(2) == 24", "assert p(5) == 147", "assert p(-20) == 2422", "assert p(9) == 479", "assert p(0) == 2"], "test_code": "assert p(7) == 289\nassert p(10) == 592\nassert p(10) == 592\nassert p(2) == 24\nassert p(5) == 147\nassert p(-20) == 2422\nassert p(9) == 479\nassert p(0) == 2", "answer": "def p(x):\n    return 6 * x ** 2 + (-1) * x + (2)", "completion": " ```python\ndef p(x):\n    return 6 * x ** 2 + (-1) * x + (2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 6x² - 1x + 2.\nمثال: `p(7) == 289`\nالجواب:", "qhash": "484fd4d45e909fd0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert flip_words('summer stone code a it pixel orange') == 'orange|pixel|code|stone|summer'", "assert flip_words('rocket') == 'rocket'", "assert flip_words('') == ''", "assert flip_words('cloud pixel matrix garden at apple by') == 'apple|garden|matrix|pixel|cloud'", "assert flip_words('music code brain light code up') == 'code|light|brain|code|music'", "assert flip_words('table up data of light on table window') == 'window|table|light|data|table'", "assert flip_words('apple') == 'apple'"], "test_code": "assert flip_words('summer stone code a it pixel orange') == 'orange|pixel|code|stone|summer'\nassert flip_words('rocket') == 'rocket'\nassert flip_words('') == ''\nassert flip_words('cloud pixel matrix garden at apple by') == 'apple|garden|matrix|pixel|cloud'\nassert flip_words('music code brain light code up') == 'code|light|brain|code|music'\nassert flip_words('table up data of light on table window') == 'window|table|light|data|table'\nassert flip_words('apple') == 'apple'", "answer": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 4 من آخرها إلى أولها، موصولة بالفاصل '|'.\nمثال: `flip_words('summer stone code a it pixel orange') == 'orange|pixel|code|stone|summer'`\nالجواب:", "qhash": "b068755a9413cc4a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(4, 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(4, 8))\n```\nالجواب:", "qhash": "c817088778862dd6", "answer": "65536", "completion": " الناتج:\n```text\n65536\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_special", "reference": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert count_special([88, 63, 29, 61, 38, 12, 86]) == 2", "assert count_special([83, 9, 73, 75, -13, 39]) == 0", "assert count_special([-28, -20]) == 1", "assert count_special([80, 13]) == 1", "assert count_special([38, -15, -36]) == 1", "assert count_special([19, -4, 83, 2, 4, -40, -13, 88, -18, -13]) == 4", "assert count_special([]) == 0"], "test_code": "assert count_special([88, 63, 29, 61, 38, 12, 86]) == 2\nassert count_special([83, 9, 73, 75, -13, 39]) == 0\nassert count_special([-28, -20]) == 1\nassert count_special([80, 13]) == 1\nassert count_special([38, -15, -36]) == 1\nassert count_special([19, -4, 83, 2, 4, -40, -13, 88, -18, -13]) == 4\nassert count_special([]) == 0", "answer": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_special([88, 63, 29, 61, 38, 12, 86]) == 2`\nالجواب:", "qhash": "1375a4031e6ee69d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([-3, 51, -28, -15, 20, 17, -9]) == -9", "assert biggest_mult([-9, -36, -45]) == -9", "assert biggest_mult([1]) == None", "assert biggest_mult([10, -40, -15, -37, -34]) == None", "assert biggest_mult([30, -1, -31, -40, 43, 5, 25, -43]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-3, 51, -28, -15, 20, 17, -9]) == -9\nassert biggest_mult([-9, -36, -45]) == -9\nassert biggest_mult([1]) == None\nassert biggest_mult([10, -40, -15, -37, -34]) == None\nassert biggest_mult([30, -1, -31, -40, 43, 5, 25, -43]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 9، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(arr):\n    best = None\n    for x in arr:\n        if x % 9 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([-3, 51, -28, -15, 20, 17, -9]) == -9`\nالجواب:", "qhash": "b242df5be6a1de98"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [-18, -15, 26, 37, 19, 35, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 12), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-18, -15, 26, 37, 19, 35, -9]\nprint(sorted(nums, key=lambda x: (abs(x - 12), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "7f816296d60e402f", "answer": "[19, 26, -9, 35, 37, -15, -18]\n[37, 35, 26]", "completion": " الناتج:\n```text\n[19, 26, -9, 35, 37, -15, -18]\n[37, 35, 26]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 11\nfor n in range(5, 11, 3):\n    s += n * 3\nprint(s)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 11\nfor n in range(5, 11, 3):\n    s += n * 3\nprint(s)\nprint(n)\n```\nالجواب:", "qhash": "175b13cd17465bb0", "answer": "50\n8", "completion": " الناتج:\n```text\n50\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "eval_poly", "reference": "def eval_poly(x):\n    return -4 * x ** 2 + (2) * x + (5)", "tests": ["assert eval_poly(6) == -127", "assert eval_poly(-18) == -1327", "assert eval_poly(19) == -1401", "assert eval_poly(15) == -865", "assert eval_poly(-9) == -337", "assert eval_poly(3) == -25", "assert eval_poly(19) == -1401", "assert eval_poly(0) == 5"], "test_code": "assert eval_poly(6) == -127\nassert eval_poly(-18) == -1327\nassert eval_poly(19) == -1401\nassert eval_poly(15) == -865\nassert eval_poly(-9) == -337\nassert eval_poly(3) == -25\nassert eval_poly(19) == -1401\nassert eval_poly(0) == 5", "answer": "def eval_poly(x):\n    return -4 * x ** 2 + (2) * x + (5)", "completion": " ```python\ndef eval_poly(x):\n    return -4 * x ** 2 + (2) * x + (5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `eval_poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -4x² + 2x + 5.\nمثال: `eval_poly(6) == -127`\nالجواب:", "qhash": "e31cf977d10608d4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "begin_count", "reference": "def begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ك'):\n            count += 1\n    return count", "tests": ["assert begin_count('مكتبة سفينة قمر مدرسة قهوة') == 0", "assert begin_count('دفتر نور كتاب كتاب كتاب جبل فجر') == 3", "assert begin_count('كتاب سوق ليل') == 1", "assert begin_count('جبل برتقال حصان ميناء نهر') == 0", "assert begin_count('قهوة كتاب فجر سيارة مدينة نور كتاب حاسوب') == 2", "assert begin_count('عربية ماء كتاب كتاب ليل سفينة') == 2", "assert begin_count('') == 0"], "test_code": "assert begin_count('مكتبة سفينة قمر مدرسة قهوة') == 0\nassert begin_count('دفتر نور كتاب كتاب كتاب جبل فجر') == 3\nassert begin_count('كتاب سوق ليل') == 1\nassert begin_count('جبل برتقال حصان ميناء نهر') == 0\nassert begin_count('قهوة كتاب فجر سيارة مدينة نور كتاب حاسوب') == 2\nassert begin_count('عربية ماء كتاب كتاب ليل سفينة') == 2\nassert begin_count('') == 0", "answer": "def begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ك'):\n            count += 1\n    return count", "completion": " ```python\ndef begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ك'):\n            count += 1\n    return count\n```\n", "buggy": "def begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ك'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ك»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('ك'):\n            count += 1\n    return count\n```\nمثال: `begin_count('مكتبة سفينة قمر مدرسة قهوة') == 0`\nالجواب:", "qhash": "9aeb070d4612ec75"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([39, -3, -20, -1, 1, -21, 0, 51]) == 0", "assert biggest_mult([-24, -60, -60]) == -24", "assert biggest_mult([1, 13]) == None", "assert biggest_mult([-17, 17, 3, 28]) == None", "assert biggest_mult([-2, 8, -29]) == None", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([39, -3, -20, -1, 1, -21, 0, 51]) == 0\nassert biggest_mult([-24, -60, -60]) == -24\nassert biggest_mult([1, 13]) == None\nassert biggest_mult([-17, 17, 3, 28]) == None\nassert biggest_mult([-2, 8, -29]) == None\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 12 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 12 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 12، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 12 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([39, -3, -20, -1, 1, -21, 0, 51]) == 0`\nالجواب:", "qhash": "34dd1014fca75415"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ntu'}", "tests": ["assert letter_stats('garden stone') == {'n': 2, 't': 1, 'u': 0}", "assert letter_stats('at on') == {'n': 1, 't': 1, 'u': 0}", "assert letter_stats('go an camel') == {'n': 1, 't': 0, 'u': 0}", "assert letter_stats('code apple an cloud orange of') == {'n': 2, 't': 0, 'u': 1}", "assert letter_stats('falcon stone orange at on') == {'n': 4, 't': 2, 'u': 0}", "assert letter_stats('camel at') == {'n': 0, 't': 1, 'u': 0}", "assert letter_stats('') == {'n': 0, 't': 0, 'u': 0}"], "test_code": "assert letter_stats('garden stone') == {'n': 2, 't': 1, 'u': 0}\nassert letter_stats('at on') == {'n': 1, 't': 1, 'u': 0}\nassert letter_stats('go an camel') == {'n': 1, 't': 0, 'u': 0}\nassert letter_stats('code apple an cloud orange of') == {'n': 2, 't': 0, 'u': 1}\nassert letter_stats('falcon stone orange at on') == {'n': 4, 't': 2, 'u': 0}\nassert letter_stats('camel at') == {'n': 0, 't': 1, 'u': 0}\nassert letter_stats('') == {'n': 0, 't': 0, 'u': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'ntu'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'ntu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'n'، 't'، 'u' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('garden stone') == {'n': 2, 't': 1, 'u': 0}`\nالجواب:", "qhash": "9f05828714fbfb64"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ف'):\n            count += 1\n    return count", "tests": ["assert lead_count('فجر حصان فجر') == 2", "assert lead_count('ميناء حاسوب ليل فجر علم') == 1", "assert lead_count('نور كتاب عربية فجر فجر') == 2", "assert lead_count('عمل فجر فجر شمس') == 2", "assert lead_count('مدينة نهار فجر خبز عربية فجر') == 2", "assert lead_count('برتقال صديق صديق صحراء نور') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('فجر حصان فجر') == 2\nassert lead_count('ميناء حاسوب ليل فجر علم') == 1\nassert lead_count('نور كتاب عربية فجر فجر') == 2\nassert lead_count('عمل فجر فجر شمس') == 2\nassert lead_count('مدينة نهار فجر خبز عربية فجر') == 2\nassert lead_count('برتقال صديق صديق صحراء نور') == 0\nassert lead_count('') == 0", "answer": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ف'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ف'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.endswith('ف'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ف»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.endswith('ف'):\n            count += 1\n    return count\n```\nمثال: `lead_count('فجر حصان فجر') == 2`\nالجواب:", "qhash": "c9ac125dacfbc16a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n    return sorted(x * 3 for x in xs if 19 <= x <= 43)", "tests": ["assert in_range_scaled([19, 44, 40, 49, 14, 30, 37, 38]) == [57, 90, 111, 114, 120]", "assert in_range_scaled([15, -28, -10]) == []", "assert in_range_scaled([-28, 49, 0, -2]) == []", "assert in_range_scaled([42, -30, 49, 38, -25, -17, -27, 2]) == [114, 126]", "assert in_range_scaled([33]) == [99]", "assert in_range_scaled([]) == []", "assert in_range_scaled([-12, 54, 37, 21, 53, 29, 44, 30, -13]) == [63, 87, 90, 111]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([19, 44, 40, 49, 14, 30, 37, 38]) == [57, 90, 111, 114, 120]\nassert in_range_scaled([15, -28, -10]) == []\nassert in_range_scaled([-28, 49, 0, -2]) == []\nassert in_range_scaled([42, -30, 49, 38, -25, -17, -27, 2]) == [114, 126]\nassert in_range_scaled([33]) == [99]\nassert in_range_scaled([]) == []\nassert in_range_scaled([-12, 54, 37, 21, 53, 29, 44, 30, -13]) == [63, 87, 90, 111]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n    return sorted(x * 3 for x in xs if 19 <= x <= 43)", "completion": " ```python\ndef in_range_scaled(xs):\n    return sorted(x * 3 for x in xs if 19 <= x <= 43)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `in_range_scaled` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 3 لكل عنصر x في المدى المغلق [19, 43].\nمثال: `in_range_scaled([19, 44, 40, 49, 14, 30, 37, 38]) == [57, 90, 111, 114, 120]`\nالجواب:", "qhash": "ff548f8911bc0d12"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi']", "assert fizzbuzz(15) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi', '13', 'Hi', '15']", "assert fizzbuzz(1) == ['1']", "assert fizzbuzz(17) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi', '13', 'Hi', '15', 'HiYo', '17']", "assert fizzbuzz(9) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9']"], "test_code": "assert fizzbuzz(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi']\nassert fizzbuzz(15) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi', '13', 'Hi', '15']\nassert fizzbuzz(1) == ['1']\nassert fizzbuzz(17) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi', '13', 'Hi', '15', 'HiYo', '17']\nassert fizzbuzz(9) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Hi'\n        if i % 8 == 0:\n            s += 'Yo'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Hi'، مضاعفات 8 تصبح 'Yo'، المضاعفات المشتركة تصبح 'HiYo'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(12) == ['1', 'Hi', '3', 'Hi', '5', 'Hi', '7', 'HiYo', '9', 'Hi', '11', 'Hi']`\nالجواب:", "qhash": "95d9b0332281b945"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n, k):\n    if k == 0:\n        return 1\n    return n * rec(n, k - 1)\n\nprint(rec(-2, 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n, k):\n    if k == 0:\n        return 1\n    return n * rec(n, k - 1)\n\nprint(rec(-2, 5))\n```\nالجواب:", "qhash": "4891261f1b90f480", "answer": "-32", "completion": " الناتج:\n```text\n-32\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['brain', 'rocket', 'pixel', 'data', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['brain', 'rocket', 'pixel', 'data', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "7497e4749736c5e5", "answer": "['data', 'brain', 'pixel', 'rocket', 'garden']\n['rocket', 'garden', 'pixel']", "completion": " الناتج:\n```text\n['data', 'brain', 'pixel', 'rocket', 'garden']\n['rocket', 'garden', 'pixel']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ع'):\n            count += 1\n    return count", "tests": ["assert count_prefix('رمل مطر رمل شمس قلم') == 0", "assert count_prefix('باب سماء شمس') == 0", "assert count_prefix('قهوة فجر') == 0", "assert count_prefix('طالب وردة مكتبة عربية علم لغة مطر عربية') == 3", "assert count_prefix('ماء جبل خبز علم معلم ليل عربية ليل') == 2", "assert count_prefix('تفاحة عربية ميناء') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('رمل مطر رمل شمس قلم') == 0\nassert count_prefix('باب سماء شمس') == 0\nassert count_prefix('قهوة فجر') == 0\nassert count_prefix('طالب وردة مكتبة عربية علم لغة مطر عربية') == 3\nassert count_prefix('ماء جبل خبز علم معلم ليل عربية ليل') == 2\nassert count_prefix('تفاحة عربية ميناء') == 1\nassert count_prefix('') == 0", "answer": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ع'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ع'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.endswith('ع'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ع»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.endswith('ع'):\n            count += 1\n    return count\n```\nمثال: `count_prefix('رمل مطر رمل شمس قلم') == 0`\nالجواب:", "qhash": "50450b01e4fa49bc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 18\nfor i in range(-5, 11, 3):\n    result += i * 7\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 18\nfor i in range(-5, 11, 3):\n    result += i * 7\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "9429ee30aab8763c", "answer": "123\n10", "completion": " الناتج:\n```text\n123\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "scaled_powers", "reference": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 5\n    return total", "tests": ["assert scaled_powers(4) == 7800", "assert scaled_powers(10) == 1324950", "assert scaled_powers(4) == 7800", "assert scaled_powers(2) == 198", "assert scaled_powers(7) == 174048", "assert scaled_powers(1) == 6", "assert scaled_powers(0) == 0"], "test_code": "assert scaled_powers(4) == 7800\nassert scaled_powers(10) == 1324950\nassert scaled_powers(4) == 7800\nassert scaled_powers(2) == 198\nassert scaled_powers(7) == 174048\nassert scaled_powers(1) == 6\nassert scaled_powers(0) == 0", "answer": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 5\n    return total", "completion": " ```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 5\n    return total\n```\n", "buggy": "def scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 6 * i ** 5\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 6 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef scaled_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 6 * i ** 5\n    return total\n```\nمثال: `scaled_powers(4) == 7800`\nالجواب:", "qhash": "4aaf4b2f77ab9c14"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "data = [-2, 18, 18, 21, 34]\nprint(data[3:5])\nprint(data[::-2])\nprint(len(data[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndata = [-2, 18, 18, 21, 34]\nprint(data[3:5])\nprint(data[::-2])\nprint(len(data[3:5]))\n```\nالجواب:", "qhash": "6aeb41df135d4b98", "answer": "[21, 34]\n[34, 18, -2]\n2", "completion": " الناتج:\n```text\n[21, 34]\n[34, 18, -2]\n2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "freq_of", "reference": "def freq_of(s):\n    return {c: s.count(c) for c in 'eiu'}", "tests": ["assert freq_of('planet rocket') == {'e': 2, 'i': 0, 'u': 0}", "assert freq_of('desert table music to planet') == {'e': 4, 'i': 1, 'u': 1}", "assert freq_of('light') == {'e': 0, 'i': 1, 'u': 0}", "assert freq_of('orange in an it stone') == {'e': 2, 'i': 2, 'u': 0}", "assert freq_of('planet brain window orange') == {'e': 2, 'i': 2, 'u': 0}", "assert freq_of('light is') == {'e': 0, 'i': 2, 'u': 0}", "assert freq_of('') == {'e': 0, 'i': 0, 'u': 0}"], "test_code": "assert freq_of('planet rocket') == {'e': 2, 'i': 0, 'u': 0}\nassert freq_of('desert table music to planet') == {'e': 4, 'i': 1, 'u': 1}\nassert freq_of('light') == {'e': 0, 'i': 1, 'u': 0}\nassert freq_of('orange in an it stone') == {'e': 2, 'i': 2, 'u': 0}\nassert freq_of('planet brain window orange') == {'e': 2, 'i': 2, 'u': 0}\nassert freq_of('light is') == {'e': 0, 'i': 2, 'u': 0}\nassert freq_of('') == {'e': 0, 'i': 0, 'u': 0}", "answer": "def freq_of(s):\n    return {c: s.count(c) for c in 'eiu'}", "completion": " ```python\ndef freq_of(s):\n    return {c: s.count(c) for c in 'eiu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `freq_of` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'i'، 'u' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `freq_of('planet rocket') == {'e': 2, 'i': 0, 'u': 0}`\nالجواب:", "qhash": "7e6efb8c13ca137a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([-3, 28, 29, 15, 50]) == None", "assert max_multiple([-40, -8, -16]) == -8", "assert max_multiple([1, 9]) == None", "assert max_multiple([-11, -6, -6]) == None", "assert max_multiple([32, -11, 19, 21, 25, 33]) == 32", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-3, 28, 29, 15, 50]) == None\nassert max_multiple([-40, -8, -16]) == -8\nassert max_multiple([1, 9]) == None\nassert max_multiple([-11, -6, -6]) == None\nassert max_multiple([32, -11, 19, 21, 25, 33]) == 32\nassert max_multiple([]) == None", "answer": "def max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `max_multiple([-3, 28, 29, 15, 50]) == None`\nالجواب:", "qhash": "ce76800407b830e8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 15\nfor n in range(-3, 8, 1):\n    total -= n * 5\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 15\nfor n in range(-3, 8, 1):\n    total -= n * 5\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "da8d650df649f5bd", "answer": "-95\n7", "completion": " الناتج:\n```text\n-95\n7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "tests": ["assert multiples_total(138) == 1656", "assert multiples_total(278) == 6488", "assert multiples_total(0) == 0", "assert multiples_total(117) == 1140", "assert multiples_total(164) == 2268", "assert multiples_total(51) == 216", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(138) == 1656\nassert multiples_total(278) == 6488\nassert multiples_total(0) == 0\nassert multiples_total(117) == 1140\nassert multiples_total(164) == 2268\nassert multiples_total(51) == 216\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 8 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 8 أو 12 دون باقٍ.\nمثال: `multiples_total(138) == 1656`\nالجواب:", "qhash": "7c5e3248655f46d5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_start", "reference": "def count_start(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "tests": ["assert count_start('لغة برتقال طالب جمل جمل دفتر') == 2", "assert count_start('جمل سفينة فجر قمر') == 1", "assert count_start('دفتر تفاحة برتقال مدرسة') == 0", "assert count_start('سفينة رمل بحر جبل') == 1", "assert count_start('قهوة جبل خبز جمل جبل ماء') == 3", "assert count_start('جمل جبل قلم كتاب جمل مطر حاسوب') == 3", "assert count_start('') == 0"], "test_code": "assert count_start('لغة برتقال طالب جمل جمل دفتر') == 2\nassert count_start('جمل سفينة فجر قمر') == 1\nassert count_start('دفتر تفاحة برتقال مدرسة') == 0\nassert count_start('سفينة رمل بحر جبل') == 1\nassert count_start('قهوة جبل خبز جمل جبل ماء') == 3\nassert count_start('جمل جبل قلم كتاب جمل مطر حاسوب') == 3\nassert count_start('') == 0", "answer": "def count_start(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count", "completion": " ```python\ndef count_start(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ج'):\n            count += 1\n    return count\n```\n", "buggy": "def count_start(text):\n    count = 0\n    for w in text:\n        if w.startswith('ج'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ج»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_start(text):\n    count = 0\n    for w in text:\n        if w.startswith('ج'):\n            count += 1\n    return count\n```\nمثال: `count_start('لغة برتقال طالب جمل جمل دفتر') == 2`\nالجواب:", "qhash": "4bba244b3a1a9c9d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([88, 35, 28, 16, 89, 0, 10, 45, 0]) == 3", "assert tally_div([]) == 0", "assert tally_div([41]) == 0", "assert tally_div([55, 0, 78, 25, 30, -19, 67, 56, 49, -25, -34]) == 1", "assert tally_div([87]) == 0", "assert tally_div([-11, 19]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([88, 35, 28, 16, 89, 0, 10, 45, 0]) == 3\nassert tally_div([]) == 0\nassert tally_div([41]) == 0\nassert tally_div([55, 0, 78, 25, 30, -19, 67, 56, 49, -25, -34]) == 1\nassert tally_div([87]) == 0\nassert tally_div([-11, 19]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 6. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([88, 35, 28, 16, 89, 0, 10, 45, 0]) == 3`\nالجواب:", "qhash": "fecf5f274f1bcdf7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 7 <= x <= 47)", "tests": ["assert between_times([-2, 55, 20, 27]) == [20, 27]", "assert between_times([1, 22, 54]) == [22]", "assert between_times([]) == []", "assert between_times([49, -6, -6, -21, 11, 0, -25, 45, -27]) == [11, 45]", "assert between_times([37, 57, 5, 39]) == [37, 39]", "assert between_times([]) == []", "assert between_times([34, 45]) == [34, 45]", "assert between_times([]) == []"], "test_code": "assert between_times([-2, 55, 20, 27]) == [20, 27]\nassert between_times([1, 22, 54]) == [22]\nassert between_times([]) == []\nassert between_times([49, -6, -6, -21, 11, 0, -25, 45, -27]) == [11, 45]\nassert between_times([37, 57, 5, 39]) == [37, 39]\nassert between_times([]) == []\nassert between_times([34, 45]) == [34, 45]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 7 <= x <= 47)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 1 for x in xs if 7 <= x <= 47)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [7, 47].\nمثال: `between_times([-2, 55, 20, 27]) == [20, 27]`\nالجواب:", "qhash": "ddbd466a074b95da"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert invert_words('planet desert on apple river light is it') == 'light/river/apple/desert/planet'", "assert invert_words('river an banana up camel') == 'camel/banana/river'", "assert invert_words('go data table cloud banana camel winter') == 'winter/camel/banana/cloud/table'", "assert invert_words('') == ''", "assert invert_words('table up an brain is planet') == 'planet/brain/table'", "assert invert_words('falcon') == 'falcon'", "assert invert_words('winter garden') == 'garden/winter'"], "test_code": "assert invert_words('planet desert on apple river light is it') == 'light/river/apple/desert/planet'\nassert invert_words('river an banana up camel') == 'camel/banana/river'\nassert invert_words('go data table cloud banana camel winter') == 'winter/camel/banana/cloud/table'\nassert invert_words('') == ''\nassert invert_words('table up an brain is planet') == 'planet/brain/table'\nassert invert_words('falcon') == 'falcon'\nassert invert_words('winter garden') == 'garden/winter'", "answer": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `invert_words('planet desert on apple river light is it') == 'light/river/apple/desert/planet'`\nالجواب:", "qhash": "4bc8d95d062b4262"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "cycle", "reference": "def cycle(xs):\n    if not xs:\n        return []\n    k = 12 % len(xs)\n    return xs[k:] + xs[:k]", "tests": ["assert cycle([15, 43, 45, 12, 22, 12, 22]) == [12, 22, 15, 43, 45, 12, 22]", "assert cycle([-2, 31, 8]) == [-2, 31, 8]", "assert cycle([21, -7, 25, 36, 31]) == [25, 36, 31, 21, -7]", "assert cycle([38, 43, 23, 34, 28, 16, 49, 21, 49, -4]) == [23, 34, 28, 16, 49, 21, 49, -4, 38, 43]", "assert cycle([35, 33, 33, 7, 9]) == [33, 7, 9, 35, 33]", "assert cycle([-3]) == [-3]", "assert cycle([]) == []"], "test_code": "assert cycle([15, 43, 45, 12, 22, 12, 22]) == [12, 22, 15, 43, 45, 12, 22]\nassert cycle([-2, 31, 8]) == [-2, 31, 8]\nassert cycle([21, -7, 25, 36, 31]) == [25, 36, 31, 21, -7]\nassert cycle([38, 43, 23, 34, 28, 16, 49, 21, 49, -4]) == [23, 34, 28, 16, 49, 21, 49, -4, 38, 43]\nassert cycle([35, 33, 33, 7, 9]) == [33, 7, 9, 35, 33]\nassert cycle([-3]) == [-3]\nassert cycle([]) == []", "answer": "def cycle(xs):\n    if not xs:\n        return []\n    k = 12 % len(xs)\n    return xs[k:] + xs[:k]", "completion": " ```python\ndef cycle(xs):\n    if not xs:\n        return []\n    k = 12 % len(xs)\n    return xs[k:] + xs[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef cycle(xs):\n    if not xs:\n        return []\n    k = 12 % len(xs)\n    return ____\n```\nمثال: `cycle([15, 43, 45, 12, 22, 12, 22]) == [12, 22, 15, 43, 45, 12, 22]`\nالجواب:", "qhash": "a0ab906a49522e11"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 71", "tests": ["assert prod_mod(7) == 70", "assert prod_mod(42) == 39", "assert prod_mod(15) == 5", "assert prod_mod(55) == 57", "assert prod_mod(14) == 24", "assert prod_mod(8) == 63", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(7) == 70\nassert prod_mod(42) == 39\nassert prod_mod(15) == 5\nassert prod_mod(55) == 57\nassert prod_mod(14) == 24\nassert prod_mod(8) == 63\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 71", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 71\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 71 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(7) == 70`\nالجواب:", "qhash": "9e140ec2127c6b0a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'ersu'}", "tests": ["assert char_freq('python summer of') == {'e': 1, 'r': 1, 's': 1, 'u': 1}", "assert char_freq('garden falcon') == {'e': 1, 'r': 1, 's': 0, 'u': 0}", "assert char_freq('an planet data light') == {'e': 1, 'r': 0, 's': 0, 'u': 0}", "assert char_freq('music pixel python summer on') == {'e': 2, 'r': 1, 's': 2, 'u': 2}", "assert char_freq('a a matrix signal music') == {'e': 0, 'r': 1, 's': 2, 'u': 1}", "assert char_freq('falcon matrix falcon') == {'e': 0, 'r': 1, 's': 0, 'u': 0}", "assert char_freq('') == {'e': 0, 'r': 0, 's': 0, 'u': 0}"], "test_code": "assert char_freq('python summer of') == {'e': 1, 'r': 1, 's': 1, 'u': 1}\nassert char_freq('garden falcon') == {'e': 1, 'r': 1, 's': 0, 'u': 0}\nassert char_freq('an planet data light') == {'e': 1, 'r': 0, 's': 0, 'u': 0}\nassert char_freq('music pixel python summer on') == {'e': 2, 'r': 1, 's': 2, 'u': 2}\nassert char_freq('a a matrix signal music') == {'e': 0, 'r': 1, 's': 2, 'u': 1}\nassert char_freq('falcon matrix falcon') == {'e': 0, 'r': 1, 's': 0, 'u': 0}\nassert char_freq('') == {'e': 0, 'r': 0, 's': 0, 'u': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'ersu'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'ersu'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'e'، 'r'، 's'، 'u' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('python summer of') == {'e': 1, 'r': 1, 's': 1, 'u': 1}`\nالجواب:", "qhash": "f78caceeee875f72"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rotate_letters", "reference": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rotate_letters('pixel light OK') == 'kdszg gdbco OK'", "assert rotate_letters('river python is at camel') == 'mdqzm ktocji dn vo xvhzg'", "assert rotate_letters('up') == 'pk'", "assert rotate_letters('table a window light A1') == 'ovwgz v rdiyjr gdbco A1'", "assert rotate_letters('falcon of brain music it') == 'avgxji ja wmvdi hpndx do'", "assert rotate_letters('signal falcon signal OK') == 'ndbivg avgxji ndbivg OK'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('pixel light OK') == 'kdszg gdbco OK'\nassert rotate_letters('river python is at camel') == 'mdqzm ktocji dn vo xvhzg'\nassert rotate_letters('up') == 'pk'\nassert rotate_letters('table a window light A1') == 'ovwgz v rdiyjr gdbco A1'\nassert rotate_letters('falcon of brain music it') == 'avgxji ja wmvdi hpndx do'\nassert rotate_letters('signal falcon signal OK') == 'ndbivg avgxji ndbivg OK'\nassert rotate_letters('') == ''", "answer": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rotate_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('pixel light OK') == 'kdszg gdbco OK'`\nالجواب:", "qhash": "18f59817c3408424"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'no'}", "tests": ["assert letter_stats('window it summer coffee by') == {'n': 1, 'o': 2}", "assert letter_stats('it desert window by cloud in') == {'n': 2, 'o': 2}", "assert letter_stats('rocket we signal music pixel engine') == {'n': 3, 'o': 1}", "assert letter_stats('go') == {'n': 0, 'o': 1}", "assert letter_stats('matrix go stone') == {'n': 1, 'o': 2}", "assert letter_stats('cloud music pixel signal it') == {'n': 1, 'o': 1}", "assert letter_stats('') == {'n': 0, 'o': 0}"], "test_code": "assert letter_stats('window it summer coffee by') == {'n': 1, 'o': 2}\nassert letter_stats('it desert window by cloud in') == {'n': 2, 'o': 2}\nassert letter_stats('rocket we signal music pixel engine') == {'n': 3, 'o': 1}\nassert letter_stats('go') == {'n': 0, 'o': 1}\nassert letter_stats('matrix go stone') == {'n': 1, 'o': 2}\nassert letter_stats('cloud music pixel signal it') == {'n': 1, 'o': 1}\nassert letter_stats('') == {'n': 0, 'o': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'no'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'no'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'n'، 'o' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('window it summer coffee by') == {'n': 1, 'o': 2}`\nالجواب:", "qhash": "22734af6ec28d24a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('ليلى', 41), ('باسل', 48), ('سلمى', 72), ('علي', 78)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('ليلى', 41), ('باسل', 48), ('سلمى', 72), ('علي', 78)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "c9d10252caf29424", "answer": "[('ليلى', 41), ('باسل', 48), ('سلمى', 72), ('علي', 78)]\n['علي', 'سلمى']", "completion": " الناتج:\n```text\n[('ليلى', 41), ('باسل', 48), ('سلمى', 72), ('علي', 78)]\n['علي', 'سلمى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'راشد': 16, 'أحمد': 41, 'نور': 24, 'ليلى': 3, 'وليد': 46}\nscores['نور'] += 3\nscores['هدى'] = 37\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('راشد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'راشد': 16, 'أحمد': 41, 'نور': 24, 'ليلى': 3, 'وليد': 46}\nscores['نور'] += 3\nscores['هدى'] = 37\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('راشد', -1))\n```\nالجواب:", "qhash": "dd615b62dd0d2721", "answer": "6\nوليد\n170\n16", "completion": " الناتج:\n```text\n6\nوليد\n170\n16\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n, k):\n    if k == 0:\n        return 1\n    return n * rec(n, k - 1)\n\nprint(rec(1, 2))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n, k):\n    if k == 0:\n        return 1\n    return n * rec(n, k - 1)\n\nprint(rec(1, 2))\n```\nالجواب:", "qhash": "bb2d7b5ce936c027", "answer": "1", "completion": " الناتج:\n```text\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return text.count('ن')", "tests": ["assert how_many('دفتر برتقال سيارة') == 0", "assert how_many('عمل لغة') == 0", "assert how_many('قهوة سفينة') == 1", "assert how_many('شجرة لغة جمل مطر فجر باب مكتبة') == 0", "assert how_many('مطر') == 0", "assert how_many('حصان فجر عربية') == 1", "assert how_many('سماء طالب') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('دفتر برتقال سيارة') == 0\nassert how_many('عمل لغة') == 0\nassert how_many('قهوة سفينة') == 1\nassert how_many('شجرة لغة جمل مطر فجر باب مكتبة') == 0\nassert how_many('مطر') == 0\nassert how_many('حصان فجر عربية') == 1\nassert how_many('سماء طالب') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return text.count('ن')", "completion": " ```python\ndef how_many(text):\n    return text.count('ن')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ن» في النص.\nمثال: `how_many('دفتر برتقال سيارة') == 0`\nالجواب:", "qhash": "6265ff7759d66845"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 18\nfor n in range(4, 19, 1):\n    acc -= n * 8\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 18\nfor n in range(4, 19, 1):\n    acc -= n * 8\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "7092b032d3cbdb01", "answer": "-1302\n18", "completion": " الناتج:\n```text\n-1302\n18\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [-2, 7, 9, 15, 10, 7]\nprint(items[1:6])\nprint(items[::3])\nprint(sum(items[1:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [-2, 7, 9, 15, 10, 7]\nprint(items[1:6])\nprint(items[::3])\nprint(sum(items[1:6]))\n```\nالجواب:", "qhash": "69898df47e4e288f", "answer": "[7, 9, 15, 10, 7]\n[-2, 15]\n48", "completion": " الناتج:\n```text\n[7, 9, 15, 10, 7]\n[-2, 15]\n48\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 50", "tests": ["assert dig_pow_mod(69635) == 37", "assert dig_pow_mod(434870) == 4", "assert dig_pow_mod(563496) == 3", "assert dig_pow_mod(887216) == 18", "assert dig_pow_mod(356769) == 36", "assert dig_pow_mod(243805) == 18", "assert dig_pow_mod(662675) == 36", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(69635) == 37\nassert dig_pow_mod(434870) == 4\nassert dig_pow_mod(563496) == 3\nassert dig_pow_mod(887216) == 18\nassert dig_pow_mod(356769) == 36\nassert dig_pow_mod(243805) == 18\nassert dig_pow_mod(662675) == 36\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 50", "completion": " ```python\ndef dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 50\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `dig_pow_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 50.\nمثال: `dig_pow_mod(69635) == 37`\nالجواب:", "qhash": "a58226a254b027dc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 46:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([15, 10, 19, 11, 1, 6, 9]) == [15, 25, 44, 0, 1, 7, 16]", "assert reset_sum([24, 42, 39, 13]) == [24, 0, 39, 0]", "assert reset_sum([36, -3, 1, 34, 35, 45, 14, -7]) == [36, 33, 34, 0, 35, 0, 14, 7]", "assert reset_sum([30]) == [30]", "assert reset_sum([6, 28, 44, 37, 18, 35]) == [6, 34, 0, 37, 0, 35]", "assert reset_sum([12, 20, 7, 5, 27, -10, -3, 12, 13]) == [12, 32, 39, 44, 0, -10, -13, -1, 12]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([15, 10, 19, 11, 1, 6, 9]) == [15, 25, 44, 0, 1, 7, 16]\nassert reset_sum([24, 42, 39, 13]) == [24, 0, 39, 0]\nassert reset_sum([36, -3, 1, 34, 35, 45, 14, -7]) == [36, 33, 34, 0, 35, 0, 14, 7]\nassert reset_sum([30]) == [30]\nassert reset_sum([6, 28, 44, 37, 18, 35]) == [6, 34, 0, 37, 0, 35]\nassert reset_sum([12, 20, 7, 5, 27, -10, -3, 12, 13]) == [12, 32, 39, 44, 0, -10, -13, -1, 12]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 46:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 46:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 46 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([15, 10, 19, 11, 1, 6, 9]) == [15, 25, 44, 0, 1, 7, 16]`\nالجواب:", "qhash": "673ccd82e8c6c193"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'قمر سماء'\nprint(len(text.replace(' ', '')))\nprint(text.replace(' ', '-'))\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'قمر سماء'\nprint(len(text.replace(' ', '')))\nprint(text.replace(' ', '-'))\nprint(text[::-1])\n```\nالجواب:", "qhash": "81890b25619dd535", "answer": "7\nقمر-سماء\nءامس رمق", "completion": " الناتج:\n```text\n7\nقمر-سماء\nءامس رمق\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "find_max_div", "reference": "def find_max_div(values):\n    best = None\n    for x in values:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert find_max_div([45, 28, 5, -7, 36, 25, -12]) == 45", "assert find_max_div([-9, -12, -12]) == -9", "assert find_max_div([1, 4]) == None", "assert find_max_div([7, 40]) == None", "assert find_max_div([-26, -11, 15, -45, 5, -35, 44, -33]) == 15", "assert find_max_div([]) == None"], "test_code": "assert find_max_div([45, 28, 5, -7, 36, 25, -12]) == 45\nassert find_max_div([-9, -12, -12]) == -9\nassert find_max_div([1, 4]) == None\nassert find_max_div([7, 40]) == None\nassert find_max_div([-26, -11, 15, -45, 5, -35, 44, -33]) == 15\nassert find_max_div([]) == None", "answer": "def find_max_div(values):\n    best = None\n    for x in values:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef find_max_div(values):\n    best = None\n    for x in values:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def find_max_div(values):\n    best = 0\n    for x in values:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 3، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef find_max_div(values):\n    best = 0\n    for x in values:\n        if x % 3 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `find_max_div([45, 28, 5, -7, 36, 25, -12]) == 45`\nالجواب:", "qhash": "c78af6faa5d373fa"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)", "tests": ["assert how_many('صديق وردة حديقة باب فجر') == 0", "assert how_many('مدينة ميناء') == 0", "assert how_many('جبل برتقال قهوة وردة صحراء كتاب برتقال') == 3", "assert how_many('سفينة نور جمل مدينة طالب') == 2", "assert how_many('قلم شجرة جبل برمجة') == 2", "assert how_many('طالب خبز حصان حديقة خبز خبز سفينة') == 1", "assert how_many('سلام طائرة لغة مدينة نهار ليل') == 3", "assert how_many('') == 0"], "test_code": "assert how_many('صديق وردة حديقة باب فجر') == 0\nassert how_many('مدينة ميناء') == 0\nassert how_many('جبل برتقال قهوة وردة صحراء كتاب برتقال') == 3\nassert how_many('سفينة نور جمل مدينة طالب') == 2\nassert how_many('قلم شجرة جبل برمجة') == 2\nassert how_many('طالب خبز حصان حديقة خبز خبز سفينة') == 1\nassert how_many('سلام طائرة لغة مدينة نهار ليل') == 3\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ل» مرة واحدة على الأقل.\nمثال: `how_many('صديق وردة حديقة باب فجر') == 0`\nالجواب:", "qhash": "ba0f3521183728e1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['river', 'stone', 'data', 'coffee', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['river', 'stone', 'data', 'coffee', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "503d37259dc99aff", "answer": "['data', 'river', 'stone', 'coffee', 'garden']\n['garden', 'coffee', 'stone']", "completion": " الناتج:\n```text\n['data', 'river', 'stone', 'coffee', 'garden']\n['garden', 'coffee', 'stone']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=2):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(f(16))\nprint(f(16, 0))\nprint(f(f(0), 16))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=2):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(f(16))\nprint(f(16, 0))\nprint(f(f(0), 16))\n```\nالجواب:", "qhash": "a7f85e679cb34922", "answer": "30\n32\n36", "completion": " الناتج:\n```text\n30\n32\n36\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "power_sum", "reference": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 5\n    return total", "tests": ["assert power_sum(8) == 494208", "assert power_sum(7) == 232064", "assert power_sum(1) == 8", "assert power_sum(11) == 3055008", "assert power_sum(5) == 35400", "assert power_sum(1) == 8", "assert power_sum(0) == 0"], "test_code": "assert power_sum(8) == 494208\nassert power_sum(7) == 232064\nassert power_sum(1) == 8\nassert power_sum(11) == 3055008\nassert power_sum(5) == 35400\nassert power_sum(1) == 8\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 5\n    return total", "completion": " ```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 8 * i ** 5\n    return total\n```\n", "buggy": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 8 * i ** 5\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 8 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 8 * i ** 5\n    return total\n```\nمثال: `power_sum(8) == 494208`\nالجواب:", "qhash": "d64f1303da0ef6a1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n    return sorted(x * 1 for x in xs if -11 <= x <= 26)", "tests": ["assert in_range_scaled([10, 11, 12, 36, -15, 8, 34]) == [8, 10, 11, 12]", "assert in_range_scaled([35, 8, -6, -22, 20, 45]) == [-6, 8, 20]", "assert in_range_scaled([16, 4, -17, -18, -22, 17, 34, 18, -30, 34]) == [4, 16, 17, 18]", "assert in_range_scaled([-21, 60]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([-25, 0, -2, 28, -4, -16, 25, -8, -7, -20]) == [-8, -7, -4, -2, 0, 25]", "assert in_range_scaled([32, 59, -3, -16, 54, 33]) == [-3]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([10, 11, 12, 36, -15, 8, 34]) == [8, 10, 11, 12]\nassert in_range_scaled([35, 8, -6, -22, 20, 45]) == [-6, 8, 20]\nassert in_range_scaled([16, 4, -17, -18, -22, 17, 34, 18, -30, 34]) == [4, 16, 17, 18]\nassert in_range_scaled([-21, 60]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([-25, 0, -2, 28, -4, -16, 25, -8, -7, -20]) == [-8, -7, -4, -2, 0, 25]\nassert in_range_scaled([32, 59, -3, -16, 54, 33]) == [-3]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n    return sorted(x * 1 for x in xs if -11 <= x <= 26)", "completion": " ```python\ndef in_range_scaled(xs):\n    return sorted(x * 1 for x in xs if -11 <= x <= 26)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `in_range_scaled` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [-11, 26].\nمثال: `in_range_scaled([10, 11, 12, 36, -15, 8, 34]) == [8, 10, 11, 12]`\nالجواب:", "qhash": "1aa00e4b98b0ea3d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "cipher", "reference": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert cipher('banana desert planet music !') == 'vuhuhu xymyln jfuhyn gomcw !'", "assert cipher('light pixel') == 'fcabn jcryf'", "assert cipher('planet it') == 'jfuhyn cn'", "assert cipher('a') == 'u'", "assert cipher('code it python at Hello') == 'wixy cn jsnbih un Hyffi'", "assert cipher('window cloud matrix') == 'qchxiq wfiox gunlcr'", "assert cipher('') == ''"], "test_code": "assert cipher('banana desert planet music !') == 'vuhuhu xymyln jfuhyn gomcw !'\nassert cipher('light pixel') == 'fcabn jcryf'\nassert cipher('planet it') == 'jfuhyn cn'\nassert cipher('a') == 'u'\nassert cipher('code it python at Hello') == 'wixy cn jsnbih un Hyffi'\nassert cipher('window cloud matrix') == 'qchxiq wfiox gunlcr'\nassert cipher('') == ''", "answer": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-6)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cipher` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 6 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('banana desert planet music !') == 'vuhuhu xymyln jfuhyn gomcw !'`\nالجواب:", "qhash": "2799e461ccffa00d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'نور'\nprint(w[0])\nprint('ت' in w)\nprint(w.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'نور'\nprint(w[0])\nprint('ت' in w)\nprint(w.split())\n```\nالجواب:", "qhash": "96f76a756e6a18fa", "answer": "ن\nFalse\n['نور']", "completion": " الناتج:\n```text\nن\nFalse\n['نور']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_hits", "reference": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'ت' in w)", "tests": ["assert letter_hits('قهوة ماء سيارة جبل قلم علم') == 0", "assert letter_hits('عربية باب تفاحة سماء قهوة طائرة حاسوب برتقال') == 2", "assert letter_hits('فجر بحر جمل رمل شمس لغة') == 0", "assert letter_hits('طائرة قهوة حديقة علم سماء عمل ليل') == 0", "assert letter_hits('حديقة جبل بحر شجرة تفاحة') == 1", "assert letter_hits('مكتبة قهوة') == 1", "assert letter_hits('قمر بيت ميناء مكتبة') == 2", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('قهوة ماء سيارة جبل قلم علم') == 0\nassert letter_hits('عربية باب تفاحة سماء قهوة طائرة حاسوب برتقال') == 2\nassert letter_hits('فجر بحر جمل رمل شمس لغة') == 0\nassert letter_hits('طائرة قهوة حديقة علم سماء عمل ليل') == 0\nassert letter_hits('حديقة جبل بحر شجرة تفاحة') == 1\nassert letter_hits('مكتبة قهوة') == 1\nassert letter_hits('قمر بيت ميناء مكتبة') == 2\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'ت' in w)", "completion": " ```python\ndef letter_hits(text):\n    return sum(1 for w in text.split() if 'ت' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ت» مرة واحدة على الأقل.\nمثال: `letter_hits('قهوة ماء سيارة جبل قلم علم') == 0`\nالجواب:", "qhash": "f4338d91e9aa1c72"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(26) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23', '24', '25', '26']", "assert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17']", "assert fizzbuzz(6) == ['1', '2', '3', '4', '5', '6']", "assert fizzbuzz(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22']", "assert fizzbuzz(5) == ['1', '2', '3', '4', '5']"], "test_code": "assert fizzbuzz(26) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23', '24', '25', '26']\nassert fizzbuzz(17) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17']\nassert fizzbuzz(6) == ['1', '2', '3', '4', '5', '6']\nassert fizzbuzz(22) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22']\nassert fizzbuzz(5) == ['1', '2', '3', '4', '5']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Fizz'، مضاعفات 9 تصبح 'Buzz'، المضاعفات المشتركة تصبح 'FizzBuzz'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(26) == ['1', '2', '3', '4', '5', '6', 'Fizz', '8', 'Buzz', '10', '11', '12', '13', 'Fizz', '15', '16', '17', 'Buzz', '19', '20', 'Fizz', '22', '23', '24', '25', '26']`\nالجواب:", "qhash": "89f0ad502df3bfb4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert mirror_words('brain river a data matrix planet cloud') == 'cloud-planet-matrix-data-river-brain'", "assert mirror_words('at') == 'at'", "assert mirror_words('vector engine python') == 'python-engine-vector'", "assert mirror_words('on camel winter pixel we orange') == 'orange-we-pixel-winter-camel-on'", "assert mirror_words('brain we apple at at') == 'at-at-apple-we-brain'", "assert mirror_words('brain apple rocket signal at signal') == 'signal-at-signal-rocket-apple-brain'", "assert mirror_words('banana is light it planet') == 'planet-it-light-is-banana'"], "test_code": "assert mirror_words('brain river a data matrix planet cloud') == 'cloud-planet-matrix-data-river-brain'\nassert mirror_words('at') == 'at'\nassert mirror_words('vector engine python') == 'python-engine-vector'\nassert mirror_words('on camel winter pixel we orange') == 'orange-we-pixel-winter-camel-on'\nassert mirror_words('brain we apple at at') == 'at-at-apple-we-brain'\nassert mirror_words('brain apple rocket signal at signal') == 'signal-at-signal-rocket-apple-brain'\nassert mirror_words('banana is light it planet') == 'planet-it-light-is-banana'", "answer": "def mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `mirror_words('brain river a data matrix planet cloud') == 'cloud-planet-matrix-data-river-brain'`\nالجواب:", "qhash": "e9e3b06f2ce14464"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate", "reference": "def rotate(arr):\n    if not arr:\n        return []\n    k = 12 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert rotate([13, 24, 32, 35, 4, 11, 6]) == [32, 35, 4, 11, 6, 13, 24]", "assert rotate([-6, 14, 21, 2, -1, 11, 2, 32, 18, 4, 2]) == [2, -6, 14, 21, 2, -1, 11, 2, 32, 18, 4]", "assert rotate([7, 50, 35, 21, 28, 39, 47, 45, 25, -8, 20, 37]) == [7, 50, 35, 21, 28, 39, 47, 45, 25, -8, 20, 37]", "assert rotate([18, 31, -7, 16, 11]) == [16, 11, 18, 31, -7]", "assert rotate([37, 32]) == [37, 32]", "assert rotate([23, 48]) == [23, 48]", "assert rotate([]) == []"], "test_code": "assert rotate([13, 24, 32, 35, 4, 11, 6]) == [32, 35, 4, 11, 6, 13, 24]\nassert rotate([-6, 14, 21, 2, -1, 11, 2, 32, 18, 4, 2]) == [2, -6, 14, 21, 2, -1, 11, 2, 32, 18, 4]\nassert rotate([7, 50, 35, 21, 28, 39, 47, 45, 25, -8, 20, 37]) == [7, 50, 35, 21, 28, 39, 47, 45, 25, -8, 20, 37]\nassert rotate([18, 31, -7, 16, 11]) == [16, 11, 18, 31, -7]\nassert rotate([37, 32]) == [37, 32]\nassert rotate([23, 48]) == [23, 48]\nassert rotate([]) == []", "answer": "def rotate(arr):\n    if not arr:\n        return []\n    k = 12 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 12 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate(arr):\n    if not arr:\n        return []\n    k = 12 % len(arr)\n    return ____\n```\nمثال: `rotate([13, 24, 32, 35, 4, 11, 6]) == [32, 35, 4, 11, 6, 13, 24]`\nالجواب:", "qhash": "6e180bf663738e7c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'hi'}", "tests": ["assert char_freq('in') == {'h': 0, 'i': 1}", "assert char_freq('banana desert is') == {'h': 0, 'i': 1}", "assert char_freq('river orange') == {'h': 0, 'i': 1}", "assert char_freq('in orange light python python matrix') == {'h': 3, 'i': 3}", "assert char_freq('stone desert summer desert') == {'h': 0, 'i': 0}", "assert char_freq('rocket camel it') == {'h': 0, 'i': 1}", "assert char_freq('') == {'h': 0, 'i': 0}"], "test_code": "assert char_freq('in') == {'h': 0, 'i': 1}\nassert char_freq('banana desert is') == {'h': 0, 'i': 1}\nassert char_freq('river orange') == {'h': 0, 'i': 1}\nassert char_freq('in orange light python python matrix') == {'h': 3, 'i': 3}\nassert char_freq('stone desert summer desert') == {'h': 0, 'i': 0}\nassert char_freq('rocket camel it') == {'h': 0, 'i': 1}\nassert char_freq('') == {'h': 0, 'i': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'hi'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'hi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'h'، 'i' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('in') == {'h': 0, 'i': 1}`\nالجواب:", "qhash": "b24cdc149e23d472"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([-28, 30, -25, -30, 31, -17, 53, 35, 60]) == 60", "assert max_multiple([-12, -24, -6]) == -6", "assert max_multiple([1, 7, 13]) == None", "assert max_multiple([36, 33, 3]) == 36", "assert max_multiple([-18, 31, 40]) == -18", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([-28, 30, -25, -30, 31, -17, 53, 35, 60]) == 60\nassert max_multiple([-12, -24, -6]) == -6\nassert max_multiple([1, 7, 13]) == None\nassert max_multiple([36, 33, 3]) == 36\nassert max_multiple([-18, 31, 40]) == -18\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(nums):\n    best = 0\n    for x in nums:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(nums):\n    best = 0\n    for x in nums:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([-28, 30, -25, -30, 31, -17, 53, 35, 60]) == 60`\nالجواب:", "qhash": "d6d4b39555d02640"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_div", "reference": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "tests": ["assert sum_div(119) == 1964", "assert sum_div(260) == 9454", "assert sum_div(151) == 3162", "assert sum_div(121) == 2084", "assert sum_div(277) == 11060", "assert sum_div(272) == 10512", "assert sum_div(1) == 0"], "test_code": "assert sum_div(119) == 1964\nassert sum_div(260) == 9454\nassert sum_div(151) == 3162\nassert sum_div(121) == 2084\nassert sum_div(277) == 11060\nassert sum_div(272) == 10512\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)", "completion": " ```python\ndef sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_div` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 4 أو 14 دون باقٍ.\nمثال: `sum_div(119) == 1964`\nالجواب:", "qhash": "4b19e683fc6b16d6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "tests": ["assert multiples_total(20) == 51", "assert multiples_total(79) == 681", "assert multiples_total(70) == 456", "assert multiples_total(168) == 2808", "assert multiples_total(262) == 6891", "assert multiples_total(257) == 6633", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(20) == 51\nassert multiples_total(79) == 681\nassert multiples_total(70) == 456\nassert multiples_total(168) == 2808\nassert multiples_total(262) == 6891\nassert multiples_total(257) == 6633\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 15 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 6 أو 15 دون باقٍ.\nمثال: `multiples_total(20) == 51`\nالجواب:", "qhash": "a1f1a7079d2d84bb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x * -3 + 10 for x in range(4, 10) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x * -3 + 10 for x in range(4, 10) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "0fe52064f39876a1", "answer": "[-2, -8, -14]\n3 -24", "completion": " الناتج:\n```text\n[-2, -8, -14]\n3 -24\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['planet', 'river', 'stone', 'light', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['planet', 'river', 'stone', 'light', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "6616c99f568a590f", "answer": "['river', 'stone', 'light', 'planet', 'garden']\n['planet', 'garden', 'stone']", "completion": " الناتج:\n```text\n['river', 'stone', 'light', 'planet', 'garden']\n['planet', 'garden', 'stone']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "starts_count", "reference": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ك'):\n            count += 1\n    return count", "tests": ["assert starts_count('دفتر باب') == 0", "assert starts_count('خبز كتاب عربية ميناء قهوة نهار طائرة') == 1", "assert starts_count('خبز جبل معلم سماء كتاب مكتبة مطر') == 1", "assert starts_count('مكتبة كتاب كتاب عمل مكتبة مطر') == 2", "assert starts_count('كتاب سوق برتقال') == 1", "assert starts_count('مدرسة سلام قمر كتاب كتاب طائرة وردة حديقة') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('دفتر باب') == 0\nassert starts_count('خبز كتاب عربية ميناء قهوة نهار طائرة') == 1\nassert starts_count('خبز جبل معلم سماء كتاب مكتبة مطر') == 1\nassert starts_count('مكتبة كتاب كتاب عمل مكتبة مطر') == 2\nassert starts_count('كتاب سوق برتقال') == 1\nassert starts_count('مدرسة سلام قمر كتاب كتاب طائرة وردة حديقة') == 2\nassert starts_count('') == 0", "answer": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ك'):\n            count += 1\n    return count", "completion": " ```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ك'):\n            count += 1\n    return count\n```\n", "buggy": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ك' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ك»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ك' in w:\n            count += 1\n    return count\n```\nمثال: `starts_count('دفتر باب') == 0`\nالجواب:", "qhash": "13b7d42642dc98a8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('سيارة بحر دفتر') == 1", "assert prefix_hits('قلم برتقال دفتر مطر سماء دفتر') == 2", "assert prefix_hits('طائرة دفتر قمر لغة دفتر حديقة') == 2", "assert prefix_hits('نهار دفتر قلم دفتر جمل') == 2", "assert prefix_hits('وردة برمجة وردة عربية برمجة') == 0", "assert prefix_hits('برمجة قلم') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('سيارة بحر دفتر') == 1\nassert prefix_hits('قلم برتقال دفتر مطر سماء دفتر') == 2\nassert prefix_hits('طائرة دفتر قمر لغة دفتر حديقة') == 2\nassert prefix_hits('نهار دفتر قلم دفتر جمل') == 2\nassert prefix_hits('وردة برمجة وردة عربية برمجة') == 0\nassert prefix_hits('برمجة قلم') == 0\nassert prefix_hits('') == 0", "answer": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('د'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('د'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «د»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('د'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('سيارة بحر دفتر') == 1`\nالجواب:", "qhash": "46706a04c2fbe48d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if 12 <= x <= 52)", "tests": ["assert in_range_scaled([9, 41, 60, 41, 38, 38, 42, 7, 43]) == [76, 76, 82, 82, 84, 86]", "assert in_range_scaled([-29, 54, 30, 9]) == [60]", "assert in_range_scaled([-19, 41, 37, 39]) == [74, 78, 82]", "assert in_range_scaled([60, 59, -19, 22, 5, -23, 57]) == [44]", "assert in_range_scaled([41, 16, -8, 10, 6, -5, 30, 31, 48, 16]) == [32, 32, 60, 62, 82, 96]", "assert in_range_scaled([]) == []", "assert in_range_scaled([-11, 60, 32, 10, 56, 41, 10, 28, 51]) == [56, 64, 82, 102]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([9, 41, 60, 41, 38, 38, 42, 7, 43]) == [76, 76, 82, 82, 84, 86]\nassert in_range_scaled([-29, 54, 30, 9]) == [60]\nassert in_range_scaled([-19, 41, 37, 39]) == [74, 78, 82]\nassert in_range_scaled([60, 59, -19, 22, 5, -23, 57]) == [44]\nassert in_range_scaled([41, 16, -8, 10, 6, -5, 30, 31, 48, 16]) == [32, 32, 60, 62, 82, 96]\nassert in_range_scaled([]) == []\nassert in_range_scaled([-11, 60, 32, 10, 56, 41, 10, 28, 51]) == [56, 64, 82, 102]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if 12 <= x <= 52)", "completion": " ```python\ndef in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if 12 <= x <= 52)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `in_range_scaled` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 2 لكل عنصر x في المدى المغلق [12, 52].\nمثال: `in_range_scaled([9, 41, 60, 41, 38, 38, 42, 7, 43]) == [76, 76, 82, 82, 84, 86]`\nالجواب:", "qhash": "606cf7e591503e17"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 10125\nc = 0\nwhile n > 8:\n    n = n // 7\n    c += 1\nprint(n, c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 10125\nc = 0\nwhile n > 8:\n    n = n // 7\n    c += 1\nprint(n, c)\n```\nالجواب:", "qhash": "9200366ae0dbd78f", "answer": "4 4", "completion": " الناتج:\n```text\n4 4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 26) == 1)", "tests": ["assert phi_upto(69) == 32", "assert phi_upto(32) == 15", "assert phi_upto(10) == 5", "assert phi_upto(0) == 0", "assert phi_upto(134) == 62", "assert phi_upto(82) == 38", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(69) == 32\nassert phi_upto(32) == 15\nassert phi_upto(10) == 5\nassert phi_upto(0) == 0\nassert phi_upto(134) == 62\nassert phi_upto(82) == 38\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 26) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 26) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 26 في أي قاسم أكبر من 1.\nمثال: `phi_upto(69) == 32`\nالجواب:", "qhash": "cef139773ed94eb2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'coffee'\nprint(name.split('_'))\nprint(name[-1:])\nprint(name.capitalize())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'coffee'\nprint(name.split('_'))\nprint(name[-1:])\nprint(name.capitalize())\n```\nالجواب:", "qhash": "53cab70425b8c7a7", "answer": "['coffee']\ne\nCoffee", "completion": " الناتج:\n```text\n['coffee']\ne\nCoffee\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 6\nfor n in range(4, 28, 3):\n    result += n * 9\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 6\nfor n in range(4, 28, 3):\n    result += n * 9\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "22a30861496becdc", "answer": "1050\n25", "completion": " الناتج:\n```text\n1050\n25\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=5):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(compute(19))\nprint(compute(19, -1))\nprint(compute(compute(-1), 19))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=5):\n    if x > y:\n        return x * 3 - y\n    return x + y * 3\n\nprint(compute(19))\nprint(compute(19, -1))\nprint(compute(compute(-1), 19))\n```\nالجواب:", "qhash": "965e0327edef1aac", "answer": "52\n58\n71", "completion": " الناتج:\n```text\n52\n58\n71\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return 6 * x ** 2 + (7) * x + (1)", "tests": ["assert p(1) == 14", "assert p(-11) == 650", "assert p(3) == 76", "assert p(20) == 2541", "assert p(14) == 1275", "assert p(-11) == 650", "assert p(-18) == 1819", "assert p(0) == 1"], "test_code": "assert p(1) == 14\nassert p(-11) == 650\nassert p(3) == 76\nassert p(20) == 2541\nassert p(14) == 1275\nassert p(-11) == 650\nassert p(-18) == 1819\nassert p(0) == 1", "answer": "def p(x):\n    return 6 * x ** 2 + (7) * x + (1)", "completion": " ```python\ndef p(x):\n    return 6 * x ** 2 + (7) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 6x² + 7x + 1.\nمثال: `p(1) == 14`\nالجواب:", "qhash": "1bf5fe9c629987fe"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 4) == 1)", "tests": ["assert rel_prime_count(39) == 20", "assert rel_prime_count(24) == 12", "assert rel_prime_count(56) == 28", "assert rel_prime_count(142) == 71", "assert rel_prime_count(170) == 85", "assert rel_prime_count(91) == 46", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(39) == 20\nassert rel_prime_count(24) == 12\nassert rel_prime_count(56) == 28\nassert rel_prime_count(142) == 71\nassert rel_prime_count(170) == 85\nassert rel_prime_count(91) == 46\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 4) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 4) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 4 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(39) == 20`\nالجواب:", "qhash": "1178ebcae4e6dc54"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 52:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([13, 13, 9, 6, 26, 14, 16, 10]) == [13, 26, 35, 41, 0, 14, 30, 40]", "assert rolling_total([]) == []", "assert rolling_total([48, 36]) == [48, 0]", "assert rolling_total([14, 0, -7, 39, 22, 50, 44, -10]) == [14, 14, 7, 46, 0, 50, 0, -10]", "assert rolling_total([17, -7, 23, 16]) == [17, 10, 33, 49]", "assert rolling_total([52, -4, -8]) == [52, 48, 40]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([13, 13, 9, 6, 26, 14, 16, 10]) == [13, 26, 35, 41, 0, 14, 30, 40]\nassert rolling_total([]) == []\nassert rolling_total([48, 36]) == [48, 0]\nassert rolling_total([14, 0, -7, 39, 22, 50, 44, -10]) == [14, 14, 7, 46, 0, 50, 0, -10]\nassert rolling_total([17, -7, 23, 16]) == [17, 10, 33, 49]\nassert rolling_total([52, -4, -8]) == [52, 48, 40]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 52:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 52:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 52 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([13, 13, 9, 6, 26, 14, 16, 10]) == [13, 26, 35, 41, 0, 14, 30, 40]`\nالجواب:", "qhash": "2aeb111ba04e9f24"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_sel", "reference": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert count_sel([52, 89, 71, 11, 42, 3, 37, 86, 68, 78]) == 0", "assert count_sel([81, 52, 30, 15, 68, 55, -35, -32]) == 0", "assert count_sel([3]) == 0", "assert count_sel([-34, 87, -4]) == 0", "assert count_sel([]) == 0", "assert count_sel([13, 27, 16, -8, -2, 8, 41, 7, 75]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([52, 89, 71, 11, 42, 3, 37, 86, 68, 78]) == 0\nassert count_sel([81, 52, 30, 15, 68, 55, -35, -32]) == 0\nassert count_sel([3]) == 0\nassert count_sel([-34, 87, -4]) == 0\nassert count_sel([]) == 0\nassert count_sel([13, 27, 16, -8, -2, 8, 41, 7, 75]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_sel([52, 89, 71, 11, 42, 3, 37, 86, 68, 78]) == 0`\nالجواب:", "qhash": "f1cc812876fc7626"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 53", "tests": ["assert step_product(9) == 44", "assert step_product(44) == 23", "assert step_product(46) == 51", "assert step_product(34) == 21", "assert step_product(54) == 30", "assert step_product(42) == 21", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 44\nassert step_product(44) == 23\nassert step_product(46) == 51\nassert step_product(34) == 21\nassert step_product(54) == 30\nassert step_product(42) == 21\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 53", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(9) == 44`\nالجواب:", "qhash": "e7f0575b6e84a999"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=8):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(f(4))\nprint(f(4, 11))\nprint(f(f(11), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=8):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(f(4))\nprint(f(4, 11))\nprint(f(f(11), 4))\n```\nالجواب:", "qhash": "a2515790d62aade8", "answer": "-20\n-29\n-53", "completion": " الناتج:\n```text\n-20\n-29\n-53\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "cipher", "reference": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert cipher('light matrix in planet stone 2024') == 'ifdeq jxqofu fk mixkbq pqlkb 2024'", "assert cipher('stone') == 'pqlkb'", "assert cipher('apple stone') == 'xmmib pqlkb'", "assert cipher('camel go python on music 2024') == 'zxjbi dl mvqelk lk jrpfz 2024'", "assert cipher('rocket orange orange vector') == 'olzhbq loxkdb loxkdb sbzqlo'", "assert cipher('cloud music of desert orange A1') == 'zilra jrpfz lc abpboq loxkdb A1'", "assert cipher('') == ''"], "test_code": "assert cipher('light matrix in planet stone 2024') == 'ifdeq jxqofu fk mixkbq pqlkb 2024'\nassert cipher('stone') == 'pqlkb'\nassert cipher('apple stone') == 'xmmib pqlkb'\nassert cipher('camel go python on music 2024') == 'zxjbi dl mvqelk lk jrpfz 2024'\nassert cipher('rocket orange orange vector') == 'olzhbq loxkdb loxkdb sbzqlo'\nassert cipher('cloud music of desert orange A1') == 'zilra jrpfz lc abpboq loxkdb A1'\nassert cipher('') == ''", "answer": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cipher` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('light matrix in planet stone 2024') == 'ifdeq jxqofu fk mixkbq pqlkb 2024'`\nالجواب:", "qhash": "8e9ecaaba8b11a39"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(29) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13', 'Ping', '15', '16', '17', 'Pong', '19', '20', 'Ping', '22', '23', '24', '25', '26', 'Pong', 'Ping', '29']", "assert fizzbuzz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13', 'Ping', '15', '16', '17', 'Pong', '19', '20', 'Ping', '22']", "assert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13']", "assert fizzbuzz(0) == []", "assert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10']"], "test_code": "assert fizzbuzz(29) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13', 'Ping', '15', '16', '17', 'Pong', '19', '20', 'Ping', '22', '23', '24', '25', '26', 'Pong', 'Ping', '29']\nassert fizzbuzz(22) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13', 'Ping', '15', '16', '17', 'Pong', '19', '20', 'Ping', '22']\nassert fizzbuzz(13) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13']\nassert fizzbuzz(0) == []\nassert fizzbuzz(10) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Ping'\n        if i % 9 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Ping'، مضاعفات 9 تصبح 'Pong'، المضاعفات المشتركة تصبح 'PingPong'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(29) == ['1', '2', '3', '4', '5', '6', 'Ping', '8', 'Pong', '10', '11', '12', '13', 'Ping', '15', '16', '17', 'Pong', '19', '20', 'Ping', '22', '23', '24', '25', '26', 'Pong', 'Ping', '29']`\nالجواب:", "qhash": "1361d53b95950f16"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n):\n    if n <= 0:\n        return 4\n    return 1 * calc(n - 1) + -2\n\nprint(calc(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n):\n    if n <= 0:\n        return 4\n    return 1 * calc(n - 1) + -2\n\nprint(calc(9))\n```\nالجواب:", "qhash": "17fcf15fbce22313", "answer": "-14", "completion": " الناتج:\n```text\n-14\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'desert'\nprint(word[2:6])\nprint(word[::-1])\nprint(len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'desert'\nprint(word[2:6])\nprint(word[::-1])\nprint(len(word))\n```\nالجواب:", "qhash": "12d47bf7290f1bf6", "answer": "sert\ntresed\n6", "completion": " الناتج:\n```text\nsert\ntresed\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "tally", "reference": "def tally(s):\n    return {c: s.count(c) for c in 'abhr'}", "tests": ["assert tally('matrix rocket in of summer') == {'a': 1, 'b': 0, 'h': 0, 'r': 3}", "assert tally('summer is we winter signal') == {'a': 1, 'b': 0, 'h': 0, 'r': 2}", "assert tally('a orange') == {'a': 2, 'b': 0, 'h': 0, 'r': 1}", "assert tally('in on we') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}", "assert tally('orange it') == {'a': 1, 'b': 0, 'h': 0, 'r': 1}", "assert tally('up go') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}", "assert tally('') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}"], "test_code": "assert tally('matrix rocket in of summer') == {'a': 1, 'b': 0, 'h': 0, 'r': 3}\nassert tally('summer is we winter signal') == {'a': 1, 'b': 0, 'h': 0, 'r': 2}\nassert tally('a orange') == {'a': 2, 'b': 0, 'h': 0, 'r': 1}\nassert tally('in on we') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}\nassert tally('orange it') == {'a': 1, 'b': 0, 'h': 0, 'r': 1}\nassert tally('up go') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}\nassert tally('') == {'a': 0, 'b': 0, 'h': 0, 'r': 0}", "answer": "def tally(s):\n    return {c: s.count(c) for c in 'abhr'}", "completion": " ```python\ndef tally(s):\n    return {c: s.count(c) for c in 'abhr'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `tally` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'a'، 'b'، 'h'، 'r' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `tally('matrix rocket in of summer') == {'a': 1, 'b': 0, 'h': 0, 'r': 3}`\nالجواب:", "qhash": "9332e6a991730c7f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 16\nfor n in range(3, 28, 4):\n    total -= n * 5\nprint(total)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 16\nfor n in range(3, 28, 4):\n    total -= n * 5\nprint(total)\nprint(n)\n```\nالجواب:", "qhash": "e53775437e08d9ac", "answer": "-509\n27", "completion": " الناتج:\n```text\n-509\n27\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'باسل': 32, 'رنا': 7, 'فيصل': 34, 'سعيد': 25}\npoints['رنا'] += 4\npoints['ليلى'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'باسل': 32, 'رنا': 7, 'فيصل': 34, 'سعيد': 25}\npoints['رنا'] += 4\npoints['ليلى'] = 2\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "297c8de1a578d830", "answer": "5\nفيصل\n104\n[('ليلى', 2), ('رنا', 11)]", "completion": " الناتج:\n```text\n5\nفيصل\n104\n[('ليلى', 2), ('رنا', 11)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [18, 17, 40, 16, 39]\nprint(items[0:5])\nprint(items[::3])\nprint(min(items[0:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [18, 17, 40, 16, 39]\nprint(items[0:5])\nprint(items[::3])\nprint(min(items[0:5]))\n```\nالجواب:", "qhash": "ebce8253072526ae", "answer": "[18, 17, 40, 16, 39]\n[18, 16]\n16", "completion": " الناتج:\n```text\n[18, 17, 40, 16, 39]\n[18, 16]\n16\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_count", "reference": "def letter_count(text):\n    return text.count('ي')", "tests": ["assert letter_count('علم جبل حصان ماء حصان شمس') == 0", "assert letter_count('علم مطر نهار سيارة') == 1", "assert letter_count('سماء صحراء') == 0", "assert letter_count('سلام سماء علم') == 0", "assert letter_count('مدينة سيارة شجرة') == 2", "assert letter_count('لغة علم برتقال نهار سيارة سيارة حصان ميناء') == 3", "assert letter_count('') == 0", "assert letter_count('') == 0"], "test_code": "assert letter_count('علم جبل حصان ماء حصان شمس') == 0\nassert letter_count('علم مطر نهار سيارة') == 1\nassert letter_count('سماء صحراء') == 0\nassert letter_count('سلام سماء علم') == 0\nassert letter_count('مدينة سيارة شجرة') == 2\nassert letter_count('لغة علم برتقال نهار سيارة سيارة حصان ميناء') == 3\nassert letter_count('') == 0\nassert letter_count('') == 0", "answer": "def letter_count(text):\n    return text.count('ي')", "completion": " ```python\ndef letter_count(text):\n    return text.count('ي')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_count` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ي» في النص.\nمثال: `letter_count('علم جبل حصان ماء حصان شمس') == 0`\nالجواب:", "qhash": "f246f6a0d5e69af8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * -1 for x in xs if 0 <= x <= 20)", "tests": ["assert pick_between([-3, 12, -3, 8, 5]) == [-12, -8, -5]", "assert pick_between([42, 10, 20, 4, 48, 48, 41, 31, -11, -12]) == [-20, -10, -4]", "assert pick_between([41, 58, -18, -26, 23, -28, 56]) == []", "assert pick_between([16, 41, -9, 57, 1, -18, 28, 59, 35]) == [-16, -1]", "assert pick_between([60, 35, 37, -21, -17, -14, -11, -6, 28]) == []", "assert pick_between([58]) == []", "assert pick_between([59, -12, -26, 45, 59]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([-3, 12, -3, 8, 5]) == [-12, -8, -5]\nassert pick_between([42, 10, 20, 4, 48, 48, 41, 31, -11, -12]) == [-20, -10, -4]\nassert pick_between([41, 58, -18, -26, 23, -28, 56]) == []\nassert pick_between([16, 41, -9, 57, 1, -18, 28, 59, 35]) == [-16, -1]\nassert pick_between([60, 35, 37, -21, -17, -14, -11, -6, 28]) == []\nassert pick_between([58]) == []\nassert pick_between([59, -12, -26, 45, 59]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * -1 for x in xs if 0 <= x <= 20)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * -1 for x in xs if 0 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -1 لكل عنصر x في المدى المغلق [0, 20].\nمثال: `pick_between([-3, 12, -3, 8, 5]) == [-12, -8, -5]`\nالجواب:", "qhash": "f606aed6c0689ee3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert mirror_words('we signal we up') == 'signal'", "assert mirror_words('garden at camel python stone rocket pixel') == 'pixel rocket stone python camel garden'", "assert mirror_words('light falcon') == 'falcon light'", "assert mirror_words('light in vector of table') == 'table vector light'", "assert mirror_words('winter by we on up river') == 'river winter'", "assert mirror_words('') == ''", "assert mirror_words('vector camel of garden is') == 'garden camel vector'"], "test_code": "assert mirror_words('we signal we up') == 'signal'\nassert mirror_words('garden at camel python stone rocket pixel') == 'pixel rocket stone python camel garden'\nassert mirror_words('light falcon') == 'falcon light'\nassert mirror_words('light in vector of table') == 'table vector light'\nassert mirror_words('winter by we on up river') == 'river winter'\nassert mirror_words('') == ''\nassert mirror_words('vector camel of garden is') == 'garden camel vector'", "answer": "def mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 4 من آخرها إلى أولها، موصولة بالفاصل ' '.\nمثال: `mirror_words('we signal we up') == 'signal'`\nالجواب:", "qhash": "9ac480a2c1ba958a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 29", "tests": ["assert sum_digit_pow(34586) == 3", "assert sum_digit_pow(681743) == 11", "assert sum_digit_pow(889610) == 13", "assert sum_digit_pow(32085) == 4", "assert sum_digit_pow(766921) == 0", "assert sum_digit_pow(273913) == 6", "assert sum_digit_pow(37763) == 25", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(34586) == 3\nassert sum_digit_pow(681743) == 11\nassert sum_digit_pow(889610) == 13\nassert sum_digit_pow(32085) == 4\nassert sum_digit_pow(766921) == 0\nassert sum_digit_pow(273913) == 6\nassert sum_digit_pow(37763) == 25\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 29", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 29.\nمثال: `sum_digit_pow(34586) == 3`\nالجواب:", "qhash": "59891e8831b2bdb6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n < 2:\n        return n + 2\n    return f(n - 1) + f(n - 2)\n\nprint(f(7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n < 2:\n        return n + 2\n    return f(n - 1) + f(n - 2)\n\nprint(f(7))\n```\nالجواب:", "qhash": "4cf883d84d397566", "answer": "55", "completion": " الناتج:\n```text\n55\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digits_mod", "reference": "def digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 57", "tests": ["assert digits_mod(39876) == 3", "assert digits_mod(446663) == 5", "assert digits_mod(994072) == 49", "assert digits_mod(717390) == 18", "assert digits_mod(741343) == 13", "assert digits_mod(411288) == 15", "assert digits_mod(975368) == 14", "assert digits_mod(0) == 0"], "test_code": "assert digits_mod(39876) == 3\nassert digits_mod(446663) == 5\nassert digits_mod(994072) == 49\nassert digits_mod(717390) == 18\nassert digits_mod(741343) == 13\nassert digits_mod(411288) == 15\nassert digits_mod(975368) == 14\nassert digits_mod(0) == 0", "answer": "def digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 57", "completion": " ```python\ndef digits_mod(n):\n    return sum(int(d) ** 3 for d in str(n)) % 57\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digits_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 57.\nمثال: `digits_mod(39876) == 3`\nالجواب:", "qhash": "5126f661c6cac933"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'وردة'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint('د' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'وردة'\nprint(kalima[-1])\nprint(kalima.replace(' ', '-'))\nprint('د' in kalima)\n```\nالجواب:", "qhash": "c620f6dc7afc19f6", "answer": "ة\nوردة\nTrue", "completion": " الناتج:\n```text\nة\nوردة\nTrue\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return -4 * x ** 2 + (5) * x + (-6)", "tests": ["assert quad(4) == -50", "assert quad(-20) == -1706", "assert quad(-7) == -237", "assert quad(-13) == -747", "assert quad(-11) == -545", "assert quad(-13) == -747", "assert quad(4) == -50", "assert quad(0) == -6"], "test_code": "assert quad(4) == -50\nassert quad(-20) == -1706\nassert quad(-7) == -237\nassert quad(-13) == -747\nassert quad(-11) == -545\nassert quad(-13) == -747\nassert quad(4) == -50\nassert quad(0) == -6", "answer": "def quad(x):\n    return -4 * x ** 2 + (5) * x + (-6)", "completion": " ```python\ndef quad(x):\n    return -4 * x ** 2 + (5) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -4x² + 5x - 6.\nمثال: `quad(4) == -50`\nالجواب:", "qhash": "ec71bb71727ffdde"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_count", "reference": "def letter_count(text):\n    return text.count('ن')", "tests": ["assert letter_count('نهار كتاب مطر بحر فجر سيارة تفاحة جبل') == 1", "assert letter_count('ليل قهوة وردة') == 0", "assert letter_count('خبز قلم ماء ليل عربية') == 0", "assert letter_count('نور لغة باب حصان فجر جبل رمل نهر') == 3", "assert letter_count('طائرة لغة حصان عمل صديق عربية ميناء طائرة') == 2", "assert letter_count('قمر جمل طالب ميناء') == 1", "assert letter_count('ميناء معلم سوق') == 1", "assert letter_count('') == 0"], "test_code": "assert letter_count('نهار كتاب مطر بحر فجر سيارة تفاحة جبل') == 1\nassert letter_count('ليل قهوة وردة') == 0\nassert letter_count('خبز قلم ماء ليل عربية') == 0\nassert letter_count('نور لغة باب حصان فجر جبل رمل نهر') == 3\nassert letter_count('طائرة لغة حصان عمل صديق عربية ميناء طائرة') == 2\nassert letter_count('قمر جمل طالب ميناء') == 1\nassert letter_count('ميناء معلم سوق') == 1\nassert letter_count('') == 0", "answer": "def letter_count(text):\n    return text.count('ن')", "completion": " ```python\ndef letter_count(text):\n    return text.count('ن')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_count` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ن» في النص.\nمثال: `letter_count('نهار كتاب مطر بحر فجر سيارة تفاحة جبل') == 1`\nالجواب:", "qhash": "ab2f37428790efd7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "tests": ["assert sum_multiples(194) == 3327", "assert sum_multiples(194) == 3327", "assert sum_multiples(246) == 5274", "assert sum_multiples(9) == 0", "assert sum_multiples(161) == 2274", "assert sum_multiples(132) == 1543", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(194) == 3327\nassert sum_multiples(194) == 3327\nassert sum_multiples(246) == 5274\nassert sum_multiples(9) == 0\nassert sum_multiples(161) == 2274\nassert sum_multiples(132) == 1543\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 13 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 9 أو 13 دون باقٍ.\nمثال: `sum_multiples(194) == 3327`\nالجواب:", "qhash": "5479e2dda3e3ab13"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x ** 2 - 6 for x in range(-3, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x ** 2 - 6 for x in range(-3, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "a77d38b61fcd55b1", "answer": "[-2, -6, -2, 10, 30, 58, 94]\n7 182", "completion": " الناتج:\n```text\n[-2, -6, -2, 10, 30, 58, 94]\n7 182\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 126:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([32, 22, 46, 54, 42, 32, 36]) == [32, 54, 100, 0, 42, 74, 110]", "assert rolling_total([85, 121]) == [85, 0]", "assert rolling_total([49, 14, 95]) == [49, 63, 0]", "assert rolling_total([50, 3, 61, 21, 67, 12, 62, 106, 124]) == [50, 53, 114, 0, 67, 79, 0, 106, 0]", "assert rolling_total([110, 48, 77]) == [110, 0, 77]", "assert rolling_total([76, 34]) == [76, 110]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([32, 22, 46, 54, 42, 32, 36]) == [32, 54, 100, 0, 42, 74, 110]\nassert rolling_total([85, 121]) == [85, 0]\nassert rolling_total([49, 14, 95]) == [49, 63, 0]\nassert rolling_total([50, 3, 61, 21, 67, 12, 62, 106, 124]) == [50, 53, 114, 0, 67, 79, 0, 106, 0]\nassert rolling_total([110, 48, 77]) == [110, 0, 77]\nassert rolling_total([76, 34]) == [76, 110]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 126:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 126:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 126 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([32, 22, 46, 54, 42, 32, 36]) == [32, 54, 100, 0, 42, 74, 110]`\nالجواب:", "qhash": "b2d3223c22711823"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'راشد': 16, 'هدى': 48, 'فيصل': 44, 'منى': 24}\npoints['منى'] += 1\npoints['زينب'] = 50\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 20])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'راشد': 16, 'هدى': 48, 'فيصل': 44, 'منى': 24}\npoints['منى'] += 1\npoints['زينب'] = 50\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint([k for k in points if points[k] > 20])\n```\nالجواب:", "qhash": "5052ed0b5aedc4b5", "answer": "5\nزينب\n183\n['هدى', 'فيصل', 'منى', 'زينب']", "completion": " الناتج:\n```text\n5\nزينب\n183\n['هدى', 'فيصل', 'منى', 'زينب']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert flip_words('it a rocket matrix apple window code') == 'code|window|apple|matrix|rocket|it'", "assert flip_words('planet coffee cloud to music a stone pixel') == 'pixel|stone|music|to|cloud|coffee|planet'", "assert flip_words('winter pixel up desert apple') == 'apple|desert|up|pixel|winter'", "assert flip_words('planet') == 'planet'", "assert flip_words('pixel stone matrix') == 'matrix|stone|pixel'", "assert flip_words('python a camel code banana table') == 'table|banana|code|camel|python'", "assert flip_words('stone rocket') == 'rocket|stone'"], "test_code": "assert flip_words('it a rocket matrix apple window code') == 'code|window|apple|matrix|rocket|it'\nassert flip_words('planet coffee cloud to music a stone pixel') == 'pixel|stone|music|to|cloud|coffee|planet'\nassert flip_words('winter pixel up desert apple') == 'apple|desert|up|pixel|winter'\nassert flip_words('planet') == 'planet'\nassert flip_words('pixel stone matrix') == 'matrix|stone|pixel'\nassert flip_words('python a camel code banana table') == 'table|banana|code|camel|python'\nassert flip_words('stone rocket') == 'rocket|stone'", "answer": "def flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef flip_words(s):\n    return '|'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '|'.\nمثال: `flip_words('it a rocket matrix apple window code') == 'code|window|apple|matrix|rocket|it'`\nالجواب:", "qhash": "10ba26889ec631f9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['apple', 'falcon', 'winter', 'planet', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['apple', 'falcon', 'winter', 'planet', 'desert']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "1169e9ebd98f3962", "answer": "['apple', 'falcon', 'winter', 'planet', 'desert']\n['winter', 'planet', 'falcon']", "completion": " الناتج:\n```text\n['apple', 'falcon', 'winter', 'planet', 'desert']\n['winter', 'planet', 'falcon']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return 9 * x ** 2 + (2) * x + (-5)", "tests": ["assert evaluate(6) == 331", "assert evaluate(10) == 915", "assert evaluate(-11) == 1062", "assert evaluate(-1) == 2", "assert evaluate(-10) == 875", "assert evaluate(20) == 3635", "assert evaluate(-5) == 210", "assert evaluate(0) == -5"], "test_code": "assert evaluate(6) == 331\nassert evaluate(10) == 915\nassert evaluate(-11) == 1062\nassert evaluate(-1) == 2\nassert evaluate(-10) == 875\nassert evaluate(20) == 3635\nassert evaluate(-5) == 210\nassert evaluate(0) == -5", "answer": "def evaluate(x):\n    return 9 * x ** 2 + (2) * x + (-5)", "completion": " ```python\ndef evaluate(x):\n    return 9 * x ** 2 + (2) * x + (-5)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 9x² + 2x - 5.\nمثال: `evaluate(6) == 331`\nالجواب:", "qhash": "488d21751914917e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'لغة'\nprint(len(s))\nprint(len(s.replace(' ', '')))\nprint(s[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'لغة'\nprint(len(s))\nprint(len(s.replace(' ', '')))\nprint(s[::-1])\n```\nالجواب:", "qhash": "06dc5e80b8d57dff", "answer": "3\n3\nةغل", "completion": " الناتج:\n```text\n3\n3\nةغل\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_list", "reference": "def rotate_list(lst):\n    if not lst:\n        return []\n    k = 17 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([14, 45, 12]) == [45, 12, 14]", "assert rotate_list([42, 19, 40, 7, 5, 42, 17, -4, 26, 40]) == [7, 5, 42, 17, -4, 26, 40, 42, 19, 40]", "assert rotate_list([34, -9, 18, 28, 39, 45, 4, 3, 20]) == [-9, 18, 28, 39, 45, 4, 3, 20, 34]", "assert rotate_list([27, 30, -4, 49, 34, 12, 35, 41]) == [41, 27, 30, -4, 49, 34, 12, 35]", "assert rotate_list([14, 47, 10, 41, 20, 3, 36, 8, 48]) == [47, 10, 41, 20, 3, 36, 8, 48, 14]", "assert rotate_list([23, 18, -6, 33, 23, -9, -8, 44, -7, 16]) == [33, 23, -9, -8, 44, -7, 16, 23, 18, -6]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([14, 45, 12]) == [45, 12, 14]\nassert rotate_list([42, 19, 40, 7, 5, 42, 17, -4, 26, 40]) == [7, 5, 42, 17, -4, 26, 40, 42, 19, 40]\nassert rotate_list([34, -9, 18, 28, 39, 45, 4, 3, 20]) == [-9, 18, 28, 39, 45, 4, 3, 20, 34]\nassert rotate_list([27, 30, -4, 49, 34, 12, 35, 41]) == [41, 27, 30, -4, 49, 34, 12, 35]\nassert rotate_list([14, 47, 10, 41, 20, 3, 36, 8, 48]) == [47, 10, 41, 20, 3, 36, 8, 48, 14]\nassert rotate_list([23, 18, -6, 33, 23, -9, -8, 44, -7, 16]) == [33, 23, -9, -8, 44, -7, 16, 23, 18, -6]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n    if not lst:\n        return []\n    k = 17 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef rotate_list(lst):\n    if not lst:\n        return []\n    k = 17 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_list(lst):\n    if not lst:\n        return []\n    k = 17 % len(lst)\n    return ____\n```\nمثال: `rotate_list([14, 45, 12]) == [45, 12, 14]`\nالجواب:", "qhash": "9227d7670d5289a2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([43, 53, 71, 13, 27, 82, 79, 88]) == 0", "assert tally_div([80]) == 1", "assert tally_div([63, -32, 45, 52, 16, -28, 39, -20]) == 2", "assert tally_div([-10, 69, 81, -4, -21, -12, -3]) == 1", "assert tally_div([-27, 83, 77, -1]) == 0", "assert tally_div([56, -39, 57, 76, 11, 85, 85, 40, -14, -1, 50, 41]) == 4", "assert tally_div([]) == 0"], "test_code": "assert tally_div([43, 53, 71, 13, 27, 82, 79, 88]) == 0\nassert tally_div([80]) == 1\nassert tally_div([63, -32, 45, 52, 16, -28, 39, -20]) == 2\nassert tally_div([-10, 69, 81, -4, -21, -12, -3]) == 1\nassert tally_div([-27, 83, 77, -1]) == 0\nassert tally_div([56, -39, 57, 76, 11, 85, 85, 40, -14, -1, 50, 41]) == 4\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([43, 53, 71, 13, 27, 82, 79, 88]) == 0`\nالجواب:", "qhash": "f1f2751958aac481"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 23", "tests": ["assert fact_mod(7) == 13", "assert fact_mod(6) == 2", "assert fact_mod(36) == 10", "assert fact_mod(2) == 2", "assert fact_mod(10) == 22", "assert fact_mod(24) == 1", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(7) == 13\nassert fact_mod(6) == 2\nassert fact_mod(36) == 10\nassert fact_mod(2) == 2\nassert fact_mod(10) == 22\nassert fact_mod(24) == 1\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 23", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 23\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 23 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(7) == 13`\nالجواب:", "qhash": "6f011c8c869d65c7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 191:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([34, 47, 70, 37, 83, 5]) == [34, 81, 151, 188, 0, 5]", "assert reset_sum([183, 148, 72, 186, 172]) == [183, 0, 72, 0, 172]", "assert reset_sum([58, -9, 31, 109, 123, 10, 83, 187, 159]) == [58, 49, 80, 189, 0, 10, 93, 0, 159]", "assert reset_sum([157, 23, 34]) == [157, 180, 0]", "assert reset_sum([21, 28, 143, 82, 141, 52]) == [21, 49, 0, 82, 0, 52]", "assert reset_sum([100, 38, 109]) == [100, 138, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([34, 47, 70, 37, 83, 5]) == [34, 81, 151, 188, 0, 5]\nassert reset_sum([183, 148, 72, 186, 172]) == [183, 0, 72, 0, 172]\nassert reset_sum([58, -9, 31, 109, 123, 10, 83, 187, 159]) == [58, 49, 80, 189, 0, 10, 93, 0, 159]\nassert reset_sum([157, 23, 34]) == [157, 180, 0]\nassert reset_sum([21, 28, 143, 82, 141, 52]) == [21, 49, 0, 82, 0, 52]\nassert reset_sum([100, 38, 109]) == [100, 138, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 191:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 191:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 191 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([34, 47, 70, 37, 83, 5]) == [34, 81, 151, 188, 0, 5]`\nالجواب:", "qhash": "b2f5bff63d687078"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "starts_count", "reference": "def starts_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('و'):\n            count += 1\n    return count", "tests": ["assert starts_count('مكتبة قمر') == 0", "assert starts_count('صحراء صديق برتقال رمل وردة قلم نهر') == 1", "assert starts_count('سماء وردة سفينة جبل نهر تفاحة') == 1", "assert starts_count('نهار طالب جمل وردة') == 1", "assert starts_count('نهار جمل برمجة') == 0", "assert starts_count('جمل كتاب نور وردة') == 1", "assert starts_count('') == 0"], "test_code": "assert starts_count('مكتبة قمر') == 0\nassert starts_count('صحراء صديق برتقال رمل وردة قلم نهر') == 1\nassert starts_count('سماء وردة سفينة جبل نهر تفاحة') == 1\nassert starts_count('نهار طالب جمل وردة') == 1\nassert starts_count('نهار جمل برمجة') == 0\nassert starts_count('جمل كتاب نور وردة') == 1\nassert starts_count('') == 0", "answer": "def starts_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('و'):\n            count += 1\n    return count", "completion": " ```python\ndef starts_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('و'):\n            count += 1\n    return count\n```\n", "buggy": "def starts_count(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('و'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «و»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef starts_count(s):\n    count = 0\n    for w in s.split():\n        if w.endswith('و'):\n            count += 1\n    return count\n```\nمثال: `starts_count('مكتبة قمر') == 0`\nالجواب:", "qhash": "65aedaecf9b7251d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "only_div", "reference": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 9 != 0:\n            count += 1\n    return count", "tests": ["assert only_div([17, 83, 17, 7, 60, 8, 61, 42, 39, 8]) == 2", "assert only_div([-7, 70, 60, 58, 64, 55, -29]) == 1", "assert only_div([85, -39, 20, 18, 64, 17, 22, 19]) == 1", "assert only_div([-12, -5, 30, -37, -21, 86, 63, -4, -38, -5, -18]) == 0", "assert only_div([79, 69, 35, -6, 79, 36]) == 0", "assert only_div([72, 20, 28, -16, 37, 3, 29, -30]) == 1", "assert only_div([]) == 0"], "test_code": "assert only_div([17, 83, 17, 7, 60, 8, 61, 42, 39, 8]) == 2\nassert only_div([-7, 70, 60, 58, 64, 55, -29]) == 1\nassert only_div([85, -39, 20, 18, 64, 17, 22, 19]) == 1\nassert only_div([-12, -5, 30, -37, -21, 86, 63, -4, -38, -5, -18]) == 0\nassert only_div([79, 69, 35, -6, 79, 36]) == 0\nassert only_div([72, 20, 28, -16, 37, 3, 29, -30]) == 1\nassert only_div([]) == 0", "answer": "def only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 9 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 9 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 9. اكتب الحل كاملًا.\n```python\ndef only_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `only_div([17, 83, 17, 7, 60, 8, 61, 42, 39, 8]) == 2`\nالجواب:", "qhash": "56ce810c90ea542b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Red'\n        if i % 4 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(4) == ['1', 'Red', '3', 'RedBlue']", "assert fizzbuzz(22) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'RedBlue', '17', 'Red', '19', 'RedBlue', '21', 'Red']", "assert fizzbuzz(8) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue']", "assert fizzbuzz(15) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15']", "assert fizzbuzz(6) == ['1', 'Red', '3', 'RedBlue', '5', 'Red']"], "test_code": "assert fizzbuzz(4) == ['1', 'Red', '3', 'RedBlue']\nassert fizzbuzz(22) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15', 'RedBlue', '17', 'Red', '19', 'RedBlue', '21', 'Red']\nassert fizzbuzz(8) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue']\nassert fizzbuzz(15) == ['1', 'Red', '3', 'RedBlue', '5', 'Red', '7', 'RedBlue', '9', 'Red', '11', 'RedBlue', '13', 'Red', '15']\nassert fizzbuzz(6) == ['1', 'Red', '3', 'RedBlue', '5', 'Red']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Red'\n        if i % 4 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Red'\n        if i % 4 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Red'، مضاعفات 4 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(4) == ['1', 'Red', '3', 'RedBlue']`\nالجواب:", "qhash": "6b41634476267033"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 0\nfor n in range(-3, 20, 2):\n    acc -= n * 9\nprint(acc)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 0\nfor n in range(-3, 20, 2):\n    acc -= n * 9\nprint(acc)\nprint(n)\n```\nالجواب:", "qhash": "47ff01164c3efee9", "answer": "-864\n19", "completion": " الناتج:\n```text\n-864\n19\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)", "tests": ["assert phi_upto(108) == 36", "assert phi_upto(52) == 17", "assert phi_upto(22) == 7", "assert phi_upto(12) == 4", "assert phi_upto(106) == 35", "assert phi_upto(110) == 37", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(108) == 36\nassert phi_upto(52) == 17\nassert phi_upto(22) == 7\nassert phi_upto(12) == 4\nassert phi_upto(106) == 35\nassert phi_upto(110) == 37\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 18 في أي قاسم أكبر من 1.\nمثال: `phi_upto(108) == 36`\nالجواب:", "qhash": "73aab5ded68bc192"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * 3 + -10 for x in range(-6, 5) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * 3 + -10 for x in range(-6, 5) if x % 4 == 3]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "576a8e8e567ea81c", "answer": "[-25, -13, -1]\n3 -39", "completion": " الناتج:\n```text\n[-25, -13, -1]\n3 -39\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 11\nfor j in range(5, 9, 2):\n    s -= j * 2\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 11\nfor j in range(5, 9, 2):\n    s -= j * 2\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "fa3e5ee8bd1a56cb", "answer": "-13\n7", "completion": " الناتج:\n```text\n-13\n7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_terms", "reference": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 3\n    return total", "tests": ["assert sum_terms(6) == 441", "assert sum_terms(7) == 784", "assert sum_terms(12) == 6084", "assert sum_terms(12) == 6084", "assert sum_terms(14) == 11025", "assert sum_terms(1) == 1", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(6) == 441\nassert sum_terms(7) == 784\nassert sum_terms(12) == 6084\nassert sum_terms(12) == 6084\nassert sum_terms(14) == 11025\nassert sum_terms(1) == 1\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 3\n    return total", "completion": " ```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 1 * i ** 3\n    return total\n```\n", "buggy": "def sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 1 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 1 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n):\n        total += 1 * i ** 3\n    return total\n```\nمثال: `sum_terms(6) == 441`\nالجواب:", "qhash": "500a0ce225c17049"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "top_divisible", "reference": "def top_divisible(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert top_divisible([8, -12, -17, 19, 16, 44, 41, 19]) == 44", "assert top_divisible([-6, -6, -8]) == -6", "assert top_divisible([1, 3]) == None", "assert top_divisible([11, 7]) == None", "assert top_divisible([15, 22, 9, 33]) == 22", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([8, -12, -17, 19, 16, 44, 41, 19]) == 44\nassert top_divisible([-6, -6, -8]) == -6\nassert top_divisible([1, 3]) == None\nassert top_divisible([11, 7]) == None\nassert top_divisible([15, 22, 9, 33]) == 22\nassert top_divisible([]) == None", "answer": "def top_divisible(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef top_divisible(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def top_divisible(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef top_divisible(xs):\n    best = None\n    for x in xs:\n        if x % 2 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `top_divisible([8, -12, -17, 19, 16, 44, 41, 19]) == 44`\nالجواب:", "qhash": "966849d5f39f28cd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rotate_letters", "reference": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rotate_letters('signal we to garden OK') == 'ndbivg rz oj bvmyzi OK'", "assert rotate_letters('on garden') == 'ji bvmyzi'", "assert rotate_letters('signal python music camel go') == 'ndbivg ktocji hpndx xvhzg bj'", "assert rotate_letters('we at A1') == 'rz vo A1'", "assert rotate_letters('engine table table') == 'zibdiz ovwgz ovwgz'", "assert rotate_letters('camel is') == 'xvhzg dn'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('signal we to garden OK') == 'ndbivg rz oj bvmyzi OK'\nassert rotate_letters('on garden') == 'ji bvmyzi'\nassert rotate_letters('signal python music camel go') == 'ndbivg ktocji hpndx xvhzg bj'\nassert rotate_letters('we at A1') == 'rz vo A1'\nassert rotate_letters('engine table table') == 'zibdiz ovwgz ovwgz'\nassert rotate_letters('camel is') == 'xvhzg dn'\nassert rotate_letters('') == ''", "answer": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rotate_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('signal we to garden OK') == 'ndbivg rz oj bvmyzi OK'`\nالجواب:", "qhash": "6fb82bc9df8ac260"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'music'\nprint(word[::-1])\nprint(word.upper())\nprint(word.find('s'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'music'\nprint(word[::-1])\nprint(word.upper())\nprint(word.find('s'))\n```\nالجواب:", "qhash": "0556b543a428bd23", "answer": "cisum\nMUSIC\n2", "completion": " الناتج:\n```text\ncisum\nMUSIC\n2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "power_sum", "reference": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total", "tests": ["assert power_sum(6) == 85407", "assert power_sum(1) == 7", "assert power_sum(13) == 7014007", "assert power_sum(6) == 85407", "assert power_sum(9) == 845775", "assert power_sum(1) == 7", "assert power_sum(0) == 0"], "test_code": "assert power_sum(6) == 85407\nassert power_sum(1) == 7\nassert power_sum(13) == 7014007\nassert power_sum(6) == 85407\nassert power_sum(9) == 845775\nassert power_sum(1) == 7\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total", "completion": " ```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total\n```\n", "buggy": "def power_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 5\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef power_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 5\n    return total\n```\nمثال: `power_sum(6) == 85407`\nالجواب:", "qhash": "c59d5938f1af8ef0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'شمس'\nprint(len(text.replace(' ', '')))\nprint(text[0])\nprint(text[::-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'شمس'\nprint(len(text.replace(' ', '')))\nprint(text[0])\nprint(text[::-1])\n```\nالجواب:", "qhash": "c0a7b84c075c1aa9", "answer": "3\nش\nسمش", "completion": " الناتج:\n```text\n3\nش\nسمش\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n < 10:\n        return n\n    return n % 10 + f(n // 10)\n\nprint(f(475537736))\nprint(f(f(475537736)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n < 10:\n        return n\n    return n % 10 + f(n // 10)\n\nprint(f(475537736))\nprint(f(f(475537736)))\n```\nالجواب:", "qhash": "b4e93608c525f2b8", "answer": "47\n11", "completion": " الناتج:\n```text\n47\n11\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "filter_range", "reference": "def filter_range(xs):\n    return sorted(x * 5 for x in xs if 15 <= x <= 44)", "tests": ["assert filter_range([24, 35, 16, 37, 32, 49, 37, 26, 43, 8]) == [80, 120, 130, 160, 175, 185, 185, 215]", "assert filter_range([-13]) == []", "assert filter_range([24, 11, -19, 15]) == [75, 120]", "assert filter_range([13, 12, -4, 23, -13, 4, 22]) == [110, 115]", "assert filter_range([50, -11, 59, -16, 20, 48, 36, 49, 25, -25]) == [100, 125, 180]", "assert filter_range([5, 46]) == []", "assert filter_range([28, 7]) == [140]", "assert filter_range([]) == []"], "test_code": "assert filter_range([24, 35, 16, 37, 32, 49, 37, 26, 43, 8]) == [80, 120, 130, 160, 175, 185, 185, 215]\nassert filter_range([-13]) == []\nassert filter_range([24, 11, -19, 15]) == [75, 120]\nassert filter_range([13, 12, -4, 23, -13, 4, 22]) == [110, 115]\nassert filter_range([50, -11, 59, -16, 20, 48, 36, 49, 25, -25]) == [100, 125, 180]\nassert filter_range([5, 46]) == []\nassert filter_range([28, 7]) == [140]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n    return sorted(x * 5 for x in xs if 15 <= x <= 44)", "completion": " ```python\ndef filter_range(xs):\n    return sorted(x * 5 for x in xs if 15 <= x <= 44)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `filter_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [15, 44].\nمثال: `filter_range([24, 35, 16, 37, 32, 49, 37, 26, 43, 8]) == [80, 120, 130, 160, 175, 185, 185, 215]`\nالجواب:", "qhash": "be6b62676e5bd53e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('م'):\n            count += 1\n    return count", "tests": ["assert count_prefix('مكتبة حصان سفينة') == 1", "assert count_prefix('رمل تفاحة صحراء سيارة') == 0", "assert count_prefix('جمل باب معلم ميناء باب طائرة عربية') == 2", "assert count_prefix('نهار وردة سوق لغة مكتبة ميناء مطر') == 3", "assert count_prefix('بيت وردة وردة مكتبة شمس حديقة') == 1", "assert count_prefix('معلم خبز كتاب ماء مدينة سماء') == 3", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('مكتبة حصان سفينة') == 1\nassert count_prefix('رمل تفاحة صحراء سيارة') == 0\nassert count_prefix('جمل باب معلم ميناء باب طائرة عربية') == 2\nassert count_prefix('نهار وردة سوق لغة مكتبة ميناء مطر') == 3\nassert count_prefix('بيت وردة وردة مكتبة شمس حديقة') == 1\nassert count_prefix('معلم خبز كتاب ماء مدينة سماء') == 3\nassert count_prefix('') == 0", "answer": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('م'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('م'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if 'م' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «م»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(line):\n    count = 0\n    for w in line.split():\n        if 'م' in w:\n            count += 1\n    return count\n```\nمثال: `count_prefix('مكتبة حصان سفينة') == 1`\nالجواب:", "qhash": "ff63932343b8f557"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'planet'\nprint(word.capitalize())\nprint(word.upper())\nprint(word.replace('l', '0'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'planet'\nprint(word.capitalize())\nprint(word.upper())\nprint(word.replace('l', '0'))\n```\nالجواب:", "qhash": "9e4be0cafb22bea3", "answer": "Planet\nPLANET\np0anet", "completion": " الناتج:\n```text\nPlanet\nPLANET\np0anet\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'bcdg'}", "tests": ["assert char_freq('a garden by') == {'b': 1, 'c': 0, 'd': 1, 'g': 1}", "assert char_freq('music data cloud music data to') == {'b': 0, 'c': 3, 'd': 3, 'g': 0}", "assert char_freq('stone up data at go') == {'b': 0, 'c': 0, 'd': 1, 'g': 1}", "assert char_freq('a coffee up matrix it') == {'b': 0, 'c': 1, 'd': 0, 'g': 0}", "assert char_freq('is') == {'b': 0, 'c': 0, 'd': 0, 'g': 0}", "assert char_freq('stone winter window') == {'b': 0, 'c': 0, 'd': 1, 'g': 0}", "assert char_freq('') == {'b': 0, 'c': 0, 'd': 0, 'g': 0}"], "test_code": "assert char_freq('a garden by') == {'b': 1, 'c': 0, 'd': 1, 'g': 1}\nassert char_freq('music data cloud music data to') == {'b': 0, 'c': 3, 'd': 3, 'g': 0}\nassert char_freq('stone up data at go') == {'b': 0, 'c': 0, 'd': 1, 'g': 1}\nassert char_freq('a coffee up matrix it') == {'b': 0, 'c': 1, 'd': 0, 'g': 0}\nassert char_freq('is') == {'b': 0, 'c': 0, 'd': 0, 'g': 0}\nassert char_freq('stone winter window') == {'b': 0, 'c': 0, 'd': 1, 'g': 0}\nassert char_freq('') == {'b': 0, 'c': 0, 'd': 0, 'g': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'bcdg'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'bcdg'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 'c'، 'd'، 'g' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('a garden by') == {'b': 1, 'c': 0, 'd': 1, 'g': 1}`\nالجواب:", "qhash": "5aee2255c99746ac"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('نور', 48), ('خالد', 2), ('سلمى', 65), ('أحمد', 91)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('نور', 48), ('خالد', 2), ('سلمى', 65), ('أحمد', 91)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "5d7cd7aab00d1692", "answer": "[('خالد', 2), ('نور', 48), ('سلمى', 65), ('أحمد', 91)]\n['أحمد', 'سلمى']", "completion": " الناتج:\n```text\n[('خالد', 2), ('نور', 48), ('سلمى', 65), ('أحمد', 91)]\n['أحمد', 'سلمى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'engine'\nprint(word.upper())\nprint(word.find('g'))\nprint(word.index('g') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'engine'\nprint(word.upper())\nprint(word.find('g'))\nprint(word.index('g') + len(word))\n```\nالجواب:", "qhash": "16ce21ab1b30402e", "answer": "ENGINE\n2\n8", "completion": " الناتج:\n```text\nENGINE\n2\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x * -2 + 9 for x in range(-5, 7) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x * -2 + 9 for x in range(-5, 7) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "860dcf8f28b92f65", "answer": "[17, 13, 9, 5, 1, -3]\n6 42", "completion": " الناتج:\n```text\n[17, 13, 9, 5, 1, -3]\n6 42\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "biggest_mult", "reference": "def biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert biggest_mult([-10, -6, 15, -3]) == 15", "assert biggest_mult([-20, -25, -15]) == -15", "assert biggest_mult([1, 6]) == None", "assert biggest_mult([-29, 17, 7, 13, -17]) == None", "assert biggest_mult([41, 36, 24, -19, 2, 45, -5, -34]) == 45", "assert biggest_mult([]) == None"], "test_code": "assert biggest_mult([-10, -6, 15, -3]) == 15\nassert biggest_mult([-20, -25, -15]) == -15\nassert biggest_mult([1, 6]) == None\nassert biggest_mult([-29, 17, 7, 13, -17]) == None\nassert biggest_mult([41, 36, 24, -19, 2, 45, -5, -34]) == 45\nassert biggest_mult([]) == None", "answer": "def biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef biggest_mult(xs):\n    best = None\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def biggest_mult(xs):\n    best = 0\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef biggest_mult(xs):\n    best = 0\n    for x in xs:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `biggest_mult([-10, -6, 15, -3]) == 15`\nالجواب:", "qhash": "2cdeed6c2e813486"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([13, 90, 0, 89, 23, 79, 56, 66, 7, 70, 88]) == 1", "assert count_div([18, -20, 63, 6, 60]) == 0", "assert count_div([16]) == 1", "assert count_div([10, 70, 80, -6, -28, 59, 49, -27, -12]) == 1", "assert count_div([-13, 49, 42, 13, -7, 58, 89, 42, -1, 14, 64]) == 1", "assert count_div([-31]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([13, 90, 0, 89, 23, 79, 56, 66, 7, 70, 88]) == 1\nassert count_div([18, -20, 63, 6, 60]) == 0\nassert count_div([16]) == 1\nassert count_div([10, 70, 80, -6, -28, 59, 49, -27, -12]) == 1\nassert count_div([-13, 49, 42, 13, -7, 58, 89, 42, -1, 14, 64]) == 1\nassert count_div([-31]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 8 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 8 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([13, 90, 0, 89, 23, 79, 56, 66, 7, 70, 88]) == 1`\nالجواب:", "qhash": "58029b31f0a8bf0a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "tally", "reference": "def tally(s):\n    return {c: s.count(c) for c in 'am'}", "tests": ["assert tally('desert') == {'a': 0, 'm': 0}", "assert tally('vector an planet') == {'a': 2, 'm': 0}", "assert tally('garden coffee of garden') == {'a': 2, 'm': 0}", "assert tally('of an a go desert data') == {'a': 4, 'm': 0}", "assert tally('table data in it at it') == {'a': 4, 'm': 0}", "assert tally('data to summer summer cloud') == {'a': 2, 'm': 4}", "assert tally('') == {'a': 0, 'm': 0}"], "test_code": "assert tally('desert') == {'a': 0, 'm': 0}\nassert tally('vector an planet') == {'a': 2, 'm': 0}\nassert tally('garden coffee of garden') == {'a': 2, 'm': 0}\nassert tally('of an a go desert data') == {'a': 4, 'm': 0}\nassert tally('table data in it at it') == {'a': 4, 'm': 0}\nassert tally('data to summer summer cloud') == {'a': 2, 'm': 4}\nassert tally('') == {'a': 0, 'm': 0}", "answer": "def tally(s):\n    return {c: s.count(c) for c in 'am'}", "completion": " ```python\ndef tally(s):\n    return {c: s.count(c) for c in 'am'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `tally` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'a'، 'm' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `tally('desert') == {'a': 0, 'm': 0}`\nالجواب:", "qhash": "224de9c1e175f6f7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "decode", "reference": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert decode('up banana cloud A1') == 'xs edqdqd forxg A1'", "assert decode('planet camel to music !') == 'sodqhw fdpho wr pxvlf !'", "assert decode('banana it garden OK') == 'edqdqd lw jdughq OK'", "assert decode('signal on table A1') == 'vljqdo rq wdeoh A1'", "assert decode('of coffee') == 'ri friihh'", "assert decode('engine 2024') == 'hqjlqh 2024'", "assert decode('') == ''"], "test_code": "assert decode('up banana cloud A1') == 'xs edqdqd forxg A1'\nassert decode('planet camel to music !') == 'sodqhw fdpho wr pxvlf !'\nassert decode('banana it garden OK') == 'edqdqd lw jdughq OK'\nassert decode('signal on table A1') == 'vljqdo rq wdeoh A1'\nassert decode('of coffee') == 'ri friihh'\nassert decode('engine 2024') == 'hqjlqh 2024'\nassert decode('') == ''", "answer": "def decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef decode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `decode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `decode('up banana cloud A1') == 'xs edqdqd forxg A1'`\nالجواب:", "qhash": "9969c31eb56e38fc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 80687\ncount = 0\nwhile n > 20:\n    n = n // 4\n    count += 1\nprint(n, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 80687\ncount = 0\nwhile n > 20:\n    n = n // 4\n    count += 1\nprint(n, count)\n```\nالجواب:", "qhash": "5160c89e1f87a4c9", "answer": "19 6", "completion": " الناتج:\n```text\n19 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [35, 19, 10, 33, -1, 34]\nprint(items[1:4])\nprint(items[::3])\nprint(sum(items[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [35, 19, 10, 33, -1, 34]\nprint(items[1:4])\nprint(items[::3])\nprint(sum(items[1:4]))\n```\nالجواب:", "qhash": "f389ca18f62c3533", "answer": "[19, 10, 33]\n[35, 33]\n62", "completion": " الناتج:\n```text\n[19, 10, 33]\n[35, 33]\n62\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "turn_list", "reference": "def turn_list(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "tests": ["assert turn_list([34, 32, 7, 25]) == [34, 32, 7, 25]", "assert turn_list([45, 35, 44, 25, -8]) == [45, 35, 44, 25, -8]", "assert turn_list([12, 10, 49, 28, 30, 9]) == [30, 9, 12, 10, 49, 28]", "assert turn_list([44, 0, -4, -3, 50, -2, 21, 44, 42, 39]) == [44, 0, -4, -3, 50, -2, 21, 44, 42, 39]", "assert turn_list([5, 14, 39]) == [14, 39, 5]", "assert turn_list([-1, 0, 17, 22, 9, -2, 0, 25, -6, 26]) == [-1, 0, 17, 22, 9, -2, 0, 25, -6, 26]", "assert turn_list([]) == []"], "test_code": "assert turn_list([34, 32, 7, 25]) == [34, 32, 7, 25]\nassert turn_list([45, 35, 44, 25, -8]) == [45, 35, 44, 25, -8]\nassert turn_list([12, 10, 49, 28, 30, 9]) == [30, 9, 12, 10, 49, 28]\nassert turn_list([44, 0, -4, -3, 50, -2, 21, 44, 42, 39]) == [44, 0, -4, -3, 50, -2, 21, 44, 42, 39]\nassert turn_list([5, 14, 39]) == [14, 39, 5]\nassert turn_list([-1, 0, 17, 22, 9, -2, 0, 25, -6, 26]) == [-1, 0, 17, 22, 9, -2, 0, 25, -6, 26]\nassert turn_list([]) == []", "answer": "def turn_list(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]", "completion": " ```python\ndef turn_list(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return arr[len(arr) - k:] + arr[:len(arr) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef turn_list(arr):\n    if not arr:\n        return []\n    k = 20 % len(arr)\n    return ____\n```\nمثال: `turn_list([34, 32, 7, 25]) == [34, 32, 7, 25]`\nالجواب:", "qhash": "3b883815706d9e83"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def compute(x, y=3):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(compute(-7))\nprint(compute(-7, 8))\nprint(compute(compute(8), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef compute(x, y=3):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(compute(-7))\nprint(compute(-7, 8))\nprint(compute(compute(8), -7))\n```\nالجواب:", "qhash": "57406b92aa760700", "answer": "-4\n1\n12", "completion": " الناتج:\n```text\n-4\n1\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(29) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23', 'Ping', '25', '26', '27', 'Ping', '29']", "assert fizzbuzz(20) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong']", "assert fizzbuzz(7) == ['1', '2', '3', 'Ping', '5', '6', '7']", "assert fizzbuzz(4) == ['1', '2', '3', 'Ping']", "assert fizzbuzz(10) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong']"], "test_code": "assert fizzbuzz(29) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23', 'Ping', '25', '26', '27', 'Ping', '29']\nassert fizzbuzz(20) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong']\nassert fizzbuzz(7) == ['1', '2', '3', 'Ping', '5', '6', '7']\nassert fizzbuzz(4) == ['1', '2', '3', 'Ping']\nassert fizzbuzz(10) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 4 == 0:\n            s += 'Ping'\n        if i % 10 == 0:\n            s += 'Pong'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 4 تصبح 'Ping'، مضاعفات 10 تصبح 'Pong'، المضاعفات المشتركة تصبح 'PingPong'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(29) == ['1', '2', '3', 'Ping', '5', '6', '7', 'Ping', '9', 'Pong', '11', 'Ping', '13', '14', '15', 'Ping', '17', '18', '19', 'PingPong', '21', '22', '23', 'Ping', '25', '26', '27', 'Ping', '29']`\nالجواب:", "qhash": "702044c1e911cb5b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "running_sum", "reference": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert running_sum([77, 3, 75, 78, 28, 18, 88, 1, 27, 62]) == [77, 80, 155, 0, 28, 46, 134, 135, 162, 0]", "assert running_sum([49, -6, 50, 75, 81, 20, 159, 124, 61, 33]) == [49, 43, 93, 168, 0, 20, 179, 0, 61, 94]", "assert running_sum([82, 47, 108, 9, 102, -5, 169, 154, 166, 51]) == [82, 129, 0, 9, 111, 106, 0, 154, 0, 51]", "assert running_sum([68, 15, 112, 162]) == [68, 83, 0, 162]", "assert running_sum([178, 181, -9, 97]) == [178, 0, -9, 88]", "assert running_sum([99, 127, 91, 98, 155, -3]) == [99, 0, 91, 0, 155, 152]", "assert running_sum([]) == []"], "test_code": "assert running_sum([77, 3, 75, 78, 28, 18, 88, 1, 27, 62]) == [77, 80, 155, 0, 28, 46, 134, 135, 162, 0]\nassert running_sum([49, -6, 50, 75, 81, 20, 159, 124, 61, 33]) == [49, 43, 93, 168, 0, 20, 179, 0, 61, 94]\nassert running_sum([82, 47, 108, 9, 102, -5, 169, 154, 166, 51]) == [82, 129, 0, 9, 111, 106, 0, 154, 0, 51]\nassert running_sum([68, 15, 112, 162]) == [68, 83, 0, 162]\nassert running_sum([178, 181, -9, 97]) == [178, 0, -9, 88]\nassert running_sum([99, 127, 91, 98, 155, -3]) == [99, 0, 91, 0, 155, 152]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 188:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `running_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 188 (القيمة المسجلة حينها 0).\nمثال: `running_sum([77, 3, 75, 78, 28, 18, 88, 1, 27, 62]) == [77, 80, 155, 0, 28, 46, 134, 135, 162, 0]`\nالجواب:", "qhash": "1f75b12a55693c52"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'bdgt'}", "tests": ["assert char_freq('we cloud apple engine falcon') == {'b': 0, 'd': 1, 'g': 1, 't': 0}", "assert char_freq('an orange is at music up') == {'b': 0, 'd': 0, 'g': 1, 't': 1}", "assert char_freq('window matrix orange brain') == {'b': 1, 'd': 1, 'g': 1, 't': 1}", "assert char_freq('vector rocket a signal winter music') == {'b': 0, 'd': 0, 'g': 1, 't': 3}", "assert char_freq('summer to') == {'b': 0, 'd': 0, 'g': 0, 't': 1}", "assert char_freq('rocket a') == {'b': 0, 'd': 0, 'g': 0, 't': 1}", "assert char_freq('') == {'b': 0, 'd': 0, 'g': 0, 't': 0}"], "test_code": "assert char_freq('we cloud apple engine falcon') == {'b': 0, 'd': 1, 'g': 1, 't': 0}\nassert char_freq('an orange is at music up') == {'b': 0, 'd': 0, 'g': 1, 't': 1}\nassert char_freq('window matrix orange brain') == {'b': 1, 'd': 1, 'g': 1, 't': 1}\nassert char_freq('vector rocket a signal winter music') == {'b': 0, 'd': 0, 'g': 1, 't': 3}\nassert char_freq('summer to') == {'b': 0, 'd': 0, 'g': 0, 't': 1}\nassert char_freq('rocket a') == {'b': 0, 'd': 0, 'g': 0, 't': 1}\nassert char_freq('') == {'b': 0, 'd': 0, 'g': 0, 't': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'bdgt'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'bdgt'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 'd'، 'g'، 't' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('we cloud apple engine falcon') == {'b': 0, 'd': 1, 'g': 1, 't': 0}`\nالجواب:", "qhash": "969f3b3c299f6b5b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 1 for x in xs if -5 <= x <= 17)", "tests": ["assert between_times([8, 19, 3, -10, 2, 9, -9, -15, 17, -12]) == [2, 3, 8, 9, 17]", "assert between_times([12, 12, -6, 2, 6, -1, -16, 42, -20]) == [-1, 2, 6, 12, 12]", "assert between_times([42, -27, 40, 43, 48]) == []", "assert between_times([19, 50, -28, -2, 13, 36, 59, -7, -24]) == [-2, 13]", "assert between_times([]) == []", "assert between_times([-30, 6, 59]) == [6]", "assert between_times([27, 44, 2, 43, 42]) == [2]", "assert between_times([]) == []"], "test_code": "assert between_times([8, 19, 3, -10, 2, 9, -9, -15, 17, -12]) == [2, 3, 8, 9, 17]\nassert between_times([12, 12, -6, 2, 6, -1, -16, 42, -20]) == [-1, 2, 6, 12, 12]\nassert between_times([42, -27, 40, 43, 48]) == []\nassert between_times([19, 50, -28, -2, 13, 36, 59, -7, -24]) == [-2, 13]\nassert between_times([]) == []\nassert between_times([-30, 6, 59]) == [6]\nassert between_times([27, 44, 2, 43, 42]) == [2]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 1 for x in xs if -5 <= x <= 17)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 1 for x in xs if -5 <= x <= 17)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [-5, 17].\nمثال: `between_times([8, 19, 3, -10, 2, 9, -9, -15, 17, -12]) == [2, 3, 8, 9, 17]`\nالجواب:", "qhash": "8d67448335b569a2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total", "tests": ["assert series(8) == 2040", "assert series(14) == 10150", "assert series(2) == 50", "assert series(5) == 550", "assert series(9) == 2850", "assert series(1) == 10", "assert series(0) == 0"], "test_code": "assert series(8) == 2040\nassert series(14) == 10150\nassert series(2) == 50\nassert series(5) == 550\nassert series(9) == 2850\nassert series(1) == 10\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 10 * i ** 2\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 10 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 10 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 10 * i ** 2\n    return total\n```\nمثال: `series(8) == 2040`\nالجواب:", "qhash": "660cd7e45d1ced05"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(items):\n    if not items:\n        return []\n    k = 12 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([32, 21, 3]) == [32, 21, 3]", "assert shift_list([-5, 27]) == [-5, 27]", "assert shift_list([4, 48, 13, 13, 7, 27, 20, -8, 25, 18, 11]) == [11, 4, 48, 13, 13, 7, 27, 20, -8, 25, 18]", "assert shift_list([34, 27, 44]) == [34, 27, 44]", "assert shift_list([33, 44]) == [33, 44]", "assert shift_list([32, 4]) == [32, 4]", "assert shift_list([]) == []"], "test_code": "assert shift_list([32, 21, 3]) == [32, 21, 3]\nassert shift_list([-5, 27]) == [-5, 27]\nassert shift_list([4, 48, 13, 13, 7, 27, 20, -8, 25, 18, 11]) == [11, 4, 48, 13, 13, 7, 27, 20, -8, 25, 18]\nassert shift_list([34, 27, 44]) == [34, 27, 44]\nassert shift_list([33, 44]) == [33, 44]\nassert shift_list([32, 4]) == [32, 4]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n    if not items:\n        return []\n    k = 12 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 12 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 12 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 12 % len(items)\n    return ____\n```\nمثال: `shift_list([32, 21, 3]) == [32, 21, 3]`\nالجواب:", "qhash": "afb23b02fc9dd78e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('و'):\n            count += 1\n    return count", "tests": ["assert count_prefix('قهوة حاسوب حديقة ميناء') == 0", "assert count_prefix('قهوة سفينة فجر') == 0", "assert count_prefix('نور سماء حديقة نهار شجرة وردة وردة قمر') == 2", "assert count_prefix('قهوة وردة ماء قمر وردة') == 2", "assert count_prefix('وردة مكتبة عمل تفاحة دفتر') == 1", "assert count_prefix('معلم ماء بيت وردة') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('قهوة حاسوب حديقة ميناء') == 0\nassert count_prefix('قهوة سفينة فجر') == 0\nassert count_prefix('نور سماء حديقة نهار شجرة وردة وردة قمر') == 2\nassert count_prefix('قهوة وردة ماء قمر وردة') == 2\nassert count_prefix('وردة مكتبة عمل تفاحة دفتر') == 1\nassert count_prefix('معلم ماء بيت وردة') == 1\nassert count_prefix('') == 0", "answer": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('و'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('و'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(text):\n    count = 0\n    for w in text.split():\n        if 'و' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «و»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(text):\n    count = 0\n    for w in text.split():\n        if 'و' in w:\n            count += 1\n    return count\n```\nمثال: `count_prefix('قهوة حاسوب حديقة ميناء') == 0`\nالجواب:", "qhash": "52e7edcd2c5ecad1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 13", "tests": ["assert prod_mod(9) == 11", "assert prod_mod(39) == 0", "assert prod_mod(7) == 9", "assert prod_mod(36) == 0", "assert prod_mod(39) == 0", "assert prod_mod(50) == 0", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(9) == 11\nassert prod_mod(39) == 0\nassert prod_mod(7) == 9\nassert prod_mod(36) == 0\nassert prod_mod(39) == 0\nassert prod_mod(50) == 0\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 13", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 1)) % 13\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 13 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(9) == 11`\nالجواب:", "qhash": "1e63e937b039acf1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'معلم'\nprint(w[-1])\nprint(w[::-1])\nprint('م' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'معلم'\nprint(w[-1])\nprint(w[::-1])\nprint('م' in w)\n```\nالجواب:", "qhash": "435c4095f8103d75", "answer": "م\nملعم\nTrue", "completion": " الناتج:\n```text\nم\nملعم\nTrue\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "begin_count", "reference": "def begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "tests": ["assert begin_count('ليل برمجة نهار وردة تفاحة لغة معلم') == 1", "assert begin_count('بحر تفاحة نور بيت صديق') == 1", "assert begin_count('نور ميناء') == 0", "assert begin_count('دفتر قهوة تفاحة مطر بيت تفاحة حصان') == 2", "assert begin_count('حصان سماء خبز') == 0", "assert begin_count('تفاحة صحراء شمس بيت معلم مدرسة') == 1", "assert begin_count('') == 0"], "test_code": "assert begin_count('ليل برمجة نهار وردة تفاحة لغة معلم') == 1\nassert begin_count('بحر تفاحة نور بيت صديق') == 1\nassert begin_count('نور ميناء') == 0\nassert begin_count('دفتر قهوة تفاحة مطر بيت تفاحة حصان') == 2\nassert begin_count('حصان سماء خبز') == 0\nassert begin_count('تفاحة صحراء شمس بيت معلم مدرسة') == 1\nassert begin_count('') == 0", "answer": "def begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count", "completion": " ```python\ndef begin_count(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ت'):\n            count += 1\n    return count\n```\n", "buggy": "def begin_count(s):\n    count = 0\n    for w in s:\n        if w.startswith('ت'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ت»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef begin_count(s):\n    count = 0\n    for w in s:\n        if w.startswith('ت'):\n            count += 1\n    return count\n```\nمثال: `begin_count('ليل برمجة نهار وردة تفاحة لغة معلم') == 1`\nالجواب:", "qhash": "dd96d34e1976ad09"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=6):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(f(20))\nprint(f(20, -6))\nprint(f(f(-6), 20))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=6):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(f(20))\nprint(f(20, -6))\nprint(f(f(-6), 20))\n```\nالجواب:", "qhash": "783218854a30e89e", "answer": "-86\n-74\n-110", "completion": " الناتج:\n```text\n-86\n-74\n-110\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "tests": ["assert invert_words('to brain apple apple winter apple desert orange') == 'orange desert apple winter apple apple brain'", "assert invert_words('music') == 'music'", "assert invert_words('') == ''", "assert invert_words('summer by camel river winter is') == 'winter river camel summer'", "assert invert_words('') == ''", "assert invert_words('rocket table') == 'table rocket'", "assert invert_words('to camel up winter a') == 'winter camel'"], "test_code": "assert invert_words('to brain apple apple winter apple desert orange') == 'orange desert apple winter apple apple brain'\nassert invert_words('music') == 'music'\nassert invert_words('') == ''\nassert invert_words('summer by camel river winter is') == 'winter river camel summer'\nassert invert_words('') == ''\nassert invert_words('rocket table') == 'table rocket'\nassert invert_words('to camel up winter a') == 'winter camel'", "answer": "def invert_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])", "completion": " ```python\ndef invert_words(s):\n    return ' '.join([w for w in s.split() if len(w) >= 4][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 4 من آخرها إلى أولها، موصولة بالفاصل ' '.\nمثال: `invert_words('to brain apple apple winter apple desert orange') == 'orange desert apple winter apple apple brain'`\nالجواب:", "qhash": "b0cd8a2f8b652ed3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 208\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 208\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "c1de26e67bf4498b", "answer": "13", "completion": " الناتج:\n```text\n13\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "shift_list", "reference": "def shift_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert shift_list([27, 43, 44, 17, 4]) == [27, 43, 44, 17, 4]", "assert shift_list([34, 32, 33, 21, 50]) == [34, 32, 33, 21, 50]", "assert shift_list([39, 19, 20]) == [19, 20, 39]", "assert shift_list([36, -2, -4, 17]) == [17, 36, -2, -4]", "assert shift_list([2, 44, 28]) == [44, 28, 2]", "assert shift_list([29, 18, 34, -8]) == [-8, 29, 18, 34]", "assert shift_list([]) == []"], "test_code": "assert shift_list([27, 43, 44, 17, 4]) == [27, 43, 44, 17, 4]\nassert shift_list([34, 32, 33, 21, 50]) == [34, 32, 33, 21, 50]\nassert shift_list([39, 19, 20]) == [19, 20, 39]\nassert shift_list([36, -2, -4, 17]) == [17, 36, -2, -4]\nassert shift_list([2, 44, 28]) == [44, 28, 2]\nassert shift_list([29, 18, 34, -8]) == [-8, 29, 18, 34]\nassert shift_list([]) == []", "answer": "def shift_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef shift_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return ____\n```\nمثال: `shift_list([27, 43, 44, 17, 4]) == [27, 43, 44, 17, 4]`\nالجواب:", "qhash": "738ae231a7642b48"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 6", "tests": ["assert digit_score(61074) == 0", "assert digit_score(452735) == 2", "assert digit_score(217468) == 2", "assert digit_score(35564) == 3", "assert digit_score(419771) == 5", "assert digit_score(190631) == 2", "assert digit_score(450854) == 2", "assert digit_score(0) == 0"], "test_code": "assert digit_score(61074) == 0\nassert digit_score(452735) == 2\nassert digit_score(217468) == 2\nassert digit_score(35564) == 3\nassert digit_score(419771) == 5\nassert digit_score(190631) == 2\nassert digit_score(450854) == 2\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 6", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 6\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 6.\nمثال: `digit_score(61074) == 0`\nالجواب:", "qhash": "5b2289e14a47ad38"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_power", "reference": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 62", "tests": ["assert digit_power(28100) == 11", "assert digit_power(511809) == 24", "assert digit_power(221650) == 16", "assert digit_power(536790) == 30", "assert digit_power(63090) == 18", "assert digit_power(283579) == 34", "assert digit_power(166116) == 21", "assert digit_power(0) == 0"], "test_code": "assert digit_power(28100) == 11\nassert digit_power(511809) == 24\nassert digit_power(221650) == 16\nassert digit_power(536790) == 30\nassert digit_power(63090) == 18\nassert digit_power(283579) == 34\nassert digit_power(166116) == 21\nassert digit_power(0) == 0", "answer": "def digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 62", "completion": " ```python\ndef digit_power(n):\n    return sum(int(d) ** 1 for d in str(n)) % 62\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_power` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^1 لكل أرقام n) mod 62.\nمثال: `digit_power(28100) == 11`\nالجواب:", "qhash": "04e1d7fe1fa72639"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 47", "tests": ["assert fact_mod(5) == 15", "assert fact_mod(13) == 10", "assert fact_mod(53) == 0", "assert fact_mod(44) == 1", "assert fact_mod(21) == 41", "assert fact_mod(9) == 5", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(5) == 15\nassert fact_mod(13) == 10\nassert fact_mod(53) == 0\nassert fact_mod(44) == 1\nassert fact_mod(21) == 41\nassert fact_mod(9) == 5\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 47", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 2)) % 47\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 47 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(5) == 15`\nالجواب:", "qhash": "f2576c86333d386d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)", "tests": ["assert multiples_total(276) == 14945", "assert multiples_total(24) == 117", "assert multiples_total(12) == 29", "assert multiples_total(111) == 2405", "assert multiples_total(226) == 10167", "assert multiples_total(162) == 5118", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(276) == 14945\nassert multiples_total(24) == 117\nassert multiples_total(12) == 29\nassert multiples_total(111) == 2405\nassert multiples_total(226) == 10167\nassert multiples_total(162) == 5118\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 11 دون باقٍ.\nمثال: `multiples_total(276) == 14945`\nالجواب:", "qhash": "7309956577514c33"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'راشد': 18, 'رنا': 10, 'فيصل': 7}\nd['راشد'] += 3\nd['وليد'] = 27\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'راشد': 18, 'رنا': 10, 'فيصل': 7}\nd['راشد'] += 3\nd['وليد'] = 27\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "064db6f87e6b9512", "answer": "4\nوليد\n65\n[('فيصل', 7), ('رنا', 10)]", "completion": " الناتج:\n```text\n4\nوليد\n65\n[('فيصل', 7), ('رنا', 10)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [12, 4, 30, 36, 14, 35, 11]\nprint(items[2:4])\nprint(items[::-2])\nprint(max(items[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [12, 4, 30, 36, 14, 35, 11]\nprint(items[2:4])\nprint(items[::-2])\nprint(max(items[2:4]))\n```\nالجواب:", "qhash": "c969aa7b7c5b81db", "answer": "[30, 36]\n[11, 14, 30, 12]\n36", "completion": " الناتج:\n```text\n[30, 36]\n[11, 14, 30, 12]\n36\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "power_sum", "reference": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "tests": ["assert power_sum(3) == 196", "assert power_sum(3) == 196", "assert power_sum(14) == 255374", "assert power_sum(1) == 2", "assert power_sum(15) == 356624", "assert power_sum(1) == 2", "assert power_sum(0) == 0"], "test_code": "assert power_sum(3) == 196\nassert power_sum(3) == 196\nassert power_sum(14) == 255374\nassert power_sum(1) == 2\nassert power_sum(15) == 356624\nassert power_sum(1) == 2\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "completion": " ```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total\n```\n", "buggy": "def power_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 2 * i ** 4\n    return total\n```\nمثال: `power_sum(3) == 196`\nالجواب:", "qhash": "647b182d5e4a47ee"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 5 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(12) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo']", "assert label_numbers(15) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar']", "assert label_numbers(25) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar', '16', '17', 'Foo', '19', 'Bar', 'Foo', '22', '23', 'Foo', 'Bar']", "assert label_numbers(8) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8']", "assert label_numbers(8) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8']"], "test_code": "assert label_numbers(12) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo']\nassert label_numbers(15) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar']\nassert label_numbers(25) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo', '13', '14', 'FooBar', '16', '17', 'Foo', '19', 'Bar', 'Foo', '22', '23', 'Foo', 'Bar']\nassert label_numbers(8) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8']\nassert label_numbers(8) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 5 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Foo'\n        if i % 5 == 0:\n            s += 'Bar'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Foo'، مضاعفات 5 تصبح 'Bar'، المضاعفات المشتركة تصبح 'FooBar'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(12) == ['1', '2', 'Foo', '4', 'Bar', 'Foo', '7', '8', 'Foo', 'Bar', '11', 'Foo']`\nالجواب:", "qhash": "fd71a13ae82444cd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 64", "tests": ["assert sum_digit_pow(11702) == 51", "assert sum_digit_pow(780676) == 34", "assert sum_digit_pow(143415) == 4", "assert sum_digit_pow(2769) == 34", "assert sum_digit_pow(538807) == 35", "assert sum_digit_pow(338023) == 3", "assert sum_digit_pow(201500) == 2", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(11702) == 51\nassert sum_digit_pow(780676) == 34\nassert sum_digit_pow(143415) == 4\nassert sum_digit_pow(2769) == 34\nassert sum_digit_pow(538807) == 35\nassert sum_digit_pow(338023) == 3\nassert sum_digit_pow(201500) == 2\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 64", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 4 for d in str(n)) % 64\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 64.\nمثال: `sum_digit_pow(11702) == 51`\nالجواب:", "qhash": "78245a43a30f2859"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(12) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon']", "assert play(10) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun']", "assert play(10) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun']", "assert play(23) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22', '23']", "assert play(17) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17']"], "test_code": "assert play(12) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon']\nassert play(10) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun']\nassert play(10) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun']\nassert play(23) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17', 'Moon', '19', 'Sun', '21', '22', '23']\nassert play(17) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon', '13', '14', 'Sun', '16', '17']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Sun'، مضاعفات 6 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(12) == ['1', '2', '3', '4', 'Sun', 'Moon', '7', '8', '9', 'Sun', '11', 'Moon']`\nالجواب:", "qhash": "ee753f16012f3f86"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'data'\nprint(word.upper())\nprint(word[-1:])\nprint(word.replace('d', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'data'\nprint(word.upper())\nprint(word[-1:])\nprint(word.replace('d', '#'))\n```\nالجواب:", "qhash": "49957550b832abb0", "answer": "DATA\na\n#ata", "completion": " الناتج:\n```text\nDATA\na\n#ata\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "quad", "reference": "def quad(x):\n    return 5 * x ** 2 + (-1) * x + (8)", "tests": ["assert quad(5) == 128", "assert quad(0) == 8", "assert quad(20) == 1988", "assert quad(0) == 8", "assert quad(14) == 974", "assert quad(-1) == 14", "assert quad(10) == 498", "assert quad(0) == 8"], "test_code": "assert quad(5) == 128\nassert quad(0) == 8\nassert quad(20) == 1988\nassert quad(0) == 8\nassert quad(14) == 974\nassert quad(-1) == 14\nassert quad(10) == 498\nassert quad(0) == 8", "answer": "def quad(x):\n    return 5 * x ** 2 + (-1) * x + (8)", "completion": " ```python\ndef quad(x):\n    return 5 * x ** 2 + (-1) * x + (8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `quad` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 5x² - 1x + 8.\nمثال: `quad(5) == 128`\nالجواب:", "qhash": "0b93a492d33bb4d4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (11)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('music engine vector') == 'xfdtn pyrtyp gpnezc'", "assert shift_letters('engine by') == 'pyrtyp mj'", "assert shift_letters('up code') == 'fa nzop'", "assert shift_letters('up falcon summer Hello') == 'fa qlwnzy dfxxpc Hpwwz'", "assert shift_letters('winter table camel data 2024') == 'htyepc elmwp nlxpw olel 2024'", "assert shift_letters('music river') == 'xfdtn ctgpc'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('music engine vector') == 'xfdtn pyrtyp gpnezc'\nassert shift_letters('engine by') == 'pyrtyp mj'\nassert shift_letters('up code') == 'fa nzop'\nassert shift_letters('up falcon summer Hello') == 'fa qlwnzy dfxxpc Hpwwz'\nassert shift_letters('winter table camel data 2024') == 'htyepc elmwp nlxpw olel 2024'\nassert shift_letters('music river') == 'xfdtn ctgpc'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (11)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (11)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 11 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('music engine vector') == 'xfdtn pyrtyp gpnezc'`\nالجواب:", "qhash": "fc9379aaa4759316"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_div", "reference": "def max_div(nums):\n    best = None\n    for x in nums:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_div([53, 51, -26, -26, 14, 35, 31]) == 35", "assert max_div([-25, -5, -15]) == -5", "assert max_div([1, 6, 11]) == None", "assert max_div([1, -37, -3, 9, -11, -17]) == None", "assert max_div([49, 4, 32, -6, 0, -47, 33]) == 0", "assert max_div([]) == None"], "test_code": "assert max_div([53, 51, -26, -26, 14, 35, 31]) == 35\nassert max_div([-25, -5, -15]) == -5\nassert max_div([1, 6, 11]) == None\nassert max_div([1, -37, -3, 9, -11, -17]) == None\nassert max_div([49, 4, 32, -6, 0, -47, 33]) == 0\nassert max_div([]) == None", "answer": "def max_div(nums):\n    best = None\n    for x in nums:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_div(nums):\n    best = None\n    for x in nums:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_div(nums):\n    best = 0\n    for x in nums:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 5، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_div(nums):\n    best = 0\n    for x in nums:\n        if x % 5 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_div([53, 51, -26, -26, 14, 35, 31]) == 35`\nالجواب:", "qhash": "80d6ae9d64a65be3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89", "tests": ["assert step_product(10) == 13", "assert step_product(11) == 71", "assert step_product(36) == 61", "assert step_product(18) == 29", "assert step_product(56) == 61", "assert step_product(32) == 66", "assert step_product(0) == 1"], "test_code": "assert step_product(10) == 13\nassert step_product(11) == 71\nassert step_product(36) == 61\nassert step_product(18) == 29\nassert step_product(56) == 61\nassert step_product(32) == 66\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(10) == 13`\nالجواب:", "qhash": "546f241a4c0c83fc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'باسل': 47, 'علي': 0, 'زينب': 19, 'مريم': 47, 'راشد': 20}\nd['زينب'] += 3\nd['هدى'] = 55\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('يوسف', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'باسل': 47, 'علي': 0, 'زينب': 19, 'مريم': 47, 'راشد': 20}\nd['زينب'] += 3\nd['هدى'] = 55\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('يوسف', -1))\n```\nالجواب:", "qhash": "8433c7500e8bc8df", "answer": "6\nهدى\n191\n-1", "completion": " الناتج:\n```text\n6\nهدى\n191\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (24)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('to') == 'rm'", "assert encode('garden river OK') == 'eypbcl pgtcp OK'", "assert encode('cloud of cloud') == 'ajmsb md ajmsb'", "assert encode('of OK') == 'md OK'", "assert encode('go winter') == 'em uglrcp'", "assert encode('apple go planet it') == 'ynnjc em njylcr gr'", "assert encode('') == ''"], "test_code": "assert encode('to') == 'rm'\nassert encode('garden river OK') == 'eypbcl pgtcp OK'\nassert encode('cloud of cloud') == 'ajmsb md ajmsb'\nassert encode('of OK') == 'md OK'\nassert encode('go winter') == 'em uglrcp'\nassert encode('apple go planet it') == 'ynnjc em njylcr gr'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (24)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (24)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 24 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('to') == 'rm'`\nالجواب:", "qhash": "8d5d28bfab5ed761"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "cycle", "reference": "def cycle(items):\n    if not items:\n        return []\n    k = 2 % len(items)\n    return items[k:] + items[:k]", "tests": ["assert cycle([22, 33, 10, 37, 18, 9, 15]) == [10, 37, 18, 9, 15, 22, 33]", "assert cycle([35, -3, 46, 23, 35, 48]) == [46, 23, 35, 48, 35, -3]", "assert cycle([14, 35, 43, -1]) == [43, -1, 14, 35]", "assert cycle([40, 43, 46, 13, 4, 46, 0, 3, 41]) == [46, 13, 4, 46, 0, 3, 41, 40, 43]", "assert cycle([9, 24]) == [9, 24]", "assert cycle([11, 4, 44, 18, -4, 24, 22, 49, 42, 3]) == [44, 18, -4, 24, 22, 49, 42, 3, 11, 4]", "assert cycle([]) == []"], "test_code": "assert cycle([22, 33, 10, 37, 18, 9, 15]) == [10, 37, 18, 9, 15, 22, 33]\nassert cycle([35, -3, 46, 23, 35, 48]) == [46, 23, 35, 48, 35, -3]\nassert cycle([14, 35, 43, -1]) == [43, -1, 14, 35]\nassert cycle([40, 43, 46, 13, 4, 46, 0, 3, 41]) == [46, 13, 4, 46, 0, 3, 41, 40, 43]\nassert cycle([9, 24]) == [9, 24]\nassert cycle([11, 4, 44, 18, -4, 24, 22, 49, 42, 3]) == [44, 18, -4, 24, 22, 49, 42, 3, 11, 4]\nassert cycle([]) == []", "answer": "def cycle(items):\n    if not items:\n        return []\n    k = 2 % len(items)\n    return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n    if not items:\n        return []\n    k = 2 % len(items)\n    return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef cycle(items):\n    if not items:\n        return []\n    k = 2 % len(items)\n    return ____\n```\nمثال: `cycle([22, 33, 10, 37, 18, 9, 15]) == [10, 37, 18, 9, 15, 22, 33]`\nالجواب:", "qhash": "1652230b6d2d20af"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * -3 for x in xs if -12 <= x <= 9)", "tests": ["assert clip_scale([-7, -3, 13, -20, -19, -6, -1]) == [3, 9, 18, 21]", "assert clip_scale([17, -22, 19, 10]) == []", "assert clip_scale([]) == []", "assert clip_scale([-8, -26, 38, 53, -3, 49]) == [9, 24]", "assert clip_scale([29, 19, -27, 16, 19, 60, 10, 15, 51]) == []", "assert clip_scale([-17, -6, -1, 32, 10, 37, 24, -14]) == [3, 18]", "assert clip_scale([45, 27, 8, -3, 40, -23, -5, 8, 14, 59]) == [-24, -24, 9, 15]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-7, -3, 13, -20, -19, -6, -1]) == [3, 9, 18, 21]\nassert clip_scale([17, -22, 19, 10]) == []\nassert clip_scale([]) == []\nassert clip_scale([-8, -26, 38, 53, -3, 49]) == [9, 24]\nassert clip_scale([29, 19, -27, 16, 19, 60, 10, 15, 51]) == []\nassert clip_scale([-17, -6, -1, 32, 10, 37, 24, -14]) == [3, 18]\nassert clip_scale([45, 27, 8, -3, 40, -23, -5, 8, 14, 59]) == [-24, -24, 9, 15]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * -3 for x in xs if -12 <= x <= 9)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * -3 for x in xs if -12 <= x <= 9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -3 لكل عنصر x في المدى المغلق [-12, 9].\nمثال: `clip_scale([-7, -3, 13, -20, -19, -6, -1]) == [3, 9, 18, 21]`\nالجواب:", "qhash": "008063842ee859b4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'يوسف': 40, 'عمر': 5, 'مريم': 28, 'فيصل': 49, 'وليد': 43}\nd['عمر'] += 19\nd['باسل'] = 49\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 20])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'يوسف': 40, 'عمر': 5, 'مريم': 28, 'فيصل': 49, 'وليد': 43}\nd['عمر'] += 19\nd['باسل'] = 49\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint([k for k in d if d[k] > 20])\n```\nالجواب:", "qhash": "96e004a95765dda1", "answer": "6\nفيصل\n233\n['يوسف', 'عمر', 'مريم', 'فيصل', 'وليد', 'باسل']", "completion": " الناتج:\n```text\n6\nفيصل\n233\n['يوسف', 'عمر', 'مريم', 'فيصل', 'وليد', 'باسل']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "in_range_scaled", "reference": "def in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if -12 <= x <= 4)", "tests": ["assert in_range_scaled([-5, -16, -22, 0]) == [-10, 0]", "assert in_range_scaled([52, 35, 41, 14, 2, 9, 32, 41]) == [4]", "assert in_range_scaled([53]) == []", "assert in_range_scaled([14, 13, 25, 13, 48, 30, 56, -15, 11, 23]) == []", "assert in_range_scaled([]) == []", "assert in_range_scaled([-28]) == []", "assert in_range_scaled([56, 43, 16, 35, -9, -28, 48, 2]) == [-18, 4]", "assert in_range_scaled([]) == []"], "test_code": "assert in_range_scaled([-5, -16, -22, 0]) == [-10, 0]\nassert in_range_scaled([52, 35, 41, 14, 2, 9, 32, 41]) == [4]\nassert in_range_scaled([53]) == []\nassert in_range_scaled([14, 13, 25, 13, 48, 30, 56, -15, 11, 23]) == []\nassert in_range_scaled([]) == []\nassert in_range_scaled([-28]) == []\nassert in_range_scaled([56, 43, 16, 35, -9, -28, 48, 2]) == [-18, 4]\nassert in_range_scaled([]) == []", "answer": "def in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if -12 <= x <= 4)", "completion": " ```python\ndef in_range_scaled(xs):\n    return sorted(x * 2 for x in xs if -12 <= x <= 4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `in_range_scaled` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 2 لكل عنصر x في المدى المغلق [-12, 4].\nمثال: `in_range_scaled([-5, -16, -22, 0]) == [-10, 0]`\nالجواب:", "qhash": "dfa5624a62c41af6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 357\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 357\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "bfa6cd01210e01bc", "answer": "32", "completion": " الناتج:\n```text\n32\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_list", "reference": "def rotate_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[k:] + items[:k]", "tests": ["assert rotate_list([49, 10, 35, 41, 28, 24]) == [24, 49, 10, 35, 41, 28]", "assert rotate_list([11, -8, 11, 23, 2, 1, -9, 14]) == [1, -9, 14, 11, -8, 11, 23, 2]", "assert rotate_list([29, 24, 31, -6, 4, -3, 9, 13, 34, 42, 35]) == [-3, 9, 13, 34, 42, 35, 29, 24, 31, -6, 4]", "assert rotate_list([31, 43, -6]) == [-6, 31, 43]", "assert rotate_list([39, 23, -9, 6, 1, 50, 4, 33, 4]) == [50, 4, 33, 4, 39, 23, -9, 6, 1]", "assert rotate_list([46, -9]) == [-9, 46]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([49, 10, 35, 41, 28, 24]) == [24, 49, 10, 35, 41, 28]\nassert rotate_list([11, -8, 11, 23, 2, 1, -9, 14]) == [1, -9, 14, 11, -8, 11, 23, 2]\nassert rotate_list([29, 24, 31, -6, 4, -3, 9, 13, 34, 42, 35]) == [-3, 9, 13, 34, 42, 35, 29, 24, 31, -6, 4]\nassert rotate_list([31, 43, -6]) == [-6, 31, 43]\nassert rotate_list([39, 23, -9, 6, 1, 50, 4, 33, 4]) == [50, 4, 33, 4, 39, 23, -9, 6, 1]\nassert rotate_list([46, -9]) == [-9, 46]\nassert rotate_list([]) == []", "answer": "def rotate_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[k:] + items[:k]", "completion": " ```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 5 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 5 % len(items)\n    return ____\n```\nمثال: `rotate_list([49, 10, 35, 41, 28, 24]) == [24, 49, 10, 35, 41, 28]`\nالجواب:", "qhash": "8bb36a19fa6e8770"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(6, 3))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n, k):\n    if k == 0:\n        return 1\n    return n * calc(n, k - 1)\n\nprint(calc(6, 3))\n```\nالجواب:", "qhash": "bbf327c318a4b004", "answer": "216", "completion": " الناتج:\n```text\n216\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def calc(x, y=3):\n    if x > y:\n        return x * 5 - y\n    return x + y * 5\n\nprint(calc(-8))\nprint(calc(-8, 15))\nprint(calc(calc(15), -8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(x, y=3):\n    if x > y:\n        return x * 5 - y\n    return x + y * 5\n\nprint(calc(-8))\nprint(calc(-8, 15))\nprint(calc(calc(15), -8))\n```\nالجواب:", "qhash": "b1e55805b3dbedad", "answer": "7\n67\n368", "completion": " الناتج:\n```text\n7\n67\n368\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [34, 30, 17, -7, -4, 36]\nprint(items[1:3])\nprint(items[::-1])\nprint(min(items[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [34, 30, 17, -7, -4, 36]\nprint(items[1:3])\nprint(items[::-1])\nprint(min(items[1:3]))\n```\nالجواب:", "qhash": "30405cec3b93c63e", "answer": "[30, 17]\n[36, -4, -7, 17, 30, 34]\n17", "completion": " الناتج:\n```text\n[30, 17]\n[36, -4, -7, 17, 30, 34]\n17\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total", "tests": ["assert weighted_sum(4) == 210", "assert weighted_sum(1) == 7", "assert weighted_sum(10) == 2695", "assert weighted_sum(10) == 2695", "assert weighted_sum(8) == 1428", "assert weighted_sum(1) == 7", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(4) == 210\nassert weighted_sum(1) == 7\nassert weighted_sum(10) == 2695\nassert weighted_sum(10) == 2695\nassert weighted_sum(8) == 1428\nassert weighted_sum(1) == 7\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total", "completion": " ```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 2\n    return total\n```\n", "buggy": "def weighted_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 7 * i ** 2\n    return total\n```\nمثال: `weighted_sum(4) == 210`\nالجواب:", "qhash": "0a3f8e664cf4fa35"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 77", "tests": ["assert dig_pow_mod(71605) == 34", "assert dig_pow_mod(604713) == 34", "assert dig_pow_mod(918668) == 51", "assert dig_pow_mod(232094) == 37", "assert dig_pow_mod(860923) == 40", "assert dig_pow_mod(430714) == 14", "assert dig_pow_mod(356585) == 30", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(71605) == 34\nassert dig_pow_mod(604713) == 34\nassert dig_pow_mod(918668) == 51\nassert dig_pow_mod(232094) == 37\nassert dig_pow_mod(860923) == 40\nassert dig_pow_mod(430714) == 14\nassert dig_pow_mod(356585) == 30\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 77", "completion": " ```python\ndef dig_pow_mod(n):\n    return sum(int(d) ** 2 for d in str(n)) % 77\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `dig_pow_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 77.\nمثال: `dig_pow_mod(71605) == 34`\nالجواب:", "qhash": "500b50eef3589b90"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_div", "reference": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "tests": ["assert sum_div(236) == 9244", "assert sum_div(256) == 10710", "assert sum_div(187) == 5860", "assert sum_div(9) == 18", "assert sum_div(173) == 4960", "assert sum_div(74) == 900", "assert sum_div(1) == 0"], "test_code": "assert sum_div(236) == 9244\nassert sum_div(256) == 10710\nassert sum_div(187) == 5860\nassert sum_div(9) == 18\nassert sum_div(173) == 4960\nassert sum_div(74) == 900\nassert sum_div(1) == 0", "answer": "def sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)", "completion": " ```python\ndef sum_div(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 6 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_div` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 4 أو 6 دون باقٍ.\nمثال: `sum_div(236) == 9244`\nالجواب:", "qhash": "779471b813c35e04"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 2\nfor i in range(-4, 9, 2):\n    acc -= i * 7\nprint(acc)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 2\nfor i in range(-4, 9, 2):\n    acc -= i * 7\nprint(acc)\nprint(i)\n```\nالجواب:", "qhash": "031bed372354a982", "answer": "-96\n8", "completion": " الناتج:\n```text\n-96\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return 5 * x ** 2 + (-8) * x + (-3)", "tests": ["assert poly(2) == 1", "assert poly(8) == 253", "assert poly(-6) == 225", "assert poly(8) == 253", "assert poly(-14) == 1089", "assert poly(-19) == 1954", "assert poly(13) == 738", "assert poly(0) == -3"], "test_code": "assert poly(2) == 1\nassert poly(8) == 253\nassert poly(-6) == 225\nassert poly(8) == 253\nassert poly(-14) == 1089\nassert poly(-19) == 1954\nassert poly(13) == 738\nassert poly(0) == -3", "answer": "def poly(x):\n    return 5 * x ** 2 + (-8) * x + (-3)", "completion": " ```python\ndef poly(x):\n    return 5 * x ** 2 + (-8) * x + (-3)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 5x² - 8x - 3.\nمثال: `poly(2) == 1`\nالجواب:", "qhash": "b3a873c8fe330791"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "tests": ["assert multiples_total(125) == 2184", "assert multiples_total(13) == 24", "assert multiples_total(264) == 10130", "assert multiples_total(149) == 3129", "assert multiples_total(216) == 6764", "assert multiples_total(209) == 6339", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(125) == 2184\nassert multiples_total(13) == 24\nassert multiples_total(264) == 10130\nassert multiples_total(149) == 3129\nassert multiples_total(216) == 6764\nassert multiples_total(209) == 6339\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 9 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 5 أو 9 دون باقٍ.\nمثال: `multiples_total(125) == 2184`\nالجواب:", "qhash": "a11e056afb188330"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['river', 'window', 'rocket', 'garden', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['river', 'window', 'rocket', 'garden', 'winter']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "3b2258ba94bec0cc", "answer": "['river', 'window', 'rocket', 'garden', 'winter']\n['winter', 'window', 'rocket']", "completion": " الناتج:\n```text\n['river', 'window', 'rocket', 'garden', 'winter']\n['winter', 'window', 'rocket']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [25, 19, -6, -4, 8, -6, 6]\nprint(a[3:4])\nprint(a[::3])\nprint(sum(a[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [25, 19, -6, -4, 8, -6, 6]\nprint(a[3:4])\nprint(a[::3])\nprint(sum(a[3:4]))\n```\nالجواب:", "qhash": "5d0476e39347e67c", "answer": "[-4]\n[25, -4, 6]\n-4", "completion": " الناتج:\n```text\n[-4]\n[25, -4, 6]\n-4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "backwards", "reference": "def backwards(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert backwards('garden banana of python brain apple python') == 'python apple brain python of banana garden'", "assert backwards('') == ''", "assert backwards('on cloud vector is light river is') == 'is river light is vector cloud on'", "assert backwards('orange cloud') == 'cloud orange'", "assert backwards('') == ''", "assert backwards('stone brain we apple up on summer') == 'summer on up apple we brain stone'", "assert backwards('') == ''"], "test_code": "assert backwards('garden banana of python brain apple python') == 'python apple brain python of banana garden'\nassert backwards('') == ''\nassert backwards('on cloud vector is light river is') == 'is river light is vector cloud on'\nassert backwards('orange cloud') == 'cloud orange'\nassert backwards('') == ''\nassert backwards('stone brain we apple up on summer') == 'summer on up apple we brain stone'\nassert backwards('') == ''", "answer": "def backwards(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef backwards(s):\n    return ' '.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `backwards` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل ' '.\nمثال: `backwards('garden banana of python brain apple python') == 'python apple brain python of banana garden'`\nالجواب:", "qhash": "6f78d2ffab0b238a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "starts_count", "reference": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count", "tests": ["assert starts_count('يمل عربية ليل جبل سفينة نهار يمل') == 2", "assert starts_count('يمل حاسوب شجرة شجرة يمل') == 2", "assert starts_count('يمل يمل سلام ليل') == 2", "assert starts_count('مدرسة مدينة طالب نور كتاب وردة') == 0", "assert starts_count('يمل تفاحة رمل يمل') == 2", "assert starts_count('يمل معلم ماء يمل') == 2", "assert starts_count('') == 0"], "test_code": "assert starts_count('يمل عربية ليل جبل سفينة نهار يمل') == 2\nassert starts_count('يمل حاسوب شجرة شجرة يمل') == 2\nassert starts_count('يمل يمل سلام ليل') == 2\nassert starts_count('مدرسة مدينة طالب نور كتاب وردة') == 0\nassert starts_count('يمل تفاحة رمل يمل') == 2\nassert starts_count('يمل معلم ماء يمل') == 2\nassert starts_count('') == 0", "answer": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count", "completion": " ```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ي'):\n            count += 1\n    return count\n```\n", "buggy": "def starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ي' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ي»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef starts_count(text):\n    count = 0\n    for w in text.split():\n        if 'ي' in w:\n            count += 1\n    return count\n```\nمثال: `starts_count('يمل عربية ليل جبل سفينة نهار يمل') == 2`\nالجواب:", "qhash": "55c1421af8509bbf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(103123360))\nprint(go(go(103123360)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n):\n    if n < 10:\n        return n\n    return n % 10 + go(n // 10)\n\nprint(go(103123360))\nprint(go(go(103123360)))\n```\nالجواب:", "qhash": "8cf51cf085255ab3", "answer": "19\n10", "completion": " الناتج:\n```text\n19\n10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 1009", "tests": ["assert mfact(6) == 12", "assert mfact(40) == 227", "assert mfact(31) == 829", "assert mfact(24) == 822", "assert mfact(39) == 496", "assert mfact(26) == 1002", "assert mfact(0) == 1"], "test_code": "assert mfact(6) == 12\nassert mfact(40) == 227\nassert mfact(31) == 829\nassert mfact(24) == 822\nassert mfact(39) == 496\nassert mfact(26) == 1002\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 1009", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(6) == 12`\nالجواب:", "qhash": "61f25c5e5435ebc5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=9):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(g(0))\nprint(g(0, -6))\nprint(g(g(-6), 0))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=9):\n    if x > y:\n        return x * 0 - y\n    return x + y * 0\n\nprint(g(0))\nprint(g(0, -6))\nprint(g(g(-6), 0))\n```\nالجواب:", "qhash": "db420f52e83bfdd6", "answer": "0\n6\n-6", "completion": " الناتج:\n```text\n0\n6\n-6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'وليد': 38, 'خالد': 37, 'عمر': 22, 'حسن': 3, 'هدى': 37}\nmarks['حسن'] += 13\nmarks['نور'] = 24\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 26])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'وليد': 38, 'خالد': 37, 'عمر': 22, 'حسن': 3, 'هدى': 37}\nmarks['حسن'] += 13\nmarks['نور'] = 24\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 26])\n```\nالجواب:", "qhash": "0479d78661210ee1", "answer": "6\nوليد\n174\n['وليد', 'خالد', 'هدى']", "completion": " الناتج:\n```text\n6\nوليد\n174\n['وليد', 'خالد', 'هدى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_in_text", "reference": "def count_in_text(text):\n    return text.count('س')", "tests": ["assert count_in_text('باب معلم بحر رمل') == 0", "assert count_in_text('باب') == 0", "assert count_in_text('مكتبة جمل قهوة حاسوب بحر') == 1", "assert count_in_text('عربية حديقة جبل طائرة قهوة برتقال تفاحة') == 0", "assert count_in_text('سماء') == 1", "assert count_in_text('عربية') == 0", "assert count_in_text('برتقال نهار') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('باب معلم بحر رمل') == 0\nassert count_in_text('باب') == 0\nassert count_in_text('مكتبة جمل قهوة حاسوب بحر') == 1\nassert count_in_text('عربية حديقة جبل طائرة قهوة برتقال تفاحة') == 0\nassert count_in_text('سماء') == 1\nassert count_in_text('عربية') == 0\nassert count_in_text('برتقال نهار') == 0\nassert count_in_text('') == 0", "answer": "def count_in_text(text):\n    return text.count('س')", "completion": " ```python\ndef count_in_text(text):\n    return text.count('س')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_in_text` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «س» في النص.\nمثال: `count_in_text('باب معلم بحر رمل') == 0`\nالجواب:", "qhash": "c992fecd23592350"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n):\n    if n < 10:\n        return n\n    return n % 10 + calc(n // 10)\n\nprint(calc(114596064))\nprint(calc(calc(114596064)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n):\n    if n < 10:\n        return n\n    return n % 10 + calc(n // 10)\n\nprint(calc(114596064))\nprint(calc(calc(114596064)))\n```\nالجواب:", "qhash": "9343e4a4c80fee54", "answer": "36\n9", "completion": " الناتج:\n```text\n36\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "div_not", "reference": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count", "tests": ["assert div_not([75, 51, 69, 55, 35, 49, 72, 42]) == 1", "assert div_not([-5, 63, 29, 39]) == 0", "assert div_not([63, 11, 5, -11, -10, 16, 60, 68, -20]) == 2", "assert div_not([38, -33, 87, 80, 82, 62, 23, 62, 37, 36, -20, 43]) == 1", "assert div_not([83, 34, 39, -28, 72, 44, 38, 70, -17, 59, 81, 6]) == 3", "assert div_not([15, 37, 17, 72, -33, 73, -18, 90, 82, -34]) == 1", "assert div_not([]) == 0"], "test_code": "assert div_not([75, 51, 69, 55, 35, 49, 72, 42]) == 1\nassert div_not([-5, 63, 29, 39]) == 0\nassert div_not([63, 11, 5, -11, -10, 16, 60, 68, -20]) == 2\nassert div_not([38, -33, 87, 80, 82, 62, 23, 62, 37, 36, -20, 43]) == 1\nassert div_not([83, 34, 39, -28, 72, 44, 38, 70, -17, 59, 81, 6]) == 3\nassert div_not([15, 37, 17, 72, -33, 73, -18, 90, 82, -34]) == 1\nassert div_not([]) == 0", "answer": "def div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 5 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 5. اكتب الحل كاملًا.\n```python\ndef div_not(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `div_not([75, 51, 69, 55, 35, 49, 72, 42]) == 1`\nالجواب:", "qhash": "1a1b1cb748a6751e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "eval_poly", "reference": "def eval_poly(x):\n    return 7 * x ** 2 + (-1) * x + (-6)", "tests": ["assert eval_poly(2) == 20", "assert eval_poly(-12) == 1014", "assert eval_poly(9) == 552", "assert eval_poly(-13) == 1190", "assert eval_poly(0) == -6", "assert eval_poly(15) == 1554", "assert eval_poly(-20) == 2814", "assert eval_poly(0) == -6"], "test_code": "assert eval_poly(2) == 20\nassert eval_poly(-12) == 1014\nassert eval_poly(9) == 552\nassert eval_poly(-13) == 1190\nassert eval_poly(0) == -6\nassert eval_poly(15) == 1554\nassert eval_poly(-20) == 2814\nassert eval_poly(0) == -6", "answer": "def eval_poly(x):\n    return 7 * x ** 2 + (-1) * x + (-6)", "completion": " ```python\ndef eval_poly(x):\n    return 7 * x ** 2 + (-1) * x + (-6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `eval_poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 7x² - 1x - 6.\nمثال: `eval_poly(2) == 20`\nالجواب:", "qhash": "b2dd25c4afb28421"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_hits", "reference": "def letter_hits(text):\n    return text.count('ن')", "tests": ["assert letter_hits('مدينة سماء حديقة') == 1", "assert letter_hits('رمل علم معلم لغة دفتر') == 0", "assert letter_hits('مدينة حاسوب صحراء طائرة') == 1", "assert letter_hits('نهار') == 1", "assert letter_hits('تفاحة جبل طائرة') == 0", "assert letter_hits('') == 0", "assert letter_hits('سيارة بيت مدرسة بيت ميناء') == 1", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('مدينة سماء حديقة') == 1\nassert letter_hits('رمل علم معلم لغة دفتر') == 0\nassert letter_hits('مدينة حاسوب صحراء طائرة') == 1\nassert letter_hits('نهار') == 1\nassert letter_hits('تفاحة جبل طائرة') == 0\nassert letter_hits('') == 0\nassert letter_hits('سيارة بيت مدرسة بيت ميناء') == 1\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n    return text.count('ن')", "completion": " ```python\ndef letter_hits(text):\n    return text.count('ن')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ن» في النص.\nمثال: `letter_hits('مدينة سماء حديقة') == 1`\nالجواب:", "qhash": "a362cfa7f7e22ebd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_of_div", "reference": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 10 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_of_div([24, -8, -3, -7, -13, -16, -11, 7]) == None", "assert max_of_div([-10, -20, -20]) == -10", "assert max_of_div([1, 11, 21]) == None", "assert max_of_div([-35, -36]) == None", "assert max_of_div([-3, 48, 32, -18]) == None", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([24, -8, -3, -7, -13, -16, -11, 7]) == None\nassert max_of_div([-10, -20, -20]) == -10\nassert max_of_div([1, 11, 21]) == None\nassert max_of_div([-35, -36]) == None\nassert max_of_div([-3, 48, 32, -18]) == None\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 10 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 10 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_of_div(values):\n    best = 0\n    for x in values:\n        if x % 10 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 10، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_of_div(values):\n    best = 0\n    for x in values:\n        if x % 10 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_of_div([24, -8, -3, -7, -13, -16, -11, 7]) == None`\nالجواب:", "qhash": "3a10fb786fa6a2fd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "game", "reference": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert game(15) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun']", "assert game(13) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13']", "assert game(15) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun']", "assert game(4) == ['1', '2', 'Sun', '4']", "assert game(3) == ['1', '2', 'Sun']"], "test_code": "assert game(15) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun']\nassert game(13) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13']\nassert game(15) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun']\nassert game(4) == ['1', '2', 'Sun', '4']\nassert game(3) == ['1', '2', 'Sun']", "answer": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `game` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Sun'، مضاعفات 9 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `game(15) == ['1', '2', 'Sun', '4', '5', 'Sun', '7', '8', 'SunMoon', '10', '11', 'Sun', '13', '14', 'Sun']`\nالجواب:", "qhash": "a83aa348458ac5ec"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 3245\ncount = 0\nwhile x > 3:\n    x = x // 2\n    count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 3245\ncount = 0\nwhile x > 3:\n    x = x // 2\n    count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "1e1baaa6dbcda6de", "answer": "3 10", "completion": " الناتج:\n```text\n3 10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_list", "reference": "def rotate_list(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert rotate_list([32, 7, 15, 46]) == [32, 7, 15, 46]", "assert rotate_list([23, 42, -1, 19, 44, 48]) == [44, 48, 23, 42, -1, 19]", "assert rotate_list([33, 26, 23]) == [26, 23, 33]", "assert rotate_list([19, 42]) == [19, 42]", "assert rotate_list([21, -9, 3, 48, 31, 40, 24, 11, -7, 26]) == [3, 48, 31, 40, 24, 11, -7, 26, 21, -9]", "assert rotate_list([26, 41]) == [26, 41]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([32, 7, 15, 46]) == [32, 7, 15, 46]\nassert rotate_list([23, 42, -1, 19, 44, 48]) == [44, 48, 23, 42, -1, 19]\nassert rotate_list([33, 26, 23]) == [26, 23, 33]\nassert rotate_list([19, 42]) == [19, 42]\nassert rotate_list([21, -9, 3, 48, 31, 40, 24, 11, -7, 26]) == [3, 48, 31, 40, 24, 11, -7, 26, 21, -9]\nassert rotate_list([26, 41]) == [26, 41]\nassert rotate_list([]) == []", "answer": "def rotate_list(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_list(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return ____\n```\nمثال: `rotate_list([32, 7, 15, 46]) == [32, 7, 15, 46]`\nالجواب:", "qhash": "ec0c7f48898a780c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if -4 <= x <= 14)", "tests": ["assert pick_between([18, 3, 5, -10, -14]) == [12, 20]", "assert pick_between([]) == []", "assert pick_between([]) == []", "assert pick_between([-11, 5, 60, -3, 48, 20, 59, 41, 43, -9]) == [-12, 20]", "assert pick_between([]) == []", "assert pick_between([30, 47, 51, 17, 10, -17, 43, 58, -12, -19]) == [40]", "assert pick_between([50, 27, 55, 8, 37, 52, -13]) == [32]", "assert pick_between([]) == []"], "test_code": "assert pick_between([18, 3, 5, -10, -14]) == [12, 20]\nassert pick_between([]) == []\nassert pick_between([]) == []\nassert pick_between([-11, 5, 60, -3, 48, 20, 59, 41, 43, -9]) == [-12, 20]\nassert pick_between([]) == []\nassert pick_between([30, 47, 51, 17, 10, -17, 43, 58, -12, -19]) == [40]\nassert pick_between([50, 27, 55, 8, 37, 52, -13]) == [32]\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if -4 <= x <= 14)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * 4 for x in xs if -4 <= x <= 14)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 4 لكل عنصر x في المدى المغلق [-4, 14].\nمثال: `pick_between([18, 3, 5, -10, -14]) == [12, 20]`\nالجواب:", "qhash": "9e23ebf5c83cbd72"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 18 <= x <= 55)", "tests": ["assert between_times([36, 40, 9, 38, 48]) == [36, 38, 40, 48]", "assert between_times([-29, 14, 15]) == []", "assert between_times([35, 4, -15, 5, 49, -5, -7, 56, 24]) == [24, 35, 49]", "assert between_times([39, 19, 8, 16, 12]) == [19, 39]", "assert between_times([-2, -8, 59, 55, -13, 42, 38]) == [38, 42, 55]", "assert between_times([40, -9, 60, -30, 34, -21, 30, 35, 37, 1]) == [30, 34, 35, 37, 40]", "assert between_times([50, -1, 2, 59, -12, -25]) == [50]", "assert between_times([]) == []"], "test_code": "assert between_times([36, 40, 9, 38, 48]) == [36, 38, 40, 48]\nassert between_times([-29, 14, 15]) == []\nassert between_times([35, 4, -15, 5, 49, -5, -7, 56, 24]) == [24, 35, 49]\nassert between_times([39, 19, 8, 16, 12]) == [19, 39]\nassert between_times([-2, -8, 59, 55, -13, 42, 38]) == [38, 42, 55]\nassert between_times([40, -9, 60, -30, 34, -21, 30, 35, 37, 1]) == [30, 34, 35, 37, 40]\nassert between_times([50, -1, 2, 59, -12, -25]) == [50]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 1 for x in xs if 18 <= x <= 55)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 1 for x in xs if 18 <= x <= 55)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [18, 55].\nمثال: `between_times([36, 40, 9, 38, 48]) == [36, 38, 40, 48]`\nالجواب:", "qhash": "8b1b3ae27dd97ed7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "cipher", "reference": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert cipher('winter A1') == 'tfkqbo A1'", "assert cipher('up A1') == 'rm A1'", "assert cipher('music orange') == 'jrpfz loxkdb'", "assert cipher('pixel it apple 2024') == 'mfubi fq xmmib 2024'", "assert cipher('garden we desert is to') == 'dxoabk tb abpboq fp ql'", "assert cipher('it on') == 'fq lk'", "assert cipher('') == ''"], "test_code": "assert cipher('winter A1') == 'tfkqbo A1'\nassert cipher('up A1') == 'rm A1'\nassert cipher('music orange') == 'jrpfz loxkdb'\nassert cipher('pixel it apple 2024') == 'mfubi fq xmmib 2024'\nassert cipher('garden we desert is to') == 'dxoabk tb abpboq fp ql'\nassert cipher('it on') == 'fq lk'\nassert cipher('') == ''", "answer": "def cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef cipher(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `cipher` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `cipher('winter A1') == 'tfkqbo A1'`\nالجواب:", "qhash": "638a4ecc272fff94"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'فيصل': 21, 'خالد': 17, 'نور': 8, 'علي': 43, 'رنا': 44}\nscores['رنا'] += 4\nscores['منى'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 32])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'فيصل': 21, 'خالد': 17, 'نور': 8, 'علي': 43, 'رنا': 44}\nscores['رنا'] += 4\nscores['منى'] = 60\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 32])\n```\nالجواب:", "qhash": "3e2d7439dc1a7843", "answer": "6\nمنى\n197\n['علي', 'رنا', 'منى']", "completion": " الناتج:\n```text\n6\nمنى\n197\n['علي', 'رنا', 'منى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_start", "reference": "def count_start(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ر'):\n            count += 1\n    return count", "tests": ["assert count_start('طالب سوق') == 0", "assert count_start('قهوة مدينة رمل دفتر طائرة وردة رمل') == 2", "assert count_start('سوق خبز رمل تفاحة شجرة دفتر قمر') == 1", "assert count_start('بحر رمل وردة رمل صحراء') == 2", "assert count_start('مكتبة مدينة حديقة رمل') == 1", "assert count_start('ليل شمس كتاب حديقة قهوة نهار') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('طالب سوق') == 0\nassert count_start('قهوة مدينة رمل دفتر طائرة وردة رمل') == 2\nassert count_start('سوق خبز رمل تفاحة شجرة دفتر قمر') == 1\nassert count_start('بحر رمل وردة رمل صحراء') == 2\nassert count_start('مكتبة مدينة حديقة رمل') == 1\nassert count_start('ليل شمس كتاب حديقة قهوة نهار') == 0\nassert count_start('') == 0", "answer": "def count_start(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ر'):\n            count += 1\n    return count", "completion": " ```python\ndef count_start(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ر'):\n            count += 1\n    return count\n```\n", "buggy": "def count_start(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('ر'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ر»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_start(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('ر'):\n            count += 1\n    return count\n```\nمثال: `count_start('طالب سوق') == 0`\nالجواب:", "qhash": "405777524594410a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([20, 28, 55, -12, 31, -9]) == 28", "assert max_multiple([-12, -20, -4]) == -4", "assert max_multiple([1]) == None", "assert max_multiple([19, -34, -31]) == None", "assert max_multiple([34, 2, -15, -32, -21, -48, -9, -43]) == -32", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([20, 28, 55, -12, 31, -9]) == 28\nassert max_multiple([-12, -20, -4]) == -4\nassert max_multiple([1]) == None\nassert max_multiple([19, -34, -31]) == None\nassert max_multiple([34, 2, -15, -32, -21, -48, -9, -43]) == -32\nassert max_multiple([]) == None", "answer": "def max_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(arr):\n    best = None\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(arr):\n    best = 0\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(arr):\n    best = 0\n    for x in arr:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([20, 28, 55, -12, 31, -9]) == 28`\nالجواب:", "qhash": "b4405c561247d4ec"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_letter", "reference": "def count_letter(text):\n    return sum(1 for w in text.split() if 'ا' in w)", "tests": ["assert count_letter('ماء علم علم') == 1", "assert count_letter('مدرسة وردة') == 0", "assert count_letter('تفاحة صديق باب سلام باب') == 4", "assert count_letter('قهوة بحر شجرة سيارة حديقة تفاحة') == 2", "assert count_letter('مدينة صحراء وردة علم معلم') == 1", "assert count_letter('سماء وردة بحر سلام سلام نور ماء سوق') == 4", "assert count_letter('معلم معلم برتقال حاسوب') == 2", "assert count_letter('') == 0"], "test_code": "assert count_letter('ماء علم علم') == 1\nassert count_letter('مدرسة وردة') == 0\nassert count_letter('تفاحة صديق باب سلام باب') == 4\nassert count_letter('قهوة بحر شجرة سيارة حديقة تفاحة') == 2\nassert count_letter('مدينة صحراء وردة علم معلم') == 1\nassert count_letter('سماء وردة بحر سلام سلام نور ماء سوق') == 4\nassert count_letter('معلم معلم برتقال حاسوب') == 2\nassert count_letter('') == 0", "answer": "def count_letter(text):\n    return sum(1 for w in text.split() if 'ا' in w)", "completion": " ```python\ndef count_letter(text):\n    return sum(1 for w in text.split() if 'ا' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ا» مرة واحدة على الأقل.\nمثال: `count_letter('ماء علم علم') == 1`\nالجواب:", "qhash": "f1f690dd54a92959"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([79, 47, 55, 38, 58, 52, 10]) == [79, 126, 181, 0, 58, 110, 120]", "assert capped_cumsum([8]) == [8]", "assert capped_cumsum([41, 104, 58]) == [41, 145, 0]", "assert capped_cumsum([140, 179, 37, 84]) == [140, 0, 37, 121]", "assert capped_cumsum([22, 31, 55, 149, 144, 24, 116, 199]) == [22, 53, 108, 0, 144, 168, 0, 199]", "assert capped_cumsum([]) == []", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([79, 47, 55, 38, 58, 52, 10]) == [79, 126, 181, 0, 58, 110, 120]\nassert capped_cumsum([8]) == [8]\nassert capped_cumsum([41, 104, 58]) == [41, 145, 0]\nassert capped_cumsum([140, 179, 37, 84]) == [140, 0, 37, 121]\nassert capped_cumsum([22, 31, 55, 149, 144, 24, 116, 199]) == [22, 53, 108, 0, 144, 168, 0, 199]\nassert capped_cumsum([]) == []\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 200:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 200 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([79, 47, 55, 38, 58, 52, 10]) == [79, 126, 181, 0, 58, 110, 120]`\nالجواب:", "qhash": "461fd50c7da4f10b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 20\nfor j in range(-3, 2, 4):\n    total -= j * 3\nprint(total)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 20\nfor j in range(-3, 2, 4):\n    total -= j * 3\nprint(total)\nprint(j)\n```\nالجواب:", "qhash": "acefeca35117cc81", "answer": "26\n1", "completion": " الناتج:\n```text\n26\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['code', 'stone', 'cloud', 'engine', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['code', 'stone', 'cloud', 'engine', 'river']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "e4f41c77ad8d1d9c", "answer": "['code', 'stone', 'cloud', 'river', 'engine']\n['engine', 'stone', 'river']", "completion": " الناتج:\n```text\n['code', 'stone', 'cloud', 'river', 'engine']\n['engine', 'stone', 'river']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "shift_letters", "reference": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert shift_letters('apple python desert !') == 'vkkgz ktocji yznzmo !'", "assert shift_letters('rocket') == 'mjxfzo'", "assert shift_letters('window') == 'rdiyjr'", "assert shift_letters('python music by data signal Hello') == 'ktocji hpndx wt yvov ndbivg Hzggj'", "assert shift_letters('code on matrix vector stone OK') == 'xjyz ji hvomds qzxojm nojiz OK'", "assert shift_letters('signal music a vector signal') == 'ndbivg hpndx v qzxojm ndbivg'", "assert shift_letters('') == ''"], "test_code": "assert shift_letters('apple python desert !') == 'vkkgz ktocji yznzmo !'\nassert shift_letters('rocket') == 'mjxfzo'\nassert shift_letters('window') == 'rdiyjr'\nassert shift_letters('python music by data signal Hello') == 'ktocji hpndx wt yvov ndbivg Hzggj'\nassert shift_letters('code on matrix vector stone OK') == 'xjyz ji hvomds qzxojm nojiz OK'\nassert shift_letters('signal music a vector signal') == 'ndbivg hpndx v qzxojm ndbivg'\nassert shift_letters('') == ''", "answer": "def shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef shift_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `shift_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `shift_letters('apple python desert !') == 'vkkgz ktocji yznzmo !'`\nالجواب:", "qhash": "01a82599b8f712de"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [31, -8, 38, 3, 7]\nprint(a[0:4])\nprint(a[::-1])\nprint(len(a[0:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [31, -8, 38, 3, 7]\nprint(a[0:4])\nprint(a[::-1])\nprint(len(a[0:4]))\n```\nالجواب:", "qhash": "6ad165f2280844ad", "answer": "[31, -8, 38, 3]\n[7, 3, 38, -8, 31]\n4", "completion": " الناتج:\n```text\n[31, -8, 38, 3]\n[7, 3, 38, -8, 31]\n4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "eval_poly", "reference": "def eval_poly(x):\n    return 8 * x ** 2 + (8) * x + (-4)", "tests": ["assert eval_poly(5) == 236", "assert eval_poly(-16) == 1916", "assert eval_poly(-19) == 2732", "assert eval_poly(19) == 3036", "assert eval_poly(8) == 572", "assert eval_poly(-4) == 92", "assert eval_poly(-1) == -4", "assert eval_poly(0) == -4"], "test_code": "assert eval_poly(5) == 236\nassert eval_poly(-16) == 1916\nassert eval_poly(-19) == 2732\nassert eval_poly(19) == 3036\nassert eval_poly(8) == 572\nassert eval_poly(-4) == 92\nassert eval_poly(-1) == -4\nassert eval_poly(0) == -4", "answer": "def eval_poly(x):\n    return 8 * x ** 2 + (8) * x + (-4)", "completion": " ```python\ndef eval_poly(x):\n    return 8 * x ** 2 + (8) * x + (-4)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `eval_poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 8x² + 8x - 4.\nمثال: `eval_poly(5) == 236`\nالجواب:", "qhash": "1d83a551374e22df"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "roll", "reference": "def roll(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert roll([6, 30, 2, 32, 7, 4, 2]) == [30, 2, 32, 7, 4, 2, 6]", "assert roll([-5, -9, 26, 7, 16, 21, 8, 28, 18, 33, 10]) == [26, 7, 16, 21, 8, 28, 18, 33, 10, -5, -9]", "assert roll([38, 1, 27, 48, 11]) == [38, 1, 27, 48, 11]", "assert roll([18, 26, 23, 6, 11, 32, -3]) == [26, 23, 6, 11, 32, -3, 18]", "assert roll([5, 42, 12, 49, 40, 17, 2, 7, 8, 12, 36]) == [12, 49, 40, 17, 2, 7, 8, 12, 36, 5, 42]", "assert roll([41, -6, 2, 23, 41, 41, 14, 30]) == [41, 41, 14, 30, 41, -6, 2, 23]", "assert roll([]) == []"], "test_code": "assert roll([6, 30, 2, 32, 7, 4, 2]) == [30, 2, 32, 7, 4, 2, 6]\nassert roll([-5, -9, 26, 7, 16, 21, 8, 28, 18, 33, 10]) == [26, 7, 16, 21, 8, 28, 18, 33, 10, -5, -9]\nassert roll([38, 1, 27, 48, 11]) == [38, 1, 27, 48, 11]\nassert roll([18, 26, 23, 6, 11, 32, -3]) == [26, 23, 6, 11, 32, -3, 18]\nassert roll([5, 42, 12, 49, 40, 17, 2, 7, 8, 12, 36]) == [12, 49, 40, 17, 2, 7, 8, 12, 36, 5, 42]\nassert roll([41, -6, 2, 23, 41, 41, 14, 30]) == [41, 41, 14, 30, 41, -6, 2, 23]\nassert roll([]) == []", "answer": "def roll(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 20 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef roll(lst):\n    if not lst:\n        return []\n    k = 20 % len(lst)\n    return ____\n```\nمثال: `roll([6, 30, 2, 32, 7, 4, 2]) == [30, 2, 32, 7, 4, 2, 6]`\nالجواب:", "qhash": "550374cf860ecb10"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(25) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19', '20', 'Sun', '22', '23', '24', '25']", "assert label_numbers(4) == ['1', '2', '3', '4']", "assert label_numbers(3) == ['1', '2', '3']", "assert label_numbers(7) == ['1', '2', '3', '4', '5', '6', 'Sun']", "assert label_numbers(2) == ['1', '2']"], "test_code": "assert label_numbers(25) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19', '20', 'Sun', '22', '23', '24', '25']\nassert label_numbers(4) == ['1', '2', '3', '4']\nassert label_numbers(3) == ['1', '2', '3']\nassert label_numbers(7) == ['1', '2', '3', '4', '5', '6', 'Sun']\nassert label_numbers(2) == ['1', '2']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 7 == 0:\n            s += 'Sun'\n        if i % 9 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 7 تصبح 'Sun'، مضاعفات 9 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(25) == ['1', '2', '3', '4', '5', '6', 'Sun', '8', 'Moon', '10', '11', '12', '13', 'Sun', '15', '16', '17', 'Moon', '19', '20', 'Sun', '22', '23', '24', '25']`\nالجواب:", "qhash": "2d387b29174e94d9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "tests": ["assert sum_multiples(179) == 2610", "assert sum_multiples(108) == 918", "assert sum_multiples(120) == 1143", "assert sum_multiples(76) == 468", "assert sum_multiples(211) == 3780", "assert sum_multiples(7) == 0", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(179) == 2610\nassert sum_multiples(108) == 918\nassert sum_multiples(120) == 1143\nassert sum_multiples(76) == 468\nassert sum_multiples(211) == 3780\nassert sum_multiples(7) == 0\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 9 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 9 أو 12 دون باقٍ.\nمثال: `sum_multiples(179) == 2610`\nالجواب:", "qhash": "6d69d7d585a661df"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "dig_pow_mod", "reference": "def dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 63", "tests": ["assert dig_pow_mod(45398) == 27", "assert dig_pow_mod(831101) == 22", "assert dig_pow_mod(464916) == 27", "assert dig_pow_mod(471124) == 33", "assert dig_pow_mod(422646) == 49", "assert dig_pow_mod(44560) == 39", "assert dig_pow_mod(698828) == 1", "assert dig_pow_mod(0) == 0"], "test_code": "assert dig_pow_mod(45398) == 27\nassert dig_pow_mod(831101) == 22\nassert dig_pow_mod(464916) == 27\nassert dig_pow_mod(471124) == 33\nassert dig_pow_mod(422646) == 49\nassert dig_pow_mod(44560) == 39\nassert dig_pow_mod(698828) == 1\nassert dig_pow_mod(0) == 0", "answer": "def dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 63", "completion": " ```python\ndef dig_pow_mod(n):\n    return sum(int(d) ** 4 for d in str(n)) % 63\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `dig_pow_mod` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 63.\nمثال: `dig_pow_mod(45398) == 27`\nالجواب:", "qhash": "9ff845b6893776c7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('python winter stone !') == 'qzuipo xjoufs tupof !'", "assert encode('at to up matrix cloud A1') == 'bu up vq nbusjy dmpve A1'", "assert encode('matrix') == 'nbusjy'", "assert encode('desert an signal') == 'eftfsu bo tjhobm'", "assert encode('at engine planet OK') == 'bu fohjof qmbofu OK'", "assert encode('an') == 'bo'", "assert encode('') == ''"], "test_code": "assert encode('python winter stone !') == 'qzuipo xjoufs tupof !'\nassert encode('at to up matrix cloud A1') == 'bu up vq nbusjy dmpve A1'\nassert encode('matrix') == 'nbusjy'\nassert encode('desert an signal') == 'eftfsu bo tjhobm'\nassert encode('at engine planet OK') == 'bu fohjof qmbofu OK'\nassert encode('an') == 'bo'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('python winter stone !') == 'qzuipo xjoufs tupof !'`\nالجواب:", "qhash": "c9e791ef59f163d9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_initial", "reference": "def count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "tests": ["assert count_initial('نهار مدرسة كتاب') == 0", "assert count_initial('سفينة حاسوب قهوة علم قلم قمر') == 3", "assert count_initial('سوق باب سماء عمل قهوة نور قمر دفتر') == 2", "assert count_initial('سماء رمل صديق') == 0", "assert count_initial('قهوة شمس حاسوب ميناء بحر قمر') == 2", "assert count_initial('سماء نهر سيارة سوق نور') == 0", "assert count_initial('') == 0"], "test_code": "assert count_initial('نهار مدرسة كتاب') == 0\nassert count_initial('سفينة حاسوب قهوة علم قلم قمر') == 3\nassert count_initial('سوق باب سماء عمل قهوة نور قمر دفتر') == 2\nassert count_initial('سماء رمل صديق') == 0\nassert count_initial('قهوة شمس حاسوب ميناء بحر قمر') == 2\nassert count_initial('سماء نهر سيارة سوق نور') == 0\nassert count_initial('') == 0", "answer": "def count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "completion": " ```python\ndef count_initial(s):\n    count = 0\n    for w in s.split():\n        if w.startswith('ق'):\n            count += 1\n    return count\n```\n", "buggy": "def count_initial(s):\n    count = 0\n    for w in s:\n        if w.startswith('ق'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي s التي تبدأ بالحرف «ق»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_initial(s):\n    count = 0\n    for w in s:\n        if w.startswith('ق'):\n            count += 1\n    return count\n```\nمثال: `count_initial('نهار مدرسة كتاب') == 0`\nالجواب:", "qhash": "81c23f7352aee15f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(18) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic']", "assert label_numbers(24) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', '20', '21', 'Tac', '23', 'Tic']", "assert label_numbers(10) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10']", "assert label_numbers(25) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', '20', '21', 'Tac', '23', 'Tic', '25']", "assert label_numbers(12) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic']"], "test_code": "assert label_numbers(18) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic']\nassert label_numbers(24) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', '20', '21', 'Tac', '23', 'Tic']\nassert label_numbers(10) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10']\nassert label_numbers(25) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic', '19', '20', '21', 'Tac', '23', 'Tic', '25']\nassert label_numbers(12) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Tic'\n        if i % 11 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Tic'، مضاعفات 11 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(18) == ['1', '2', '3', '4', '5', 'Tic', '7', '8', '9', '10', 'Tac', 'Tic', '13', '14', '15', '16', '17', 'Tic']`\nالجواب:", "qhash": "dd360c7a45837f15"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "play", "reference": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "tests": ["assert play(21) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21']", "assert play(14) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14']", "assert play(0) == []", "assert play(3) == ['1', '2', '3']", "assert play(17) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17']"], "test_code": "assert play(21) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21']\nassert play(14) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14']\nassert play(0) == []\nassert play(3) == ['1', '2', '3']\nassert play(17) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17']", "answer": "def play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef play(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Fizz'\n        if i % 9 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `play` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Fizz'، مضاعفات 9 تصبح 'Buzz'، المضاعفات المشتركة تصبح 'FizzBuzz'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `play(21) == ['1', '2', '3', '4', '5', 'Fizz', '7', '8', 'Buzz', '10', '11', 'Fizz', '13', '14', '15', '16', '17', 'FizzBuzz', '19', '20', '21']`\nالجواب:", "qhash": "32bcf5d525344d0e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([60, 10, 70, 0, 36, 23, 3, 56]) == 0", "assert tally_div([50, 47, -17, -30, 51, 87, -3, 10, 57, -37, 66, 80]) == 2", "assert tally_div([-28, 40, 17, 25]) == 0", "assert tally_div([74, -35, -28, 30, 67, 32, 56, 15, 11]) == 1", "assert tally_div([-34, 14, 43, 69]) == 0", "assert tally_div([-17, 34, 41, 22, 35, -29, -1, 29, -35]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([60, 10, 70, 0, 36, 23, 3, 56]) == 0\nassert tally_div([50, 47, -17, -30, 51, 87, -3, 10, 57, -37, 66, 80]) == 2\nassert tally_div([-28, 40, 17, 25]) == 0\nassert tally_div([74, -35, -28, 30, 67, 32, 56, 15, 11]) == 1\nassert tally_div([-34, 14, 43, 69]) == 0\nassert tally_div([-17, 34, 41, 22, 35, -29, -1, 29, -35]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([60, 10, 70, 0, 36, 23, 3, 56]) == 0`\nالجواب:", "qhash": "cf7de51e29e0d58a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "power_sum", "reference": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total", "tests": ["assert power_sum(7) == 56", "assert power_sum(12) == 156", "assert power_sum(5) == 30", "assert power_sum(2) == 6", "assert power_sum(9) == 90", "assert power_sum(1) == 2", "assert power_sum(0) == 0"], "test_code": "assert power_sum(7) == 56\nassert power_sum(12) == 156\nassert power_sum(5) == 30\nassert power_sum(2) == 6\nassert power_sum(9) == 90\nassert power_sum(1) == 2\nassert power_sum(0) == 0", "answer": "def power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total", "completion": " ```python\ndef power_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 1\n    return total\n```\n", "buggy": "def power_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 2 * i ** 1\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^1 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef power_sum(n):\n    total = 0\n    for i in range(0, n):\n        total += 2 * i ** 1\n    return total\n```\nمثال: `power_sum(7) == 56`\nالجواب:", "qhash": "9eeda3a65154722e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return -1 * x ** 2 + (5) * x + (6)", "tests": ["assert p(3) == 12", "assert p(-1) == 0", "assert p(-10) == -144", "assert p(-8) == -98", "assert p(-12) == -198", "assert p(-5) == -44", "assert p(7) == -8", "assert p(0) == 6"], "test_code": "assert p(3) == 12\nassert p(-1) == 0\nassert p(-10) == -144\nassert p(-8) == -98\nassert p(-12) == -198\nassert p(-5) == -44\nassert p(7) == -8\nassert p(0) == 6", "answer": "def p(x):\n    return -1 * x ** 2 + (5) * x + (6)", "completion": " ```python\ndef p(x):\n    return -1 * x ** 2 + (5) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -1x² + 5x + 6.\nمثال: `p(3) == 12`\nالجواب:", "qhash": "b2b3e4d105033451"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('garden light') == 'lfwijs qnlmy'", "assert encode('summer an') == 'xzrrjw fs'", "assert encode('music') == 'rzxnh'", "assert encode('music to planet 2024') == 'rzxnh yt uqfsjy 2024'", "assert encode('in on falcon planet Hello') == 'ns ts kfqhts uqfsjy Hjqqt'", "assert encode('it coffee of code music') == 'ny htkkjj tk htij rzxnh'", "assert encode('') == ''"], "test_code": "assert encode('garden light') == 'lfwijs qnlmy'\nassert encode('summer an') == 'xzrrjw fs'\nassert encode('music') == 'rzxnh'\nassert encode('music to planet 2024') == 'rzxnh yt uqfsjy 2024'\nassert encode('in on falcon planet Hello') == 'ns ts kfqhts uqfsjy Hjqqt'\nassert encode('it coffee of code music') == 'ny htkkjj tk htij rzxnh'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (5)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 5 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('garden light') == 'lfwijs qnlmy'`\nالجواب:", "qhash": "a28821d77319b759"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_terms", "reference": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 12 * i ** 2\n    return total", "tests": ["assert sum_terms(8) == 2448", "assert sum_terms(14) == 12180", "assert sum_terms(12) == 7800", "assert sum_terms(9) == 3420", "assert sum_terms(13) == 9828", "assert sum_terms(1) == 12", "assert sum_terms(0) == 0"], "test_code": "assert sum_terms(8) == 2448\nassert sum_terms(14) == 12180\nassert sum_terms(12) == 7800\nassert sum_terms(9) == 3420\nassert sum_terms(13) == 9828\nassert sum_terms(1) == 12\nassert sum_terms(0) == 0", "answer": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 12 * i ** 2\n    return total", "completion": " ```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 12 * i ** 2\n    return total\n```\n", "buggy": "def sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 12 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 12 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_terms(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 12 * i ** 2\n    return total\n```\nمثال: `sum_terms(8) == 2448`\nالجواب:", "qhash": "334749bdbb453dc3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "points = {'فيصل': 2, 'هدى': 7, 'منى': 40}\npoints['منى'] += 10\npoints['أحمد'] = 21\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npoints = {'فيصل': 2, 'هدى': 7, 'منى': 40}\npoints['منى'] += 10\npoints['أحمد'] = 21\nprint(len(points))\nprint(max(points, key=points.get))\nprint(sum(points.values()))\nprint(sorted(points.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "8c8ba6a640293e49", "answer": "4\nمنى\n80\n[('فيصل', 2), ('هدى', 7)]", "completion": " الناتج:\n```text\n4\nمنى\n80\n[('فيصل', 2), ('هدى', 7)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "tests": ["assert lead_count('صديق سلام تفاحة امل') == 1", "assert lead_count('امل مكتبة حصان') == 1", "assert lead_count('نهار خبز حديقة بيت امل صديق امل رمل') == 2", "assert lead_count('جمل امل دفتر امل') == 2", "assert lead_count('مطر حصان باب ماء طائرة امل حصان امل') == 2", "assert lead_count('بحر معلم بحر سوق امل امل سماء') == 2", "assert lead_count('') == 0"], "test_code": "assert lead_count('صديق سلام تفاحة امل') == 1\nassert lead_count('امل مكتبة حصان') == 1\nassert lead_count('نهار خبز حديقة بيت امل صديق امل رمل') == 2\nassert lead_count('جمل امل دفتر امل') == 2\nassert lead_count('مطر حصان باب ماء طائرة امل حصان امل') == 2\nassert lead_count('بحر معلم بحر سوق امل امل سماء') == 2\nassert lead_count('') == 0", "answer": "def lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('ا'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ا»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(sentence):\n    count = 0\n    for w in sentence:\n        if w.startswith('ا'):\n            count += 1\n    return count\n```\nمثال: `lead_count('صديق سلام تفاحة امل') == 1`\nالجواب:", "qhash": "584b2467c93ae23f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "p", "reference": "def p(x):\n    return -4 * x ** 2 + (-4) * x + (-2)", "tests": ["assert p(8) == -290", "assert p(-2) == -10", "assert p(12) == -626", "assert p(0) == -2", "assert p(14) == -842", "assert p(7) == -226", "assert p(-3) == -26", "assert p(0) == -2"], "test_code": "assert p(8) == -290\nassert p(-2) == -10\nassert p(12) == -626\nassert p(0) == -2\nassert p(14) == -842\nassert p(7) == -226\nassert p(-3) == -26\nassert p(0) == -2", "answer": "def p(x):\n    return -4 * x ** 2 + (-4) * x + (-2)", "completion": " ```python\ndef p(x):\n    return -4 * x ** 2 + (-4) * x + (-2)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `p` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -4x² - 4x - 2.\nمثال: `p(8) == -290`\nالجواب:", "qhash": "7e483df4cd074e13"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def rec(n):\n    if n < 10:\n        return n\n    return n % 10 + rec(n // 10)\n\nprint(rec(200192510))\nprint(rec(rec(200192510)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef rec(n):\n    if n < 10:\n        return n\n    return n % 10 + rec(n // 10)\n\nprint(rec(200192510))\nprint(rec(rec(200192510)))\n```\nالجواب:", "qhash": "5a60ee3e487bccbf", "answer": "20\n2", "completion": " الناتج:\n```text\n20\n2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "poly", "reference": "def poly(x):\n    return 1 * x ** 2 + (-4) * x + (-9)", "tests": ["assert poly(7) == 12", "assert poly(2) == -13", "assert poly(-19) == 428", "assert poly(3) == -12", "assert poly(-14) == 243", "assert poly(-12) == 183", "assert poly(9) == 36", "assert poly(0) == -9"], "test_code": "assert poly(7) == 12\nassert poly(2) == -13\nassert poly(-19) == 428\nassert poly(3) == -12\nassert poly(-14) == 243\nassert poly(-12) == 183\nassert poly(9) == 36\nassert poly(0) == -9", "answer": "def poly(x):\n    return 1 * x ** 2 + (-4) * x + (-9)", "completion": " ```python\ndef poly(x):\n    return 1 * x ** 2 + (-4) * x + (-9)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `poly` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 1x² - 4x - 9.\nمثال: `poly(7) == 12`\nالجواب:", "qhash": "69e5862e551311ae"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * -2 for x in xs if -19 <= x <= -7)", "tests": ["assert select_range([-25, -28, -6, -7, -10, -12, -27, -17, -18, -15]) == [14, 20, 24, 30, 34, 36]", "assert select_range([30, 38, -18, -28, 26, -10, 6, 54, 41, 1]) == [20, 36]", "assert select_range([3, 28, 13, 44, 20, 20, 18, 24, 28]) == []", "assert select_range([-30]) == []", "assert select_range([7, 33, 6, 42, -30, 30]) == []", "assert select_range([47, -27, -25]) == []", "assert select_range([]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-25, -28, -6, -7, -10, -12, -27, -17, -18, -15]) == [14, 20, 24, 30, 34, 36]\nassert select_range([30, 38, -18, -28, 26, -10, 6, 54, 41, 1]) == [20, 36]\nassert select_range([3, 28, 13, 44, 20, 20, 18, 24, 28]) == []\nassert select_range([-30]) == []\nassert select_range([7, 33, 6, 42, -30, 30]) == []\nassert select_range([47, -27, -25]) == []\nassert select_range([]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * -2 for x in xs if -19 <= x <= -7)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * -2 for x in xs if -19 <= x <= -7)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -2 لكل عنصر x في المدى المغلق [-19, -7].\nمثال: `select_range([-25, -28, -6, -7, -10, -12, -27, -17, -18, -15]) == [14, 20, 24, 30, 34, 36]`\nالجواب:", "qhash": "755778da73855a6e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(12) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon', '11', 'Sun']", "assert label_numbers(10) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon']", "assert label_numbers(24) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon', '11', 'Sun', '13', 'Sun', 'Moon', 'Sun', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'Sun']", "assert label_numbers(3) == ['1', 'Sun', '3']", "assert label_numbers(4) == ['1', 'Sun', '3', 'Sun']"], "test_code": "assert label_numbers(12) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon', '11', 'Sun']\nassert label_numbers(10) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon']\nassert label_numbers(24) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon', '11', 'Sun', '13', 'Sun', 'Moon', 'Sun', '17', 'Sun', '19', 'SunMoon', '21', 'Sun', '23', 'Sun']\nassert label_numbers(3) == ['1', 'Sun', '3']\nassert label_numbers(4) == ['1', 'Sun', '3', 'Sun']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 2 == 0:\n            s += 'Sun'\n        if i % 5 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 2 تصبح 'Sun'، مضاعفات 5 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(12) == ['1', 'Sun', '3', 'Sun', 'Moon', 'Sun', '7', 'Sun', '9', 'SunMoon', '11', 'Sun']`\nالجواب:", "qhash": "dff24f9bbd115989"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "total = 5\nfor x in range(4, 9, 2):\n    total += x * 8\nprint(total)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntotal = 5\nfor x in range(4, 9, 2):\n    total += x * 8\nprint(total)\nprint(x)\n```\nالجواب:", "qhash": "07e4a3edacb9faec", "answer": "149\n8", "completion": " الناتج:\n```text\n149\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 16\nfor j in range(4, 14, 2):\n    acc -= j * 1\nprint(acc)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 16\nfor j in range(4, 14, 2):\n    acc -= j * 1\nprint(acc)\nprint(j)\n```\nالجواب:", "qhash": "ab8f3f15dbb3757e", "answer": "-24\n12", "completion": " الناتج:\n```text\n-24\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'ليلى': 24, 'يوسف': 48, 'عمر': 37, 'علي': 16}\nd['عمر'] += 5\nd['مريم'] = 50\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'ليلى': 24, 'يوسف': 48, 'عمر': 37, 'علي': 16}\nd['عمر'] += 5\nd['مريم'] = 50\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(sorted(d.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "095c404f6bcfe081", "answer": "5\nمريم\n180\n[('علي', 16), ('ليلى', 24)]", "completion": " الناتج:\n```text\n5\nمريم\n180\n[('علي', 16), ('ليلى', 24)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([57, 75, 87, 24, 16, 20]) == 0", "assert count_div([37, 56, 6, 65, -6, -26, 88, 1]) == 0", "assert count_div([-12, 51]) == 0", "assert count_div([50, 60, 16, 55, 55, -38]) == 0", "assert count_div([62, -7, 50, 66, 58, 54, 68, 1, 0, -13, 71]) == 1", "assert count_div([-6]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([57, 75, 87, 24, 16, 20]) == 0\nassert count_div([37, 56, 6, 65, -6, -26, 88, 1]) == 0\nassert count_div([-12, 51]) == 0\nassert count_div([50, 60, 16, 55, 55, -38]) == 0\nassert count_div([62, -7, 50, 66, 58, 54, 68, 1, 0, -13, 71]) == 1\nassert count_div([-6]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 7 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 7. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([57, 75, 87, 24, 16, 20]) == 0`\nالجواب:", "qhash": "9e58c136b58728a7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_by", "reference": "def rotate_by(lst):\n    if not lst:\n        return []\n    k = 6 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_by([35, 6, 45, 47, 32, 26, 10, 38]) == [45, 47, 32, 26, 10, 38, 35, 6]", "assert rotate_by([14, 19, 26, -4, 10, 10, 14, 33, 2, 50]) == [10, 10, 14, 33, 2, 50, 14, 19, 26, -4]", "assert rotate_by([35, 48, 25, 12]) == [25, 12, 35, 48]", "assert rotate_by([36, 38]) == [36, 38]", "assert rotate_by([35, 12, -1]) == [35, 12, -1]", "assert rotate_by([-2, 0, 38, 46, 7, -9, 27]) == [0, 38, 46, 7, -9, 27, -2]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([35, 6, 45, 47, 32, 26, 10, 38]) == [45, 47, 32, 26, 10, 38, 35, 6]\nassert rotate_by([14, 19, 26, -4, 10, 10, 14, 33, 2, 50]) == [10, 10, 14, 33, 2, 50, 14, 19, 26, -4]\nassert rotate_by([35, 48, 25, 12]) == [25, 12, 35, 48]\nassert rotate_by([36, 38]) == [36, 38]\nassert rotate_by([35, 12, -1]) == [35, 12, -1]\nassert rotate_by([-2, 0, 38, 46, 7, -9, 27]) == [0, 38, 46, 7, -9, 27, -2]\nassert rotate_by([]) == []", "answer": "def rotate_by(lst):\n    if not lst:\n        return []\n    k = 6 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef rotate_by(lst):\n    if not lst:\n        return []\n    k = 6 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 6 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_by(lst):\n    if not lst:\n        return []\n    k = 6 % len(lst)\n    return ____\n```\nمثال: `rotate_by([35, 6, 45, 47, 32, 26, 10, 38]) == [45, 47, 32, 26, 10, 38, 35, 6]`\nالجواب:", "qhash": "68c52d6a529dbc42"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('مدينة دفتر بيت دفتر ماء') == 2", "assert prefix_hits('تفاحة شجرة حاسوب') == 0", "assert prefix_hits('مطر سماء') == 0", "assert prefix_hits('عمل قهوة طائرة سلام') == 0", "assert prefix_hits('صحراء دفتر عربية سفينة مطر دفتر وردة') == 2", "assert prefix_hits('طالب دفتر نهر دفتر دفتر برتقال') == 3", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('مدينة دفتر بيت دفتر ماء') == 2\nassert prefix_hits('تفاحة شجرة حاسوب') == 0\nassert prefix_hits('مطر سماء') == 0\nassert prefix_hits('عمل قهوة طائرة سلام') == 0\nassert prefix_hits('صحراء دفتر عربية سفينة مطر دفتر وردة') == 2\nassert prefix_hits('طالب دفتر نهر دفتر دفتر برتقال') == 3\nassert prefix_hits('') == 0", "answer": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('د'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('د'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «د»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('د'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('مدينة دفتر بيت دفتر ماء') == 2`\nالجواب:", "qhash": "34083e5bfeba03ef"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "tests": ["assert multiples_total(56) == 756", "assert multiples_total(124) == 3782", "assert multiples_total(1) == 0", "assert multiples_total(269) == 18090", "assert multiples_total(102) == 2550", "assert multiples_total(50) == 600", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(56) == 756\nassert multiples_total(124) == 3782\nassert multiples_total(1) == 0\nassert multiples_total(269) == 18090\nassert multiples_total(102) == 2550\nassert multiples_total(50) == 600\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 14 دون باقٍ.\nمثال: `multiples_total(56) == 756`\nالجواب:", "qhash": "c804870b9d4c62d8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_letter", "reference": "def count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ح'))", "tests": ["assert count_letter('لغة سلام سلام معلم تفاحة شمس حصان ليل') == 1", "assert count_letter('') == 0", "assert count_letter('شجرة عربية سوق نهار') == 0", "assert count_letter('ماء جبل قلم ماء ليل قلم') == 0", "assert count_letter('خبز سفينة حاسوب جمل سماء ماء') == 1", "assert count_letter('رمل عمل مكتبة علم سماء طالب سيارة مدرسة') == 0", "assert count_letter('برمجة معلم ميناء خبز نهار') == 0", "assert count_letter('') == 0"], "test_code": "assert count_letter('لغة سلام سلام معلم تفاحة شمس حصان ليل') == 1\nassert count_letter('') == 0\nassert count_letter('شجرة عربية سوق نهار') == 0\nassert count_letter('ماء جبل قلم ماء ليل قلم') == 0\nassert count_letter('خبز سفينة حاسوب جمل سماء ماء') == 1\nassert count_letter('رمل عمل مكتبة علم سماء طالب سيارة مدرسة') == 0\nassert count_letter('برمجة معلم ميناء خبز نهار') == 0\nassert count_letter('') == 0", "answer": "def count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ح'))", "completion": " ```python\ndef count_letter(text):\n    return sum(1 for w in text.split() if w.startswith('ح'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_letter` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ح».\nمثال: `count_letter('لغة سلام سلام معلم تفاحة شمس حصان ليل') == 1`\nالجواب:", "qhash": "c9be444f1b408ecf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "largest_div", "reference": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert largest_div([3, 38, -7, 49, -7, -9, -17]) == None", "assert largest_div([-8, -24, -16]) == -8", "assert largest_div([1, 9]) == None", "assert largest_div([-38, 33, -39]) == None", "assert largest_div([26, 37, 12, -12, 49, 4, -3]) == None", "assert largest_div([]) == None"], "test_code": "assert largest_div([3, 38, -7, 49, -7, -9, -17]) == None\nassert largest_div([-8, -24, -16]) == -8\nassert largest_div([1, 9]) == None\nassert largest_div([-38, 33, -39]) == None\nassert largest_div([26, 37, 12, -12, 49, 4, -3]) == None\nassert largest_div([]) == None", "answer": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 8 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة xs يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef largest_div(xs):\n    best = None\n    for x in xs:\n        if x % 8 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `largest_div([3, 38, -7, 49, -7, -9, -17]) == None`\nالجواب:", "qhash": "13f362cd1ae69b59"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x * -1 + -8 for x in range(4, 15) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x * -1 + -8 for x in range(4, 15) if x % 2 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "c61718ff5e4c0eb9", "answer": "[-13, -15, -17, -19, -21]\n5 -85", "completion": " الناتج:\n```text\n[-13, -15, -17, -19, -21]\n5 -85\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "evaluate", "reference": "def evaluate(x):\n    return 8 * x ** 2 + (-8) * x + (6)", "tests": ["assert evaluate(4) == 102", "assert evaluate(16) == 1926", "assert evaluate(-8) == 582", "assert evaluate(16) == 1926", "assert evaluate(-9) == 726", "assert evaluate(-3) == 102", "assert evaluate(12) == 1062", "assert evaluate(0) == 6"], "test_code": "assert evaluate(4) == 102\nassert evaluate(16) == 1926\nassert evaluate(-8) == 582\nassert evaluate(16) == 1926\nassert evaluate(-9) == 726\nassert evaluate(-3) == 102\nassert evaluate(12) == 1062\nassert evaluate(0) == 6", "answer": "def evaluate(x):\n    return 8 * x ** 2 + (-8) * x + (6)", "completion": " ```python\ndef evaluate(x):\n    return 8 * x ** 2 + (-8) * x + (6)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `evaluate` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 8x² - 8x + 6.\nمثال: `evaluate(4) == 102`\nالجواب:", "qhash": "6afb4220b9791a4e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "prod_mod", "reference": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 61", "tests": ["assert prod_mod(4) == 4", "assert prod_mod(33) == 58", "assert prod_mod(9) == 45", "assert prod_mod(45) == 43", "assert prod_mod(43) == 46", "assert prod_mod(44) == 52", "assert prod_mod(0) == 1"], "test_code": "assert prod_mod(4) == 4\nassert prod_mod(33) == 58\nassert prod_mod(9) == 45\nassert prod_mod(45) == 43\nassert prod_mod(43) == 46\nassert prod_mod(44) == 52\nassert prod_mod(0) == 1", "answer": "def prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 61", "completion": " ```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return (n * prod_mod(n - 4)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef prod_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `prod_mod(4) == 4`\nالجواب:", "qhash": "6b3700d699c7c639"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [-12, 12, 36, 19, -15, -18, 8, 30]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [-12, 12, 36, 19, -15, -18, 8, 30]\nprint(sorted(nums, key=lambda x: (abs(x - 23), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "0d7685145f709048", "answer": "[19, 30, 12, 36, 8, -12, -15, -18]\n[36, 30, 19]", "completion": " الناتج:\n```text\n[19, 30, 12, 36, 8, -12, -15, -18]\n[36, 30, 19]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * 4 + 2 for x in range(0, 15) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * 4 + 2 for x in range(0, 15) if x % 5 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "eb44d868999482d5", "answer": "[6, 26, 46]\n3 78", "completion": " الناتج:\n```text\n[6, 26, 46]\n3 78\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_coprime", "reference": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)", "tests": ["assert count_coprime(51) == 44", "assert count_coprime(91) == 78", "assert count_coprime(71) == 61", "assert count_coprime(11) == 10", "assert count_coprime(168) == 144", "assert count_coprime(193) == 166", "assert count_coprime(1) == 1"], "test_code": "assert count_coprime(51) == 44\nassert count_coprime(91) == 78\nassert count_coprime(71) == 61\nassert count_coprime(11) == 10\nassert count_coprime(168) == 144\nassert count_coprime(193) == 166\nassert count_coprime(1) == 1", "answer": "def count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)", "completion": " ```python\ndef count_coprime(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 7) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_coprime` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 7 في أي قاسم أكبر من 1.\nمثال: `count_coprime(51) == 44`\nالجواب:", "qhash": "3b5e877f59a3509b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 70:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([18, 21, 2, 9, 40, 21, 25, 24]) == [18, 39, 41, 50, 0, 21, 46, 70]", "assert reset_sum([-1, 52, 64, 39]) == [-1, 51, 0, 39]", "assert reset_sum([27, 34, 0, 18, 47, -7, -5]) == [27, 61, 61, 0, 47, 40, 35]", "assert reset_sum([30, -10, -7, 59]) == [30, 20, 13, 0]", "assert reset_sum([59, 31, 1, 69, 67, 36, 31, 54, 65]) == [59, 0, 1, 70, 0, 36, 67, 0, 65]", "assert reset_sum([63, 35]) == [63, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([18, 21, 2, 9, 40, 21, 25, 24]) == [18, 39, 41, 50, 0, 21, 46, 70]\nassert reset_sum([-1, 52, 64, 39]) == [-1, 51, 0, 39]\nassert reset_sum([27, 34, 0, 18, 47, -7, -5]) == [27, 61, 61, 0, 47, 40, 35]\nassert reset_sum([30, -10, -7, 59]) == [30, 20, 13, 0]\nassert reset_sum([59, 31, 1, 69, 67, 36, 31, 54, 65]) == [59, 0, 1, 70, 0, 36, 67, 0, 65]\nassert reset_sum([63, 35]) == [63, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 70:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 70:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 70 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([18, 21, 2, 9, 40, 21, 25, 24]) == [18, 39, 41, 50, 0, 21, 46, 70]`\nالجواب:", "qhash": "0cec1d38d698a3f2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "total_pow", "reference": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 2\n    return total", "tests": ["assert total_pow(5) == 330", "assert total_pow(14) == 6090", "assert total_pow(13) == 4914", "assert total_pow(10) == 2310", "assert total_pow(15) == 7440", "assert total_pow(1) == 6", "assert total_pow(0) == 0"], "test_code": "assert total_pow(5) == 330\nassert total_pow(14) == 6090\nassert total_pow(13) == 4914\nassert total_pow(10) == 2310\nassert total_pow(15) == 7440\nassert total_pow(1) == 6\nassert total_pow(0) == 0", "answer": "def total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 2\n    return total", "completion": " ```python\ndef total_pow(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 6 * i ** 2\n    return total\n```\n", "buggy": "def total_pow(n):\n    total = 0\n    for i in range(0, n):\n        total += 6 * i ** 2\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 6 × i^2 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef total_pow(n):\n    total = 0\n    for i in range(0, n):\n        total += 6 * i ** 2\n    return total\n```\nمثال: `total_pow(5) == 330`\nالجواب:", "qhash": "8b5943dd90d51cc8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "reverse_words", "reference": "def reverse_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert reverse_words('vector an it falcon rocket at to python') == 'python-rocket-falcon-vector'", "assert reverse_words('it') == ''", "assert reverse_words('desert light at window data cloud') == 'cloud-window-light-desert'", "assert reverse_words('to river rocket stone light') == 'light-stone-rocket-river'", "assert reverse_words('river pixel music it') == 'music-pixel-river'", "assert reverse_words('vector planet it up light data is camel') == 'camel-light-planet-vector'", "assert reverse_words('falcon go summer light it') == 'light-summer-falcon'"], "test_code": "assert reverse_words('vector an it falcon rocket at to python') == 'python-rocket-falcon-vector'\nassert reverse_words('it') == ''\nassert reverse_words('desert light at window data cloud') == 'cloud-window-light-desert'\nassert reverse_words('to river rocket stone light') == 'light-stone-rocket-river'\nassert reverse_words('river pixel music it') == 'music-pixel-river'\nassert reverse_words('vector planet it up light data is camel') == 'camel-light-planet-vector'\nassert reverse_words('falcon go summer light it') == 'light-summer-falcon'", "answer": "def reverse_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef reverse_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `reverse_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `reverse_words('vector an it falcon rocket at to python') == 'python-rocket-falcon-vector'`\nالجواب:", "qhash": "a67c9a5a96082fd4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'cgn'}", "tests": ["assert count_chars('river rocket go camel falcon') == {'c': 3, 'g': 1, 'n': 1}", "assert count_chars('banana of coffee a an signal') == {'c': 1, 'g': 1, 'n': 4}", "assert count_chars('at of signal') == {'c': 0, 'g': 1, 'n': 1}", "assert count_chars('desert') == {'c': 0, 'g': 0, 'n': 0}", "assert count_chars('in up') == {'c': 0, 'g': 0, 'n': 1}", "assert count_chars('go window') == {'c': 0, 'g': 1, 'n': 1}", "assert count_chars('') == {'c': 0, 'g': 0, 'n': 0}"], "test_code": "assert count_chars('river rocket go camel falcon') == {'c': 3, 'g': 1, 'n': 1}\nassert count_chars('banana of coffee a an signal') == {'c': 1, 'g': 1, 'n': 4}\nassert count_chars('at of signal') == {'c': 0, 'g': 1, 'n': 1}\nassert count_chars('desert') == {'c': 0, 'g': 0, 'n': 0}\nassert count_chars('in up') == {'c': 0, 'g': 0, 'n': 1}\nassert count_chars('go window') == {'c': 0, 'g': 1, 'n': 1}\nassert count_chars('') == {'c': 0, 'g': 0, 'n': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'cgn'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'cgn'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'c'، 'g'، 'n' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('river rocket go camel falcon') == {'c': 3, 'g': 1, 'n': 1}`\nالجواب:", "qhash": "09e0958573c23894"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "tests": ["assert add_multiples(274) == 9660", "assert add_multiples(5) == 0", "assert add_multiples(91) == 1018", "assert add_multiples(140) == 2386", "assert add_multiples(152) == 2817", "assert add_multiples(292) == 10515", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(274) == 9660\nassert add_multiples(5) == 0\nassert add_multiples(91) == 1018\nassert add_multiples(140) == 2386\nassert add_multiples(152) == 2817\nassert add_multiples(292) == 10515\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 7 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 7 أو 8 دون باقٍ.\nمثال: `add_multiples(274) == 9660`\nالجواب:", "qhash": "7f8f282f01913816"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 76) == 1)", "tests": ["assert phi_upto(59) == 28", "assert phi_upto(180) == 85", "assert phi_upto(174) == 82", "assert phi_upto(120) == 57", "assert phi_upto(26) == 12", "assert phi_upto(184) == 87", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(59) == 28\nassert phi_upto(180) == 85\nassert phi_upto(174) == 82\nassert phi_upto(120) == 57\nassert phi_upto(26) == 12\nassert phi_upto(184) == 87\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 76) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 76) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 76 في أي قاسم أكبر من 1.\nمثال: `phi_upto(59) == 28`\nالجواب:", "qhash": "6d6cd86a1c071317"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if w.startswith('ك'))", "tests": ["assert how_many('مدينة فجر ميناء نهار لغة') == 0", "assert how_many('مدرسة بيت بحر تفاحة فجر سوق عمل معلم') == 0", "assert how_many('رمل سلام تفاحة طائرة') == 0", "assert how_many('طالب ليل ليل') == 0", "assert how_many('بيت شمس عربية برتقال شمس علم قهوة') == 0", "assert how_many('وردة نور') == 0", "assert how_many('') == 0", "assert how_many('') == 0"], "test_code": "assert how_many('مدينة فجر ميناء نهار لغة') == 0\nassert how_many('مدرسة بيت بحر تفاحة فجر سوق عمل معلم') == 0\nassert how_many('رمل سلام تفاحة طائرة') == 0\nassert how_many('طالب ليل ليل') == 0\nassert how_many('بيت شمس عربية برتقال شمس علم قهوة') == 0\nassert how_many('وردة نور') == 0\nassert how_many('') == 0\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if w.startswith('ك'))", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if w.startswith('ك'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ك».\nمثال: `how_many('مدينة فجر ميناء نهار لغة') == 0`\nالجواب:", "qhash": "9da0e5e55c4bc272"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 27491\nsteps = 0\nwhile m > 14:\n    m = m // 4\n    steps += 1\nprint(m, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 27491\nsteps = 0\nwhile m > 14:\n    m = m // 4\n    steps += 1\nprint(m, steps)\n```\nالجواب:", "qhash": "2e13a8c74abd1a2e", "answer": "6 6", "completion": " الناتج:\n```text\n6 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x * 3 + -10 for x in range(-4, 4) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x * 3 + -10 for x in range(-4, 4) if x % 4 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "4e15003e51781fc5", "answer": "[-19, -7]\n2 -26", "completion": " الناتج:\n```text\n[-19, -7]\n2 -26\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 193\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 193\ncount = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "e39579c423e2187a", "answer": "119", "completion": " الناتج:\n```text\n119\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'عربية طائرة'\nprint('ا' in kalima)\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'عربية طائرة'\nprint('ا' in kalima)\nprint(kalima.split())\nprint(kalima.replace(' ', '-'))\n```\nالجواب:", "qhash": "32f5bfeb0decf193", "answer": "True\n['عربية', 'طائرة']\nعربية-طائرة", "completion": " الناتج:\n```text\nTrue\n['عربية', 'طائرة']\nعربية-طائرة\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprime_count", "reference": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)", "tests": ["assert coprime_count(71) == 65", "assert coprime_count(171) == 156", "assert coprime_count(29) == 27", "assert coprime_count(172) == 157", "assert coprime_count(142) == 130", "assert coprime_count(105) == 96", "assert coprime_count(1) == 1"], "test_code": "assert coprime_count(71) == 65\nassert coprime_count(171) == 156\nassert coprime_count(29) == 27\nassert coprime_count(172) == 157\nassert coprime_count(142) == 130\nassert coprime_count(105) == 96\nassert coprime_count(1) == 1", "answer": "def coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)", "completion": " ```python\ndef coprime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 11) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 11 في أي قاسم أكبر من 1.\nمثال: `coprime_count(71) == 65`\nالجواب:", "qhash": "eb1000d3fc2e26d7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'مطر'\nprint(len(text.replace(' ', '')))\nprint(text[-1])\nprint(text.count('ب'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'مطر'\nprint(len(text.replace(' ', '')))\nprint(text[-1])\nprint(text.count('ب'))\n```\nالجواب:", "qhash": "7440cc65166c1637", "answer": "3\nر\n0", "completion": " الناتج:\n```text\n3\nر\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 19\nfor x in range(10, 23, 2):\n    result += x * 8\nprint(result)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 19\nfor x in range(10, 23, 2):\n    result += x * 8\nprint(result)\nprint(x)\n```\nالجواب:", "qhash": "f9e4ff087898dbe3", "answer": "915\n22", "completion": " الناتج:\n```text\n915\n22\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "acc = 0\nfor x in range(6, 11, 3):\n    acc -= x * 3\nprint(acc)\nprint(x)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nacc = 0\nfor x in range(6, 11, 3):\n    acc -= x * 3\nprint(acc)\nprint(x)\n```\nالجواب:", "qhash": "e0cde4f3f6cb54a1", "answer": "-45\n9", "completion": " الناتج:\n```text\n-45\n9\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "caesar", "reference": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert caesar('planet we a code falcon') == 'mixkbq tb x zlab cxizlk'", "assert caesar('orange at in rocket') == 'loxkdb xq fk olzhbq'", "assert caesar('matrix') == 'jxqofu'", "assert caesar('python pixel A1') == 'mvqelk mfubi A1'", "assert caesar('engine camel is python') == 'bkdfkb zxjbi fp mvqelk'", "assert caesar('river engine on brain a') == 'ofsbo bkdfkb lk yoxfk x'", "assert caesar('') == ''"], "test_code": "assert caesar('planet we a code falcon') == 'mixkbq tb x zlab cxizlk'\nassert caesar('orange at in rocket') == 'loxkdb xq fk olzhbq'\nassert caesar('matrix') == 'jxqofu'\nassert caesar('python pixel A1') == 'mvqelk mfubi A1'\nassert caesar('engine camel is python') == 'bkdfkb zxjbi fp mvqelk'\nassert caesar('river engine on brain a') == 'ofsbo bkdfkb lk yoxfk x'\nassert caesar('') == ''", "answer": "def caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef caesar(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-3)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `caesar` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 3 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `caesar('planet we a code falcon') == 'mixkbq tb x zlab cxizlk'`\nالجواب:", "qhash": "3cde3bfcfbeabe51"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "value_at", "reference": "def value_at(x):\n    return 6 * x ** 2 + (-7) * x + (-8)", "tests": ["assert value_at(10) == 522", "assert value_at(-4) == 116", "assert value_at(-14) == 1266", "assert value_at(-20) == 2532", "assert value_at(13) == 915", "assert value_at(17) == 1607", "assert value_at(-20) == 2532", "assert value_at(0) == -8"], "test_code": "assert value_at(10) == 522\nassert value_at(-4) == 116\nassert value_at(-14) == 1266\nassert value_at(-20) == 2532\nassert value_at(13) == 915\nassert value_at(17) == 1607\nassert value_at(-20) == 2532\nassert value_at(0) == -8", "answer": "def value_at(x):\n    return 6 * x ** 2 + (-7) * x + (-8)", "completion": " ```python\ndef value_at(x):\n    return 6 * x ** 2 + (-7) * x + (-8)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `value_at` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 6x² - 7x - 8.\nمثال: `value_at(10) == 522`\nالجواب:", "qhash": "39bbfc85fb5c90d9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_in_text", "reference": "def count_in_text(text):\n    return text.count('ق')", "tests": ["assert count_in_text('جمل جبل صديق صديق ميناء') == 2", "assert count_in_text('') == 0", "assert count_in_text('خبز نهر مدرسة قهوة برتقال فجر طائرة') == 2", "assert count_in_text('طالب رمل فجر مدينة عمل قلم') == 1", "assert count_in_text('') == 0", "assert count_in_text('معلم شجرة مدرسة طالب جبل كتاب') == 0", "assert count_in_text('') == 0", "assert count_in_text('') == 0"], "test_code": "assert count_in_text('جمل جبل صديق صديق ميناء') == 2\nassert count_in_text('') == 0\nassert count_in_text('خبز نهر مدرسة قهوة برتقال فجر طائرة') == 2\nassert count_in_text('طالب رمل فجر مدينة عمل قلم') == 1\nassert count_in_text('') == 0\nassert count_in_text('معلم شجرة مدرسة طالب جبل كتاب') == 0\nassert count_in_text('') == 0\nassert count_in_text('') == 0", "answer": "def count_in_text(text):\n    return text.count('ق')", "completion": " ```python\ndef count_in_text(text):\n    return text.count('ق')\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_in_text` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد مرات ظهور الحرف «ق» في النص.\nمثال: `count_in_text('جمل جبل صديق صديق ميناء') == 2`\nالجواب:", "qhash": "b5b5d2cc2e4d26c5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_matching", "reference": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 5 != 0:\n            count += 1\n    return count", "tests": ["assert count_matching([48, 9, 17, 11, 87, 89, 55, 54, 23, 81]) == 5", "assert count_matching([-21, -28, 16, 17, 83, 24]) == 2", "assert count_matching([37]) == 0", "assert count_matching([-24, 88, -32, -29, 79, 69]) == 2", "assert count_matching([0, 25, 2, -23, -4, 41, 5, 66, 41, 68, 34]) == 1", "assert count_matching([77]) == 0", "assert count_matching([]) == 0"], "test_code": "assert count_matching([48, 9, 17, 11, 87, 89, 55, 54, 23, 81]) == 5\nassert count_matching([-21, -28, 16, 17, 83, 24]) == 2\nassert count_matching([37]) == 0\nassert count_matching([-24, 88, -32, -29, 79, 69]) == 2\nassert count_matching([0, 25, 2, -23, -4, 41, 5, 66, 41, 68, 34]) == 1\nassert count_matching([77]) == 0\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 5 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 5 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 5. اكتب الحل كاملًا.\n```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_matching([48, 9, 17, 11, 87, 89, 55, 54, 23, 81]) == 5`\nالجواب:", "qhash": "a8f56806f08f707c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([14, 11, 9, 30, 88, 54, 3, 1, 5]) == 1", "assert tally_div([33]) == 0", "assert tally_div([-2, -11]) == 0", "assert tally_div([24, 41, 36]) == 0", "assert tally_div([-27, 83, 50, -5, -13, 12, -21, 23, -6]) == 2", "assert tally_div([-27, -18, 18]) == 0", "assert tally_div([]) == 0"], "test_code": "assert tally_div([14, 11, 9, 30, 88, 54, 3, 1, 5]) == 1\nassert tally_div([33]) == 0\nassert tally_div([-2, -11]) == 0\nassert tally_div([24, 41, 36]) == 0\nassert tally_div([-27, 83, 50, -5, -13, 12, -21, 23, -6]) == 2\nassert tally_div([-27, -18, 18]) == 0\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 5 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 5 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([14, 11, 9, 30, 88, 54, 3, 1, 5]) == 1`\nالجواب:", "qhash": "a68ecde40987b985"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 16\nfor i in range(-4, 15, 1):\n    result += i * 3\nprint(result)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 16\nfor i in range(-4, 15, 1):\n    result += i * 3\nprint(result)\nprint(i)\n```\nالجواب:", "qhash": "1e52d54c84b12b1c", "answer": "301\n14", "completion": " الناتج:\n```text\n301\n14\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('منى', 53), ('هدى', 34), ('مريم', 88), ('خالد', 33)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('منى', 53), ('هدى', 34), ('مريم', 88), ('خالد', 33)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "f046bf6cb975df7c", "answer": "[('خالد', 33), ('هدى', 34), ('منى', 53), ('مريم', 88)]\n['مريم', 'منى']", "completion": " الناتج:\n```text\n[('خالد', 33), ('هدى', 34), ('منى', 53), ('مريم', 88)]\n['مريم', 'منى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ب'):\n            count += 1\n    return count", "tests": ["assert count_prefix('باب بيت نهر برتقال مطر ماء') == 3", "assert count_prefix('مدرسة صحراء علم برتقال') == 1", "assert count_prefix('جبل ليل بيت مدينة خبز رمل قلم') == 1", "assert count_prefix('مكتبة فجر') == 0", "assert count_prefix('وردة بحر مطر مكتبة') == 1", "assert count_prefix('باب ميناء معلم كتاب حديقة') == 1", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('باب بيت نهر برتقال مطر ماء') == 3\nassert count_prefix('مدرسة صحراء علم برتقال') == 1\nassert count_prefix('جبل ليل بيت مدينة خبز رمل قلم') == 1\nassert count_prefix('مكتبة فجر') == 0\nassert count_prefix('وردة بحر مطر مكتبة') == 1\nassert count_prefix('باب ميناء معلم كتاب حديقة') == 1\nassert count_prefix('') == 0", "answer": "def count_prefix(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ب'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ب'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('ب'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ب»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('ب'):\n            count += 1\n    return count\n```\nمثال: `count_prefix('باب بيت نهر برتقال مطر ماء') == 3`\nالجواب:", "qhash": "a38ba6ae88bf0e82"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "nums = [36, -9, 37, 5, 36, 11, 25, -13]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [36, -9, 37, 5, 36, 11, 25, -13]\nprint(sorted(nums, key=lambda x: (abs(x - -6), x)))\nprint(sorted(nums, reverse=True)[:3])\n```\nالجواب:", "qhash": "bd3237e0b0d747c0", "answer": "[-9, -13, 5, 11, 25, 36, 36, 37]\n[37, 36, 36]", "completion": " الناتج:\n```text\n[-9, -13, 5, 11, 25, 36, 36, 37]\n[37, 36, 36]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "filter_range", "reference": "def filter_range(xs):\n    return sorted(x * -4 for x in xs if -4 <= x <= 15)", "tests": ["assert filter_range([16, 7, 12, -2, -9, 20, -12, 10, -9]) == [-48, -40, -28, 8]", "assert filter_range([]) == []", "assert filter_range([20, 52, 14]) == [-56]", "assert filter_range([]) == []", "assert filter_range([12, 1, 43, -2, 55, -29]) == [-48, -4, 8]", "assert filter_range([-29, -9]) == []", "assert filter_range([27, 22, 31, -1, 19, 6, 41]) == [-24, 4]", "assert filter_range([]) == []"], "test_code": "assert filter_range([16, 7, 12, -2, -9, 20, -12, 10, -9]) == [-48, -40, -28, 8]\nassert filter_range([]) == []\nassert filter_range([20, 52, 14]) == [-56]\nassert filter_range([]) == []\nassert filter_range([12, 1, 43, -2, 55, -29]) == [-48, -4, 8]\nassert filter_range([-29, -9]) == []\nassert filter_range([27, 22, 31, -1, 19, 6, 41]) == [-24, 4]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n    return sorted(x * -4 for x in xs if -4 <= x <= 15)", "completion": " ```python\ndef filter_range(xs):\n    return sorted(x * -4 for x in xs if -4 <= x <= 15)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `filter_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [-4, 15].\nمثال: `filter_range([16, 7, 12, -2, -9, 20, -12, 10, -9]) == [-48, -40, -28, 8]`\nالجواب:", "qhash": "b2cb6dedb2a2d2e8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "game", "reference": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert game(27) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue', '17', 'Red', '19', '20', '21', '22', '23', 'RedBlue', '25', '26', '27']", "assert game(10) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10']", "assert game(23) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue', '17', 'Red', '19', '20', '21', '22', '23']", "assert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue']", "assert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue']"], "test_code": "assert game(27) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue', '17', 'Red', '19', '20', '21', '22', '23', 'RedBlue', '25', '26', '27']\nassert game(10) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10']\nassert game(23) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue', '17', 'Red', '19', '20', '21', '22', '23']\nassert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue']\nassert game(16) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue']", "answer": "def game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef game(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 6 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `game` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 6 تصبح 'Red'، مضاعفات 8 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `game(27) == ['1', '2', '3', '4', '5', 'Red', '7', 'Blue', '9', '10', '11', 'Red', '13', '14', '15', 'Blue', '17', 'Red', '19', '20', '21', '22', '23', 'RedBlue', '25', '26', '27']`\nالجواب:", "qhash": "756de398aeed39c7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * -2 + 2 for x in range(6, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * -2 + 2 for x in range(6, 11) if x % 2 == 1]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "9e081148b8154bbc", "answer": "[-12, -16]\n2 -28", "completion": " الناتج:\n```text\n[-12, -16]\n2 -28\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 2 for d in str(n)) % 17", "tests": ["assert digit_score(20898) == 9", "assert digit_score(562421) == 1", "assert digit_score(288153) == 14", "assert digit_score(49080) == 8", "assert digit_score(951386) == 12", "assert digit_score(120331) == 7", "assert digit_score(116150) == 13", "assert digit_score(0) == 0"], "test_code": "assert digit_score(20898) == 9\nassert digit_score(562421) == 1\nassert digit_score(288153) == 14\nassert digit_score(49080) == 8\nassert digit_score(951386) == 12\nassert digit_score(120331) == 7\nassert digit_score(116150) == 13\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 2 for d in str(n)) % 17", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 2 for d in str(n)) % 17\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 17.\nمثال: `digit_score(20898) == 9`\nالجواب:", "qhash": "a1f6e279633f24d8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'سلام'\nprint(kalima.find('س'))\nprint(kalima[::-1])\nprint(kalima.count('س'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'سلام'\nprint(kalima.find('س'))\nprint(kalima[::-1])\nprint(kalima.count('س'))\n```\nالجواب:", "qhash": "9a7309eb6ecfa15d", "answer": "0\nمالس\n1", "completion": " الناتج:\n```text\n0\nمالس\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([60, 31, 2, 8, 72, 30, 39]) == 1", "assert count_div([-16, 44, 74]) == 0", "assert count_div([24, 20, 26, 46, 64, 3, 57]) == 0", "assert count_div([30, -6]) == 2", "assert count_div([-19, 63, 47, 68, 82, 22, -27, 71, -17, -8]) == 0", "assert count_div([50, -9, 88, -16, 15, 77, 10, 21]) == 0", "assert count_div([]) == 0"], "test_code": "assert count_div([60, 31, 2, 8, 72, 30, 39]) == 1\nassert count_div([-16, 44, 74]) == 0\nassert count_div([24, 20, 26, 46, 64, 3, 57]) == 0\nassert count_div([30, -6]) == 2\nassert count_div([-19, 63, 47, 68, 82, 22, -27, 71, -17, -8]) == 0\nassert count_div([50, -9, 88, -16, 15, 77, 10, 21]) == 0\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 6 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 6 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([60, 31, 2, 8, 72, 30, 39]) == 1`\nالجواب:", "qhash": "f91f7094b3ad0755"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 9\nfor j in range(-1, 7, 1):\n    s -= j * 5\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 9\nfor j in range(-1, 7, 1):\n    s -= j * 5\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "a5ffc8262ed2be39", "answer": "-91\n6", "completion": " الناتج:\n```text\n-91\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "rel_prime_count", "reference": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 39) == 1)", "tests": ["assert rel_prime_count(59) == 37", "assert rel_prime_count(33) == 20", "assert rel_prime_count(10) == 7", "assert rel_prime_count(123) == 76", "assert rel_prime_count(84) == 52", "assert rel_prime_count(80) == 50", "assert rel_prime_count(1) == 1"], "test_code": "assert rel_prime_count(59) == 37\nassert rel_prime_count(33) == 20\nassert rel_prime_count(10) == 7\nassert rel_prime_count(123) == 76\nassert rel_prime_count(84) == 52\nassert rel_prime_count(80) == 50\nassert rel_prime_count(1) == 1", "answer": "def rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 39) == 1)", "completion": " ```python\ndef rel_prime_count(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 39) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rel_prime_count` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 39 في أي قاسم أكبر من 1.\nمثال: `rel_prime_count(59) == 37`\nالجواب:", "qhash": "03859bc10b57ecc6"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'سفينة'\nprint(text.replace(' ', '-'))\nprint(len(text.replace(' ', '')))\nprint(text.find('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'سفينة'\nprint(text.replace(' ', '-'))\nprint(len(text.replace(' ', '')))\nprint(text.find('ر'))\n```\nالجواب:", "qhash": "ef79390106933729", "answer": "سفينة\n5\n-1", "completion": " الناتج:\n```text\nسفينة\n5\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'ليلى': 17, 'سلمى': 33, 'يوسف': 50}\nd['يوسف'] += 2\nd['راشد'] = 20\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('خالد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'ليلى': 17, 'سلمى': 33, 'يوسف': 50}\nd['يوسف'] += 2\nd['راشد'] = 20\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('خالد', -1))\n```\nالجواب:", "qhash": "177d33714b48354c", "answer": "4\nيوسف\n122\n-1", "completion": " الناتج:\n```text\n4\nيوسف\n122\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "mirror_words", "reference": "def mirror_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "tests": ["assert mirror_words('data planet orange coffee signal') == 'signal_coffee_orange_planet_data'", "assert mirror_words('falcon we') == 'falcon'", "assert mirror_words('python banana winter falcon music signal') == 'signal_music_falcon_winter_banana_python'", "assert mirror_words('stone python') == 'python_stone'", "assert mirror_words('a matrix data falcon falcon at summer') == 'summer_falcon_falcon_data_matrix'", "assert mirror_words('') == ''", "assert mirror_words('up stone python') == 'python_stone'"], "test_code": "assert mirror_words('data planet orange coffee signal') == 'signal_coffee_orange_planet_data'\nassert mirror_words('falcon we') == 'falcon'\nassert mirror_words('python banana winter falcon music signal') == 'signal_music_falcon_winter_banana_python'\nassert mirror_words('stone python') == 'python_stone'\nassert mirror_words('a matrix data falcon falcon at summer') == 'summer_falcon_falcon_data_matrix'\nassert mirror_words('') == ''\nassert mirror_words('up stone python') == 'python_stone'", "answer": "def mirror_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 3][::-1])", "completion": " ```python\ndef mirror_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 3][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `mirror_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 3 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `mirror_words('data planet orange coffee signal') == 'signal_coffee_orange_planet_data'`\nالجواب:", "qhash": "52debced027b5d62"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([30, 31, 21, 3, 5, 30, 67, 51]) == [30, 61, 82, 85, 90, 120, 0, 51]", "assert rolling_total([130, 17, 71, 88, -1, 134, 76, 38]) == [130, 0, 71, 0, -1, 133, 0, 38]", "assert rolling_total([]) == []", "assert rolling_total([28, 33]) == [28, 61]", "assert rolling_total([50, 2, 116, 99]) == [50, 52, 0, 99]", "assert rolling_total([129]) == [129]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([30, 31, 21, 3, 5, 30, 67, 51]) == [30, 61, 82, 85, 90, 120, 0, 51]\nassert rolling_total([130, 17, 71, 88, -1, 134, 76, 38]) == [130, 0, 71, 0, -1, 133, 0, 38]\nassert rolling_total([]) == []\nassert rolling_total([28, 33]) == [28, 61]\nassert rolling_total([50, 2, 116, 99]) == [50, 52, 0, 99]\nassert rolling_total([129]) == [129]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 138:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 138 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([30, 31, 21, 3, 5, 30, 67, 51]) == [30, 61, 82, 85, 90, 120, 0, 51]`\nالجواب:", "qhash": "b84cfc8b849a824b"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'شمس خبز'\nprint(kalima[::-1])\nprint(kalima[0])\nprint(kalima.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'شمس خبز'\nprint(kalima[::-1])\nprint(kalima[0])\nprint(kalima.split())\n```\nالجواب:", "qhash": "95effa6001913a41", "answer": "زبخ سمش\nش\n['شمس', 'خبز']", "completion": " الناتج:\n```text\nزبخ سمش\nش\n['شمس', 'خبز']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=9):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(f(9))\nprint(f(9, 20))\nprint(f(f(20), 9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=9):\n    if x > y:\n        return x * -4 - y\n    return x + y * -4\n\nprint(f(9))\nprint(f(9, 20))\nprint(f(f(20), 9))\n```\nالجواب:", "qhash": "03ac184e97c452c2", "answer": "-27\n-71\n-125", "completion": " الناتج:\n```text\n-27\n-71\n-125\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_matching", "reference": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert count_matching([76, 35, 37, 30, 69, 10, 26]) == 0", "assert count_matching([-16, 84, -32, -10, 8, 53, 0, 36, -23, -21, 43]) == 0", "assert count_matching([89, 70, 89, -11, 0]) == 0", "assert count_matching([40, -10, 57, -21, -11, 37, 44, 37, -17, -30, 89, 52]) == 0", "assert count_matching([-18, -19, 54, 54, 29, 49, 90, 65, 27, -35, 49, 80]) == 5", "assert count_matching([73, -37, 51, 46, 56, 68, -10, 89, 47, 67, -37, -9]) == 1", "assert count_matching([]) == 0"], "test_code": "assert count_matching([76, 35, 37, 30, 69, 10, 26]) == 0\nassert count_matching([-16, 84, -32, -10, 8, 53, 0, 36, -23, -21, 43]) == 0\nassert count_matching([89, 70, 89, -11, 0]) == 0\nassert count_matching([40, -10, 57, -21, -11, 37, 44, 37, -17, -30, 89, 52]) == 0\nassert count_matching([-18, -19, 54, 54, 29, 49, 90, 65, 27, -35, 49, 80]) == 5\nassert count_matching([73, -37, 51, 46, 56, 68, -10, 89, 47, 67, -37, -9]) == 1\nassert count_matching([]) == 0", "answer": "def count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if x % 9 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 9 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef count_matching(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_matching([76, 35, 37, 30, 69, 10, 26]) == 0`\nالجواب:", "qhash": "1dd182b04ea0d64f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "multi_fact", "reference": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 4)) % 83", "tests": ["assert multi_fact(12) == 52", "assert multi_fact(1) == 1", "assert multi_fact(54) == 48", "assert multi_fact(9) == 45", "assert multi_fact(26) == 80", "assert multi_fact(51) == 78", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(12) == 52\nassert multi_fact(1) == 1\nassert multi_fact(54) == 48\nassert multi_fact(9) == 45\nassert multi_fact(26) == 80\nassert multi_fact(51) == 78\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 4)) % 83", "completion": " ```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 4)) % 83\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 83 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `multi_fact(12) == 52`\nالجواب:", "qhash": "4c41a566d01a14c0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x ** 2 - 3 for x in range(1, 6) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x ** 2 - 3 for x in range(1, 6) if x % 4 == 2]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "8fec308e046df401", "answer": "[1]\n1 1", "completion": " الناتج:\n```text\n[1]\n1 1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n <= 0:\n        return 3\n    return 2 * f(n - 1) + -3\n\nprint(f(9))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n <= 0:\n        return 3\n    return 2 * f(n - 1) + -3\n\nprint(f(9))\n```\nالجواب:", "qhash": "c8b110bad7abf9af", "answer": "3", "completion": " الناتج:\n```text\n3\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def f(x, y=6):\n    if x > y:\n        return x * 7 - y\n    return x + y * 7\n\nprint(f(4))\nprint(f(4, 8))\nprint(f(f(8), 4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(x, y=6):\n    if x > y:\n        return x * 7 - y\n    return x + y * 7\n\nprint(f(4))\nprint(f(4, 8))\nprint(f(f(8), 4))\n```\nالجواب:", "qhash": "7ed2ec7f060ffc11", "answer": "46\n60\n346", "completion": " الناتج:\n```text\n46\n60\n346\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "pow_digits", "reference": "def pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 81", "tests": ["assert pow_digits(27206) == 8", "assert pow_digits(881100) == 54", "assert pow_digits(374525) == 44", "assert pow_digits(502812) == 6", "assert pow_digits(763964) == 56", "assert pow_digits(441386) == 74", "assert pow_digits(557390) == 53", "assert pow_digits(0) == 0"], "test_code": "assert pow_digits(27206) == 8\nassert pow_digits(881100) == 54\nassert pow_digits(374525) == 44\nassert pow_digits(502812) == 6\nassert pow_digits(763964) == 56\nassert pow_digits(441386) == 74\nassert pow_digits(557390) == 53\nassert pow_digits(0) == 0", "answer": "def pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 81", "completion": " ```python\ndef pow_digits(n):\n    return sum(int(d) ** 3 for d in str(n)) % 81\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pow_digits` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 81.\nمثال: `pow_digits(27206) == 8`\nالجواب:", "qhash": "b9657947c51f3168"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 96", "tests": ["assert sum_digit_pow(95356) == 70", "assert sum_digit_pow(569449) == 7", "assert sum_digit_pow(158813) == 26", "assert sum_digit_pow(72657) == 75", "assert sum_digit_pow(613642) == 52", "assert sum_digit_pow(810387) == 51", "assert sum_digit_pow(152277) == 60", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(95356) == 70\nassert sum_digit_pow(569449) == 7\nassert sum_digit_pow(158813) == 26\nassert sum_digit_pow(72657) == 75\nassert sum_digit_pow(613642) == 52\nassert sum_digit_pow(810387) == 51\nassert sum_digit_pow(152277) == 60\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 96", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 96\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 96.\nمثال: `sum_digit_pow(95356) == 70`\nالجواب:", "qhash": "7575bc1ab5f88dd7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'زينب': 11, 'فيصل': 27, 'هدى': 25, 'هشام': 10, 'عمر': 33}\nmarks['فيصل'] += 15\nmarks['رنا'] = 55\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'زينب': 11, 'فيصل': 27, 'هدى': 25, 'هشام': 10, 'عمر': 33}\nmarks['فيصل'] += 15\nmarks['رنا'] = 55\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "f3010e707da7a6e7", "answer": "6\nرنا\n176\n[('هشام', 10), ('زينب', 11)]", "completion": " الناتج:\n```text\n6\nرنا\n176\n[('هشام', 10), ('زينب', 11)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 2)) % 59", "tests": ["assert mfact(8) == 30", "assert mfact(16) == 47", "assert mfact(60) == 58", "assert mfact(58) == 58", "assert mfact(53) == 37", "assert mfact(22) == 9", "assert mfact(0) == 1"], "test_code": "assert mfact(8) == 30\nassert mfact(16) == 47\nassert mfact(60) == 58\nassert mfact(58) == 58\nassert mfact(53) == 37\nassert mfact(22) == 9\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 2)) % 59", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 2)) % 59\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 59 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(8) == 30`\nالجواب:", "qhash": "6210c8ef85832011"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'حصان بيت'\nprint(len(text.replace(' ', '')))\nprint(text.count('ر'))\nprint(len(text))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'حصان بيت'\nprint(len(text.replace(' ', '')))\nprint(text.count('ر'))\nprint(len(text))\n```\nالجواب:", "qhash": "d53b875a7694b8d0", "answer": "7\n0\n8", "completion": " الناتج:\n```text\n7\n0\n8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rot", "reference": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rot('is by window it') == 'gq zw uglbmu gr'", "assert rot('apple a planet') == 'ynnjc y njylcr'", "assert rot('light python pixel summer') == 'jgefr nwrfml ngvcj qskkcp'", "assert rot('summer') == 'qskkcp'", "assert rot('on summer pixel') == 'ml qskkcp ngvcj'", "assert rot('to rocket summer') == 'rm pmaicr qskkcp'", "assert rot('') == ''"], "test_code": "assert rot('is by window it') == 'gq zw uglbmu gr'\nassert rot('apple a planet') == 'ynnjc y njylcr'\nassert rot('light python pixel summer') == 'jgefr nwrfml ngvcj qskkcp'\nassert rot('summer') == 'qskkcp'\nassert rot('on summer pixel') == 'ml qskkcp ngvcj'\nassert rot('to rocket summer') == 'rm pmaicr qskkcp'\nassert rot('') == ''", "answer": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-2)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rot` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 2 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('is by window it') == 'gq zw uglbmu gr'`\nالجواب:", "qhash": "5dcdfe9d2424c649"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "flip_words", "reference": "def flip_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "tests": ["assert flip_words('an camel matrix banana music go river at') == 'river-music-banana-matrix-camel'", "assert flip_words('desert is river') == 'river-desert'", "assert flip_words('engine window is pixel an') == 'pixel-window-engine'", "assert flip_words('python light') == 'light-python'", "assert flip_words('desert python summer in it') == 'summer-python-desert'", "assert flip_words('stone coffee planet stone an') == 'stone-planet-coffee-stone'", "assert flip_words('') == ''"], "test_code": "assert flip_words('an camel matrix banana music go river at') == 'river-music-banana-matrix-camel'\nassert flip_words('desert is river') == 'river-desert'\nassert flip_words('engine window is pixel an') == 'pixel-window-engine'\nassert flip_words('python light') == 'light-python'\nassert flip_words('desert python summer in it') == 'summer-python-desert'\nassert flip_words('stone coffee planet stone an') == 'stone-planet-coffee-stone'\nassert flip_words('') == ''", "answer": "def flip_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])", "completion": " ```python\ndef flip_words(s):\n    return '-'.join([w for w in s.split() if len(w) >= 5][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `flip_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 5 من آخرها إلى أولها، موصولة بالفاصل '-'.\nمثال: `flip_words('an camel matrix banana music go river at') == 'river-music-banana-matrix-camel'`\nالجواب:", "qhash": "63bb1d1e208c4198"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('window music apple coffee Hello') == 'frwmxf vdbrl jyyun lxoonn Hnuux'", "assert encode('pixel stone pixel camel') == 'yrgnu bcxwn yrgnu ljvnu'", "assert encode('falcon we on coffee to') == 'ojulxw fn xw lxoonn cx'", "assert encode('up falcon engine an OK') == 'dy ojulxw nwprwn jw OK'", "assert encode('matrix window OK') == 'vjcarg frwmxf OK'", "assert encode('orange data a winter') == 'xajwpn mjcj j frwcna'", "assert encode('') == ''"], "test_code": "assert encode('window music apple coffee Hello') == 'frwmxf vdbrl jyyun lxoonn Hnuux'\nassert encode('pixel stone pixel camel') == 'yrgnu bcxwn yrgnu ljvnu'\nassert encode('falcon we on coffee to') == 'ojulxw fn xw lxoonn cx'\nassert encode('up falcon engine an OK') == 'dy ojulxw nwprwn jw OK'\nassert encode('matrix window OK') == 'vjcarg frwmxf OK'\nassert encode('orange data a winter') == 'xajwpn mjcj j frwcna'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-17)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 17 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('window music apple coffee Hello') == 'frwmxf vdbrl jyyun lxoonn Hnuux'`\nالجواب:", "qhash": "17a0b61f19f0342d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'orange'\nprint(word.count('n'))\nprint(word[2:5])\nprint(word.replace('n', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'orange'\nprint(word.count('n'))\nprint(word[2:5])\nprint(word.replace('n', '#'))\n```\nالجواب:", "qhash": "3d6077cf9b5cd0a4", "answer": "1\nang\nora#ge", "completion": " الناتج:\n```text\n1\nang\nora#ge\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "tally_div", "reference": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "tests": ["assert tally_div([66, 82, 82, 48, 19, 44, 24, 0]) == 1", "assert tally_div([73, 81, 65]) == 0", "assert tally_div([-27, -12, 51, 68, 30, 79, 2, 40]) == 2", "assert tally_div([64, -9, 79, 74, -13, 81, -25]) == 1", "assert tally_div([-25, 14, -28, 37, 71, 67, -1]) == 1", "assert tally_div([50, 65, 65, 28, -15, -34, -19, 31, -26, 84, -3, -39]) == 1", "assert tally_div([]) == 0"], "test_code": "assert tally_div([66, 82, 82, 48, 19, 44, 24, 0]) == 1\nassert tally_div([73, 81, 65]) == 0\nassert tally_div([-27, -12, 51, 68, 30, 79, 2, 40]) == 2\nassert tally_div([64, -9, 79, 74, -13, 81, -25]) == 1\nassert tally_div([-25, 14, -28, 37, 71, 67, -1]) == 1\nassert tally_div([50, 65, 65, 28, -15, -34, -19, 31, -26, 84, -3, -39]) == 1\nassert tally_div([]) == 0", "answer": "def tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 3 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 3. اكتب الحل كاملًا.\n```python\ndef tally_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `tally_div([66, 82, 82, 48, 19, 44, 24, 0]) == 1`\nالجواب:", "qhash": "cc9b5c7dc2d414ba"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "invert_words", "reference": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert invert_words('music window to it to we') == 'we/to/it/to/window/music'", "assert invert_words('vector apple rocket signal river on engine to') == 'to/engine/on/river/signal/rocket/apple/vector'", "assert invert_words('engine on signal signal on falcon') == 'falcon/on/signal/signal/on/engine'", "assert invert_words('matrix camel vector cloud of is') == 'is/of/cloud/vector/camel/matrix'", "assert invert_words('orange') == 'orange'", "assert invert_words('pixel falcon of on') == 'on/of/falcon/pixel'", "assert invert_words('table') == 'table'"], "test_code": "assert invert_words('music window to it to we') == 'we/to/it/to/window/music'\nassert invert_words('vector apple rocket signal river on engine to') == 'to/engine/on/river/signal/rocket/apple/vector'\nassert invert_words('engine on signal signal on falcon') == 'falcon/on/signal/signal/on/engine'\nassert invert_words('matrix camel vector cloud of is') == 'is/of/cloud/vector/camel/matrix'\nassert invert_words('orange') == 'orange'\nassert invert_words('pixel falcon of on') == 'on/of/falcon/pixel'\nassert invert_words('table') == 'table'", "answer": "def invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef invert_words(s):\n    return '/'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `invert_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '/'.\nمثال: `invert_words('music window to it to we') == 'we/to/it/to/window/music'`\nالجواب:", "qhash": "d13a0f655adb18f9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('فيصل', 81), ('سعيد', 20), ('هشام', 6), ('نور', 18)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('فيصل', 81), ('سعيد', 20), ('هشام', 6), ('نور', 18)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "19039014f364b149", "answer": "[('هشام', 6), ('نور', 18), ('سعيد', 20), ('فيصل', 81)]\n['فيصل', 'سعيد']", "completion": " الناتج:\n```text\n[('هشام', 6), ('نور', 18), ('سعيد', 20), ('فيصل', 81)]\n['فيصل', 'سعيد']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'agmo'}", "tests": ["assert letter_stats('engine vector in we engine python') == {'a': 0, 'g': 2, 'm': 0, 'o': 2}", "assert letter_stats('river by matrix a') == {'a': 2, 'g': 0, 'm': 1, 'o': 0}", "assert letter_stats('brain by') == {'a': 1, 'g': 0, 'm': 0, 'o': 0}", "assert letter_stats('music up coffee winter') == {'a': 0, 'g': 0, 'm': 1, 'o': 1}", "assert letter_stats('summer signal to engine table stone') == {'a': 2, 'g': 2, 'm': 2, 'o': 2}", "assert letter_stats('signal') == {'a': 1, 'g': 1, 'm': 0, 'o': 0}", "assert letter_stats('') == {'a': 0, 'g': 0, 'm': 0, 'o': 0}"], "test_code": "assert letter_stats('engine vector in we engine python') == {'a': 0, 'g': 2, 'm': 0, 'o': 2}\nassert letter_stats('river by matrix a') == {'a': 2, 'g': 0, 'm': 1, 'o': 0}\nassert letter_stats('brain by') == {'a': 1, 'g': 0, 'm': 0, 'o': 0}\nassert letter_stats('music up coffee winter') == {'a': 0, 'g': 0, 'm': 1, 'o': 1}\nassert letter_stats('summer signal to engine table stone') == {'a': 2, 'g': 2, 'm': 2, 'o': 2}\nassert letter_stats('signal') == {'a': 1, 'g': 1, 'm': 0, 'o': 0}\nassert letter_stats('') == {'a': 0, 'g': 0, 'm': 0, 'o': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'agmo'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'agmo'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'a'، 'g'، 'm'، 'o' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('engine vector in we engine python') == {'a': 0, 'g': 2, 'm': 0, 'o': 2}`\nالجواب:", "qhash": "1cefb7fb7f7c0316"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'بحر جبل'\nprint(w[0])\nprint(w[::-1])\nprint('ر' in w)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'بحر جبل'\nprint(w[0])\nprint(w[::-1])\nprint('ر' in w)\n```\nالجواب:", "qhash": "186d036d078d88aa", "answer": "ب\nلبج رحب\nTrue", "completion": " الناتج:\n```text\nب\nلبج رحب\nTrue\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if 'ب' in w)", "tests": ["assert how_many('برمجة نور مدرسة معلم معلم معلم جبل باب') == 3", "assert how_many('كتاب مطر معلم مطر') == 1", "assert how_many('سلام سلام مدينة طالب مدينة') == 1", "assert how_many('بحر') == 1", "assert how_many('ماء رمل مدرسة قهوة طالب باب سيارة') == 2", "assert how_many('') == 0", "assert how_many('مكتبة سيارة مدينة طائرة جبل نهار رمل') == 2", "assert how_many('') == 0"], "test_code": "assert how_many('برمجة نور مدرسة معلم معلم معلم جبل باب') == 3\nassert how_many('كتاب مطر معلم مطر') == 1\nassert how_many('سلام سلام مدينة طالب مدينة') == 1\nassert how_many('بحر') == 1\nassert how_many('ماء رمل مدرسة قهوة طالب باب سيارة') == 2\nassert how_many('') == 0\nassert how_many('مكتبة سيارة مدينة طائرة جبل نهار رمل') == 2\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if 'ب' in w)", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if 'ب' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ب» مرة واحدة على الأقل.\nمثال: `how_many('برمجة نور مدرسة معلم معلم معلم جبل باب') == 3`\nالجواب:", "qhash": "1929b7fa4c27c4a5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "char_freq", "reference": "def char_freq(s):\n    return {c: s.count(c) for c in 'his'}", "tests": ["assert char_freq('planet is brain rocket coffee') == {'h': 0, 'i': 2, 's': 1}", "assert char_freq('summer engine') == {'h': 0, 'i': 1, 's': 1}", "assert char_freq('summer planet a table') == {'h': 0, 'i': 0, 's': 1}", "assert char_freq('on garden desert we code') == {'h': 0, 'i': 0, 's': 1}", "assert char_freq('at') == {'h': 0, 'i': 0, 's': 0}", "assert char_freq('of data') == {'h': 0, 'i': 0, 's': 0}", "assert char_freq('') == {'h': 0, 'i': 0, 's': 0}"], "test_code": "assert char_freq('planet is brain rocket coffee') == {'h': 0, 'i': 2, 's': 1}\nassert char_freq('summer engine') == {'h': 0, 'i': 1, 's': 1}\nassert char_freq('summer planet a table') == {'h': 0, 'i': 0, 's': 1}\nassert char_freq('on garden desert we code') == {'h': 0, 'i': 0, 's': 1}\nassert char_freq('at') == {'h': 0, 'i': 0, 's': 0}\nassert char_freq('of data') == {'h': 0, 'i': 0, 's': 0}\nassert char_freq('') == {'h': 0, 'i': 0, 's': 0}", "answer": "def char_freq(s):\n    return {c: s.count(c) for c in 'his'}", "completion": " ```python\ndef char_freq(s):\n    return {c: s.count(c) for c in 'his'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `char_freq` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'h'، 'i'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `char_freq('planet is brain rocket coffee') == {'h': 0, 'i': 2, 's': 1}`\nالجواب:", "qhash": "aeb0abc9f9859f8a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89", "tests": ["assert step_product(6) == 48", "assert step_product(53) == 31", "assert step_product(1) == 1", "assert step_product(58) == 67", "assert step_product(60) == 15", "assert step_product(36) == 61", "assert step_product(0) == 1"], "test_code": "assert step_product(6) == 48\nassert step_product(53) == 31\nassert step_product(1) == 1\nassert step_product(58) == 67\nassert step_product(60) == 15\nassert step_product(36) == 61\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 89\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 89 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(6) == 48`\nالجواب:", "qhash": "5c6321d006ce7d50"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_start", "reference": "def count_start(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "tests": ["assert count_start('طالب قمر لغة جبل قلم') == 2", "assert count_start('قهوة سماء حصان كتاب جمل قمر قمر ماء') == 3", "assert count_start('كتاب قلم سفينة') == 1", "assert count_start('كتاب قلم سفينة قلم قلم مدينة خبز') == 3", "assert count_start('صديق دفتر نهر قمر برتقال تفاحة قلم') == 2", "assert count_start('دفتر رمل') == 0", "assert count_start('') == 0"], "test_code": "assert count_start('طالب قمر لغة جبل قلم') == 2\nassert count_start('قهوة سماء حصان كتاب جمل قمر قمر ماء') == 3\nassert count_start('كتاب قلم سفينة') == 1\nassert count_start('كتاب قلم سفينة قلم قلم مدينة خبز') == 3\nassert count_start('صديق دفتر نهر قمر برتقال تفاحة قلم') == 2\nassert count_start('دفتر رمل') == 0\nassert count_start('') == 0", "answer": "def count_start(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ق'):\n            count += 1\n    return count", "completion": " ```python\ndef count_start(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ق'):\n            count += 1\n    return count\n```\n", "buggy": "def count_start(line):\n    count = 0\n    for w in line.split():\n        if 'ق' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ق»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_start(line):\n    count = 0\n    for w in line.split():\n        if 'ق' in w:\n            count += 1\n    return count\n```\nمثال: `count_start('طالب قمر لغة جبل قلم') == 2`\nالجواب:", "qhash": "479a10ca157f3071"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 56\nsteps = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    steps += 1\nprint(steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 56\nsteps = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    steps += 1\nprint(steps)\n```\nالجواب:", "qhash": "1b1d81d93a0253fd", "answer": "19", "completion": " الناتج:\n```text\n19\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'apple_vector'\nprint(word[-3:])\nprint(word.split('_'))\nprint(word.index('a') + len(word))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'apple_vector'\nprint(word[-3:])\nprint(word.split('_'))\nprint(word.index('a') + len(word))\n```\nالجواب:", "qhash": "2a3116dcf88862f8", "answer": "tor\n['apple', 'vector']\n12", "completion": " الناتج:\n```text\ntor\n['apple', 'vector']\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x * -2 + -8 for x in range(-4, 5) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x * -2 + -8 for x in range(-4, 5) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "adcae25cf3a85ca1", "answer": "[-6, -14]\n2 -20", "completion": " الناتج:\n```text\n[-6, -14]\n2 -20\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'راشد': 46, 'حسن': 20, 'وليد': 48, 'مريم': 20}\nmarks['راشد'] += 2\nmarks['باسل'] = 14\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 19])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'راشد': 46, 'حسن': 20, 'وليد': 48, 'مريم': 20}\nmarks['راشد'] += 2\nmarks['باسل'] = 14\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint([k for k in marks if marks[k] > 19])\n```\nالجواب:", "qhash": "98b9631a1d2d7802", "answer": "5\nراشد\n150\n['راشد', 'حسن', 'وليد', 'مريم']", "completion": " الناتج:\n```text\n5\nراشد\n150\n['راشد', 'حسن', 'وليد', 'مريم']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "best_multiple", "reference": "def best_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert best_multiple([36, 4, 20, 33, 5]) == None", "assert best_multiple([-40, -40, -16]) == -16", "assert best_multiple([1]) == None", "assert best_multiple([]) == None", "assert best_multiple([-14, -20, 27]) == None", "assert best_multiple([]) == None"], "test_code": "assert best_multiple([36, 4, 20, 33, 5]) == None\nassert best_multiple([-40, -40, -16]) == -16\nassert best_multiple([1]) == None\nassert best_multiple([]) == None\nassert best_multiple([-14, -20, 27]) == None\nassert best_multiple([]) == None", "answer": "def best_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef best_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def best_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 8، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef best_multiple(values):\n    best = None\n    for x in values:\n        if x % 8 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `best_multiple([36, 4, 20, 33, 5]) == None`\nالجواب:", "qhash": "e7f5ce522c9a9a2c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_ar", "reference": "def count_ar(text):\n    return sum(1 for w in text.split() if 'ف' in w)", "tests": ["assert count_ar('جبل خبز مكتبة نهار فجر دفتر وردة قمر') == 2", "assert count_ar('جبل بحر حاسوب صحراء نهر مدرسة') == 0", "assert count_ar('ليل شمس') == 0", "assert count_ar('نهار بيت') == 0", "assert count_ar('فجر') == 1", "assert count_ar('مدرسة جبل') == 0", "assert count_ar('حديقة عمل نهار ماء') == 0", "assert count_ar('') == 0"], "test_code": "assert count_ar('جبل خبز مكتبة نهار فجر دفتر وردة قمر') == 2\nassert count_ar('جبل بحر حاسوب صحراء نهر مدرسة') == 0\nassert count_ar('ليل شمس') == 0\nassert count_ar('نهار بيت') == 0\nassert count_ar('فجر') == 1\nassert count_ar('مدرسة جبل') == 0\nassert count_ar('حديقة عمل نهار ماء') == 0\nassert count_ar('') == 0", "answer": "def count_ar(text):\n    return sum(1 for w in text.split() if 'ف' in w)", "completion": " ```python\ndef count_ar(text):\n    return sum(1 for w in text.split() if 'ف' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_ar` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ف» مرة واحدة على الأقل.\nمثال: `count_ar('جبل خبز مكتبة نهار فجر دفتر وردة قمر') == 2`\nالجواب:", "qhash": "b00a705b6b9afc19"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['brain', 'orange', 'stone', 'desert', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['brain', 'orange', 'stone', 'desert', 'rocket']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "8c3f11989a25dceb", "answer": "['brain', 'stone', 'orange', 'desert', 'rocket']\n['rocket', 'orange', 'desert']", "completion": " الناتج:\n```text\n['brain', 'stone', 'orange', 'desert', 'rocket']\n['rocket', 'orange', 'desert']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "w = 'حديقة'\nprint(w.find('ا'))\nprint('ا' in w)\nprint(w.replace(' ', '-'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nw = 'حديقة'\nprint(w.find('ا'))\nprint('ا' in w)\nprint(w.replace(' ', '-'))\n```\nالجواب:", "qhash": "d4d93b2926ccd697", "answer": "-1\nFalse\nحديقة", "completion": " الناتج:\n```text\n-1\nFalse\nحديقة\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 29", "tests": ["assert step_product(9) == 17", "assert step_product(15) == 12", "assert step_product(10) == 12", "assert step_product(17) == 1", "assert step_product(58) == 0", "assert step_product(50) == 26", "assert step_product(0) == 1"], "test_code": "assert step_product(9) == 17\nassert step_product(15) == 12\nassert step_product(10) == 12\nassert step_product(17) == 1\nassert step_product(58) == 0\nassert step_product(50) == 26\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 29", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 2)) % 29\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 29 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(9) == 17`\nالجواب:", "qhash": "0fabb27e7ab50523"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)", "tests": ["assert sum_multiples(140) == 3850", "assert sum_multiples(58) == 690", "assert sum_multiples(124) == 2940", "assert sum_multiples(84) == 1320", "assert sum_multiples(202) == 8100", "assert sum_multiples(62) == 750", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(140) == 3850\nassert sum_multiples(58) == 690\nassert sum_multiples(124) == 2940\nassert sum_multiples(84) == 1320\nassert sum_multiples(202) == 8100\nassert sum_multiples(62) == 750\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 4 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 4 أو 5 دون باقٍ.\nمثال: `sum_multiples(140) == 3850`\nالجواب:", "qhash": "8e608a4cc9aa1c46"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "nums = [14, -6, 5, 22, 36, 33, -6, 35]\nprint(nums[0:1])\nprint(nums[::-1])\nprint(max(nums[0:1]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [14, -6, 5, 22, 36, 33, -6, 35]\nprint(nums[0:1])\nprint(nums[::-1])\nprint(max(nums[0:1]))\n```\nالجواب:", "qhash": "9a12a537250651a3", "answer": "[14]\n[35, -6, 33, 36, 22, 5, -6, 14]\n14", "completion": " الناتج:\n```text\n[14]\n[35, -6, 33, 36, 22, 5, -6, 14]\n14\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 66608\nsteps = 0\nwhile x > 4:\n    x = x // 5\n    steps += 1\nprint(x, steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 66608\nsteps = 0\nwhile x > 4:\n    x = x // 5\n    steps += 1\nprint(x, steps)\n```\nالجواب:", "qhash": "8b4081d13731224d", "answer": "4 6", "completion": " الناتج:\n```text\n4 6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'خالد': 17, 'علي': 49, 'فيصل': 47}\nmarks['علي'] += 20\nmarks['حسن'] = 25\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'خالد': 17, 'علي': 49, 'فيصل': 47}\nmarks['علي'] += 20\nmarks['حسن'] = 25\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "cdccf264547ba57f", "answer": "4\nعلي\n158\n[('خالد', 17), ('حسن', 25)]", "completion": " الناتج:\n```text\n4\nعلي\n158\n[('خالد', 17), ('حسن', 25)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "reset_sum", "reference": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert reset_sum([6, 12, 8, 5, 6]) == [6, 0, 8, 13, 0]", "assert reset_sum([15, 16, -2]) == [15, 0, -2]", "assert reset_sum([14, 11, 12, 9, -2, 1, 5]) == [14, 0, 12, 0, -2, -1, 4]", "assert reset_sum([12, -10, 7, 16]) == [12, 2, 9, 0]", "assert reset_sum([-8, 15, 15, 16, -9]) == [-8, 7, 0, 16, 7]", "assert reset_sum([8, 10]) == [8, 0]", "assert reset_sum([]) == []"], "test_code": "assert reset_sum([6, 12, 8, 5, 6]) == [6, 0, 8, 13, 0]\nassert reset_sum([15, 16, -2]) == [15, 0, -2]\nassert reset_sum([14, 11, 12, 9, -2, 1, 5]) == [14, 0, 12, 0, -2, -1, 4]\nassert reset_sum([12, -10, 7, 16]) == [12, 2, 9, 0]\nassert reset_sum([-8, 15, 15, 16, -9]) == [-8, 7, 0, 16, 7]\nassert reset_sum([8, 10]) == [8, 0]\nassert reset_sum([]) == []", "answer": "def reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef reset_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `reset_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 16 (القيمة المسجلة حينها 0).\nمثال: `reset_sum([6, 12, 8, 5, 6]) == [6, 0, 8, 13, 0]`\nالجواب:", "qhash": "e660cb227a8e0cb8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "data = [15, -5, 38, 16, 37]\nprint(data[3:4])\nprint(data[::2])\nprint(sum(data[3:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndata = [15, -5, 38, 16, 37]\nprint(data[3:4])\nprint(data[::2])\nprint(sum(data[3:4]))\n```\nالجواب:", "qhash": "085431babb3103c1", "answer": "[16]\n[15, 38, 37]\n16", "completion": " الناتج:\n```text\n[16]\n[15, 38, 37]\n16\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 7\nfor i in range(4, 28, 1):\n    s += i * 4\nprint(s)\nprint(i)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 7\nfor i in range(4, 28, 1):\n    s += i * 4\nprint(s)\nprint(i)\n```\nالجواب:", "qhash": "d92669c468ebe1ae", "answer": "1495\n27", "completion": " الناتج:\n```text\n1495\n27\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "s = 'signal'\nprint(s.index('n') + len(s))\nprint(s.capitalize())\nprint(s.replace('n', '#'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'signal'\nprint(s.index('n') + len(s))\nprint(s.capitalize())\nprint(s.replace('n', '#'))\n```\nالجواب:", "qhash": "c102ab4361bb2da0", "answer": "9\nSignal\nsig#al", "completion": " الناتج:\n```text\n9\nSignal\nsig#al\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * 2 for x in xs if -11 <= x <= 0)", "tests": ["assert select_range([-6, 8, -16, -18, -2, -2, -10, -17]) == [-20, -12, -4, -4]", "assert select_range([37, -27, 7, -10]) == [-20]", "assert select_range([46, 45, 58, -19, 27, 38]) == []", "assert select_range([-16, -26, 4, 21, -24, 38]) == []", "assert select_range([19]) == []", "assert select_range([5, 35, -27, -22, -19, 54]) == []", "assert select_range([13, 57]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-6, 8, -16, -18, -2, -2, -10, -17]) == [-20, -12, -4, -4]\nassert select_range([37, -27, 7, -10]) == [-20]\nassert select_range([46, 45, 58, -19, 27, 38]) == []\nassert select_range([-16, -26, 4, 21, -24, 38]) == []\nassert select_range([19]) == []\nassert select_range([5, 35, -27, -22, -19, 54]) == []\nassert select_range([13, 57]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * 2 for x in xs if -11 <= x <= 0)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * 2 for x in xs if -11 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 2 لكل عنصر x في المدى المغلق [-11, 0].\nمثال: `select_range([-6, 8, -16, -18, -2, -2, -10, -17]) == [-20, -12, -4, -4]`\nالجواب:", "qhash": "80e7b35b80f33f73"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "running_sum", "reference": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 147:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert running_sum([30, 13, 16, 6, 52, 36, 25]) == [30, 43, 59, 65, 117, 0, 25]", "assert running_sum([129, 7, -10, 139, 23, 71, 115, 120, 44]) == [129, 136, 126, 0, 23, 94, 0, 120, 0]", "assert running_sum([26, -3, 76, 17, 18]) == [26, 23, 99, 116, 134]", "assert running_sum([8, 65, 139, 24, 4, 58]) == [8, 73, 0, 24, 28, 86]", "assert running_sum([23, 70]) == [23, 93]", "assert running_sum([93, 135, 2, 144, 125]) == [93, 0, 2, 146, 0]", "assert running_sum([]) == []"], "test_code": "assert running_sum([30, 13, 16, 6, 52, 36, 25]) == [30, 43, 59, 65, 117, 0, 25]\nassert running_sum([129, 7, -10, 139, 23, 71, 115, 120, 44]) == [129, 136, 126, 0, 23, 94, 0, 120, 0]\nassert running_sum([26, -3, 76, 17, 18]) == [26, 23, 99, 116, 134]\nassert running_sum([8, 65, 139, 24, 4, 58]) == [8, 73, 0, 24, 28, 86]\nassert running_sum([23, 70]) == [23, 93]\nassert running_sum([93, 135, 2, 144, 125]) == [93, 0, 2, 146, 0]\nassert running_sum([]) == []", "answer": "def running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 147:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef running_sum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 147:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `running_sum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 147 (القيمة المسجلة حينها 0).\nمثال: `running_sum([30, 13, 16, 6, 52, 36, 25]) == [30, 43, 59, 65, 117, 0, 25]`\nالجواب:", "qhash": "fb9c5998c5a726c2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "pairs = [('سلمى', 61), ('باسل', 38), ('عمر', 11), ('حسن', 79)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\npairs = [('سلمى', 61), ('باسل', 38), ('عمر', 11), ('حسن', 79)]\nprint(sorted(pairs, key=lambda p: (p[1], p[0])))\nprint([p[0] for p in sorted(pairs, key=lambda p: (-p[1], p[0]))][:2])\n```\nالجواب:", "qhash": "224ef99a6846fa74", "answer": "[('عمر', 11), ('باسل', 38), ('سلمى', 61), ('حسن', 79)]\n['حسن', 'سلمى']", "completion": " الناتج:\n```text\n[('عمر', 11), ('باسل', 38), ('سلمى', 61), ('حسن', 79)]\n['حسن', 'سلمى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Fizz'\n        if i % 10 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz']", "assert label_numbers(8) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8']", "assert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz']", "assert label_numbers(23) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz', '11', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'FizzBuzz', '21', '22', '23']", "assert label_numbers(7) == ['1', '2', '3', '4', 'Fizz', '6', '7']"], "test_code": "assert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz']\nassert label_numbers(8) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8']\nassert label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz']\nassert label_numbers(23) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz', '11', '12', '13', '14', 'Fizz', '16', '17', '18', '19', 'FizzBuzz', '21', '22', '23']\nassert label_numbers(7) == ['1', '2', '3', '4', 'Fizz', '6', '7']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Fizz'\n        if i % 10 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Fizz'\n        if i % 10 == 0:\n            s += 'Buzz'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Fizz'، مضاعفات 10 تصبح 'Buzz'، المضاعفات المشتركة تصبح 'FizzBuzz'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(10) == ['1', '2', '3', '4', 'Fizz', '6', '7', '8', '9', 'FizzBuzz']`\nالجواب:", "qhash": "2e72be320de2abb8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "between_times", "reference": "def between_times(xs):\n    return sorted(x * 5 for x in xs if -13 <= x <= 20)", "tests": ["assert between_times([-18, -12, 27, 2, -11, -4, -4, 0, 15, -16]) == [-60, -55, -20, -20, 0, 10, 75]", "assert between_times([-8, 55, 4, 0, -14, -9, -23, 48, 19, -19]) == [-45, -40, 0, 20, 95]", "assert between_times([-10, 38, 32, 52, 40, 50, 34, 37, 28]) == [-50]", "assert between_times([18, 44, 26, 59, 54, 22, 50]) == [90]", "assert between_times([5, -5, 36, 31, 27, -21, 37, 34, 26, 41]) == [-25, 25]", "assert between_times([2, -6, -20, 38, -15, 5, 3, 36]) == [-30, 10, 15, 25]", "assert between_times([47, 16, 39, 2, -18, 50, 39, -17, -19, 21]) == [10, 80]", "assert between_times([]) == []"], "test_code": "assert between_times([-18, -12, 27, 2, -11, -4, -4, 0, 15, -16]) == [-60, -55, -20, -20, 0, 10, 75]\nassert between_times([-8, 55, 4, 0, -14, -9, -23, 48, 19, -19]) == [-45, -40, 0, 20, 95]\nassert between_times([-10, 38, 32, 52, 40, 50, 34, 37, 28]) == [-50]\nassert between_times([18, 44, 26, 59, 54, 22, 50]) == [90]\nassert between_times([5, -5, 36, 31, 27, -21, 37, 34, 26, 41]) == [-25, 25]\nassert between_times([2, -6, -20, 38, -15, 5, 3, 36]) == [-30, 10, 15, 25]\nassert between_times([47, 16, 39, 2, -18, 50, 39, -17, -19, 21]) == [10, 80]\nassert between_times([]) == []", "answer": "def between_times(xs):\n    return sorted(x * 5 for x in xs if -13 <= x <= 20)", "completion": " ```python\ndef between_times(xs):\n    return sorted(x * 5 for x in xs if -13 <= x <= 20)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `between_times` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 5 لكل عنصر x في المدى المغلق [-13, 20].\nمثال: `between_times([-18, -12, 27, 2, -11, -4, -4, 0, 15, -16]) == [-60, -55, -20, -20, 0, 10, 75]`\nالجواب:", "qhash": "8406053f356b3927"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_list", "reference": "def rotate_list(lst):\n    if not lst:\n        return []\n    k = 4 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "tests": ["assert rotate_list([14, 0, 7, 1, 47, 14, 37]) == [1, 47, 14, 37, 14, 0, 7]", "assert rotate_list([9, -5, 11, 49, 34]) == [-5, 11, 49, 34, 9]", "assert rotate_list([-6, 22, 14, 17, 9, 2, 19, 32, 38, 37]) == [19, 32, 38, 37, -6, 22, 14, 17, 9, 2]", "assert rotate_list([28, 27, 0, 8]) == [28, 27, 0, 8]", "assert rotate_list([46, 43, -8, 19, 6, 14]) == [-8, 19, 6, 14, 46, 43]", "assert rotate_list([50, 42, 17, 37, 40, 25, 9, 23]) == [40, 25, 9, 23, 50, 42, 17, 37]", "assert rotate_list([]) == []"], "test_code": "assert rotate_list([14, 0, 7, 1, 47, 14, 37]) == [1, 47, 14, 37, 14, 0, 7]\nassert rotate_list([9, -5, 11, 49, 34]) == [-5, 11, 49, 34, 9]\nassert rotate_list([-6, 22, 14, 17, 9, 2, 19, 32, 38, 37]) == [19, 32, 38, 37, -6, 22, 14, 17, 9, 2]\nassert rotate_list([28, 27, 0, 8]) == [28, 27, 0, 8]\nassert rotate_list([46, 43, -8, 19, 6, 14]) == [-8, 19, 6, 14, 46, 43]\nassert rotate_list([50, 42, 17, 37, 40, 25, 9, 23]) == [40, 25, 9, 23, 50, 42, 17, 37]\nassert rotate_list([]) == []", "answer": "def rotate_list(lst):\n    if not lst:\n        return []\n    k = 4 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]", "completion": " ```python\ndef rotate_list(lst):\n    if not lst:\n        return []\n    k = 4 % len(lst)\n    return lst[len(lst) - k:] + lst[:len(lst) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 4 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_list(lst):\n    if not lst:\n        return []\n    k = 4 % len(lst)\n    return ____\n```\nمثال: `rotate_list([14, 0, 7, 1, 47, 14, 37]) == [1, 47, 14, 37, 14, 0, 7]`\nالجواب:", "qhash": "bab39d4a77f7d713"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "fact_mod", "reference": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 1009", "tests": ["assert fact_mod(9) == 45", "assert fact_mod(54) == 996", "assert fact_mod(55) == 616", "assert fact_mod(0) == 1", "assert fact_mod(9) == 45", "assert fact_mod(60) == 71", "assert fact_mod(0) == 1"], "test_code": "assert fact_mod(9) == 45\nassert fact_mod(54) == 996\nassert fact_mod(55) == 616\nassert fact_mod(0) == 1\nassert fact_mod(9) == 45\nassert fact_mod(60) == 71\nassert fact_mod(0) == 1", "answer": "def fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 1009", "completion": " ```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return (n * fact_mod(n - 4)) % 1009\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 1009 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef fact_mod(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `fact_mod(9) == 45`\nالجواب:", "qhash": "a71633850ac030e3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([41, 5, 30, 22, 43, 27, 26]) == [41, 46, 76, 0, 43, 70, 0]", "assert capped_cumsum([75, 23, 55, 66]) == [75, 0, 55, 0]", "assert capped_cumsum([39, 82, 38, 46]) == [39, 0, 38, 84]", "assert capped_cumsum([-6, 7, 7, -10, 79, 83]) == [-6, 1, 8, -2, 77, 0]", "assert capped_cumsum([]) == []", "assert capped_cumsum([69, 69, 74, 53, 27, 32, 1, 56]) == [69, 0, 74, 0, 27, 59, 60, 0]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([41, 5, 30, 22, 43, 27, 26]) == [41, 46, 76, 0, 43, 70, 0]\nassert capped_cumsum([75, 23, 55, 66]) == [75, 0, 55, 0]\nassert capped_cumsum([39, 82, 38, 46]) == [39, 0, 38, 84]\nassert capped_cumsum([-6, 7, 7, -10, 79, 83]) == [-6, 1, 8, -2, 77, 0]\nassert capped_cumsum([]) == []\nassert capped_cumsum([69, 69, 74, 53, 27, 32, 1, 56]) == [69, 0, 74, 0, 27, 59, 60, 0]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 86:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 86 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([41, 5, 30, 22, 43, 27, 26]) == [41, 46, 76, 0, 43, 70, 0]`\nالجواب:", "qhash": "98c4dc8ea877ac5d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(7, 8))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n, k):\n    if k == 0:\n        return 1\n    return n * f(n, k - 1)\n\nprint(f(7, 8))\n```\nالجواب:", "qhash": "9ead5956f29fbdc0", "answer": "5764801", "completion": " الناتج:\n```text\n5764801\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "label_numbers", "reference": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "tests": ["assert label_numbers(13) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13']", "assert label_numbers(20) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic']", "assert label_numbers(2) == ['1', '2']", "assert label_numbers(11) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11']", "assert label_numbers(19) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19']"], "test_code": "assert label_numbers(13) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13']\nassert label_numbers(20) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19', 'Tic']\nassert label_numbers(2) == ['1', '2']\nassert label_numbers(11) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11']\nassert label_numbers(19) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13', '14', 'Tic', '16', '17', 'Tac', '19']", "answer": "def label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef label_numbers(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Tic'\n        if i % 9 == 0:\n            s += 'Tac'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `label_numbers` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Tic'، مضاعفات 9 تصبح 'Tac'، المضاعفات المشتركة تصبح 'TicTac'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `label_numbers(13) == ['1', '2', '3', '4', 'Tic', '6', '7', '8', 'Tac', 'Tic', '11', '12', '13']`\nالجواب:", "qhash": "e53705714495076c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "spin", "reference": "def spin(items):\n    if not items:\n        return []\n    k = 17 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "tests": ["assert spin([41, 47, 12, 41, 0, 14]) == [47, 12, 41, 0, 14, 41]", "assert spin([38, 45, -3, 40, 46, 10, 11, 31, 1, 10, 15, 26]) == [31, 1, 10, 15, 26, 38, 45, -3, 40, 46, 10, 11]", "assert spin([-7, -3]) == [-3, -7]", "assert spin([37, 25, 25, 21, 46, 33, 27, 45, -4, 23]) == [21, 46, 33, 27, 45, -4, 23, 37, 25, 25]", "assert spin([39, 35, 1, -4]) == [-4, 39, 35, 1]", "assert spin([18, 13, 11, 16]) == [16, 18, 13, 11]", "assert spin([]) == []"], "test_code": "assert spin([41, 47, 12, 41, 0, 14]) == [47, 12, 41, 0, 14, 41]\nassert spin([38, 45, -3, 40, 46, 10, 11, 31, 1, 10, 15, 26]) == [31, 1, 10, 15, 26, 38, 45, -3, 40, 46, 10, 11]\nassert spin([-7, -3]) == [-3, -7]\nassert spin([37, 25, 25, 21, 46, 33, 27, 45, -4, 23]) == [21, 46, 33, 27, 45, -4, 23, 37, 25, 25]\nassert spin([39, 35, 1, -4]) == [-4, 39, 35, 1]\nassert spin([18, 13, 11, 16]) == [16, 18, 13, 11]\nassert spin([]) == []", "answer": "def spin(items):\n    if not items:\n        return []\n    k = 17 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]", "completion": " ```python\ndef spin(items):\n    if not items:\n        return []\n    k = 17 % len(items)\n    return items[len(items) - k:] + items[:len(items) - k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 17 مواقع إلى اليمين (العنصر الأخير ينتقل إلى البداية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef spin(items):\n    if not items:\n        return []\n    k = 17 % len(items)\n    return ____\n```\nمثال: `spin([41, 47, 12, 41, 0, 14]) == [47, 12, 41, 0, 14, 41]`\nالجواب:", "qhash": "69b29caba4c90db4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'سعيد': 49, 'حسن': 23, 'ليلى': 39}\nscores['حسن'] += 14\nscores['عمر'] = 19\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 25])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'سعيد': 49, 'حسن': 23, 'ليلى': 39}\nscores['حسن'] += 14\nscores['عمر'] = 19\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 25])\n```\nالجواب:", "qhash": "84e9447b3a2d4a5e", "answer": "4\nسعيد\n144\n['سعيد', 'حسن', 'ليلى']", "completion": " الناتج:\n```text\n4\nسعيد\n144\n['سعيد', 'حسن', 'ليلى']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "mult_sum", "reference": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "tests": ["assert mult_sum(127) == 2186", "assert mult_sum(90) == 1106", "assert mult_sum(140) == 2583", "assert mult_sum(20) == 41", "assert mult_sum(22) == 61", "assert mult_sum(187) == 4681", "assert mult_sum(1) == 0"], "test_code": "assert mult_sum(127) == 2186\nassert mult_sum(90) == 1106\nassert mult_sum(140) == 2583\nassert mult_sum(20) == 41\nassert mult_sum(22) == 61\nassert mult_sum(187) == 4681\nassert mult_sum(1) == 0", "answer": "def mult_sum(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)", "completion": " ```python\ndef mult_sum(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 11 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `mult_sum` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 5 أو 11 دون باقٍ.\nمثال: `mult_sum(127) == 2186`\nالجواب:", "qhash": "dd56ecfb74feb4e7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "how_many_div", "reference": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 9 != 0:\n            count += 1\n    return count", "tests": ["assert how_many_div([35, 32, 12, 62, 90, 25, 26, 17, 76]) == 1", "assert how_many_div([64, 45]) == 0", "assert how_many_div([-35, 83, 29, 35, 3, 38, 7, 12, 59, 44, 4, 63]) == 3", "assert how_many_div([-17, -31, 35, 19, -10, 50, 63, -8, 86, -10]) == 1", "assert how_many_div([36, 47, 35, -22, -23, -5, 78]) == 1", "assert how_many_div([60, 77, -18, 47, 13]) == 1", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([35, 32, 12, 62, 90, 25, 26, 17, 76]) == 1\nassert how_many_div([64, 45]) == 0\nassert how_many_div([-35, 83, 29, 35, 3, 38, 7, 12, 59, 44, 4, 63]) == 3\nassert how_many_div([-17, -31, 35, 19, -10, 50, 63, -8, 86, -10]) == 1\nassert how_many_div([36, 47, 35, -22, -23, -5, 78]) == 1\nassert how_many_div([60, 77, -18, 47, 13]) == 1\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 9 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 9 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 9. اكتب الحل كاملًا.\n```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `how_many_div([35, 32, 12, 62, 90, 25, 26, 17, 76]) == 1`\nالجواب:", "qhash": "b06f660cf9be14c8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x ** 2 - 1 for x in range(-6, 4) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x ** 2 - 1 for x in range(-6, 4) if x % 4 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "f51a584a8419f013", "answer": "[15, -1]\n2 14", "completion": " الناتج:\n```text\n[15, -1]\n2 14\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "data = [40, 18, 7, -4, 30, 15, 5]\nprint(data[3:6])\nprint(data[::2])\nprint(min(data[3:6]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndata = [40, 18, 7, -4, 30, 15, 5]\nprint(data[3:6])\nprint(data[::2])\nprint(min(data[3:6]))\n```\nالجواب:", "qhash": "8aa4931a7fcb0278", "answer": "[-4, 30, 15]\n[40, 7, 30, 5]\n-4", "completion": " الناتج:\n```text\n[-4, 30, 15]\n[40, 7, 30, 5]\n-4\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "value_at", "reference": "def value_at(x):\n    return -5 * x ** 2 + (1) * x + (1)", "tests": ["assert value_at(5) == -119", "assert value_at(-14) == -993", "assert value_at(-6) == -185", "assert value_at(17) == -1427", "assert value_at(9) == -395", "assert value_at(-15) == -1139", "assert value_at(6) == -173", "assert value_at(0) == 1"], "test_code": "assert value_at(5) == -119\nassert value_at(-14) == -993\nassert value_at(-6) == -185\nassert value_at(17) == -1427\nassert value_at(9) == -395\nassert value_at(-15) == -1139\nassert value_at(6) == -173\nassert value_at(0) == 1", "answer": "def value_at(x):\n    return -5 * x ** 2 + (1) * x + (1)", "completion": " ```python\ndef value_at(x):\n    return -5 * x ** 2 + (1) * x + (1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `value_at` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = -5x² + 1x + 1.\nمثال: `value_at(5) == -119`\nالجواب:", "qhash": "fa74697b5c18b8f5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'table'\nprint(text.capitalize())\nprint(len(text))\nprint(text.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'table'\nprint(text.capitalize())\nprint(len(text))\nprint(text.split('_'))\n```\nالجواب:", "qhash": "982c0f1ca793f84c", "answer": "Table\n5\n['table']", "completion": " الناتج:\n```text\nTable\n5\n['table']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "sum_powers", "reference": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 4\n    return total", "tests": ["assert sum_powers(8) == 78948", "assert sum_powers(4) == 3186", "assert sum_powers(12) == 546390", "assert sum_powers(9) == 137997", "assert sum_powers(5) == 8811", "assert sum_powers(1) == 9", "assert sum_powers(0) == 0"], "test_code": "assert sum_powers(8) == 78948\nassert sum_powers(4) == 3186\nassert sum_powers(12) == 546390\nassert sum_powers(9) == 137997\nassert sum_powers(5) == 8811\nassert sum_powers(1) == 9\nassert sum_powers(0) == 0", "answer": "def sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 4\n    return total", "completion": " ```python\ndef sum_powers(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 4\n    return total\n```\n", "buggy": "def sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 9 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 9 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef sum_powers(n):\n    total = 0\n    for i in range(0, n):\n        total += 9 * i ** 4\n    return total\n```\nمثال: `sum_powers(8) == 78948`\nالجواب:", "qhash": "953c7f8eae51fd51"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 3", "tests": ["assert sum_digit_pow(81892) == 1", "assert sum_digit_pow(734074) == 1", "assert sum_digit_pow(524055) == 2", "assert sum_digit_pow(845307) == 1", "assert sum_digit_pow(124930) == 0", "assert sum_digit_pow(320383) == 2", "assert sum_digit_pow(252053) == 1", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(81892) == 1\nassert sum_digit_pow(734074) == 1\nassert sum_digit_pow(524055) == 2\nassert sum_digit_pow(845307) == 1\nassert sum_digit_pow(124930) == 0\nassert sum_digit_pow(320383) == 2\nassert sum_digit_pow(252053) == 1\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 3", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 2 for d in str(n)) % 3\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^2 لكل أرقام n) mod 3.\nمثال: `sum_digit_pow(81892) == 1`\nالجواب:", "qhash": "8f0f533de2bedabc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "pow_total", "reference": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total", "tests": ["assert pow_total(8) == 432432", "assert pow_total(4) == 9100", "assert pow_total(8) == 432432", "assert pow_total(2) == 231", "assert pow_total(2) == 231", "assert pow_total(1) == 7", "assert pow_total(0) == 0"], "test_code": "assert pow_total(8) == 432432\nassert pow_total(4) == 9100\nassert pow_total(8) == 432432\nassert pow_total(2) == 231\nassert pow_total(2) == 231\nassert pow_total(1) == 7\nassert pow_total(0) == 0", "answer": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total", "completion": " ```python\ndef pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 7 * i ** 5\n    return total\n```\n", "buggy": "def pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 7 * i ** 5\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 7 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef pow_total(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 7 * i ** 5\n    return total\n```\nمثال: `pow_total(8) == 432432`\nالجواب:", "qhash": "6f1028fbfc350503"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('data cloud engine light') == 'ebub dmpve fohjof mjhiu'", "assert encode('go garden') == 'hp hbsefo'", "assert encode('to garden apple') == 'up hbsefo bqqmf'", "assert encode('pixel it light on an OK') == 'qjyfm ju mjhiu po bo OK'", "assert encode('vector') == 'wfdups'", "assert encode('desert is planet') == 'eftfsu jt qmbofu'", "assert encode('') == ''"], "test_code": "assert encode('data cloud engine light') == 'ebub dmpve fohjof mjhiu'\nassert encode('go garden') == 'hp hbsefo'\nassert encode('to garden apple') == 'up hbsefo bqqmf'\nassert encode('pixel it light on an OK') == 'qjyfm ju mjhiu po bo OK'\nassert encode('vector') == 'wfdups'\nassert encode('desert is planet') == 'eftfsu jt qmbofu'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-25)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 25 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('data cloud engine light') == 'ebub dmpve fohjof mjhiu'`\nالجواب:", "qhash": "eecac21157d5b035"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "text = 'apple'\nprint(text[0:5])\nprint(text.index('p') + len(text))\nprint(text.find('p'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'apple'\nprint(text[0:5])\nprint(text.index('p') + len(text))\nprint(text.find('p'))\n```\nالجواب:", "qhash": "6c68d21a17fc5867", "answer": "apple\n6\n1", "completion": " الناتج:\n```text\napple\n6\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('س'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('سفينة بحر بحر قلم بحر جمل') == 1", "assert prefix_hits('مدرسة خبز قهوة برمجة قمر رمل') == 0", "assert prefix_hits('رمل شمس مدرسة وردة') == 0", "assert prefix_hits('نور سماء نور دفتر وردة بحر سلام حاسوب') == 2", "assert prefix_hits('رمل سوق سيارة شجرة شجرة مدرسة') == 2", "assert prefix_hits('صديق سلام سفينة شجرة رمل صديق') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('سفينة بحر بحر قلم بحر جمل') == 1\nassert prefix_hits('مدرسة خبز قهوة برمجة قمر رمل') == 0\nassert prefix_hits('رمل شمس مدرسة وردة') == 0\nassert prefix_hits('نور سماء نور دفتر وردة بحر سلام حاسوب') == 2\nassert prefix_hits('رمل سوق سيارة شجرة شجرة مدرسة') == 2\nassert prefix_hits('صديق سلام سفينة شجرة رمل صديق') == 2\nassert prefix_hits('') == 0", "answer": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('س'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('س'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('س'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «س»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.endswith('س'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('سفينة بحر بحر قلم بحر جمل') == 1`\nالجواب:", "qhash": "4d843604a4d82a1d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * -3 for x in xs if -16 <= x <= 13)", "tests": ["assert clip_scale([-11, -5, 20, -3, -26, -4, -24]) == [9, 12, 15, 33]", "assert clip_scale([-2, 22, 7, 42, 32, 41, 41, 25, -27]) == [-21, 6]", "assert clip_scale([17, 16, 3, 34, 50, 48]) == [-9]", "assert clip_scale([-15]) == [45]", "assert clip_scale([51, -29, -11, -25, -1, 41, 47, 36, 14, 50]) == [3, 33]", "assert clip_scale([35, 54, 7, -28, -3, 42, -15, 1, 4]) == [-21, -12, -3, 9, 45]", "assert clip_scale([4, 47, -9, 18, 29, -27, -6, 17, 24, -23]) == [-12, 18, 27]", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([-11, -5, 20, -3, -26, -4, -24]) == [9, 12, 15, 33]\nassert clip_scale([-2, 22, 7, 42, 32, 41, 41, 25, -27]) == [-21, 6]\nassert clip_scale([17, 16, 3, 34, 50, 48]) == [-9]\nassert clip_scale([-15]) == [45]\nassert clip_scale([51, -29, -11, -25, -1, 41, 47, 36, 14, 50]) == [3, 33]\nassert clip_scale([35, 54, 7, -28, -3, 42, -15, 1, 4]) == [-21, -12, -3, 9, 45]\nassert clip_scale([4, 47, -9, 18, 29, -27, -6, 17, 24, -23]) == [-12, 18, 27]\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * -3 for x in xs if -16 <= x <= 13)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * -3 for x in xs if -16 <= x <= 13)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -3 لكل عنصر x في المدى المغلق [-16, 13].\nمثال: `clip_scale([-11, -5, 20, -3, -26, -4, -24]) == [9, 12, 15, 33]`\nالجواب:", "qhash": "3db0d5335ab2a6c1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "encode", "reference": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (9)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert encode('we pixel garden banana OK') == 'fn yrgnu pjamnw kjwjwj OK'", "assert encode('matrix up window') == 'vjcarg dy frwmxf'", "assert encode('rocket by coffee engine on A1') == 'axltnc kh lxoonn nwprwn xw A1'", "assert encode('cloud it a summer vector') == 'luxdm rc j bdvvna enlcxa'", "assert encode('desert we music desert') == 'mnbnac fn vdbrl mnbnac'", "assert encode('orange !') == 'xajwpn !'", "assert encode('') == ''"], "test_code": "assert encode('we pixel garden banana OK') == 'fn yrgnu pjamnw kjwjwj OK'\nassert encode('matrix up window') == 'vjcarg dy frwmxf'\nassert encode('rocket by coffee engine on A1') == 'axltnc kh lxoonn nwprwn xw A1'\nassert encode('cloud it a summer vector') == 'luxdm rc j bdvvna enlcxa'\nassert encode('desert we music desert') == 'mnbnac fn vdbrl mnbnac'\nassert encode('orange !') == 'xajwpn !'\nassert encode('') == ''", "answer": "def encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (9)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef encode(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (9)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `encode` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 9 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `encode('we pixel garden banana OK') == 'fn yrgnu pjamnw kjwjwj OK'`\nالجواب:", "qhash": "95a53a7ea8d2feeb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def h(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(h(-7))\nprint(h(-7, 19))\nprint(h(h(19), -7))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef h(x, y=4):\n    if x > y:\n        return x * 1 - y\n    return x + y * 1\n\nprint(h(-7))\nprint(h(-7, 19))\nprint(h(h(19), -7))\n```\nالجواب:", "qhash": "e4f9193a9d7b699d", "answer": "-3\n12\n22", "completion": " الناتج:\n```text\n-3\n12\n22\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['rocket', 'banana', 'camel', 'summer', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['rocket', 'banana', 'camel', 'summer', 'table']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "33a3c4b1a631fcdd", "answer": "['camel', 'table', 'rocket', 'banana', 'summer']\n['summer', 'rocket', 'banana']", "completion": " الناتج:\n```text\n['camel', 'table', 'rocket', 'banana', 'summer']\n['summer', 'rocket', 'banana']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "tests": ["assert add_multiples(251) == 5166", "assert add_multiples(230) == 4446", "assert add_multiples(228) == 4218", "assert add_multiples(45) == 168", "assert add_multiples(213) == 3780", "assert add_multiples(300) == 7350", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(251) == 5166\nassert add_multiples(230) == 4446\nassert add_multiples(228) == 4218\nassert add_multiples(45) == 168\nassert add_multiples(213) == 3780\nassert add_multiples(300) == 7350\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 6 == 0 or x % 12 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 6 أو 12 دون باقٍ.\nمثال: `add_multiples(251) == 5166`\nالجواب:", "qhash": "b38c91b4a445fecf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def f(n):\n    if n <= 0:\n        return 1\n    return 3 * f(n - 1) + -3\n\nprint(f(4))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef f(n):\n    if n <= 0:\n        return 1\n    return 3 * f(n - 1) + -3\n\nprint(f(4))\n```\nالجواب:", "qhash": "aba9807c65c3919c", "answer": "-39", "completion": " الناتج:\n```text\n-39\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_sel", "reference": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count", "tests": ["assert count_sel([47, 71, 54, 4, 28, 52, 63, 80, 27, 13, 83, 63]) == 4", "assert count_sel([79, 28, -37, 63, 82]) == 1", "assert count_sel([33, -6, 8, 25, 33, 28]) == 2", "assert count_sel([18, 25]) == 0", "assert count_sel([]) == 0", "assert count_sel([]) == 0", "assert count_sel([]) == 0"], "test_code": "assert count_sel([47, 71, 54, 4, 28, 52, 63, 80, 27, 13, 83, 63]) == 4\nassert count_sel([79, 28, -37, 63, 82]) == 1\nassert count_sel([33, -6, 8, 25, 33, 28]) == 2\nassert count_sel([18, 25]) == 0\nassert count_sel([]) == 0\nassert count_sel([]) == 0\nassert count_sel([]) == 0", "answer": "def count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if x % 4 == 0 and x % 6 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 4 ولا تقبل القسمة على 6. اكتب الحل كاملًا.\n```python\ndef count_sel(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_sel([47, 71, 54, 4, 28, 52, 63, 80, 27, 13, 83, 63]) == 4`\nالجواب:", "qhash": "9b57fa6ad1baecaa"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "lead_count", "reference": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "tests": ["assert lead_count('صحراء سماء حديقة صديق سيارة') == 2", "assert lead_count('صديق دفتر فجر صحراء') == 2", "assert lead_count('سلام صديق قمر عربية تفاحة صديق برمجة عربية') == 2", "assert lead_count('شمس صحراء نور طائرة بحر') == 1", "assert lead_count('صحراء جمل سفينة حصان فجر') == 1", "assert lead_count('باب كتاب حديقة طالب قلم مكتبة') == 0", "assert lead_count('') == 0"], "test_code": "assert lead_count('صحراء سماء حديقة صديق سيارة') == 2\nassert lead_count('صديق دفتر فجر صحراء') == 2\nassert lead_count('سلام صديق قمر عربية تفاحة صديق برمجة عربية') == 2\nassert lead_count('شمس صحراء نور طائرة بحر') == 1\nassert lead_count('صحراء جمل سفينة حصان فجر') == 1\nassert lead_count('باب كتاب حديقة طالب قلم مكتبة') == 0\nassert lead_count('') == 0", "answer": "def lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "completion": " ```python\ndef lead_count(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('ص'):\n            count += 1\n    return count\n```\n", "buggy": "def lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ص'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «ص»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef lead_count(text):\n    count = 0\n    for w in text:\n        if w.startswith('ص'):\n            count += 1\n    return count\n```\nمثال: `lead_count('صحراء سماء حديقة صديق سيارة') == 2`\nالجواب:", "qhash": "b56deae393548c9a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x ** 2 - 7 for x in range(3, 13) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x ** 2 - 7 for x in range(3, 13) if x % 4 == 1]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "a1878c101735adaa", "answer": "[18, 74]\n2 92", "completion": " الناتج:\n```text\n[18, 74]\n2 92\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "d = {'رنا': 1, 'منى': 50, 'هشام': 35}\nd['رنا'] += 7\nd['راشد'] = 3\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nd = {'رنا': 1, 'منى': 50, 'هشام': 35}\nd['رنا'] += 7\nd['راشد'] = 3\nprint(len(d))\nprint(max(d, key=d.get))\nprint(sum(d.values()))\nprint(d.get('باسل', -1))\n```\nالجواب:", "qhash": "4fafa6ed53034c12", "answer": "4\nمنى\n96\n-1", "completion": " الناتج:\n```text\n4\nمنى\n96\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=4):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(g(11))\nprint(g(11, -4))\nprint(g(g(-4), 11))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=4):\n    if x > y:\n        return x * 2 - y\n    return x + y * 2\n\nprint(g(11))\nprint(g(11, -4))\nprint(g(g(-4), 11))\n```\nالجواب:", "qhash": "8dd33588c93b150c", "answer": "18\n26\n26", "completion": " الناتج:\n```text\n18\n26\n26\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_hits", "reference": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('م'))", "tests": ["assert count_hits('تفاحة مطر باب برمجة صديق سوق خبز عربية') == 1", "assert count_hits('باب') == 0", "assert count_hits('علم ميناء') == 1", "assert count_hits('سيارة وردة صحراء قمر شجرة وردة سفينة') == 0", "assert count_hits('ماء قلم عربية مطر حديقة') == 2", "assert count_hits('قلم مطر') == 1", "assert count_hits('ماء ليل قهوة مدرسة جمل بحر ليل شجرة') == 2", "assert count_hits('') == 0"], "test_code": "assert count_hits('تفاحة مطر باب برمجة صديق سوق خبز عربية') == 1\nassert count_hits('باب') == 0\nassert count_hits('علم ميناء') == 1\nassert count_hits('سيارة وردة صحراء قمر شجرة وردة سفينة') == 0\nassert count_hits('ماء قلم عربية مطر حديقة') == 2\nassert count_hits('قلم مطر') == 1\nassert count_hits('ماء ليل قهوة مدرسة جمل بحر ليل شجرة') == 2\nassert count_hits('') == 0", "answer": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('م'))", "completion": " ```python\ndef count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('م'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «م».\nمثال: `count_hits('تفاحة مطر باب برمجة صديق سوق خبز عربية') == 1`\nالجواب:", "qhash": "95f8c1ce8a0d1f84"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "count_prefix", "reference": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ش'):\n            count += 1\n    return count", "tests": ["assert count_prefix('شجرة جمل شمس شجرة شجرة تفاحة رمل') == 4", "assert count_prefix('خبز عمل دفتر شمس مطر') == 1", "assert count_prefix('مدينة برتقال شجرة سماء حاسوب حاسوب طائرة') == 1", "assert count_prefix('لغة شجرة شمس عمل برمجة') == 2", "assert count_prefix('سيارة شمس عمل') == 1", "assert count_prefix('ميناء مطر') == 0", "assert count_prefix('') == 0"], "test_code": "assert count_prefix('شجرة جمل شمس شجرة شجرة تفاحة رمل') == 4\nassert count_prefix('خبز عمل دفتر شمس مطر') == 1\nassert count_prefix('مدينة برتقال شجرة سماء حاسوب حاسوب طائرة') == 1\nassert count_prefix('لغة شجرة شمس عمل برمجة') == 2\nassert count_prefix('سيارة شمس عمل') == 1\nassert count_prefix('ميناء مطر') == 0\nassert count_prefix('') == 0", "answer": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ش'):\n            count += 1\n    return count", "completion": " ```python\ndef count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ش'):\n            count += 1\n    return count\n```\n", "buggy": "def count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ش'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ش»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef count_prefix(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ش'):\n            count += 1\n    return count\n```\nمثال: `count_prefix('شجرة جمل شمس شجرة شجرة تفاحة رمل') == 4`\nالجواب:", "qhash": "764a1060021934c8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_special", "reference": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "tests": ["assert count_special([70, 47, 11, 73, 57, 40, 1]) == 1", "assert count_special([64, 41, 54, -17]) == 0", "assert count_special([37, 38, 78, 34, 34, 32, 73, 74, -9, 14, 50]) == 1", "assert count_special([83, -32, -10, 21, 14, 83, 64]) == 1", "assert count_special([-14, 75]) == 1", "assert count_special([54, 54]) == 0", "assert count_special([]) == 0"], "test_code": "assert count_special([70, 47, 11, 73, 57, 40, 1]) == 1\nassert count_special([64, 41, 54, -17]) == 0\nassert count_special([37, 38, 78, 34, 34, 32, 73, 74, -9, 14, 50]) == 1\nassert count_special([83, -32, -10, 21, 14, 83, 64]) == 1\nassert count_special([-14, 75]) == 1\nassert count_special([54, 54]) == 0\nassert count_special([]) == 0", "answer": "def count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 2 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 2. اكتب الحل كاملًا.\n```python\ndef count_special(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_special([70, 47, 11, 73, 57, 40, 1]) == 1`\nالجواب:", "qhash": "405a1803a2fd6d12"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [(x + 3) // 4 for x in range(-6, 9) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [(x + 3) // 4 for x in range(-6, 9) if x % 4 == 2]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "8719848b7df6162c", "answer": "[-1, 0, 1, 2]\n4 2", "completion": " الناتج:\n```text\n[-1, 0, 1, 2]\n4 2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "items = [5, 15, 36, 13, -7, -8, 1, 22]\nprint(items[1:3])\nprint(items[::-1])\nprint(sum(items[1:3]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nitems = [5, 15, 36, 13, -7, -8, 1, 22]\nprint(items[1:3])\nprint(items[::-1])\nprint(sum(items[1:3]))\n```\nالجواب:", "qhash": "a99b6f764ae31566", "answer": "[15, 36]\n[22, 1, -8, -7, 13, 36, 15, 5]\n51", "completion": " الناتج:\n```text\n[15, 36]\n[22, 1, -8, -7, 13, 36, 15, 5]\n51\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_reverse_words#2", "entry": "reverse_words", "reference": "def reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])", "tests": ["assert reverse_words('on code python planet garden music on summer') == 'summer_on_music_garden_planet_python_code_on'", "assert reverse_words('') == ''", "assert reverse_words('vector table coffee matrix window brain of vector') == 'vector_of_brain_window_matrix_coffee_table_vector'", "assert reverse_words('desert brain window is') == 'is_window_brain_desert'", "assert reverse_words('engine garden engine desert is banana banana') == 'banana_banana_is_desert_engine_garden_engine'", "assert reverse_words('is it vector coffee planet desert up by') == 'by_up_desert_planet_coffee_vector_it_is'", "assert reverse_words('river winter is banana') == 'banana_is_winter_river'"], "test_code": "assert reverse_words('on code python planet garden music on summer') == 'summer_on_music_garden_planet_python_code_on'\nassert reverse_words('') == ''\nassert reverse_words('vector table coffee matrix window brain of vector') == 'vector_of_brain_window_matrix_coffee_table_vector'\nassert reverse_words('desert brain window is') == 'is_window_brain_desert'\nassert reverse_words('engine garden engine desert is banana banana') == 'banana_banana_is_desert_engine_garden_engine'\nassert reverse_words('is it vector coffee planet desert up by') == 'by_up_desert_planet_coffee_vector_it_is'\nassert reverse_words('river winter is banana') == 'banana_is_winter_river'", "answer": "def reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])", "completion": " ```python\ndef reverse_words(s):\n    return '_'.join([w for w in s.split() if len(w) >= 2][::-1])\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة اسمها `reverse_words` تستقبل نصًا s، وتعيد نصًا يحتوي الكلمات التي عدد أحرفها ≥ 2 من آخرها إلى أولها، موصولة بالفاصل '_'.\nمثال: `reverse_words('on code python planet garden music on summer') == 'summer_on_music_garden_planet_python_code_on'`\nالجواب:", "qhash": "7d5a57ae2baed985"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'زينب': 43, 'رنا': 50, 'فيصل': 40, 'خالد': 15}\nscores['رنا'] += 14\nscores['وليد'] = 40\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('ليلى', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'زينب': 43, 'رنا': 50, 'فيصل': 40, 'خالد': 15}\nscores['رنا'] += 14\nscores['وليد'] = 40\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint(scores.get('ليلى', -1))\n```\nالجواب:", "qhash": "7c24656dee7931e9", "answer": "5\nرنا\n202\n-1", "completion": " الناتج:\n```text\n5\nرنا\n202\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "words_starting", "reference": "def words_starting(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "tests": ["assert words_starting('صديق خبز صحراء طائرة عمل سفينة') == 2", "assert words_starting('صحراء عربية صحراء لغة نهار ليل صحراء') == 3", "assert words_starting('باب نهر نور نور صديق') == 1", "assert words_starting('ماء صديق') == 1", "assert words_starting('طالب سلام لغة كتاب حصان') == 0", "assert words_starting('صحراء حاسوب صحراء سلام صديق صديق') == 4", "assert words_starting('') == 0"], "test_code": "assert words_starting('صديق خبز صحراء طائرة عمل سفينة') == 2\nassert words_starting('صحراء عربية صحراء لغة نهار ليل صحراء') == 3\nassert words_starting('باب نهر نور نور صديق') == 1\nassert words_starting('ماء صديق') == 1\nassert words_starting('طالب سلام لغة كتاب حصان') == 0\nassert words_starting('صحراء حاسوب صحراء سلام صديق صديق') == 4\nassert words_starting('') == 0", "answer": "def words_starting(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count", "completion": " ```python\ndef words_starting(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ص'):\n            count += 1\n    return count\n```\n", "buggy": "def words_starting(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ص'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ص»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef words_starting(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ص'):\n            count += 1\n    return count\n```\nمثال: `words_starting('صديق خبز صحراء طائرة عمل سفينة') == 2`\nالجواب:", "qhash": "cc5fb05281afb9c9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rotate_letters", "reference": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rotate_letters('at matrix table Hello') == 'zs lzsqhw szakd Hdkkn'", "assert rotate_letters('window') == 'vhmcnv'", "assert rotate_letters('light falcon') == 'khfgs ezkbnm'", "assert rotate_letters('up Hello') == 'to Hdkkn'", "assert rotate_letters('cloud garden coffee to !') == 'bkntc fzqcdm bneedd sn !'", "assert rotate_letters('rocket camel code') == 'qnbjds bzldk bncd'", "assert rotate_letters('') == ''"], "test_code": "assert rotate_letters('at matrix table Hello') == 'zs lzsqhw szakd Hdkkn'\nassert rotate_letters('window') == 'vhmcnv'\nassert rotate_letters('light falcon') == 'khfgs ezkbnm'\nassert rotate_letters('up Hello') == 'to Hdkkn'\nassert rotate_letters('cloud garden coffee to !') == 'bkntc fzqcdm bneedd sn !'\nassert rotate_letters('rocket camel code') == 'qnbjds bzldk bncd'\nassert rotate_letters('') == ''", "answer": "def rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rotate_letters(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (-1)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rotate_letters` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 1 مواقع إلى الخلف في الأبجدية (مع الالتفاف من a إلى z)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rotate_letters('at matrix table Hello') == 'zs lzsqhw szakd Hdkkn'`\nالجواب:", "qhash": "688db2f39e5f5110"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "weighted_sum", "reference": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 5\n    return total", "tests": ["assert weighted_sum(3) == 3036", "assert weighted_sum(9) == 1329075", "assert weighted_sum(5) == 48675", "assert weighted_sum(2) == 363", "assert weighted_sum(4) == 14300", "assert weighted_sum(1) == 11", "assert weighted_sum(0) == 0"], "test_code": "assert weighted_sum(3) == 3036\nassert weighted_sum(9) == 1329075\nassert weighted_sum(5) == 48675\nassert weighted_sum(2) == 363\nassert weighted_sum(4) == 14300\nassert weighted_sum(1) == 11\nassert weighted_sum(0) == 0", "answer": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 5\n    return total", "completion": " ```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 11 * i ** 5\n    return total\n```\n", "buggy": "def weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 11 * i ** 5\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 11 × i^5 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef weighted_sum(n):\n    total = 0\n    for i in range(1, n):\n        total += 11 * i ** 5\n    return total\n```\nمثال: `weighted_sum(3) == 3036`\nالجواب:", "qhash": "109b67af129bfa8a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * -4 for x in xs if -6 <= x <= 0)", "tests": ["assert select_range([-15, -6, -5, 4, 7, -9, -7, -7]) == [20, 24]", "assert select_range([1, 13, 54, 6, 50, 41, -8, -12, 42, -27]) == []", "assert select_range([-17, -10, -28, -4, 2, 60, 31]) == [16]", "assert select_range([-26, 19, 54]) == []", "assert select_range([]) == []", "assert select_range([36, 39, -30, 18, -29]) == []", "assert select_range([-20, -14]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([-15, -6, -5, 4, 7, -9, -7, -7]) == [20, 24]\nassert select_range([1, 13, 54, 6, 50, 41, -8, -12, 42, -27]) == []\nassert select_range([-17, -10, -28, -4, 2, 60, 31]) == [16]\nassert select_range([-26, 19, 54]) == []\nassert select_range([]) == []\nassert select_range([36, 39, -30, 18, -29]) == []\nassert select_range([-20, -14]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * -4 for x in xs if -6 <= x <= 0)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * -4 for x in xs if -6 <= x <= 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -4 لكل عنصر x في المدى المغلق [-6, 0].\nمثال: `select_range([-15, -6, -5, 4, 7, -9, -7, -7]) == [20, 24]`\nالجواب:", "qhash": "33af47e66a38c45d"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [x * -3 + 8 for x in range(-3, 3) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [x * -3 + 8 for x in range(-3, 3) if x % 5 == 2]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "81cfeb8948b011e6", "answer": "[17, 2]\n2 19", "completion": " الناتج:\n```text\n[17, 2]\n2 19\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'ماء'\nprint(s[::-1])\nprint(s.replace(' ', '-'))\nprint(s[-1])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'ماء'\nprint(s[::-1])\nprint(s.replace(' ', '-'))\nprint(s[-1])\n```\nالجواب:", "qhash": "a819aa635601fb21", "answer": "ءام\nماء\nء", "completion": " الناتج:\n```text\nءام\nماء\nء\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "tests": ["assert series(4) == 708", "assert series(3) == 196", "assert series(0) == 0", "assert series(13) == 178542", "assert series(12) == 121420", "assert series(1) == 2", "assert series(0) == 0"], "test_code": "assert series(4) == 708\nassert series(3) == 196\nassert series(0) == 0\nassert series(13) == 178542\nassert series(12) == 121420\nassert series(1) == 2\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 2 * i ** 4\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(0, n):\n        total += 2 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 2 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(0, n):\n        total += 2 * i ** 4\n    return total\n```\nمثال: `series(4) == 708`\nالجواب:", "qhash": "f88127683d6a1b54"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'يوسف': 43, 'وليد': 49, 'مريم': 39}\nmarks['مريم'] += 19\nmarks['ليلى'] = 38\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'يوسف': 43, 'وليد': 49, 'مريم': 39}\nmarks['مريم'] += 19\nmarks['ليلى'] = 38\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(marks.get('سعيد', -1))\n```\nالجواب:", "qhash": "d4d46aa064b48668", "answer": "4\nمريم\n188\n-1", "completion": " الناتج:\n```text\n4\nمريم\n188\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "rolling_total", "reference": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 113:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert rolling_total([14, 55, 48, 37, 38, 6, 8, 42, 24, 36]) == [14, 69, 0, 37, 75, 81, 89, 0, 24, 60]", "assert rolling_total([31, 75, 15, 103, 50, 5]) == [31, 106, 0, 103, 0, 5]", "assert rolling_total([112, -1, 58, 41, 107, 15, -10, 78]) == [112, 111, 0, 41, 0, 15, 5, 83]", "assert rolling_total([95, 109, 39, 113, 34, -2, 47, -9]) == [95, 0, 39, 0, 34, 32, 79, 70]", "assert rolling_total([37, 53, 1, 8, 61, 90, 4, 108]) == [37, 90, 91, 99, 0, 90, 94, 0]", "assert rolling_total([73, 39]) == [73, 112]", "assert rolling_total([]) == []"], "test_code": "assert rolling_total([14, 55, 48, 37, 38, 6, 8, 42, 24, 36]) == [14, 69, 0, 37, 75, 81, 89, 0, 24, 60]\nassert rolling_total([31, 75, 15, 103, 50, 5]) == [31, 106, 0, 103, 0, 5]\nassert rolling_total([112, -1, 58, 41, 107, 15, -10, 78]) == [112, 111, 0, 41, 0, 15, 5, 83]\nassert rolling_total([95, 109, 39, 113, 34, -2, 47, -9]) == [95, 0, 39, 0, 34, 32, 79, 70]\nassert rolling_total([37, 53, 1, 8, 61, 90, 4, 108]) == [37, 90, 91, 99, 0, 90, 94, 0]\nassert rolling_total([73, 39]) == [73, 112]\nassert rolling_total([]) == []", "answer": "def rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 113:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef rolling_total(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 113:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rolling_total` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 113 (القيمة المسجلة حينها 0).\nمثال: `rolling_total([14, 55, 48, 37, 38, 6, 8, 42, 24, 36]) == [14, 69, 0, 37, 75, 81, 89, 0, 24, 60]`\nالجواب:", "qhash": "de68b66c627696dd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_ar", "reference": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))", "tests": ["assert count_ar('صديق خبز سلام مكتبة') == 0", "assert count_ar('جبل سوق مدينة قمر جمل مدرسة صحراء سماء') == 2", "assert count_ar('قمر باب شجرة دفتر رمل طالب مدينة') == 0", "assert count_ar('سوق قلم') == 0", "assert count_ar('نور') == 0", "assert count_ar('قهوة صحراء سوق ليل برتقال سوق') == 0", "assert count_ar('شمس جمل جمل شمس معلم') == 2", "assert count_ar('') == 0"], "test_code": "assert count_ar('صديق خبز سلام مكتبة') == 0\nassert count_ar('جبل سوق مدينة قمر جمل مدرسة صحراء سماء') == 2\nassert count_ar('قمر باب شجرة دفتر رمل طالب مدينة') == 0\nassert count_ar('سوق قلم') == 0\nassert count_ar('نور') == 0\nassert count_ar('قهوة صحراء سوق ليل برتقال سوق') == 0\nassert count_ar('شمس جمل جمل شمس معلم') == 2\nassert count_ar('') == 0", "answer": "def count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))", "completion": " ```python\ndef count_ar(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_ar` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج».\nمثال: `count_ar('صديق خبز سلام مكتبة') == 0`\nالجواب:", "qhash": "270c76256762d4ff"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "rotate_by", "reference": "def rotate_by(arr):\n    if not arr:\n        return []\n    k = 2 % len(arr)\n    return arr[k:] + arr[:k]", "tests": ["assert rotate_by([5, 50, 18, 12]) == [18, 12, 5, 50]", "assert rotate_by([31, 5, 12, 10, 11, 29, 32, 43, 5, 8]) == [12, 10, 11, 29, 32, 43, 5, 8, 31, 5]", "assert rotate_by([49, 23, 8, 50, 30, 28, 33, -9, 36, 41, 3]) == [8, 50, 30, 28, 33, -9, 36, 41, 3, 49, 23]", "assert rotate_by([35, -7, 1, 2, 49, 47]) == [1, 2, 49, 47, 35, -7]", "assert rotate_by([-3, 47, 16, 10, 29, 10, -9, 40, 9, 50]) == [16, 10, 29, 10, -9, 40, 9, 50, -3, 47]", "assert rotate_by([-1, 19, 1, 22, 10, 8, 48, 21, 12, 15, 7]) == [1, 22, 10, 8, 48, 21, 12, 15, 7, -1, 19]", "assert rotate_by([]) == []"], "test_code": "assert rotate_by([5, 50, 18, 12]) == [18, 12, 5, 50]\nassert rotate_by([31, 5, 12, 10, 11, 29, 32, 43, 5, 8]) == [12, 10, 11, 29, 32, 43, 5, 8, 31, 5]\nassert rotate_by([49, 23, 8, 50, 30, 28, 33, -9, 36, 41, 3]) == [8, 50, 30, 28, 33, -9, 36, 41, 3, 49, 23]\nassert rotate_by([35, -7, 1, 2, 49, 47]) == [1, 2, 49, 47, 35, -7]\nassert rotate_by([-3, 47, 16, 10, 29, 10, -9, 40, 9, 50]) == [16, 10, 29, 10, -9, 40, 9, 50, -3, 47]\nassert rotate_by([-1, 19, 1, 22, 10, 8, 48, 21, 12, 15, 7]) == [1, 22, 10, 8, 48, 21, 12, 15, 7, -1, 19]\nassert rotate_by([]) == []", "answer": "def rotate_by(arr):\n    if not arr:\n        return []\n    k = 2 % len(arr)\n    return arr[k:] + arr[:k]", "completion": " ```python\ndef rotate_by(arr):\n    if not arr:\n        return []\n    k = 2 % len(arr)\n    return arr[k:] + arr[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 2 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef rotate_by(arr):\n    if not arr:\n        return []\n    k = 2 % len(arr)\n    return ____\n```\nمثال: `rotate_by([5, 50, 18, 12]) == [18, 12, 5, 50]`\nالجواب:", "qhash": "1c0560bbcbd2862c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "marks = {'خالد': 41, 'زينب': 35, 'يوسف': 28}\nmarks['خالد'] += 15\nmarks['وليد'] = 32\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nmarks = {'خالد': 41, 'زينب': 35, 'يوسف': 28}\nmarks['خالد'] += 15\nmarks['وليد'] = 32\nprint(len(marks))\nprint(max(marks, key=marks.get))\nprint(sum(marks.values()))\nprint(sorted(marks.items(), key=lambda kv: (kv[1], kv[0]))[:2])\n```\nالجواب:", "qhash": "e8fbf1d3e08b3054", "answer": "4\nخالد\n151\n[('يوسف', 28), ('وليد', 32)]", "completion": " الناتج:\n```text\n4\nخالد\n151\n[('يوسف', 28), ('وليد', 32)]\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "capped_cumsum", "reference": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 106:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert capped_cumsum([56, 21, 27, 25, 1]) == [56, 77, 104, 0, 1]", "assert capped_cumsum([75, 64, 96, 11, 0, 56]) == [75, 0, 96, 0, 0, 56]", "assert capped_cumsum([65, 13, 46, 74, 67, 82, 17, 63]) == [65, 78, 0, 74, 0, 82, 99, 0]", "assert capped_cumsum([19, 104, 10, 21, 6, 53, 60]) == [19, 0, 10, 31, 37, 90, 0]", "assert capped_cumsum([-1, 53, 96, 63, 92, 51, 63, 14, 48]) == [-1, 52, 0, 63, 0, 51, 0, 14, 62]", "assert capped_cumsum([-4, -4, -8, 4, 1, 75, 46, 82, 51, -5]) == [-4, -8, -16, -12, -11, 64, 0, 82, 0, -5]", "assert capped_cumsum([]) == []"], "test_code": "assert capped_cumsum([56, 21, 27, 25, 1]) == [56, 77, 104, 0, 1]\nassert capped_cumsum([75, 64, 96, 11, 0, 56]) == [75, 0, 96, 0, 0, 56]\nassert capped_cumsum([65, 13, 46, 74, 67, 82, 17, 63]) == [65, 78, 0, 74, 0, 82, 99, 0]\nassert capped_cumsum([19, 104, 10, 21, 6, 53, 60]) == [19, 0, 10, 31, 37, 90, 0]\nassert capped_cumsum([-1, 53, 96, 63, 92, 51, 63, 14, 48]) == [-1, 52, 0, 63, 0, 51, 0, 14, 62]\nassert capped_cumsum([-4, -4, -8, 4, 1, 75, 46, 82, 51, -5]) == [-4, -8, -16, -12, -11, 64, 0, 82, 0, -5]\nassert capped_cumsum([]) == []", "answer": "def capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 106:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef capped_cumsum(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 106:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `capped_cumsum` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 106 (القيمة المسجلة حينها 0).\nمثال: `capped_cumsum([56, 21, 27, 25, 1]) == [56, 77, 104, 0, 1]`\nالجواب:", "qhash": "154d2e196f70b859"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizz", "reference": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizz(16) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12', '13', '14', 'Red', 'Blue']", "assert fizz(12) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12']", "assert fizz(22) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12', '13', '14', 'Red', 'Blue', '17', '18', '19', 'Red', '21', '22']", "assert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11']", "assert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11']"], "test_code": "assert fizz(16) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12', '13', '14', 'Red', 'Blue']\nassert fizz(12) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12']\nassert fizz(22) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12', '13', '14', 'Red', 'Blue', '17', '18', '19', 'Red', '21', '22']\nassert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11']\nassert fizz(11) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11']", "answer": "def fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 5 == 0:\n            s += 'Red'\n        if i % 8 == 0:\n            s += 'Blue'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 5 تصبح 'Red'، مضاعفات 8 تصبح 'Blue'، المضاعفات المشتركة تصبح 'RedBlue'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizz(16) == ['1', '2', '3', '4', 'Red', '6', '7', 'Blue', '9', 'Red', '11', '12', '13', '14', 'Red', 'Blue']`\nالجواب:", "qhash": "56bbcee2cd9dde2f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "letter_hits", "reference": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'س' in w)", "tests": ["assert letter_hits('معلم سوق بحر') == 1", "assert letter_hits('طالب سفينة علم نهار مكتبة ميناء معلم صديق') == 1", "assert letter_hits('سماء سيارة شمس دفتر') == 3", "assert letter_hits('قلم باب حصان') == 0", "assert letter_hits('مدينة') == 0", "assert letter_hits('سيارة طائرة قلم نهار') == 1", "assert letter_hits('بحر نور') == 0", "assert letter_hits('') == 0"], "test_code": "assert letter_hits('معلم سوق بحر') == 1\nassert letter_hits('طالب سفينة علم نهار مكتبة ميناء معلم صديق') == 1\nassert letter_hits('سماء سيارة شمس دفتر') == 3\nassert letter_hits('قلم باب حصان') == 0\nassert letter_hits('مدينة') == 0\nassert letter_hits('سيارة طائرة قلم نهار') == 1\nassert letter_hits('بحر نور') == 0\nassert letter_hits('') == 0", "answer": "def letter_hits(text):\n    return sum(1 for w in text.split() if 'س' in w)", "completion": " ```python\ndef letter_hits(text):\n    return sum(1 for w in text.split() if 'س' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `letter_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «س» مرة واحدة على الأقل.\nمثال: `letter_hits('معلم سوق بحر') == 1`\nالجواب:", "qhash": "db0e7e78042f1f23"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "result = 3\nfor n in range(10, 26, 2):\n    result += n * 4\nprint(result)\nprint(n)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nresult = 3\nfor n in range(10, 26, 2):\n    result += n * 4\nprint(result)\nprint(n)\n```\nالجواب:", "qhash": "39ec0cb1108eded3", "answer": "547\n24", "completion": " الناتج:\n```text\n547\n24\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 183:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([32, 55, 58, 78, 83, 85, 56]) == [32, 87, 145, 0, 83, 168, 0]", "assert acc_reset([157, 40, 26, 154, 42, 148, 115, 136, 52, 46]) == [157, 0, 26, 180, 0, 148, 0, 136, 0, 46]", "assert acc_reset([79, 57, 91]) == [79, 136, 0]", "assert acc_reset([7, 107, 99, 90, 183]) == [7, 114, 0, 90, 0]", "assert acc_reset([29, 119, 72, 130, 138, 8]) == [29, 148, 0, 130, 0, 8]", "assert acc_reset([67, 90, 67]) == [67, 157, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([32, 55, 58, 78, 83, 85, 56]) == [32, 87, 145, 0, 83, 168, 0]\nassert acc_reset([157, 40, 26, 154, 42, 148, 115, 136, 52, 46]) == [157, 0, 26, 180, 0, 148, 0, 136, 0, 46]\nassert acc_reset([79, 57, 91]) == [79, 136, 0]\nassert acc_reset([7, 107, 99, 90, 183]) == [7, 114, 0, 90, 0]\nassert acc_reset([29, 119, 72, 130, 138, 8]) == [29, 148, 0, 130, 0, 8]\nassert acc_reset([67, 90, 67]) == [67, 157, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 183:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 183:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 183 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([32, 55, 58, 78, 83, 85, 56]) == [32, 87, 145, 0, 83, 168, 0]`\nالجواب:", "qhash": "c108e5caa1a5c3c7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "select_range", "reference": "def select_range(xs):\n    return sorted(x * 2 for x in xs if 19 <= x <= 52)", "tests": ["assert select_range([40, 36, 32, 31, 42, 47, 40, 31, 51]) == [62, 62, 64, 72, 80, 80, 84, 94, 102]", "assert select_range([40, 27, 23, 36, -17, -30, -17]) == [46, 54, 72, 80]", "assert select_range([-7, 5, 5, 20, 36, -8]) == [40, 72]", "assert select_range([28, 28, -10, 54, 46]) == [56, 56, 92]", "assert select_range([42]) == [84]", "assert select_range([-15, 58, 21, -24, -3, 10, -18, 29, -6, 26]) == [42, 52, 58]", "assert select_range([]) == []", "assert select_range([]) == []"], "test_code": "assert select_range([40, 36, 32, 31, 42, 47, 40, 31, 51]) == [62, 62, 64, 72, 80, 80, 84, 94, 102]\nassert select_range([40, 27, 23, 36, -17, -30, -17]) == [46, 54, 72, 80]\nassert select_range([-7, 5, 5, 20, 36, -8]) == [40, 72]\nassert select_range([28, 28, -10, 54, 46]) == [56, 56, 92]\nassert select_range([42]) == [84]\nassert select_range([-15, 58, 21, -24, -3, 10, -18, 29, -6, 26]) == [42, 52, 58]\nassert select_range([]) == []\nassert select_range([]) == []", "answer": "def select_range(xs):\n    return sorted(x * 2 for x in xs if 19 <= x <= 52)", "completion": " ```python\ndef select_range(xs):\n    return sorted(x * 2 for x in xs if 19 <= x <= 52)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `select_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 2 لكل عنصر x في المدى المغلق [19, 52].\nمثال: `select_range([40, 36, 32, 31, 42, 47, 40, 31, 51]) == [62, 62, 64, 72, 80, 80, 84, 94, 102]`\nالجواب:", "qhash": "fe4e033d97d90126"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "pick_between", "reference": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if -14 <= x <= 19)", "tests": ["assert pick_between([18, 2, 1, 24, -15, 11, 13]) == [4, 8, 44, 52, 72]", "assert pick_between([36, 13, 41, 36, -5, 12, -19, -9, 42]) == [-36, -20, 48, 52]", "assert pick_between([-18, 18, 42, -29, 5, 54, 24, 14]) == [20, 56, 72]", "assert pick_between([]) == []", "assert pick_between([-21, -30, 48, 40, 54, -15, -22, 8]) == [32]", "assert pick_between([21, 7, 44, 17, -14, 10, -30, 38, 42, 15]) == [-56, 28, 40, 60, 68]", "assert pick_between([58, -24]) == []", "assert pick_between([]) == []"], "test_code": "assert pick_between([18, 2, 1, 24, -15, 11, 13]) == [4, 8, 44, 52, 72]\nassert pick_between([36, 13, 41, 36, -5, 12, -19, -9, 42]) == [-36, -20, 48, 52]\nassert pick_between([-18, 18, 42, -29, 5, 54, 24, 14]) == [20, 56, 72]\nassert pick_between([]) == []\nassert pick_between([-21, -30, 48, 40, 54, -15, -22, 8]) == [32]\nassert pick_between([21, 7, 44, 17, -14, 10, -30, 38, 42, 15]) == [-56, 28, 40, 60, 68]\nassert pick_between([58, -24]) == []\nassert pick_between([]) == []", "answer": "def pick_between(xs):\n    return sorted(x * 4 for x in xs if -14 <= x <= 19)", "completion": " ```python\ndef pick_between(xs):\n    return sorted(x * 4 for x in xs if -14 <= x <= 19)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `pick_between` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 4 لكل عنصر x في المدى المغلق [-14, 19].\nمثال: `pick_between([18, 2, 1, 24, -15, 11, 13]) == [4, 8, 44, 52, 72]`\nالجواب:", "qhash": "f466d115ebeeeacc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('م'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('برتقال رمل') == 0", "assert prefix_hits('شجرة طائرة نور مطر') == 1", "assert prefix_hits('مدينة ماء قهوة مطر ماء') == 4", "assert prefix_hits('باب قلم معلم حديقة وردة ليل صديق') == 1", "assert prefix_hits('معلم مكتبة نور لغة مطر سيارة جبل') == 3", "assert prefix_hits('دفتر مدينة ميناء تفاحة شجرة عربية نهر') == 2", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('برتقال رمل') == 0\nassert prefix_hits('شجرة طائرة نور مطر') == 1\nassert prefix_hits('مدينة ماء قهوة مطر ماء') == 4\nassert prefix_hits('باب قلم معلم حديقة وردة ليل صديق') == 1\nassert prefix_hits('معلم مكتبة نور لغة مطر سيارة جبل') == 3\nassert prefix_hits('دفتر مدينة ميناء تفاحة شجرة عربية نهر') == 2\nassert prefix_hits('') == 0", "answer": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('م'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if w.startswith('م'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if 'م' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي text التي تبدأ بالحرف «م»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(text):\n    count = 0\n    for w in text.split():\n        if 'م' in w:\n            count += 1\n    return count\n```\nمثال: `prefix_hits('برتقال رمل') == 0`\nالجواب:", "qhash": "1f557bbf24562ebb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(9, 5))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef go(n, k):\n    if k == 0:\n        return 1\n    return n * go(n, k - 1)\n\nprint(go(9, 5))\n```\nالجواب:", "qhash": "f90a9c41012f8eb6", "answer": "59049", "completion": " الناتج:\n```text\n59049\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x ** 2 - 2 for x in range(-1, 13) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x ** 2 - 2 for x in range(-1, 13) if x % 3 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "1fa20602414345a9", "answer": "[-2, 7, 34, 79, 142]\n5 260", "completion": " الناتج:\n```text\n[-2, 7, 34, 79, 142]\n5 260\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "sum_digit_pow", "reference": "def sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 84", "tests": ["assert sum_digit_pow(40084) == 52", "assert sum_digit_pow(567906) == 33", "assert sum_digit_pow(804431) == 80", "assert sum_digit_pow(613744) == 43", "assert sum_digit_pow(480910) == 46", "assert sum_digit_pow(60665) == 17", "assert sum_digit_pow(63979) == 28", "assert sum_digit_pow(0) == 0"], "test_code": "assert sum_digit_pow(40084) == 52\nassert sum_digit_pow(567906) == 33\nassert sum_digit_pow(804431) == 80\nassert sum_digit_pow(613744) == 43\nassert sum_digit_pow(480910) == 46\nassert sum_digit_pow(60665) == 17\nassert sum_digit_pow(63979) == 28\nassert sum_digit_pow(0) == 0", "answer": "def sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 84", "completion": " ```python\ndef sum_digit_pow(n):\n    return sum(int(d) ** 3 for d in str(n)) % 84\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `sum_digit_pow` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^3 لكل أرقام n) mod 84.\nمثال: `sum_digit_pow(40084) == 52`\nالجواب:", "qhash": "ac9ed42e4054a090"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "how_many", "reference": "def how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)", "tests": ["assert how_many('باب صحراء شجرة كتاب') == 0", "assert how_many('فجر حصان بحر دفتر') == 0", "assert how_many('ميناء نهر حاسوب عمل باب رمل') == 2", "assert how_many('') == 0", "assert how_many('حاسوب') == 0", "assert how_many('سلام قهوة') == 1", "assert how_many('جمل جبل') == 2", "assert how_many('') == 0"], "test_code": "assert how_many('باب صحراء شجرة كتاب') == 0\nassert how_many('فجر حصان بحر دفتر') == 0\nassert how_many('ميناء نهر حاسوب عمل باب رمل') == 2\nassert how_many('') == 0\nassert how_many('حاسوب') == 0\nassert how_many('سلام قهوة') == 1\nassert how_many('جمل جبل') == 2\nassert how_many('') == 0", "answer": "def how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)", "completion": " ```python\ndef how_many(text):\n    return sum(1 for w in text.split() if 'ل' in w)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `how_many` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تحتوي على الحرف «ل» مرة واحدة على الأقل.\nمثال: `how_many('باب صحراء شجرة كتاب') == 0`\nالجواب:", "qhash": "daa475a9caec15c4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "begin_count", "reference": "def begin_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "tests": ["assert begin_count('ليل برمجة امل نهر بيت كتاب سوق') == 1", "assert begin_count('سيارة خبز نهار عمل') == 0", "assert begin_count('ماء ماء حديقة قهوة عربية') == 0", "assert begin_count('قلم سماء') == 0", "assert begin_count('ميناء باب') == 0", "assert begin_count('حديقة باب') == 0", "assert begin_count('') == 0"], "test_code": "assert begin_count('ليل برمجة امل نهر بيت كتاب سوق') == 1\nassert begin_count('سيارة خبز نهار عمل') == 0\nassert begin_count('ماء ماء حديقة قهوة عربية') == 0\nassert begin_count('قلم سماء') == 0\nassert begin_count('ميناء باب') == 0\nassert begin_count('حديقة باب') == 0\nassert begin_count('') == 0", "answer": "def begin_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count", "completion": " ```python\ndef begin_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if w.startswith('ا'):\n            count += 1\n    return count\n```\n", "buggy": "def begin_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if 'ا' in w:\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي sentence التي تبدأ بالحرف «ا»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef begin_count(sentence):\n    count = 0\n    for w in sentence.split():\n        if 'ا' in w:\n            count += 1\n    return count\n```\nمثال: `begin_count('ليل برمجة امل نهر بيت كتاب سوق') == 1`\nالجواب:", "qhash": "92bef7e77a7fee2a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "tally", "reference": "def tally(s):\n    return {c: s.count(c) for c in 'ns'}", "tests": ["assert tally('engine is camel up by') == {'n': 2, 's': 1}", "assert tally('planet garden apple') == {'n': 2, 's': 0}", "assert tally('matrix in planet cloud cloud') == {'n': 2, 's': 0}", "assert tally('falcon stone orange is') == {'n': 3, 's': 2}", "assert tally('engine coffee at music') == {'n': 2, 's': 1}", "assert tally('desert stone apple planet data falcon') == {'n': 3, 's': 2}", "assert tally('') == {'n': 0, 's': 0}"], "test_code": "assert tally('engine is camel up by') == {'n': 2, 's': 1}\nassert tally('planet garden apple') == {'n': 2, 's': 0}\nassert tally('matrix in planet cloud cloud') == {'n': 2, 's': 0}\nassert tally('falcon stone orange is') == {'n': 3, 's': 2}\nassert tally('engine coffee at music') == {'n': 2, 's': 1}\nassert tally('desert stone apple planet data falcon') == {'n': 3, 's': 2}\nassert tally('') == {'n': 0, 's': 0}", "answer": "def tally(s):\n    return {c: s.count(c) for c in 'ns'}", "completion": " ```python\ndef tally(s):\n    return {c: s.count(c) for c in 'ns'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `tally` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'n'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `tally('engine is camel up by') == {'n': 2, 's': 1}`\nالجواب:", "qhash": "05ce7c7970c046b4"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "multiples_total", "reference": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "tests": ["assert multiples_total(111) == 3080", "assert multiples_total(184) == 8372", "assert multiples_total(6) == 6", "assert multiples_total(80) == 1560", "assert multiples_total(163) == 6642", "assert multiples_total(94) == 2162", "assert multiples_total(1) == 0"], "test_code": "assert multiples_total(111) == 3080\nassert multiples_total(184) == 8372\nassert multiples_total(6) == 6\nassert multiples_total(80) == 1560\nassert multiples_total(163) == 6642\nassert multiples_total(94) == 2162\nassert multiples_total(1) == 0", "answer": "def multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)", "completion": " ```python\ndef multiples_total(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 4 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `multiples_total` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 4 دون باقٍ.\nمثال: `multiples_total(111) == 3080`\nالجواب:", "qhash": "17c2d37731e8f428"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 101", "tests": ["assert mfact(4) == 4", "assert mfact(5) == 5", "assert mfact(60) == 5", "assert mfact(32) == 30", "assert mfact(49) == 9", "assert mfact(13) == 80", "assert mfact(0) == 1"], "test_code": "assert mfact(4) == 4\nassert mfact(5) == 5\nassert mfact(60) == 5\nassert mfact(32) == 30\nassert mfact(49) == 9\nassert mfact(13) == 80\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 101", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 4)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(4) == 4`\nالجواب:", "qhash": "2f120d69da9dd258"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_digit_pow#2", "entry": "digit_score", "reference": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 4", "tests": ["assert digit_score(32026) == 1", "assert digit_score(425453) == 3", "assert digit_score(117517) == 2", "assert digit_score(425772) == 3", "assert digit_score(205212) == 2", "assert digit_score(424599) == 3", "assert digit_score(972209) == 3", "assert digit_score(0) == 0"], "test_code": "assert digit_score(32026) == 1\nassert digit_score(425453) == 3\nassert digit_score(117517) == 2\nassert digit_score(425772) == 3\nassert digit_score(205212) == 2\nassert digit_score(424599) == 3\nassert digit_score(972209) == 3\nassert digit_score(0) == 0", "answer": "def digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 4", "completion": " ```python\ndef digit_score(n):\n    return sum(int(d) ** 4 for d in str(n)) % 4\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `digit_score` التي تستقبل عددًا طبيعيًا n وتعيد (Σ رقم^4 لكل أرقام n) mod 4.\nمثال: `digit_score(32026) == 1`\nالجواب:", "qhash": "43541634004a23cc"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "how_many_div", "reference": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert how_many_div([77, 16, 21, 5, 39, 79, 6]) == 2", "assert how_many_div([60, -34, 28, 33, 74, 89, -7, 6, 11]) == 1", "assert how_many_div([-33, 50]) == 0", "assert how_many_div([66, 51, -13, 72]) == 0", "assert how_many_div([-38, 61]) == 0", "assert how_many_div([-27, 79, 77, -39, 57, 76, -14, -21, -31, 6, -21, -15]) == 4", "assert how_many_div([]) == 0"], "test_code": "assert how_many_div([77, 16, 21, 5, 39, 79, 6]) == 2\nassert how_many_div([60, -34, 28, 33, 74, 89, -7, 6, 11]) == 1\nassert how_many_div([-33, 50]) == 0\nassert how_many_div([66, 51, -13, 72]) == 0\nassert how_many_div([-38, 61]) == 0\nassert how_many_div([-27, 79, 77, -39, 57, 76, -14, -21, -31, 6, -21, -15]) == 4\nassert how_many_div([]) == 0", "answer": "def how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if x % 7 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 7 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef how_many_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `how_many_div([77, 16, 21, 5, 39, 79, 6]) == 2`\nالجواب:", "qhash": "b4b6c79737c64e62"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "phi_upto", "reference": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 27) == 1)", "tests": ["assert phi_upto(138) == 92", "assert phi_upto(187) == 125", "assert phi_upto(80) == 54", "assert phi_upto(187) == 125", "assert phi_upto(37) == 25", "assert phi_upto(134) == 90", "assert phi_upto(1) == 1"], "test_code": "assert phi_upto(138) == 92\nassert phi_upto(187) == 125\nassert phi_upto(80) == 54\nassert phi_upto(187) == 125\nassert phi_upto(37) == 25\nassert phi_upto(134) == 90\nassert phi_upto(1) == 1", "answer": "def phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 27) == 1)", "completion": " ```python\ndef phi_upto(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 27) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `phi_upto` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 27 في أي قاسم أكبر من 1.\nمثال: `phi_upto(138) == 92`\nالجواب:", "qhash": "4953bddfa0aa6a65"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_running#2", "entry": "acc_reset", "reference": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out", "tests": ["assert acc_reset([13, 10, 5, 6, 3, 6, 1, 11, 1, 7]) == [13, 0, 5, 11, 14, 0, 1, 12, 13, 0]", "assert acc_reset([-9, -6, 8, -6]) == [-9, -15, -7, -13]", "assert acc_reset([-6, -5, 0, 12, 0, 14, 15]) == [-6, -11, -11, 1, 1, 15, 0]", "assert acc_reset([10, -7, 8, 14, 14, -9, 15]) == [10, 3, 11, 0, 14, 5, 0]", "assert acc_reset([8, 11, 13, 2]) == [8, 0, 13, 15]", "assert acc_reset([13, -5, 10, -10, 7, 11, 8, 14, 8, 10]) == [13, 8, 0, -10, -3, 8, 16, 0, 8, 0]", "assert acc_reset([]) == []"], "test_code": "assert acc_reset([13, 10, 5, 6, 3, 6, 1, 11, 1, 7]) == [13, 0, 5, 11, 14, 0, 1, 12, 13, 0]\nassert acc_reset([-9, -6, 8, -6]) == [-9, -15, -7, -13]\nassert acc_reset([-6, -5, 0, 12, 0, 14, 15]) == [-6, -11, -11, 1, 1, 15, 0]\nassert acc_reset([10, -7, 8, 14, 14, -9, 15]) == [10, 3, 11, 0, 14, 5, 0]\nassert acc_reset([8, 11, 13, 2]) == [8, 0, 13, 15]\nassert acc_reset([13, -5, 10, -10, 7, 11, 8, 14, 8, 10]) == [13, 8, 0, -10, -3, 8, 16, 0, 8, 0]\nassert acc_reset([]) == []", "answer": "def acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out", "completion": " ```python\ndef acc_reset(xs):\n    out, s = [], 0\n    for x in xs:\n        s += x\n        if s > 16:\n            s = 0\n        out.append(s)\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `acc_reset` التي تستقبل قائمة أعداد وتعيد مجاميعها التراكمية، بحيث يُعاد المجموع إلى الصفر كلما تجاوز 16 (القيمة المسجلة حينها 0).\nمثال: `acc_reset([13, 10, 5, 6, 3, 6, 1, 11, 1, 7]) == [13, 0, 5, 11, 14, 0, 1, 12, 13, 0]`\nالجواب:", "qhash": "3b7c86a806241ce2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [(x + 1) // 4 for x in range(-5, 5) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [(x + 1) // 4 for x in range(-5, 5) if x % 4 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "de3d0f5ff0d41537", "answer": "[-1, 0, 1]\n3 0", "completion": " الناتج:\n```text\n[-1, 0, 1]\n3 0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "loops", "template": "c_count_div#2", "entry": "count_div", "reference": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 4 != 0:\n            count += 1\n    return count", "tests": ["assert count_div([74, 67, 72, 53, 7, 50, 19, 61, 0]) == 0", "assert count_div([53]) == 0", "assert count_div([0, 8, 70, 15, -38, -36, -38, -6, 40, 81]) == 3", "assert count_div([-18, 48, 80, 44, 7, 54]) == 2", "assert count_div([79]) == 0", "assert count_div([69, 16, 4, 21, -19]) == 2", "assert count_div([]) == 0"], "test_code": "assert count_div([74, 67, 72, 53, 7, 50, 19, 61, 0]) == 0\nassert count_div([53]) == 0\nassert count_div([0, 8, 70, 15, -38, -36, -38, -6, 40, 81]) == 3\nassert count_div([-18, 48, 80, 44, 7, 54]) == 2\nassert count_div([79]) == 0\nassert count_div([69, 16, 4, 21, -19]) == 2\nassert count_div([]) == 0", "answer": "def count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 4 != 0:\n            count += 1\n    return count", "completion": " ```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if x % 3 == 0 and x % 4 != 0:\n            count += 1\n    return count\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة عدد عناصر xs التي تقبل القسمة على 3 ولا تقبل القسمة على 4. اكتب الحل كاملًا.\n```python\ndef count_div(xs):\n    count = 0\n    for x in xs:\n        if ____:\n            count += 1\n    return count\n```\nمثال: `count_div([74, 67, 72, 53, 7, 50, 19, 61, 0]) == 0`\nالجواب:", "qhash": "f31df8c01dfcbb39"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "n = 50\ncount = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nn = 50\ncount = 0\nwhile n != 1:\n    if n % 2 == 0:\n        n = n // 2\n    else:\n        n = 3 * n + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "4ca2e086843b4c21", "answer": "24", "completion": " الناتج:\n```text\n24\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x ** 2 - 5 for x in range(5, 18) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x ** 2 - 5 for x in range(5, 18) if x % 5 == 3]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "e6f4a5cad8b383d8", "answer": "[59, 164]\n2 223", "completion": " الناتج:\n```text\n[59, 164]\n2 223\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 53", "tests": ["assert step_product(4) == 24", "assert step_product(52) == 52", "assert step_product(40) == 26", "assert step_product(57) == 0", "assert step_product(2) == 2", "assert step_product(32) == 5", "assert step_product(0) == 1"], "test_code": "assert step_product(4) == 24\nassert step_product(52) == 52\nassert step_product(40) == 26\nassert step_product(57) == 0\nassert step_product(2) == 2\nassert step_product(32) == 5\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 53", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 1)) % 53\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−1) × (n−2) × … للحدود الموجبة، مع أخذ باقي القسمة على 53 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(4) == 24`\nالجواب:", "qhash": "ea89e6ad3a37d378"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "recursion", "template": "p_rec#2", "code": "def calc(n):\n    if n < 10:\n        return n\n    return n % 10 + calc(n // 10)\n\nprint(calc(337501231))\nprint(calc(calc(337501231)))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef calc(n):\n    if n < 10:\n        return n\n    return n % 10 + calc(n // 10)\n\nprint(calc(337501231))\nprint(calc(calc(337501231)))\n```\nالجواب:", "qhash": "f176428077930f27", "answer": "25\n7", "completion": " الناتج:\n```text\n25\n7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 72619\ncount = 0\nwhile x > 19:\n    x = x // 3\n    count += 1\nprint(x, count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 72619\ncount = 0\nwhile x > 19:\n    x = x // 3\n    count += 1\nprint(x, count)\n```\nالجواب:", "qhash": "f488f5398854c5cc", "answer": "11 8", "completion": " الناتج:\n```text\n11 8\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "total_multiples", "reference": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "tests": ["assert total_multiples(246) == 9005", "assert total_multiples(259) == 10014", "assert total_multiples(58) == 514", "assert total_multiples(103) == 1554", "assert total_multiples(271) == 11073", "assert total_multiples(29) == 123", "assert total_multiples(1) == 0"], "test_code": "assert total_multiples(246) == 9005\nassert total_multiples(259) == 10014\nassert total_multiples(58) == 514\nassert total_multiples(103) == 1554\nassert total_multiples(271) == 11073\nassert total_multiples(29) == 123\nassert total_multiples(1) == 0", "answer": "def total_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)", "completion": " ```python\ndef total_multiples(n):\n    return sum(x for x in range(1, n) if x % 5 == 0 or x % 8 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `total_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 5 أو 8 دون باقٍ.\nمثال: `total_multiples(246) == 9005`\nالجواب:", "qhash": "283164009a7e6174"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "step_product", "reference": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 101", "tests": ["assert step_product(3) == 3", "assert step_product(45) == 95", "assert step_product(9) == 45", "assert step_product(9) == 45", "assert step_product(3) == 3", "assert step_product(1) == 1", "assert step_product(0) == 1"], "test_code": "assert step_product(3) == 3\nassert step_product(45) == 95\nassert step_product(9) == 45\nassert step_product(9) == 45\nassert step_product(3) == 3\nassert step_product(1) == 1\nassert step_product(0) == 1", "answer": "def step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 101", "completion": " ```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return (n * step_product(n - 4)) % 101\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−4) × (n−8) × … للحدود الموجبة، مع أخذ باقي القسمة على 101 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef step_product(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `step_product(3) == 3`\nالجواب:", "qhash": "8b8ee0590d3e7883"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "arabic_text", "template": "f_starts_with#2", "entry": "prefix_hits", "reference": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ر'):\n            count += 1\n    return count", "tests": ["assert prefix_hits('شمس سلام طالب ليل مدرسة') == 0", "assert prefix_hits('حديقة سلام باب حديقة حاسوب صديق') == 0", "assert prefix_hits('بحر رمل رمل حصان نور') == 2", "assert prefix_hits('رمل خبز رمل قهوة نهار') == 2", "assert prefix_hits('معلم سفينة شجرة شمس سوق') == 0", "assert prefix_hits('سفينة فجر قلم وردة تفاحة') == 0", "assert prefix_hits('') == 0"], "test_code": "assert prefix_hits('شمس سلام طالب ليل مدرسة') == 0\nassert prefix_hits('حديقة سلام باب حديقة حاسوب صديق') == 0\nassert prefix_hits('بحر رمل رمل حصان نور') == 2\nassert prefix_hits('رمل خبز رمل قهوة نهار') == 2\nassert prefix_hits('معلم سفينة شجرة شمس سوق') == 0\nassert prefix_hits('سفينة فجر قلم وردة تفاحة') == 0\nassert prefix_hits('') == 0", "answer": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ر'):\n            count += 1\n    return count", "completion": " ```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.startswith('ر'):\n            count += 1\n    return count\n```\n", "buggy": "def prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ر'):\n            count += 1\n    return count", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع عدد الكلمات (المفصولة بمسافات) في النص العربي line التي تبدأ بالحرف «ر»؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef prefix_hits(line):\n    count = 0\n    for w in line.split():\n        if w.endswith('ر'):\n            count += 1\n    return count\n```\nمثال: `prefix_hits('شمس سلام طالب ليل مدرسة') == 0`\nالجواب:", "qhash": "b793d6dc8f283acf"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "clip_scale", "reference": "def clip_scale(xs):\n    return sorted(x * 1 for x in xs if 20 <= x <= 36)", "tests": ["assert clip_scale([38, 29, 22, 39, 13]) == [22, 29]", "assert clip_scale([]) == []", "assert clip_scale([22, 54]) == [22]", "assert clip_scale([-2, 41]) == []", "assert clip_scale([28, 59, 54]) == [28]", "assert clip_scale([59, -30, -17, 33, 15, 47, -25, 46]) == [33]", "assert clip_scale([4, 11, -21, 12, -15, 49, -4, 41]) == []", "assert clip_scale([]) == []"], "test_code": "assert clip_scale([38, 29, 22, 39, 13]) == [22, 29]\nassert clip_scale([]) == []\nassert clip_scale([22, 54]) == [22]\nassert clip_scale([-2, 41]) == []\nassert clip_scale([28, 59, 54]) == [28]\nassert clip_scale([59, -30, -17, 33, 15, 47, -25, 46]) == [33]\nassert clip_scale([4, 11, -21, 12, -15, 49, -4, 41]) == []\nassert clip_scale([]) == []", "answer": "def clip_scale(xs):\n    return sorted(x * 1 for x in xs if 20 <= x <= 36)", "completion": " ```python\ndef clip_scale(xs):\n    return sorted(x * 1 for x in xs if 20 <= x <= 36)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `clip_scale` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × 1 لكل عنصر x في المدى المغلق [20, 36].\nمثال: `clip_scale([38, 29, 22, 39, 13]) == [22, 29]`\nالجواب:", "qhash": "c423e9e68b9a24d1"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "s = 'برمجة'\nprint(len(s))\nprint('ر' in s)\nprint(s.count('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'برمجة'\nprint(len(s))\nprint('ر' in s)\nprint(s.count('ر'))\n```\nالجواب:", "qhash": "bd0148d16c34f347", "answer": "5\nTrue\n1", "completion": " الناتج:\n```text\n5\nTrue\n1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "functions", "template": "p_func#2", "code": "def g(x, y=8):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(g(1))\nprint(g(1, 12))\nprint(g(g(12), 1))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ndef g(x, y=8):\n    if x > y:\n        return x * -3 - y\n    return x + y * -3\n\nprint(g(1))\nprint(g(1, 12))\nprint(g(g(12), 1))\n```\nالجواب:", "qhash": "c208c75b46785869", "answer": "-23\n-35\n-47", "completion": " الناتج:\n```text\n-23\n-35\n-47\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['planet', 'summer', 'coffee', 'garden', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['planet', 'summer', 'coffee', 'garden', 'music']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "7eb0bea7e2145a36", "answer": "['music', 'planet', 'summer', 'coffee', 'garden']\n['summer', 'planet', 'garden']", "completion": " الناتج:\n```text\n['music', 'planet', 'summer', 'coffee', 'garden']\n['summer', 'planet', 'garden']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x * 0 + -9 for x in range(-2, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x * 0 + -9 for x in range(-2, 12) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "7a66a8148e23b426", "answer": "[-9, -9, -9, -9, -9, -9, -9]\n7 -63", "completion": " الناتج:\n```text\n[-9, -9, -9, -9, -9, -9, -9]\n7 -63\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 3\n    return total", "tests": ["assert series(5) == 2025", "assert series(7) == 7056", "assert series(11) == 39204", "assert series(1) == 9", "assert series(7) == 7056", "assert series(1) == 9", "assert series(0) == 0"], "test_code": "assert series(5) == 2025\nassert series(7) == 7056\nassert series(11) == 39204\nassert series(1) == 9\nassert series(7) == 7056\nassert series(1) == 9\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 3\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 9 * i ** 3\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 9 * i ** 3\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 9 × i^3 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total = 9 * i ** 3\n    return total\n```\nمثال: `series(5) == 2025`\nالجواب:", "qhash": "b97e3d6cdb20674a"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x ** 2 - 9 for x in range(0, 6) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x ** 2 - 9 for x in range(0, 6) if x % 2 == 0]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "bf7564531b0541e2", "answer": "[-9, -5, 7]\n3 -7", "completion": " الناتج:\n```text\n[-9, -5, 7]\n3 -7\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "xs = [-2, 1, -3, 21, 34, 23]\nprint(xs[1:4])\nprint(xs[::-2])\nprint(sum(xs[1:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nxs = [-2, 1, -3, 21, 34, 23]\nprint(xs[1:4])\nprint(xs[::-2])\nprint(sum(xs[1:4]))\n```\nالجواب:", "qhash": "7374d88a3366bacf", "answer": "[1, -3, 21]\n[23, 21, 1]\n19", "completion": " الناتج:\n```text\n[1, -3, 21]\n[23, 21, 1]\n19\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "res = [(x + 8) // 2 for x in range(-1, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nres = [(x + 8) // 2 for x in range(-1, 11) if x % 2 == 0]\nprint(res)\nprint(len(res), sum(res))\n```\nالجواب:", "qhash": "dcad21d7448defd6", "answer": "[4, 5, 6, 7, 8, 9]\n6 39", "completion": " الناتج:\n```text\n[4, 5, 6, 7, 8, 9]\n6 39\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "nums = [11, 16, -5, 12, -6, 13, 9, 24]\nprint(nums[3:5])\nprint(nums[::-2])\nprint(sum(nums[3:5]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nnums = [11, 16, -5, 12, -6, 13, 9, 24]\nprint(nums[3:5])\nprint(nums[::-2])\nprint(sum(nums[3:5]))\n```\nالجواب:", "qhash": "14a15c20efd691d5", "answer": "[12, -6]\n[24, 13, 12, 16]\n6", "completion": " الناتج:\n```text\n[12, -6]\n[24, 13, 12, 16]\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([13, 26, 43, 19]) == None", "assert max_multiple([-20, -16, -8]) == -8", "assert max_multiple([1]) == None", "assert max_multiple([20, 27, 16, 16, -10, 36, -5, -24, 31]) == 36", "assert max_multiple([0, -36, -10, -40, 41]) == 0", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([13, 26, 43, 19]) == None\nassert max_multiple([-20, -16, -8]) == -8\nassert max_multiple([1]) == None\nassert max_multiple([20, 27, 16, 16, -10, 36, -5, -24, 31]) == 36\nassert max_multiple([0, -36, -10, -40, 41]) == 0\nassert max_multiple([]) == None", "answer": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 4 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 4 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة nums يقبل القسمة على 4، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(nums):\n    best = None\n    for x in nums:\n        if x % 4 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_multiple([13, 26, 43, 19]) == None`\nالجواب:", "qhash": "cf0a751f7aaab1e3"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "s = 'river'\nprint(s.count('e'))\nprint(len(s))\nprint(s.split('_'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'river'\nprint(s.count('e'))\nprint(len(s))\nprint(s.split('_'))\n```\nالجواب:", "qhash": "cc119c098dd3a73b", "answer": "1\n5\n['river']", "completion": " الناتج:\n```text\n1\n5\n['river']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "vals = [x ** 2 - 10 for x in range(6, 20) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nvals = [x ** 2 - 10 for x in range(6, 20) if x % 4 == 3]\nprint(vals)\nprint(len(vals), sum(vals))\n```\nالجواب:", "qhash": "c514408b46e5c9ff", "answer": "[39, 111, 215, 351]\n4 716", "completion": " الناتج:\n```text\n[39, 111, 215, 351]\n4 716\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "sum_multiples", "reference": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 5 == 0)", "tests": ["assert sum_multiples(94) == 2567", "assert sum_multiples(157) == 7442", "assert sum_multiples(205) == 12506", "assert sum_multiples(89) == 2385", "assert sum_multiples(112) == 3685", "assert sum_multiples(234) == 16217", "assert sum_multiples(1) == 0"], "test_code": "assert sum_multiples(94) == 2567\nassert sum_multiples(157) == 7442\nassert sum_multiples(205) == 12506\nassert sum_multiples(89) == 2385\nassert sum_multiples(112) == 3685\nassert sum_multiples(234) == 16217\nassert sum_multiples(1) == 0", "answer": "def sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 5 == 0)", "completion": " ```python\ndef sum_multiples(n):\n    return sum(x for x in range(1, n) if x % 2 == 0 or x % 5 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `sum_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 2 أو 5 دون باقٍ.\nمثال: `sum_multiples(94) == 2567`\nالجواب:", "qhash": "caee20b0320dfdb5"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [25, 35, 1, 35, 14, 4, 15]\nprint(a[2:4])\nprint(a[::3])\nprint(len(a[2:4]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [25, 35, 1, 35, 14, 4, 15]\nprint(a[2:4])\nprint(a[::3])\nprint(len(a[2:4]))\n```\nالجواب:", "qhash": "1bb361dd3780e163", "answer": "[1, 35]\n[25, 35, 15]\n2", "completion": " الناتج:\n```text\n[1, 35]\n[25, 35, 15]\n2\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "multi_fact", "reference": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 2)) % 61", "tests": ["assert multi_fact(8) == 18", "assert multi_fact(58) == 11", "assert multi_fact(8) == 18", "assert multi_fact(36) == 34", "assert multi_fact(1) == 1", "assert multi_fact(41) == 20", "assert multi_fact(0) == 1"], "test_code": "assert multi_fact(8) == 18\nassert multi_fact(58) == 11\nassert multi_fact(8) == 18\nassert multi_fact(36) == 34\nassert multi_fact(1) == 1\nassert multi_fact(41) == 20\nassert multi_fact(0) == 1", "answer": "def multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 2)) % 61", "completion": " ```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return (n * multi_fact(n - 2)) % 61\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−2) × (n−4) × … للحدود الموجبة، مع أخذ باقي القسمة على 61 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef multi_fact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `multi_fact(8) == 18`\nالجواب:", "qhash": "6287cb7523b223dd"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_gcd1", "reference": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 79) == 1)", "tests": ["assert count_gcd1(34) == 34", "assert count_gcd1(193) == 191", "assert count_gcd1(141) == 140", "assert count_gcd1(66) == 66", "assert count_gcd1(181) == 179", "assert count_gcd1(23) == 23", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(34) == 34\nassert count_gcd1(193) == 191\nassert count_gcd1(141) == 140\nassert count_gcd1(66) == 66\nassert count_gcd1(181) == 179\nassert count_gcd1(23) == 23\nassert count_gcd1(1) == 1", "answer": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 79) == 1)", "completion": " ```python\ndef count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 79) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_gcd1` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 79 في أي قاسم أكبر من 1.\nمثال: `count_gcd1(34) == 34`\nالجواب:", "qhash": "4201b9490311b79e"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "lists", "template": "w_filter_range#2", "entry": "filter_range", "reference": "def filter_range(xs):\n    return sorted(x * -1 for x in xs if 7 <= x <= 35)", "tests": ["assert filter_range([44, 31, 18, 1, 5, 31]) == [-31, -31, -18]", "assert filter_range([46, -1, 0]) == []", "assert filter_range([48, 33, 59, -10, 0, 42, 50]) == [-33]", "assert filter_range([-27, 60, -14, 26]) == [-26]", "assert filter_range([22, -17, -9, 39, -29, 47, 56, -27, -20]) == [-22]", "assert filter_range([15, -8, 2, 49, 36, 11]) == [-15, -11]", "assert filter_range([15, 1]) == [-15]", "assert filter_range([]) == []"], "test_code": "assert filter_range([44, 31, 18, 1, 5, 31]) == [-31, -31, -18]\nassert filter_range([46, -1, 0]) == []\nassert filter_range([48, 33, 59, -10, 0, 42, 50]) == [-33]\nassert filter_range([-27, 60, -14, 26]) == [-26]\nassert filter_range([22, -17, -9, 39, -29, 47, 56, -27, -20]) == [-22]\nassert filter_range([15, -8, 2, 49, 36, 11]) == [-15, -11]\nassert filter_range([15, 1]) == [-15]\nassert filter_range([]) == []", "answer": "def filter_range(xs):\n    return sorted(x * -1 for x in xs if 7 <= x <= 35)", "completion": " ```python\ndef filter_range(xs):\n    return sorted(x * -1 for x in xs if 7 <= x <= 35)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `filter_range` التي تستقبل قائمة أعداد xs وتعيد قائمة تصاعدية بقيم x × -1 لكل عنصر x في المدى المغلق [7, 35].\nمثال: `filter_range([44, 31, 18, 1, 5, 31]) == [-31, -31, -18]`\nالجواب:", "qhash": "ca49187693478f97"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "coprimes", "reference": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 62) == 1)", "tests": ["assert coprimes(48) == 23", "assert coprimes(160) == 77", "assert coprimes(106) == 51", "assert coprimes(191) == 93", "assert coprimes(149) == 73", "assert coprimes(176) == 85", "assert coprimes(1) == 1"], "test_code": "assert coprimes(48) == 23\nassert coprimes(160) == 77\nassert coprimes(106) == 51\nassert coprimes(191) == 93\nassert coprimes(149) == 73\nassert coprimes(176) == 85\nassert coprimes(1) == 1", "answer": "def coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 62) == 1)", "completion": " ```python\ndef coprimes(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 62) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `coprimes` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 62 في أي قاسم أكبر من 1.\nمثال: `coprimes(48) == 23`\nالجواب:", "qhash": "e71fa888a6a2d5c9"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "for_loop", "template": "p_loop#2", "code": "s = 2\nfor j in range(-4, 8, 2):\n    s -= j * 1\nprint(s)\nprint(j)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 2\nfor j in range(-4, 8, 2):\n    s -= j * 1\nprint(s)\nprint(j)\n```\nالجواب:", "qhash": "24a3ef95318e5f32", "answer": "-4\n6", "completion": " الناتج:\n```text\n-4\n6\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'bhi'}", "tests": ["assert letter_stats('we go orange camel we winter') == {'b': 0, 'h': 0, 'i': 1}", "assert letter_stats('river river light python') == {'b': 0, 'h': 2, 'i': 3}", "assert letter_stats('cloud falcon engine') == {'b': 0, 'h': 0, 'i': 1}", "assert letter_stats('apple') == {'b': 0, 'h': 0, 'i': 0}", "assert letter_stats('of') == {'b': 0, 'h': 0, 'i': 0}", "assert letter_stats('light orange vector falcon') == {'b': 0, 'h': 1, 'i': 1}", "assert letter_stats('') == {'b': 0, 'h': 0, 'i': 0}"], "test_code": "assert letter_stats('we go orange camel we winter') == {'b': 0, 'h': 0, 'i': 1}\nassert letter_stats('river river light python') == {'b': 0, 'h': 2, 'i': 3}\nassert letter_stats('cloud falcon engine') == {'b': 0, 'h': 0, 'i': 1}\nassert letter_stats('apple') == {'b': 0, 'h': 0, 'i': 0}\nassert letter_stats('of') == {'b': 0, 'h': 0, 'i': 0}\nassert letter_stats('light orange vector falcon') == {'b': 0, 'h': 1, 'i': 1}\nassert letter_stats('') == {'b': 0, 'h': 0, 'i': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'bhi'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'bhi'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'b'، 'h'، 'i' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('we go orange camel we winter') == {'b': 0, 'h': 0, 'i': 1}`\nالجواب:", "qhash": "930a7eb988203c5f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "dict", "template": "p_dict#2", "code": "scores = {'فيصل': 4, 'وليد': 7, 'حسن': 50, 'أحمد': 37, 'هشام': 44}\nscores['فيصل'] += 20\nscores['زينب'] = 54\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 10])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nscores = {'فيصل': 4, 'وليد': 7, 'حسن': 50, 'أحمد': 37, 'هشام': 44}\nscores['فيصل'] += 20\nscores['زينب'] = 54\nprint(len(scores))\nprint(max(scores, key=scores.get))\nprint(sum(scores.values()))\nprint([k for k in scores if scores[k] > 10])\n```\nالجواب:", "qhash": "e5ce7f2a5278d31f", "answer": "6\nزينب\n216\n['فيصل', 'حسن', 'أحمد', 'هشام', 'زينب']", "completion": " الناتج:\n```text\n6\nزينب\n216\n['فيصل', 'حسن', 'أحمد', 'هشام', 'زينب']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'حاسوب ميناء'\nprint(len(kalima))\nprint(kalima.count('ب'))\nprint('ب' in kalima)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'حاسوب ميناء'\nprint(len(kalima))\nprint(kalima.count('ب'))\nprint('ب' in kalima)\n```\nالجواب:", "qhash": "a6330082ef0d8d6c", "answer": "11\n1\nTrue", "completion": " الناتج:\n```text\n11\n1\nTrue\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "loops", "template": "w_fizz#2", "entry": "fizzbuzz", "reference": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "tests": ["assert fizzbuzz(10) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10']", "assert fizzbuzz(19) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', '16', '17', 'SunMoon', '19']", "assert fizzbuzz(4) == ['1', '2', 'Sun', '4']", "assert fizzbuzz(5) == ['1', '2', 'Sun', '4', '5']", "assert fizzbuzz(24) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', '16', '17', 'SunMoon', '19', '20', 'Sun', '22', '23', 'SunMoon']"], "test_code": "assert fizzbuzz(10) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10']\nassert fizzbuzz(19) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', '16', '17', 'SunMoon', '19']\nassert fizzbuzz(4) == ['1', '2', 'Sun', '4']\nassert fizzbuzz(5) == ['1', '2', 'Sun', '4', '5']\nassert fizzbuzz(24) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10', '11', 'SunMoon', '13', '14', 'Sun', '16', '17', 'SunMoon', '19', '20', 'Sun', '22', '23', 'SunMoon']", "answer": "def fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out", "completion": " ```python\ndef fizzbuzz(n):\n    out = []\n    for i in range(1, n + 1):\n        s = ''\n        if i % 3 == 0:\n            s += 'Sun'\n        if i % 6 == 0:\n            s += 'Moon'\n        out.append(s or str(i))\n    return out\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `fizzbuzz` التي تستقبل n وتعيد قائمة بطول n: مضاعفات 3 تصبح 'Sun'، مضاعفات 6 تصبح 'Moon'، المضاعفات المشتركة تصبح 'SunMoon'، وبقية الأعداد تبقى أرقامًا بصيغة نص.\nمثال: `fizzbuzz(10) == ['1', '2', 'Sun', '4', '5', 'SunMoon', '7', '8', 'Sun', '10']`\nالجواب:", "qhash": "4147cfb1790aac36"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 218\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 218\nsteps = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    steps += 1\nprint(steps)\n```\nالجواب:", "qhash": "fc92b2d6fc20de40", "answer": "114", "completion": " الناتج:\n```text\n114\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [x * 0 + -5 for x in range(-3, 10) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [x * 0 + -5 for x in range(-3, 10) if x % 5 == 1]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "bbbcb8003f4e00db", "answer": "[-5, -5]\n2 -10", "completion": " الناتج:\n```text\n[-5, -5]\n2 -10\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "word = 'river_winter'\nprint(word.find('w'))\nprint(word.count('w'))\nprint(word[0:12])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nword = 'river_winter'\nprint(word.find('w'))\nprint(word.count('w'))\nprint(word[0:12])\n```\nالجواب:", "qhash": "3f78469a1eaad2c9", "answer": "6\n1\nriver_winter", "completion": " الناتج:\n```text\n6\n1\nriver_winter\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "text = 'نهر عمل'\nprint(text.count('ر'))\nprint(text[0])\nprint(text.split())", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ntext = 'نهر عمل'\nprint(text.count('ر'))\nprint(text[0])\nprint(text.split())\n```\nالجواب:", "qhash": "e5eabc5e119744cb", "answer": "1\nن\n['نهر', 'عمل']", "completion": " الناتج:\n```text\n1\nن\n['نهر', 'عمل']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_slicing", "template": "p_slice#2", "code": "a = [-5, -9, 8, 20, 35, 30, 19, -1, 18]\nprint(a[3:8])\nprint(a[::2])\nprint(min(a[3:8]))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\na = [-5, -9, 8, 20, 35, 30, 19, -1, 18]\nprint(a[3:8])\nprint(a[::2])\nprint(min(a[3:8]))\n```\nالجواب:", "qhash": "0f4fd3ca742d932f", "answer": "[20, 35, 30, 19, -1]\n[-5, 8, 35, 19, 18]\n-1", "completion": " الناتج:\n```text\n[20, 35, 30, 19, -1]\n[-5, 8, 35, 19, 18]\n-1\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "sorting", "template": "p_sort#2", "code": "words = ['falcon', 'stone', 'desert', 'python', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nwords = ['falcon', 'stone', 'desert', 'python', 'garden']\nprint(sorted(words, key=len))\nprint(sorted(words, key=lambda w: (len(w), w), reverse=True)[:3])\n```\nالجواب:", "qhash": "11a28fcb6afd7be6", "answer": "['stone', 'falcon', 'desert', 'python', 'garden']\n['python', 'garden', 'falcon']", "completion": " الناتج:\n```text\n['stone', 'falcon', 'desert', 'python', 'garden']\n['python', 'garden', 'falcon']\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "count_chars", "reference": "def count_chars(s):\n    return {c: s.count(c) for c in 'cl'}", "tests": ["assert count_chars('up brain music in is python') == {'c': 1, 'l': 0}", "assert count_chars('we') == {'c': 0, 'l': 0}", "assert count_chars('orange matrix stone cloud we in') == {'c': 1, 'l': 1}", "assert count_chars('of to') == {'c': 0, 'l': 0}", "assert count_chars('brain river vector') == {'c': 1, 'l': 0}", "assert count_chars('on an light') == {'c': 0, 'l': 1}", "assert count_chars('') == {'c': 0, 'l': 0}"], "test_code": "assert count_chars('up brain music in is python') == {'c': 1, 'l': 0}\nassert count_chars('we') == {'c': 0, 'l': 0}\nassert count_chars('orange matrix stone cloud we in') == {'c': 1, 'l': 1}\nassert count_chars('of to') == {'c': 0, 'l': 0}\nassert count_chars('brain river vector') == {'c': 1, 'l': 0}\nassert count_chars('on an light') == {'c': 0, 'l': 1}\nassert count_chars('') == {'c': 0, 'l': 0}", "answer": "def count_chars(s):\n    return {c: s.count(c) for c in 'cl'}", "completion": " ```python\ndef count_chars(s):\n    return {c: s.count(c) for c in 'cl'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_chars` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'c'، 'l' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `count_chars('up brain music in is python') == {'c': 1, 'l': 0}`\nالجواب:", "qhash": "5286c8b71884fea0"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "m = 322\nc = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    c += 1\nprint(c)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nm = 322\nc = 0\nwhile m != 1:\n    if m % 2 == 0:\n        m = m // 2\n    else:\n        m = 3 * m + 1\n    c += 1\nprint(c)\n```\nالجواب:", "qhash": "46e10b00e28b735d", "answer": "99", "completion": " الناتج:\n```text\n99\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "arabic_text", "template": "p_arabic#2", "code": "kalima = 'عمل'\nprint(kalima.find('ر'))\nprint(kalima[0])\nprint(kalima.count('ر'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nkalima = 'عمل'\nprint(kalima.find('ر'))\nprint(kalima[0])\nprint(kalima.count('ر'))\n```\nالجواب:", "qhash": "f87b40750b18799f", "answer": "-1\nع\n0", "completion": " الناتج:\n```text\n-1\nع\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "top_divisible", "reference": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert top_divisible([60, 47, -22, -10, -15, 16, 43, -18, -5]) == 60", "assert top_divisible([-24, -30, -24]) == -24", "assert top_divisible([1, 7, 13]) == None", "assert top_divisible([-27, -21, 9, 26, 12, -7, 14, -32]) == 12", "assert top_divisible([24, -9, -39, 10, 42]) == 42", "assert top_divisible([]) == None"], "test_code": "assert top_divisible([60, 47, -22, -10, -15, 16, 43, -18, -5]) == 60\nassert top_divisible([-24, -30, -24]) == -24\nassert top_divisible([1, 7, 13]) == None\nassert top_divisible([-27, -21, 9, 26, 12, -7, 14, -32]) == 12\nassert top_divisible([24, -9, -39, 10, 42]) == 42\nassert top_divisible([]) == None", "answer": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 6 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 6 != 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة arr يقبل القسمة على 6، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef top_divisible(arr):\n    best = None\n    for x in arr:\n        if x % 6 != 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `top_divisible([60, 47, -22, -10, -15, 16, 43, -18, -5]) == 60`\nالجواب:", "qhash": "e5d3c75515d1c164"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "arabic_text", "template": "w_count_letter#2", "entry": "count_hits", "reference": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))", "tests": ["assert count_hits('نهر مكتبة مدينة مدينة') == 0", "assert count_hits('مكتبة عمل علم حصان قلم') == 0", "assert count_hits('معلم سفينة كتاب نهار') == 0", "assert count_hits('مطر باب سلام معلم قهوة') == 0", "assert count_hits('باب ليل') == 0", "assert count_hits('علم قلم سماء حديقة برتقال') == 0", "assert count_hits('معلم عربية حاسوب نهر خبز') == 0", "assert count_hits('') == 0"], "test_code": "assert count_hits('نهر مكتبة مدينة مدينة') == 0\nassert count_hits('مكتبة عمل علم حصان قلم') == 0\nassert count_hits('معلم سفينة كتاب نهار') == 0\nassert count_hits('مطر باب سلام معلم قهوة') == 0\nassert count_hits('باب ليل') == 0\nassert count_hits('علم قلم سماء حديقة برتقال') == 0\nassert count_hits('معلم عربية حاسوب نهر خبز') == 0\nassert count_hits('') == 0", "answer": "def count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))", "completion": " ```python\ndef count_hits(text):\n    return sum(1 for w in text.split() if w.startswith('ج'))\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف دالة اسمها `count_hits` تستقبل سلسلة نصية عربية text، والمطلوب أن تحسب وتُرجع عدد الكلمات (المفصولة بمسافات) التي تبدأ بالحرف «ج».\nمثال: `count_hits('نهر مكتبة مدينة مدينة') == 0`\nالجواب:", "qhash": "4dd21585e7ad2492"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_poly#2", "entry": "value_at", "reference": "def value_at(x):\n    return 8 * x ** 2 + (0) * x + (-1)", "tests": ["assert value_at(3) == 71", "assert value_at(-20) == 3199", "assert value_at(-19) == 2887", "assert value_at(-15) == 1799", "assert value_at(-16) == 2047", "assert value_at(-2) == 31", "assert value_at(19) == 2887", "assert value_at(0) == -1"], "test_code": "assert value_at(3) == 71\nassert value_at(-20) == 3199\nassert value_at(-19) == 2887\nassert value_at(-15) == 1799\nassert value_at(-16) == 2047\nassert value_at(-2) == 31\nassert value_at(19) == 2887\nassert value_at(0) == -1", "answer": "def value_at(x):\n    return 8 * x ** 2 + (0) * x + (-1)", "completion": " ```python\ndef value_at(x):\n    return 8 * x ** 2 + (0) * x + (-1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `value_at` التي تستقبل عددًا صحيحًا x وتعيد قيمة الدالة التربيعية p(x) = 8x² + 0x - 1.\nمثال: `value_at(3) == 71`\nالجواب:", "qhash": "6657734746cce126"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "s = 'rocket_pixel'\nprint(s.replace('o', '#'))\nprint(s.upper())\nprint(len(s))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\ns = 'rocket_pixel'\nprint(s.replace('o', '#'))\nprint(s.upper())\nprint(len(s))\n```\nالجواب:", "qhash": "5b57ca3ccd8984e5", "answer": "r#cket_pixel\nROCKET_PIXEL\n12", "completion": " الناتج:\n```text\nr#cket_pixel\nROCKET_PIXEL\n12\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "while_loop", "template": "p_while#2", "code": "x = 81\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nx = 81\ncount = 0\nwhile x != 1:\n    if x % 2 == 0:\n        x = x // 2\n    else:\n        x = 3 * x + 1\n    count += 1\nprint(count)\n```\nالجواب:", "qhash": "a2aa5a82a3eef673", "answer": "22", "completion": " الناتج:\n```text\n22\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_sum_mult#2", "entry": "add_multiples", "reference": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)", "tests": ["assert add_multiples(60) == 668", "assert add_multiples(74) == 1068", "assert add_multiples(50) == 450", "assert add_multiples(207) == 8088", "assert add_multiples(290) == 16026", "assert add_multiples(27) == 122", "assert add_multiples(1) == 0"], "test_code": "assert add_multiples(60) == 668\nassert add_multiples(74) == 1068\nassert add_multiples(50) == 450\nassert add_multiples(207) == 8088\nassert add_multiples(290) == 16026\nassert add_multiples(27) == 122\nassert add_multiples(1) == 0", "answer": "def add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)", "completion": " ```python\ndef add_multiples(n):\n    return sum(x for x in range(1, n) if x % 3 == 0 or x % 14 == 0)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب دالة بايثون اسمها `add_multiples` تستقبل عددًا صحيحًا n، وتعيد حاصل جمع الأعداد من 1 إلى n−1 التي يقسمها 3 أو 14 دون باقٍ.\nمثال: `add_multiples(60) == 668`\nالجواب:", "qhash": "acba5f0859838886"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "strings", "template": "w_caesar#2", "entry": "rot", "reference": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "tests": ["assert rot('of coffee is') == 'ja xjaazz dn'", "assert rot('desert') == 'yznzmo'", "assert rot('engine code in python go') == 'zibdiz xjyz di ktocji bj'", "assert rot('brain') == 'wmvdi'", "assert rot('winter 2024') == 'rdiozm 2024'", "assert rot('pixel') == 'kdszg'", "assert rot('') == ''"], "test_code": "assert rot('of coffee is') == 'ja xjaazz dn'\nassert rot('desert') == 'yznzmo'\nassert rot('engine code in python go') == 'zibdiz xjyz di ktocji bj'\nassert rot('brain') == 'wmvdi'\nassert rot('winter 2024') == 'rdiozm 2024'\nassert rot('pixel') == 'kdszg'\nassert rot('') == ''", "answer": "def rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)", "completion": " ```python\ndef rot(s):\n    out = []\n    for c in s:\n        if 'a' <= c <= 'z':\n            out.append(chr((ord(c) - 97 + (21)) % 26 + 97))\n        else:\n            out.append(c)\n    return ''.join(out)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `rot` التي تستقبل نصًا s وتعيد نصًا جديدًا بعد إزاحة كل حرف إنجليزي صغير (a-z) 21 مواقع إلى الأمام في الأبجدية (مع الالتفاف من z إلى a)، وتبقى بقية المحارف (الأحرف الكبيرة والأرقام والمسافات والرموز) كما هي.\nمثال: `rot('of coffee is') == 'ja xjaazz dn'`\nالجواب:", "qhash": "414417c54ceac99f"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "strings", "template": "p_str#2", "code": "name = 'camel'\nprint(name[::-1])\nprint(len(name))\nprint(name.find('c'))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nname = 'camel'\nprint(name[::-1])\nprint(len(name))\nprint(name.find('c'))\n```\nالجواب:", "qhash": "8fc8963c75239759", "answer": "lemac\n5\n0", "completion": " الناتج:\n```text\nlemac\n5\n0\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "recursion", "template": "c_rec_mod#2", "entry": "mfact", "reference": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 997", "tests": ["assert mfact(9) == 162", "assert mfact(48) == 651", "assert mfact(17) == 70", "assert mfact(19) == 887", "assert mfact(34) == 453", "assert mfact(26) == 717", "assert mfact(0) == 1"], "test_code": "assert mfact(9) == 162\nassert mfact(48) == 651\nassert mfact(17) == 70\nassert mfact(19) == 887\nassert mfact(34) == 453\nassert mfact(26) == 717\nassert mfact(0) == 1", "answer": "def mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 997", "completion": " ```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return (n * mfact(n - 3)) % 997\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تحسب الدالة تعاوديًا (بالاستدعاء الذاتي) حاصل الضرب n × (n−3) × (n−6) × … للحدود الموجبة، مع أخذ باقي القسمة على 997 في كل خطوة (وتُرجع 1 عندما n ≤ 0). اكتب الحل كاملًا.\n```python\ndef mfact(n):\n    if n <= 0:\n        return 1\n    return ____\n```\nمثال: `mfact(9) == 162`\nالجواب:", "qhash": "cee537a210081fe7"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "complete_function", "topic": "lists", "template": "c_rotate#2", "entry": "cycle", "reference": "def cycle(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[k:] + items[:k]", "tests": ["assert cycle([21, 7, 42]) == [42, 21, 7]", "assert cycle([9, 24, 22, 16, 38, 26, 38, 8, 25, 14, -3]) == [25, 14, -3, 9, 24, 22, 16, 38, 26, 38, 8]", "assert cycle([1, 41, 37, 18, 41, 11, 42, 40, 22]) == [22, 1, 41, 37, 18, 41, 11, 42, 40]", "assert cycle([41, 13, 13, 46, 46, 27]) == [13, 46, 46, 27, 41, 13]", "assert cycle([23, 27, 10, 21, 41, 8, 13, 31, 23, 25, 34]) == [23, 25, 34, 23, 27, 10, 21, 41, 8, 13, 31]", "assert cycle([2, 9, 35, 23, 40, -8, 44, 47, 19, 33, -1]) == [19, 33, -1, 2, 9, 35, 23, 40, -8, 44, 47]", "assert cycle([]) == []"], "test_code": "assert cycle([21, 7, 42]) == [42, 21, 7]\nassert cycle([9, 24, 22, 16, 38, 26, 38, 8, 25, 14, -3]) == [25, 14, -3, 9, 24, 22, 16, 38, 26, 38, 8]\nassert cycle([1, 41, 37, 18, 41, 11, 42, 40, 22]) == [22, 1, 41, 37, 18, 41, 11, 42, 40]\nassert cycle([41, 13, 13, 46, 46, 27]) == [13, 46, 46, 27, 41, 13]\nassert cycle([23, 27, 10, 21, 41, 8, 13, 31, 23, 25, 34]) == [23, 25, 34, 23, 27, 10, 21, 41, 8, 13, 31]\nassert cycle([2, 9, 35, 23, 40, -8, 44, 47, 19, 33, -1]) == [19, 33, -1, 2, 9, 35, 23, 40, -8, 44, 47]\nassert cycle([]) == []", "answer": "def cycle(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[k:] + items[:k]", "completion": " ```python\ndef cycle(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return items[k:] + items[:k]\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: المطلوب إكمال الشيفرة التالية (استبدل ____ بالتعبير الصحيح) حتى تُرجع الدالة القائمة بعد تدويرها 8 مواقع إلى اليسار (العنصر الأول ينتقل إلى النهاية في كل خطوة). اكتب الحل كاملًا.\n```python\ndef cycle(items):\n    if not items:\n        return []\n    k = 8 % len(items)\n    return ____\n```\nمثال: `cycle([21, 7, 42]) == [42, 21, 7]`\nالجواب:", "qhash": "adef5d0e609d58de"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "loops", "template": "f_power_sum#2", "entry": "series", "reference": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 4\n    return total", "tests": ["assert series(8) == 35088", "assert series(13) == 357084", "assert series(2) == 68", "assert series(3) == 392", "assert series(5) == 3916", "assert series(1) == 4", "assert series(0) == 0"], "test_code": "assert series(8) == 35088\nassert series(13) == 357084\nassert series(2) == 68\nassert series(3) == 392\nassert series(5) == 3916\nassert series(1) == 4\nassert series(0) == 0", "answer": "def series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 4\n    return total", "completion": " ```python\ndef series(n):\n    total = 0\n    for i in range(1, n + 1):\n        total += 4 * i ** 4\n    return total\n```\n", "buggy": "def series(n):\n    total = 0\n    for i in range(0, n):\n        total += 4 * i ** 4\n    return total", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع مجموع 4 × i^4 لكل عدد صحيح i من 1 إلى n (شاملًا n)؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef series(n):\n    total = 0\n    for i in range(0, n):\n        total += 4 * i ** 4\n    return total\n```\nمثال: `series(8) == 35088`\nالجواب:", "qhash": "4eff58c1db6d61c8"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "dict", "template": "w_char_freq#2", "entry": "letter_stats", "reference": "def letter_stats(s):\n    return {c: s.count(c) for c in 'mos'}", "tests": ["assert letter_stats('python signal desert summer camel brain') == {'m': 3, 'o': 1, 's': 3}", "assert letter_stats('pixel code coffee rocket') == {'m': 0, 'o': 3, 's': 0}", "assert letter_stats('go') == {'m': 0, 'o': 1, 's': 0}", "assert letter_stats('on banana of to') == {'m': 0, 'o': 3, 's': 0}", "assert letter_stats('winter matrix falcon') == {'m': 1, 'o': 1, 's': 0}", "assert letter_stats('apple winter we by a') == {'m': 0, 'o': 0, 's': 0}", "assert letter_stats('') == {'m': 0, 'o': 0, 's': 0}"], "test_code": "assert letter_stats('python signal desert summer camel brain') == {'m': 3, 'o': 1, 's': 3}\nassert letter_stats('pixel code coffee rocket') == {'m': 0, 'o': 3, 's': 0}\nassert letter_stats('go') == {'m': 0, 'o': 1, 's': 0}\nassert letter_stats('on banana of to') == {'m': 0, 'o': 3, 's': 0}\nassert letter_stats('winter matrix falcon') == {'m': 1, 'o': 1, 's': 0}\nassert letter_stats('apple winter we by a') == {'m': 0, 'o': 0, 's': 0}\nassert letter_stats('') == {'m': 0, 'o': 0, 's': 0}", "answer": "def letter_stats(s):\n    return {c: s.count(c) for c in 'mos'}", "completion": " ```python\ndef letter_stats(s):\n    return {c: s.count(c) for c in 'mos'}\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `letter_stats` التي تستقبل سلسلة s وتعيد قاموس تكرارات للمحارف 'm'، 'o'، 's' فقط (كل محرف ← عدد مرات وجوده، ولو كان 0).\nمثال: `letter_stats('python signal desert summer camel brain') == {'m': 3, 'o': 1, 's': 3}`\nالجواب:", "qhash": "5cfa544529ed6f9c"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_multiple", "reference": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_multiple([40, 28, -3, 60, -15, -7]) == 28", "assert max_multiple([-21, -14, -21]) == -14", "assert max_multiple([1, 8, 15, 22]) == None", "assert max_multiple([27, -24, 4, -12, 10]) == None", "assert max_multiple([-22, -17, -50, -13, -20, 14, -34, 40, 17]) == 14", "assert max_multiple([]) == None"], "test_code": "assert max_multiple([40, 28, -3, 60, -15, -7]) == 28\nassert max_multiple([-21, -14, -21]) == -14\nassert max_multiple([1, 8, 15, 22]) == None\nassert max_multiple([27, -24, 4, -12, 10]) == None\nassert max_multiple([-22, -17, -50, -13, -20, 14, -34, 40, 17]) == 14\nassert max_multiple([]) == None", "answer": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_multiple(values):\n    best = None\n    for x in values:\n        if x % 7 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_multiple(values):\n    best = None\n    for x in values:\n        if x % 7 == 0 and (best is None or x < best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 7، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_multiple(values):\n    best = None\n    for x in values:\n        if x % 7 == 0 and (best is None or x < best):\n            best = x\n    return best\n```\nمثال: `max_multiple([40, 28, -3, 60, -15, -7]) == 28`\nالجواب:", "qhash": "72b9f9c6cf2e20cb"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "fix_bug", "topic": "lists", "template": "f_max_div#2", "entry": "max_of_div", "reference": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "tests": ["assert max_of_div([-9, 9, 50, -13, -22, 53, 42, 39, -4]) == 50", "assert max_of_div([-6, -4, -2]) == -2", "assert max_of_div([1, 3, 5]) == None", "assert max_of_div([]) == None", "assert max_of_div([18, -37, -27, 11, 15, 16]) == 18", "assert max_of_div([]) == None"], "test_code": "assert max_of_div([-9, 9, 50, -13, -22, 53, 42, 39, -4]) == 50\nassert max_of_div([-6, -4, -2]) == -2\nassert max_of_div([1, 3, 5]) == None\nassert max_of_div([]) == None\nassert max_of_div([18, -37, -27, 11, 15, 16]) == 18\nassert max_of_div([]) == None", "answer": "def max_of_div(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "completion": " ```python\ndef max_of_div(values):\n    best = None\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\n", "buggy": "def max_of_div(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: صحّح الدالة التالية لكي تُرجع أكبر عنصر في القائمة values يقبل القسمة على 2، أو None إذا لم يوجد مثل هذا العنصر؛ فهي حاليًا تُعطي نتائج خاطئة في بعض الحالات. اكتب النسخة المصحّحة كاملة.\n```python\ndef max_of_div(values):\n    best = 0\n    for x in values:\n        if x % 2 == 0 and (best is None or x > best):\n            best = x\n    return best\n```\nمثال: `max_of_div([-9, 9, 50, -13, -22, 53, 42, 39, -4]) == 50`\nالجواب:", "qhash": "6eb4b850b80595d2"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "predict_output", "topic": "list_comprehension", "template": "p_comp#2", "code": "out = [(x + 3) // 2 for x in range(6, 20) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: نفّذ المقطع البرمجي الآتي في ذهنك، ثم اكتب بدقة كل ما سيُطبع سطرًا بسطر:\n```python\nout = [(x + 3) // 2 for x in range(6, 20) if x % 2 == 0]\nprint(out)\nprint(len(out), sum(out))\n```\nالجواب:", "qhash": "c927531ae4c1d383", "answer": "[4, 5, 6, 7, 8, 9, 10]\n7 49", "completion": " الناتج:\n```text\n[4, 5, 6, 7, 8, 9, 10]\n7 49\n```\n"}
{"task": "code", "src": "a11_code_gen", "lang": "python", "kind": "write_function", "topic": "math", "template": "w_coprime#2", "entry": "count_gcd1", "reference": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)", "tests": ["assert count_gcd1(14) == 5", "assert count_gcd1(25) == 9", "assert count_gcd1(170) == 57", "assert count_gcd1(41) == 14", "assert count_gcd1(89) == 30", "assert count_gcd1(98) == 33", "assert count_gcd1(1) == 1"], "test_code": "assert count_gcd1(14) == 5\nassert count_gcd1(25) == 9\nassert count_gcd1(170) == 57\nassert count_gcd1(41) == 14\nassert count_gcd1(89) == 30\nassert count_gcd1(98) == 33\nassert count_gcd1(1) == 1", "answer": "def count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)", "completion": " ```python\ndef count_gcd1(n):\n    from math import gcd\n    return sum(1 for i in range(1, n + 1) if gcd(i, 18) == 1)\n```\n", "prompt": "المهمة: حل مهمة البرمجة التالية بلغة بايثون.\nسؤال: عرّف الدالة `count_gcd1` التي تستقبل n وتعيد كم عددًا بين 1 وn لا يشترك مع العدد 18 في أي قاسم أكبر من 1.\nمثال: `count_gcd1(14) == 5`\nالجواب:", "qhash": "22f086020e558cba"}